6 files changed, 22 insertions, 22 deletions
diff --git a/prolog/problems/clp_fd/gcd_3/en.py b/prolog/problems/clp_fd/gcd_3/en.py
index 7953eb1..8891d54 100644
--- a/prolog/problems/clp_fd/gcd_3/en.py
+++ b/prolog/problems/clp_fd/gcd_3/en.py
@@ -7,8 +7,8 @@ description = '''\
 <p><code>gcd(X, Y, GCD)</code>: <code>GCD</code> is the greatest common divisor of <code>X</code> and <code>Y</code>. Implement this predicate using constraints.</p>
 <p>Hint: try writing a predicate to find <em>all</em> common divisors of two numbers first.</p>
 <pre>
-  ?- gcd(36, 84, GCD).
-    GCD = 12.
+?- gcd(36, 84, GCD).
+  GCD = 12.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/gcd_3/sl.py b/prolog/problems/clp_fd/gcd_3/sl.py
index 9ef1a87..f5016fa 100644
--- a/prolog/problems/clp_fd/gcd_3/sl.py
+++ b/prolog/problems/clp_fd/gcd_3/sl.py
@@ -7,8 +7,8 @@ description = '''\
 <p><code>gcd(X, Y, GCD)</code>: <code>GCD</code> je največji skupni delitelj števil <code>X</code> in <code>Y</code>. Implementiraj ta predikat z uporabo omejitev.</p>
 <p>Namig: poskusi najprej napisati predikat, ki poišče <em>vse</em> skupne delitelje dveh števil.</p>
 <pre>
-  ?- gcd(36, 84, GCD).
-    GCD = 12.
+?- gcd(36, 84, GCD).
+  GCD = 12.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/magic_1/en.py b/prolog/problems/clp_fd/magic_1/en.py
index c8b5a1a..0798164 100644
--- a/prolog/problems/clp_fd/magic_1/en.py
+++ b/prolog/problems/clp_fd/magic_1/en.py
@@ -6,9 +6,9 @@ slug = 'generate a 3x3 magic square'
 description = '''\
 <p><code>magic(S)</code>: the list <code>S</code> represents a 3×3 magic square (<code>S</code> is a permutation of numbers 1 to 9 - three numbers for each row). The sums of numbers in each row, column and diagonal of a magic squre are equal. Implement this predicate using constraints. Your code should return all possible solutions.</p>
 <pre>
-  ?- magic(S).
-    S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
-    …
+?- magic(S).
+  S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
+  …
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/magic_1/sl.py b/prolog/problems/clp_fd/magic_1/sl.py
index 8cf040e..fa73a01 100644
--- a/prolog/problems/clp_fd/magic_1/sl.py
+++ b/prolog/problems/clp_fd/magic_1/sl.py
@@ -6,9 +6,9 @@ slug = '3x3 magični kvadrat'
 description = '''\
 <p><code>magic(S)</code>: seznam <code>S</code> predstavlja 3×3 magični kvadrat (<code>S</code> je permutacija števil 1 do 9 -- tri števila tvorijo eno vrstico). Vsote števil v vsaki vrstici, stolpcu in glavni diagonali magičnega kvadrata so enake. Implementiraj ta predikat z uporabo omejitev. Predikat naj vrne vse rešitve, eno po eno.</p>
 <pre>
-  ?- magic(S).
-    S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
-    …
+?- magic(S).
+  S = [2, 7, 6, 9, 5, 1, 4, 3, 8] ;
+  …
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/tobase_3/en.py b/prolog/problems/clp_fd/tobase_3/en.py
index c05ab2a..41f8889 100644
--- a/prolog/problems/clp_fd/tobase_3/en.py
+++ b/prolog/problems/clp_fd/tobase_3/en.py
@@ -6,12 +6,12 @@ slug = 'convert numbers from/to the decimal system'
 description = '''\
 <p><code>tobase(Number, B, X)</code>: given a <code>Number</code> in the decimal system (base 10), <code>X</code> represents the same number in the system with base <code>B</code>. Implement this predicate using constraints. Limit the value of <code>B</code> to the interval [2..10].</p>
 <pre>
-  ?- tobase(42, 2, X).
-    X = 101010.
-  ?- tobase(N, 2, 101010).
-    N = 42.
-  ?- tobase(42, B, 101010).
-    B = 2.
+?- tobase(42, 2, X).
+  X = 101010.
+?- tobase(N, 2, 101010).
+  N = 42.
+?- tobase(42, B, 101010).
+  B = 2.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/tobase_3/sl.py b/prolog/problems/clp_fd/tobase_3/sl.py
index a775808..72879af 100644
--- a/prolog/problems/clp_fd/tobase_3/sl.py
+++ b/prolog/problems/clp_fd/tobase_3/sl.py
@@ -6,12 +6,12 @@ slug = 'Pretvori števila v/iz desetiškega sistema'
 description = '''\
 <p><code>tobase(Number, B, X)</code>: število <code>Number</code> je v desetiškem sistemu. <code>X</code> predstavlja to število v sistemu z bazo <code>B</code>. Implementiraj predikat z uporabo omejitev. Omeji vrednost <code>B</code> na interval [2..10].</p>
 <pre>
-  ?- tobase(42, 2, X).
-    X = 101010.
-  ?- tobase(N, 2, 101010).
-    N = 42.
-  ?- tobase(42, B, 101010).
-    B = 2.
+?- tobase(42, 2, X).
+  X = 101010.
+?- tobase(N, 2, 101010).
+  N = 42.
+?- tobase(42, B, 101010).
+  B = 2.
 </pre>'''
 
 hint = {}