From 337a0696f11b6820fe9c019f4278df08fd812650 Mon Sep 17 00:00:00 2001 From: Simon Cruanes Date: Sat, 10 Sep 2022 22:22:30 -0400 Subject: [PATCH] update guide --- doc/guide.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/doc/guide.md b/doc/guide.md index 0488dfae..0a521b67 100644 --- a/doc/guide.md +++ b/doc/guide.md @@ -211,7 +211,7 @@ Sidekick_smt_solver.Solver.Sat (model (false := false) (q := true) - ((= Bool p q) := true) + ((box (= Bool p q)) := true) (true := true) (p := true)) ``` @@ -247,10 +247,10 @@ Note that this doesn't affect satisfiability without assumptions: Sidekick_smt_solver.Solver.Sat (model (false := false) - (q := false) - ((= Bool p q) := true) + (q := true) + ((box (= Bool p q)) := true) (true := true) - (p := false)) + (p := true)) ``` We can therefore add more formulas and see where it leads us. @@ -265,12 +265,12 @@ We can therefore add more formulas and see where it leads us. Sidekick_smt_solver.Solver.Sat (model (false := false) - (q := false) + (q := true) + ((box (= Bool p q)) := true) (r := true) - ((= Bool p q) := true) ((box (or r (not p) false)) := true) (true := true) - (p := false)) + (p := true)) ``` Still satisfiable, but now we see `r` in the model, too. And now: @@ -331,11 +331,11 @@ We can play with assertions now: - : Solver.res = Sidekick_smt_solver.Solver.Sat (model + (b := 0) (false := false) ((box (<= (+ a ((* -1) b)) 0)) := true) ($_le_comb[0] := 0) (a := 0) - (b := 0) (true := true))