patrick/anthem
1
0
Fork 0
Code Issues 15 Releases 21 Activity

Add new simplification rule

Browse Source 
This adds the rule “(not F or G) === (F -> G)” to the simplification
rule tableau.
This commit is contained in:
Patrick Lühne
2018-04-09 23:46:19 +02:00
parent 4967576b6c
commit dfffdcfce6
4 changed files with 41 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
tests/TestCompletion.cpp
View File

@@ -153,7 +153,7 @@ TEST_CASE("[completion] Rules are completed", "[completion]")
CHECK(output.str() ==
"forall V1 (covered(V1) <-> exists U1 in(V1, U1))\n"
"forall V2, V3 (in(V2, V3) -> (V2 in 1..n and V3 in 1..r))\n"
"forall U2 (not U2 in 1..n or covered(U2))\n"
"forall U2 (U2 in 1..n -> covered(U2))\n"
"forall U3, U4, U5 (not in(U3, U4) or not in(U5, U4) or not exists X1 (X1 in (U3 + U5) and in(X1, U4)))\n");
}

2
tests/TestHiddenPredicateElimination.cpp
View File

@@ -168,7 +168,7 @@ TEST_CASE("[hidden predicate elimination] Hidden predicates are correctly elimin
CHECK(output.str() ==
"(s -> not #false)\n"
"(t -> not #false)\n"
"(not s or t)\n"
"(s -> t)\n"
"(#false or #false or not #false)\n");
}

2
tests/TestPlaceholders.cpp
View File

@@ -56,7 +56,7 @@ TEST_CASE("[placeholders] Programs with placeholders are correctly completed", "
CHECK(output.str() ==
"forall V1, V2 (color(V1, V2) -> (vertex(V1) and color(V2)))\n"
"forall U1 (not vertex(U1) or exists U2 color(U1, U2))\n"
"forall U1 (vertex(U1) -> exists U2 color(U1, U2))\n"
"forall U3, U4, U5 (not color(U3, U4) or not color(U5, U4) or not edge(U3, U5))\n");
}
}