Remove space-padding from <pre> blocks

14 files changed, 50 insertions, 50 deletions

diff --git a/prolog/problems/sets/diff_3/en.py b/prolog/problems/sets/diff_3/en.py
index 47def00..3c4cc97 100644
--- a/prolog/problems/sets/diff_3/en.py
+++ b/prolog/problems/sets/diff_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the difference of two sets'
 description = '''\
 <p><code>diff(S1, S2, D)</code>: the list <code>D</code> contains all elements of <code>S1</code> that don't appear in <code>S2</code>, with no duplicates.</p>
 <pre>
-  ?- diff([2,3,5,1,7,9], [3,7,4,5,6], D).
-    D = [2,1,9].
+?- diff([2,3,5,1,7,9], [3,7,4,5,6], D).
+  D = [2,1,9].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/diff_3/sl.py b/prolog/problems/sets/diff_3/sl.py
index d9b89e7..9923272 100644
--- a/prolog/problems/sets/diff_3/sl.py
+++ b/prolog/problems/sets/diff_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči razliko dveh množic'
 description = '''\
 <p><code>diff(S1, S2, D)</code>: seznam <code>D</code> vsebuje elemente iz <code>S1</code>, ki niso v <code>S2</code>.</p>
 <pre>
-  ?- diff([2,3,5,1,7,9], [3,7,4,5,6], D).
-    D = [2,1,9].
+?- diff([2,3,5,1,7,9], [3,7,4,5,6], D).
+  D = [2,1,9].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/intersect_3/en.py b/prolog/problems/sets/intersect_3/en.py
index fed5e34..fefc50a 100644
--- a/prolog/problems/sets/intersect_3/en.py
+++ b/prolog/problems/sets/intersect_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the intersection of two sets'
 description = '''\
 <p><code>intersect(S1, S2, I)</code>: the list <code>I</code> contains every element that appears in both <code>S1</code> and <code>S2</code>, with no duplicates.</p>
 <pre>
-  ?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
-    I = [1,5,3,4].
+?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
+  I = [1,5,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/intersect_3/sl.py b/prolog/problems/sets/intersect_3/sl.py
index a6af2d5..ac5501b 100644
--- a/prolog/problems/sets/intersect_3/sl.py
+++ b/prolog/problems/sets/intersect_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči presek dveh množic'
 description = '''\
 <p><code>intersect(S1, S2, I)</code>: seznam <code>I</code> vsebuje presek elementov v <code>S1</code> in <code>S2</code>.</p>
 <pre>
