Update URL Link

frankvegadelgado · Dec 4, 2024 · 1e9a11a · 1e9a11a
1 parent 3974b53
commit 1e9a11a
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/README.md b/README.md
@@ -7,7 +7,7 @@ Instance: A Boolean formula $\phi$ in CNF.
 
 Question: Is $\phi$ satisfiable?
 
-**Note: This problem is NP-complete (If any NP-complete can be solved in polynomial time, then $P = NP$)**.
+**Note: This problem is NP-complete (If any NP-complete can be solved in polynomial time, then P = NP)**.
 
 # Theory
 
@@ -25,7 +25,7 @@ Answer: Satisfiable. The formula is satisfiable when all variables are assigned
 Input of this project
 -----
 
-The input is on [DIMACS](http://www.satcompetition.org/2009/format-benchmarks2009.html) formula with the extension .cnf.
+The input is on [DIMACS](https://jix.github.io/varisat/manual/0.2.0/formats/dimacs.html) formula with the extension .cnf.
 
 The **file.cnf** on DIMACS format for $(x_{1} \vee \neg x_{3} \vee \neg x_{2}) \wedge (x_{3} \vee x_{2} \vee x_{4})$ is
 ```  

diff --git a/docs/index.html b/docs/index.html
@@ -27,7 +27,7 @@ <h1>CAPABLANCA| SAT Solver</h1>
 <h1>SAT Problem</h1>
 <p>Instance: A Boolean formula $\phi$ in CNF.</p>
 <p>Question: Is $\phi$ satisfiable?</p>
-<p><strong>Note: This problem is NP-complete (If any NP-complete can be solved in polynomial time, then $P = NP$)</strong>.</p>
+<p><strong>Note: This problem is NP-complete (If any NP-complete can be solved in polynomial time, then P = NP)</strong>.</p>
 <h1>Theory</h1>
 <ul>
 <li>
@@ -41,7 +41,7 @@ <h2>Example</h2>
 <p>Instance: The Boolean formula $(x_{1} \vee \neg x_{3} \vee \neg x_{2}) \wedge (x_{3} \vee x_{2} \vee x_{4})$ where $\vee$ (OR), $\wedge$ (AND) and $\neg$ (NEGATION) are the logic operations.</p>
 <p>Answer: Satisfiable. The formula is satisfiable when all variables are assigned the value &quot;true,&quot; resulting in a satisfying truth assignment.</p>
 <h2>Input of this project</h2>
-<p>The input is on <a href="http://www.satcompetition.org/2009/format-benchmarks2009.html">DIMACS</a> formula with the extension .cnf.</p>
+<p>The input is on <a href="https://jix.github.io/varisat/manual/0.2.0/formats/dimacs.html">DIMACS</a> formula with the extension .cnf.</p>
 <p>The <strong>file.cnf</strong> on DIMACS format for $(x_{1} \vee \neg x_{3} \vee \neg x_{2}) \wedge (x_{3} \vee x_{2} \vee x_{4})$ is</p>
 <pre><code>p cnf 4 2
 1 -3 -2 0