diff --git a/examples/patience.mlw b/examples/patience.mlw
index ba7cfc23bb94c02cf211594f5608d56e10642bf3..ba5028add2d7f64d50272affb4c59122952a9e69 100644
--- a/examples/patience.mlw
+++ b/examples/patience.mlw
@@ -16,13 +16,13 @@ numbers instead of cards. If the input sequence is 9, 7, 10, 9, 5, 4,
 and 10, then the stacks develop as
 
 {h <pre>}
-&lt;[[9]]&gt;
-&lt;[[7, 9]]&gt;
-&lt;[[7, 9]], [[10]]&gt;
-&lt;[[7, 9]], [[9, 10]]&gt;
-&lt;[[5, 7, 9]], [[9, 10]]&gt;
-&lt;[[4, 5, 7, 9]], [[9, 10]]&gt;
-&lt;[[4, 5, 7, 9]], [[9, 10]], [[10]]&gt;
+<[[9]]>
+<[[7, 9]]>
+<[[7, 9]], [[10]]>
+<[[7, 9]], [[9, 10]]>
+<[[5, 7, 9]], [[9, 10]]>
+<[[4, 5, 7, 9]], [[9, 10]]>
+<[[4, 5, 7, 9]], [[9, 10]], [[10]]>
 {h </pre>}
 
 Verify the claim is that the number of stacks at the end of the game