-  ?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
-    I = [1,5,3,4].
+?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
+  I = [1,5,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/is_subset_2/en.py b/prolog/problems/sets/is_subset_2/en.py
index ad4804c..00d15e6 100644
--- a/prolog/problems/sets/is_subset_2/en.py
+++ b/prolog/problems/sets/is_subset_2/en.py
@@ -6,10 +6,10 @@ slug = 'check if one set is a subset of another'
 description = '''\
 <p><code>is_subset(S1, S2)</code>: the set <code>S1</code> is a subset of <code>S2</code>.</p>
 <pre>
-  ?- is_subset([2,1,3,5,0], [3,2,1,4,5,9]).
-    false.
-  ?- is_subset([2,1,3,5], [3,2,1,4,5,9]).
-    true.
+?- is_subset([2,1,3,5,0], [3,2,1,4,5,9]).
+  false.
+?- is_subset([2,1,3,5], [3,2,1,4,5,9]).
+  true.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/is_subset_2/sl.py b/prolog/problems/sets/is_subset_2/sl.py
index ccec5b0..4119aaf 100644
--- a/prolog/problems/sets/is_subset_2/sl.py
+++ b/prolog/problems/sets/is_subset_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Preveri, če je prva množica podmnožica od druge'
 description = '''\
 <p><code>is_subset(S1, S2)</code>: množica <code>S1</code> je podmnožica od <code>S2</code>.</p>
 <pre>
-  ?- is_subset([2,1,3,5,0], [3,2,1,4,5,9]).
-    false.
-  ?- is_subset([2,1,3,5], [3,2,1,4,5,9]).
-    true.
+?- is_subset([2,1,3,5,0], [3,2,1,4,5,9]).
+  false.
+?- is_subset([2,1,3,5], [3,2,1,4,5,9]).
+  true.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/is_superset_2/en.py b/prolog/problems/sets/is_superset_2/en.py
index 464762c..df03caf 100644
--- a/prolog/problems/sets/is_superset_2/en.py
+++ b/prolog/problems/sets/is_superset_2/en.py
@@ -6,10 +6,10 @@ slug = 'check if one set is a superset of the other'
 description = '''\
 <p><code>is_superset(S1, S2)</code>: the set <code>S1</code> is a superset (contains all elements) of <code>S2</code>.</p>
 <pre>
-  ?- is_superset([3,2,1,4,5,9], [2,1,3,5]).
-    true.
-  ?- is_superset([3,2,1,4,5,9], [2,1,3,5,0]).
-    false.
+?- is_superset([3,2,1,4,5,9], [2,1,3,5]).
+  true.
+?- is_superset([3,2,1,4,5,9], [2,1,3,5,0]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/is_superset_2/sl.py b/prolog/problems/sets/is_superset_2/sl.py
index 77d0d9d..a8cc070 100644
--- a/prolog/problems/sets/is_superset_2/sl.py
+++ b/prolog/problems/sets/is_superset_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Preveri, če je prva množica nadmnožica od druge'
 description = '''\
 <p><code>is_superset(S1, S2)</code>: množica <code>S1</code> je nadmnožica (vsebuje vse elemente) od <code>S2</code>.</p>
 <pre>
-  ?- is_superset([3,2,1,4,5,9], [2,1,3,5]).
-    true.
-  ?- is_superset([3,2,1,4,5,9], [2,1,3,5,0]).
-    false.
+?- is_superset([3,2,1,4,5,9], [2,1,3,5]).
+  true.
+?- is_superset([3,2,1,4,5,9], [2,1,3,5,0]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/powerset_2/en.py b/prolog/problems/sets/powerset_2/en.py
index ad2fe87..dcc299c 100644
--- a/prolog/problems/sets/powerset_2/en.py
+++ b/prolog/problems/sets/powerset_2/en.py
@@ -6,8 +6,8 @@ slug = 'find all subsets of a set'
 description = '''\
 <p><code>powerset(Set, Powerset)</code>: the list <code>Powerset</code> contains all subsets of <code>Set</code>.</p>
 <pre>
-  ?- powerset([1,2,3], L).
-    L = [[1,2,3],[1,2],[1,3],[1],[2,3],[2],[3],[]].
+?- powerset([1,2,3], L).
+  L = [[1,2,3],[1,2],[1,3],[1],[2,3],[2],[3],[]].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/powerset_2/sl.py b/prolog/problems/sets/powerset_2/sl.py
index a782dee..4a092db 100644
--- a/prolog/problems/sets/powerset_2/sl.py
+++ b/prolog/problems/sets/powerset_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči potenčno množico od dane množice'
 description = '''\
 <p><code>powerset(Set, Powerset)</code>: množica <code>Powerset</code> vsebuje vse podmnožice od množice <code>Set</code>.</p>
 <pre>
-  ?- powerset([1,2,3], L).
-    L = [[1,2,3],[1,2],[1,3],[1],[2,3],[2],[3],[]].
+?- powerset([1,2,3], L).
+  L = [[1,2,3],[1,2],[1,3],[1],[2,3],[2],[3],[]].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/subset_2/en.py b/prolog/problems/sets/subset_2/en.py
index eb96ac0..e31b60f 100644
--- a/prolog/problems/sets/subset_2/en.py
+++ b/prolog/problems/sets/subset_2/en.py
@@ -6,15 +6,15 @@ slug = 'generate all subsets of a set'
 description = '''\
 <p><code>subset(Set, Subset)</code>: the set <code>Subset</code> is a subset of <code>Set</code>. This predicate should generate all valid solutions, one by one.</p>
 <pre>
-  ?- subset([1,2,3], SS).
-    SS = [1,2,3] ;
-    SS = [1,2] ;
-    SS = [1,3] ;
-    SS = [1] ;
-    SS = [2,3] ;
-    SS = [2] ;
-    SS = [3] ;
-    SS = [].
+?- subset([1,2,3], SS).
+  SS = [1,2,3] ;
+  SS = [1,2] ;
+  SS = [1,3] ;
+  SS = [1] ;
+  SS = [2,3] ;
+  SS = [2] ;
+  SS = [3] ;
+  SS = [].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/subset_2/sl.py b/prolog/problems/sets/subset_2/sl.py
index eae4fcf..012d132 100644
--- a/prolog/problems/sets/subset_2/sl.py
+++ b/prolog/problems/sets/subset_2/sl.py
@@ -6,15 +6,15 @@ slug = 'Generiraj vse podmnožice dane množice'
 description = '''\
 <p><code>subset(Set, Subset)</code>: množica <code>Subset</code> je podmnožica od <code>Set</code>. Ta predikat naj, eno po eno, generira vse veljavne podmnožice.</p>
 <pre>
-  ?- subset([1,2,3], SS).
-    SS = [1,2,3] ;
-    SS = [1,2] ;
-    SS = [1,3] ;
-    SS = [1] ;
-    SS = [2,3] ;
-    SS = [2] ;
-    SS = [3] ;
-    SS = [].
+?- subset([1,2,3], SS).
+  SS = [1,2,3] ;
+  SS = [1,2] ;
+  SS = [1,3] ;
+  SS = [1] ;
+  SS = [2,3] ;
+  SS = [2] ;
+  SS = [3] ;
+  SS = [].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/union_3/en.py b/prolog/problems/sets/union_3/en.py
index db6bbd9..3789e96 100644
--- a/prolog/problems/sets/union_3/en.py
+++ b/prolog/problems/sets/union_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the union of two sets'
 description = '''\
 <p><code>union(S1, S2, U)</code>: the list <code>U</code> contains all elements of <code>S1</code> and <code>S2</code>, with no duplicates.</p>
 <pre>
-  ?- union([1,5,2,3], [3,4,8,2], U).
-    U = [1,5,3,4,8,2].
+?- union([1,5,2,3], [3,4,8,2], U).
+  U = [1,5,3,4,8,2].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sets/union_3/sl.py b/prolog/problems/sets/union_3/sl.py
index 27d3088..9a19323 100644
--- a/prolog/problems/sets/union_3/sl.py
+++ b/prolog/problems/sets/union_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči unijo dveh množic'
 description = '''\
 <p><code>union(S1, S2, U)</code>: seznam <code>U</code> predstavlja unijo elementov v seznamih <code>S1</code> in <code>S2</code>, duplikatov (kot se za množice spodobi) ni.</p>
 <pre>
-  ?- union([1,5,2,3], [3,4,8,2], U).
-    U = [1,5,3,4,8,2].
+?- union([1,5,2,3], [3,4,8,2], U).
+  U = [1,5,3,4,8,2].
 </pre>'''
 
 hint = {}