Remove space-padding from <pre> blocks

36 files changed, 156 insertions, 156 deletions

diff --git a/prolog/problems/lists/conc_3/en.py b/prolog/problems/lists/conc_3/en.py
index 7399f7e..ba1a571 100644
--- a/prolog/problems/lists/conc_3/en.py
+++ b/prolog/problems/lists/conc_3/en.py
@@ -6,10 +6,10 @@ slug = 'concatenate two lists'
 description = '''\
 <p><code>conc(L1, L2, L)</code>: the list <code>L</code> is obtained by appending the elements of <code>L2</code> to <code>L1</code>.</p>
 <pre>
-  ?- conc([1,2], [3,4], X).
-    X = [1,2,3,4].
-  ?- conc(X, [], [1,2,3]).
-    X = [1,2,3].
+?- conc([1,2], [3,4], X).
+  X = [1,2,3,4].
+?- conc(X, [], [1,2,3]).
+  X = [1,2,3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/conc_3/sl.py b/prolog/problems/lists/conc_3/sl.py
index 15e3163..211f65c 100644
--- a/prolog/problems/lists/conc_3/sl.py
+++ b/prolog/problems/lists/conc_3/sl.py
@@ -6,10 +6,10 @@ slug = 'Združi dva seznama (konkatenacija)'
 description = '''\
 <p><code>conc(L1, L2, L)</code>: seznam <code>L</code> dobiš tako, da seznamu <code>L1</code> na konec dodaš elemente seznama <code>L2</code>.</p>
 <pre>
-  ?- conc([1,2], [3,4], X).
-    X = [1,2,3,4].
-  ?- conc(X, [], [1,2,3]).
-    X = [1,2,3].
+?- conc([1,2], [3,4], X).
+  X = [1,2,3,4].
+?- conc(X, [], [1,2,3]).
+  X = [1,2,3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/count_3/en.py b/prolog/problems/lists/count_3/en.py
index c676dea..dd13bc0 100644
--- a/prolog/problems/lists/count_3/en.py
+++ b/prolog/problems/lists/count_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the number of occurrences of an element in list'
 description = '''\
 <p><code>count(X, L, N)</code>: <code>N</code> is the number of times the element <code>X</code> appears in the list <code>L</code>.</p>
 <pre>
-  ?- count(1, [1,2,1,3,1], N).
-    N = 3.
+?- count(1, [1,2,1,3,1], N).
+  N = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/count_3/sl.py b/prolog/problems/lists/count_3/sl.py
index 15a4650..98cd6f8 100644
--- a/prolog/problems/lists/count_3/sl.py
+++ b/prolog/problems/lists/count_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Preštej kolikokrat se element pojavi v seznamu'
 description = '''\
 <p><code>count(X, L, N)</code>: <code>N</code> je število kolikokrat se element <code>X</code> pojavi v seznamu <code>L</code>.</p>
 <pre>
-  ?- count(1, [1,2,1,3,1], N).
-    N = 3.
+?- count(1, [1,2,1,3,1], N).
+  N = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/del_3/en.py b/prolog/problems/lists/del_3/en.py
index d7e38e8..42ca19f 100644
--- a/prolog/problems/lists/del_3/en.py
+++ b/prolog/problems/lists/del_3/en.py
@@ -6,15 +6,15 @@ slug = 'delete an element from list'
 description = '''\
 <p><code>del(X, L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by deleting element <code>X</code>.</p>
 <pre>
-  ?- del(1, [1,2,3], L).
-    L = [2,3].
-  ?- del(2, [1,2,3,2,5], L).
-    L = [1,3,2,5] ;
-    L = [1,2,3,5].
-  ?- del(X, [1,2,3], L).
-    X = 1, L = [2,3] ;
-    X = 2, L = [1,3] ;
-    X = 3, L = [1,2].
+?- del(1, [1,2,3], L).
+  L = [2,3].
+?- del(2, [1,2,3,2,5], L).
+  L = [1,3,2,5] ;
+  L = [1,2,3,5].
+?- del(X, [1,2,3], L).
+  X = 1, L = [2,3] ;
+  X = 2, L = [1,3] ;
+  X = 3, L = [1,2].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/del_3/sl.py b/prolog/problems/lists/del_3/sl.py
index 49ab16f..3c45408 100644
--- a/prolog/problems/lists/del_3/sl.py
+++ b/prolog/problems/lists/del_3/sl.py
@@ -6,15 +6,15 @@ slug = 'Zbriši element iz seznama'
 description = '''\
 <p><code>del(X, L1, L2)</code>: seznam <code>L2</code> dobimo iz seznama <code>L1</code> tako da zbrišemo element <code>X</code>.</p>
 <pre>
-  ?- del(1, [1,2,3], L).
-    L = [2,3].
-  ?- del(2, [1,2,3,2,5], L).
-    L = [1,3,2,5] ;
-    L = [1,2,3,5].
-  ?- del(X, [1,2,3], L).
-    X = 1, L = [2,3] ;
-    X = 2, L = [1,3] ;
-    X = 3, L = [1,2].
+?- del(1, [1,2,3], L).
+  L = [2,3].
+?- del(2, [1,2,3,2,5], L).
+  L = [1,3,2,5] ;
+  L = [1,2,3,5].
+?- del(X, [1,2,3], L).
+  X = 1, L = [2,3] ;
+  X = 2, L = [1,3] ;
+  X = 3, L = [1,2].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/divide_3/en.py b/prolog/problems/lists/divide_3/en.py
index fded262..a22c8ac 100644
--- a/prolog/problems/lists/divide_3/en.py
+++ b/prolog/problems/lists/divide_3/en.py
@@ -6,10 +6,10 @@ slug = 'split a list into parts of roughly equal length'
 description = '''\
 <p><code>divide(L, L1, L2)</code>: the list <code>L1</code> contains elements at odd positions in <code>L</code>, and the list <code>L2</code> contains the elements at even positions in <code>L</code>.</p>
 <pre>
-  ?- divide([a,b,c,d,e,f,g], X, Y).
-    X = [a,c,e,g], Y = [b,d,f].
-  ?- divide([a,b,c,d,e,f], X, Y).
-    X = [a,c,e], Y = [b,d,f].
+?- divide([a,b,c,d,e,f,g], X, Y).
+  X = [a,c,e,g], Y = [b,d,f].
+?- divide([a,b,c,d,e,f], X, Y).
+  X = [a,c,e], Y = [b,d,f].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/divide_3/sl.py b/prolog/problems/lists/divide_3/sl.py
index ecf9a5a..308781e 100644
--- a/prolog/problems/lists/divide_3/sl.py
+++ b/prolog/problems/lists/divide_3/sl.py
@@ -6,10 +6,10 @@ slug = 'Razdeli dani seznam na dva podseznama (približno) enake velikosti'
 description = '''\
 <p><code>divide(L, L1, L2)</code>: seznam <code>L1</code> vsebuje elemente na lihih pozicijah v seznamu <code>L</code>, seznam <code>L2</code> pa elemente na sodih pozicijah v <code>L</code>.</p>
 <pre>
-  ?- divide([a,b,c,d,e,f,g], X, Y).
-    X = [a,c,e,g], Y = [b,d,f].
-  ?- divide([a,b,c,d,e,f], X, Y).
-    X = [a,c,e], Y = [b,d,f].
+?- divide([a,b,c,d,e,f,g], X, Y).
+  X = [a,c,e,g], Y = [b,d,f].
+?- divide([a,b,c,d,e,f], X, Y).
+  X = [a,c,e], Y = [b,d,f].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/dup_2/en.py b/prolog/problems/lists/dup_2/en.py
index c1d0c1a..b3f3f52 100644
--- a/prolog/problems/lists/dup_2/en.py
+++ b/prolog/problems/lists/dup_2/en.py
@@ -6,10 +6,10 @@ slug = 'duplicate the elements of a list'
 description = '''\
 <p><code>dup(L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by duplicating every element.</p>
 <pre>
-  ?- dup([1,2], X).
-    X = [1,1,2,2].
-  ?- dup([1,2,3], X).
-    X = [1,1,2,2,3,3].
+?- dup([1,2], X).
+  X = [1,1,2,2].
+?- dup([1,2,3], X).
+  X = [1,1,2,2,3,3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/dup_2/sl.py b/prolog/problems/lists/dup_2/sl.py
index fc974d8..7d8532d 100644
--- a/prolog/problems/lists/dup_2/sl.py
+++ b/prolog/problems/lists/dup_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Podvoji vse elemente v seznamu'
 description = '''\
 <p><code>dup(L1, L2)</code>: seznam <code>L2</code> dobimo iz <code>L1</code> tako, da podvojimo vsak element.</p>
 <pre>
-  ?- dup([1,2], X).
-    X = [1,1,2,2].
-  ?- dup([1,2,3], X).
-    X = [1,1,2,2,3,3].
+?- dup([1,2], X).
+  X = [1,1,2,2].
+?- dup([1,2,3], X).
+  X = [1,1,2,2,3,3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/evenlen_1_+_oddlen_1/en.py b/prolog/problems/lists/evenlen_1_+_oddlen_1/en.py
index 1ac7990..a01a41b 100644
--- a/prolog/problems/lists/evenlen_1_+_oddlen_1/en.py
+++ b/prolog/problems/lists/evenlen_1_+_oddlen_1/en.py
@@ -7,12 +7,12 @@ description = '''\
 <p><code>evenlen(L)</code>: the list <code>L</code> has an even number of elements.<br />
 <code>oddlen(L)</code>: the list <code>L</code> has an odd number of elements.</p>
 <pre>
-  ?- oddlen([1,2,3,4,5]).
-    true.
-  ?- oddlen([1,2,3,4]).
-    false.
-  ?- evenlen([1,2,3,4]).
-    true.
+?- oddlen([1,2,3,4,5]).
+  true.
+?- oddlen([1,2,3,4]).
+  false.
+?- evenlen([1,2,3,4]).
+  true.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/evenlen_1_+_oddlen_1/sl.py b/prolog/problems/lists/evenlen_1_+_oddlen_1/sl.py
index 1959877..4ca44c2 100644
--- a/prolog/problems/lists/evenlen_1_+_oddlen_1/sl.py
+++ b/prolog/problems/lists/evenlen_1_+_oddlen_1/sl.py
@@ -7,12 +7,12 @@ description = '''\
 <p><code>evenlen(L)</code>: seznam <code>L</code> ima sodo število elementov.<br />
 <code>oddlen(L)</code>: seznam <code>L</code> ima liho število elementov.</p>
 <pre>
-  ?- oddlen([1,2,3,4,5]).
-    true.
-  ?- oddlen([1,2,3,4]).
-    false.
-  ?- evenlen([1,2,3,4]).
-    true.
+?- oddlen([1,2,3,4,5]).
+  true.
+?- oddlen([1,2,3,4]).
+  false.
+?- evenlen([1,2,3,4]).
+  true.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/insert_3/en.py b/prolog/problems/lists/insert_3/en.py
index 6a3da54..c4640ab 100644
--- a/prolog/problems/lists/insert_3/en.py
+++ b/prolog/problems/lists/insert_3/en.py
@@ -6,10 +6,10 @@ slug = 'insert an element into list'
 description = '''\
 <p><code>insert(X, L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by inserting the element <code>X</code> at arbitrary position.</p>
 <pre>
-  ?- insert(1, [2,3], L).
-    L = [1,2,3] ;
-    L = [2,1,3] ;
-    L = [2,3,1].
+?- insert(1, [2,3], L).
+  L = [1,2,3] ;
+  L = [2,1,3] ;
+  L = [2,3,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/insert_3/sl.py b/prolog/problems/lists/insert_3/sl.py
index 08ffced..7db15a6 100644
--- a/prolog/problems/lists/insert_3/sl.py
+++ b/prolog/problems/lists/insert_3/sl.py
@@ -6,10 +6,10 @@ slug = 'Vstavi element na poljubno mesto v seznamu'
 description = '''\
 <p><code>insert(X, L1, L2)</code>: seznam <code>L2</code> dobimo iz <code>L1</code> tako, da vstavimo element <code>X</code> na poljubno mesto. Predikat naj vrne vse možne rešitve, eno za drugo.</p>
 <pre>
-  ?- insert(1, [2,3], L).
-    L = [1,2,3] ;
-    L = [2,1,3] ;
-    L = [2,3,1].
+?- insert(1, [2,3], L).
+  L = [1,2,3] ;
+  L = [2,1,3] ;
+  L = [2,3,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/len_2/en.py b/prolog/problems/lists/len_2/en.py
index 9de0060..3ca963e 100644
--- a/prolog/problems/lists/len_2/en.py
+++ b/prolog/problems/lists/len_2/en.py
@@ -6,8 +6,8 @@ slug = 'find the length of a list'
 description = '''\
 <p><code>len(L, Len)</code>: <code>Len</code> is the length of the list <code>L</code>.</p>
 <pre>
-  ?- len([1,2,3], Len).
-    Len = 3.
+?- len([1,2,3], Len).
+  Len = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/len_2/sl.py b/prolog/problems/lists/len_2/sl.py
index 5b9f05a..0e98272 100644
--- a/prolog/problems/lists/len_2/sl.py
+++ b/prolog/problems/lists/len_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Izračunaj dolžino danega seznama'
 description = '''\
 <p><code>len(L, Len)</code>: <code>Len</code> je dolžina seznama <code>L</code>.</p>
 <pre>
-  ?- len([1,2,3], Len).
-    Len = 3.
+?- len([1,2,3], Len).
+  Len = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/max_2/en.py b/prolog/problems/lists/max_2/en.py
index f851cd9..c4bc7e2 100644
--- a/prolog/problems/lists/max_2/en.py
+++ b/prolog/problems/lists/max_2/en.py
@@ -6,10 +6,10 @@ slug = 'find the largest element in list'
 description = '''\
 <p><code>max(L, Max)</code>: <code>Max</code> is the largest value in the list <code>L</code>.</p>
 <pre>
-  ?- max([5,4,1,6], M).
-    M = 6.
-  ?- max([3,2,2], M).
-    M = 3.
+?- max([5,4,1,6], M).
+  M = 6.
+?- max([3,2,2], M).
+  M = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/max_2/sl.py b/prolog/problems/lists/max_2/sl.py
index 81c354b..7a0d07a 100644
--- a/prolog/problems/lists/max_2/sl.py
+++ b/prolog/problems/lists/max_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Poišči največji element v danem seznamu'
 description = '''\
 <p><code>max(L, Max)</code>: <code>Max</code> je največji element v seznamu <code>L</code>.</p>
 <pre>
-  ?- max([5,4,1,6], M).
-    M = 6.
-  ?- max([3,2,2], M).
-    M = 3.
+?- max([5,4,1,6], M).
+  M = 6.
+?- max([3,2,2], M).
+  M = 3.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/memb_2/en.py b/prolog/problems/lists/memb_2/en.py
index 3fb20d3..2339c5d 100644
--- a/prolog/problems/lists/memb_2/en.py
+++ b/prolog/problems/lists/memb_2/en.py
@@ -6,12 +6,12 @@ slug = 'find elements in list'
 description = '''\
 <p><code>memb(M, L)</code>: <code>M</code> is an element of list <code>L</code>.</p>
 <pre>
-  ?- memb(X, [1,2,3]).
-    X = 1 ;
-    X = 2 ;
-    X = 3.
-  ?- memb(1, [3,2,X]).
-    X = 1.
+?- memb(X, [1,2,3]).
+  X = 1 ;
+  X = 2 ;
+  X = 3.
+?- memb(1, [3,2,X]).
+  X = 1.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/memb_2/sl.py b/prolog/problems/lists/memb_2/sl.py
index 540394b..382a776 100644
--- a/prolog/problems/lists/memb_2/sl.py
+++ b/prolog/problems/lists/memb_2/sl.py
@@ -6,12 +6,12 @@ slug = 'Preveri (poišči), če je dani element v seznamu'
 description = '''\
 <p><code>memb(E, L)</code>: <code>E</code> je element seznama <code>L</code>.</p>
 <pre>
-  ?- memb(X, [1,2,3]).
-    X = 1 ;
-    X = 2 ;
-    X = 3.
-  ?- memb(1, [3,2,X]).
-    X = 1.
+?- memb(X, [1,2,3]).
+  X = 1 ;
+  X = 2 ;
+  X = 3.
+?- memb(1, [3,2,X]).
+  X = 1.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/min_2/en.py b/prolog/problems/lists/min_2/en.py
index 2432be2..18f45a6 100644
--- a/prolog/problems/lists/min_2/en.py
+++ b/prolog/problems/lists/min_2/en.py
@@ -6,10 +6,10 @@ slug = 'find the smallest element'
 description = '''\
 <p><code>min(L, Min)</code>: <code>Min</code> is the smallest value in the list <code>L</code>.</p>
 <pre>
-  ?- min([5,4,1,6], M).
-    M = 1.
-  ?- min([3,2,2], M).
-    M = 2.
+?- min([5,4,1,6], M).
+  M = 1.
+?- min([3,2,2], M).
+  M = 2.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/min_2/sl.py b/prolog/problems/lists/min_2/sl.py
index 6a5964b..703a05e 100644
--- a/prolog/problems/lists/min_2/sl.py
+++ b/prolog/problems/lists/min_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Poišči najmanjši element v danem seznamu'
 description = '''\
 <p><code>min(L, Min)</code>: <code>Min</code> je najmanjši element v seznamu <code>L</code>.</p>
 <pre>
-  ?- min([5,4,1,6], M).
-    M = 1.
-  ?- min([3,2,2], M).
-    M = 2.
+?- min([5,4,1,6], M).
+  M = 1.
+?- min([3,2,2], M).
+  M = 2.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/palindrome_1/en.py b/prolog/problems/lists/palindrome_1/en.py
index 7f30f8e..48ee8ac 100644
--- a/prolog/problems/lists/palindrome_1/en.py
+++ b/prolog/problems/lists/palindrome_1/en.py
@@ -6,10 +6,10 @@ slug = 'check if list is a palindrome'
 description = '''\
 <p><code>palindrome(L)</code>: the elements of list <code>L</code> are the same when read from the front or back of the list.</p>
 <pre>
-  ?- palindrome([1,2,3,2,1]).
-    true.
-  ?- palindrome([1,2,3]).
-    false.
+?- palindrome([1,2,3,2,1]).
+  true.
+?- palindrome([1,2,3]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/palindrome_1/sl.py b/prolog/problems/lists/palindrome_1/sl.py
index 04f1f59..ad67d3f 100644
--- a/prolog/problems/lists/palindrome_1/sl.py
+++ b/prolog/problems/lists/palindrome_1/sl.py
@@ -6,10 +6,10 @@ slug = 'Preveri, če elementi seznama tvorijo palindrom'
 description = '''\
 <p><code>palindrome(L)</code>: Elementi seznama <code>L</code> se preberejo v istem vrstnem redu z začetka in s konca seznama.</p>
 <pre>
-  ?- palindrome([1,2,3,2,1]).
-    true.
-  ?- palindrome([1,2,3]).
-    false.
+?- palindrome([1,2,3,2,1]).
+  true.
+?- palindrome([1,2,3]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/permute_2/en.py b/prolog/problems/lists/permute_2/en.py
index 29d287f..b5dae76 100644
--- a/prolog/problems/lists/permute_2/en.py
+++ b/prolog/problems/lists/permute_2/en.py
@@ -6,13 +6,13 @@ slug = 'generate permutations of a list'
 description = '''\
 <p><code>permute(L1, L2)</code>: the list <code>L2</code> is a permutation of the elements of the list <code>L1</code>.</p>
 <pre>
-  ?- permute([1,2,3], L).
-    L = [1,2,3] ;
-    L = [1,3,2] ;
-    L = [2,1,3] ;
-    L = [2,3,1] ;
-    L = [3,1,2] ;
-    L = [3,2,1].
+?- permute([1,2,3], L).
+  L = [1,2,3] ;
+  L = [1,3,2] ;
+  L = [2,1,3] ;
+  L = [2,3,1] ;
+  L = [3,1,2] ;
+  L = [3,2,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/permute_2/sl.py b/prolog/problems/lists/permute_2/sl.py
index 2c98340..271b5d9 100644
--- a/prolog/problems/lists/permute_2/sl.py
+++ b/prolog/problems/lists/permute_2/sl.py
@@ -6,13 +6,13 @@ slug = 'Generiraj permutacije elementov v seznamu'
 description = '''\
 <p><code>permute(L1, L2)</code>: seznam <code>L2</code> je permutacija vrstnega reda elementov v seznamu <code>L1</code>.</p>
 <pre>
-  ?- permute([1,2,3], L).
-    L = [1,2,3] ;
-    L = [1,3,2] ;
-    L = [2,1,3] ;
-    L = [2,3,1] ;
-    L = [3,1,2] ;
-    L = [3,2,1].
+?- permute([1,2,3], L).
+  L = [1,2,3] ;
+  L = [1,3,2] ;
+  L = [2,1,3] ;
+  L = [2,3,1] ;
+  L = [3,1,2] ;
+  L = [3,2,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/rev_2/en.py b/prolog/problems/lists/rev_2/en.py
index 7941f9e..3ae126e 100644
--- a/prolog/problems/lists/rev_2/en.py
+++ b/prolog/problems/lists/rev_2/en.py
@@ -6,10 +6,10 @@ slug = 'reverse a list'
 description = '''\
 <p><code>rev(L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by reversing the order of the elements.</p>
 <pre>
-  ?- rev([1,2,3], X).
-    X = [3,2,1].
-  ?- rev([], X).
-    X = [].
+?- rev([1,2,3], X).
+  X = [3,2,1].
+?- rev([], X).
+  X = [].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/rev_2/sl.py b/prolog/problems/lists/rev_2/sl.py
index 95ba8b7..ab58a1c 100644
--- a/prolog/problems/lists/rev_2/sl.py
+++ b/prolog/problems/lists/rev_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Obrni seznam'
 description = '''\
 <p><code>rev(L1, L2)</code>: seznam <code>L2</code> ima elemente v obratnem vrstnem redu kot seznam <code>L1</code>.</p>
 <pre>
-  ?- rev([1,2,3], X).
-    X = [3,2,1].
-  ?- rev([], X).
-    X = [].
+?- rev([1,2,3], X).
+  X = [3,2,1].
+?- rev([], X).
+  X = [].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/shiftleft_2/en.py b/prolog/problems/lists/shiftleft_2/en.py
index a99b4a7..a8dd5f0 100644
--- a/prolog/problems/lists/shiftleft_2/en.py
+++ b/prolog/problems/lists/shiftleft_2/en.py
@@ -6,8 +6,8 @@ slug = 'shift a list left'
 description = '''\
 <p><code>shiftleft(L1, L2)</code>: the list <code>L2</code> is obtained from L1 by shifting elements to the left by one (circular shift).</p>
 <pre>
-  ?- shiftleft([1,2,3,4,5], X).
-    X = [2,3,4,5,1].
+?- shiftleft([1,2,3,4,5], X).
+  X = [2,3,4,5,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/shiftleft_2/sl.py b/prolog/problems/lists/shiftleft_2/sl.py
index 44e726f..ae412a6 100644
--- a/prolog/problems/lists/shiftleft_2/sl.py
+++ b/prolog/problems/lists/shiftleft_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Premakni elemente seznama za eno mesto v levo'
 description = '''\
 <p><code>shiftleft(L1, L2)</code>: elemente v seznamu <code>L1</code> za eno mesto premaknemo v levo ("circular shift").</p>
 <pre>
-  ?- shiftleft([1,2,3,4,5], X).
-    X = [2,3,4,5,1].
+?- shiftleft([1,2,3,4,5], X).
+  X = [2,3,4,5,1].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/shiftright_2/en.py b/prolog/problems/lists/shiftright_2/en.py
index 13384b0..63e11cf 100644
--- a/prolog/problems/lists/shiftright_2/en.py
+++ b/prolog/problems/lists/shiftright_2/en.py
@@ -6,8 +6,8 @@ slug = 'shift a list right'
 description = '''\
 <p><code>shiftright(L1, L2)</code>: the list <code>L2</code> is obtained from L1 by shifting elements to the right by one (circular shift).</p>
 <pre>
-  ?- shiftright([1,2,3,4,5], X).
-    X = [5,1,2,3,4].
+?- shiftright([1,2,3,4,5], X).
+  X = [5,1,2,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/shiftright_2/sl.py b/prolog/problems/lists/shiftright_2/sl.py
index 9d84510..62fca8d 100644
--- a/prolog/problems/lists/shiftright_2/sl.py
+++ b/prolog/problems/lists/shiftright_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Premakni elemente seznama za eno mesto v desno'
 description = '''\
 <p><code>shiftright(L1, L2)</code>: elemente v seznamu <code>L1</code> za eno mesto premaknemo v desno ("circular shift").</p>
 <pre>
-  ?- shiftright([1,2,3,4,5], X).
-    X = [5,1,2,3,4].
+?- shiftright([1,2,3,4,5], X).
+  X = [5,1,2,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/sublist_2/en.py b/prolog/problems/lists/sublist_2/en.py
index e761e19..2697d9b 100644
--- a/prolog/problems/lists/sublist_2/en.py
+++ b/prolog/problems/lists/sublist_2/en.py
@@ -6,14 +6,14 @@ slug = 'generate sublists of a list'
 description = '''\
 <p><code>sublist(L, SL)</code>: <code>SL</code> is a continuous sublist of the list <code>L</code>.</p>
 <pre>
-  ?- sublist([1,2,3], X).
-    X = [] ;
-    X = [1] ;
-    X = [1,2] ;
-    X = [1,2,3] ;
-    X = [2] ;
-    X = [2,3] ;
-    X = [3].
+?- sublist([1,2,3], X).
+  X = [] ;
+  X = [1] ;
+  X = [1,2] ;
+  X = [1,2,3] ;
+  X = [2] ;
+  X = [2,3] ;
+  X = [3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/sublist_2/sl.py b/prolog/problems/lists/sublist_2/sl.py
index 27d9b54..cc42219 100644
--- a/prolog/problems/lists/sublist_2/sl.py
+++ b/prolog/problems/lists/sublist_2/sl.py
@@ -6,14 +6,14 @@ slug = 'Generiraj vse podsezname danega seznama'
 description = '''\
 <p><code>sublist(L, SL)</code>: <code>SL</code> je podseznam seznama <code>L</code>. Predikat naj vrne vse možne podsezname, enega po enega.</p>
 <pre>
-  ?- sublist([1,2,3], X).
-    X = [] ;
-    X = [1] ;
-    X = [1,2] ;
-    X = [1,2,3] ;
-    X = [2] ;
-    X = [2,3] ;
-    X = [3].
+?- sublist([1,2,3], X).
+  X = [] ;
+  X = [1] ;
+  X = [1,2] ;
+  X = [1,2,3] ;
+  X = [2] ;
+  X = [2,3] ;
+  X = [3].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/sum_2/en.py b/prolog/problems/lists/sum_2/en.py
index fc4cea8..b4dab45 100644
--- a/prolog/problems/lists/sum_2/en.py
+++ b/prolog/problems/lists/sum_2/en.py
@@ -6,8 +6,8 @@ slug = 'find the sum of all elements in list'
 description = '''\
 <p><code>sum(L, Sum)</code>: <code>Sum</code> is the sum of all elements in the list <code>L</code>.</p>
 <pre>
-  ?- sum([1,2,3], Sum).
-    Sum = 6.
+?- sum([1,2,3], Sum).
+  Sum = 6.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/lists/sum_2/sl.py b/prolog/problems/lists/sum_2/sl.py
index 0e1e6d6..cc0423b 100644
--- a/prolog/problems/lists/sum_2/sl.py
+++ b/prolog/problems/lists/sum_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Izračunaj vsoto elementov v seznamu'
 description = '''\
 <p><code>sum(L, Sum)</code>: <code>Sum</code> je vsota vseh elementov v seznamu <code>L</code>.</p>
 <pre>
-  ?- sum([1,2,3], Sum).
-    Sum = 6.
+?- sum([1,2,3], Sum).
+  Sum = 6.
 </pre>'''
 
 hint = {}