diff --git a/cvc5-1.0.0/api/api.html b/cvc5-1.0.0/api/api.html index 3c1f917..200918e 100644 --- a/cvc5-1.0.0/api/api.html +++ b/cvc5-1.0.0/api/api.html @@ -135,6 +135,11 @@
+
+ + cvc5-1.0.1 + +
@@ -143,8 +148,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/cpp.html b/cvc5-1.0.0/api/cpp/cpp.html index dfa8e9c..c7402b7 100644 --- a/cvc5-1.0.0/api/cpp/cpp.html +++ b/cvc5-1.0.0/api/cpp/cpp.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/datatype.html b/cvc5-1.0.0/api/cpp/datatype.html index ff12790..715c014 100644 --- a/cvc5-1.0.0/api/cpp/datatype.html +++ b/cvc5-1.0.0/api/cpp/datatype.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/datatypeconstructor.html b/cvc5-1.0.0/api/cpp/datatypeconstructor.html index 9bd4648..136d4b2 100644 --- a/cvc5-1.0.0/api/cpp/datatypeconstructor.html +++ b/cvc5-1.0.0/api/cpp/datatypeconstructor.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/datatypeconstructordecl.html b/cvc5-1.0.0/api/cpp/datatypeconstructordecl.html index d55858a..7530645 100644 --- a/cvc5-1.0.0/api/cpp/datatypeconstructordecl.html +++ b/cvc5-1.0.0/api/cpp/datatypeconstructordecl.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/datatypedecl.html b/cvc5-1.0.0/api/cpp/datatypedecl.html index fa4a4db..ae9a6d2 100644 --- a/cvc5-1.0.0/api/cpp/datatypedecl.html +++ b/cvc5-1.0.0/api/cpp/datatypedecl.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/datatypeselector.html b/cvc5-1.0.0/api/cpp/datatypeselector.html index 1a35997..ff79b08 100644 --- a/cvc5-1.0.0/api/cpp/datatypeselector.html +++ b/cvc5-1.0.0/api/cpp/datatypeselector.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/driveroptions.html b/cvc5-1.0.0/api/cpp/driveroptions.html index 2447833..cc7f9db 100644 --- a/cvc5-1.0.0/api/cpp/driveroptions.html +++ b/cvc5-1.0.0/api/cpp/driveroptions.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/exceptions.html b/cvc5-1.0.0/api/cpp/exceptions.html index 270c934..359b6e4 100644 --- a/cvc5-1.0.0/api/cpp/exceptions.html +++ b/cvc5-1.0.0/api/cpp/exceptions.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/grammar.html b/cvc5-1.0.0/api/cpp/grammar.html index 1b39a53..3445bf2 100644 --- a/cvc5-1.0.0/api/cpp/grammar.html +++ b/cvc5-1.0.0/api/cpp/grammar.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/kind.html b/cvc5-1.0.0/api/cpp/kind.html index 5cc86ad..7f5ed65 100644 --- a/cvc5-1.0.0/api/cpp/kind.html +++ b/cvc5-1.0.0/api/cpp/kind.html @@ -252,6 +252,11 @@
+
+ + cvc5-1.0.1 + +
@@ -260,8 +265,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/modes.html b/cvc5-1.0.0/api/cpp/modes.html index 73decdb..95bae13 100644 --- a/cvc5-1.0.0/api/cpp/modes.html +++ b/cvc5-1.0.0/api/cpp/modes.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/op.html b/cvc5-1.0.0/api/cpp/op.html index f4c3be8..4a19833 100644 --- a/cvc5-1.0.0/api/cpp/op.html +++ b/cvc5-1.0.0/api/cpp/op.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/optioninfo.html b/cvc5-1.0.0/api/cpp/optioninfo.html index 32de4fa..bcf03b9 100644 --- a/cvc5-1.0.0/api/cpp/optioninfo.html +++ b/cvc5-1.0.0/api/cpp/optioninfo.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/quickstart.html b/cvc5-1.0.0/api/cpp/quickstart.html index f2b906d..88752ae 100644 --- a/cvc5-1.0.0/api/cpp/quickstart.html +++ b/cvc5-1.0.0/api/cpp/quickstart.html @@ -261,6 +261,11 @@
+
+ + cvc5-1.0.1 + +
@@ -269,8 +274,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/result.html b/cvc5-1.0.0/api/cpp/result.html index 87401ad..557cd84 100644 --- a/cvc5-1.0.0/api/cpp/result.html +++ b/cvc5-1.0.0/api/cpp/result.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/roundingmode.html b/cvc5-1.0.0/api/cpp/roundingmode.html index 8ca6641..b0157e6 100644 --- a/cvc5-1.0.0/api/cpp/roundingmode.html +++ b/cvc5-1.0.0/api/cpp/roundingmode.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/solver.html b/cvc5-1.0.0/api/cpp/solver.html index 649159e..c84efa0 100644 --- a/cvc5-1.0.0/api/cpp/solver.html +++ b/cvc5-1.0.0/api/cpp/solver.html @@ -252,6 +252,11 @@
+
+ + cvc5-1.0.1 + +
@@ -260,8 +265,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/sort.html b/cvc5-1.0.0/api/cpp/sort.html index 71a0599..9d8ed2d 100644 --- a/cvc5-1.0.0/api/cpp/sort.html +++ b/cvc5-1.0.0/api/cpp/sort.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/statistics.html b/cvc5-1.0.0/api/cpp/statistics.html index 2f58bca..eb65579 100644 --- a/cvc5-1.0.0/api/cpp/statistics.html +++ b/cvc5-1.0.0/api/cpp/statistics.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/synthresult.html b/cvc5-1.0.0/api/cpp/synthresult.html index 7250ba8..c54ec44 100644 --- a/cvc5-1.0.0/api/cpp/synthresult.html +++ b/cvc5-1.0.0/api/cpp/synthresult.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/term.html b/cvc5-1.0.0/api/cpp/term.html index cdb8da0..9430097 100644 --- a/cvc5-1.0.0/api/cpp/term.html +++ b/cvc5-1.0.0/api/cpp/term.html @@ -252,6 +252,11 @@
+
+ + cvc5-1.0.1 + +
@@ -260,8 +265,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/cpp/unknownexplanation.html b/cvc5-1.0.0/api/cpp/unknownexplanation.html index 292e5e4..8d9ba99 100644 --- a/cvc5-1.0.0/api/cpp/unknownexplanation.html +++ b/cvc5-1.0.0/api/cpp/unknownexplanation.html @@ -247,6 +247,11 @@
+
+ + cvc5-1.0.1 + +
@@ -255,8 +260,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/java/java.html b/cvc5-1.0.0/api/java/java.html index 10838e9..e2fdba6 100644 --- a/cvc5-1.0.0/api/java/java.html +++ b/cvc5-1.0.0/api/java/java.html @@ -157,6 +157,11 @@
+
+ + cvc5-1.0.1 + +
@@ -165,8 +170,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/java/quickstart.html b/cvc5-1.0.0/api/java/quickstart.html index 5af74fc..80b9b84 100644 --- a/cvc5-1.0.0/api/java/quickstart.html +++ b/cvc5-1.0.0/api/java/quickstart.html @@ -171,6 +171,11 @@
+
+ + cvc5-1.0.1 + +
@@ -179,8 +184,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/datatype.html b/cvc5-1.0.0/api/python/base/datatype.html index 7d660e0..8d310ad 100644 --- a/cvc5-1.0.0/api/python/base/datatype.html +++ b/cvc5-1.0.0/api/python/base/datatype.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/datatypeconstructor.html b/cvc5-1.0.0/api/python/base/datatypeconstructor.html index 63738d3..5d9c266 100644 --- a/cvc5-1.0.0/api/python/base/datatypeconstructor.html +++ b/cvc5-1.0.0/api/python/base/datatypeconstructor.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/datatypeconstructordecl.html b/cvc5-1.0.0/api/python/base/datatypeconstructordecl.html index 49e00fb..381c8fb 100644 --- a/cvc5-1.0.0/api/python/base/datatypeconstructordecl.html +++ b/cvc5-1.0.0/api/python/base/datatypeconstructordecl.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/datatypedecl.html b/cvc5-1.0.0/api/python/base/datatypedecl.html index b1acae1..c2602a0 100644 --- a/cvc5-1.0.0/api/python/base/datatypedecl.html +++ b/cvc5-1.0.0/api/python/base/datatypedecl.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/datatypeselector.html b/cvc5-1.0.0/api/python/base/datatypeselector.html index 6178c4e..3b7d7ac 100644 --- a/cvc5-1.0.0/api/python/base/datatypeselector.html +++ b/cvc5-1.0.0/api/python/base/datatypeselector.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/grammar.html b/cvc5-1.0.0/api/python/base/grammar.html index 63e4781..2e8f53c 100644 --- a/cvc5-1.0.0/api/python/base/grammar.html +++ b/cvc5-1.0.0/api/python/base/grammar.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/kind.html b/cvc5-1.0.0/api/python/base/kind.html index c99f34c..28a8672 100644 --- a/cvc5-1.0.0/api/python/base/kind.html +++ b/cvc5-1.0.0/api/python/base/kind.html @@ -249,6 +249,11 @@
+
+ + cvc5-1.0.1 + +
@@ -257,8 +262,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/op.html b/cvc5-1.0.0/api/python/base/op.html index 092194e..b75f0de 100644 --- a/cvc5-1.0.0/api/python/base/op.html +++ b/cvc5-1.0.0/api/python/base/op.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/python.html b/cvc5-1.0.0/api/python/base/python.html index 9bbd760..64e2ab4 100644 --- a/cvc5-1.0.0/api/python/base/python.html +++ b/cvc5-1.0.0/api/python/base/python.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/quickstart.html b/cvc5-1.0.0/api/python/base/quickstart.html index 12f01ad..a743076 100644 --- a/cvc5-1.0.0/api/python/base/quickstart.html +++ b/cvc5-1.0.0/api/python/base/quickstart.html @@ -258,6 +258,11 @@
+
+ + cvc5-1.0.1 + +
@@ -266,8 +271,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/result.html b/cvc5-1.0.0/api/python/base/result.html index 7463060..442faff 100644 --- a/cvc5-1.0.0/api/python/base/result.html +++ b/cvc5-1.0.0/api/python/base/result.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/roundingmode.html b/cvc5-1.0.0/api/python/base/roundingmode.html index 76883ad..d37b02a 100644 --- a/cvc5-1.0.0/api/python/base/roundingmode.html +++ b/cvc5-1.0.0/api/python/base/roundingmode.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/solver.html b/cvc5-1.0.0/api/python/base/solver.html index 6a8d750..d14a251 100644 --- a/cvc5-1.0.0/api/python/base/solver.html +++ b/cvc5-1.0.0/api/python/base/solver.html @@ -249,6 +249,11 @@
+
+ + cvc5-1.0.1 + +
@@ -257,8 +262,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/sort.html b/cvc5-1.0.0/api/python/base/sort.html index 1a862b2..9ad6818 100644 --- a/cvc5-1.0.0/api/python/base/sort.html +++ b/cvc5-1.0.0/api/python/base/sort.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/statistics.html b/cvc5-1.0.0/api/python/base/statistics.html index 046cc05..9798312 100644 --- a/cvc5-1.0.0/api/python/base/statistics.html +++ b/cvc5-1.0.0/api/python/base/statistics.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/synthresult.html b/cvc5-1.0.0/api/python/base/synthresult.html index 659bb63..17b39cf 100644 --- a/cvc5-1.0.0/api/python/base/synthresult.html +++ b/cvc5-1.0.0/api/python/base/synthresult.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/term.html b/cvc5-1.0.0/api/python/base/term.html index c96eb86..f91cb82 100644 --- a/cvc5-1.0.0/api/python/base/term.html +++ b/cvc5-1.0.0/api/python/base/term.html @@ -249,6 +249,11 @@
+
+ + cvc5-1.0.1 + +
@@ -257,8 +262,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/base/unknownexplanation.html b/cvc5-1.0.0/api/python/base/unknownexplanation.html index 6613bc0..640c8cd 100644 --- a/cvc5-1.0.0/api/python/base/unknownexplanation.html +++ b/cvc5-1.0.0/api/python/base/unknownexplanation.html @@ -244,6 +244,11 @@
+
+ + cvc5-1.0.1 + +
@@ -252,8 +257,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/python.html b/cvc5-1.0.0/api/python/python.html index 28c9844..8727f28 100644 --- a/cvc5-1.0.0/api/python/python.html +++ b/cvc5-1.0.0/api/python/python.html @@ -157,6 +157,11 @@
+
+ + cvc5-1.0.1 + +
@@ -165,8 +170,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/arith.html b/cvc5-1.0.0/api/python/pythonic/arith.html index 14d76ea..459b936 100644 --- a/cvc5-1.0.0/api/python/pythonic/arith.html +++ b/cvc5-1.0.0/api/python/pythonic/arith.html @@ -246,6 +246,11 @@
+
+ + cvc5-1.0.1 + +
@@ -254,8 +259,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/array.html b/cvc5-1.0.0/api/python/pythonic/array.html index 12067d8..702ddef 100644 --- a/cvc5-1.0.0/api/python/pythonic/array.html +++ b/cvc5-1.0.0/api/python/pythonic/array.html @@ -236,6 +236,11 @@
+
+ + cvc5-1.0.1 + +
@@ -244,8 +249,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/bitvec.html b/cvc5-1.0.0/api/python/pythonic/bitvec.html index 32c0f61..0812321 100644 --- a/cvc5-1.0.0/api/python/pythonic/bitvec.html +++ b/cvc5-1.0.0/api/python/pythonic/bitvec.html @@ -241,6 +241,11 @@
+
+ + cvc5-1.0.1 + +
@@ -249,8 +254,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/boolean.html b/cvc5-1.0.0/api/python/pythonic/boolean.html index 2c6becd..39398d5 100644 --- a/cvc5-1.0.0/api/python/pythonic/boolean.html +++ b/cvc5-1.0.0/api/python/pythonic/boolean.html @@ -246,6 +246,11 @@
+
+ + cvc5-1.0.1 + +
@@ -254,8 +259,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/dt.html b/cvc5-1.0.0/api/python/pythonic/dt.html index 09c1051..ff22ba8 100644 --- a/cvc5-1.0.0/api/python/pythonic/dt.html +++ b/cvc5-1.0.0/api/python/pythonic/dt.html @@ -231,6 +231,11 @@
+
+ + cvc5-1.0.1 + +
@@ -239,8 +244,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/fp.html b/cvc5-1.0.0/api/python/pythonic/fp.html index 8e57756..a768123 100644 --- a/cvc5-1.0.0/api/python/pythonic/fp.html +++ b/cvc5-1.0.0/api/python/pythonic/fp.html @@ -241,6 +241,11 @@
+
+ + cvc5-1.0.1 + +
@@ -249,8 +254,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/internals.html b/cvc5-1.0.0/api/python/pythonic/internals.html index 41095cb..5a45880 100644 --- a/cvc5-1.0.0/api/python/pythonic/internals.html +++ b/cvc5-1.0.0/api/python/pythonic/internals.html @@ -226,6 +226,11 @@
+
+ + cvc5-1.0.1 + +
@@ -234,8 +239,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/pythonic.html b/cvc5-1.0.0/api/python/pythonic/pythonic.html index a04995c..638c803 100644 --- a/cvc5-1.0.0/api/python/pythonic/pythonic.html +++ b/cvc5-1.0.0/api/python/pythonic/pythonic.html @@ -214,6 +214,11 @@
+
+ + cvc5-1.0.1 + +
@@ -222,8 +227,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/quant.html b/cvc5-1.0.0/api/python/pythonic/quant.html index 82e644e..616e314 100644 --- a/cvc5-1.0.0/api/python/pythonic/quant.html +++ b/cvc5-1.0.0/api/python/pythonic/quant.html @@ -231,6 +231,11 @@
+
+ + cvc5-1.0.1 + +
@@ -239,8 +244,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/quickstart.html b/cvc5-1.0.0/api/python/pythonic/quickstart.html index 19fbc1a..95da3d9 100644 --- a/cvc5-1.0.0/api/python/pythonic/quickstart.html +++ b/cvc5-1.0.0/api/python/pythonic/quickstart.html @@ -228,6 +228,11 @@
+
+ + cvc5-1.0.1 + +
@@ -236,8 +241,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/set.html b/cvc5-1.0.0/api/python/pythonic/set.html index 176d634..a583ade 100644 --- a/cvc5-1.0.0/api/python/pythonic/set.html +++ b/cvc5-1.0.0/api/python/pythonic/set.html @@ -231,6 +231,11 @@
+
+ + cvc5-1.0.1 + +
@@ -239,8 +244,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/api/python/pythonic/solver.html b/cvc5-1.0.0/api/python/pythonic/solver.html index 98384f5..f89541a 100644 --- a/cvc5-1.0.0/api/python/pythonic/solver.html +++ b/cvc5-1.0.0/api/python/pythonic/solver.html @@ -236,6 +236,11 @@
+
+ + cvc5-1.0.1 + +
@@ -244,8 +249,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/binary/binary.html b/cvc5-1.0.0/binary/binary.html index d789aa2..51a1d32 100644 --- a/cvc5-1.0.0/binary/binary.html +++ b/cvc5-1.0.0/binary/binary.html @@ -125,6 +125,11 @@
+
+ + cvc5-1.0.1 + +
@@ -133,8 +138,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/binary/quickstart.html b/cvc5-1.0.0/binary/quickstart.html index 101d1c1..8b84a19 100644 --- a/cvc5-1.0.0/binary/quickstart.html +++ b/cvc5-1.0.0/binary/quickstart.html @@ -139,6 +139,11 @@
+
+ + cvc5-1.0.1 + +
@@ -147,8 +152,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/bags.html b/cvc5-1.0.0/examples/bags.html index d7985d7..75979dc 100644 --- a/cvc5-1.0.0/examples/bags.html +++ b/cvc5-1.0.0/examples/bags.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/bitvectors.html b/cvc5-1.0.0/examples/bitvectors.html index 938d5c4..a7dfc1f 100644 --- a/cvc5-1.0.0/examples/bitvectors.html +++ b/cvc5-1.0.0/examples/bitvectors.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/bitvectors_and_arrays.html b/cvc5-1.0.0/examples/bitvectors_and_arrays.html index b8be94e..b518a9e 100644 --- a/cvc5-1.0.0/examples/bitvectors_and_arrays.html +++ b/cvc5-1.0.0/examples/bitvectors_and_arrays.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/combination.html b/cvc5-1.0.0/examples/combination.html index cb0e3d6..9058904 100644 --- a/cvc5-1.0.0/examples/combination.html +++ b/cvc5-1.0.0/examples/combination.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/datatypes.html b/cvc5-1.0.0/examples/datatypes.html index 32d2d9c..a62c688 100644 --- a/cvc5-1.0.0/examples/datatypes.html +++ b/cvc5-1.0.0/examples/datatypes.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/examples.html b/cvc5-1.0.0/examples/examples.html index 2f6e9c0..c91535f 100644 --- a/cvc5-1.0.0/examples/examples.html +++ b/cvc5-1.0.0/examples/examples.html @@ -215,6 +215,11 @@
+
+ + cvc5-1.0.1 + +
@@ -223,8 +228,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/exceptions.html b/cvc5-1.0.0/examples/exceptions.html index c94a6a6..02c3b57 100644 --- a/cvc5-1.0.0/examples/exceptions.html +++ b/cvc5-1.0.0/examples/exceptions.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/extract.html b/cvc5-1.0.0/examples/extract.html index 784b4e7..ae7e297 100644 --- a/cvc5-1.0.0/examples/extract.html +++ b/cvc5-1.0.0/examples/extract.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/floatingpoint.html b/cvc5-1.0.0/examples/floatingpoint.html index 6cbadbf..290d946 100644 --- a/cvc5-1.0.0/examples/floatingpoint.html +++ b/cvc5-1.0.0/examples/floatingpoint.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/helloworld.html b/cvc5-1.0.0/examples/helloworld.html index e380cf6..5e9cabb 100644 --- a/cvc5-1.0.0/examples/helloworld.html +++ b/cvc5-1.0.0/examples/helloworld.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/lineararith.html b/cvc5-1.0.0/examples/lineararith.html index d3ca5d1..2ded025 100644 --- a/cvc5-1.0.0/examples/lineararith.html +++ b/cvc5-1.0.0/examples/lineararith.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/quickstart.html b/cvc5-1.0.0/examples/quickstart.html index 5365f94..3bb137f 100644 --- a/cvc5-1.0.0/examples/quickstart.html +++ b/cvc5-1.0.0/examples/quickstart.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/relations.html b/cvc5-1.0.0/examples/relations.html index 451a620..cb19526 100644 --- a/cvc5-1.0.0/examples/relations.html +++ b/cvc5-1.0.0/examples/relations.html @@ -222,6 +222,11 @@
+
+ + cvc5-1.0.1 + +
@@ -230,8 +235,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/sequences.html b/cvc5-1.0.0/examples/sequences.html index ee14619..2df3104 100644 --- a/cvc5-1.0.0/examples/sequences.html +++ b/cvc5-1.0.0/examples/sequences.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/sets.html b/cvc5-1.0.0/examples/sets.html index bd82c6d..89a6943 100644 --- a/cvc5-1.0.0/examples/sets.html +++ b/cvc5-1.0.0/examples/sets.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/strings.html b/cvc5-1.0.0/examples/strings.html index 1399f9d..a484c12 100644 --- a/cvc5-1.0.0/examples/strings.html +++ b/cvc5-1.0.0/examples/strings.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/sygus-fun.html b/cvc5-1.0.0/examples/sygus-fun.html index d509b46..86a72c0 100644 --- a/cvc5-1.0.0/examples/sygus-fun.html +++ b/cvc5-1.0.0/examples/sygus-fun.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/sygus-grammar.html b/cvc5-1.0.0/examples/sygus-grammar.html index ac4b7db..100aef2 100644 --- a/cvc5-1.0.0/examples/sygus-grammar.html +++ b/cvc5-1.0.0/examples/sygus-grammar.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/examples/sygus-inv.html b/cvc5-1.0.0/examples/sygus-inv.html index cd88b11..d92c3e1 100644 --- a/cvc5-1.0.0/examples/sygus-inv.html +++ b/cvc5-1.0.0/examples/sygus-inv.html @@ -217,6 +217,11 @@
+
+ + cvc5-1.0.1 + +
@@ -225,8 +230,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/genindex.html b/cvc5-1.0.0/genindex.html index a6fffd6..a8e372f 100644 --- a/cvc5-1.0.0/genindex.html +++ b/cvc5-1.0.0/genindex.html @@ -117,6 +117,11 @@
+
+ + cvc5-1.0.1 + +
@@ -125,8 +130,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/index.html b/cvc5-1.0.0/index.html index 54bfd73..fd5638a 100644 --- a/cvc5-1.0.0/index.html +++ b/cvc5-1.0.0/index.html @@ -117,6 +117,11 @@
+
+ + cvc5-1.0.1 + +
@@ -125,8 +130,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/installation/installation.html b/cvc5-1.0.0/installation/installation.html index 059e350..a233a6e 100644 --- a/cvc5-1.0.0/installation/installation.html +++ b/cvc5-1.0.0/installation/installation.html @@ -265,6 +265,11 @@
+
+ + cvc5-1.0.1 + +
@@ -273,8 +278,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/options.html b/cvc5-1.0.0/options.html index 2594528..220fbc5 100644 --- a/cvc5-1.0.0/options.html +++ b/cvc5-1.0.0/options.html @@ -232,6 +232,11 @@
+
+ + cvc5-1.0.1 + +
@@ -240,8 +245,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/output-tags.html b/cvc5-1.0.0/output-tags.html index de9d23f..cff3778 100644 --- a/cvc5-1.0.0/output-tags.html +++ b/cvc5-1.0.0/output-tags.html @@ -165,6 +165,11 @@
+
+ + cvc5-1.0.1 + +
@@ -173,8 +178,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/proofs/output_alethe.html b/cvc5-1.0.0/proofs/output_alethe.html index 5d0a101..c7f4b4a 100644 --- a/cvc5-1.0.0/proofs/output_alethe.html +++ b/cvc5-1.0.0/proofs/output_alethe.html @@ -140,6 +140,11 @@
+
+ + cvc5-1.0.1 + +
@@ -148,8 +153,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/proofs/output_dot.html b/cvc5-1.0.0/proofs/output_dot.html index 3e71c4d..97b960a 100644 --- a/cvc5-1.0.0/proofs/output_dot.html +++ b/cvc5-1.0.0/proofs/output_dot.html @@ -140,6 +140,11 @@
+
+ + cvc5-1.0.1 + +
@@ -148,8 +153,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/proofs/output_lfsc.html b/cvc5-1.0.0/proofs/output_lfsc.html index 62188cc..9488c70 100644 --- a/cvc5-1.0.0/proofs/output_lfsc.html +++ b/cvc5-1.0.0/proofs/output_lfsc.html @@ -140,6 +140,11 @@
+
+ + cvc5-1.0.1 + +
@@ -148,8 +153,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/proofs/proof_rules.html b/cvc5-1.0.0/proofs/proof_rules.html index e4b373e..a5a2b84 100644 --- a/cvc5-1.0.0/proofs/proof_rules.html +++ b/cvc5-1.0.0/proofs/proof_rules.html @@ -145,6 +145,11 @@
+
+ + cvc5-1.0.1 + +
@@ -153,8 +158,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/proofs/proofs.html b/cvc5-1.0.0/proofs/proofs.html index af75ba7..b69e466 100644 --- a/cvc5-1.0.0/proofs/proofs.html +++ b/cvc5-1.0.0/proofs/proofs.html @@ -140,6 +140,11 @@
+
+ + cvc5-1.0.1 + +
@@ -148,8 +153,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/references.html b/cvc5-1.0.0/references.html index 38b1967..51d3006 100644 --- a/cvc5-1.0.0/references.html +++ b/cvc5-1.0.0/references.html @@ -118,6 +118,11 @@
+
+ + cvc5-1.0.1 + +
@@ -126,8 +131,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/resource-limits.html b/cvc5-1.0.0/resource-limits.html index b55b67b..c2a5b25 100644 --- a/cvc5-1.0.0/resource-limits.html +++ b/cvc5-1.0.0/resource-limits.html @@ -134,6 +134,11 @@
+
+ + cvc5-1.0.1 + +
@@ -142,8 +147,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/search.html b/cvc5-1.0.0/search.html index f012e7d..eb3675a 100644 --- a/cvc5-1.0.0/search.html +++ b/cvc5-1.0.0/search.html @@ -121,6 +121,11 @@
+
+ + cvc5-1.0.1 + +
@@ -129,8 +134,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/statistics.html b/cvc5-1.0.0/statistics.html index c858acf..296beb5 100644 --- a/cvc5-1.0.0/statistics.html +++ b/cvc5-1.0.0/statistics.html @@ -118,6 +118,11 @@
+
+ + cvc5-1.0.1 + +
@@ -126,8 +131,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/bags.html b/cvc5-1.0.0/theories/bags.html index c65babb..1a95f85 100644 --- a/cvc5-1.0.0/theories/bags.html +++ b/cvc5-1.0.0/theories/bags.html @@ -183,6 +183,11 @@
+
+ + cvc5-1.0.1 + +
@@ -191,8 +196,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/datatypes.html b/cvc5-1.0.0/theories/datatypes.html index 6e09671..95e530c 100644 --- a/cvc5-1.0.0/theories/datatypes.html +++ b/cvc5-1.0.0/theories/datatypes.html @@ -214,6 +214,11 @@
+
+ + cvc5-1.0.1 + +
@@ -222,8 +227,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/separation-logic.html b/cvc5-1.0.0/theories/separation-logic.html index cc603e9..ebe37aa 100644 --- a/cvc5-1.0.0/theories/separation-logic.html +++ b/cvc5-1.0.0/theories/separation-logic.html @@ -189,6 +189,11 @@
+
+ + cvc5-1.0.1 + +
@@ -197,8 +202,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/sequences.html b/cvc5-1.0.0/theories/sequences.html index e81cf22..6b2111d 100644 --- a/cvc5-1.0.0/theories/sequences.html +++ b/cvc5-1.0.0/theories/sequences.html @@ -179,6 +179,11 @@
+
+ + cvc5-1.0.1 + +
@@ -187,8 +192,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/sets-and-relations.html b/cvc5-1.0.0/theories/sets-and-relations.html index a21da78..a95594b 100644 --- a/cvc5-1.0.0/theories/sets-and-relations.html +++ b/cvc5-1.0.0/theories/sets-and-relations.html @@ -183,6 +183,11 @@
+
+ + cvc5-1.0.1 + +
@@ -191,8 +196,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/theories.html b/cvc5-1.0.0/theories/theories.html index 0ad8fc1..feee140 100644 --- a/cvc5-1.0.0/theories/theories.html +++ b/cvc5-1.0.0/theories/theories.html @@ -199,6 +199,11 @@
+
+ + cvc5-1.0.1 + +
@@ -207,8 +212,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.0/theories/transcendentals.html b/cvc5-1.0.0/theories/transcendentals.html index 7e863f3..ee748fb 100644 --- a/cvc5-1.0.0/theories/transcendentals.html +++ b/cvc5-1.0.0/theories/transcendentals.html @@ -191,6 +191,11 @@
+
+ + cvc5-1.0.1 + +
@@ -199,8 +204,8 @@
- - cvc5-1.0.1 + + cvc5-1.0.2
diff --git a/cvc5-1.0.1/api/api.html b/cvc5-1.0.1/api/api.html index dceab04..4c0c489 100644 --- a/cvc5-1.0.1/api/api.html +++ b/cvc5-1.0.1/api/api.html @@ -141,11 +141,6 @@
diff --git a/cvc5-1.0.1/api/cpp/cpp.html b/cvc5-1.0.1/api/cpp/cpp.html index 182711d..ab59c1c 100644 --- a/cvc5-1.0.1/api/cpp/cpp.html +++ b/cvc5-1.0.1/api/cpp/cpp.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/datatype.html b/cvc5-1.0.1/api/cpp/datatype.html index 796c1f6..ccfc038 100644 --- a/cvc5-1.0.1/api/cpp/datatype.html +++ b/cvc5-1.0.1/api/cpp/datatype.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/datatypeconstructor.html b/cvc5-1.0.1/api/cpp/datatypeconstructor.html index 9f0cc14..d74329b 100644 --- a/cvc5-1.0.1/api/cpp/datatypeconstructor.html +++ b/cvc5-1.0.1/api/cpp/datatypeconstructor.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/datatypeconstructordecl.html b/cvc5-1.0.1/api/cpp/datatypeconstructordecl.html index e7950f0..023f3e9 100644 --- a/cvc5-1.0.1/api/cpp/datatypeconstructordecl.html +++ b/cvc5-1.0.1/api/cpp/datatypeconstructordecl.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/datatypedecl.html b/cvc5-1.0.1/api/cpp/datatypedecl.html index 9ea1e9c..ec118d5 100644 --- a/cvc5-1.0.1/api/cpp/datatypedecl.html +++ b/cvc5-1.0.1/api/cpp/datatypedecl.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/datatypeselector.html b/cvc5-1.0.1/api/cpp/datatypeselector.html index c023bed..66cde16 100644 --- a/cvc5-1.0.1/api/cpp/datatypeselector.html +++ b/cvc5-1.0.1/api/cpp/datatypeselector.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/driveroptions.html b/cvc5-1.0.1/api/cpp/driveroptions.html index f5b0e39..01b3a51 100644 --- a/cvc5-1.0.1/api/cpp/driveroptions.html +++ b/cvc5-1.0.1/api/cpp/driveroptions.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/exceptions.html b/cvc5-1.0.1/api/cpp/exceptions.html index aa69035..94c7061 100644 --- a/cvc5-1.0.1/api/cpp/exceptions.html +++ b/cvc5-1.0.1/api/cpp/exceptions.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/grammar.html b/cvc5-1.0.1/api/cpp/grammar.html index 8289015..ea62b43 100644 --- a/cvc5-1.0.1/api/cpp/grammar.html +++ b/cvc5-1.0.1/api/cpp/grammar.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/kind.html b/cvc5-1.0.1/api/cpp/kind.html index b971d80..70e4683 100644 --- a/cvc5-1.0.1/api/cpp/kind.html +++ b/cvc5-1.0.1/api/cpp/kind.html @@ -258,11 +258,6 @@
diff --git a/cvc5-1.0.1/api/cpp/modes.html b/cvc5-1.0.1/api/cpp/modes.html index 1897565..b9f7bda 100644 --- a/cvc5-1.0.1/api/cpp/modes.html +++ b/cvc5-1.0.1/api/cpp/modes.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/op.html b/cvc5-1.0.1/api/cpp/op.html index 3835c9b..d951580 100644 --- a/cvc5-1.0.1/api/cpp/op.html +++ b/cvc5-1.0.1/api/cpp/op.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/optioninfo.html b/cvc5-1.0.1/api/cpp/optioninfo.html index 8969fc4..2b78840 100644 --- a/cvc5-1.0.1/api/cpp/optioninfo.html +++ b/cvc5-1.0.1/api/cpp/optioninfo.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/quickstart.html b/cvc5-1.0.1/api/cpp/quickstart.html index 59ea0a2..62aa05f 100644 --- a/cvc5-1.0.1/api/cpp/quickstart.html +++ b/cvc5-1.0.1/api/cpp/quickstart.html @@ -267,11 +267,6 @@
diff --git a/cvc5-1.0.1/api/cpp/result.html b/cvc5-1.0.1/api/cpp/result.html index 5d4ed64..0ca3f2e 100644 --- a/cvc5-1.0.1/api/cpp/result.html +++ b/cvc5-1.0.1/api/cpp/result.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/roundingmode.html b/cvc5-1.0.1/api/cpp/roundingmode.html index 7bc4f9a..6faf5ed 100644 --- a/cvc5-1.0.1/api/cpp/roundingmode.html +++ b/cvc5-1.0.1/api/cpp/roundingmode.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/solver.html b/cvc5-1.0.1/api/cpp/solver.html index 095bcf0..6d26d30 100644 --- a/cvc5-1.0.1/api/cpp/solver.html +++ b/cvc5-1.0.1/api/cpp/solver.html @@ -258,11 +258,6 @@
diff --git a/cvc5-1.0.1/api/cpp/sort.html b/cvc5-1.0.1/api/cpp/sort.html index b433768..b2f2e72 100644 --- a/cvc5-1.0.1/api/cpp/sort.html +++ b/cvc5-1.0.1/api/cpp/sort.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/statistics.html b/cvc5-1.0.1/api/cpp/statistics.html index 6c0a7d3..8ba3ec4 100644 --- a/cvc5-1.0.1/api/cpp/statistics.html +++ b/cvc5-1.0.1/api/cpp/statistics.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/synthresult.html b/cvc5-1.0.1/api/cpp/synthresult.html index 33ac7d6..5f39437 100644 --- a/cvc5-1.0.1/api/cpp/synthresult.html +++ b/cvc5-1.0.1/api/cpp/synthresult.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/cpp/term.html b/cvc5-1.0.1/api/cpp/term.html index 494a5a5..53ff5ea 100644 --- a/cvc5-1.0.1/api/cpp/term.html +++ b/cvc5-1.0.1/api/cpp/term.html @@ -258,11 +258,6 @@
diff --git a/cvc5-1.0.1/api/cpp/unknownexplanation.html b/cvc5-1.0.1/api/cpp/unknownexplanation.html index dccdc51..e7c6bc7 100644 --- a/cvc5-1.0.1/api/cpp/unknownexplanation.html +++ b/cvc5-1.0.1/api/cpp/unknownexplanation.html @@ -253,11 +253,6 @@
diff --git a/cvc5-1.0.1/api/java/java.html b/cvc5-1.0.1/api/java/java.html index d5fbd6e..2939617 100644 --- a/cvc5-1.0.1/api/java/java.html +++ b/cvc5-1.0.1/api/java/java.html @@ -163,11 +163,6 @@
diff --git a/cvc5-1.0.1/api/java/quickstart.html b/cvc5-1.0.1/api/java/quickstart.html index 9826e1b..aea461e 100644 --- a/cvc5-1.0.1/api/java/quickstart.html +++ b/cvc5-1.0.1/api/java/quickstart.html @@ -177,11 +177,6 @@
diff --git a/cvc5-1.0.1/api/python/base/datatype.html b/cvc5-1.0.1/api/python/base/datatype.html index 8187249..4c2d647 100644 --- a/cvc5-1.0.1/api/python/base/datatype.html +++ b/cvc5-1.0.1/api/python/base/datatype.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/datatypeconstructor.html b/cvc5-1.0.1/api/python/base/datatypeconstructor.html index cd71e9b..945d447 100644 --- a/cvc5-1.0.1/api/python/base/datatypeconstructor.html +++ b/cvc5-1.0.1/api/python/base/datatypeconstructor.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/datatypeconstructordecl.html b/cvc5-1.0.1/api/python/base/datatypeconstructordecl.html index d043316..186befb 100644 --- a/cvc5-1.0.1/api/python/base/datatypeconstructordecl.html +++ b/cvc5-1.0.1/api/python/base/datatypeconstructordecl.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/datatypedecl.html b/cvc5-1.0.1/api/python/base/datatypedecl.html index 1913979..5681a1a 100644 --- a/cvc5-1.0.1/api/python/base/datatypedecl.html +++ b/cvc5-1.0.1/api/python/base/datatypedecl.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/datatypeselector.html b/cvc5-1.0.1/api/python/base/datatypeselector.html index 2fec05a..55d4503 100644 --- a/cvc5-1.0.1/api/python/base/datatypeselector.html +++ b/cvc5-1.0.1/api/python/base/datatypeselector.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/grammar.html b/cvc5-1.0.1/api/python/base/grammar.html index 4d843bd..7ad7485 100644 --- a/cvc5-1.0.1/api/python/base/grammar.html +++ b/cvc5-1.0.1/api/python/base/grammar.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/kind.html b/cvc5-1.0.1/api/python/base/kind.html index ab019fd..f8dcba5 100644 --- a/cvc5-1.0.1/api/python/base/kind.html +++ b/cvc5-1.0.1/api/python/base/kind.html @@ -255,11 +255,6 @@
diff --git a/cvc5-1.0.1/api/python/base/op.html b/cvc5-1.0.1/api/python/base/op.html index 950de6b..aed6c8a 100644 --- a/cvc5-1.0.1/api/python/base/op.html +++ b/cvc5-1.0.1/api/python/base/op.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/python.html b/cvc5-1.0.1/api/python/base/python.html index 643abc5..84ccfe2 100644 --- a/cvc5-1.0.1/api/python/base/python.html +++ b/cvc5-1.0.1/api/python/base/python.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/quickstart.html b/cvc5-1.0.1/api/python/base/quickstart.html index 0909b28..959b80b 100644 --- a/cvc5-1.0.1/api/python/base/quickstart.html +++ b/cvc5-1.0.1/api/python/base/quickstart.html @@ -264,11 +264,6 @@
diff --git a/cvc5-1.0.1/api/python/base/result.html b/cvc5-1.0.1/api/python/base/result.html index c1acc9b..0c85f9e 100644 --- a/cvc5-1.0.1/api/python/base/result.html +++ b/cvc5-1.0.1/api/python/base/result.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/roundingmode.html b/cvc5-1.0.1/api/python/base/roundingmode.html index d347cf7..874d9b2 100644 --- a/cvc5-1.0.1/api/python/base/roundingmode.html +++ b/cvc5-1.0.1/api/python/base/roundingmode.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/solver.html b/cvc5-1.0.1/api/python/base/solver.html index a87041d..f614a79 100644 --- a/cvc5-1.0.1/api/python/base/solver.html +++ b/cvc5-1.0.1/api/python/base/solver.html @@ -255,11 +255,6 @@
diff --git a/cvc5-1.0.1/api/python/base/sort.html b/cvc5-1.0.1/api/python/base/sort.html index a035d6c..bd66e14 100644 --- a/cvc5-1.0.1/api/python/base/sort.html +++ b/cvc5-1.0.1/api/python/base/sort.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/statistics.html b/cvc5-1.0.1/api/python/base/statistics.html index ef4f362..ab99726 100644 --- a/cvc5-1.0.1/api/python/base/statistics.html +++ b/cvc5-1.0.1/api/python/base/statistics.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/synthresult.html b/cvc5-1.0.1/api/python/base/synthresult.html index d94157a..75822f5 100644 --- a/cvc5-1.0.1/api/python/base/synthresult.html +++ b/cvc5-1.0.1/api/python/base/synthresult.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/base/term.html b/cvc5-1.0.1/api/python/base/term.html index 3f17dfa..affd709 100644 --- a/cvc5-1.0.1/api/python/base/term.html +++ b/cvc5-1.0.1/api/python/base/term.html @@ -255,11 +255,6 @@
diff --git a/cvc5-1.0.1/api/python/base/unknownexplanation.html b/cvc5-1.0.1/api/python/base/unknownexplanation.html index f1e00da..2c2b669 100644 --- a/cvc5-1.0.1/api/python/base/unknownexplanation.html +++ b/cvc5-1.0.1/api/python/base/unknownexplanation.html @@ -250,11 +250,6 @@
diff --git a/cvc5-1.0.1/api/python/python.html b/cvc5-1.0.1/api/python/python.html index 84386c7..439ca67 100644 --- a/cvc5-1.0.1/api/python/python.html +++ b/cvc5-1.0.1/api/python/python.html @@ -163,11 +163,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/arith.html b/cvc5-1.0.1/api/python/pythonic/arith.html index 592fc34..5b098b3 100644 --- a/cvc5-1.0.1/api/python/pythonic/arith.html +++ b/cvc5-1.0.1/api/python/pythonic/arith.html @@ -252,11 +252,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/array.html b/cvc5-1.0.1/api/python/pythonic/array.html index e002807..d005b9e 100644 --- a/cvc5-1.0.1/api/python/pythonic/array.html +++ b/cvc5-1.0.1/api/python/pythonic/array.html @@ -242,11 +242,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/bitvec.html b/cvc5-1.0.1/api/python/pythonic/bitvec.html index 86e8fa1..10bd91f 100644 --- a/cvc5-1.0.1/api/python/pythonic/bitvec.html +++ b/cvc5-1.0.1/api/python/pythonic/bitvec.html @@ -247,11 +247,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/boolean.html b/cvc5-1.0.1/api/python/pythonic/boolean.html index 10d7d11..7e963ba 100644 --- a/cvc5-1.0.1/api/python/pythonic/boolean.html +++ b/cvc5-1.0.1/api/python/pythonic/boolean.html @@ -252,11 +252,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/dt.html b/cvc5-1.0.1/api/python/pythonic/dt.html index 923522e..b786325 100644 --- a/cvc5-1.0.1/api/python/pythonic/dt.html +++ b/cvc5-1.0.1/api/python/pythonic/dt.html @@ -237,11 +237,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/fp.html b/cvc5-1.0.1/api/python/pythonic/fp.html index e0764ba..f472952 100644 --- a/cvc5-1.0.1/api/python/pythonic/fp.html +++ b/cvc5-1.0.1/api/python/pythonic/fp.html @@ -247,11 +247,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/internals.html b/cvc5-1.0.1/api/python/pythonic/internals.html index 3c1d78c..283918c 100644 --- a/cvc5-1.0.1/api/python/pythonic/internals.html +++ b/cvc5-1.0.1/api/python/pythonic/internals.html @@ -232,11 +232,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/pythonic.html b/cvc5-1.0.1/api/python/pythonic/pythonic.html index 9cd730e..cbd0a11 100644 --- a/cvc5-1.0.1/api/python/pythonic/pythonic.html +++ b/cvc5-1.0.1/api/python/pythonic/pythonic.html @@ -220,11 +220,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/quant.html b/cvc5-1.0.1/api/python/pythonic/quant.html index 8eb5631..74d69c3 100644 --- a/cvc5-1.0.1/api/python/pythonic/quant.html +++ b/cvc5-1.0.1/api/python/pythonic/quant.html @@ -237,11 +237,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/quickstart.html b/cvc5-1.0.1/api/python/pythonic/quickstart.html index 7719a5b..e4d2055 100644 --- a/cvc5-1.0.1/api/python/pythonic/quickstart.html +++ b/cvc5-1.0.1/api/python/pythonic/quickstart.html @@ -234,11 +234,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/set.html b/cvc5-1.0.1/api/python/pythonic/set.html index f391edf..4db4751 100644 --- a/cvc5-1.0.1/api/python/pythonic/set.html +++ b/cvc5-1.0.1/api/python/pythonic/set.html @@ -237,11 +237,6 @@
diff --git a/cvc5-1.0.1/api/python/pythonic/solver.html b/cvc5-1.0.1/api/python/pythonic/solver.html index 1b48335..cda2e8c 100644 --- a/cvc5-1.0.1/api/python/pythonic/solver.html +++ b/cvc5-1.0.1/api/python/pythonic/solver.html @@ -242,11 +242,6 @@
diff --git a/cvc5-1.0.1/binary/binary.html b/cvc5-1.0.1/binary/binary.html index c26e5de..7fd5e4d 100644 --- a/cvc5-1.0.1/binary/binary.html +++ b/cvc5-1.0.1/binary/binary.html @@ -131,11 +131,6 @@
diff --git a/cvc5-1.0.1/binary/quickstart.html b/cvc5-1.0.1/binary/quickstart.html index 64c75ed..3e474c1 100644 --- a/cvc5-1.0.1/binary/quickstart.html +++ b/cvc5-1.0.1/binary/quickstart.html @@ -145,11 +145,6 @@
diff --git a/cvc5-1.0.1/examples/bags.html b/cvc5-1.0.1/examples/bags.html index 550eeec..e2cfb3e 100644 --- a/cvc5-1.0.1/examples/bags.html +++ b/cvc5-1.0.1/examples/bags.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/bitvectors.html b/cvc5-1.0.1/examples/bitvectors.html index 2e237a0..ca3e369 100644 --- a/cvc5-1.0.1/examples/bitvectors.html +++ b/cvc5-1.0.1/examples/bitvectors.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/bitvectors_and_arrays.html b/cvc5-1.0.1/examples/bitvectors_and_arrays.html index daff397..ffc42fd 100644 --- a/cvc5-1.0.1/examples/bitvectors_and_arrays.html +++ b/cvc5-1.0.1/examples/bitvectors_and_arrays.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/combination.html b/cvc5-1.0.1/examples/combination.html index 72d62d1..160f459 100644 --- a/cvc5-1.0.1/examples/combination.html +++ b/cvc5-1.0.1/examples/combination.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/datatypes.html b/cvc5-1.0.1/examples/datatypes.html index 2fda4ae..d64f886 100644 --- a/cvc5-1.0.1/examples/datatypes.html +++ b/cvc5-1.0.1/examples/datatypes.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/examples.html b/cvc5-1.0.1/examples/examples.html index 654d110..a2deae9 100644 --- a/cvc5-1.0.1/examples/examples.html +++ b/cvc5-1.0.1/examples/examples.html @@ -221,11 +221,6 @@
diff --git a/cvc5-1.0.1/examples/exceptions.html b/cvc5-1.0.1/examples/exceptions.html index b4f3465..b248c79 100644 --- a/cvc5-1.0.1/examples/exceptions.html +++ b/cvc5-1.0.1/examples/exceptions.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/extract.html b/cvc5-1.0.1/examples/extract.html index 9d6a3a4..4a2cd9e 100644 --- a/cvc5-1.0.1/examples/extract.html +++ b/cvc5-1.0.1/examples/extract.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/floatingpoint.html b/cvc5-1.0.1/examples/floatingpoint.html index da8f9b7..c10c71f 100644 --- a/cvc5-1.0.1/examples/floatingpoint.html +++ b/cvc5-1.0.1/examples/floatingpoint.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/helloworld.html b/cvc5-1.0.1/examples/helloworld.html index 05a45c6..762afbb 100644 --- a/cvc5-1.0.1/examples/helloworld.html +++ b/cvc5-1.0.1/examples/helloworld.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/lineararith.html b/cvc5-1.0.1/examples/lineararith.html index 13dd12b..03e407d 100644 --- a/cvc5-1.0.1/examples/lineararith.html +++ b/cvc5-1.0.1/examples/lineararith.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/quickstart.html b/cvc5-1.0.1/examples/quickstart.html index 329feaf..caafd3c 100644 --- a/cvc5-1.0.1/examples/quickstart.html +++ b/cvc5-1.0.1/examples/quickstart.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/relations.html b/cvc5-1.0.1/examples/relations.html index 0c48166..4400f6e 100644 --- a/cvc5-1.0.1/examples/relations.html +++ b/cvc5-1.0.1/examples/relations.html @@ -228,11 +228,6 @@
diff --git a/cvc5-1.0.1/examples/sequences.html b/cvc5-1.0.1/examples/sequences.html index 409e2ad..e5f5e68 100644 --- a/cvc5-1.0.1/examples/sequences.html +++ b/cvc5-1.0.1/examples/sequences.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/sets.html b/cvc5-1.0.1/examples/sets.html index 5f3b418..47c301e 100644 --- a/cvc5-1.0.1/examples/sets.html +++ b/cvc5-1.0.1/examples/sets.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/strings.html b/cvc5-1.0.1/examples/strings.html index aa8d090..59b2c22 100644 --- a/cvc5-1.0.1/examples/strings.html +++ b/cvc5-1.0.1/examples/strings.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/sygus-fun.html b/cvc5-1.0.1/examples/sygus-fun.html index d6a0f59..7bfdc23 100644 --- a/cvc5-1.0.1/examples/sygus-fun.html +++ b/cvc5-1.0.1/examples/sygus-fun.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/sygus-grammar.html b/cvc5-1.0.1/examples/sygus-grammar.html index 1726bb3..455a5e7 100644 --- a/cvc5-1.0.1/examples/sygus-grammar.html +++ b/cvc5-1.0.1/examples/sygus-grammar.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/examples/sygus-inv.html b/cvc5-1.0.1/examples/sygus-inv.html index 0505084..2cb656f 100644 --- a/cvc5-1.0.1/examples/sygus-inv.html +++ b/cvc5-1.0.1/examples/sygus-inv.html @@ -223,11 +223,6 @@
diff --git a/cvc5-1.0.1/genindex.html b/cvc5-1.0.1/genindex.html index 8bb6d5e..5f7c7dd 100644 --- a/cvc5-1.0.1/genindex.html +++ b/cvc5-1.0.1/genindex.html @@ -123,11 +123,6 @@
diff --git a/cvc5-1.0.1/index.html b/cvc5-1.0.1/index.html index ae0bc63..606dd5d 100644 --- a/cvc5-1.0.1/index.html +++ b/cvc5-1.0.1/index.html @@ -123,11 +123,6 @@
diff --git a/cvc5-1.0.1/installation/installation.html b/cvc5-1.0.1/installation/installation.html index 830c1a7..544e027 100644 --- a/cvc5-1.0.1/installation/installation.html +++ b/cvc5-1.0.1/installation/installation.html @@ -271,11 +271,6 @@
diff --git a/cvc5-1.0.1/options.html b/cvc5-1.0.1/options.html index 0f6e09a..c4c62d1 100644 --- a/cvc5-1.0.1/options.html +++ b/cvc5-1.0.1/options.html @@ -243,11 +243,6 @@
diff --git a/cvc5-1.0.1/output-tags.html b/cvc5-1.0.1/output-tags.html index a9732f7..1fc32c0 100644 --- a/cvc5-1.0.1/output-tags.html +++ b/cvc5-1.0.1/output-tags.html @@ -176,11 +176,6 @@
diff --git a/cvc5-1.0.1/proofs/output_alethe.html b/cvc5-1.0.1/proofs/output_alethe.html index 782e93d..6702742 100644 --- a/cvc5-1.0.1/proofs/output_alethe.html +++ b/cvc5-1.0.1/proofs/output_alethe.html @@ -146,11 +146,6 @@
diff --git a/cvc5-1.0.1/proofs/output_dot.html b/cvc5-1.0.1/proofs/output_dot.html index dc2f7a5..692e2ee 100644 --- a/cvc5-1.0.1/proofs/output_dot.html +++ b/cvc5-1.0.1/proofs/output_dot.html @@ -146,11 +146,6 @@
diff --git a/cvc5-1.0.1/proofs/output_lfsc.html b/cvc5-1.0.1/proofs/output_lfsc.html index a5b8804..0f85403 100644 --- a/cvc5-1.0.1/proofs/output_lfsc.html +++ b/cvc5-1.0.1/proofs/output_lfsc.html @@ -146,11 +146,6 @@
diff --git a/cvc5-1.0.1/proofs/proof_rules.html b/cvc5-1.0.1/proofs/proof_rules.html index dab943b..f8189bd 100644 --- a/cvc5-1.0.1/proofs/proof_rules.html +++ b/cvc5-1.0.1/proofs/proof_rules.html @@ -151,11 +151,6 @@
diff --git a/cvc5-1.0.1/proofs/proofs.html b/cvc5-1.0.1/proofs/proofs.html index 505b8cd..1ed165e 100644 --- a/cvc5-1.0.1/proofs/proofs.html +++ b/cvc5-1.0.1/proofs/proofs.html @@ -146,11 +146,6 @@
diff --git a/cvc5-1.0.1/references.html b/cvc5-1.0.1/references.html index bc81a59..f860d10 100644 --- a/cvc5-1.0.1/references.html +++ b/cvc5-1.0.1/references.html @@ -124,11 +124,6 @@
diff --git a/cvc5-1.0.1/resource-limits.html b/cvc5-1.0.1/resource-limits.html index 43c6d69..44ee729 100644 --- a/cvc5-1.0.1/resource-limits.html +++ b/cvc5-1.0.1/resource-limits.html @@ -140,11 +140,6 @@
diff --git a/cvc5-1.0.1/search.html b/cvc5-1.0.1/search.html index 753fce7..bffd386 100644 --- a/cvc5-1.0.1/search.html +++ b/cvc5-1.0.1/search.html @@ -127,11 +127,6 @@
diff --git a/cvc5-1.0.1/statistics.html b/cvc5-1.0.1/statistics.html index 84acac2..4cd0a5c 100644 --- a/cvc5-1.0.1/statistics.html +++ b/cvc5-1.0.1/statistics.html @@ -124,11 +124,6 @@
diff --git a/cvc5-1.0.1/theories/bags.html b/cvc5-1.0.1/theories/bags.html index bc7ee32..5470b75 100644 --- a/cvc5-1.0.1/theories/bags.html +++ b/cvc5-1.0.1/theories/bags.html @@ -194,11 +194,6 @@
diff --git a/cvc5-1.0.1/theories/datatypes.html b/cvc5-1.0.1/theories/datatypes.html index 8cfeda4..b2252db 100644 --- a/cvc5-1.0.1/theories/datatypes.html +++ b/cvc5-1.0.1/theories/datatypes.html @@ -225,11 +225,6 @@
diff --git a/cvc5-1.0.1/theories/separation-logic.html b/cvc5-1.0.1/theories/separation-logic.html index 46f0b03..a3c426f 100644 --- a/cvc5-1.0.1/theories/separation-logic.html +++ b/cvc5-1.0.1/theories/separation-logic.html @@ -200,11 +200,6 @@
diff --git a/cvc5-1.0.1/theories/sequences.html b/cvc5-1.0.1/theories/sequences.html index a473766..708b7c0 100644 --- a/cvc5-1.0.1/theories/sequences.html +++ b/cvc5-1.0.1/theories/sequences.html @@ -190,11 +190,6 @@
diff --git a/cvc5-1.0.1/theories/sets-and-relations.html b/cvc5-1.0.1/theories/sets-and-relations.html index 929ee4a..45dab48 100644 --- a/cvc5-1.0.1/theories/sets-and-relations.html +++ b/cvc5-1.0.1/theories/sets-and-relations.html @@ -194,11 +194,6 @@
diff --git a/cvc5-1.0.1/theories/strings.html b/cvc5-1.0.1/theories/strings.html index c82e9f3..25daf52 100644 --- a/cvc5-1.0.1/theories/strings.html +++ b/cvc5-1.0.1/theories/strings.html @@ -180,11 +180,6 @@
diff --git a/cvc5-1.0.1/theories/theories.html b/cvc5-1.0.1/theories/theories.html index 4cf00c5..c66da4e 100644 --- a/cvc5-1.0.1/theories/theories.html +++ b/cvc5-1.0.1/theories/theories.html @@ -210,11 +210,6 @@
-
- - cvc5-1.0.0 - -
@@ -222,6 +217,16 @@
+
+ + cvc5-1.0.0 + +
+
+ + cvc5-1.0.2 + +
diff --git a/cvc5-1.0.1/theories/transcendentals.html b/cvc5-1.0.1/theories/transcendentals.html index 596bde6..1a293c2 100644 --- a/cvc5-1.0.1/theories/transcendentals.html +++ b/cvc5-1.0.1/theories/transcendentals.html @@ -202,11 +202,6 @@
-
- - cvc5-1.0.0 - -
@@ -214,6 +209,16 @@
+
+ + cvc5-1.0.0 + +
+
+ + cvc5-1.0.2 + +
diff --git a/cvc5-1.0.2/.buildinfo b/cvc5-1.0.2/.buildinfo new file mode 100644 index 0000000..006435f --- /dev/null +++ b/cvc5-1.0.2/.buildinfo @@ -0,0 +1,4 @@ +# Sphinx build info version 1 +# This file hashes the configuration used when building these files. When it is not found, a full rebuild will be done. +config: cc90307da17d2177d86f753df1a7686e +tags: 24e2e6e3418b839b79449e4687624433 diff --git a/cvc5-1.0.2/api/api.html b/cvc5-1.0.2/api/api.html new file mode 100644 index 0000000..2c24011 --- /dev/null +++ b/cvc5-1.0.2/api/api.html @@ -0,0 +1,304 @@ + + + + + + + + API Documentation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+
    +
  • + + + » +
  • +
  • + API Documentation +
  • +
  • +
  • +
+
+
+
+
+
+

+ API Documentation + + ¶ + +

+

+ In addition to using cvc5 + + + as a binary + + + , cvc5 features APIs +for several different programming languages. +While the + + + C++ API + + + is considered the primary interface to cvc5, both the + + + Java API + + + and the + + + base Python API + + + implement a thin wrapper around it. +Additionally, a more pythonic Python API is available at + + https://github.com/cvc5/cvc5_pythonic_api + + and documented + + + here + + + . +

+ +
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/cpp.html b/cvc5-1.0.2/api/cpp/cpp.html new file mode 100644 index 0000000..b037a88 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/cpp.html @@ -0,0 +1,810 @@ + + + + + + + + C++ API — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ C++ API + + ¶ + +

+

+ The C++ API is the primary interface for cvc5 and exposes the full functionality of cvc5. +The + + + quickstart guide + + + gives a short introduction, while the following class hierarchy of the + + + cvc5 + + + namespace provides more details on the individual classes. +For most applications, the + + + + Solver + + + + class is the main entry point to cvc5. +

+ +
+

+ Class hierarchy + + ¶ + +

+

+ + + namespace + + + cvc5 + + + { + + +

+
+
+ +
+
+

+ + + } + + +

+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/datatype.html b/cvc5-1.0.2/api/cpp/datatype.html new file mode 100644 index 0000000..ac5a8fb --- /dev/null +++ b/cvc5-1.0.2/api/cpp/datatype.html @@ -0,0 +1,2717 @@ + + + + + + + + Datatype — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Datatype + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + Datatype + + + + + ¶ + +
+
+
+

+ A cvc5 datatype. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Datatype + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~Datatype + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + + DatatypeConstructor + + + + + + + + + operator + + + + + [] + + + + + ( + + + + size_t + + + + + + + idx + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the datatype constructor at a given index. +

+
+
+ Parameters + + : + +
+
+

+ + idx + + – The index of the datatype constructor to return. +

+
+
+ Returns + + : + +
+
+

+ The datatype constructor with the given index. +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeConstructor + + + + + + + + + operator + + + + + [] + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the datatype constructor with the given name. This is a linear search through the constructors, so in case of multiple, similarly-named constructors, the first is returned. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype constructor. +

+
+
+ Returns + + : + +
+
+

+ The datatype constructor with the given name. +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeConstructor + + + + + + + + + getConstructor + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeSelector + + + + + + + + + getSelector + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the datatype constructor with the given name. This is a linear search through the constructors and their selectors, so in case of multiple, similarly-named selectors, the first is returned. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype selector. +

+
+
+ Returns + + : + +
+
+

+ The datatype selector with the given name. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getName + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The name of this + + + Datatype + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getNumConstructors + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The number of constructors for this + + + Datatype + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + getParameters + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the parameters of this datatype, if it is parametric. +

+
+

+ Note +

+

+ Asserts that this datatype is parametric. +

+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ The parameters of this datatype. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isParametric + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ True if this datatype is parametric. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isCodatatype + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this datatype corresponds to a co-datatype +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isTuple + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this datatype corresponds to a tuple +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRecord + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ True if this datatype corresponds to a record. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFinite + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this datatype is finite +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isWellFounded + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this datatype is well-founded. +

+

+ If this datatype is not a codatatype, this returns false if there are no values of this datatype that are of finite size. +

+
+
+ Returns + + : + +
+
+

+ True if this datatype is well-founded. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + Datatype + + + is a null object. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this datatype. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + begin + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to the first constructor of this datatype. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + end + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to one-off-the-last constructor of this datatype. +

+
+
+
+
+
+
+
+ + + + + + + + + + + class + + + + + + + + const_iterator + + + + + ¶ + +
+
+
+

+ Iterator for the constructors of a datatype. +

+
+

+ Public Types +

+
+
+ + + + + + + + + using + + + + + + + + iterator_category + + + + + + + + = + + + + + + + std + + + + + :: + + + + + forward_iterator_tag + + + + ¶ + +
+
+
+

+ Iterator tag +

+
+
+
+
+ + + + + + + + + using + + + + + + + + value_type + + + + + + + + = + + + + + + + + Datatype + + + + + ¶ + +
+
+
+

+ The type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + pointer + + + + + + + + = + + + + + + + const + + + + + + + + Datatype + + + + + + * + + + + ¶ + +
+
+
+

+ The pointer type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + reference + + + + + + + + = + + + + + + + const + + + + + + + + Datatype + + + + + + & + + + + ¶ + +
+
+
+

+ The reference type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + difference_type + + + + + + + + = + + + + + + + std + + + + + :: + + + + + ptrdiff_t + + + + ¶ + +
+
+
+

+ The type returned when two iterators are subtracted +

+
+
+
+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + const_iterator + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Nullary constructor (required for Cython). +

+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + = + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + ¶ + +
+
+
+

+ Assignment operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to assign to. +

+
+
+ Returns + + : + +
+
+

+ The reference to the iterator after assignment. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Equality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Disequality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are disequal. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + ++ + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Increment operator (prefix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + operator + + + + + ++ + + + + + ( + + + + int + + + + ) + + + ¶ + +
+
+
+

+ Increment operator (postfix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + + DatatypeConstructor + + + + + + + + & + + + + + + operator + + + + + * + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Dereference operator. +

+
+
+ Returns + + : + +
+
+

+ A reference to the constructor this iterator points to. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + + DatatypeConstructor + + + + + + + + * + + + + + + operator + + + + + -> + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Dereference operator. +

+
+
+ Returns + + : + +
+
+

+ A pointer to the constructor this iterator points to. +

+
+
+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/datatypeconstructor.html b/cvc5-1.0.2/api/cpp/datatypeconstructor.html new file mode 100644 index 0000000..cbfced7 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/datatypeconstructor.html @@ -0,0 +1,2557 @@ + + + + + + + + DatatypeConstructor — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ DatatypeConstructor + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + DatatypeConstructor + + + + + ¶ + +
+
+
+

+ A cvc5 datatype constructor. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + DatatypeConstructor + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~DatatypeConstructor + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getName + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The name of this + + + Datatype + + + constructor. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getTerm + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the constructor term of this datatype constructor. +

+

+ + + Datatype + + + constructors are a special class of function-like terms whose sort is datatype constructor ( + + + Sort::isDatatypeConstructor() + + + ). All datatype constructors, including nullary ones, should be used as the first argument to Terms whose kind is + + + APPLY_CONSTRUCTOR + + + . For example, the nil list can be constructed by + + + + + Solver::mkTerm + + + + + (APPLY_CONSTRUCTOR, + + + {t}) + + + , where + + + t + + + is the term returned by this method. +

+
+

+ Note +

+

+ This method should not be used for parametric datatypes. Instead, use the method + + + DatatypeConstructor::getInstantiatedTerm() + + + below. +

+
+
+
+ Returns + + : + +
+
+

+ The constructor term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getInstantiatedTerm + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + retSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the constructor term of this datatype constructor whose return type is + + + retSort + + + . +

+

+ This method is intended to be used on constructors of parametric datatypes and can be seen as returning the constructor term that has been explicitly cast to the given sort. +

+

+ This method is required for constructors of parametric datatypes whose return type cannot be determined by type inference. For example, given: +

+

+

+
+
+
(declare-datatype List
+    (par (T) ((nil) (cons (head T) (tail (List T))))))
+
+
+
+

+ The type of nil terms must be provided by the user. In SMT version 2.6, this is done via the syntax for qualified identifiers: +

+

+

+
+
+
(as nil (List Int))
+
+
+
+

+ This method is equivalent of applying the above, where this + + + DatatypeConstructor + + + is the one corresponding to + + + nil + + + , and + + + retSort + + + is + + + (List + + + Int) + + + . +

+
+

+ Note +

+

+ The returned constructor term + + + t + + + is used to construct the above (nullary) application of + + + nil + + + with + + + + + Solver::mkTerm + + + + + (APPLY_CONSTRUCTOR, + + + {t}) + + + . +

+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + retSort + + – The desired return sort of the constructor. +

+
+
+ Returns + + : + +
+
+

+ The constructor term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getTesterTerm + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the tester term of this datatype constructor. +

+

+ Similar to constructors, testers are a class of function-like terms of tester sort ( + + + Sort::isDatatypeConstructor() + + + ) which should be used as the first argument of Terms of kind + + + APPLY_TESTER + + + . +

+
+
+ Returns + + : + +
+
+

+ The tester term. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getNumSelectors + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The number of selectors (so far) of this + + + Datatype + + + constructor. +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeSelector + + + + + + + + + operator + + + + + [] + + + + + ( + + + + size_t + + + + + + + index + + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The i^th + + + DatatypeSelector + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeSelector + + + + + + + + + operator + + + + + [] + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the datatype selector with the given name. This is a linear search through the selectors, so in case of multiple, similarly-named selectors, the first is returned. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype selector. +

+
+
+ Returns + + : + +
+
+

+ The first datatype selector with the given name. +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeSelector + + + + + + + + + getSelector + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the datatype selector with the given name. This is a linear search through the selectors, so in case of multiple, similarly-named selectors, the first is returned. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype selector. +

+
+
+ Returns + + : + +
+
+

+ The first datatype selector with the given name. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + DatatypeConstructor + + + is a null object. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this datatype constructor. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + begin + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to the first selector of this constructor. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + end + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to one-off-the-last selector of this constructor. +

+
+
+
+
+
+
+
+ + + + + + + + + + + class + + + + + + + + const_iterator + + + + + ¶ + +
+
+
+

+ Iterator for the selectors of a datatype constructor. +

+
+

+ Public Types +

+
+
+ + + + + + + + + using + + + + + + + + iterator_category + + + + + + + + = + + + + + + + std + + + + + :: + + + + + forward_iterator_tag + + + + ¶ + +
+
+
+

+ Iterator tag +

+
+
+
+
+ + + + + + + + + using + + + + + + + + value_type + + + + + + + + = + + + + + + + + DatatypeConstructor + + + + + ¶ + +
+
+
+

+ The type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + pointer + + + + + + + + = + + + + + + + const + + + + + + + + DatatypeConstructor + + + + + + * + + + + ¶ + +
+
+
+

+ The pointer type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + reference + + + + + + + + = + + + + + + + const + + + + + + + + DatatypeConstructor + + + + + + & + + + + ¶ + +
+
+
+

+ The reference type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + difference_type + + + + + + + + = + + + + + + + std + + + + + :: + + + + + ptrdiff_t + + + + ¶ + +
+
+
+

+ The type returned when two iterators are subtracted +

+
+
+
+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + const_iterator + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Nullary constructor (required for Cython). +

+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + = + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + ¶ + +
+
+
+

+ Assignment operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to assign to. +

+
+
+ Returns + + : + +
+
+

+ The reference to the iterator after assignment. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Equality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Disequality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are disequal. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + ++ + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Increment operator (prefix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + operator + + + + + ++ + + + + + ( + + + + int + + + + ) + + + ¶ + +
+
+
+

+ Increment operator (postfix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + + DatatypeSelector + + + + + + + + & + + + + + + operator + + + + + * + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Dereference operator. +

+
+
+ Returns + + : + +
+
+

+ A reference to the selector this iterator points to. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + + DatatypeSelector + + + + + + + + * + + + + + + operator + + + + + -> + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Dereference operator. +

+
+
+ Returns + + : + +
+
+

+ A pointer to the selector this iterator points to. +

+
+
+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/datatypeconstructordecl.html b/cvc5-1.0.2/api/cpp/datatypeconstructordecl.html new file mode 100644 index 0000000..8541a46 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/datatypeconstructordecl.html @@ -0,0 +1,968 @@ + + + + + + + + DatatypeConstructorDecl — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ DatatypeConstructorDecl + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + DatatypeConstructorDecl + + + + + ¶ + +
+
+
+

+ A cvc5 datatype constructor declaration. A datatype constructor declaration is a specification used for creating a datatype constructor. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + DatatypeConstructorDecl + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~DatatypeConstructorDecl + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSelector + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + ¶ + +
+
+
+

+ Add datatype selector declaration. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + name + + – The name of the datatype selector declaration to add. +

    +
  • +
  • +

    + + sort + + – The codomain sort of the datatype selector declaration to add. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSelectorSelf + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + ¶ + +
+
+
+

+ Add datatype selector declaration whose codomain type is the datatype itself. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype selector declaration to add. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSelectorUnresolved + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + , + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + unresDataypeName + + + + ) + + + ¶ + +
+
+
+

+ Add datatype selector declaration whose codomain sort is an unresolved datatype with the given name. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + name + + – The name of the datatype selector declaration to add. +

    +
  • +
  • +

    + + unresDataypeName + + – The name of the unresolved datatype. The codomain of the selector will be the resolved datatype with the given name. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + DatatypeConstructorDecl + + + is a null declaration. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this datatype constructor declaration. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/datatypedecl.html b/cvc5-1.0.2/api/cpp/datatypedecl.html new file mode 100644 index 0000000..056f1aa --- /dev/null +++ b/cvc5-1.0.2/api/cpp/datatypedecl.html @@ -0,0 +1,979 @@ + + + + + + + + DatatypeDecl — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ DatatypeDecl + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + DatatypeDecl + + + + + ¶ + +
+
+
+

+ A cvc5 datatype declaration. A datatype declaration is not itself a datatype (see + + + Datatype + + + ), but a specification for creating a datatype sort. +

+

+ The interface for a datatype declaration coincides with the syntax for the SMT-LIB 2.6 command + + + declare-datatype + + + , or a single datatype within the + + + declare-datatypes + + + command. +

+

+ + + Datatype + + + sorts can be constructed from + + + DatatypeDecl + + + using the methods: +

+ +
+

+ Public Functions +

+
+
+ + + + + + + + + + + + DatatypeDecl + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~DatatypeDecl + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addConstructor + + + + + ( + + + + const + + + + + + + + DatatypeConstructorDecl + + + + + + + + & + + + + + ctor + + + + ) + + + ¶ + +
+
+
+

+ Add datatype constructor declaration. +

+
+
+ Parameters + + : + +
+
+

+ + ctor + + – The datatype constructor declaration to add. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getNumConstructors + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the number of constructors (so far) for this + + + Datatype + + + declaration. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isParametric + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this + + + Datatype + + + declaration is parametric. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isResolved + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Is this datatype declaration resolved (i.e,. has it been used to declare a datatype already)? +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + DatatypeDecl + + + is a null object. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this datatype declaration. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getName + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The name of this datatype declaration. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/datatypeselector.html b/cvc5-1.0.2/api/cpp/datatypeselector.html new file mode 100644 index 0000000..e9e9487 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/datatypeselector.html @@ -0,0 +1,905 @@ + + + + + + + + DatatypeSelector — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ DatatypeSelector + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + DatatypeSelector + + + + + ¶ + +
+
+
+

+ A cvc5 datatype selector. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + DatatypeSelector + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~DatatypeSelector + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getName + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The name of this + + + Datatype + + + selector. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getTerm + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the selector term of this datatype selector. +

+

+ Selector terms are a class of function-like terms of selector sort ( + + + Sort::isDatatypeSelector() + + + ), and should be used as the first argument of Terms of kind + + + APPLY_SELECTOR + + + . +

+
+
+ Returns + + : + +
+
+

+ The selector term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getUpdaterTerm + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the updater term of this datatype selector. +

+

+ Similar to selectors, updater terms are a class of function-like terms of updater + + + Sort + + + ( + + + Sort::isDatatypeUpdater() + + + ), and should be used as the first argument of Terms of kind + + + APPLY_UPDATER + + + . +

+
+
+ Returns + + : + +
+
+

+ The updater term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getCodomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The codomain sort of this selector. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + DatatypeSelector + + + is a null object. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this datatype selector. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/driveroptions.html b/cvc5-1.0.2/api/cpp/driveroptions.html new file mode 100644 index 0000000..7f1bb0f --- /dev/null +++ b/cvc5-1.0.2/api/cpp/driveroptions.html @@ -0,0 +1,639 @@ + + + + + + + + DriverOptions — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ DriverOptions + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + DriverOptions + + + + + ¶ + +
+
+
+

+

+

+ This class provides type-safe access to a few options that frontends are +likely to use, but can not be not be communicated appropriately via the +regular + + + + Solver::getOption() + + + + or + + + + Solver::getOptionInfo() + + + + methods. +This includes, e.g., the input and output streams that can be configured via + + + err + + + , + + + in + + + and + + + out + + + . This class does not store the options itself, but only +acts as a wrapper to the solver object. It can thus no longer be used after +the solver object has been destroyed. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + std + + + + + :: + + + + + istream + + + + + + + & + + + + + + in + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Access the solver’s input stream +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + err + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Access the solver’s error output stream +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + out + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Access the solver’s output stream +

+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/exceptions.html b/cvc5-1.0.2/api/cpp/exceptions.html new file mode 100644 index 0000000..63828ec --- /dev/null +++ b/cvc5-1.0.2/api/cpp/exceptions.html @@ -0,0 +1,1114 @@ + + + + + + + + Exceptions — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Exceptions + + ¶ + +

+

+ The cvc5 API communicates certain errors using exceptions. We broadly +distinguish two types of exceptions: + + + + CVC5ApiException + + + + and + + + + CVC5ApiRecoverableException + + + + (which is derived from + + + + CVC5ApiException + + + + ). +

+

+ If any method fails with a + + + + CVC5ApiRecoverableException + + + + , the solver behaves as if the failing +method was not called. The solver can still be used safely. +

+

+ If, however, a method fails with a + + + + CVC5ApiException + + + + , the associated object may be in an unsafe state +and it should no longer be used. +

+
+
+ + + + + + + + + + + class + + + + + + + + CVC5ApiException + + + + + + + + : + + + + + + + public + + + + + + + exception + + + + ¶ + +
+
+
+

+ Base class for all API exceptions. If thrown, all API objects may be in an unsafe state. +

+

+ Subclassed by + + + cvc5::CVC5ApiRecoverableException + + +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + inline + + + + + + + + CVC5ApiException + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + str + + + + ) + + + ¶ + +
+
+
+

+ Construct with message from a string. +

+
+
+ Parameters + + : + +
+
+

+ + str + + – The error message. +

+
+
+
+
+
+
+ + + + + + + + + + + inline + + + + + + + + CVC5ApiException + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + stringstream + + + + + + + & + + + + + stream + + + + ) + + + ¶ + +
+
+
+

+ Construct with message from a string stream. +

+
+
+ Parameters + + : + +
+
+

+ + stream + + – The error message. +

+
+
+
+
+
+
+ + + + + + + + + + + inline + + + + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + + getMessage + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Retrieve the message from this exception. +

+
+
+ Returns + + : + +
+
+

+ The error message. +

+
+
+
+
+
+
+ + + + + + + + + + + inline + + + + + + + const + + + + + + + char + + + + + + + * + + + + + + what + + + + + ( + + + ) + + + + + + const + + + + + + + noexcept + + + + + + + override + + + + ¶ + +
+
+
+

+ Retrieve the message as a C-style array. +

+
+
+ Returns + + : + +
+
+

+ The error message. +

+
+
+
+
+
+
+
+
+
+ + + + + + + + + + + class + + + + + + + + CVC5ApiRecoverableException + + + + + + + + : + + + + + + + public + + + + + + + cvc5 + + + + + :: + + + + + + CVC5ApiException + + + + + ¶ + +
+
+
+

+ A recoverable API exception. If thrown, API objects can still be used. +

+

+ Subclassed by cvc5::CVC5ApiOptionException, cvc5::CVC5ApiUnsupportedException +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + inline + + + + + + + + CVC5ApiRecoverableException + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + str + + + + ) + + + ¶ + +
+
+
+

+ Construct with message from a string. +

+
+
+ Parameters + + : + +
+
+

+ + str + + – The error message. +

+
+
+
+
+
+
+ + + + + + + + + + + inline + + + + + + + + CVC5ApiRecoverableException + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + stringstream + + + + + + + & + + + + + stream + + + + ) + + + ¶ + +
+
+
+

+ Construct with message from a string stream. +

+
+
+ Parameters + + : + +
+
+

+ + stream + + – The error message. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/grammar.html b/cvc5-1.0.2/api/cpp/grammar.html new file mode 100644 index 0000000..8a2c9e9 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/grammar.html @@ -0,0 +1,1020 @@ + + + + + + + + Grammar — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Grammar + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + Grammar + + + + + ¶ + +
+
+
+

+ A Sygus + + + Grammar + + + . This class can be used to define a context-free grammar of terms. Its interface coincides with the definition of grammars ( + + + GrammarDef + + + ) in the SyGuS IF 2.1 standard. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + void + + + + + + + + addRule + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + ntSymbol + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + rule + + + + ) + + + ¶ + +
+
+
+

+ Add + + + rule + + + to the set of rules corresponding to + + + ntSymbol + + + . +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + ntSymbol + + – The non-terminal to which the rule is added. +

    +
  • +
  • +

    + + rule + + – The rule to add. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addRules + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + ntSymbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + rules + + + + ) + + + ¶ + +
+
+
+

+ Add + + + rules + + + to the set of rules corresponding to + + + ntSymbol + + + . +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + ntSymbol + + – The non-terminal to which the rules are added. +

    +
  • +
  • +

    + + rules + + – The rules to add. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addAnyConstant + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + ntSymbol + + + + ) + + + ¶ + +
+
+
+

+ Allow + + + ntSymbol + + + to be an arbitrary constant. +

+
+
+ Parameters + + : + +
+
+

+ + ntSymbol + + – The non-terminal allowed to be any constant. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addAnyVariable + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + ntSymbol + + + + ) + + + ¶ + +
+
+
+

+ Allow + + + ntSymbol + + + to be any input variable to corresponding synth-fun/synth-inv with the same sort as + + + ntSymbol + + + . +

+
+
+ Parameters + + : + +
+
+

+ + ntSymbol + + – The non-terminal allowed to be any input variable. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this grammar. +

+
+
+
+
+
+
+ + + + + + + + + + + + Grammar + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Nullary constructor. Needed for the Cython API. +

+
+
+
+
+

+ Friends +

+
+
+ + + friend + + + class + + + + cvc5::Command + +
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/kind.html b/cvc5-1.0.2/api/cpp/kind.html new file mode 100644 index 0000000..a0c0208 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/kind.html @@ -0,0 +1,36300 @@ + + + + + + + + Kind — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Kind + + ¶ + +

+

+ Every + + + + Term + + + + has an associated kind. +This kind distinguishes if the Term is a value, constant, variable or operator, +and what kind of each. +For example, a bit-vector value has kind + + + + CONST_BITVECTOR + + + + , +a free constant symbol has kind + + + + CONSTANT + + + + , +an equality over terms of any sort has kind + + + + EQUAL + + + + , and a universally +quantified formula has kind + + + + FORALL + + + + . +

+
+
+ + + + + + + + + enum + + + + + + + + cvc5 + + + + + :: + + + + + + + Kind + + + + + ¶ + +
+
+
+

+ The kind of a cvc5 + + + Term + + + . +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + INTERNAL_KIND + + + + + ¶ + +
+
+
+

+ Internal kind. +

+

+ This kind serves as an abstraction for internal kinds that are not exposed via the API but may appear in terms returned by API functions, e.g., when querying the simplified form of a term. +

+

+

+

+

+
+

+ Note +

+

+ Should never be created via the API. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + UNDEFINED_KIND + + + + + ¶ + +
+
+
+

+ Undefined kind. +

+

+

+

+

+
+

+ Note +

+

+ Should never be exposed or created via the API. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + NULL_TERM + + + + + ¶ + +
+
+
+

+ Null kind. +

+

+ The kind of a null term ( + + + Term::Term() + + + ). +

+

+

+

+

+
+

+ Note +

+

+ May not be explicitly created via API functions other than + + + + Term::Term() + + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + UNINTERPRETED_SORT_VALUE + + + + + ¶ + +
+
+
+

+ The value of an uninterpreted constant. +

+

+

+

+

+
+

+ Note +

+

+ May be returned as the result of an API call, but terms of this +kind may not be created explicitly via the API and may not +appear in assertions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + EQUAL + + + + + ¶ + +
+
+
+

+ Equality, chainable. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + DISTINCT + + + + + ¶ + +
+
+
+

+ Disequality. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONSTANT + + + + + ¶ + +
+
+
+

+ Free constant symbol. +

+

+

+
    +
  • +

    + Create + + + Term + + + of this Kind with: +

    +
      +
    • +

      + Solver::mkConst(const Sort&, const std::string&) const +

      +
    • +
    • +

      + Solver::mkConst(const Sort&) const +

      +
    • +
    +
  • +
+

+

+

+

+
+

+ Note +

+

+ Not permitted in bindings (e.g., + + + + FORALL + + + + , + + + + EXISTS + + + + ). +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + VARIABLE + + + + + ¶ + +
+
+
+

+ (Bound) variable. +

+

+

+
    +
  • +

    + Create + + + Term + + + of this Kind with: +

    +
      +
    • +

      + Solver::mkVar(const Sort&, const std::string&) const +

      +
    • +
    +
  • +
+

+

+

+

+
+

+ Note +

+

+ Only permitted in bindings and in lambda and quantifier bodies. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEXPR + + + + + ¶ + +
+
+
+

+ Symbolic expression. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LAMBDA + + + + + ¶ + +
+
+
+

+ Lambda expression. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + WITNESS + + + + + ¶ + +
+
+
+

+ Witness. +

+

+ The syntax of a witness term is similar to a quantified formula except that only one variable is allowed. For example, the term +

+

+

+
+
+
(witness ((x S)) F)
+
+
+
+

+ returns an element + + \(x\) + + of Sort + + \(S\) + + and asserts formula + + \(F\) + + . +

+

+ The witness operator behaves like the description operator +(see + + https://planetmath.org/hilbertsvarepsilonoperator + + ) if there is +no + + \(x\) + + that satisfies + + \(F\) + + . But if such + + \(x\) + + exists, the +witness operator does not enforce the following axiom which ensures +uniqueness up to logical equivalence: +

+
+ \[\forall x. F \equiv G \Rightarrow witness~x. F = witness~x. G\] +
+

+ For example, if there are two elements of Sort + + \(S\) + + that satisfy +formula + + \(F\) + + , then the following formula is satisfiable: +

+
+
+
(distinct
+   (witness ((x Int)) F)
+   (witness ((x Int)) F))
+
+
+
+

+

+ +

+

+

+

+
+

+ Note +

+

+ This kind is primarily used internally, but may be returned in +models (e.g., for arithmetic terms in non-linear queries). However, +it is not supported by the parser. Moreover, the user of the API +should be cautious when using this operator. In general, all witness +terms + + + (witness + + + ((x + + + Int)) + + + F) + + + should be such that + + + (exists + + + ((x + + + Int)) + + + F) + + + is a valid formula. If this is not the case, then the semantics +in formulas that use witness terms may be unintuitive. For example, +the following formula is unsatisfiable: + + + (or + + + (= + + + (witness + + + ((x + + + Int)) + + + false) + + + 0) + + + (not + + + (= + + + (witness + + + ((x + + + Int)) + + + false) + + + 0)) + + + , whereas notice that + + + (or + + + (= + + + z + + + 0) + + + (not + + + (= + + + z + + + 0))) + + + is +true for any + + \(z\) + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_BOOLEAN + + + + + ¶ + +
+
+
+

+ Boolean constant. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + NOT + + + + + ¶ + +
+
+
+

+ Logical negation. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + AND + + + + + ¶ + +
+
+
+

+ Logical conjunction. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + IMPLIES + + + + + ¶ + +
+
+
+

+ Logical implication. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + OR + + + + + ¶ + +
+
+
+

+ Logical disjunction. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + XOR + + + + + ¶ + +
+
+
+

+ Logical exclusive disjunction, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ITE + + + + + ¶ + +
+
+
+

+ If-then-else. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + APPLY_UF + + + + + ¶ + +
+
+
+

+ Application of an uninterpreted function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CARDINALITY_CONSTRAINT + + + + + ¶ + +
+
+
+

+ Cardinality constraint on uninterpreted sort. +

+

+ Interpreted as a predicate that is true when the cardinality of +uinterpreted Sort + + \(S\) + + is less than or equal to an upper bound. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + HO_APPLY + + + + + ¶ + +
+
+
+

+ Higher-order applicative encoding of function application, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ADD + + + + + ¶ + +
+
+
+

+ Arithmetic addition. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + MULT + + + + + ¶ + +
+
+
+

+ Arithmetic multiplication. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + IAND + + + + + ¶ + +
+
+
+

+ Integer and. +

+

+

+

+ Operator for bit-wise + + + AND + + + over integers, parameterized by a (positive) +bit-width + + \(k\) + + . +

+
+
+
((_ iand k) i_1 i_2)
+
+
+
+

+ is equivalent to +

+
+
+
((_ iand k) i_1 i_2)
+(bv2int (bvand ((_ int2bv k) i_1) ((_ int2bv k) i_2)))
+
+
+
+

+ for all integers + + + i_1 + + + , + + + i_2 + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1..2: + + + Terms of Sort Int +

      +
    • +
    +
  • +
  • +

    + Indices: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Bit-width + + \(k\) + +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + POW2 + + + + + ¶ + +
+
+
+

+ Power of two. +

+

+ Operator for raising + + + 2 + + + to a non-negative integer power. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SUB + + + + + ¶ + +
+
+
+

+ Arithmetic subtraction, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + NEG + + + + + ¶ + +
+
+
+

+ Arithmetic negation. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + DIVISION + + + + + ¶ + +
+
+
+

+ Real division, division by 0 undefined, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INTS_DIVISION + + + + + ¶ + +
+
+
+

+ Integer division, division by 0 undefined, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INTS_MODULUS + + + + + ¶ + +
+
+
+

+ Integer modulus, modulus by 0 undefined. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ABS + + + + + ¶ + +
+
+
+

+ Absolute value. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + POW + + + + + ¶ + +
+
+
+

+ Arithmetic power. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + EXPONENTIAL + + + + + ¶ + +
+
+
+

+ Exponential function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SINE + + + + + ¶ + +
+
+
+

+ Sine function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + COSINE + + + + + ¶ + +
+
+
+

+ Cosine function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TANGENT + + + + + ¶ + +
+
+
+

+ Tangent function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + COSECANT + + + + + ¶ + +
+
+
+

+ Cosecant function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SECANT + + + + + ¶ + +
+
+
+

+ Secant function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + COTANGENT + + + + + ¶ + +
+
+
+

+ Cotangent function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCSINE + + + + + ¶ + +
+
+
+

+ Arc sine function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCCOSINE + + + + + ¶ + +
+
+
+

+ Arc cosine function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCTANGENT + + + + + ¶ + +
+
+
+

+ Arc tangent function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCCOSECANT + + + + + ¶ + +
+
+
+

+ Arc cosecant function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCSECANT + + + + + ¶ + +
+
+
+

+ Arc secant function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ARCCOTANGENT + + + + + ¶ + +
+
+
+

+ Arc cotangent function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SQRT + + + + + ¶ + +
+
+
+

+ Square root. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + DIVISIBLE + + + + + ¶ + +
+
+
+

+

+

+ Operator for the divisibility-by- + + \(k\) + + predicate. +

+
    +
  • +

    + Arity: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort Int +

      +
    • +
    +
  • +
  • +

    + Indices: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + The integer + + \(k\) + + to divide by. +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_RATIONAL + + + + + ¶ + +
+
+
+

+ Arbitrary-precision rational constant. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_INTEGER + + + + + ¶ + +
+
+
+

+ Arbitrary-precision integer constant. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LT + + + + + ¶ + +
+
+
+

+ Less than, chainable. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEQ + + + + + ¶ + +
+
+
+

+ Less than or equal, chainable. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + GT + + + + + ¶ + +
+
+
+

+ Greater than, chainable. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + GEQ + + + + + ¶ + +
+
+
+

+ Greater than or equal, chainable. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + IS_INTEGER + + + + + ¶ + +
+
+
+

+ Is-integer predicate. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TO_INTEGER + + + + + ¶ + +
+
+
+

+ Convert + + + Term + + + of sort Int or Real to Int via the floor function. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TO_REAL + + + + + ¶ + +
+
+
+

+ Convert + + + Term + + + of + + + Sort + + + Int or Real to Real. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + PI + + + + + ¶ + +
+
+
+

+ Pi constant. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ + + + PI + + + + is considered a special symbol of Sort +Real, but is not a Real value, i.e., + + + + Term::isRealValue() + + + + will return + + + false + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_BITVECTOR + + + + + ¶ + +
+
+
+

+ Fixed-size bit-vector constant. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_CONCAT + + + + + ¶ + +
+
+
+

+ Concatenation of two or more bit-vectors. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_AND + + + + + ¶ + +
+
+
+

+ Bit-wise and. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_OR + + + + + ¶ + +
+
+
+

+ Bit-wise or. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_XOR + + + + + ¶ + +
+
+
+

+ Bit-wise xor. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_NOT + + + + + ¶ + +
+
+
+

+ Bit-wise negation. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_NAND + + + + + ¶ + +
+
+
+

+ Bit-wise nand. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_NOR + + + + + ¶ + +
+
+
+

+ Bit-wise nor. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_XNOR + + + + + ¶ + +
+
+
+

+ Bit-wise xnor, left associative. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_COMP + + + + + ¶ + +
+
+
+

+ Equality comparison (returns bit-vector of size + + + 1 + + + ). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_MULT + + + + + ¶ + +
+
+
+

+ Multiplication of two or more bit-vectors. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ADD + + + + + ¶ + +
+
+
+

+ Addition of two or more bit-vectors. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SUB + + + + + ¶ + +
+
+
+

+ Subtraction of two bit-vectors. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_NEG + + + + + ¶ + +
+
+
+

+ Negation of a bit-vector (two’s complement). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_UDIV + + + + + ¶ + +
+
+
+

+ Unsigned bit-vector division. +

+

+ Truncates towards + + + 0 + + + . If the divisor is zero, the result is all ones. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_UREM + + + + + ¶ + +
+
+
+

+ Unsigned bit-vector remainder. +

+

+ Remainder from unsigned bit-vector division. If the modulus is zero, the result is the dividend. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SDIV + + + + + ¶ + +
+
+
+

+ Signed bit-vector division. +

+

+ Two’s complement signed division of two bit-vectors. If the divisor is zero and the dividend is positive, the result is all ones. If the divisor is zero and the dividend is negative, the result is one. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SREM + + + + + ¶ + +
+
+
+

+ Signed bit-vector remainder (sign follows dividend). +

+

+ Two’s complement signed remainder of two bit-vectors where the sign follows the dividend. If the modulus is zero, the result is the dividend. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SMOD + + + + + ¶ + +
+
+
+

+ Signed bit-vector remainder (sign follows divisor). +

+

+ Two’s complement signed remainder where the sign follows the divisor. If the modulus is zero, the result is the dividend. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SHL + + + + + ¶ + +
+
+
+

+ Bit-vector shift left. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_LSHR + + + + + ¶ + +
+
+
+

+ Bit-vector logical shift right. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ASHR + + + + + ¶ + +
+
+
+

+ Bit-vector arithmetic shift right. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ULT + + + + + ¶ + +
+
+
+

+ Bit-vector unsigned less than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ULE + + + + + ¶ + +
+
+
+

+ Bit-vector unsigned less than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_UGT + + + + + ¶ + +
+
+
+

+ Bit-vector unsigned greater than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_UGE + + + + + ¶ + +
+
+
+

+ Bit-vector unsigned greater than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SLT + + + + + ¶ + +
+
+
+

+ Bit-vector signed less than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SLE + + + + + ¶ + +
+
+
+

+ Bit-vector signed less than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SGT + + + + + ¶ + +
+
+
+

+ Bit-vector signed greater than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SGE + + + + + ¶ + +
+
+
+

+ Bit-vector signed greater than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ULTBV + + + + + ¶ + +
+
+
+

+ Bit-vector unsigned less than returning a bit-vector of size 1. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SLTBV + + + + + ¶ + +
+
+
+

+ Bit-vector signed less than returning a bit-vector of size + + + 1 + + + . +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ITE + + + + + ¶ + +
+
+
+

+ Bit-vector if-then-else. +

+

+ Same semantics as regular ITE, but condition is bit-vector of size + + + 1 + + + . +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_REDOR + + + + + ¶ + +
+
+
+

+ Bit-vector redor. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_REDAND + + + + + ¶ + +
+
+
+

+ Bit-vector redand. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_EXTRACT + + + + + ¶ + +
+
+
+

+ Bit-vector extract. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_REPEAT + + + + + ¶ + +
+
+
+

+ Bit-vector repeat. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ZERO_EXTEND + + + + + ¶ + +
+
+
+

+ Bit-vector zero extension. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_SIGN_EXTEND + + + + + ¶ + +
+
+
+

+ Bit-vector sign extension. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ROTATE_LEFT + + + + + ¶ + +
+
+
+

+ Bit-vector rotate left. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_ROTATE_RIGHT + + + + + ¶ + +
+
+
+

+ Bit-vector rotate right. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INT_TO_BITVECTOR + + + + + ¶ + +
+
+
+

+ Conversion from Int to bit-vector. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BITVECTOR_TO_NAT + + + + + ¶ + +
+
+
+

+ Bit-vector conversion to (non-negative) integer. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_FLOATINGPOINT + + + + + ¶ + +
+
+
+

+ Floating-point constant, created from IEEE-754 bit-vector representation of the floating-point value. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_ROUNDINGMODE + + + + + ¶ + +
+
+
+

+ RoundingMode constant. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_FP + + + + + ¶ + +
+
+
+

+ Create floating-point literal from bit-vector triple. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_EQ + + + + + ¶ + +
+
+
+

+ Floating-point equality. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_ABS + + + + + ¶ + +
+
+
+

+ Floating-point absolute value. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_NEG + + + + + ¶ + +
+
+
+

+ Floating-point negation. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_ADD + + + + + ¶ + +
+
+
+

+ Floating-point addition. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_SUB + + + + + ¶ + +
+
+
+

+ Floating-point sutraction. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_MULT + + + + + ¶ + +
+
+
+

+ Floating-point multiply. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_DIV + + + + + ¶ + +
+
+
+

+ Floating-point division. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_FMA + + + + + ¶ + +
+
+
+

+ Floating-point fused multiply and add. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_SQRT + + + + + ¶ + +
+
+
+

+ Floating-point square root. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_REM + + + + + ¶ + +
+
+
+

+ Floating-point remainder. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_RTI + + + + + ¶ + +
+
+
+

+ Floating-point round to integral. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_MIN + + + + + ¶ + +
+
+
+

+ Floating-point minimum. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_MAX + + + + + ¶ + +
+
+
+

+ Floating-point maximum. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_LEQ + + + + + ¶ + +
+
+
+

+ Floating-point less than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_LT + + + + + ¶ + +
+
+
+

+ Floating-point less than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_GEQ + + + + + ¶ + +
+
+
+

+ Floating-point greater than or equal. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_GT + + + + + ¶ + +
+
+
+

+ Floating-point greater than. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_NORMAL + + + + + ¶ + +
+
+
+

+ Floating-point is normal tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_SUBNORMAL + + + + + ¶ + +
+
+
+

+ Floating-point is sub-normal tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_ZERO + + + + + ¶ + +
+
+
+

+ Floating-point is zero tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_INF + + + + + ¶ + +
+
+
+

+ Floating-point is infinite tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_NAN + + + + + ¶ + +
+
+
+

+ Floating-point is NaN tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_NEG + + + + + ¶ + +
+
+
+

+ Floating-point is negative tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_IS_POS + + + + + ¶ + +
+
+
+

+ Floating-point is positive tester. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_FP_FROM_IEEE_BV + + + + + ¶ + +
+
+
+

+ Conversion to floating-point from IEEE-754 bit-vector. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_FP_FROM_FP + + + + + ¶ + +
+
+
+

+ Conversion to floating-point from floating-point. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_FP_FROM_REAL + + + + + ¶ + +
+
+
+

+ Conversion to floating-point from Real. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_FP_FROM_SBV + + + + + ¶ + +
+
+
+

+ Conversion to floating-point from signed bit-vector. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_FP_FROM_UBV + + + + + ¶ + +
+
+
+

+ Conversion to floating-point from unsigned bit-vector. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_UBV + + + + + ¶ + +
+
+
+

+ Conversion to unsigned bit-vector from floating-point. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_SBV + + + + + ¶ + +
+
+
+

+ Conversion to signed bit-vector from floating-point. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FLOATINGPOINT_TO_REAL + + + + + ¶ + +
+
+
+

+ Conversion to Real from floating-point. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SELECT + + + + + ¶ + +
+
+
+

+ Array select. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STORE + + + + + ¶ + +
+
+
+

+ Array store. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_ARRAY + + + + + ¶ + +
+
+
+

+ Constant array. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + EQ_RANGE + + + + + ¶ + +
+
+
+

+

+

+ Equality over arrays + + \(a\) + + and + + \(b\) + + over a given range + + \([i,j]\) + + , i.e., +

+
+ \[\forall k . i \leq k \leq j \Rightarrow a[k] = b[k]\] +
+

+

+ +

+

+

+

+
+

+ Note +

+

+ We currently support the creation of array equalities over index +Sorts bit-vector, floating-point, Int and Real. +Requires to enable option + + + arrays-exp + + + . +

+
+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + APPLY_CONSTRUCTOR + + + + + ¶ + +
+
+
+

+ + + Datatype + + + constructor application. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + APPLY_SELECTOR + + + + + ¶ + +
+
+
+

+ + + Datatype + + + selector application. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Undefined if misapplied. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + APPLY_TESTER + + + + + ¶ + +
+
+
+

+ + + Datatype + + + tester application. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + APPLY_UPDATER + + + + + ¶ + +
+
+
+

+ + + Datatype + + + update application. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Does not change the datatype argument if misapplied. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + MATCH + + + + + ¶ + +
+
+
+

+ Match expression. +

+

+ This kind is primarily used in the parser to support the SMT-LIBv2 + + + match + + + expression. +

+

+ For example, the SMT-LIBv2 syntax for the following match term +

+

+

+
+
+
(match l (((cons h t) h) (nil 0)))
+
+
+
+

+ is represented by the AST +

+
+
+
(MATCH l
+    (MATCH_BIND_CASE (VARIABLE_LIST h t) (cons h t) h)
+    (MATCH_CASE nil 0))
+
+
+
+

+ Terms of kind + + + + MATCH_CASE + + + + are constant case expressions, +which are used for nullary constructors. Kind + + + + MATCH_BIND_CASE + + + + is used for constructors with selectors +and variable match patterns. If not all constructors are covered, at least +one catch-all variable pattern must be included. +

+ +

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + MATCH_CASE + + + + + ¶ + +
+
+
+

+ Match case for nullary constructors. +

+

+ A (constant) case expression to be used within a match expression. +

+

+

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of kind + + + + APPLY_CONSTRUCTOR + + + + (the pattern to match against) +

      +
    • +
    • +

      + + + 2: + + + Term of any Sort (the term the match term evaluates to) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + MATCH_BIND_CASE + + + + + ¶ + +
+
+
+

+ Match case with binders, for constructors with selectors and variable patterns. +

+

+ A (non-constant) case expression to be used within a match expression. +

+

+

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + For variable patterns: +

      +
        +
      • +

        + + + 1: + + + Term of kind + + + + VARIABLE_LIST + + + + (containing the free variable of the case) +

        +
      • +
      • +

        + + + 2: + + + Term of kind + + + + VARIABLE + + + + (the pattern expression, the free variable of the case) +

        +
      • +
      • +

        + + + 3: + + + Term of any Sort (the term the pattern evaluates to) +

        +
      • +
      +
    • +
    • +

      + For constructors with selectors: +

      +
        +
      • +

        + + + 1: + + + Term of kind + + + + VARIABLE_LIST + + + + (containing the free variable of the case) +

        +
      • +
      • +

        + + + 2: + + + Term of kind + + + + APPLY_CONSTRUCTOR + + + + (the pattern expression, applying the set of variables to the constructor) +

        +
      • +
      • +

        + + + 3: + + + Term of any Sort (the term the match term evaluates to) +

        +
      • +
      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TUPLE_PROJECT + + + + + ¶ + +
+
+
+

+ Tuple projection. +

+

+ This operator takes a tuple as an argument and returns a tuple obtained by concatenating components of its argument at the provided indices. +

+

+ For example, +

+

+

+
+
+
((_ tuple.project 1 2 2 3 1) (tuple 10 20 30 40))
+
+
+
+ yields +

+

+
+
+
(tuple 20 30 30 40 20)
+
+
+
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEP_NIL + + + + + ¶ + +
+
+
+

+ Separation logic nil. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEP_EMP + + + + + ¶ + +
+
+
+

+ Separation logic empty heap. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEP_PTO + + + + + ¶ + +
+
+
+

+ Separation logic points-to relation. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEP_STAR + + + + + ¶ + +
+
+
+

+ Separation logic star. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEP_WAND + + + + + ¶ + +
+
+
+

+ Separation logic magic wand. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_EMPTY + + + + + ¶ + +
+
+
+

+ Empty set. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_UNION + + + + + ¶ + +
+
+
+

+ Set union. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_INTER + + + + + ¶ + +
+
+
+

+ Set intersection. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_MINUS + + + + + ¶ + +
+
+
+

+ Set subtraction. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_SUBSET + + + + + ¶ + +
+
+
+

+ Subset predicate. +

+

+ Determines if the first set is a subset of the second set. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_MEMBER + + + + + ¶ + +
+
+
+

+ Set membership predicate. +

+

+ Determines if the given set element is a member of the second set. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_SINGLETON + + + + + ¶ + +
+
+
+

+ Singleton set. +

+

+ Construct a singleton set from an element given as a parameter. The returned set has the same + + + Sort + + + as the element. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_INSERT + + + + + ¶ + +
+
+
+

+ The set obtained by inserting elements; +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_CARD + + + + + ¶ + +
+
+
+

+ Set cardinality. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_COMPLEMENT + + + + + ¶ + +
+
+
+

+ Set complement with respect to finite universe. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_UNIVERSE + + + + + ¶ + +
+
+
+

+ Finite universe set. +

+

+ All set variables must be interpreted as subsets of it. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ + + + SET_UNIVERSE + + + + is considered a special symbol of +the theory of sets and is not considered as a set value, i.e., +Term::isSetValue() will return + + + false + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_COMPREHENSION + + + + + ¶ + +
+
+
+

+ Set comprehension +

+

+

+

+ A set comprehension is specified by a variable list + + \(x_1 ... x_n\) + + , +a predicate + + \(P[x_1...x_n]\) + + , and a term + + \(t[x_1...x_n]\) + + . A +comprehension + + \(C\) + + with the above form has members given by the +following semantics: +

+
+ \[\forall y. ( \exists x_1...x_n. P[x_1...x_n] \wedge t[x_1...x_n] = y ) +\Leftrightarrow (set.member \; y \; C)\] +
+

+ where + + \(y\) + + ranges over the element Sort of the (set) Sort of the +comprehension. If + + \(t[x_1..x_n]\) + + is not provided, it is equivalent +to + + \(y\) + + in the above formula. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Kind + + + + VARIABLE_LIST + + + +

      +
    • +
    • +

      + + + 2: + + + Term of sort Bool (the predicate of the comprehension) +

      +
    • +
    • +

      + + + 3: + + + (optional) Term denoting the generator for the comprehension +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_CHOOSE + + + + + ¶ + +
+
+
+

+ Set choose. +

+

+ Select an element from a given set. For a set + + \(A = \{x\}\) + + , the term +(set.choose + + \(A\) + + ) is equivalent to the term + + \(x_1\) + + . For an empty +set, it is an arbitrary value. For a set with cardinality > 1, it will +deterministically return an element in + + \(A\) + + . +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_IS_SINGLETON + + + + + ¶ + +
+
+
+

+ Set is singleton tester. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_MAP + + + + + ¶ + +
+
+
+

+ Set map. +

+

+

+

+ This operator applies the first argument, a function of +Sort + + \((\rightarrow S_1 \; S_2)\) + + , to every element of the second +argument, a set of Sort (Set + + \(S_1\) + + ), and returns a set of Sort +(Set + + \(S_2\) + + ). +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of set Sort (Set + + \(S_1\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_FILTER + + + + + ¶ + +
+
+
+

+ Set filter. +

+

+

+

+ This operator filters the elements of a set. +(set.filter + + \(p \; A\) + + ) takes a predicate + + \(p\) + + of Sort + + \((\rightarrow T \; Bool)\) + + as a first argument, and a set + + \(A\) + + of Sort (Set + + \(T\) + + ) as a second argument, and returns a subset of Sort +(Set + + \(T\) + + ) that includes all elements of + + \(A\) + + that satisfy + + \(p\) + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow T \; Bool)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of bag Sort (Set + + \(T\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SET_FOLD + + + + + ¶ + +
+
+
+

+ Set fold. +

+

+

+

+ This operator combines elements of a set into a single value. +(set.fold + + \(f \; t \; A\) + + ) folds the elements of set + + \(A\) + + starting with Term + + \(t\) + + and using the combining function + + \(f\) + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2 \; S_2)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of Sort + + \(S_2\) + + (the initial value) +

      +
    • +
    • +

      + + + 3: + + + Term of bag Sort (Set + + \(S_1\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_JOIN + + + + + ¶ + +
+
+
+

+ Relation join. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_PRODUCT + + + + + ¶ + +
+
+
+

+ Relation cartesian product. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_TRANSPOSE + + + + + ¶ + +
+
+
+

+ Relation transpose. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_TCLOSURE + + + + + ¶ + +
+
+
+

+ Relation transitive closure. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_JOIN_IMAGE + + + + + ¶ + +
+
+
+

+ Relation join image. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_IDEN + + + + + ¶ + +
+
+
+

+ Relation identity. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_GROUP + + + + + ¶ + +
+
+
+

+ Relation group +

+

+

+

+ + \(((\_ \; rel.group \; n_1 \; \dots \; n_k) \; A)\) + + partitions tuples +of relation + + \(A\) + + such that tuples that have the same projection +with indices + + \(n_1 \; \dots \; n_k\) + + are in the same part. +It returns a set of relations of type + + \((Set \; T)\) + + where + + \(T\) + + is the type of + + \(A\) + + . +

+
    +
  • +

    + Arity: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Term of relation sort +

      +
    • +
    +
  • +
  • +

    + Indices: + + + n + + +

    +
      +
    • +

      + + + 1..n: + + + Indices of the projection +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_AGGREGATE + + + + + ¶ + +
+
+
+

+

+

+

+

+ Relation aggregate operator has the form + + \(((\_ \; rel.aggr \; n_1 ... n_k) \; f \; i \; A)\) + + where + + \(n_1, ..., n_k\) + + are natural numbers, + + \(f\) + + is a function of type + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + + , + + \(i\) + + has the type + + \(T\) + + , +and + + \(A\) + + has type + + \((Relation \; T_1 \; ... \; T_j)\) + + . +The returned type is + + \((Set \; T)\) + + . +

+

+ This operator aggregates elements in A that have the same tuple projection +with indices n_1, …, n_k using the combining function + + \(f\) + + , +and initial value + + \(i\) + + . +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sort + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of Sort + + \(T\) + +

      +
    • +
    • +

      + + + 3: + + + Term of relation sort + + \(Relation T_1 ... T_j\) + +

      +
    • +
    +
  • +
  • +

    + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

    +
  • +
+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RELATION_PROJECT + + + + + ¶ + +
+
+
+

+ Relation projection operator extends tuple projection operator to sets. +

+

+

+ +
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_EMPTY + + + + + ¶ + +
+
+
+

+ Empty bag. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_UNION_MAX + + + + + ¶ + +
+
+
+

+ Bag max union. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_UNION_DISJOINT + + + + + ¶ + +
+
+
+

+ Bag disjoint union (sum). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_INTER_MIN + + + + + ¶ + +
+
+
+

+ Bag intersection (min). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_DIFFERENCE_SUBTRACT + + + + + ¶ + +
+
+
+

+ Bag difference subtract. +

+

+ Subtracts multiplicities of the second from the first. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_DIFFERENCE_REMOVE + + + + + ¶ + +
+
+
+

+ Bag difference remove. +

+

+ Removes shared elements in the two bags. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_SUBBAG + + + + + ¶ + +
+
+
+

+ Bag inclusion predicate. +

+

+ Determine if multiplicities of the first bag are less than or equal to multiplicities of the second bag. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_COUNT + + + + + ¶ + +
+
+
+

+ Bag element multiplicity. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_MEMBER + + + + + ¶ + +
+
+
+

+ Bag membership predicate. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_DUPLICATE_REMOVAL + + + + + ¶ + +
+
+
+

+ Bag duplicate removal. +

+

+ Eliminate duplicates in a given bag. The returned bag contains exactly the same elements in the given bag, but with multiplicity one. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_MAKE + + + + + ¶ + +
+
+
+

+ Bag make. +

+

+ Construct a bag with the given element and given multiplicity. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_CARD + + + + + ¶ + +
+
+
+

+ Bag cardinality. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_CHOOSE + + + + + ¶ + +
+
+
+

+ Bag choose. +

+

+ Select an element from a given bag. +

+

+ For a bag + + \(A = \{(x,n)\}\) + + where + + \(n\) + + is the multiplicity, then +the term (choose + + \(A\) + + ) is equivalent to the term + + \(x\) + + . For an +empty bag, then it is an arbitrary value. For a bag that contains distinct +elements, it will deterministically return an element in + + \(A\) + + . +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_IS_SINGLETON + + + + + ¶ + +
+
+
+

+ Bag is singleton tester. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_FROM_SET + + + + + ¶ + +
+
+
+

+ Conversion from set to bag. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_TO_SET + + + + + ¶ + +
+
+
+

+ Conversion from bag to set. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_MAP + + + + + ¶ + +
+
+
+

+ Bag map. +

+

+

+

+ This operator applies the first argument, a function of +Sort + + \((\rightarrow S_1 \; S_2)\) + + , to every element of the second +argument, a set of Sort (Bag + + \(S_1\) + + ), and returns a set of Sort +(Bag + + \(S_2\) + + ). +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of bag Sort (Bag + + \(S_1\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_FILTER + + + + + ¶ + +
+
+
+

+ Bag filter. +

+

+

+

+ This operator filters the elements of a bag. +(bag.filter + + \(p \; B\) + + ) takes a predicate + + \(p\) + + of Sort + + \((\rightarrow T \; Bool)\) + + as a first argument, and a bag + + \(B\) + + of Sort (Bag + + \(T\) + + ) as a second argument, and returns a subbag of Sort +(Bag + + \(T\) + + ) that includes all elements of + + \(B\) + + that satisfy + + \(p\) + + with the same multiplicity. +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow T \; Bool)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of bag Sort (Bag + + \(T\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_FOLD + + + + + ¶ + +
+
+
+

+ Bag fold. +

+

+

+

+ This operator combines elements of a bag into a single value. +(bag.fold + + \(f \; t \; B\) + + ) folds the elements of bag + + \(B\) + + starting with Term + + \(t\) + + and using the combining function + + \(f\) + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2 \; S_2)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of Sort + + \(S_2\) + + (the initial value) +

      +
    • +
    • +

      + + + 3: + + + Term of bag Sort (Bag + + \(S_1\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + BAG_PARTITION + + + + + ¶ + +
+
+
+

+ Bag partition. +

+

+

+

+ This operator partitions of a bag of elements into disjoint bags. +(bag.partition + + \(r \; B\) + + ) partitions the elements of bag + + \(B\) + + of type + + \((Bag \; E)\) + + based on the equivalence relations + + \(r\) + + of +type + + \((\rightarrow \; E \; E \; Bool)\) + + . +It returns a bag of bags of type + + \((Bag \; (Bag \; E))\) + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of function Sort + + \((\rightarrow \; E \; E \; Bool)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of bag Sort (Bag + + \(E\) + + ) +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TABLE_PRODUCT + + + + + ¶ + +
+
+
+

+ Table cross product. +

+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TABLE_PROJECT + + + + + ¶ + +
+
+
+

+ Table projection operator extends tuple projection operator to tables. +

+

+

+ +
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TABLE_AGGREGATE + + + + + ¶ + +
+
+
+

+

+

+

+

+ Table aggregate operator has the form + + \(((\_ \; table.aggr \; n_1 ... n_k) \; f \; i \; A)\) + + where + + \(n_1, ..., n_k\) + + are natural numbers, + + \(f\) + + is a function of type + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + + , + + \(i\) + + has the type + + \(T\) + + , +and + + \(A\) + + has type + + \((Table \; T_1 \; ... \; T_j)\) + + . +The returned type is + + \((Bag \; T)\) + + . +

+

+ This operator aggregates elements in A that have the same tuple projection +with indices n_1, …, n_k using the combining function + + \(f\) + + , +and initial value + + \(i\) + + . +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sort + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + +

      +
    • +
    • +

      + + + 2: + + + Term of Sort + + \(T\) + +

      +
    • +
    • +

      + + + 3: + + + Term of table sort + + \(Table T_1 ... T_j\) + +

      +
    • +
    +
  • +
  • +

    + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

    +
  • +
+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TABLE_JOIN + + + + + ¶ + +
+
+
+

+

+

+

+
+
+

+ Table join operator has the form + + \(((\_ \; table.join \; m_1 \; n_1 \; \dots \; m_k \; n_k) \; A \; B)\) + + where + + \(m_1 \; n_1 \; \dots \; m_k \; n_k\) + + are natural numbers, +and + + \(A, B\) + + are tables. +This operator filters the product of two bags based on the equality of +projected tuples using indices + + \(m_1, \dots, m_k\) + + in table + + \(A\) + + , +and indices + + \(n_1, \dots, n_k\) + + in table + + \(B\) + + . +

+
+
+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of table Sort +

      +
    • +
    • +

      + + + 2: + + + Term of table Sort +

      +
    • +
    +
  • +
  • +

    + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

    +
  • +
+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TABLE_GROUP + + + + + ¶ + +
+
+
+

+ Table group +

+

+

+

+ + \(((\_ \; table.group \; n_1 \; \dots \; n_k) \; A)\) + + partitions tuples +of table + + \(A\) + + such that tuples that have the same projection +with indices + + \(n_1 \; \dots \; n_k\) + + are in the same part. +It returns a bag of tables of type + + \((Bag \; T)\) + + where + + \(T\) + + is the type of + + \(A\) + + . +

+
    +
  • +

    + Arity: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Term of table sort +

      +
    • +
    +
  • +
  • +

    + Indices: + + + n + + +

    +
      +
    • +

      + + + 1..n: + + + Indices of the projection +

      +
    • +
    +
  • +
+

+

+ +

+

+

+

+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_CONCAT + + + + + ¶ + +
+
+
+

+ String concat. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_IN_REGEXP + + + + + ¶ + +
+
+
+

+ String membership. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_LENGTH + + + + + ¶ + +
+
+
+

+ String length. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_SUBSTR + + + + + ¶ + +
+
+
+

+ String substring. +

+

+

+

+ Extracts a substring, starting at index + + \(i\) + + and of length + + \(l\) + + , +from a string + + \(s\) + + . If the start index is negative, the start index +is greater than the length of the string, or the length is negative, the +result is the empty string. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Int (length + + \(l\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_UPDATE + + + + + ¶ + +
+
+
+

+ String update. +

+

+

+

+ Updates a string + + \(s\) + + by replacing its context starting at an index +with string + + \(t\) + + . If the start index is negative, the start index is +greater than the length of the string, the result is + + \(s\) + + . Otherwise, +the length of the original string is preserved. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Strong (replacement string + + \(t\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_CHARAT + + + + + ¶ + +
+
+
+

+ String character at. +

+

+

+

+ Returns the character at index + + \(i\) + + from a string + + \(s\) + + . If the +index is negative or the index is greater than the length of the string, +the result is the empty string. Otherwise the result is a string of +length 1. +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String (string + + \(s\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_CONTAINS + + + + + ¶ + +
+
+
+

+ String contains. +

+

+

+

+ Determines whether a string + + \(s_1\) + + contains another string + + \(s_2\) + + . If + + \(s_2\) + + is empty, the result is always + + + true + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String (the string + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String (the string + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_INDEXOF + + + + + ¶ + +
+
+
+

+ String index-of. +

+

+

+

+ Returns the index of a substring + + \(s_2\) + + in a string + + \(s_1\) + + starting at index + + \(i\) + + . If the index is negative or greater than the +length of string + + \(s_1\) + + or the substring + + \(s_2\) + + does not appear +in string + + \(s_1\) + + after index + + \(i\) + + , the result is -1. +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String (substring + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String (substring + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_INDEXOF_RE + + + + + ¶ + +
+
+
+

+ String index-of regular expression match. +

+

+

+

+ Returns the first match of a regular expression + + \(r\) + + in a +string + + \(s\) + + . If the index is negative or greater than the length of +string + + \(s_1\) + + , or + + \(r\) + + does not match a substring in + + \(s\) + + after index + + \(i\) + + , the result is -1. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String (string + + \(s\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort RegLan (regular expression + + \(r\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_REPLACE + + + + + ¶ + +
+
+
+

+ String replace. +

+

+

+

+ Replaces a string + + \(s_2\) + + in a string + + \(s_1\) + + with string + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , + + \(s_1\) + + is +returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String (string + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String (string + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort String (string + + \(s_3\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_REPLACE_ALL + + + + + ¶ + +
+
+
+

+ String replace all. +

+

+

+

+ Replaces all occurrences of a string + + \(s_2\) + + in a string + + \(s_1\) + + with string + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort String ( + + \(s_3\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_REPLACE_RE + + + + + ¶ + +
+
+
+

+ String replace regular expression match. +

+

+

+

+ Replaces the first match of a regular expression + + \(r\) + + in +string + + \(s_1\) + + with string + + \(s_2\) + + . If + + \(r\) + + does not match a +substring of + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort RegLan +

      +
    • +
    • +

      + + + 3: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_REPLACE_RE_ALL + + + + + ¶ + +
+
+
+

+ String replace all regular expression matches. +

+

+

+

+ Replaces all matches of a regular expression + + \(r\) + + in string + + \(s_1\) + + with string + + \(s_2\) + + . If + + \(r\) + + does not match a +substring of + + \(s_1\) + + , string + + \(s_1\) + + is returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort RegLan +

      +
    • +
    • +

      + + + 3: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_TO_LOWER + + + + + ¶ + +
+
+
+

+ String to lower case. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_TO_UPPER + + + + + ¶ + +
+
+
+

+ String to upper case. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_REV + + + + + ¶ + +
+
+
+

+ String reverse. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_TO_CODE + + + + + ¶ + +
+
+
+

+ String to code. +

+

+ Returns the code point of a string if it has length one, or returns + + + -1 + + + otherwise. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_FROM_CODE + + + + + ¶ + +
+
+
+

+ String from code. +

+

+ Returns a string containing a single character whose code point matches the argument to this function, or the empty string if the argument is out-of-bounds. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_LT + + + + + ¶ + +
+
+
+

+ String less than. +

+

+

+

+ Returns true if string + + \(s_1\) + + is (strictly) less than + + \(s_2\) + + based on a lexiographic ordering over code points. +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_LEQ + + + + + ¶ + +
+
+
+

+ String less than or equal. +

+

+

+

+ Returns true if string + + \(s_1\) + + is less than or equal to + + \(s_2\) + + based on a lexiographic ordering over code points. +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_PREFIX + + + + + ¶ + +
+
+
+

+ String prefix-of. +

+

+

+

+ Determines whether a string + + \(s_1\) + + is a prefix of string + + \(s_2\) + + . +If string s1 is empty, this operator returns + + + true + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_SUFFIX + + + + + ¶ + +
+
+
+

+ String suffix-of. +

+

+

+

+ Determines whether a string + + \(s_1\) + + is a suffix of the second string. +If string + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_IS_DIGIT + + + + + ¶ + +
+
+
+

+ String is-digit. +

+

+ Returns true if given string is a digit (it is one of + + + "0" + + + , …, + + + "9" + + + ). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_FROM_INT + + + + + ¶ + +
+
+
+

+ Conversion from Int to String. +

+

+ If the integer is negative this operator returns the empty string. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_TO_INT + + + + + ¶ + +
+
+
+

+ String to integer (total function). +

+

+ If the string does not contain an integer or the integer is negative, the operator returns + + + -1 + + + . +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_STRING + + + + + ¶ + +
+
+
+

+ Constant string. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + STRING_TO_REGEXP + + + + + ¶ + +
+
+
+

+ Conversion from string to regexp. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_CONCAT + + + + + ¶ + +
+
+
+

+ Regular expression concatenation. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_UNION + + + + + ¶ + +
+
+
+

+ Regular expression union. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_INTER + + + + + ¶ + +
+
+
+

+ Regular expression intersection. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_DIFF + + + + + ¶ + +
+
+
+

+ Regular expression difference. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_STAR + + + + + ¶ + +
+
+
+

+ Regular expression *. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_PLUS + + + + + ¶ + +
+
+
+

+ Regular expression +. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_OPT + + + + + ¶ + +
+
+
+

+ Regular expression ?. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_RANGE + + + + + ¶ + +
+
+
+

+ Regular expression range. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_REPEAT + + + + + ¶ + +
+
+
+

+ Operator for regular expression repeat. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_LOOP + + + + + ¶ + +
+
+
+

+ Regular expression loop. +

+

+ Regular expression loop from lower bound to upper bound number of repetitions. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_NONE + + + + + ¶ + +
+
+
+

+ Regular expression none. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_ALL + + + + + ¶ + +
+
+
+

+ Regular expression all. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_ALLCHAR + + + + + ¶ + +
+
+
+

+ Regular expression all characters. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + REGEXP_COMPLEMENT + + + + + ¶ + +
+
+
+

+ Regular expression complement. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_CONCAT + + + + + ¶ + +
+
+
+

+ Sequence concat. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_LENGTH + + + + + ¶ + +
+
+
+

+ Sequence length. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_EXTRACT + + + + + ¶ + +
+
+
+

+ Sequence extract. +

+

+

+

+ Extracts a subsequence, starting at index + + \(i\) + + and of length + + \(l\) + + , +from a sequence + + \(s\) + + . If the start index is negative, the start index +is greater than the length of the sequence, or the length is negative, the +result is the empty sequence. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Int (length + + \(l\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_UPDATE + + + + + ¶ + +
+
+
+

+ Sequence update. +

+

+

+

+ Updates a sequence + + \(s\) + + by replacing its context starting at an index +with string + + \(t\) + + . If the start index is negative, the start index is +greater than the length of the sequence, the result is + + \(s\) + + . Otherwise, +the length of the original sequence is preserved. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of sequence Sort (replacement sequence + + \(t\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_AT + + + + + ¶ + +
+
+
+

+ Sequence element at. +

+

+

+

+ Returns the element at index + + \(i\) + + from a sequence + + \(s\) + + . If the index +is negative or the index is greater or equal to the length of the +sequence, the result is the empty sequence. Otherwise the result is a +sequence of length + + + 1 + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_CONTAINS + + + + + ¶ + +
+
+
+

+ Sequence contains. +

+

+

+

+ Checks whether a sequence + + \(s_1\) + + contains another sequence + + \(s_2\) + + . If + + \(s_2\) + + is empty, the result is always + + + true + + + . +

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_INDEXOF + + + + + ¶ + +
+
+
+

+ Sequence index-of. +

+

+

+

+ Returns the index of a subsequence + + \(s_2\) + + in a sequence + + \(s_1\) + + starting at index + + \(i\) + + . If the index is negative or greater than the +length of sequence + + \(s_1\) + + or the subsequence + + \(s_2\) + + does not +appear in sequence + + \(s_1\) + + after index + + \(i\) + + , the result is -1. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of Sort Int ( + + \(i\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_REPLACE + + + + + ¶ + +
+
+
+

+ Sequence replace. +

+

+

+

+ Replaces the first occurrence of a sequence + + \(s_2\) + + in a +sequence + + \(s_1\) + + with sequence + + \(s_3\) + + . If + + \(s_2\) + + does not +appear in + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of sequence Sort ( + + \(s_3\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_REPLACE_ALL + + + + + ¶ + +
+
+
+

+ Sequence replace all. +

+

+

+

+ Replaces all occurrences of a sequence + + \(s_2\) + + in a sequence + + \(s_1\) + + with sequence + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , sequence + + \(s_1\) + + is returned unmodified. +

+
    +
  • +

    + Arity: + + + 3 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    • +

      + + + 3: + + + Term of sequence Sort ( + + \(s_3\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_REV + + + + + ¶ + +
+
+
+

+ Sequence reverse. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_PREFIX + + + + + ¶ + +
+
+
+

+ Sequence prefix-of. +

+

+

+

+ Checks whether a sequence + + \(s_1\) + + is a prefix of sequence + + \(s_2\) + + . +If sequence + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

+
    +
  • +

    + Arity: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_SUFFIX + + + + + ¶ + +
+
+
+

+ Sequence suffix-of. +

+

+

+

+ Checks whether a sequence + + \(s_1\) + + is a suffix of sequence + + \(s_2\) + + . +If sequence + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

+
    +
  • +

    + Arity: + + + 1 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

      +
    • +
    • +

      + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + CONST_SEQUENCE + + + + + ¶ + +
+
+
+

+ Constant sequence. +

+

+ A constant sequence is a term that is equivalent to: +

+

+

+
+
+
(seq.++ (seq.unit c1) ... (seq.unit cn))
+
+
+
+

+ where + + \(n \leq 0\) + + and + + \(c_1, ..., c_n\) + + are constants of some +sort. The elements can be extracted with Term::getSequenceValue(). +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_UNIT + + + + + ¶ + +
+
+
+

+ Sequence unit. +

+

+ Corresponds to a sequence of length one with the given term. +

+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SEQ_NTH + + + + + ¶ + +
+
+
+

+ Sequence nth. +

+

+ Corresponds to the nth element of a sequence. +

+

+

+
    +
  • +

    + Arity: + + + 2 + + +

    +
      +
    • +

      + + + 1: + + + Term of sequence Sort +

      +
    • +
    • +

      + + + 2: + + + Term of Sort Int ( + + \(n\) + + ) +

      +
    • +
    +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + FORALL + + + + + ¶ + +
+
+
+

+ Universally quantified formula. +

+

+

+ +

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + EXISTS + + + + + ¶ + +
+
+
+

+ Existentially quantified formula. +

+

+

+ +

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + VARIABLE_LIST + + + + + ¶ + +
+
+
+

+ Variable list. +

+

+ A list of variables (used to bind variables under a quantifier) +

+

+

+
    +
  • +

    + Arity: + + + n + + + > + + + 0 + + +

    + +
  • +
+

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_PATTERN + + + + + ¶ + +
+
+
+

+ Instantiation pattern. +

+

+ Specifies a (list of) terms to be used as a pattern for quantifier instantiation. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_NO_PATTERN + + + + + ¶ + +
+
+
+

+ Instantiation no-pattern. +

+

+ Specifies a (list of) terms that should not be used as a pattern for quantifier instantiation. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_POOL + + + + + ¶ + +
+
+
+

+ Instantiation pool annotation. +

+

+ Specifies an annotation for pool based instantiation. +

+

+ In detail, pool symbols can be declared via the method +

+ +

+ A pool symbol represents a set of terms of a given sort. An instantiation pool annotation should match the types of the quantified formula. +

+

+ For example, for a quantified formula: +

+

+

+
+
+
(FORALL (VARIABLE_LIST x y) F (INST_PATTERN_LIST (INST_POOL p q)))
+
+
+
+

+ if + + \(x\) + + and + + \(y\) + + have Sorts + + \(S_1\) + + and + + \(S_2\) + + , then +pool symbols + + \(p\) + + and + + \(q\) + + should have Sorts (Set + + \(S_1\) + + ) +and (Set + + \(S_2\) + + ), respectively. This annotation specifies that the +quantified formula above should be instantiated with the product of all +terms that occur in the sets + + \(p\) + + and + + \(q\) + + . +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_ADD_TO_POOL + + + + + ¶ + +
+
+
+

+ A instantantiation-add-to-pool annotation. +

+

+ An instantantiation-add-to-pool annotation indicates that when a quantified formula is instantiated, the instantiated version of a term should be added to the given pool. +

+

+ For example, consider a quantified formula: +

+

+

+
+
+
(FORALL (VARIABLE_LIST x) F
+        (INST_PATTERN_LIST (INST_ADD_TO_POOL (ADD x 1) p)))
+
+
+
+

+ where assume that + + \(x\) + + has type Int. When this quantified formula is +instantiated with, e.g., the term + + \(t\) + + , the term + + + (ADD + + + t + + + 1) + + + is +added to pool + + \(p\) + + . +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + SKOLEM_ADD_TO_POOL + + + + + ¶ + +
+
+
+

+ A skolemization-add-to-pool annotation. +

+

+ An skolemization-add-to-pool annotation indicates that when a quantified formula is skolemized, the skolemized version of a term should be added to the given pool. +

+

+ For example, consider a quantified formula: +

+

+

+
+
+
(FORALL (VARIABLE_LIST x) F
+        (INST_PATTERN_LIST (SKOLEM_ADD_TO_POOL (ADD x 1) p)))
+
+
+
+

+ where assume that + + \(x\) + + has type Int. When this quantified formula is +skolemized, e.g., with + + \(k\) + + of type Int, then the term + + + (ADD + + + k + + + 1) + + + is added to the pool + + \(p\) + + . +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+

+ Warning +

+

+ This kind is experimental and may be changed or removed in +future versions. +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_ATTRIBUTE + + + + + ¶ + +
+
+
+

+ Instantiation attribute. +

+

+ Specifies a custom property for a quantified formula given by a term that is ascribed a user attribute. +

+

+

+ +

+

+

+

+
+

+ Note +

+

+ Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

+
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INST_PATTERN_LIST + + + + + ¶ + +
+
+
+

+ A list of instantiation patterns, attributes or annotations. +

+

+

+ +

+

+ +
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LAST_KIND + + + + + ¶ + +
+
+
+

+ Marks the upper-bound of this enumeration. +

+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + > + + +
+ + + + + struct + + + + + + + + hash + + + + + + < + + + + + cvc5 + + + + + :: + + + + + + Kind + + + + + + > + + + + ¶ + +
+
+
+

+ Hash function for Kinds. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + size_t + + + + + + + + operator + + + + + () + + + + + ( + + + + cvc5 + + + + + :: + + + + + + Kind + + + + + + + + k + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Hashes a Kind to a size_t. +

+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/modes.html b/cvc5-1.0.2/api/cpp/modes.html new file mode 100644 index 0000000..0507c0a --- /dev/null +++ b/cvc5-1.0.2/api/cpp/modes.html @@ -0,0 +1,1299 @@ + + + + + + + + Modes — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Modes + + ¶ + +

+
+
+ + + + + + + + + + + namespace + + + + + + + + modes + + + + + ¶ + +
+
+
+
+

+ Enums +

+
+
+ + + + + + + + + enum + + + + + + + + BlockModelsMode + + + + + ¶ + +
+
+
+

+ Mode for blocking models. +

+

+ Specifies how models are blocked in + + + Solver::blockModel + + + and + + + Solver::blockModelValues + + + . +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + LITERALS + + + + + ¶ + +
+
+
+

+ Block models based on the SAT skeleton. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + VALUES + + + + + ¶ + +
+
+
+

+ Block models based on the concrete model values for the free variables. +

+
+
+
+
+
+
+ + + + + + + + + enum + + + + + + + + LearnedLitType + + + + + ¶ + +
+
+
+

+ Types of learned literals. +

+

+ Specifies categories of literals learned for the method + + + Solver::getLearnedLiterals + + + . +

+

+ Note that a literal may conceptually belong to multiple categories. We classify literals based on the first criteria in this list that they meet. +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_PREPROCESS_SOLVED + + + + + ¶ + +
+
+
+

+ An equality that was turned into a substitution during preprocessing. +

+

+ In particular, literals in this category are of the form (= x t) where x does not occur in t. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_PREPROCESS + + + + + ¶ + +
+
+
+

+ A top-level literal (unit clause) from the preprocessed set of input formulas. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_INPUT + + + + + ¶ + +
+
+
+

+ A literal from the preprocessed set of input formulas that does not occur at top-level after preprocessing. +

+

+ Typically, this is the most interesting category of literals to learn. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_SOLVABLE + + + + + ¶ + +
+
+
+

+ An internal literal that is solvable for an input variable. +

+

+ In particular, literals in this category are of the form (= x t) where x does not occur in t, the preprocessed set of input formulas contains the term x, but not the literal (= x t). +

+

+ Note that solvable literals can be turned into substitutions during preprocessing. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_CONSTANT_PROP + + + + + ¶ + +
+
+
+

+ An internal literal that can be made into a constant propagation for an input term. +

+

+ In particular, literals in this category are of the form (= t c) where c is a constant, the preprocessed set of input formulas contains the term t, but not the literal (= t c). +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_INTERNAL + + + + + ¶ + +
+
+
+

+ Any internal literal that does not fall into the above categories. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + LEARNED_LIT_UNKNOWN + + + + + ¶ + +
+
+
+

+ Special case for when produce-learned-literals is not set. +

+
+
+
+
+
+
+ + + + + + + + + enum + + + + + + + + ProofComponent + + + + + ¶ + +
+
+
+

+ Components to include in a proof. +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + PROOF_COMPONENT_RAW_PREPROCESS + + + + + ¶ + +
+
+
+

+ Proofs of G1 … Gn whose free assumptions are a subset of F1, … Fm, where: +

+
    +
  • +

    + G1, … Gn are the preprocessed input formulas, +

    +
  • +
  • +

    + F1, … Fm are the input formulas. +

    +
  • +
+

+ Note that G1 … Gn may be arbitrary formulas, not necessarily clauses. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + PROOF_COMPONENT_PREPROCESS + + + + + ¶ + +
+
+
+

+ Proofs of Gu1 … Gun whose free assumptions are Fu1, … Fum, where: +

+
    +
  • +

    + Gu1, … Gun are clauses corresponding to input formulas used in the SAT proof, +

    +
  • +
  • +

    + Fu1, … Fum is the subset of the input formulas that are used in the SAT proof (i.e. the unsat core). +

    +
  • +
+

+ Note that Gu1 … Gun are clauses that are added to the SAT solver before its main search. +

+

+ Only valid immediately after an unsat response. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + PROOF_COMPONENT_SAT + + + + + ¶ + +
+
+
+

+ A proof of false whose free assumptions are Gu1, … Gun, L1 … Lk, where: +

+
    +
  • +

    + Gu1, … Gun, is a set of clauses corresponding to input formulas, +

    +
  • +
  • +

    + L1, …, Lk is a set of clauses corresponding to theory lemmas. +

    +
  • +
+

+ Only valid immediately after an unsat response. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + PROOF_COMPONENT_THEORY_LEMMAS + + + + + ¶ + +
+
+
+

+ Proofs of L1 … Lk where: +

+
    +
  • +

    + L1, …, Lk are clauses corresponding to theory lemmas used in the SAT proof. +

    +

    + In contrast to proofs given for preprocess, L1 … Lk are clauses that are added to the SAT solver after its main search. +

    +

    + Only valid immediately after an unsat response. +

    +
  • +
+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + PROOF_COMPONENT_FULL + + + + + ¶ + +
+
+
+

+ A proof of false whose free assumptions are a subset of the input formulas F1, … Fm. +

+

+ Only valid immediately after an unsat response. +

+
+
+
+
+
+
+

+ Functions +

+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + operator + + + + + << + + + + + ( + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + out + + + , + + + + LearnedLitType + + + + + + + + ltype + + + + ) + + + ¶ + +
+
+
+

+ Writes a learned literal type to a stream. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + operator + + + + + << + + + + + ( + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + out + + + , + + + + ProofComponent + + + + + + + + pc + + + + ) + + + ¶ + +
+
+
+

+ Writes a proof component identifier to a stream. +

+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/op.html b/cvc5-1.0.2/api/cpp/op.html new file mode 100644 index 0000000..c0a0369 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/op.html @@ -0,0 +1,1289 @@ + + + + + + + + Op — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Op + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + Op + + + + + ¶ + +
+
+
+

+ A cvc5 operator. +

+

+ An operator is a term that represents certain operators, instantiated with its required parameters, e.g., a + + + Term + + + of kind + + + BITVECTOR_EXTRACT + + + . +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Op + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~Op + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + Op + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Syntactic equality operator. +

+
+

+ Note +

+

+ Both operators must belong to the same node manager. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The operator to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if both operators are syntactically identical. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + Op + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Syntactic disequality operator. +

+
+

+ Note +

+

+ Both terms must belong to the same node manager. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The operator to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if operators differ syntactically. +

+
+
+
+
+
+
+ + + + + + + + + + + + Kind + + + + + + + + + getKind + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The kind of this operator. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this operator is a null term. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isIndexed + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True iff this operator is indexed. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getNumIndices + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The number of indices of this op. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + operator + + + + + [] + + + + + ( + + + + size_t + + + + + + + i + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the index at position + + + i + + + . +

+
+
+ Parameters + + : + +
+
+

+ + i + + – The position of the index to return. +

+
+
+ Returns + + : + +
+
+

+ The index at position i. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this operator. +

+
+
+
+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + > + + +
+ + + + + struct + + + + + + + + hash + + + + + + < + + + + + cvc5 + + + + + :: + + + + + + Op + + + + + + > + + + + ¶ + +
+
+
+

+ Hash function for Ops. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + size_t + + + + + + + + operator + + + + + () + + + + + ( + + + + const + + + + + + + cvc5 + + + + + :: + + + + + + Op + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/optioninfo.html b/cvc5-1.0.2/api/cpp/optioninfo.html new file mode 100644 index 0000000..f2a0fd7 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/optioninfo.html @@ -0,0 +1,2210 @@ + + + + + + + + OptionInfo — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ OptionInfo + + ¶ + +

+
+
+ + + + + + + + + + + struct + + + + + + + + OptionInfo + + + + + ¶ + +
+
+
+

+

+

+

+

+ Holds some description about a particular option, including its name, its +aliases, whether the option was explicitly set by the user, and information +concerning its value. It can be obtained via + + + + Solver::getOptionInfo() + + + + and +allows for a more detailed inspection of options than + + + + Solver::getOption() + + + + . The + + + + valueInfo + + + + member holds any of the +following alternatives: +

+
    +
  • +

    + + + + VoidInfo + + + + if the option holds no +value (or the value has no native type) +

    +
  • +
  • +

    + + + + ValueInfo + + + + if the option is of +type + + + bool + + + or + + + std::string + + + , holds the current value and the default +value. +

    +
  • +
  • +

    + + + + NumberInfo + + + + if the option is of +type + + + int64_t + + + , + + + uint64_t + + + or + + + double + + + , holds the current and default +value, as well as the minimum and maximum. +

    +
  • +
  • +

    + + + + ModeInfo + + + + if the option is a mode +option, holds the current and default values, as well as a list of valid +modes. +

    +
  • +
+

+ Additionally, this class provides convenience functions to obtain the +current value of an option in a type-safe manner using + + + + boolValue() + + + + , + + + + stringValue() + + + + , + + + + intValue() + + + + , + + + + uintValue() + + + + and + + + + doubleValue() + + + + . They assert that the option has the +respective type and return the current value. +

+

+ If the option has a special type that is not covered by the above +alternatives, the + + + + valueInfo + + + + holds +a + + + + VoidInfo + + + + . Some options, that are +expected to be used by frontends (e.g., input and output streams) can also +be accessed using + + + + Solver::getDriverOptions() + + + + . +

+
+

+ Public Types +

+
+
+ + + + + + + + + using + + + + + + + + OptionInfoVariant + + + + + + + + = + + + + + + + std + + + + + :: + + + + + variant + + + + + < + + + + + + VoidInfo + + + + + + , + + + + + + + + ValueInfo + + + + + + < + + + + + bool + + + + + > + + + + + , + + + + + + + + ValueInfo + + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + , + + + + + + + + NumberInfo + + + + + + < + + + + + int64_t + + + + + > + + + + + , + + + + + + + + NumberInfo + + + + + + < + + + + + uint64_t + + + + + > + + + + + , + + + + + + + + NumberInfo + + + + + + < + + + + + double + + + + + > + + + + + , + + + + + + + + ModeInfo + + + + + + > + + + + ¶ + +
+
+
+

+ Possible types for + + + valueInfo + + + . +

+
+
+
+
+

+ Public Functions +

+
+
+ + + + + + + + + + + bool + + + + + + + + boolValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the current value as a + + + bool + + + . +

+
+

+ Note +

+

+ Asserts that + + + valueInfo + + + holds a + + + bool + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The current value as a + + + bool + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + stringValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the current value as a + + + std::string + + + . +

+
+

+ Note +

+

+ Asserts that + + + valueInfo + + + holds a + + + std::string + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The current value as a + + + std::string + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + int64_t + + + + + + + + intValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the current value as an + + + int64_t + + + . +

+
+

+ Note +

+

+ Asserts that + + + valueInfo + + + holds an + + + int64_t + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The current value as a + + + int64_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + uint64_t + + + + + + + + uintValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the current value as a + + + uint64_t + + + . +

+
+

+ Note +

+

+ Asserts that + + + valueInfo + + + holds a + + + uint64_t + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The current value as a + + + uint64_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + double + + + + + + + + doubleValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Obtain the current value as a + + + double + + + . +

+
+

+ Note +

+

+ Asserts that + + + valueInfo + + + holds a + + + double + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The current value as a + + + double + + + . +

+
+
+
+
+
+
+

+ Public Members +

+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + name + + + + + ¶ + +
+
+
+

+ The option name +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + + aliases + + + + + ¶ + +
+
+
+

+ The option name aliases +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + setByUser + + + + + ¶ + +
+
+
+

+ Whether the option was explicitly set by the user +

+
+
+
+
+ + + + + + + + + + + + OptionInfoVariant + + + + + + + + + valueInfo + + + + + ¶ + +
+
+
+

+ The option value information +

+
+
+
+
+
+ + + + + + + + + + + struct + + + + + + + + ModeInfo + + + + + ¶ + +
+
+
+

+ Information for mode option values. +

+
+

+ Public Members +

+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + defaultValue + + + + + ¶ + +
+
+
+

+ The default value. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + currentValue + + + + + ¶ + +
+
+
+

+ The current value. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + + modes + + + + + ¶ + +
+
+
+

+ The possible modes. +

+
+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + typename + + + + + + + + T + + + + + + > + + +
+ + + + + struct + + + + + + + + NumberInfo + + + + + ¶ + +
+
+
+

+ Information for numeric values. + + + T + + + can be + + + int64_t + + + , + + + uint64_t + + + or + + + double + + + . +

+
+

+ Public Members +

+
+
+ + + + + + + + + + + + T + + + + + + + + + defaultValue + + + + + ¶ + +
+
+
+

+ The default value. +

+
+
+
+
+ + + + + + + + + + + + T + + + + + + + + + currentValue + + + + + ¶ + +
+
+
+

+ The current value. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + + T + + + + + + > + + + + + + + + minimum + + + + + ¶ + +
+
+
+

+ The optional minimum value. +

+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + + T + + + + + + > + + + + + + + + maximum + + + + + ¶ + +
+
+
+

+ The optional maximum value. +

+
+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + typename + + + + + + + + T + + + + + + > + + +
+ + + + + struct + + + + + + + + ValueInfo + + + + + ¶ + +
+
+
+

+ Basic information for option values. + + + T + + + can be + + + bool + + + or + + + std::string + + + . +

+
+

+ Public Members +

+
+
+ + + + + + + + + + + + T + + + + + + + + + defaultValue + + + + + ¶ + +
+
+
+

+ The default value. +

+
+
+
+
+ + + + + + + + + + + + T + + + + + + + + + currentValue + + + + + ¶ + +
+
+
+

+ The current value. +

+
+
+
+
+
+
+
+ + + + + + + + + + + struct + + + + + + + + VoidInfo + + + + + ¶ + +
+
+
+

+ Has no value information. +

+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/quickstart.html b/cvc5-1.0.2/api/cpp/quickstart.html new file mode 100644 index 0000000..1231d2a --- /dev/null +++ b/cvc5-1.0.2/api/cpp/quickstart.html @@ -0,0 +1,1657 @@ + + + + + + + + Quickstart Guide — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Quickstart Guide + + ¶ + +

+

+ First, create a cvc5 + + + + Solver + + + + instance: +

+
+
+
Solver solver;
+
+
+
+

+ We will ask the solver to produce models and unsat cores in the following, +and for this we have to enable the following options. +

+
+
+
solver.setOption("produce-models", "true");
+solver.setOption("produce-unsat-cores", "true");
+
+
+
+

+ Next we set the logic. +The simplest way to set a logic for the solver is to choose “ALL”. +This enables all logics in the solver. +Alternatively, + + + "QF_ALL" + + + enables all logics without quantifiers. +To optimize the solver’s behavior for a more specific logic, +use the logic name, e.g. + + + "QF_BV" + + + or + + + "QF_AUFBV" + + + . +

+
+
+
solver.setLogic("ALL");
+
+
+
+

+ In the following, we will define constraints of reals and integers. +For this, we first query the solver for the corresponding sorts. +

+
+
+
Sort realSort = solver.getRealSort();
+Sort intSort = solver.getIntegerSort();
+
+
+
+

+ Now, we create two constants + + + x + + + and + + + y + + + of sort + + + Real + + + , +and two constants + + + a + + + and + + + b + + + of sort + + + Integer + + + . +Notice that these are + + symbolic + + constants, but not actual values. +

+
+
+
Term x = solver.mkConst(realSort, "x");
+Term y = solver.mkConst(realSort, "y");
+Term a = solver.mkConst(intSort, "a");
+Term b = solver.mkConst(intSort, "b");
+
+
+
+

+ We define the following constraints regarding + + + x + + + and + + + y + + + : +

+
+ \[(0 < x) \wedge (0 < y) \wedge (x + y < 1) \wedge (x \leq y)\] +
+

+ We construct the required terms and assert them as follows: +

+
+
+
// Formally, constraints are also terms. Their sort is Boolean.
+// We will construct these constraints gradually,
+// by defining each of their components.
+// We start with the constant numerals 0 and 1:
+Term zero = solver.mkReal(0);
+Term one = solver.mkReal(1);
+
+// Next, we construct the term x + y
+Term xPlusY = solver.mkTerm(ADD, {x, y});
+
+// Now we can define the constraints.
+// They use the operators +, <=, and <.
+// In the API, these are denoted by ADD, LEQ, and LT.
+// A list of available operators is available in:
+// src/api/cpp/cvc5_kind.h
+Term constraint1 = solver.mkTerm(LT, {zero, x});
+Term constraint2 = solver.mkTerm(LT, {zero, y});
+Term constraint3 = solver.mkTerm(LT, {xPlusY, one});
+Term constraint4 = solver.mkTerm(LEQ, {x, y});
+
+// Now we assert the constraints to the solver.
+solver.assertFormula(constraint1);
+solver.assertFormula(constraint2);
+solver.assertFormula(constraint3);
+solver.assertFormula(constraint4);
+
+
+
+

+ Now we check if the asserted formula is satisfiable, that is, we check if +there exist values of sort + + + Real + + + for + + + x + + + and + + + y + + + that satisfy all +the constraints. +

+
+
+
Result r1 = solver.checkSat();
+
+
+
+

+ The result we get from this satisfiability check is either + + + sat + + + , + + + unsat + + + or + + + unknown + + + . +It’s status can be queried via + + + + cvc5::Result::isSat() + + + + , + + + + cvc5::Result::isUnsat() + + + + and + + + cvc5::Result::isSatUnknown() + + + . +Alternatively, it can also be printed. +

+
+
+
std::cout << "expected: sat" << std::endl;
+std::cout << "result: " << r1 << std::endl;
+
+
+
+

+ This will print: +

+
+
+
expected: sat
+result: sat
+
+
+
+

+ Now, we query the solver for the values for + + + x + + + and + + + y + + + that satisfy +the constraints. +

+
+
+
Term xVal = solver.getValue(x);
+Term yVal = solver.getValue(y);
+
+
+
+

+ It is also possible to get values for terms that do not appear in the original +formula. +

+
+
+
Term xMinusY = solver.mkTerm(SUB, {x, y});
+Term xMinusYVal = solver.getValue(xMinusY);
+
+
+
+

+ We can retrieve the string representation of these values as follows. +

+
+
+
std::string xStr = xVal.getRealValue();
+std::string yStr = yVal.getRealValue();
+std::string xMinusYStr = xMinusYVal.getRealValue();
+
+std::cout << "value for x: " << xStr << std::endl;
+std::cout << "value for y: " << yStr << std::endl;
+std::cout << "value for x - y: " << xMinusYStr << std::endl;
+
+
+
+

+ This will print the following: +

+
+
+
value for x: 1/6
+value for y: 1/6
+value for x - y: 0.0
+
+
+
+

+ We can convert these values to C++ types. +

+
+
+
// Further, we can convert the values to cpp types
+std::pair<int64_t, uint64_t> xPair = xVal.getReal64Value();
+std::pair<int64_t, uint64_t> yPair = yVal.getReal64Value();
+std::pair<int64_t, uint64_t> xMinusYPair = xMinusYVal.getReal64Value();
+
+std::cout << "value for x: " << xPair.first << "/" << xPair.second
+          << std::endl;
+std::cout << "value for y: " << yPair.first << "/" << yPair.second
+          << std::endl;
+std::cout << "value for x - y: " << xMinusYPair.first << "/"
+          << xMinusYPair.second << std::endl;
+
+
+
+

+ Another way to independently compute the value of + + + x + + + - + + + y + + + would be to +perform the (rational) arithmetic manually. +However, for more complex terms, it is easier to let the solver do the +evaluation. +

+
+
+
std::pair<int64_t, uint64_t> xMinusYComputed = {
+  xPair.first * yPair.second - xPair.second * yPair.first,
+  xPair.second * yPair.second
+};
+uint64_t g = std::gcd(xMinusYComputed.first, xMinusYComputed.second);
+xMinusYComputed = { xMinusYComputed.first / g, xMinusYComputed.second / g };
+if (xMinusYComputed == xMinusYPair)
+{
+  std::cout << "computed correctly" << std::endl;
+}
+else
+{
+  std::cout << "computed incorrectly" << std::endl;
+}
+
+
+
+

+ This will print: +

+
+
+
computed correctly
+
+
+
+

+ Next, we will check satisfiability of the same formula, +only this time over integer variables + + + a + + + and + + + b + + + . +For this, we first reset the assertions added to the solver. +

+
+
+
solver.resetAssertions();
+
+
+
+

+ Next, we assert the same assertions as above, but with integers. +This time, we inline the construction of terms +to the assertion command. +

+
+
+
solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), a}));
+solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), b}));
+solver.assertFormula(
+    solver.mkTerm(LT, {solver.mkTerm(ADD, {a, b}), solver.mkInteger(1)}));
+solver.assertFormula(solver.mkTerm(LEQ, {a, b}));
+
+
+
+

+ Now, we check whether the revised assertion is satisfiable. +

+
+
+
Result r2 = solver.checkSat();
+
+
+
+
+
+
std::cout << "expected: unsat" << std::endl;
+std::cout << "result: " << r2 << std::endl;
+
+
+
+

+ This time the asserted formula is unsatisfiable: +

+
+
+
expected: unsat
+result: unsat
+
+
+
+

+ We can query the solver for an unsatisfiable core, that is, a subset +of the assertions that is already unsatisfiable. +

+
+
+
std::vector<Term> unsatCore = solver.getUnsatCore();
+std::cout << "unsat core size: " << unsatCore.size() << std::endl;
+std::cout << "unsat core: " << std::endl;
+for (const Term& t : unsatCore)
+{
+  std::cout << t << std::endl;
+}
+
+
+
+

+ This will print: +

+
+
+
unsat core size: 3
+unsat core:
+(< 0 a)
+(< 0 b)
+(< (+ a b) 1)
+
+
+
+
+

+ Example + + ¶ + +

+
+
+ + + + + +
+
+

+ + examples/api/cpp/quickstart.cpp + +

+
+
+
  1 /******************************************************************************
+  2  * Top contributors (to current version):
+  3  *   Yoni Zohar, Gereon Kremer, Mathias Preiner
+  4  *
+  5  * This file is part of the cvc5 project.
+  6  *
+  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
+  8  * in the top-level source directory and their institutional affiliations.
+  9  * All rights reserved.  See the file COPYING in the top-level source
+ 10  * directory for licensing information.
+ 11  * ****************************************************************************
+ 12  *
+ 13  * A simple demonstration of the api capabilities of cvc5.
+ 14  *
+ 15  */
+ 16 
+ 17 #include <cvc5/cvc5.h>
+ 18 
+ 19 #include <iostream>
+ 20 #include <numeric>
+ 21 
+ 22 using namespace cvc5;
+ 23 
+ 24 int main()
+ 25 {
+ 26   // Create a solver
+ 27   //! [docs-cpp-quickstart-1 start]
+ 28   Solver solver;
+ 29   //! [docs-cpp-quickstart-1 end]
+ 30 
+ 31   // We will ask the solver to produce models and unsat cores,
+ 32   // hence these options should be turned on.
+ 33   //! [docs-cpp-quickstart-2 start]
+ 34   solver.setOption("produce-models", "true");
+ 35   solver.setOption("produce-unsat-cores", "true");
+ 36   //! [docs-cpp-quickstart-2 end]
+ 37 
+ 38   // The simplest way to set a logic for the solver is to choose "ALL".
+ 39   // This enables all logics in the solver.
+ 40   // Alternatively, "QF_ALL" enables all logics without quantifiers.
+ 41   // To optimize the solver's behavior for a more specific logic,
+ 42   // use the logic name, e.g. "QF_BV" or "QF_AUFBV".
+ 43 
+ 44   // Set the logic
+ 45   //! [docs-cpp-quickstart-3 start]
+ 46   solver.setLogic("ALL");
+ 47   //! [docs-cpp-quickstart-3 end]
+ 48 
+ 49   // In this example, we will define constraints over reals and integers.
+ 50   // Hence, we first obtain the corresponding sorts.
+ 51   //! [docs-cpp-quickstart-4 start]
+ 52   Sort realSort = solver.getRealSort();
+ 53   Sort intSort = solver.getIntegerSort();
+ 54   //! [docs-cpp-quickstart-4 end]
+ 55 
+ 56   // x and y will be real variables, while a and b will be integer variables.
+ 57   // Formally, their cpp type is Term,
+ 58   // and they are called "constants" in SMT jargon:
+ 59   //! [docs-cpp-quickstart-5 start]
+ 60   Term x = solver.mkConst(realSort, "x");
+ 61   Term y = solver.mkConst(realSort, "y");
+ 62   Term a = solver.mkConst(intSort, "a");
+ 63   Term b = solver.mkConst(intSort, "b");
+ 64   //! [docs-cpp-quickstart-5 end]
+ 65 
+ 66   // Our constraints regarding x and y will be:
+ 67   //
+ 68   //   (1)  0 < x
+ 69   //   (2)  0 < y
+ 70   //   (3)  x + y < 1
+ 71   //   (4)  x <= y
+ 72   //
+ 73 
+ 74   //! [docs-cpp-quickstart-6 start]
+ 75   // Formally, constraints are also terms. Their sort is Boolean.
+ 76   // We will construct these constraints gradually,
+ 77   // by defining each of their components.
+ 78   // We start with the constant numerals 0 and 1:
+ 79   Term zero = solver.mkReal(0);
+ 80   Term one = solver.mkReal(1);
+ 81 
+ 82   // Next, we construct the term x + y
+ 83   Term xPlusY = solver.mkTerm(ADD, {x, y});
+ 84 
+ 85   // Now we can define the constraints.
+ 86   // They use the operators +, <=, and <.
+ 87   // In the API, these are denoted by ADD, LEQ, and LT.
+ 88   // A list of available operators is available in:
+ 89   // src/api/cpp/cvc5_kind.h
+ 90   Term constraint1 = solver.mkTerm(LT, {zero, x});
+ 91   Term constraint2 = solver.mkTerm(LT, {zero, y});
+ 92   Term constraint3 = solver.mkTerm(LT, {xPlusY, one});
+ 93   Term constraint4 = solver.mkTerm(LEQ, {x, y});
+ 94 
+ 95   // Now we assert the constraints to the solver.
+ 96   solver.assertFormula(constraint1);
+ 97   solver.assertFormula(constraint2);
+ 98   solver.assertFormula(constraint3);
+ 99   solver.assertFormula(constraint4);
+100   //! [docs-cpp-quickstart-6 end]
+101 
+102   // Check if the formula is satisfiable, that is,
+103   // are there real values for x and y that satisfy all the constraints?
+104   //! [docs-cpp-quickstart-7 start]
+105   Result r1 = solver.checkSat();
+106   //! [docs-cpp-quickstart-7 end]
+107 
+108   // The result is either SAT, UNSAT, or UNKNOWN.
+109   // In this case, it is SAT.
+110   //! [docs-cpp-quickstart-8 start]
+111   std::cout << "expected: sat" << std::endl;
+112   std::cout << "result: " << r1 << std::endl;
+113   //! [docs-cpp-quickstart-8 end]
+114 
+115   // We can get the values for x and y that satisfy the constraints.
+116   //! [docs-cpp-quickstart-9 start]
+117   Term xVal = solver.getValue(x);
+118   Term yVal = solver.getValue(y);
+119   //! [docs-cpp-quickstart-9 end]
+120 
+121   // It is also possible to get values for compound terms,
+122   // even if those did not appear in the original formula.
+123   //! [docs-cpp-quickstart-10 start]
+124   Term xMinusY = solver.mkTerm(SUB, {x, y});
+125   Term xMinusYVal = solver.getValue(xMinusY);
+126   //! [docs-cpp-quickstart-10 end]
+127 
+128   // We can now obtain the string representations of the values.
+129   //! [docs-cpp-quickstart-11 start]
+130   std::string xStr = xVal.getRealValue();
+131   std::string yStr = yVal.getRealValue();
+132   std::string xMinusYStr = xMinusYVal.getRealValue();
+133 
+134   std::cout << "value for x: " << xStr << std::endl;
+135   std::cout << "value for y: " << yStr << std::endl;
+136   std::cout << "value for x - y: " << xMinusYStr << std::endl;
+137   //! [docs-cpp-quickstart-11 end]
+138 
+139   //! [docs-cpp-quickstart-12 start]
+140   // Further, we can convert the values to cpp types
+141   std::pair<int64_t, uint64_t> xPair = xVal.getReal64Value();
+142   std::pair<int64_t, uint64_t> yPair = yVal.getReal64Value();
+143   std::pair<int64_t, uint64_t> xMinusYPair = xMinusYVal.getReal64Value();
+144 
+145   std::cout << "value for x: " << xPair.first << "/" << xPair.second
+146             << std::endl;
+147   std::cout << "value for y: " << yPair.first << "/" << yPair.second
+148             << std::endl;
+149   std::cout << "value for x - y: " << xMinusYPair.first << "/"
+150             << xMinusYPair.second << std::endl;
+151   //! [docs-cpp-quickstart-12 end]
+152 
+153   // Another way to independently compute the value of x - y would be
+154   // to perform the (rational) arithmetic manually.
+155   // However, for more complex terms,
+156   // it is easier to let the solver do the evaluation.
+157   //! [docs-cpp-quickstart-13 start]
+158   std::pair<int64_t, uint64_t> xMinusYComputed = {
+159     xPair.first * yPair.second - xPair.second * yPair.first,
+160     xPair.second * yPair.second
+161   };
+162   uint64_t g = std::gcd(xMinusYComputed.first, xMinusYComputed.second);
+163   xMinusYComputed = { xMinusYComputed.first / g, xMinusYComputed.second / g };
+164   if (xMinusYComputed == xMinusYPair)
+165   {
+166     std::cout << "computed correctly" << std::endl;
+167   }
+168   else
+169   {
+170     std::cout << "computed incorrectly" << std::endl;
+171   }
+172   //! [docs-cpp-quickstart-13 end]
+173 
+174   // Next, we will check satisfiability of the same formula,
+175   // only this time over integer variables a and b.
+176 
+177   // We start by resetting assertions added to the solver.
+178   //! [docs-cpp-quickstart-14 start]
+179   solver.resetAssertions();
+180   //! [docs-cpp-quickstart-14 end]
+181 
+182   // Next, we assert the same assertions above with integers.
+183   // This time, we inline the construction of terms
+184   // to the assertion command.
+185   //! [docs-cpp-quickstart-15 start]
+186   solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), a}));
+187   solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), b}));
+188   solver.assertFormula(
+189       solver.mkTerm(LT, {solver.mkTerm(ADD, {a, b}), solver.mkInteger(1)}));
+190   solver.assertFormula(solver.mkTerm(LEQ, {a, b}));
+191   //! [docs-cpp-quickstart-15 end]
+192 
+193   // We check whether the revised assertion is satisfiable.
+194   //! [docs-cpp-quickstart-16 start]
+195   Result r2 = solver.checkSat();
+196   //! [docs-cpp-quickstart-16 end]
+197 
+198   // This time the formula is unsatisfiable
+199   //! [docs-cpp-quickstart-17 start]
+200   std::cout << "expected: unsat" << std::endl;
+201   std::cout << "result: " << r2 << std::endl;
+202   //! [docs-cpp-quickstart-17 end]
+203 
+204   // We can query the solver for an unsatisfiable core, i.e., a subset
+205   // of the assertions that is already unsatisfiable.
+206   //! [docs-cpp-quickstart-18 start]
+207   std::vector<Term> unsatCore = solver.getUnsatCore();
+208   std::cout << "unsat core size: " << unsatCore.size() << std::endl;
+209   std::cout << "unsat core: " << std::endl;
+210   for (const Term& t : unsatCore)
+211   {
+212     std::cout << t << std::endl;
+213   }
+214   //! [docs-cpp-quickstart-18 end]
+215 
+216   return 0;
+217 }
+
+
+
+
+ + + + +
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/result.html b/cvc5-1.0.2/api/cpp/result.html new file mode 100644 index 0000000..2e26c33 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/result.html @@ -0,0 +1,987 @@ + + + + + + + + Result — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Result + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + Result + + + + + ¶ + +
+
+
+

+ Encapsulation of a three-valued solver result, with explanations. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Result + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return true if + + + Result + + + is empty, i.e., a nullary + + + Result + + + , and not an actual result returned from a checkSat() (and friends) query. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isSat + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return true if query was a satisfiable checkSat() or checkSatAssuming() query. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUnsat + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return true if query was an unsatisfiable checkSat() or checkSatAssuming() query. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUnknown + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return true if query was a checkSat() or checkSatAssuming() query and cvc5 was not able to determine (un)satisfiability. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + Result + + + + + + + + & + + + + + r + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Operator overloading for equality of two results. +

+
+
+ Parameters + + : + +
+
+

+ + r + + – The result to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if the results are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + Result + + + + + + + + & + + + + + r + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Operator overloading for disequality of two results. +

+
+
+ Parameters + + : + +
+
+

+ + r + + – The result to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if the results are disequal. +

+
+
+
+
+
+
+ + + + + + + + + + + + UnknownExplanation + + + + + + + + + getUnknownExplanation + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An explanation for an unknown query result. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this result. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/roundingmode.html b/cvc5-1.0.2/api/cpp/roundingmode.html new file mode 100644 index 0000000..fae3310 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/roundingmode.html @@ -0,0 +1,642 @@ + + + + + + + + RoundingMode — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ RoundingMode + + ¶ + +

+
+
+ + + + + + + + + enum + + + + + + + + cvc5 + + + + + :: + + + + + + + RoundingMode + + + + + ¶ + +
+
+
+

+ Rounding modes for floating-point numbers. +

+

+ For many floating-point operations, infinitely precise results may not be representable with the number of available bits. Thus, the results are rounded in a certain way to one of the representable floating-point numbers. +

+

+

+

+ These rounding modes directly follow the SMT-LIB theory for floating-point +arithmetic, which in turn is based on IEEE Standard 754 + + [ + + IEE19 + + ] + + . +The rounding modes are specified in Sections 4.3.1 and 4.3.2 of the IEEE +Standard 754. +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + ROUND_NEAREST_TIES_TO_EVEN + + + + + ¶ + +
+
+
+

+ Round to the nearest even number. +

+

+ If the two nearest floating-point numbers bracketing an unrepresentable infinitely precise result are equally near, the one with an even least significant digit will be delivered. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ROUND_TOWARD_POSITIVE + + + + + ¶ + +
+
+
+

+ Round towards positive infinity (SMT-LIB: + + + +oo + + + ). +

+

+ The result shall be the format’s floating-point number (possibly + + + +oo + + + ) closest to and no less than the infinitely precise result. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ROUND_TOWARD_NEGATIVE + + + + + ¶ + +
+
+
+

+ Round towards negative infinity ( + + + -oo + + + ). +

+

+ The result shall be the format’s floating-point number (possibly + + + -oo + + + ) closest to and no less than the infinitely precise result. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ROUND_TOWARD_ZERO + + + + + ¶ + +
+
+
+

+ Round towards zero. +

+

+ The result shall be the format’s floating-point number closest to and no greater in magnitude than the infinitely precise result. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + ROUND_NEAREST_TIES_TO_AWAY + + + + + ¶ + +
+
+
+

+ Round to the nearest number away from zero. +

+

+ If the two nearest floating-point numbers bracketing an unrepresentable infinitely precise result are equally near, the one with larger magnitude will be selected. +

+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/solver.html b/cvc5-1.0.2/api/cpp/solver.html new file mode 100644 index 0000000..6b22ddd --- /dev/null +++ b/cvc5-1.0.2/api/cpp/solver.html @@ -0,0 +1,18497 @@ + + + + + + + + Solver — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Solver + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + Solver + + + + + ¶ + +
+
+
+

+ A cvc5 solver. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Solver + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+ Returns + + : + +
+
+

+ The + + + Solver + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + ~Solver + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + + Solver + + + + + ( + + + + const + + + + + + + + Solver + + + + + + & + + + + ) + + + + + + = + + + + + + + delete + + + + ¶ + +
+
+
+

+ Disallow copy/assignment. +

+
+
+
+
+ + + + + + + + + + + + Solver + + + + + + + + & + + + + + + operator + + + + + = + + + + + ( + + + + const + + + + + + + + Solver + + + + + + & + + + + ) + + + + + + = + + + + + + + delete + + + + ¶ + +
+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getNullSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + null. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getBooleanSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + Boolean. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getIntegerSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + Integer. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getRealSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + Real. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getRegExpSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + RegExp. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getRoundingModeSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + RoundingMode. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getStringSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ + + Sort + + + String. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkArraySort + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + indexSort + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + elemSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an array sort. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + indexSort + + – The array index sort. +

    +
  • +
  • +

    + + elemSort + + – The array element sort. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The array sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkBitVectorSort + + + + + ( + + + + uint32_t + + + + + + + size + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a bit-vector sort. +

+
+
+ Parameters + + : + +
+
+

+ + size + + – The bit-width of the bit-vector sort. +

+
+
+ Returns + + : + +
+
+

+ The bit-vector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkFloatingPointSort + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a floating-point sort. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – The bit-width of the exponent of the floating-point sort. +

    +
  • +
  • +

    + + sig + + – The bit-width of the significand of the floating-point sort. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkDatatypeSort + + + + + ( + + + + const + + + + + + + + DatatypeDecl + + + + + + + + & + + + + + dtypedecl + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a datatype sort. +

+
+
+ Parameters + + : + +
+
+

+ + dtypedecl + + – The datatype declaration from which the sort is created. +

+
+
+ Returns + + : + +
+
+

+ The datatype sort. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + mkDatatypeSorts + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + DatatypeDecl + + + + + + > + + + + + + + & + + + + + dtypedecls + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a vector of datatype sorts. The names of the datatype declarations must be distinct. +

+
+
+ Parameters + + : + +
+
+

+ + dtypedecls + + – The datatype declarations from which the sort is created. +

+
+
+ Returns + + : + +
+
+

+ The datatype sorts. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkFunctionSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + codomain + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create function sort. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sorts + + – The sort of the function arguments. +

    +
  • +
  • +

    + + codomain + + – The sort of the function return value. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkParamSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + & + + + + + symbol + + + + + + + = + + + + + + + std + + + + + :: + + + + + nullopt + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a sort parameter. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + symbol + + – The name of the sort. +

+
+
+ Returns + + : + +
+
+

+ The sort parameter. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkPredicateSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a predicate sort. +

+

+ This is equivalent to calling + + + mkFunctionSort() + + + with the Boolean sort as the codomain. +

+
+
+ Parameters + + : + +
+
+

+ + sorts + + – The list of sorts of the predicate. +

+
+
+ Returns + + : + +
+
+

+ The predicate sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkRecordSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + std + + + + + :: + + + + + pair + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + , + + + + + + + + Sort + + + + + + > + + + + + > + + + + + + + & + + + + + fields + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a record sort +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + fields + + – The list of fields of the record. +

+
+
+ Returns + + : + +
+
+

+ The record sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkSetSort + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + elemSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a set sort. +

+
+
+ Parameters + + : + +
+
+

+ + elemSort + + – The sort of the set elements. +

+
+
+ Returns + + : + +
+
+

+ The set sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkBagSort + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + elemSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a bag sort. +

+
+
+ Parameters + + : + +
+
+

+ + elemSort + + – The sort of the bag elements. +

+
+
+ Returns + + : + +
+
+

+ The bag sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkSequenceSort + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + elemSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a sequence sort. +

+
+
+ Parameters + + : + +
+
+

+ + elemSort + + – The sort of the sequence elements. +

+
+
+ Returns + + : + +
+
+

+ The sequence sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkUninterpretedSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + & + + + + + symbol + + + + + + + = + + + + + + + std + + + + + :: + + + + + nullopt + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an uninterpreted sort. +

+
+
+ Parameters + + : + +
+
+

+ + symbol + + – The name of the sort. +

+
+
+ Returns + + : + +
+
+

+ The uninterpreted sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkUnresolvedDatatypeSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + size_t + + + + + + + arity + + + + + + + = + + + + + + + 0 + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an unresolved datatype sort. +

+

+ This is for creating yet unresolved sort placeholders for mutually recursive parametric datatypes. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The symbol of the sort. +

    +
  • +
  • +

    + + arity + + – The number of sort parameters of the sort. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The unresolved sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkUninterpretedSortConstructorSort + + + + + ( + + + + size_t + + + + + + + arity + + + , + + + const + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + & + + + + + symbol + + + + + + + = + + + + + + + std + + + + + :: + + + + + nullopt + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an uninterpreted sort constructor sort. +

+

+ An uninterpreted sort constructor is an uninterpreted sort with arity > 0. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The symbol of the sort. +

    +
  • +
  • +

    + + arity + + – The arity of the sort (must be > 0) +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The uninterpreted sort constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + mkTupleSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a tuple sort. +

+
+
+ Parameters + + : + +
+
+

+ + sorts + + – Of the elements of the tuple. +

+
+
+ Returns + + : + +
+
+

+ The tuple sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkTerm + + + + + ( + + + + + Kind + + + + + + + + kind + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + children + + + + + + + = + + + + + + + { + + + + + } + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create n-ary term of given kind. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + kind + + – The kind of the term. +

    +
  • +
  • +

    + + children + + – The children of the term. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The + + + Term + + +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkTerm + + + + + ( + + + + const + + + + + + + + Op + + + + + + + + & + + + + + op + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + children + + + + + + + = + + + + + + + { + + + + + } + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create n-ary term of given kind from a given operator. Create operators with + + + mkOp() + + + . +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + op + + – The operator. +

    +
  • +
  • +

    + + children + + – The children of the term. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The + + + Term + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkTuple + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a tuple term, where terms have the provided sorts. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sorts + + – The sorts of the elements in the tuple. +

    +
  • +
  • +

    + + terms + + – The elements in the tuple. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The tuple + + + Term + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + Op + + + + + + + + + mkOp + + + + + ( + + + + + Kind + + + + + + + + kind + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + uint32_t + + + + + > + + + + + + + & + + + + + args + + + + + + + = + + + + + + + { + + + + + } + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create operator of Kind: +

+ +

+ See + + + cvc5::Kind + + + for a description of the parameters. +

+
+

+ Note +

+

+ If + + + args + + + is empty, the + + + Op + + + simply wraps the + + + cvc5::Kind + + + . The Kind can be used in + + + Solver::mkTerm + + + directly without creating an + + + Op + + + first. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + kind + + – The kind of the operator. +

    +
  • +
  • +

    + + args + + – The arguments (indices) of the operator. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Op + + + + + + + + + mkOp + + + + + ( + + + + + Kind + + + + + + + + kind + + + , + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + arg + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create operator of kind: +

+
    +
  • +

    + DIVISIBLE (to support arbitrary precision integers) See + + + cvc5::Kind + + + for a description of the parameters. +

    +
  • +
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + kind + + – The kind of the operator. +

    +
  • +
  • +

    + + arg + + – The string argument to this operator. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkTrue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a Boolean true constant. +

+
+
+ Returns + + : + +
+
+

+ The true constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFalse + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a Boolean false constant. +

+
+
+ Returns + + : + +
+
+

+ The false constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkBoolean + + + + + ( + + + + bool + + + + + + + val + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a Boolean constant. +

+
+
+ Parameters + + : + +
+
+

+ + val + + – The value of the constant. +

+
+
+ Returns + + : + +
+
+

+ The Boolean constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkPi + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a constant representing the number Pi. +

+
+
+ Returns + + : + +
+
+

+ A constant representing Pi. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkInteger + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an integer constant from a string. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The string representation of the constant, may represent an integer (e.g., “123”). +

+
+
+ Returns + + : + +
+
+

+ A constant of sort Integer assuming ‘s’ represents an integer) +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkInteger + + + + + ( + + + + int64_t + + + + + + + val + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an integer constant from a c++ int. +

+
+
+ Parameters + + : + +
+
+

+ + val + + – The value of the constant. +

+
+
+ Returns + + : + +
+
+

+ A constant of sort Integer. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkReal + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a real constant from a string. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The string representation of the constant, may represent an integer (e.g., “123”) or real constant (e.g., “12.34” or “12/34”). +

+
+
+ Returns + + : + +
+
+

+ A constant of sort Real. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkReal + + + + + ( + + + + int64_t + + + + + + + val + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a real constant from an integer. +

+
+
+ Parameters + + : + +
+
+

+ + val + + – The value of the constant. +

+
+
+ Returns + + : + +
+
+

+ A constant of sort Integer. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkReal + + + + + ( + + + + int64_t + + + + + + + num + + + , + + + int64_t + + + + + + + den + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a real constant from a rational. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + num + + – The value of the numerator. +

    +
  • +
  • +

    + + den + + – The value of the denominator. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ A constant of sort Real. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkRegexpAll + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a regular expression all (re.all) term. +

+
+
+ Returns + + : + +
+
+

+ The all term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkRegexpAllchar + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a regular expression allchar (re.allchar) term. +

+
+
+ Returns + + : + +
+
+

+ The allchar term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkRegexpNone + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a regular expression none (re.none) term. +

+
+
+ Returns + + : + +
+
+

+ The none term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkEmptySet + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a constant representing an empty set of the given sort. +

+
+
+ Parameters + + : + +
+
+

+ + sort + + – The sort of the set elements. +

+
+
+ Returns + + : + +
+
+

+ The empty set constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkEmptyBag + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a constant representing an empty bag of the given sort. +

+
+
+ Parameters + + : + +
+
+

+ + sort + + – The sort of the bag elements. +

+
+
+ Returns + + : + +
+
+

+ The empty bag constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkSepEmp + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a separation logic empty term. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ The separation logic empty term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkSepNil + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a separation logic nil term. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + sort + + – The sort of the nil term. +

+
+
+ Returns + + : + +
+
+

+ The separation logic nil term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkString + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + s + + + , + + + bool + + + + + + + useEscSequences + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a String constant from a + + + std::string + + + which may contain SMT-LIB compatible escape sequences like + + + \u1234 + + + to encode unicode characters. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + s + + – The string this constant represents. +

    +
  • +
  • +

    + + useEscSequences + + – Determines whether escape sequences in + + + s + + + should. be converted to the corresponding unicode character +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The String constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkString + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + wstring + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a String constant from a + + + std::wstring + + + . This method does not support escape sequences as + + + std::wstring + + + already supports unicode characters. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The string this constant represents. +

+
+
+ Returns + + : + +
+
+

+ The String constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkEmptySequence + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create an empty sequence of the given element sort. +

+
+
+ Parameters + + : + +
+
+

+ + sort + + – The element sort of the sequence. +

+
+
+ Returns + + : + +
+
+

+ The empty sequence with given element sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkUniverseSet + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a universe set of the given sort. +

+
+
+ Parameters + + : + +
+
+

+ + sort + + – The sort of the set elements. +

+
+
+ Returns + + : + +
+
+

+ The universe set constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkBitVector + + + + + ( + + + + uint32_t + + + + + + + size + + + , + + + uint64_t + + + + + + + val + + + + + + + = + + + + + + + 0 + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a bit-vector constant of given size and value. +

+
+

+ Note +

+

+ The given value must fit into a bit-vector of the given size. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + size + + – The bit-width of the bit-vector sort. +

    +
  • +
  • +

    + + val + + – The value of the constant. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The bit-vector constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkBitVector + + + + + ( + + + + uint32_t + + + + + + + size + + + , + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + s + + + , + + + uint32_t + + + + + + + base + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a bit-vector constant of a given bit-width from a given string of base 2, 10 or 16. +

+
+

+ Note +

+

+ The given value must fit into a bit-vector of the given size. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + size + + – The bit-width of the constant. +

    +
  • +
  • +

    + + s + + – The string representation of the constant. +

    +
  • +
  • +

    + + base + + – The base of the string representation (2, 10, or 16) +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The bit-vector constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkConstArray + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + val + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a constant array with the provided constant value stored at every index +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The sort of the constant array (must be an array sort). +

    +
  • +
  • +

    + + val + + – The constant value to store (must match the sort’s element sort). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The constant array term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPointPosInf + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a positive infinity floating-point constant (SMT-LIB: + + + +oo + + + ). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Number of bits in the exponent. +

    +
  • +
  • +

    + + sig + + – Number of bits in the significand. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The floating-point constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPointNegInf + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a negative infinity floating-point constant (SMT-LIB: + + + -oo + + + ). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Number of bits in the exponent. +

    +
  • +
  • +

    + + sig + + – Number of bits in the significand. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The floating-point constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPointNaN + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a not-a-number floating-point constant (SMT-LIB: + + + NaN + + + ). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Number of bits in the exponent. +

    +
  • +
  • +

    + + sig + + – Number of bits in the significand. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The floating-point constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPointPosZero + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a positive zero floating-point constant (SMT-LIB: +zero). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Number of bits in the exponent. +

    +
  • +
  • +

    + + sig + + – Number of bits in the significand. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The floating-point constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPointNegZero + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a negative zero floating-point constant (SMT-LIB: -zero). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Number of bits in the exponent. +

    +
  • +
  • +

    + + sig + + – Number of bits in the significand. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The floating-point constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkRoundingMode + + + + + ( + + + + + RoundingMode + + + + + + + + rm + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a rounding mode constant. +

+
+
+ Parameters + + : + +
+
+

+ + rm + + – The floating point rounding mode this constant represents. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkFloatingPoint + + + + + ( + + + + uint32_t + + + + + + + exp + + + , + + + uint32_t + + + + + + + sig + + + , + + + + Term + + + + + + + + val + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a floating-point constant. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + exp + + – Size of the exponent. +

    +
  • +
  • +

    + + sig + + – Size of the significand. +

    +
  • +
  • +

    + + val + + – Value of the floating-point constant as a bit-vector term. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkCardinalityConstraint + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + uint32_t + + + + + + + upperBound + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a cardinality constraint for an uninterpreted sort. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The sort the cardinality constraint is for. +

    +
  • +
  • +

    + + upperBound + + – The upper bound on the cardinality of the sort. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The cardinality constraint. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkConst + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + & + + + + + symbol + + + + + + + = + + + + + + + std + + + + + :: + + + + + nullopt + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a free constant. +

+

+ SMT-LIB: +

+

+

+
+
+
(declare-const <symbol> <sort>)
+(declare-fun <symbol> () <sort>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The sort of the constant. +

    +
  • +
  • +

    + + symbol + + – The name of the constant (optional). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The constant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + mkVar + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + std + + + + + :: + + + + + optional + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + & + + + + + symbol + + + + + + + = + + + + + + + std + + + + + :: + + + + + nullopt + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a bound variable to be used in a binder (i.e., a quantifier, a lambda, or a witness binder). +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The sort of the variable. +

    +
  • +
  • +

    + + symbol + + – The name of the variable (optional). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The variable. +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeConstructorDecl + + + + + + + + + mkDatatypeConstructorDecl + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + ¶ + +
+
+
+

+ Create a datatype constructor declaration. +

+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the datatype constructor. +

+
+
+ Returns + + : + +
+
+

+ The + + + DatatypeConstructorDecl + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeDecl + + + + + + + + + mkDatatypeDecl + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + , + + + bool + + + + + + + isCoDatatype + + + + + + + = + + + + + + + false + + + + ) + + + ¶ + +
+
+
+

+ Create a datatype declaration. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + name + + – The name of the datatype. +

    +
  • +
  • +

    + + isCoDatatype + + – True if a codatatype is to be constructed. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The + + + DatatypeDecl + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + DatatypeDecl + + + + + + + + + mkDatatypeDecl + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + params + + + , + + + bool + + + + + + + isCoDatatype + + + + + + + = + + + + + + + false + + + + ) + + + ¶ + +
+
+
+

+ Create a datatype declaration. Create sorts parameter with + + + Solver::mkParamSort() + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + name + + – The name of the datatype. +

    +
  • +
  • +

    + + params + + – A list of sort parameters. +

    +
  • +
  • +

    + + isCoDatatype + + – True if a codatatype is to be constructed. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The + + + DatatypeDecl + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + simplify + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + ¶ + +
+
+
+

+ Simplify a formula without doing “much” work. +

+

+ Does not involve the SAT Engine in the simplification, but uses the current definitions, and assertions. It also involves theory normalization. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The formula to simplify. +

+
+
+ Returns + + : + +
+
+

+ The simplified formula. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + assertFormula + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Assert a formula. +

+

+ SMT-LIB: +

+

+

+
+
+
(assert <term>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + term + + – The formula to assert. +

+
+
+
+
+
+
+ + + + + + + + + + + + Result + + + + + + + + + checkSat + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Check satisfiability. +

+

+ SMT-LIB: +

+

+

+
+
+
(check-sat)
+
+
+
+
+
+ Returns + + : + +
+
+

+ The result of the satisfiability check. +

+
+
+
+
+
+
+ + + + + + + + + + + + Result + + + + + + + + + checkSatAssuming + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + assumption + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Check satisfiability assuming the given formula. +

+

+ SMT-LIB: +

+

+

+
+
+
(check-sat-assuming ( <prop_literal> ))
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + assumption + + – The formula to assume. +

+
+
+ Returns + + : + +
+
+

+ The result of the satisfiability check. +

+
+
+
+
+
+
+ + + + + + + + + + + + Result + + + + + + + + + checkSatAssuming + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + assumptions + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Check satisfiability assuming the given formulas. +

+

+ SMT-LIB: +

+

+

+
+
+
(check-sat-assuming ( <prop_literal>+ ))
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + assumptions + + – The formulas to assume. +

+
+
+ Returns + + : + +
+
+

+ The result of the satisfiability check. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + declareDatatype + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + DatatypeConstructorDecl + + + + + + > + + + + + + + & + + + + + ctors + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create datatype sort. +

+

+ SMT-LIB: +

+

+

+
+
+
(declare-datatype <symbol> <datatype_decl>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the datatype sort. +

    +
  • +
  • +

    + + ctors + + – The constructor declarations of the datatype sort. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The datatype sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + declareFun + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Declare n-ary function symbol. +

+

+ SMT-LIB: +

+

+

+
+
+
(declare-fun <symbol> ( <sort>* ) <sort>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the function. +

    +
  • +
  • +

    + + sorts + + – The sorts of the parameters to this function. +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + declareSort + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + uint32_t + + + + + + + arity + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Declare uninterpreted sort. +

+

+ SMT-LIB: +

+

+

+
+
+
(declare-sort <symbol> <numeral>)
+
+
+
+ +
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the sort. +

    +
  • +
  • +

    + + arity + + – The arity of the sort. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + defineFun + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + bound_vars + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + , + + + bool + + + + + + + global + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Define n-ary function. +

+

+ SMT-LIB: +

+

+

+
+
+
(define-fun <function_def>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the function. +

    +
  • +
  • +

    + + bound_vars + + – The parameters to this function. +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function. +

    +
  • +
  • +

    + + term + + – The function body. +

    +
  • +
  • +

    + + global + + – Determines whether this definition is global (i.e., persists when popping the context). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + defineFunRec + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + bound_vars + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + , + + + bool + + + + + + + global + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Define recursive function. +

+

+ SMT-LIB: +

+

+

+
+
+
(define-fun-rec <function_def>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the function. +

    +
  • +
  • +

    + + bound_vars + + – The parameters to this function. +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function. +

    +
  • +
  • +

    + + term + + – The function body. +

    +
  • +
  • +

    + + global + + – Determines whether this definition is global (i.e., persists when popping the context). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + defineFunRec + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + fun + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + bound_vars + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + , + + + bool + + + + + + + global + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Define recursive function. +

+

+ SMT-LIB: +

+

+

+
+
+
(define-fun-rec <function_def>)
+
+
+
+

+ Create parameter + + + fun + + + with + + + mkConst() + + + . +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + fun + + – The sorted function. +

    +
  • +
  • +

    + + bound_vars + + – The parameters to this function. +

    +
  • +
  • +

    + + term + + – The function body. +

    +
  • +
  • +

    + + global + + – Determines whether this definition is global (i.e., persists when popping the context). +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + defineFunsRec + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + funs + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + > + + + + + + + & + + + + + bound_vars + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + , + + + bool + + + + + + + global + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Define recursive functions. +

+

+ SMT-LIB: +

+

+

+
+
+
(define-funs-rec
+    ( <function_decl>_1 ... <function_decl>_n )
+    ( <term>_1 ... <term>_n )
+)
+
+
+
+

+ Create elements of parameter ‘funs’ with + + + mkConst() + + + . +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + funs + + – The sorted functions. +

    +
  • +
  • +

    + + bound_vars + + – The list of parameters to the functions. +

    +
  • +
  • +

    + + terms + + – The list of function bodies of the functions. +

    +
  • +
  • +

    + + global + + – Determines whether this definition is global (i.e., persists when popping the context). +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getAssertions + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the list of asserted formulas. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-assertions)
+
+
+
+
+
+ Returns + + : + +
+
+

+ The list of asserted formulas. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getInfo + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + flag + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get info from the solver. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-info <info_flag>)
+
+
+
+
+
+ Returns + + : + +
+
+

+ The info. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getOption + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + option + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the value of a given option. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-option <keyword>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + option + + – The option for which the value is queried. +

+
+
+ Returns + + : + +
+
+

+ A string representation of the option value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + > + + + + + + + + getOptionNames + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get all option names that can be used with + + + setOption() + + + , + + + getOption() + + + and + + + getOptionInfo() + + + . +

+
+
+ Returns + + : + +
+
+

+ All option names. +

+
+
+
+
+
+
+ + + + + + + + + + + + OptionInfo + + + + + + + + + getOptionInfo + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + option + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get some information about the given option. +

+

+ Check the + + + OptionInfo + + + class for more details on which information is available. +

+
+
+ Returns + + : + +
+
+

+ Information about the given option. +

+
+
+
+
+
+
+ + + + + + + + + + + + DriverOptions + + + + + + + + + getDriverOptions + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the driver options, which provide access to options that can not be communicated properly via + + + getOption() + + + and + + + getOptionInfo() + + + . +

+
+
+ Returns + + : + +
+
+

+ A + + + DriverOptions + + + object. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getUnsatAssumptions + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the set of unsat (“failed”) assumptions. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-unsat-assumptions)
+
+
+
+

+ Requires to enable option + + + produce-unsat-assumptions + + + . +

+
+
+ Returns + + : + +
+
+

+ The set of unsat assumptions. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getUnsatCore + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the unsatisfiable core. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-unsat-core)
+
+
+
+

+ Requires to enable option + + + produce-unsat-cores + + + . +

+
+

+ Note +

+

+ In contrast to SMT-LIB, cvc5’s API does not distinguish between named +and unnamed assertions when producing an unsatisfiable core. +Additionally, the API allows this option to be called after a check with +assumptions. A subset of those assumptions may be included in the +unsatisfiable core returned by this method. +

+
+
+
+ Returns + + : + +
+
+

+ A set of terms representing the unsatisfiable core. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + map + + + + + < + + + + + + Term + + + + + + , + + + + + + + + Term + + + + + + > + + + + + + + + getDifficulty + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get a difficulty estimate for an asserted formula. This method is intended to be called immediately after any response to a checkSat. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ A map from (a subset of) the input assertions to a real value that. is an estimate of how difficult each assertion was to solve. Unmentioned assertions can be assumed to have zero difficulty. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getProof + + + + + ( + + + + + modes + + + + + + :: + + + + + + ProofComponent + + + + + + + + c + + + + + + + = + + + + + + + + modes + + + + + + :: + + + + + + PROOF_COMPONENT_FULL + + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get a proof associated with the most recent call to checkSat. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-proof :c)
+
+
+
+

+ Requires to enable option + + + produce-proofs + + + . +The string representation depends on the value of option + + + produce-proofs + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + c + + – The component of the proof to return +

+
+
+ Returns + + : + +
+
+

+ A string representing the proof. This takes into account :ref: + + + proof-format-mode + + + <lbl-option-proof-format-mode> + + + when + + + c + + + is + + + PROOF_COMPONENT_FULL + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getLearnedLiterals + + + + + ( + + + + + modes + + + + + + :: + + + + + + LearnedLitType + + + + + + + + t + + + + + + + = + + + + + + + + modes + + + + + + :: + + + + + + LEARNED_LIT_INPUT + + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get a list of learned literals that are entailed by the current set of assertions. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The type of learned literals to return +

+
+
+ Returns + + : + +
+
+

+ A list of literals that were learned at top-level. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getValue + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the value of the given term in the current model. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-value ( <term> ))
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + term + + – The term for which the value is queried. +

+
+
+ Returns + + : + +
+
+

+ The value of the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getValue + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the values of the given terms in the current model. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-value ( <term>* ))
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + terms + + – The terms for which the value is queried. +

+
+
+ Returns + + : + +
+
+

+ The values of the given terms. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getModelDomainElements + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the domain elements of uninterpreted sort s in the current model. The current model interprets s as the finite sort whose domain elements are given in the return value of this method. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The uninterpreted sort in question. +

+
+
+ Returns + + : + +
+
+

+ The domain elements of s in the current model. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isModelCoreSymbol + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + v + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ This returns false if the model value of free constant v was not essential for showing the satisfiability of the last call to checkSat using the current model. This method will only return false (for any + + + v + + + ) if option + + + + model-cores + + + + has been set. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + v + + – The term in question. +

+
+
+ Returns + + : + +
+
+

+ True if + + + v + + + is a model core symbol. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getModel + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + vars + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the model +

+

+ SMT-LIB: +

+

+

+
+
+
(get-model)
+
+
+
+

+ Requires to enable option + + + produce-models + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sorts + + – The list of uninterpreted sorts that should be printed in the model. +

    +
  • +
  • +

    + + vars + + – The list of free constants that should be printed in the model. A subset of these may be printed based on + + + isModelCoreSymbol() + + + . +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ A string representing the model. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getQuantifierElimination + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + q + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Do quantifier elimination. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-qe <q>)
+
+
+
+
+

+ Note +

+

+ Quantifier Elimination is is only complete for logics such as LRA, LIA and BV. +

+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + q + + – A quantified formula of the form + + \(Q\bar{x}_1... Q\bar{x}_n. P( x_1...x_i, y_1...y_j)\) + + where + + \(Q\bar{x}\) + + is a set of quantified variables of the form + + \(Q x_1...x_k\) + + and + + \(P( x_1...x_i, y_1...y_j )\) + + is a quantifier-free formula +

+
+
+ Returns + + : + +
+
+

+ A formula + + \(\phi\) + + such that, given the current set of formulas + + \(A\) + + asserted to this solver: +

+
    +
  • +

    + + \((A \wedge q)\) + + and + + \((A \wedge \phi)\) + + are equivalent +

    +
  • +
  • +

    + + \(\phi\) + + is quantifier-free formula containing only free variables in + + \(y_1...y_n\) + + . +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getQuantifierEliminationDisjunct + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + q + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Do partial quantifier elimination, which can be used for incrementally computing the result of a quantifier elimination. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-qe-disjunct <q>)
+
+
+
+
+

+ Note +

+

+ Quantifier Elimination is is only complete for logics such as LRA, LIA and BV. +

+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + q + + – A quantified formula of the form + + \(Q\bar{x}_1... Q\bar{x}_n. P( x_1...x_i, y_1...y_j)\) + + where + + \(Q\bar{x}\) + + is a set of quantified variables of the form + + \(Q x_1...x_k\) + + and + + \(P( x_1...x_i, y_1...y_j )\) + + is a quantifier-free formula +

+
+
+ Returns + + : + +
+
+

+ A formula + + \(\phi\) + + such that, given the current set of formulas + + \(A\) + + asserted to this solver: +

+
    +
  • +

    + + \((A \wedge q \implies A \wedge \phi)\) + + if + + \(Q\) + + is + + \(\forall\) + + , and + + \((A \wedge \phi \implies A \wedge q)\) + + if + + \(Q\) + + is + + \(\exists\) + +

    +
  • +
  • +

    + + \(\phi\) + + is quantifier-free formula containing only free variables in + + \(y_1...y_n\) + +

    +
  • +
  • +

    + If + + \(Q\) + + is + + \(\exists\) + + , let + + \((A \wedge Q_n)\) + + be the formula + + \((A \wedge \neg (\phi \wedge Q_1) \wedge ... \wedge \neg (\phi \wedge Q_n))\) + + where for each + + \(i = 1...n\) + + , formula + + \((\phi \wedge Q_i)\) + + is the result of calling + + + Solver::getQuantifierEliminationDisjunct() + + + for + + \(q\) + + with the set of assertions + + \((A \wedge Q_{i-1})\) + + . Similarly, if + + \(Q\) + + is + + \(\forall\) + + , then let + + \((A \wedge Q_n)\) + + be + + \((A \wedge (\phi \wedge Q_1) \wedge ... \wedge (\phi \wedge Q_n))\) + + where + + \((\phi \wedge Q_i)\) + + is the same as above. In either case, we have that + + \((\phi \wedge Q_j)\) + + will eventually be true or false, for some finite j. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + declareSepHeap + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + locSort + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + dataSort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ When using separation logic, this sets the location sort and the datatype sort to the given ones. This method should be invoked exactly once, before any separation logic constraints are provided. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + locSort + + – The location sort of the heap. +

    +
  • +
  • +

    + + dataSort + + – The data sort of the heap. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getValueSepHeap + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ When using separation logic, obtain the term for the heap. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ The term for the heap. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getValueSepNil + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ When using separation logic, obtain the term for nil. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ The term for nil. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + declarePool + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + initValue + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Declare a symbolic pool of terms with the given initial value. +

+

+ For details on how pools are used to specify instructions for quantifier instantiation, see documentation for the + + + INST_POOL + + + kind. +

+

+ SMT-LIB: +

+

+

+
+
+
(declare-pool <symbol> <sort> ( <term>* ))
+
+
+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the pool. +

    +
  • +
  • +

    + + sort + + – The sort of the elements of the pool. +

    +
  • +
  • +

    + + initValue + + – The initial value of the pool. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The pool symbol. +

+
+
+
+
+
+
+ + + + + + + + + + Term + + + + + + + + + declareOracleFun + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + std + + + + + :: + + + + + function + + + + + < + + + + + + Term + + + + + + ( + + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + & + + + + + ) + + + + + > + + + + + + + fn + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Declare an oracle function with reference to an implementation. +

+

+ Oracle functions have a different semantics with respect to ordinary declared functions. In particular, for an input to be satisfiable, its oracle functions are implicitly universally quantified. +

+

+ This method is used in part for implementing this command: +

+

+

+

+ (declare-oracle-fun <sym> (<sort>*) <sort> <sym>) +

+

+ In particular, the above command is implemented by constructing a function over terms that wraps a call to binary sym via a text interface. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the oracle +

    +
  • +
  • +

    + + sorts + + – The sorts of the parameters to this function +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function +

    +
  • +
  • +

    + + fn + + – The function that implements the oracle function. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The oracle function +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + pop + + + + + ( + + + + uint32_t + + + + + + + nscopes + + + + + + + = + + + + + + + 1 + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Pop (a) level(s) from the assertion stack. +

+

+ SMT-LIB: +

+

+

+
+
+
(pop <numeral>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + nscopes + + – The number of levels to pop. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getInterpolant + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + conj + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get an interpolant +

+

+ SMT-LIB: +

+

+

+
+
+
(get-interpolant <conj>)
+
+
+
+

+ Requires option + + + produce-interpolants + + + to be set to +a mode different from + + none + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + conj + + – The conjecture term. +

+
+
+ Returns + + : + +
+
+

+ A + + + Term + + + + \(I\) + + such that + + \(A \rightarrow I\) + + and + + \(I \rightarrow B\) + + are valid, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by + + + conj + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getInterpolant + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + conj + + + , + + + + Grammar + + + + + + + + & + + + + + grammar + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get an interpolant +

+

+ SMT-LIB: +

+

+

+
+
+
(get-interpolant <conj> <grammar>)
+
+
+
+

+ Requires option + + + produce-interpolants + + + to be set to +a mode different from + + none + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + conj + + – The conjecture term. +

    +
  • +
  • +

    + + grammar + + – The grammar for the interpolant I. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ A + + + Term + + + + \(I\) + + such that + + \(A \rightarrow I\) + + and + + \(I \rightarrow B\) + + are valid, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by + + + conj + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getInterpolantNext + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the next interpolant. Can only be called immediately after a successful call to get-interpolant or get-interpolant-next. Is guaranteed to produce a syntactically different interpolant wrt the last returned interpolant if successful. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-interpolant-next)
+
+
+
+

+ Requires to enable incremental mode, and option + + + produce-interpolants + + + to be set to +a mode different from + + none + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ A + + + Term + + + + \(I\) + + such that + + \(A \rightarrow I\) + + and + + \(I \rightarrow B\) + + are valid, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by + + + conj + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getAbduct + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + conj + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get an abduct. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-abduct <conj>)
+
+
+
+

+ Requires to enable option + + + produce-abducts + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + conj + + – The conjecture term. +

+
+
+ Returns + + : + +
+
+

+ A term + + \(C\) + + such that + + \((A \wedge C)\) + + is satisfiable, and + + \((A \wedge \neg B \wedge C)\) + + is unsatisfiable, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by + + + conj + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getAbduct + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + conj + + + , + + + + Grammar + + + + + + + + & + + + + + grammar + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get an abduct. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-abduct <conj> <grammar>)
+
+
+
+

+ Requires to enable option + + + produce-abducts + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + conj + + – The conjecture term. +

    +
  • +
  • +

    + + grammar + + – The grammar for the abduct + + \(C\) + +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ A term C such that + + \((A \wedge C)\) + + is satisfiable, and + + \((A \wedge \neg B \wedge C)\) + + is unsatisfiable, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by + + + conj + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getAbductNext + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the next abduct. Can only be called immediately after a successful call to get-abduct or get-abduct-next. Is guaranteed to produce a syntactically different abduct wrt the last returned abduct if successful. +

+

+ SMT-LIB: +

+

+

+
+
+
(get-abduct-next)
+
+
+
+

+ Requires to enable incremental mode, and option + + + produce-abducts + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ A term C such that + + \((A \wedge C)\) + + is satisfiable, and + + \((A \wedge \neg B \wedge C)\) + + is unsatisfiable, where + + \(A\) + + is the current set of assertions and + + \(B\) + + is given in the input by the last call to + + + getAbduct() + + + , or the null term if such a term cannot be found. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + blockModel + + + + + ( + + + + + modes + + + + + + :: + + + + + + BlockModelsMode + + + + + + + + mode + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Block the current model. Can be called only if immediately preceded by a SAT or INVALID query. +

+

+ SMT-LIB: +

+

+

+
+
+
(block-model)
+
+
+
+

+ Requires enabling option + + + produce-models + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+

+ + mode + + – The mode to use for blocking. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + blockModelValues + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Block the current model values of (at least) the values in terms. Can be called only if immediately preceded by a SAT or NOT_ENTAILED query. +

+

+ SMT-LIB: +

+

+

+
+
+
(block-model-values ( <terms>+ ))
+
+
+
+

+ Requires enabling option + + + produce-models + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getInstantiations + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ A string that contains information about all instantiations made by the quantifiers module. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + push + + + + + ( + + + + uint32_t + + + + + + + nscopes + + + + + + + = + + + + + + + 1 + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Push (a) level(s) to the assertion stack. +

+

+ SMT-LIB: +

+

+

+
+
+
(push <numeral>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + nscopes + + – The number of levels to push. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + resetAssertions + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Remove all assertions. +

+

+ SMT-LIB: +

+

+

+

+

+
+
+
(reset-assertions)
+
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + setInfo + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + keyword + + + , + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + value + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Set info. +

+

+ SMT-LIB: +

+

+

+
+
+
(set-info <attribute>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + keyword + + – The info flag. +

    +
  • +
  • +

    + + value + + – The value of the info flag. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + setLogic + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + logic + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Set logic. +

+

+ SMT-LIB: +

+

+

+
+
+
(set-logic <symbol>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + logic + + – The logic to set. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + setOption + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + option + + + , + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + value + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Set option. +

+

+ SMT-LIB: +

+

+

+
+
+
(set-option :<option> <value>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + option + + – The option name. +

    +
  • +
  • +

    + + value + + – The option value. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + declareSygusVar + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Append + + + symbol + + + to the current list of universal variables. +

+

+ SyGuS v2: +

+

+

+
+
+
(declare-var <symbol> <sort>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The sort of the universal variable. +

    +
  • +
  • +

    + + symbol + + – The name of the universal variable. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The universal variable. +

+
+
+
+
+
+
+ + + + + + + + + + + + Grammar + + + + + + + + + mkGrammar + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + boundVars + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + ntSymbols + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Create a Sygus grammar. The first non-terminal is treated as the starting non-terminal, so the order of non-terminals matters. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + boundVars + + – The parameters to corresponding synth-fun/synth-inv. +

    +
  • +
  • +

    + + ntSymbols + + – The pre-declaration of the non-terminal symbols. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The grammar. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + synthFun + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + boundVars + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Synthesize n-ary function. +

+

+ SyGuS v2: +

+

+

+
+
+
(synth-fun <symbol> ( <boundVars>* ) <sort>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the function. +

    +
  • +
  • +

    + + boundVars + + – The parameters to this function. +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + synthFun + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + boundVars + + + , + + + + Sort + + + + + + + + sort + + + , + + + + Grammar + + + + + + + + & + + + + + grammar + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Synthesize n-ary function following specified syntactic constraints. +

+

+ SyGuS v2: +

+

+

+
+
+
(synth-fun <symbol> ( <boundVars>* ) <sort> <grammar>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the function. +

    +
  • +
  • +

    + + boundVars + + – The parameters to this function. +

    +
  • +
  • +

    + + sort + + – The sort of the return value of this function. +

    +
  • +
  • +

    + + grammar + + – The syntactic constraints. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The function. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + synthInv + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + boundVars + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Synthesize invariant. +

+

+ SyGuS v2: +

+

+

+
+
+
(synth-inv <symbol> ( <boundVars>* ))
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the invariant. +

    +
  • +
  • +

    + + boundVars + + – The parameters to this invariant. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The invariant. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + synthInv + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + symbol + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + boundVars + + + , + + + + Grammar + + + + + + + + & + + + + + grammar + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Synthesize invariant following specified syntactic constraints. +

+

+ SyGuS v2: +

+

+

+
+
+
(synth-inv <symbol> ( <boundVars>* ) <grammar>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + symbol + + – The name of the invariant. +

    +
  • +
  • +

    + + boundVars + + – The parameters to this invariant. +

    +
  • +
  • +

    + + grammar + + – The syntactic constraints. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The invariant. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSygusConstraint + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Add a forumla to the set of Sygus constraints. +

+

+ SyGuS v2: +

+

+

+
+
+
(constraint <term>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + term + + – The formula to add as a constraint. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSygusAssume + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Add a forumla to the set of Sygus assumptions. +

+

+ SyGuS v2: +

+

+

+
+
+
(assume <term>)
+
+
+
+
+
+ Parameters + + : + +
+
+

+ + term + + – The formula to add as an assumption. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + addSygusInvConstraint + + + + + ( + + + + + Term + + + + + + + + inv + + + , + + + + Term + + + + + + + + pre + + + , + + + + Term + + + + + + + + trans + + + , + + + + Term + + + + + + + + post + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Add a set of Sygus constraints to the current state that correspond to an invariant synthesis problem. +

+

+ SyGuS v2: +

+

+

+
+
+
(inv-constraint <inv> <pre> <trans> <post>)
+
+
+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + inv + + – The function-to-synthesize. +

    +
  • +
  • +

    + + pre + + – The pre-condition. +

    +
  • +
  • +

    + + trans + + – The transition relation. +

    +
  • +
  • +

    + + post + + – The post-condition. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + SynthResult + + + + + + + + + checkSynth + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Try to find a solution for the synthesis conjecture corresponding to the current list of functions-to-synthesize, universal variables and constraints. +

+

+ SyGuS v2: +

+

+

+
+
+
(check-synth)
+
+
+
+
+
+ Returns + + : + +
+
+

+ The result of the check, which is “solution” if the check found a solution in which case solutions are available via getSynthSolutions, “no solution” if it was determined there is no solution, or “unknown” otherwise. +

+
+
+
+
+
+
+ + + + + + + + + + + + SynthResult + + + + + + + + + checkSynthNext + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Try to find a next solution for the synthesis conjecture corresponding to the current list of functions-to-synthesize, universal variables and constraints. Must be called immediately after a successful call to check-synth or check-synth-next. Requires incremental mode. +

+

+ SyGuS v2: +

+

+

+
+
+
(check-synth-next)
+
+
+
+
+
+ Returns + + : + +
+
+

+ The result of the check, which is “solution” if the check found a solution in which case solutions are available via getSynthSolutions, “no solution” if it was determined there is no solution, or “unknown” otherwise. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getSynthSolution + + + + + ( + + + + + Term + + + + + + + + term + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the synthesis solution of the given term. This method should be called immediately after the solver answers unsat for sygus input. +

+
+
+ Parameters + + : + +
+
+

+ + term + + – The term for which the synthesis solution is queried. +

+
+
+ Returns + + : + +
+
+

+ The synthesis solution of the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getSynthSolutions + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the synthesis solutions of the given terms. This method should be called immediately after the solver answers unsat for sygus input. +

+
+
+ Parameters + + : + +
+
+

+ + terms + + – The terms for which the synthesis solutions is queried. +

+
+
+ Returns + + : + +
+
+

+ The synthesis solutions of the given terms. +

+
+
+
+
+
+
+ + + + + + + + + + + + Statistics + + + + + + + + + getStatistics + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get a snapshot of the current state of the statistic values of this solver. The returned object is completely decoupled from the solver and will not change when the solver is used again. +

+
+
+ Returns + + : + +
+
+

+ A snapshot of the current state of the statistic values. +

+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + printStatisticsSafe + + + + + ( + + + + int + + + + + + + fd + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Print the statistics to the given file descriptor, suitable for usage in signal handlers. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isOutputOn + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + tag + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determione the output stream for the given tag is enabled. Tags can be enabled with the + + + output + + + option (and + + + -o + + + <tag> + + + on the command line). Raises an exception when an invalid tag is given. +

+
+
+ Returns + + : + +
+
+

+ True if the given tag is enabled. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + getOutput + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + tag + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get an output stream for the given tag. Tags can be enabled with the + + + output + + + option (and + + + -o + + + <tag> + + + on the command line). Raises an exception when an invalid tag is given. +

+
+
+ Returns + + : + +
+
+

+ The output stream. +

+
+
+
+
+
+
+

+ Friends +

+
+
+ + + friend + + + class + + + + cvc5::Command + +
+
+
+
+ + + friend + + + class + + + + main::CommandExecutor + +
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/sort.html b/cvc5-1.0.2/api/cpp/sort.html new file mode 100644 index 0000000..1b5181f --- /dev/null +++ b/cvc5-1.0.2/api/cpp/sort.html @@ -0,0 +1,5747 @@ + + + + + + + + Sort — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Sort + + ¶ + +

+

+ The + + + + Sort + + + + class represents the sort of a + + + + Term + + + + . +

+

+ A + + + + Sort + + + + can be hashed (using + + + + std::hash<cvc5::Sort> + + + + ) and serialized to an output stream +(using + + + + cvc5::operator<<() + + + + ). +

+

+ Class + + + + Sort + + + + offers the default constructor +only to create a null Sort. Instead, the + + + + Solver + + + + class provides factory functions for all other sorts, e.g., + + + + cvc5::Solver::getBooleanSort() + + + + for Sort Bool and + + + + cvc5::Solver::mkBitVectorSort() + + + + for bit-vector +sorts. +

+

+ Sorts are defined as standardized in the SMT-LIB standard for standardized +theories. Additionally, we introduce the following sorts for non-standardized +theories: +

+ +
+
+ + + + + + + + + + + class + + + + + + + + Sort + + + + + ¶ + +
+
+
+

+ The sort of a cvc5 term. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Sort + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + + ~Sort + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for structural equality. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if the sorts are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for structural disequality. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if the sorts are not equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + < + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on sorts. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is less than s. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + > + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on sorts. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is greater than s. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + <= + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on sorts. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is less than or equal to s. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + >= + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on sorts. +

+
+
+ Parameters + + : + +
+
+

+ + s + + – The sort to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is greater than or equal to s. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + hasSymbol + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Does this sort have a symbol, that is, a name? +

+

+ For example, uninterpreted sorts and uninterpreted sort constructors have symbols. +

+
+
+ Returns + + : + +
+
+

+ True if the sort has a symbol. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getSymbol + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the symbol of this + + + Sort + + + . +

+

+ The symbol of this sort is the string that was provided when constructing it via Solver::mkUninterpretedSort(const std::string&) const, Solver::mkUnresolvedSort(const std::string&, size_t) const, or Solver::mkUninterpretedSortConstructorSort(const std::string&, size_t). +

+
+

+ Note +

+

+ Asserts + + + hasSymbol() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The raw symbol of the sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the null sort ( + + + Sort::Sort() + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this + + + Sort + + + is the null sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isBoolean + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the Boolean sort (SMT-LIB: + + + Bool + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the Boolean sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInteger + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the integer sort (SMT-LIB: + + + Int + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the integer sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isReal + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the real sort (SMT-LIB: + + + Real + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the real sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the string sort (SMT-LIB: + + + String + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the string sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRegExp + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the regular expression sort (SMT-LIB: + + + RegLan + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the regular expression sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRoundingMode + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is the rounding mode sort (SMT-LIB: + + + RoundingMode + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is the rounding mode sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isBitVector + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a bit-vector sort (SMT-LIB: + + + (_ + + + BitVec + + + i) + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a bit-vector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPoint + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a floatingpoint sort (SMT-LIB: + + + (_ + + + FloatingPoint + + + eb + + + sb) + + + ). +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a floating-point sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDatatype + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a datatype sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a datatype sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDatatypeConstructor + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a datatype constructor sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a datatype constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDatatypeSelector + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a datatype selector sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a datatype selector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDatatypeTester + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a datatype tester sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a datatype tester sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDatatypeUpdater + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a datatype updater sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a datatype updater sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFunction + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a function sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a function sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isPredicate + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a predicate sort. +

+

+ A predicate sort is a function sort that maps to the Boolean sort. All predicate sorts are also function sorts. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a predicate sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isTuple + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this a tuple sort. +

+
+
+ Returns + + : + +
+
+

+ True if this sort is a tuple sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRecord + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a record sort. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Returns + + : + +
+
+

+ True if the sort is a record sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isArray + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is an array sort. +

+
+
+ Returns + + : + +
+
+

+ True if the sort is an array sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isSet + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a Set sort. +

+
+
+ Returns + + : + +
+
+

+ True if the sort is a Set sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isBag + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a Bag sort. +

+
+
+ Returns + + : + +
+
+

+ True if the sort is a Bag sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isSequence + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is a Sequence sort. +

+
+
+ Returns + + : + +
+
+

+ True if the sort is a Sequence sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUninterpretedSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is an uninterpreted sort. +

+
+
+ Returns + + : + +
+
+

+ True if this is an uninterpreted sort. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUninterpretedSortConstructor + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is an uninterpreted sort constructor. +

+

+ An uninterpreted sort constructor has arity > 0 and can be instantiated to construct uninterpreted sorts with given sort parameters. +

+
+
+ Returns + + : + +
+
+

+ True if this is a sort constructor kind. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInstantiated + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this is an instantiated (parametric datatype or uninterpreted sort constructor) sort. +

+

+ An instantiated sort is a sort that has been constructed from instantiating a sort with sort arguments (see + + + Sort::instantiate(const std::vector<Sort>&) const + + + )). +

+
+
+ Returns + + : + +
+
+

+ True if this is an instantiated sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getUninterpretedSortConstructor + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the associated uninterpreted sort constructor of an instantiated uninterpreted sort. +

+
+
+ Returns + + : + +
+
+

+ The uninterpreted sort constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Datatype + + + + + + + + + getDatatype + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The underlying datatype of a datatype sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + instantiate + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + params + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Instantiate a parameterized datatype sort or uninterpreted sort constructor sort. +

+

+ Create sort parameters with + + + Solver::mkParamSort() + + + . +

+
+
+ Parameters + + : + +
+
+

+ + params + + – The list of sort parameters to instantiate with. +

+
+
+ Returns + + : + +
+
+

+ The instantiated sort. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + getInstantiatedParameters + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the sorts used to instantiate the sort parameters of a parametric sort (parametric datatype or uninterpreted sort constructor sort, see Sort::instantiate(const std::vector<Sort>& const)). +

+
+
+ Returns + + : + +
+
+

+ The sorts used to instantiate the sort parameters of a parametric sort +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + substitute + + + + + ( + + + + const + + + + + + + + Sort + + + + + + + + & + + + + + sort + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + replacement + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Substitution of Sorts. +

+

+ Note that this replacement is applied during a pre-order traversal and only once to the sort. It is not run until fix point. +

+

+ For example, + + + (Array + + + A + + + B).substitute({A, + + + C}, + + + {(Array + + + C + + + D), + + + (Array + + + A + + + B)}) + + + will return + + + (Array + + + (Array + + + C + + + D) + + + B) + + + . +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sort + + – The subsort to be substituted within this sort. +

    +
  • +
  • +

    + + replacement + + – The sort replacing the substituted subsort. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + substitute + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + sorts + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + & + + + + + replacements + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Simultaneous substitution of Sorts. +

+

+ Note that this replacement is applied during a pre-order traversal and only once to the sort. It is not run until fix point. In the case that sorts contains duplicates, the replacement earliest in the vector takes priority. +

+
+

+ Warning +

+

+ This method is experimental and may change in future versions. +

+
+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + sorts + + – The subsorts to be substituted within this sort. +

    +
  • +
  • +

    + + replacements + + – The sort replacing the substituted subsorts. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + void + + + + + + + + toStream + + + + + ( + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + out + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Output a string representation of this sort to a given stream. +

+
+
+ Parameters + + : + +
+
+

+ + out + + – The output stream. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this sort. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getDatatypeConstructorArity + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The arity of a datatype constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + getDatatypeConstructorDomainSorts + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The domain sorts of a datatype constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getDatatypeConstructorCodomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The codomain sort of a constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getDatatypeSelectorDomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The domain sort of a datatype selector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getDatatypeSelectorCodomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The codomain sort of a datatype selector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getDatatypeTesterDomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The domain sort of a datatype tester sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getDatatypeTesterCodomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ We mainly need this for the symbol table, which doesn’t have access to the solver object. +

+
+
+
+ Returns + + : + +
+
+

+ The codomain sort of a datatype tester sort, which is the Boolean sort. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getFunctionArity + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The arity of a function sort. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + getFunctionDomainSorts + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The domain sorts of a function sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getFunctionCodomainSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The codomain sort of a function sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getArrayIndexSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The array index sort of an array sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getArrayElementSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The array element sort of an array sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getSetElementSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The element sort of a set sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getBagElementSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The element sort of a bag sort. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getSequenceElementSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The element sort of a sequence sort. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getUninterpretedSortConstructorArity + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The arity of an uninterpreted sort constructor sort. +

+
+
+
+
+
+
+ + + + + + + + + + + uint32_t + + + + + + + + getBitVectorSize + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The bit-width of the bit-vector sort. +

+
+
+
+
+
+
+ + + + + + + + + + + uint32_t + + + + + + + + getFloatingPointExponentSize + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The bit-width of the exponent of the floating-point sort. +

+
+
+
+
+
+
+ + + + + + + + + + + uint32_t + + + + + + + + getFloatingPointSignificandSize + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The width of the significand of the floating-point sort. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getDatatypeArity + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the arity of a datatype sort, which is the number of type parameters if the datatype is parametric, or 0 otherwise. +

+
+
+ Returns + + : + +
+
+

+ The arity of a datatype sort. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getTupleLength + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The length of a tuple sort. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Sort + + + + + + > + + + + + + + + getTupleSorts + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The element sorts of a tuple sort. +

+
+
+
+
+
+
+

+ Friends +

+
+
+ + + friend + + + class + + + + cvc5::Command + +
+
+
+
+ + + friend + + + struct + + + + std::hash< + + + Sort + + + > + +
+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + cvc5 + + + + + :: + + + + + + + operator + + + + + << + + + + + ( + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + out + + + , + + + const + + + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + ¶ + +
+
+
+

+ Serialize a sort to given stream. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + out + + – The output stream. +

    +
  • +
  • +

    + + s + + – The sort to be serialized to the given output stream. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The output stream. +

+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + > + + +
+ + + + + struct + + + + + + + + hash + + + + + + < + + + + + cvc5 + + + + + :: + + + + + + Sort + + + + + + > + + + + ¶ + +
+
+
+

+ Hash function for Sorts. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + size_t + + + + + + + + operator + + + + + () + + + + + ( + + + + const + + + + + + + cvc5 + + + + + :: + + + + + + Sort + + + + + + + + & + + + + + s + + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/statistics.html b/cvc5-1.0.2/api/cpp/statistics.html new file mode 100644 index 0000000..4082d71 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/statistics.html @@ -0,0 +1,2163 @@ + + + + + + + + Statistics — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Statistics + + ¶ + +

+

+ See + + + Statistics + + + for general information on statistics in cvc5.. +The + + + + Statistics + + + + object is essentially a +mapping from names (as + + + std::string + + + ) to statistic values, represented by the + + + + Stat + + + + class. A + + + + Stat + + + + can hold values of different types ( + + + int64_t + + + , + + + double + + + , + + + std::string + + + and +histograms) and can be inspected by identifying the type +( + + + + Stat::isInt() + + + + , + + + + Stat::isDouble() + + + + , etc) and obtaining +the actual value ( + + + + Stat::getInt() + + + + , + + + + Stat::getDouble() + + + + , etc). Histograms +are represented as + + + std::map<std::string, + + + uint64_t> + + + where the key is the string representation of one enumeration value +and the value is the frequency of this particular value. +

+

+ By default, iterating over a + + + + Statistics + + + + object only shows statistics +that are both public and changed. The + + + + Statistics::begin() + + + + method has Boolean flags + + + internal + + + and + + + def + + + to also show internal statistics and defaulted statistics, respectively. +

+
+
+ + + + + + + + + + + class + + + + + + + + Statistics + + + + + ¶ + +
+
+
+

+

+

+ Represents a snapshot of the solver statistics. See + + + Statistics + + + for +how statistics can be used. +Once obtained via + + + + Solver::getStatistics() + + + + , an instance of this class is independent of +the + + + + Solver + + + + object: it will not change when the +solvers internal statistics do, and it will not be invalidated if the solver +is destroyed. Iterating over this class (via + + + + begin() + + + + and + + + + end() + + + + ) +shows only public statistics that have been changed. By passing appropriate +flags to + + + + begin() + + + + , statistics that are +internal, defaulted, or both, can be included as well. A single statistic +value is represented as + + + + Stat + + + + . +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + const + + + + + + + + Stat + + + + + + + + & + + + + + + get + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + name + + + + ) + + + ¶ + +
+
+
+

+ Retrieve the statistic with the given name. +

+
+

+ Note +

+

+ Asserts that a statistic with the given name actually exists and throws a + + + CVC5ApiRecoverableException + + + if it does not. +

+
+
+
+ Parameters + + : + +
+
+

+ + name + + – The name of the statistic. +

+
+
+ Returns + + : + +
+
+

+ The statistic with the given name. +

+
+
+
+
+
+
+ + + + + + + + + + + iterator + + + + + + + + begin + + + + + ( + + + + bool + + + + + + + internal + + + + + + + = + + + + + + + false + + + , + + + bool + + + + + + + defaulted + + + + + + + = + + + + + + + false + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Begin iteration over the statistics values. By default, only entries that are public and have been set are visible while the others are skipped. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + internal + + – If set to true, internal statistics are shown as well. +

    +
  • +
  • +

    + + defaulted + + – If set to true, defaulted statistics are shown as well. +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + iterator + + + + + + + + end + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ End iteration +

+
+
+
+
+
+
+
+ + + + + + + + + + + class + + + + + + + + Stat + + + + + ¶ + +
+
+
+

+

+

+ Represents a snapshot of a single statistic value. See + + + Statistics + + + for +how statistics can be used. +A value can be of type + + + int64_t + + + , + + + double + + + , + + + std::string + + + or a +histogram +( + + + std::map<std::string, + + + uint64_t> + + + ). +The value type can be queried (using + + + isInt() + + + , + + + isDouble() + + + , etc.) and +the stored value can be accessed (using + + + getInt() + + + , + + + getDouble() + + + , etc.). +It is possible to query whether this statistic is an internal statistic by + + + + isInternal() + + + + and whether its value is +the default value by + + + + isDefault() + + + + . +

+
+

+ Public Types +

+
+
+ + + + + + + + + using + + + + + + + + HistogramData + + + + + + + + = + + + + + + + std + + + + + :: + + + + + map + + + + + < + + + + + std + + + + + :: + + + + + string + + + + + , + + + + + + + uint64_t + + + + + > + + + + ¶ + +
+
+
+

+ Representation of a histogram: maps names to frequencies. +

+
+
+
+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Stat + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Create an empty statistics object. On such an object all + + + isX() + + + return false and all + + + getX() + + + throw an API exception. It solely exists because it makes implementing bindings for other languages much easier. +

+
+
+
+
+ + + + + + + + + + + + Stat + + + + + ( + + + + const + + + + + + + + Stat + + + + + + + + & + + + + + s + + + + ) + + + ¶ + +
+
+
+

+ Copy constructor +

+
+
+
+
+ + + + + + + + + + + + ~Stat + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor +

+
+
+
+
+ + + + + + + + + + + + Stat + + + + + + + + & + + + + + + operator + + + + + = + + + + + ( + + + + const + + + + + + + + Stat + + + + + + + + & + + + + + s + + + + ) + + + ¶ + +
+
+
+

+ Copy assignment +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInternal + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value is intended for internal use only. +

+
+
+ Returns + + : + +
+
+

+ True if this is an internal statistic. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDefault + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value holds the default value. +

+
+
+ Returns + + : + +
+
+

+ True if this is a defaulted statistic. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInt + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value is an integer. +

+
+
+ Returns + + : + +
+
+

+ True if this value is an integer. +

+
+
+
+
+
+
+ + + + + + + + + + + int64_t + + + + + + + + getInt + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return the integer value. +

+
+
+ Returns + + : + +
+
+

+ The integer value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isDouble + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value is a double. +

+
+
+ Returns + + : + +
+
+

+ True if this value is a double. +

+
+
+
+
+
+
+ + + + + + + + + + + double + + + + + + + + getDouble + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return the double value. +

+
+
+ Returns + + : + +
+
+

+ The double value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value is a string. +

+
+
+ Returns + + : + +
+
+

+ True if this value is a string. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + std + + + + + :: + + + + + string + + + + + + + & + + + + + + getString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return the string value. +

+
+
+ Returns + + : + +
+
+

+ The string value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isHistogram + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this value is a histogram. +

+
+
+ Returns + + : + +
+
+

+ True if this value is a histogram. +

+
+
+
+
+
+
+ + + + + + + + + + + const + + + + + + + + HistogramData + + + + + + + + & + + + + + + getHistogram + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Return the histogram value. +

+
+
+ Returns + + : + +
+
+

+ The histogram value. +

+
+
+
+
+
+
+

+ Friends +

+
+
+ + + friend + + + class + + + + Statistics + +
+
+
+
+ + + + + + + + + + + friend + + + + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + + operator + + + + + << + + + + + ( + + + + std + + + + + :: + + + + + ostream + + + + + + + & + + + + + os + + + , + + + const + + + + + + + + Stat + + + + + + + + & + + + + + sv + + + + ) + + + ¶ + +
+
+
+

+ Print a + + + + + Stat + + + + + object to an + + + std::ostream + + + . +

+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/synthresult.html b/cvc5-1.0.2/api/cpp/synthresult.html new file mode 100644 index 0000000..82e4d45 --- /dev/null +++ b/cvc5-1.0.2/api/cpp/synthresult.html @@ -0,0 +1,781 @@ + + + + + + + + SynthResult — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ SynthResult + + ¶ + +

+
+
+ + + + + + + + + + + class + + + + + + + + SynthResult + + + + + ¶ + +
+
+
+

+ Encapsulation of a solver synth result. +

+

+ This is the return value of the API methods: +

+ +

+ which we call synthesis queries. This class indicates whether the synthesis query has a solution, has no solution, or is unknown. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + SynthResult + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if + + + SynthResult + + + is null, i.e., not a + + + SynthResult + + + returned from a synthesis query. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + hasSolution + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the synthesis query has a solution. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + hasNoSolution + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the synthesis query has no solution. In this case, it was determined that there was no solution. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUnknown + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the result of the synthesis query could not be determined. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this synthesis result. +

+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/term.html b/cvc5-1.0.2/api/cpp/term.html new file mode 100644 index 0000000..6202d8d --- /dev/null +++ b/cvc5-1.0.2/api/cpp/term.html @@ -0,0 +1,8067 @@ + + + + + + + + Term — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Term + + ¶ + +

+

+ The + + + + Term + + + + class represents arbitrary expressions that +are Boolean or from some of the supported theories. The list of all supported +types (or kinds) is given by the + + + + Kind + + + + enum. +The + + + + Term + + + + class provides methods for general +inspection (e.g., comparison, retrieve the kind and sort, access sub-terms), +but also methods to retrieving constant values for the supported theories +(i.e., + + + is<Type>Value() + + + and + + + get<Type>Value() + + + , which returns the +constant values in the best type standard C++ offers). +

+

+ Additionally, a + + + + Term + + + + can be hashed (using + + + + std::hash<cvc5::Term> + + + + ) and given to output streams, including +terms within standard containers like + + + std::map + + + , + + + std::set + + + , or + + + std::vector + + + . +

+

+ The + + + + Term + + + + only offers the default constructor to +create a null term. Instead, the + + + + Solver + + + + class +provides factory functions for all other terms, e.g., + + + + Solver::mkTerm() + + + + for generic terms and + + + Solver::mk<Type>() + + + for constant values of a given type. +

+
+
+ + + + + + + + + + + class + + + + + + + + Term + + + + + ¶ + +
+
+
+

+ A cvc5 + + + Term + + + . +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + Term + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Constructor for a null term. +

+
+
+
+
+ + + + + + + + + + + + ~Term + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Destructor. +

+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Syntactic equality operator. Return true if both terms are syntactically identical. +

+
+

+ Note +

+

+ Both terms must belong to the same node manager. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if the terms are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Syntactic disequality operator. Return true if both terms differ syntactically. +

+
+

+ Note +

+

+ Both terms must belong to the same node manager. +

+
+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if terms are disequal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + < + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on terms by their id. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this term is less than t. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + > + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on terms by their id. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this term is greater than t. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + <= + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on terms by their id. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this term is less than or equal to t. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + >= + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Comparison for ordering on terms by their id. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – The term to compare to. +

+
+
+ Returns + + : + +
+
+

+ True if this term is greater than or equal to t. +

+
+
+
+
+
+
+ + + + + + + + + + + size_t + + + + + + + + getNumChildren + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The number of children of this term +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + operator + + + + + [] + + + + + ( + + + + size_t + + + + + + + index + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the child term at a given index. +

+
+
+ Parameters + + : + +
+
+

+ + index + + – The index of the child term to return. +

+
+
+ Returns + + : + +
+
+

+ The child term with the given index. +

+
+
+
+
+
+
+ + + + + + + + + + + uint64_t + + + + + + + + getId + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The id of this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Kind + + + + + + + + + getKind + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The kind of this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Sort + + + + + + + + + getSort + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ The sort of this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + substitute + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + term + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + replacement + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Replace + + + term + + + with + + + replacement + + + in this term. +

+
+

+ Note +

+

+ This replacement is applied during a pre-order traversal and only once (it is not run until fixed point). +

+
+
+
+ Returns + + : + +
+
+

+ The result of replacing + + + term + + + with + + + replacement + + + in this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + substitute + + + + + ( + + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + terms + + + , + + + const + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + & + + + + + replacements + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Simultaneously replace + + + terms + + + with + + + replacements + + + in this term. +

+

+ In the case that terms contains duplicates, the replacement earliest in the vector takes priority. For example, calling substitute on + + + f(x,y) + + + with + + + terms + + + = + + + { + + + x, + + + z + + + } + + + , + + + replacements + + + = + + + { + + + g(z), + + + w + + + } + + + results in the term + + + f(g(z),y) + + + . +

+
+

+ Note +

+

+ This replacement is applied during a pre-order traversal and only once (it is not run until fixed point). +

+
+
+
+ Returns + + : + +
+
+

+ The result of simultaneously replacing + + + terms + + + with + + + replacements + + + in this term. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + hasOp + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True iff this term has an operator. +

+
+
+
+
+
+
+ + + + + + + + + + + + Op + + + + + + + + + getOp + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ This is safe to call when + + + hasOp() + + + returns true. +

+
+
+
+ Returns + + : + +
+
+

+ The + + + Op + + + used to create this term. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + hasSymbol + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Does the term have a symbol, i.e., a name? +

+

+ For example, free constants and variables have symbols. +

+
+
+ Returns + + : + +
+
+

+ True if the term has a symbol. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getSymbol + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the symbol of this + + + Term + + + . +

+

+ The symbol of the term is the string that was provided when constructing it via + + + Solver::mkConst() + + + or + + + Solver::mkVar() + + + . +

+
+

+ Note +

+

+ Asserts + + + hasSymbol() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The raw symbol of the term. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isNull + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if this + + + Term + + + is a null term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + notTerm + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Boolean negation. +

+
+
+ Returns + + : + +
+
+

+ The Boolean negation of this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + andTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Boolean and. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – A Boolean term. +

+
+
+ Returns + + : + +
+
+

+ The conjunction of this term and the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + orTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Boolean or. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – A Boolean term. +

+
+
+ Returns + + : + +
+
+

+ The disjunction of this term and the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + xorTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Boolean exclusive or. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – A Boolean term. +

+
+
+ Returns + + : + +
+
+

+ The exclusive disjunction of this term and the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + eqTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Equality. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – A Boolean term. +

+
+
+ Returns + + : + +
+
+

+ The Boolean equivalence of this term and the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + impTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Boolean implication. +

+
+
+ Parameters + + : + +
+
+

+ + t + + – A Boolean term. +

+
+
+ Returns + + : + +
+
+

+ The implication of this term and the given term. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + iteTerm + + + + + ( + + + + const + + + + + + + + Term + + + + + + + + & + + + + + then_t + + + , + + + const + + + + + + + + Term + + + + + + + + & + + + + + else_t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ If-then-else with this term as the Boolean condition. +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + then_t + + – The ‘then’ term. +

    +
  • +
  • +

    + + else_t + + – The ‘else’ term. +

    +
  • +
+
+
+ Returns + + : + +
+
+

+ The if-then-else term with this term as the Boolean condition. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + toString + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ A string representation of this term. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + begin + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to the first child of this + + + Term + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + end + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ An iterator to one-off-the-last child of this + + + Term + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + int32_t + + + + + + + + getRealOrIntegerValueSign + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get integer or real value sign. Must be called on integer or real values, or otherwise an exception is thrown. +

+
+
+ Returns + + : + +
+
+

+ 0 if this term is zero, -1 if this term is a negative real or integer value, 1 if this term is a positive real or integer value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInt32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an integer value that fits within int32_t. Note that this method will return true for integer constants and real constants that have integer value. +

+
+
+
+
+
+
+ + + + + + + + + + + int32_t + + + + + + + + getInt32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the + + + int32_t + + + representation of this integral value. +

+
+

+ Note +

+

+ Asserts + + + isInt32Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ This integer value as a + + + int32_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUInt32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an integer value that fits within uint32_t. Note that this method will return true for integer constants and real constants that have integral value. +

+
+
+
+
+
+
+ + + + + + + + + + + uint32_t + + + + + + + + getUInt32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the + + + uint32_t + + + representation of this integral value. +

+
+

+ Note +

+

+ Asserts + + + isUInt32Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ This integer value as a + + + uint32_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isInt64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an integer value that fits within int64_t. Note that this method will return true for integer constants and real constants that have integral value. +

+
+
+
+
+
+
+ + + + + + + + + + + int64_t + + + + + + + + getInt64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the + + + int64_t + + + representation of this integral value. +

+
+

+ Note +

+

+ Asserts + + + isInt64Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ This integer value as a + + + int64_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUInt64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an integer value that fits within uint64_t. Note that this method will return true for integer constants and real constants that have integral value. +

+
+
+
+
+
+
+ + + + + + + + + + + uint64_t + + + + + + + + getUInt64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the + + + uint64_t + + + representation of this integral value. +

+
+

+ Note +

+

+ Asserts + + + isUInt64Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ This integer value as a + + + uint64_t + + + . +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isIntegerValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an integer constant or a real constant that has an integral value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getIntegerValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isIntegerValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The integral term in (decimal) string representation. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isStringValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a string value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + wstring + + + + + + + + getStringValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isStringValue() + + + . +

+
+
+

+ Note +

+

+ This method is not to be confused with + + + toString() + + + , which returns some string representation of the term, whatever data it may hold. +

+
+
+
+ Returns + + : + +
+
+

+ The string term as a native string value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isReal32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a rational value whose numerator and denominator fit within int32_t and uint32_t, respectively. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + pair + + + + + < + + + + + int32_t + + + + + , + + + + + + + uint32_t + + + + + > + + + + + + + + getReal32Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isReal32Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a rational value as a pair of its numerator and denominator. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isReal64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a rational value whose numerator and denominator fit within int64_t and uint64_t, respectively. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + pair + + + + + < + + + + + int64_t + + + + + , + + + + + + + uint64_t + + + + + > + + + + + + + + getReal64Value + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isReal64Value() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a rational value as a pair of its numerator and denominator. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRealValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ A term of kind PI is not considered to be a real value. +

+
+
+
+ Returns + + : + +
+
+

+ True if the term is a rational value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getRealValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isRealValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a rational value as a (rational) string. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isConstArray + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a constant array. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + getConstArrayBase + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isConstArray() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The base (element stored at all indices) of a constant array. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isBooleanValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a Boolean value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + getBooleanValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isBooleanValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a Boolean value as a native Boolean value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isBitVectorValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a bit-vector value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getBitVectorValue + + + + + ( + + + + uint32_t + + + + + + + base + + + + + + + = + + + + + + + 2 + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Get the string representation of a bit-vector value. +

+

+ Supported values for + + + base + + + are + + + 2 + + + (bit string), + + + 10 + + + (decimal string) or + + + 16 + + + (hexadecimal string). +

+
+

+ Note +

+

+ Asserts + + + isBitVectorValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The string representation of a bit-vector value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isUninterpretedSortValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is an abstract value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + string + + + + + + + + getUninterpretedSortValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isUninterpretedSortValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of an uninterpreted sort value as a string. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isTupleValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a tuple value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getTupleValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isTupleValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a tuple value as a vector of terms. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isRoundingModeValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a floating-point rounding mode value. +

+
+
+
+
+
+
+ + + + + + + + + + + + RoundingMode + + + + + + + + + getRoundingModeValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isRoundingModeValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The floating-point rounding mode value held by the term. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointPosZero + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is the floating-point value for positive zero. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointNegZero + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is the floating-point value for negative zero. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointPosInf + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is the floating-point value for positive. infinity. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointNegInf + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is the floating-point value for negative. infinity. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointNaN + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is the floating-point value for not a number. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isFloatingPointValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a floating-point value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + tuple + + + + + < + + + + + uint32_t + + + + + , + + + + + + + uint32_t + + + + + , + + + + + + + + Term + + + + + + > + + + + + + + + getFloatingPointValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isFloatingPointValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a floating-point value as a tuple of the exponent width, the significand width and a bit-vector value. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isSetValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ A term is a set value if it is considered to be a (canonical) constant set value. A canonical set value is one whose AST is: +

+

+

+
+
+
(union (singleton c1) ... (union (singleton c_{n-1}) (singleton c_n))))
+
+
+
+

+ where + + \(c_1 ... c_n\) + + are values ordered by id such that + + \(c_1 > ... > c_n\) + + (see + + + Term::operator>(const Term&) const + + + ). +

+
+

+ Note +

+

+ A universe set term (kind + + + SET_UNIVERSE + + + ) is not considered to be a set value. +

+
+
+
+ Returns + + : + +
+
+

+ True if the term is a set value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + set + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getSetValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isSetValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a set value as a set of terms. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isSequenceValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Determine if this term is a sequence value. +

+

+ A term is a sequence value if it has kind + + + CONST_SEQUENCE + + + . In contrast to values for the set sort (as described in + + + isSetValue() + + + ), a sequence value is represented as a + + + Term + + + with no children. +

+

+ Semantically, a sequence value is a concatenation of unit sequences whose elements are themselves values. For example: +

+

+

+
+
+
(seq.++ (seq.unit 0) (seq.unit 1))
+
+
+
+

+ The above term has two representations in + + + Term + + + . One is as the sequence concatenation term: +

+

+

+
+
+
(SEQ_CONCAT (SEQ_UNIT 0) (SEQ_UNIT 1))
+
+
+
+

+ where 0 and 1 are the terms corresponding to the integer constants 0 and 1. +

+

+ Alternatively, the above term is represented as the constant sequence value: +

+

+

+
+
+
CONST_SEQUENCE_{0,1}
+
+
+
+

+ where calling + + + getSequenceValue() + + + on the latter returns the vector + + + {0, + + + 1} + + + . +

+

+ The former term is not a sequence value, but the latter term is. +

+

+ Constant sequences cannot be constructed directly via the API. They are returned in response to API calls such + + + Solver::getValue() + + + and + + + Solver::simplify() + + + . +

+
+
+ Returns + + : + +
+
+

+ True if the term is a sequence value. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + vector + + + + + < + + + + + + Term + + + + + + > + + + + + + + + getSequenceValue + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isSequenceValue() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The representation of a sequence value as a vector of terms. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + isCardinalityConstraint + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+ Returns + + : + +
+
+

+ True if the term is a cardinality constraint. +

+
+
+
+
+
+
+ + + + + + + + + + + std + + + + + :: + + + + + pair + + + + + < + + + + + + Sort + + + + + + , + + + + + + + uint32_t + + + + + > + + + + + + + + getCardinalityConstraint + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+

+ Note +

+

+ Asserts + + + isCardinalityConstraint() + + + . +

+
+
+
+ Returns + + : + +
+
+

+ The sort the cardinality constraint is for and its upper bound. +

+
+
+
+
+
+
+

+ Friends +

+
+
+ + + friend + + + class + + + + cvc5::Command + +
+
+
+
+ + + friend + + + struct + + + + std::hash< + + + Term + + + > + +
+
+
+
+
+ + + + + + + + + + + class + + + + + + + + const_iterator + + + + + ¶ + +
+
+
+

+ Iterator for the children of a + + + Term + + + . +

+
+

+ Note +

+

+ This treats uninterpreted functions as + + + Term + + + just like any other term for example, the term + + + f(x, + + + y) + + + will have Kind + + + APPLY_UF + + + and three children: + + + f + + + , + + + x + + + , and + + + y + + +

+
+
+

+ Public Types +

+
+
+ + + + + + + + + using + + + + + + + + iterator_category + + + + + + + + = + + + + + + + std + + + + + :: + + + + + forward_iterator_tag + + + + ¶ + +
+
+
+

+ Iterator tag +

+
+
+
+
+ + + + + + + + + using + + + + + + + + value_type + + + + + + + + = + + + + + + + + Term + + + + + ¶ + +
+
+
+

+ The type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + pointer + + + + + + + + = + + + + + + + const + + + + + + + + Term + + + + + + * + + + + ¶ + +
+
+
+

+ The pointer type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + reference + + + + + + + + = + + + + + + + const + + + + + + + + Term + + + + + + & + + + + ¶ + +
+
+
+

+ The reference type of the item +

+
+
+
+
+ + + + + + + + + using + + + + + + + + difference_type + + + + + + + + = + + + + + + + std + + + + + :: + + + + + ptrdiff_t + + + + ¶ + +
+
+
+

+ The type returned when two iterators are subtracted +

+
+
+
+
+

+ Public Functions +

+
+
+ + + + + + + + + + + + const_iterator + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Null Constructor. +

+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + ( + + + + internal + + + + + :: + + + + + NodeManager + + + + + + + * + + + + + nm + + + , + + + const + + + + + + + std + + + + + :: + + + + + shared_ptr + + + + + < + + + + + internal + + + + + :: + + + + + Node + + + + + > + + + + + + + & + + + + + e + + + , + + + uint32_t + + + + + + + p + + + + ) + + + ¶ + +
+
+
+

+ Constructor +

+
+
+ Parameters + + : + +
+
+
    +
  • +

    + + nm + + – The associated node manager. +

    +
  • +
  • +

    + + e + + – A + + + std::shared + + + pointer + + + to the node that we’re iterating over. +

    +
  • +
  • +

    + + p + + – The position of the iterator (e.g. which child it’s on). +

    +
  • +
+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + ¶ + +
+
+
+

+ Copy constructor. +

+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + = + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + ¶ + +
+
+
+

+ Assignment operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to assign to. +

+
+
+ Returns + + : + +
+
+

+ The reference to the iterator after assignment. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + == + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Equality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for equality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are equal. +

+
+
+
+
+
+
+ + + + + + + + + + + bool + + + + + + + + operator + + + + + != + + + + + ( + + + + const + + + + + + + + const_iterator + + + + + + + + & + + + + + it + + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Disequality operator. +

+
+
+ Parameters + + : + +
+
+

+ + it + + – The iterator to compare to for disequality. +

+
+
+ Returns + + : + +
+
+

+ True if the iterators are disequal. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + & + + + + + + operator + + + + + ++ + + + + + ( + + + ) + + + ¶ + +
+
+
+

+ Increment operator (prefix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + + const_iterator + + + + + + + + + operator + + + + + ++ + + + + + ( + + + + int + + + + ) + + + ¶ + +
+
+
+

+ Increment operator (postfix). +

+
+
+ Returns + + : + +
+
+

+ A reference to the iterator after incrementing by one. +

+
+
+
+
+
+
+ + + + + + + + + + + + Term + + + + + + + + + operator + + + + + * + + + + + ( + + + ) + + + + + + const + + + + ¶ + +
+
+
+

+ Dereference operator. +

+
+
+ Returns + + : + +
+
+

+ The term this iterator points to. +

+
+
+
+
+
+
+
+
+
+
+
+ + + + + + + template + + + + + < + + + + + > + + +
+ + + + + struct + + + + + + + + hash + + + + + + < + + + + + cvc5 + + + + + :: + + + + + + Term + + + + + + > + + + + ¶ + +
+
+
+

+ Hash function for Terms. +

+
+

+ Public Functions +

+
+
+ + + + + + + + + + + size_t + + + + + + + + operator + + + + + () + + + + + ( + + + + const + + + + + + + cvc5 + + + + + :: + + + + + + Term + + + + + + + + & + + + + + t + + + + ) + + + + + + const + + + + ¶ + +
+
+
+
+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/cpp/unknownexplanation.html b/cvc5-1.0.2/api/cpp/unknownexplanation.html new file mode 100644 index 0000000..639392f --- /dev/null +++ b/cvc5-1.0.2/api/cpp/unknownexplanation.html @@ -0,0 +1,721 @@ + + + + + + + + UnknownExplanation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ UnknownExplanation + + ¶ + +

+
+
+ + + + + + + + + enum + + + + + + + + cvc5 + + + + + :: + + + + + + + UnknownExplanation + + + + + ¶ + +
+
+
+

+ The different reasons for returning an “unknown” result. +

+

+ + Values: + +

+
+
+ + + + + + + + + enumerator + + + + + + + + REQUIRES_FULL_CHECK + + + + + ¶ + +
+
+
+

+ Full satisfiability check required (e.g., if only preprocessing was performed). +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INCOMPLETE + + + + + ¶ + +
+
+
+

+ Incomplete theory solver. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + TIMEOUT + + + + + ¶ + +
+
+
+

+ Time limit reached. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + RESOURCEOUT + + + + + ¶ + +
+
+
+

+ Resource limit reached. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + MEMOUT + + + + + ¶ + +
+
+
+

+ Memory limit reached. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + INTERRUPTED + + + + + ¶ + +
+
+
+

+ + + Solver + + + was interrupted. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + UNSUPPORTED + + + + + ¶ + +
+
+
+

+ Unsupported feature encountered. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + OTHER + + + + + ¶ + +
+
+
+

+ Other reason. +

+
+
+
+
+ + + + + + + + + enumerator + + + + + + + + UNKNOWN_REASON + + + + + ¶ + +
+
+
+

+ No specific reason given. +

+
+
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/java/allclasses-index.html b/cvc5-1.0.2/api/java/allclasses-index.html new file mode 100644 index 0000000..e08bf2f --- /dev/null +++ b/cvc5-1.0.2/api/java/allclasses-index.html @@ -0,0 +1,291 @@ + + + + + +All Classes + + + + + + + + + + + + + +
+ +
+
+
+

All Classes

+
+
+ +
+
+ + + diff --git a/cvc5-1.0.2/api/java/allclasses.html b/cvc5-1.0.2/api/java/allclasses.html new file mode 100644 index 0000000..b9a45c4 --- /dev/null +++ b/cvc5-1.0.2/api/java/allclasses.html @@ -0,0 +1,51 @@ + + + + + +All Classes + + + + + + + + + + + +

All Classes

+
+ +
+ + diff --git a/cvc5-1.0.2/api/java/allpackages-index.html b/cvc5-1.0.2/api/java/allpackages-index.html new file mode 100644 index 0000000..68a3dd3 --- /dev/null +++ b/cvc5-1.0.2/api/java/allpackages-index.html @@ -0,0 +1,161 @@ + + + + + +All Packages + + + + + + + + + + + + + +
+ +
+
+
+

All Packages

+
+
+ +
+
+ + + diff --git a/cvc5-1.0.2/api/java/constant-values.html b/cvc5-1.0.2/api/java/constant-values.html new file mode 100644 index 0000000..2f31d57 --- /dev/null +++ b/cvc5-1.0.2/api/java/constant-values.html @@ -0,0 +1,145 @@ + + + + + +Constant Field Values + + + + + + + + + + + + + +
+ +
+
+
+

Constant Field Values

+
+

Contents

+
+
+
+ + + diff --git a/cvc5-1.0.2/api/java/deprecated-list.html b/cvc5-1.0.2/api/java/deprecated-list.html new file mode 100644 index 0000000..95ee177 --- /dev/null +++ b/cvc5-1.0.2/api/java/deprecated-list.html @@ -0,0 +1,143 @@ + + + + + +Deprecated List + + + + + + + + + + + + + +
+ +
+
+
+

Deprecated API

+

Contents

+
+
+ + + diff --git a/cvc5-1.0.2/api/java/element-list b/cvc5-1.0.2/api/java/element-list new file mode 100644 index 0000000..44e680f --- /dev/null +++ b/cvc5-1.0.2/api/java/element-list @@ -0,0 +1 @@ +io.github.cvc5 diff --git a/cvc5-1.0.2/api/java/help-doc.html b/cvc5-1.0.2/api/java/help-doc.html new file mode 100644 index 0000000..3a7415e --- /dev/null +++ b/cvc5-1.0.2/api/java/help-doc.html @@ -0,0 +1,263 @@ + + + + + +API Help + + + + + + + + + + + + + +
+ +
+
+
+

How This API Document Is Organized

+
This API (Application Programming Interface) document has pages corresponding to the items in the navigation bar, described as follows.
+
+
+ +
+This help file applies to API documentation generated by the standard doclet.
+
+ + + diff --git a/cvc5-1.0.2/api/java/index-all.html b/cvc5-1.0.2/api/java/index-all.html new file mode 100644 index 0000000..a16d88f --- /dev/null +++ b/cvc5-1.0.2/api/java/index-all.html @@ -0,0 +1,3119 @@ + + + + + +Index + + + + + + + + + + + + + +
+ +
+
+
A B C D E F G H I K L M N O P R S T U V W X 
All Classes All Packages + + +

A

+
+
ABS - io.github.cvc5.Kind
+
+
Absolute value.
+
+
ADD - io.github.cvc5.Kind
+
+
Arithmetic addition.
+
+
addAnyConstant(Term) - Method in class io.github.cvc5.Grammar
+
+
Allow ntSymbol to be an arbitrary constant.
+
+
addAnyVariable(Term) - Method in class io.github.cvc5.Grammar
+
+
Allow ntSymbol to be any input variable to corresponding + synth-fun or synth-inv with the same sort as + ntSymbol.
+
+
addConstructor(DatatypeConstructorDecl) - Method in class io.github.cvc5.DatatypeDecl
+
+
Add datatype constructor declaration.
+
+
addRule(Term, Term) - Method in class io.github.cvc5.Grammar
+
+
Add rule to the set of rules corresponding to ntSymbol.
+
+
addRules(long, long, long[]) - Method in class io.github.cvc5.Grammar
+
 
+
addRules(Term, Term[]) - Method in class io.github.cvc5.Grammar
+
+
Add rules to the set of rules corresponding to ntSymbol.
+
+
addSelector(String, Sort) - Method in class io.github.cvc5.DatatypeConstructorDecl
+
+
Add datatype selector declaration.
+
+
addSelectorSelf(String) - Method in class io.github.cvc5.DatatypeConstructorDecl
+
+
Add datatype selector declaration whose codomain type is the datatype + itself.
+
+
addSelectorUnresolved(String, String) - Method in class io.github.cvc5.DatatypeConstructorDecl
+
+
Add datatype selector declaration whose codomain sort is an unresolved + datatype with the given name.
+
+
addSygusAssume(Term) - Method in class io.github.cvc5.Solver
+
+
Add a forumla to the set of Sygus assumptions.
+
+
addSygusConstraint(Term) - Method in class io.github.cvc5.Solver
+
+
Add a forumla to the set of Sygus constraints.
+
+
addSygusInvConstraint(Term, Term, Term, Term) - Method in class io.github.cvc5.Solver
+
+
Add a set of Sygus constraints to the current state that correspond to an + invariant synthesis problem.
+
+
AND - io.github.cvc5.Kind
+
+
Logical conjunction.
+
+
andTerm(Term) - Method in class io.github.cvc5.Term
+
+
Boolean and.
+
+
apply(Term[]) - Method in interface io.github.cvc5.IOracle
+
 
+
APPLY_CONSTRUCTOR - io.github.cvc5.Kind
+
+
Datatype constructor application.
+
+
APPLY_SELECTOR - io.github.cvc5.Kind
+
+
Datatype selector application.
+
+
APPLY_TESTER - io.github.cvc5.Kind
+
+
Datatype tester application.
+
+
APPLY_UF - io.github.cvc5.Kind
+
+
Application of an uninterpreted function.
+
+
APPLY_UPDATER - io.github.cvc5.Kind
+
+
Datatype update application.
+
+
ARCCOSECANT - io.github.cvc5.Kind
+
+
Arc cosecant function.
+
+
ARCCOSINE - io.github.cvc5.Kind
+
+
Arc cosine function.
+
+
ARCCOTANGENT - io.github.cvc5.Kind
+
+
Arc cotangent function.
+
+
ARCSECANT - io.github.cvc5.Kind
+
+
Arc secant function.
+
+
ARCSINE - io.github.cvc5.Kind
+
+
Arc sine function.
+
+
ARCTANGENT - io.github.cvc5.Kind
+
+
Arc tangent function.
+
+
assertFormula(Term) - Method in class io.github.cvc5.Solver
+
+
Assert a formula.
+
+
+ + + +

B

+
+
BAG_CARD - io.github.cvc5.Kind
+
+
Bag cardinality.
+
+
BAG_CHOOSE - io.github.cvc5.Kind
+
+
Bag choose.
+
+
BAG_COUNT - io.github.cvc5.Kind
+
+
Bag element multiplicity.
+
+
BAG_DIFFERENCE_REMOVE - io.github.cvc5.Kind
+
+
Bag difference remove.
+
+
BAG_DIFFERENCE_SUBTRACT - io.github.cvc5.Kind
+
+
Bag difference subtract.
+
+
BAG_DUPLICATE_REMOVAL - io.github.cvc5.Kind
+
+
Bag duplicate removal.
+
+
BAG_EMPTY - io.github.cvc5.Kind
+
+
Empty bag.
+
+
BAG_FILTER - io.github.cvc5.Kind
+
+
Bag filter.
+
+
BAG_FOLD - io.github.cvc5.Kind
+
+
Bag fold.
+
+
BAG_FROM_SET - io.github.cvc5.Kind
+
+
Conversion from set to bag.
+
+
BAG_INTER_MIN - io.github.cvc5.Kind
+
+
Bag intersection (min).
+
+
BAG_IS_SINGLETON - io.github.cvc5.Kind
+
+
Bag is singleton tester.
+
+
BAG_MAKE - io.github.cvc5.Kind
+
+
Bag make.
+
+
BAG_MAP - io.github.cvc5.Kind
+
+
Bag map.
+
+
BAG_MEMBER - io.github.cvc5.Kind
+
+
Bag membership predicate.
+
+
BAG_PARTITION - io.github.cvc5.Kind
+
+
Bag partition.
+
+
BAG_SUBBAG - io.github.cvc5.Kind
+
+
Bag inclusion predicate.
+
+
BAG_TO_SET - io.github.cvc5.Kind
+
+
Conversion from bag to set.
+
+
BAG_UNION_DISJOINT - io.github.cvc5.Kind
+
+
Bag disjoint union (sum).
+
+
BAG_UNION_MAX - io.github.cvc5.Kind
+
+
Bag max union.
+
+
BaseInfo() - Constructor for class io.github.cvc5.OptionInfo.BaseInfo
+
 
+
BITVECTOR_ADD - io.github.cvc5.Kind
+
+
Addition of two or more bit-vectors.
+
+
BITVECTOR_AND - io.github.cvc5.Kind
+
+
Bit-wise and.
+
+
BITVECTOR_ASHR - io.github.cvc5.Kind
+
+
Bit-vector arithmetic shift right.
+
+
BITVECTOR_COMP - io.github.cvc5.Kind
+
+
Equality comparison (returns bit-vector of size 1).
+
+
BITVECTOR_CONCAT - io.github.cvc5.Kind
+
+
Concatenation of two or more bit-vectors.
+
+
BITVECTOR_EXTRACT - io.github.cvc5.Kind
+
+
Bit-vector extract.
+
+
BITVECTOR_ITE - io.github.cvc5.Kind
+
+
Bit-vector if-then-else.
+
+
BITVECTOR_LSHR - io.github.cvc5.Kind
+
+
Bit-vector logical shift right.
+
+
BITVECTOR_MULT - io.github.cvc5.Kind
+
+
Multiplication of two or more bit-vectors.
+
+
BITVECTOR_NAND - io.github.cvc5.Kind
+
+
Bit-wise nand.
+
+
BITVECTOR_NEG - io.github.cvc5.Kind
+
+
Negation of a bit-vector (two's complement).
+
+
BITVECTOR_NOR - io.github.cvc5.Kind
+
+
Bit-wise nor.
+
+
BITVECTOR_NOT - io.github.cvc5.Kind
+
+
Bit-wise negation.
+
+
BITVECTOR_OR - io.github.cvc5.Kind
+
+
Bit-wise or.
+
+
BITVECTOR_REDAND - io.github.cvc5.Kind
+
+
Bit-vector redand.
+
+
BITVECTOR_REDOR - io.github.cvc5.Kind
+
+
Bit-vector redor.
+
+
BITVECTOR_REPEAT - io.github.cvc5.Kind
+
+
Bit-vector repeat.
+
+
BITVECTOR_ROTATE_LEFT - io.github.cvc5.Kind
+
+
Bit-vector rotate left.
+
+
BITVECTOR_ROTATE_RIGHT - io.github.cvc5.Kind
+
+
Bit-vector rotate right.
+
+
BITVECTOR_SDIV - io.github.cvc5.Kind
+
+
Signed bit-vector division.
+
+
BITVECTOR_SGE - io.github.cvc5.Kind
+
+
Bit-vector signed greater than or equal.
+
+
BITVECTOR_SGT - io.github.cvc5.Kind
+
+
Bit-vector signed greater than.
+
+
BITVECTOR_SHL - io.github.cvc5.Kind
+
+
Bit-vector shift left.
+
+
BITVECTOR_SIGN_EXTEND - io.github.cvc5.Kind
+
+
Bit-vector sign extension.
+
+
BITVECTOR_SLE - io.github.cvc5.Kind
+
+
Bit-vector signed less than or equal.
+
+
BITVECTOR_SLT - io.github.cvc5.Kind
+
+
Bit-vector signed less than.
+
+
BITVECTOR_SLTBV - io.github.cvc5.Kind
+
+
Bit-vector signed less than returning a bit-vector of size 1.
+
+
BITVECTOR_SMOD - io.github.cvc5.Kind
+
+
Signed bit-vector remainder (sign follows divisor).
+
+
BITVECTOR_SREM - io.github.cvc5.Kind
+
+
Signed bit-vector remainder (sign follows dividend).
+
+
BITVECTOR_SUB - io.github.cvc5.Kind
+
+
Subtraction of two bit-vectors.
+
+
BITVECTOR_TO_NAT - io.github.cvc5.Kind
+
+
Bit-vector conversion to (non-negative) integer.
+
+
BITVECTOR_UDIV - io.github.cvc5.Kind
+
+
Unsigned bit-vector division.
+
+
BITVECTOR_UGE - io.github.cvc5.Kind
+
+
Bit-vector unsigned greater than or equal.
+
+
BITVECTOR_UGT - io.github.cvc5.Kind
+
+
Bit-vector unsigned greater than.
+
+
BITVECTOR_ULE - io.github.cvc5.Kind
+
+
Bit-vector unsigned less than or equal.
+
+
BITVECTOR_ULT - io.github.cvc5.Kind
+
+
Bit-vector unsigned less than.
+
+
BITVECTOR_ULTBV - io.github.cvc5.Kind
+
+
Bit-vector unsigned less than returning a bit-vector of size 1.
+
+
BITVECTOR_UREM - io.github.cvc5.Kind
+
+
Unsigned bit-vector remainder.
+
+
BITVECTOR_XNOR - io.github.cvc5.Kind
+
+
Bit-wise xnor, left associative.
+
+
BITVECTOR_XOR - io.github.cvc5.Kind
+
+
Bit-wise xor.
+
+
BITVECTOR_ZERO_EXTEND - io.github.cvc5.Kind
+
+
Bit-vector zero extension.
+
+
blockModel(BlockModelsMode) - Method in class io.github.cvc5.Solver
+
+
Block the current model.
+
+
blockModelValues(Term[]) - Method in class io.github.cvc5.Solver
+
+
Block the current model values of (at least) the values in terms.
+
+
booleanValue() - Method in class io.github.cvc5.OptionInfo
+
+
Obtain the current value as a boolean.
+
+
+ + + +

C

+
+
CARDINALITY_CONSTRAINT - io.github.cvc5.Kind
+
+
Cardinality constraint on uninterpreted sort.
+
+
checkSat() - Method in class io.github.cvc5.Solver
+
+
Check satisfiability.
+
+
checkSatAssuming(Term) - Method in class io.github.cvc5.Solver
+
+
Check satisfiability assuming the given formula.
+
+
checkSatAssuming(Term[]) - Method in class io.github.cvc5.Solver
+
+
Check satisfiability assuming the given formulas.
+
+
checkSynth() - Method in class io.github.cvc5.Solver
+
+
Try to find a solution for the synthesis conjecture corresponding to the + current list of functions-to-synthesize, universal variables and + constraints.
+
+
checkSynthNext() - Method in class io.github.cvc5.Solver
+
+
Try to find a next solution for the synthesis conjecture corresponding to + the current list of functions-to-synthesize, universal variables and + constraints.
+
+
close() - Method in class io.github.cvc5.Solver
+
 
+
compareTo(Sort) - Method in class io.github.cvc5.Sort
+
+
Comparison for ordering on sorts.
+
+
compareTo(Term) - Method in class io.github.cvc5.Term
+
+
Comparison for ordering on terms.
+
+
CONST_ARRAY - io.github.cvc5.Kind
+
+
Constant array.
+
+
CONST_BITVECTOR - io.github.cvc5.Kind
+
+
Fixed-size bit-vector constant.
+
+
CONST_BOOLEAN - io.github.cvc5.Kind
+
+
Boolean constant.
+
+
CONST_FLOATINGPOINT - io.github.cvc5.Kind
+
+
Floating-point constant, created from IEEE-754 bit-vector representation + of the floating-point value.
+
+
CONST_INTEGER - io.github.cvc5.Kind
+
+
Arbitrary-precision integer constant.
+
+
CONST_RATIONAL - io.github.cvc5.Kind
+
+
Arbitrary-precision rational constant.
+
+
CONST_ROUNDINGMODE - io.github.cvc5.Kind
+
+
RoundingMode constant.
+
+
CONST_SEQUENCE - io.github.cvc5.Kind
+
+
Constant sequence.
+
+
CONST_STRING - io.github.cvc5.Kind
+
+
Constant string.
+
+
CONSTANT - io.github.cvc5.Kind
+
+
Free constant symbol.
+
+
ConstIterator() - Constructor for class io.github.cvc5.Datatype.ConstIterator
+
 
+
ConstIterator() - Constructor for class io.github.cvc5.DatatypeConstructor.ConstIterator
+
 
+
ConstIterator() - Constructor for class io.github.cvc5.Statistics.ConstIterator
+
 
+
ConstIterator() - Constructor for class io.github.cvc5.Term.ConstIterator
+
 
+
ConstIterator(boolean, boolean) - Constructor for class io.github.cvc5.Statistics.ConstIterator
+
 
+
COSECANT - io.github.cvc5.Kind
+
+
Cosecant function.
+
+
COSINE - io.github.cvc5.Kind
+
+
Cosine function.
+
+
COTANGENT - io.github.cvc5.Kind
+
+
Cotangent function.
+
+
CVC5ApiException - Exception in io.github.cvc5
+
 
+
CVC5ApiException(String) - Constructor for exception io.github.cvc5.CVC5ApiException
+
 
+
CVC5ApiOptionException - Exception in io.github.cvc5
+
 
+
CVC5ApiOptionException(String) - Constructor for exception io.github.cvc5.CVC5ApiOptionException
+
 
+
CVC5ApiRecoverableException - Exception in io.github.cvc5
+
 
+
CVC5ApiRecoverableException(String) - Constructor for exception io.github.cvc5.CVC5ApiRecoverableException
+
 
+
+ + + +

D

+
+
Datatype - Class in io.github.cvc5
+
+
A cvc5 datatype.
+
+
Datatype.ConstIterator - Class in io.github.cvc5
+
 
+
DatatypeConstructor - Class in io.github.cvc5
+
+
A cvc5 datatype constructor.
+
+
DatatypeConstructor.ConstIterator - Class in io.github.cvc5
+
 
+
DatatypeConstructorDecl - Class in io.github.cvc5
+
+
A cvc5 datatype constructor declaration.
+
+
DatatypeDecl - Class in io.github.cvc5
+
+
A cvc5 datatype declaration.
+
+
DatatypeSelector - Class in io.github.cvc5
+
+
A cvc5 datatype selector.
+
+
declareDatatype(String, DatatypeConstructorDecl[]) - Method in class io.github.cvc5.Solver
+
+
Create datatype sort.
+
+
declareFun(String, Sort[], Sort) - Method in class io.github.cvc5.Solver
+
+
Declare n-ary function symbol.
+
+
declareOracleFun(String, Sort[], Sort, IOracle) - Method in class io.github.cvc5.Solver
+
+
Declare an oracle function with reference to an implementation.
+
+
declarePool(String, Sort, Term[]) - Method in class io.github.cvc5.Solver
+
+
Declare a symbolic pool of terms with the given initial value.
+
+
declareSepHeap(Sort, Sort) - Method in class io.github.cvc5.Solver
+
+
When using separation logic, this sets the location sort and the + datatype sort to the given ones.
+
+
declareSort(String, int) - Method in class io.github.cvc5.Solver
+
+
Declare uninterpreted sort.
+
+
declareSygusVar(String, Sort) - Method in class io.github.cvc5.Solver
+
+
Append symbol to the current list of universal variables.
+
+
defineFun(String, Term[], Sort, Term) - Method in class io.github.cvc5.Solver
+
+
Define n-ary function in the current context.
+
+
defineFun(String, Term[], Sort, Term, boolean) - Method in class io.github.cvc5.Solver
+
+
Define n-ary function.
+
+
defineFunRec(Term, Term[], Term) - Method in class io.github.cvc5.Solver
+
+
Define recursive function in the current context.
+
+
defineFunRec(Term, Term[], Term, boolean) - Method in class io.github.cvc5.Solver
+
+
Define recursive function.
+
+
defineFunRec(String, Term[], Sort, Term) - Method in class io.github.cvc5.Solver
+
+
Define recursive function in the current context.
+
+
defineFunRec(String, Term[], Sort, Term, boolean) - Method in class io.github.cvc5.Solver
+
+
Define recursive function.
+
+
defineFunsRec(Term[], Term[][], Term[]) - Method in class io.github.cvc5.Solver
+
+
Define recursive functions in the current context.
+
+
defineFunsRec(Term[], Term[][], Term[], boolean) - Method in class io.github.cvc5.Solver
+
+
Define recursive functions.
+
+
deletePointer() - Method in class io.github.cvc5.Solver
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Datatype
+
 
+
deletePointer(long) - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
deletePointer(long) - Method in class io.github.cvc5.DatatypeConstructorDecl
+
 
+
deletePointer(long) - Method in class io.github.cvc5.DatatypeDecl
+
 
+
deletePointer(long) - Method in class io.github.cvc5.DatatypeSelector
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Grammar
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Op
+
 
+
deletePointer(long) - Method in class io.github.cvc5.OptionInfo
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Result
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Sort
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Stat
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Statistics
+
 
+
deletePointer(long) - Method in class io.github.cvc5.SynthResult
+
 
+
deletePointer(long) - Method in class io.github.cvc5.Term
+
 
+
DISTINCT - io.github.cvc5.Kind
+
+
Disequality.
+
+
DIVISIBLE - io.github.cvc5.Kind
+
+
Operator for the divisibility-by-k predicate.
+
+
DIVISION - io.github.cvc5.Kind
+
+
Real division, division by 0 undefined, left associative.
+
+
doubleValue() - Method in class io.github.cvc5.OptionInfo
+
+
Obtain the current value as a double.
+
+
+ + + +

E

+
+
EQ_RANGE - io.github.cvc5.Kind
+
+
Equality over arrays a and b over a given range + [i,j], i.e., + + ..
+
+
eqTerm(Term) - Method in class io.github.cvc5.Term
+
+
Equality.
+
+
EQUAL - io.github.cvc5.Kind
+
+
Equality, chainable.
+
+
equals(Object) - Method in class io.github.cvc5.Op
+
+
Syntactic equality operator.
+
+
equals(Object) - Method in class io.github.cvc5.Pair
+
 
+
equals(Object) - Method in class io.github.cvc5.Result
+
+
Operator overloading for equality of two results.
+
+
equals(Object) - Method in class io.github.cvc5.Sort
+
+
Comparison for structural equality.
+
+
equals(Object) - Method in class io.github.cvc5.Term
+
+
Syntactic equality operator.
+
+
equals(Object) - Method in class io.github.cvc5.Triplet
+
 
+
EXISTS - io.github.cvc5.Kind
+
+
Existentially quantified formula.
+
+
EXPONENTIAL - io.github.cvc5.Kind
+
+
Exponential function.
+
+
+ + + +

F

+
+
first - Variable in class io.github.cvc5.Pair
+
 
+
first - Variable in class io.github.cvc5.Triplet
+
 
+
FLOATINGPOINT_ABS - io.github.cvc5.Kind
+
+
Floating-point absolute value.
+
+
FLOATINGPOINT_ADD - io.github.cvc5.Kind
+
+
Floating-point addition.
+
+
FLOATINGPOINT_DIV - io.github.cvc5.Kind
+
+
Floating-point division.
+
+
FLOATINGPOINT_EQ - io.github.cvc5.Kind
+
+
Floating-point equality.
+
+
FLOATINGPOINT_FMA - io.github.cvc5.Kind
+
+
Floating-point fused multiply and add.
+
+
FLOATINGPOINT_FP - io.github.cvc5.Kind
+
+
Create floating-point literal from bit-vector triple.
+
+
FLOATINGPOINT_GEQ - io.github.cvc5.Kind
+
+
Floating-point greater than or equal.
+
+
FLOATINGPOINT_GT - io.github.cvc5.Kind
+
+
Floating-point greater than.
+
+
FLOATINGPOINT_IS_INF - io.github.cvc5.Kind
+
+
Floating-point is infinite tester.
+
+
FLOATINGPOINT_IS_NAN - io.github.cvc5.Kind
+
+
Floating-point is NaN tester.
+
+
FLOATINGPOINT_IS_NEG - io.github.cvc5.Kind
+
+
Floating-point is negative tester.
+
+
FLOATINGPOINT_IS_NORMAL - io.github.cvc5.Kind
+
+
Floating-point is normal tester.
+
+
FLOATINGPOINT_IS_POS - io.github.cvc5.Kind
+
+
Floating-point is positive tester.
+
+
FLOATINGPOINT_IS_SUBNORMAL - io.github.cvc5.Kind
+
+
Floating-point is sub-normal tester.
+
+
FLOATINGPOINT_IS_ZERO - io.github.cvc5.Kind
+
+
Floating-point is zero tester.
+
+
FLOATINGPOINT_LEQ - io.github.cvc5.Kind
+
+
Floating-point less than or equal.
+
+
FLOATINGPOINT_LT - io.github.cvc5.Kind
+
+
Floating-point less than.
+
+
FLOATINGPOINT_MAX - io.github.cvc5.Kind
+
+
Floating-point maximum.
+
+
FLOATINGPOINT_MIN - io.github.cvc5.Kind
+
+
Floating-point minimum.
+
+
FLOATINGPOINT_MULT - io.github.cvc5.Kind
+
+
Floating-point multiply.
+
+
FLOATINGPOINT_NEG - io.github.cvc5.Kind
+
+
Floating-point negation.
+
+
FLOATINGPOINT_REM - io.github.cvc5.Kind
+
+
Floating-point remainder.
+
+
FLOATINGPOINT_RTI - io.github.cvc5.Kind
+
+
Floating-point round to integral.
+
+
FLOATINGPOINT_SQRT - io.github.cvc5.Kind
+
+
Floating-point square root.
+
+
FLOATINGPOINT_SUB - io.github.cvc5.Kind
+
+
Floating-point sutraction.
+
+
FLOATINGPOINT_TO_FP_FROM_FP - io.github.cvc5.Kind
+
+
Conversion to floating-point from floating-point.
+
+
FLOATINGPOINT_TO_FP_FROM_IEEE_BV - io.github.cvc5.Kind
+
+
Conversion to floating-point from IEEE-754 bit-vector.
+
+
FLOATINGPOINT_TO_FP_FROM_REAL - io.github.cvc5.Kind
+
+
Conversion to floating-point from Real.
+
+
FLOATINGPOINT_TO_FP_FROM_SBV - io.github.cvc5.Kind
+
+
Conversion to floating-point from signed bit-vector.
+
+
FLOATINGPOINT_TO_FP_FROM_UBV - io.github.cvc5.Kind
+
+
Conversion to floating-point from unsigned bit-vector.
+
+
FLOATINGPOINT_TO_REAL - io.github.cvc5.Kind
+
+
Conversion to Real from floating-point.
+
+
FLOATINGPOINT_TO_SBV - io.github.cvc5.Kind
+
+
Conversion to signed bit-vector from floating-point.
+
+
FLOATINGPOINT_TO_UBV - io.github.cvc5.Kind
+
+
Conversion to unsigned bit-vector from floating-point.
+
+
FORALL - io.github.cvc5.Kind
+
+
Universally quantified formula.
+
+
fromInt(int) - Static method in enum io.github.cvc5.Kind
+
 
+
fromInt(int) - Static method in enum io.github.cvc5.RoundingMode
+
 
+
fromInt(int) - Static method in enum io.github.cvc5.UnknownExplanation
+
 
+
+ + + +

G

+
+
GEQ - io.github.cvc5.Kind
+
+
Greater than or equal, chainable.
+
+
get(int) - Method in class io.github.cvc5.Op
+
+
Get the index at position i.
+
+
get(String) - Method in class io.github.cvc5.Statistics
+
+
Retrieve the statistic with the given name.
+
+
getAbduct(Term) - Method in class io.github.cvc5.Solver
+
+
Get an abduct.
+
+
getAbduct(Term, Grammar) - Method in class io.github.cvc5.Solver
+
+
Get an abduct.
+
+
getAbductNext() - Method in class io.github.cvc5.Solver
+
+
Get the next abduct.
+
+
getAliases() - Method in class io.github.cvc5.OptionInfo
+
 
+
getArrayElementSort() - Method in class io.github.cvc5.Sort
+
 
+
getArrayIndexSort() - Method in class io.github.cvc5.Sort
+
 
+
getAssertions() - Method in class io.github.cvc5.Solver
+
+
Get the list of asserted formulas.
+
+
getBagElementSort() - Method in class io.github.cvc5.Sort
+
 
+
getBaseInfo() - Method in class io.github.cvc5.OptionInfo
+
 
+
getBitVectorSize() - Method in class io.github.cvc5.Sort
+
 
+
getBitVectorValue() - Method in class io.github.cvc5.Term
+
+
Asserts isBitVectorValue().
+
+
getBitVectorValue(int) - Method in class io.github.cvc5.Term
+
+
Get the string representation of a bit-vector value.
+
+
getBooleanSort() - Method in class io.github.cvc5.Solver
+
 
+
getBooleanValue() - Method in class io.github.cvc5.Term
+
+
Asserts isBooleanValue().
+
+
getCardinalityConstraint() - Method in class io.github.cvc5.Term
+
+
Asserts isCardinalityConstraint().
+
+
getChild(int) - Method in class io.github.cvc5.Term
+
+
Get the child term at a given index.
+
+
getCodomainSort() - Method in class io.github.cvc5.DatatypeSelector
+
 
+
getConstArrayBase() - Method in class io.github.cvc5.Term
+
+
Asserts isConstArray().
+
+
getConstructor(int) - Method in class io.github.cvc5.Datatype
+
+
Get the datatype constructor at a given index.
+
+
getConstructor(String) - Method in class io.github.cvc5.Datatype
+
+
Get the datatype constructor with the given name.
+
+
getCurrentValue() - Method in class io.github.cvc5.OptionInfo.ValueInfo
+
 
+
getDatatype() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeArity() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeConstructorArity() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeConstructorCodomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeConstructorDomainSorts() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeSelectorCodomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeSelectorDomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeTesterCodomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getDatatypeTesterDomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getDefaultValue() - Method in class io.github.cvc5.OptionInfo.ValueInfo
+
 
+
getDifficulty() - Method in class io.github.cvc5.Solver
+
+
Get a difficulty estimate for an asserted formula.
+
+
getDouble() - Method in class io.github.cvc5.Stat
+
+
Return the double value.
+
+
getFloatingPointExponentSize() - Method in class io.github.cvc5.Sort
+
 
+
getFloatingPointSignificandSize() - Method in class io.github.cvc5.Sort
+
 
+
getFloatingPointValue() - Method in class io.github.cvc5.Term
+
+
Asserts isFloatingPointValue().
+
+
getFunctionArity() - Method in class io.github.cvc5.Sort
+
 
+
getFunctionCodomainSort() - Method in class io.github.cvc5.Sort
+
 
+
getFunctionDomainSorts() - Method in class io.github.cvc5.Sort
+
 
+
getHistogram() - Method in class io.github.cvc5.Stat
+
+
Return the histogram value.
+
+
getId() - Method in class io.github.cvc5.Term
+
 
+
getInfo(String) - Method in class io.github.cvc5.Solver
+
+
Get info from the solver.
+
+
getInstantiatedParameters() - Method in class io.github.cvc5.Sort
+
+
Get the sorts used to instantiate the sort parameters of a parametric + sort (parametric datatype or uninterpreted sort constructor sort, + see Sort.instantiate(Sort[])).
+
+
getInstantiatedTerm(Sort) - Method in class io.github.cvc5.DatatypeConstructor
+
+
Get the constructor term of this datatype constructor whose return + type is retSort.
+
+
getInstantiations() - Method in class io.github.cvc5.Solver
+
+
Return a string that contains information about all instantiations made by + the quantifiers module.
+
+
getInt() - Method in class io.github.cvc5.Stat
+
+
Return the integer value.
+
+
getIntegerSort() - Method in class io.github.cvc5.Solver
+
 
+
getIntegerSort(long) - Method in class io.github.cvc5.Solver
+
 
+
getIntegerValue() - Method in class io.github.cvc5.Term
+
+
Asserts isIntegerValue().
+
+
getInterpolant(Term) - Method in class io.github.cvc5.Solver
+
+
Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
+
+
getInterpolant(Term, Grammar) - Method in class io.github.cvc5.Solver
+
+
Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> <g> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
+
+
getInterpolantNext() - Method in class io.github.cvc5.Solver
+
+
Get the next interpolant.
+
+
getKind() - Method in class io.github.cvc5.Op
+
 
+
getKind() - Method in class io.github.cvc5.Term
+
 
+
getLearnedLiterals() - Method in class io.github.cvc5.Solver
+
+
Get a list of input literals that are entailed by the current set of + assertions.
+
+
getLearnedLiterals(LearnedLitType) - Method in class io.github.cvc5.Solver
+
+
Get a list of literals that are entailed by the current set of assertions.
+
+
getMaximum() - Method in class io.github.cvc5.OptionInfo.NumberInfo
+
 
+
getMinimum() - Method in class io.github.cvc5.OptionInfo.NumberInfo
+
 
+
getModel(Sort[], Term[]) - Method in class io.github.cvc5.Solver
+
+
Get the model + + SMT-LIB: + + ( get-model ) + + + Requires to enable option produce-models.
+
+
getModelDomainElements(Sort) - Method in class io.github.cvc5.Solver
+
+
Get the domain elements of uninterpreted sort s in the current model.
+
+
getModes() - Method in class io.github.cvc5.OptionInfo.ModeInfo
+
 
+
getName() - Method in class io.github.cvc5.Datatype
+
 
+
getName() - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
getName() - Method in class io.github.cvc5.DatatypeDecl
+
 
+
getName() - Method in class io.github.cvc5.DatatypeSelector
+
 
+
getName() - Method in class io.github.cvc5.OptionInfo
+
 
+
getNullDatatypeDecl() - Method in class io.github.cvc5.Solver
+
 
+
getNullOp() - Method in class io.github.cvc5.Solver
+
 
+
getNullResult() - Method in class io.github.cvc5.Solver
+
 
+
getNullSort() - Method in class io.github.cvc5.Solver
+
 
+
getNullSynthResult() - Method in class io.github.cvc5.Solver
+
 
+
getNullTerm() - Method in class io.github.cvc5.Solver
+
 
+
getNumChildren() - Method in class io.github.cvc5.Term
+
 
+
getNumConstructors() - Method in class io.github.cvc5.Datatype
+
 
+
getNumConstructors() - Method in class io.github.cvc5.DatatypeDecl
+
+
Get the number of constructors (so far) for this Datatype declaration.
+
+
getNumIndices() - Method in class io.github.cvc5.Op
+
 
+
getNumSelectors() - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
getOp() - Method in class io.github.cvc5.Term
+
 
+
getOption(String) - Method in class io.github.cvc5.Solver
+
+
Get the value of a given option.
+
+
getOptionInfo(String) - Method in class io.github.cvc5.Solver
+
+
Get some information about the given option.
+
+
getOptionNames() - Method in class io.github.cvc5.Solver
+
+
Get all option names that can be used with + Solver.setOption(String, String), + Solver.getOption(String) and + Solver.getOptionInfo(String).
+
+
getPairs(Pair<K, ? extends AbstractPointer>[]) - Static method in class io.github.cvc5.Utils
+
 
+
getParameters() - Method in class io.github.cvc5.Datatype
+
 
+
getPointer() - Method in class io.github.cvc5.Datatype
+
 
+
getPointer() - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
getPointer() - Method in class io.github.cvc5.DatatypeConstructorDecl
+
 
+
getPointer() - Method in class io.github.cvc5.DatatypeDecl
+
 
+
getPointer() - Method in class io.github.cvc5.DatatypeSelector
+
 
+
getPointer() - Method in class io.github.cvc5.Grammar
+
 
+
getPointer() - Method in class io.github.cvc5.Op
+
 
+
getPointer() - Method in class io.github.cvc5.OptionInfo
+
 
+
getPointer() - Method in class io.github.cvc5.Result
+
 
+
getPointer() - Method in class io.github.cvc5.Solver
+
 
+
getPointer() - Method in class io.github.cvc5.Sort
+
 
+
getPointer() - Method in class io.github.cvc5.Stat
+
 
+
getPointer() - Method in class io.github.cvc5.Statistics
+
 
+
getPointer() - Method in class io.github.cvc5.SynthResult
+
 
+
getPointer() - Method in class io.github.cvc5.Term
+
 
+
getPointers(IPointer[]) - Static method in class io.github.cvc5.Utils
+
+
get pointers from one dimensional array
+
+
getPointers(IPointer[][]) - Static method in class io.github.cvc5.Utils
+
+
get pointers from two dimensional matrix
+
+
getProof() - Method in class io.github.cvc5.Solver
+
+
Get refutation proof for the most recent call to checkSat.
+
+
getProof(ProofComponent) - Method in class io.github.cvc5.Solver
+
+
Get a proof associated with the most recent call to checkSat.
+
+
getQuantifierElimination(Term) - Method in class io.github.cvc5.Solver
+
+
Do quantifier elimination.
+
+
getQuantifierEliminationDisjunct(Term) - Method in class io.github.cvc5.Solver
+
+
Do partial quantifier elimination, which can be used for incrementally + computing the result of a quantifier elimination.
+
+
getRational(Pair<BigInteger, BigInteger>) - Static method in class io.github.cvc5.Utils
+
+
Convert a pair of BigIntegers to a rational string a/b
+
+
getRational(String) - Static method in class io.github.cvc5.Utils
+
+
Convert a rational string a/b to a pair of BigIntegers
+
+
getRealOrIntegerValueSign() - Method in class io.github.cvc5.Term
+
+
Get integer or real value sign.
+
+
getRealSort() - Method in class io.github.cvc5.Solver
+
 
+
getRealValue() - Method in class io.github.cvc5.Term
+
+
Asserts isRealValue().
+
+
getRegExpSort() - Method in class io.github.cvc5.Solver
+
 
+
getRoundingModeSort() - Method in class io.github.cvc5.Solver
+
 
+
getRoundingModeValue() - Method in class io.github.cvc5.Term
+
+
Asserts isRoundingModeValue().
+
+
getSelector(int) - Method in class io.github.cvc5.DatatypeConstructor
+
+
Get the DatatypeSelector at the given index
+
+
getSelector(String) - Method in class io.github.cvc5.Datatype
+
+
Get the datatype constructor with the given name.
+
+
getSelector(String) - Method in class io.github.cvc5.DatatypeConstructor
+
+
Get the datatype selector with the given name.
+
+
getSequenceElementSort() - Method in class io.github.cvc5.Sort
+
 
+
getSequenceValue() - Method in class io.github.cvc5.Term
+
+
Asserts isSequenceValue().
+
+
getSetByUser() - Method in class io.github.cvc5.OptionInfo
+
 
+
getSetElementSort() - Method in class io.github.cvc5.Sort
+
 
+
getSetValue() - Method in class io.github.cvc5.Term
+
+
Asserts isSetValue().
+
+
getSort() - Method in class io.github.cvc5.Term
+
 
+
getSorts(Solver, long[]) - Static method in class io.github.cvc5.Utils
+
+
return sorts array from array of pointers
+
+
getStatistics() - Method in class io.github.cvc5.Solver
+
+
Returns a snapshot of the current state of the statistic values of this + solver.
+
+
getString() - Method in class io.github.cvc5.Stat
+
+
Return the string value.
+
+
getStringSort() - Method in class io.github.cvc5.Solver
+
 
+
getStringValue() - Method in class io.github.cvc5.Term
+
 
+
getSymbol() - Method in class io.github.cvc5.Sort
+
 
+
getSymbol() - Method in class io.github.cvc5.Term
+
+
Asserts hasSymbol().
+
+
getSynthSolution(Term) - Method in class io.github.cvc5.Solver
+
+
Get the synthesis solution of the given term.
+
+
getSynthSolutions(Term[]) - Method in class io.github.cvc5.Solver
+
+
Get the synthesis solutions of the given terms.
+
+
getTerm() - Method in class io.github.cvc5.DatatypeConstructor
+
+
Get the constructor term of this datatype constructor.
+
+
getTerm() - Method in class io.github.cvc5.DatatypeSelector
+
+
Get the selector term of this datatype selector.
+
+
getTerms(Solver, long[]) - Static method in class io.github.cvc5.Utils
+
+
return terms array from array of pointers
+
+
getTesterTerm() - Method in class io.github.cvc5.DatatypeConstructor
+
+
Get the tester term of this datatype constructor.
+
+
getTupleLength() - Method in class io.github.cvc5.Sort
+
 
+
getTupleSorts() - Method in class io.github.cvc5.Sort
+
 
+
getTupleValue() - Method in class io.github.cvc5.Term
+
+
Asserts isTupleValue().
+
+
getUninterpretedSortConstructor() - Method in class io.github.cvc5.Sort
+
+
Get the associated uninterpreted sort constructor of an instantiated + uninterpreted sort.
+
+
getUninterpretedSortConstructorArity() - Method in class io.github.cvc5.Sort
+
 
+
getUninterpretedSortValue() - Method in class io.github.cvc5.Term
+
+
Asserts isUninterpretedSortValue().
+
+
getUnknownExplanation() - Method in class io.github.cvc5.Result
+
 
+
getUnsatAssumptions() - Method in class io.github.cvc5.Solver
+
+
Get the set of unsat ("failed") assumptions.
+
+
getUnsatCore() - Method in class io.github.cvc5.Solver
+
+
Get the unsatisfiable core.
+
+
getUpdaterTerm() - Method in class io.github.cvc5.DatatypeSelector
+
+
Get the updater term of this datatype selector.
+
+
getValue() - Method in enum io.github.cvc5.Kind
+
 
+
getValue() - Method in enum io.github.cvc5.RoundingMode
+
 
+
getValue() - Method in enum io.github.cvc5.UnknownExplanation
+
 
+
getValue(Term) - Method in class io.github.cvc5.Solver
+
+
Get the value of the given term in the current model.
+
+
getValue(Term[]) - Method in class io.github.cvc5.Solver
+
+
Get the values of the given terms in the current model.
+
+
getValueSepHeap() - Method in class io.github.cvc5.Solver
+
+
When using separation logic, obtain the term for the heap.
+
+
getValueSepNil() - Method in class io.github.cvc5.Solver
+
+
When using separation logic, obtain the term for nil.
+
+
Grammar - Class in io.github.cvc5
+
+
A Sygus Grammar.
+
+
Grammar(Grammar) - Constructor for class io.github.cvc5.Grammar
+
 
+
GT - io.github.cvc5.Kind
+
+
Greater than, chainable.
+
+
+ + + +

H

+
+
hasNext() - Method in class io.github.cvc5.Datatype.ConstIterator
+
 
+
hasNext() - Method in class io.github.cvc5.DatatypeConstructor.ConstIterator
+
 
+
hasNext() - Method in class io.github.cvc5.Statistics.ConstIterator
+
 
+
hasNext() - Method in class io.github.cvc5.Term.ConstIterator
+
 
+
hasNoSolution() - Method in class io.github.cvc5.SynthResult
+
 
+
hasOp() - Method in class io.github.cvc5.Term
+
 
+
hasSolution() - Method in class io.github.cvc5.SynthResult
+
 
+
hasSymbol() - Method in class io.github.cvc5.Sort
+
 
+
hasSymbol() - Method in class io.github.cvc5.Term
+
 
+
HO_APPLY - io.github.cvc5.Kind
+
+
Higher-order applicative encoding of function application, left + associative.
+
+
+ + + +

I

+
+
IAND - io.github.cvc5.Kind
+
+
Integer and.
+
+
IMPLIES - io.github.cvc5.Kind
+
+
Logical implication.
+
+
impTerm(Term) - Method in class io.github.cvc5.Term
+
+
Boolean implication.
+
+
INCOMPLETE - io.github.cvc5.UnknownExplanation
+
+
Incomplete theory solver.
+
+
INST_ADD_TO_POOL - io.github.cvc5.Kind
+
+
A instantantiation-add-to-pool annotation.
+
+
INST_ATTRIBUTE - io.github.cvc5.Kind
+
+
Instantiation attribute.
+
+
INST_NO_PATTERN - io.github.cvc5.Kind
+
+
Instantiation no-pattern.
+
+
INST_PATTERN - io.github.cvc5.Kind
+
+
Instantiation pattern.
+
+
INST_PATTERN_LIST - io.github.cvc5.Kind
+
+
A list of instantiation patterns, attributes or annotations.
+
+
INST_POOL - io.github.cvc5.Kind
+
+
Instantiation pool annotation.
+
+
instantiate(Sort[]) - Method in class io.github.cvc5.Sort
+
+
Instantiate a parameterized datatype sort or uninterpreted sort + constructor sort.
+
+
INT_TO_BITVECTOR - io.github.cvc5.Kind
+
+
Conversion from Int to bit-vector.
+
+
INTERNAL_KIND - io.github.cvc5.Kind
+
+
Internal kind.
+
+
INTERRUPTED - io.github.cvc5.UnknownExplanation
+
+
Solver was interrupted.
+
+
INTS_DIVISION - io.github.cvc5.Kind
+
+
Integer division, division by 0 undefined, left associative.
+
+
INTS_MODULUS - io.github.cvc5.Kind
+
+
Integer modulus, modulus by 0 undefined.
+
+
intValue() - Method in class io.github.cvc5.OptionInfo
+
+
Obtain the current value as as int.
+
+
io.github.cvc5 - package io.github.cvc5
+
 
+
IOracle - Interface in io.github.cvc5
+
 
+
IS_INTEGER - io.github.cvc5.Kind
+
+
Is-integer predicate.
+
+
isArray() - Method in class io.github.cvc5.Sort
+
+
Determine if this is an array sort.
+
+
isBag() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a Bag sort.
+
+
isBitVector() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a bit-vector sort (SMT-LIB: (_ BitVec i)).
+
+
isBitVectorValue() - Method in class io.github.cvc5.Term
+
 
+
isBoolean() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the Boolean sort (SMT-LIB: Bool).
+
+
isBooleanValue() - Method in class io.github.cvc5.Term
+
 
+
isCardinalityConstraint() - Method in class io.github.cvc5.Term
+
 
+
isCodatatype() - Method in class io.github.cvc5.Datatype
+
 
+
isConstArray() - Method in class io.github.cvc5.Term
+
 
+
isDatatype() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a datatype sort.
+
+
isDatatypeConstructor() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a datatype constructor sort.
+
+
isDatatypeSelector() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a datatype selector sort.
+
+
isDatatypeTester() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a datatype tester sort.
+
+
isDatatypeUpdater() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a datatype updater sort.
+
+
isDefault() - Method in class io.github.cvc5.Stat
+
+
Does this value hold the default value?
+
+
isDouble() - Method in class io.github.cvc5.Stat
+
+
Is this value a double?
+
+
isFinite() - Method in class io.github.cvc5.Datatype
+
 
+
isFloatingPoint() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a floatingpoint sort + (SMT-LIB: (_ FloatingPoint eb sb)).
+
+
isFloatingPointNaN() - Method in class io.github.cvc5.Term
+
 
+
isFloatingPointNegInf() - Method in class io.github.cvc5.Term
+
 
+
isFloatingPointNegZero() - Method in class io.github.cvc5.Term
+
 
+
isFloatingPointPosInf() - Method in class io.github.cvc5.Term
+
 
+
isFloatingPointPosZero() - Method in class io.github.cvc5.Term
+
 
+
isFloatingPointValue() - Method in class io.github.cvc5.Term
+
 
+
isFunction() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a function sort.
+
+
isHistogram() - Method in class io.github.cvc5.Stat
+
+
Is this value a histogram?
+
+
isIndexed() - Method in class io.github.cvc5.Op
+
 
+
isInstantiated() - Method in class io.github.cvc5.Sort
+
+
Determine if this is an instantiated (parametric datatype or uninterpreted + sort constructor) sort.
+
+
isInt() - Method in class io.github.cvc5.Stat
+
+
Is this value an integer?
+
+
isInteger() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the integer sort (SMT-LIB: Int).
+
+
isIntegerValue() - Method in class io.github.cvc5.Term
+
 
+
isInternal() - Method in class io.github.cvc5.Stat
+
+
Is this value intended for internal use only?
+
+
isModelCoreSymbol(Term) - Method in class io.github.cvc5.Solver
+
+
This returns false if the model value of free constant v was not + essential for showing the satisfiability of the last call to + Solver.checkSat() using the current model.
+
+
isNull() - Method in class io.github.cvc5.Datatype
+
 
+
isNull() - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
isNull() - Method in class io.github.cvc5.DatatypeConstructorDecl
+
 
+
isNull() - Method in class io.github.cvc5.DatatypeDecl
+
 
+
isNull() - Method in class io.github.cvc5.DatatypeSelector
+
 
+
isNull() - Method in class io.github.cvc5.Op
+
 
+
isNull() - Method in class io.github.cvc5.Result
+
 
+
isNull() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the null sort.
+
+
isNull() - Method in class io.github.cvc5.SynthResult
+
 
+
isNull() - Method in class io.github.cvc5.Term
+
 
+
isParametric() - Method in class io.github.cvc5.Datatype
+
 
+
isParametric() - Method in class io.github.cvc5.DatatypeDecl
+
 
+
isPredicate() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a predicate sort.
+
+
isReal() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the real sort (SMT-LIB: Real).
+
+
isRealValue() - Method in class io.github.cvc5.Term
+
 
+
isRecord() - Method in class io.github.cvc5.Datatype
+
 
+
isRecord() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a record sort.
+
+
isRegExp() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the regular expression sort (SMT-LIB: RegLan).
+
+
isRoundingMode() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the rounding mode sort (SMT-LIB: RoundingMode).
+
+
isRoundingModeValue() - Method in class io.github.cvc5.Term
+
 
+
isSat() - Method in class io.github.cvc5.Result
+
 
+
isSequence() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a Sequence sort.
+
+
isSequenceValue() - Method in class io.github.cvc5.Term
+
 
+
isSet() - Method in class io.github.cvc5.Sort
+
+
Determine if this is a Set sort.
+
+
isSetValue() - Method in class io.github.cvc5.Term
+
 
+
isString() - Method in class io.github.cvc5.Sort
+
+
Determine if this is the string sort (SMT-LIB: String)..
+
+
isString() - Method in class io.github.cvc5.Stat
+
+
Is this value a string?
+
+
isStringValue() - Method in class io.github.cvc5.Term
+
 
+
isTuple() - Method in class io.github.cvc5.Datatype
+
 
+
isTuple() - Method in class io.github.cvc5.Sort
+
+
Determine if this a tuple sort.
+
+
isTupleValue() - Method in class io.github.cvc5.Term
+
 
+
isUninterpretedSort() - Method in class io.github.cvc5.Sort
+
+
Determine if this is an uninterpreted sort.
+
+
isUninterpretedSortConstructor() - Method in class io.github.cvc5.Sort
+
+
Determine if this is an uninterpreted sort constructor.
+
+
isUninterpretedSortValue() - Method in class io.github.cvc5.Term
+
 
+
isUnknown() - Method in class io.github.cvc5.Result
+
 
+
isUnknown() - Method in class io.github.cvc5.SynthResult
+
 
+
isUnsat() - Method in class io.github.cvc5.Result
+
 
+
isWellFounded() - Method in class io.github.cvc5.Datatype
+
+
Is this datatype well-founded? If this datatype is not a codatatype, + this returns false if there are no values of this datatype that are of + finite size.
+
+
ITE - io.github.cvc5.Kind
+
+
If-then-else.
+
+
iterator() - Method in class io.github.cvc5.Datatype
+
 
+
iterator() - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
iterator() - Method in class io.github.cvc5.Statistics
+
 
+
iterator() - Method in class io.github.cvc5.Term
+
 
+
iterator(boolean, boolean) - Method in class io.github.cvc5.Statistics
+
 
+
iteTerm(Term, Term) - Method in class io.github.cvc5.Term
+
+
If-then-else with this term as the Boolean condition.
+
+
+ + + +

K

+
+
Kind - Enum in io.github.cvc5
+
 
+
+ + + +

L

+
+
LAMBDA - io.github.cvc5.Kind
+
+
Lambda expression.
+
+
LAST_KIND - io.github.cvc5.Kind
+
+
Marks the upper-bound of this enumeration.
+
+
LEQ - io.github.cvc5.Kind
+
+
Less than or equal, chainable.
+
+
loadLibraries() - Static method in class io.github.cvc5.Utils
+
+
load cvc5 jni library
+
+
LT - io.github.cvc5.Kind
+
+
Less than, chainable.
+
+
+ + + +

M

+
+
MATCH - io.github.cvc5.Kind
+
+
Match expression.
+
+
MATCH_BIND_CASE - io.github.cvc5.Kind
+
+
Match case with binders, for constructors with selectors and variable + patterns.
+
+
MATCH_CASE - io.github.cvc5.Kind
+
+
Match case for nullary constructors.
+
+
MEMOUT - io.github.cvc5.UnknownExplanation
+
+
Memory limit reached.
+
+
mkArraySort(Sort, Sort) - Method in class io.github.cvc5.Solver
+
+
Create an array sort.
+
+
mkBagSort(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a bag sort.
+
+
mkBitVector(int) - Method in class io.github.cvc5.Solver
+
+
Create a bit-vector constant of given size and value = 0.
+
+
mkBitVector(int, long) - Method in class io.github.cvc5.Solver
+
+
Create a bit-vector constant of given size and value.
+
+
mkBitVector(int, String, int) - Method in class io.github.cvc5.Solver
+
+
Create a bit-vector constant of a given bit-width from a given string of + base 2, 10 or 16.
+
+
mkBitVectorSort(int) - Method in class io.github.cvc5.Solver
+
+
Create a bit-vector sort.
+
+
mkBoolean(boolean) - Method in class io.github.cvc5.Solver
+
+
Create a Boolean constant.
+
+
mkCardinalityConstraint(Sort, int) - Method in class io.github.cvc5.Solver
+
+
Create a cardinality constraint for an uninterpreted sort.
+
+
mkConst(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a free constant with a default symbol name.
+
+
mkConst(Sort, String) - Method in class io.github.cvc5.Solver
+
+
Create a free constant.
+
+
mkConstArray(Sort, Term) - Method in class io.github.cvc5.Solver
+
+
Create a constant array with the provided constant value stored at + every index
+
+
mkDatatypeConstructorDecl(String) - Method in class io.github.cvc5.Solver
+
+
Create a datatype constructor declaration.
+
+
mkDatatypeDecl(String) - Method in class io.github.cvc5.Solver
+
+
Create a datatype declaration.
+
+
mkDatatypeDecl(String, boolean) - Method in class io.github.cvc5.Solver
+
+
Create a datatype declaration.
+
+
mkDatatypeDecl(String, Sort[]) - Method in class io.github.cvc5.Solver
+
+
Create a datatype declaration.
+
+
mkDatatypeDecl(String, Sort[], boolean) - Method in class io.github.cvc5.Solver
+
+
Create a datatype declaration.
+
+
mkDatatypeSort(DatatypeDecl) - Method in class io.github.cvc5.Solver
+
+
Create a datatype sort.
+
+
mkDatatypeSorts(DatatypeDecl[]) - Method in class io.github.cvc5.Solver
+
+
Create a vector of datatype sorts.
+
+
mkEmptyBag(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a constant representing an empty bag of the given sort.
+
+
mkEmptySequence(Sort) - Method in class io.github.cvc5.Solver
+
+
Create an empty sequence of the given element sort.
+
+
mkEmptySet(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a constant representing an empty set of the given sort.
+
+
mkFalse() - Method in class io.github.cvc5.Solver
+
+
Create a Boolean false constant.
+
+
mkFloatingPoint(int, int, Term) - Method in class io.github.cvc5.Solver
+
+
Create a floating-point constant.
+
+
mkFloatingPointNaN(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a not-a-number floating-point constant (SMT-LIB: NaN).
+
+
mkFloatingPointNegInf(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a negative infinity floating-point constant (SMT-LIB: -oo).
+
+
mkFloatingPointNegZero(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a negative zero floating-point constant (SMT-LIB: -zero).
+
+
mkFloatingPointPosInf(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a positive infinity floating-point constant (SMT-LIB: +oo).
+
+
mkFloatingPointPosZero(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a positive zero floating-point constant (SMT-LIB: +zero).
+
+
mkFloatingPointSort(int, int) - Method in class io.github.cvc5.Solver
+
+
Create a floating-point sort.
+
+
mkFunctionSort(Sort[], Sort) - Method in class io.github.cvc5.Solver
+
+
Create function sort.
+
+
mkFunctionSort(Sort, Sort) - Method in class io.github.cvc5.Solver
+
+
Create function sort.
+
+
mkGrammar(Term[], Term[]) - Method in class io.github.cvc5.Solver
+
+
Create a Sygus grammar.
+
+
mkInteger(long) - Method in class io.github.cvc5.Solver
+
+
Create an integer constant from a C++ int.
+
+
mkInteger(String) - Method in class io.github.cvc5.Solver
+
+
Create an integer constant from a string.
+
+
mkOp(Kind) - Method in class io.github.cvc5.Solver
+
+
Create an operator for a builtin Kind + The Kind may not be the Kind for an indexed operator + (e.g., Kind.BITVECTOR_EXTRACT).
+
+
mkOp(Kind, int) - Method in class io.github.cvc5.Solver
+
+
Create operator of kind: + + DIVISIBLE + BITVECTOR_REPEAT + BITVECTOR_ZERO_EXTEND + BITVECTOR_SIGN_EXTEND + BITVECTOR_ROTATE_LEFT + BITVECTOR_ROTATE_RIGHT + INT_TO_BITVECTOR + FLOATINGPOINT_TO_UBV + FLOATINGPOINT_TO_UBV_TOTAL + FLOATINGPOINT_TO_SBV + FLOATINGPOINT_TO_SBV_TOTAL + TUPLE_UPDATE + + See enum Kind for a description of the parameters.
+
+
mkOp(Kind, int[]) - Method in class io.github.cvc5.Solver
+
+
Create operator of Kind: + + TUPLE_PROJECT + + See enum Kind for a description of the parameters.
+
+
mkOp(Kind, int, int) - Method in class io.github.cvc5.Solver
+
+
Create operator of Kind: + + BITVECTOR_EXTRACT + FLOATINGPOINT_TO_FP_FROM_IEEE_BV + FLOATINGPOINT_TO_FP_FROM_FP + FLOATINGPOINT_TO_FP_FROM_REAL + FLOATINGPOINT_TO_FP_FROM_SBV + FLOATINGPOINT_TO_FP_FROM_UBV + + See enum Kind for a description of the parameters.
+
+
mkOp(Kind, String) - Method in class io.github.cvc5.Solver
+
+
Create operator of kind: + + + Kind.DIVISIBLE (to support arbitrary precision integers) + + + See enum Kind for a description of the parameters.
+
+
mkParamSort() - Method in class io.github.cvc5.Solver
+
+
Create a sort parameter.
+
+
mkParamSort(String) - Method in class io.github.cvc5.Solver
+
+
Create a sort parameter.
+
+
mkPi() - Method in class io.github.cvc5.Solver
+
+
Create a constant representing the number Pi.
+
+
mkPredicateSort(Sort[]) - Method in class io.github.cvc5.Solver
+
+
Create a predicate sort.
+
+
mkReal(long) - Method in class io.github.cvc5.Solver
+
+
Create a real constant from an integer.
+
+
mkReal(long, long) - Method in class io.github.cvc5.Solver
+
+
Create a real constant from a rational.
+
+
mkReal(String) - Method in class io.github.cvc5.Solver
+
+
Create a real constant from a string.
+
+
mkRecordSort(Pair<String, Sort>[]) - Method in class io.github.cvc5.Solver
+
+
Create a record sort
+
+
mkRegexpAll() - Method in class io.github.cvc5.Solver
+
+
Create a regular expression all (re.all) term.
+
+
mkRegexpAllchar() - Method in class io.github.cvc5.Solver
+
+
Create a regular expression allchar (re.allchar) term.
+
+
mkRegexpNone() - Method in class io.github.cvc5.Solver
+
+
Create a regular expression none (re.none) term.
+
+
mkRoundingMode(RoundingMode) - Method in class io.github.cvc5.Solver
+
+
Create a rounding mode constant.
+
+
mkSepEmp() - Method in class io.github.cvc5.Solver
+
+
Create a separation logic empty term.
+
+
mkSepNil(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a separation logic nil term.
+
+
mkSequenceSort(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a sequence sort.
+
+
mkSetSort(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a set sort.
+
+
mkString(int[]) - Method in class io.github.cvc5.Solver
+
+
Create a String constant.
+
+
mkString(String) - Method in class io.github.cvc5.Solver
+
+
Create a String constant.
+
+
mkString(String, boolean) - Method in class io.github.cvc5.Solver
+
+
Create a String constant.
+
+
mkTerm(Kind) - Method in class io.github.cvc5.Solver
+
+
Create 0-ary term of given kind.
+
+
mkTerm(Kind, Term) - Method in class io.github.cvc5.Solver
+
+
Create a unary term of given kind.
+
+
mkTerm(Kind, Term[]) - Method in class io.github.cvc5.Solver
+
+
Create n-ary term of given kind.
+
+
mkTerm(Kind, Term, Term) - Method in class io.github.cvc5.Solver
+
+
Create binary term of given kind.
+
+
mkTerm(Kind, Term, Term, Term) - Method in class io.github.cvc5.Solver
+
+
Create ternary term of given kind.
+
+
mkTerm(Op) - Method in class io.github.cvc5.Solver
+
+
Create nullary term of given kind from a given operator.
+
+
mkTerm(Op, Term) - Method in class io.github.cvc5.Solver
+
+
Create unary term of given kind from a given operator.
+
+
mkTerm(Op, Term[]) - Method in class io.github.cvc5.Solver
+
+
Create n-ary term of given kind from a given operator.
+
+
mkTerm(Op, Term, Term) - Method in class io.github.cvc5.Solver
+
+
Create binary term of given kind from a given operator.
+
+
mkTerm(Op, Term, Term, Term) - Method in class io.github.cvc5.Solver
+
+
Create ternary term of given kind from a given operator.
+
+
mkTrue() - Method in class io.github.cvc5.Solver
+
+
Create a Boolean true constant.
+
+
mkTuple(Sort[], Term[]) - Method in class io.github.cvc5.Solver
+
+
Create a tuple term.
+
+
mkTupleSort(Sort[]) - Method in class io.github.cvc5.Solver
+
+
Create a tuple sort.
+
+
mkUninterpretedSort() - Method in class io.github.cvc5.Solver
+
+
Create an uninterpreted sort.
+
+
mkUninterpretedSort(String) - Method in class io.github.cvc5.Solver
+
+
Create an uninterpreted sort.
+
+
mkUninterpretedSortConstructorSort(int) - Method in class io.github.cvc5.Solver
+
+
Create a sort constructor sort.
+
+
mkUninterpretedSortConstructorSort(int, String) - Method in class io.github.cvc5.Solver
+
+
Create a sort constructor sort.
+
+
mkUniverseSet(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a universe set of the given sort.
+
+
mkUnresolvedDatatypeSort(String) - Method in class io.github.cvc5.Solver
+
+
Create an unresolved datatype sort.
+
+
mkUnresolvedDatatypeSort(String, int) - Method in class io.github.cvc5.Solver
+
+
Create an unresolved datatype sort.
+
+
mkVar(Sort) - Method in class io.github.cvc5.Solver
+
+
Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
+
+
mkVar(Sort, String) - Method in class io.github.cvc5.Solver
+
+
Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
+
+
ModeInfo(String, String, String[]) - Constructor for class io.github.cvc5.OptionInfo.ModeInfo
+
 
+
MULT - io.github.cvc5.Kind
+
+
Arithmetic multiplication.
+
+
+ + + +

N

+
+
NEG - io.github.cvc5.Kind
+
+
Arithmetic negation.
+
+
next() - Method in class io.github.cvc5.Datatype.ConstIterator
+
 
+
next() - Method in class io.github.cvc5.DatatypeConstructor.ConstIterator
+
 
+
next() - Method in class io.github.cvc5.Statistics.ConstIterator
+
 
+
next() - Method in class io.github.cvc5.Term.ConstIterator
+
 
+
NOT - io.github.cvc5.Kind
+
+
Logical negation.
+
+
notTerm() - Method in class io.github.cvc5.Term
+
+
Boolean negation.
+
+
NULL_TERM - io.github.cvc5.Kind
+
+
Null kind.
+
+
NumberInfo(T, T, T, T) - Constructor for class io.github.cvc5.OptionInfo.NumberInfo
+
 
+
+ + + +

O

+
+
Op - Class in io.github.cvc5
+
+
A cvc5 operator.
+
+
OptionInfo - Class in io.github.cvc5
+
+
Holds some description about a particular option, including its name, its + aliases, whether the option was explicitly set by the user, and information + concerning its value.
+
+
OptionInfo.BaseInfo - Class in io.github.cvc5
+
+
Abstract class for OptionInfo values
+
+
OptionInfo.ModeInfo - Class in io.github.cvc5
+
 
+
OptionInfo.NumberInfo<T> - Class in io.github.cvc5
+
+
Default value, current value, minimum and maximum of a numeric value
+
+
OptionInfo.ValueInfo<T> - Class in io.github.cvc5
+
+
Has the current and the default value
+
+
OptionInfo.VoidInfo - Class in io.github.cvc5
+
+
Has no value information
+
+
OR - io.github.cvc5.Kind
+
+
Logical disjunction.
+
+
orTerm(Term) - Method in class io.github.cvc5.Term
+
+
Boolean or.
+
+
OTHER - io.github.cvc5.UnknownExplanation
+
+
Other reason.
+
+
+ + + +

P

+
+
Pair<K,​V> - Class in io.github.cvc5
+
 
+
Pair(K, V) - Constructor for class io.github.cvc5.Pair
+
 
+
PI - io.github.cvc5.Kind
+
+
Pi constant.
+
+
pop() - Method in class io.github.cvc5.Solver
+
+
Pop a level from the assertion stack.
+
+
pop(int) - Method in class io.github.cvc5.Solver
+
+
Pop (a) level(s) from the assertion stack.
+
+
POW - io.github.cvc5.Kind
+
+
Arithmetic power.
+
+
POW2 - io.github.cvc5.Kind
+
+
Power of two.
+
+
push() - Method in class io.github.cvc5.Solver
+
+
Push a level to the assertion stack.
+
+
push(int) - Method in class io.github.cvc5.Solver
+
+
Push (a) level(s) to the assertion stack.
+
+
+ + + +

R

+
+
REGEXP_ALL - io.github.cvc5.Kind
+
+
Regular expression all.
+
+
REGEXP_ALLCHAR - io.github.cvc5.Kind
+
+
Regular expression all characters.
+
+
REGEXP_COMPLEMENT - io.github.cvc5.Kind
+
+
Regular expression complement.
+
+
REGEXP_CONCAT - io.github.cvc5.Kind
+
+
Regular expression concatenation.
+
+
REGEXP_DIFF - io.github.cvc5.Kind
+
+
Regular expression difference.
+
+
REGEXP_INTER - io.github.cvc5.Kind
+
+
Regular expression intersection.
+
+
REGEXP_LOOP - io.github.cvc5.Kind
+
+
Regular expression loop.
+
+
REGEXP_NONE - io.github.cvc5.Kind
+
+
Regular expression none.
+
+
REGEXP_OPT - io.github.cvc5.Kind
+
+
Regular expression ?.
+
+
REGEXP_PLUS - io.github.cvc5.Kind
+
+
Regular expression +.
+
+
REGEXP_RANGE - io.github.cvc5.Kind
+
+
Regular expression range.
+
+
REGEXP_REPEAT - io.github.cvc5.Kind
+
+
Operator for regular expression repeat.
+
+
REGEXP_STAR - io.github.cvc5.Kind
+
+
Regular expression \*.
+
+
REGEXP_UNION - io.github.cvc5.Kind
+
+
Regular expression union.
+
+
RELATION_AGGREGATE - io.github.cvc5.Kind
+
+
Relation aggregate operator has the form + ((\_ \; rel.aggr \; n_1 ... n_k) \; f \; i \; A) + where n_1, ..., n_k are natural numbers, + f is a function of type + (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T), + i has the type T, + and A has type (Relation \; T_1 \; ... \; T_j).
+
+
RELATION_GROUP - io.github.cvc5.Kind
+
+
Relation group + + + ((\_ \; rel.group \; n_1 \; \dots \; n_k) \; A) partitions tuples + of relation A such that tuples that have the same projection + with indices n_1 \; \dots \; n_k are in the same part.
+
+
RELATION_IDEN - io.github.cvc5.Kind
+
+
Relation identity.
+
+
RELATION_JOIN - io.github.cvc5.Kind
+
+
Relation join.
+
+
RELATION_JOIN_IMAGE - io.github.cvc5.Kind
+
+
Relation join image.
+
+
RELATION_PRODUCT - io.github.cvc5.Kind
+
+
Relation cartesian product.
+
+
RELATION_PROJECT - io.github.cvc5.Kind
+
+
Relation projection operator extends tuple projection operator to sets.
+
+
RELATION_TCLOSURE - io.github.cvc5.Kind
+
+
Relation transitive closure.
+
+
RELATION_TRANSPOSE - io.github.cvc5.Kind
+
+
Relation transpose.
+
+
REQUIRES_FULL_CHECK - io.github.cvc5.UnknownExplanation
+
+
Full satisfiability check required (e.g., if only preprocessing was + performed).
+
+
resetAssertions() - Method in class io.github.cvc5.Solver
+
+
Remove all assertions.
+
+
RESOURCEOUT - io.github.cvc5.UnknownExplanation
+
+
Resource limit reached.
+
+
Result - Class in io.github.cvc5
+
+
Encapsulation of a three-valued solver result, with explanations.
+
+
ROUND_NEAREST_TIES_TO_AWAY - io.github.cvc5.RoundingMode
+
+
Round to the nearest number away from zero.
+
+
ROUND_NEAREST_TIES_TO_EVEN - io.github.cvc5.RoundingMode
+
+
Round to the nearest even number.
+
+
ROUND_TOWARD_NEGATIVE - io.github.cvc5.RoundingMode
+
+
Round towards negative infinity (-oo).
+
+
ROUND_TOWARD_POSITIVE - io.github.cvc5.RoundingMode
+
+
Round towards positive infinity (SMT-LIB: +oo).
+
+
ROUND_TOWARD_ZERO - io.github.cvc5.RoundingMode
+
+
Round towards zero.
+
+
RoundingMode - Enum in io.github.cvc5
+
 
+
+ + + +

S

+
+
SECANT - io.github.cvc5.Kind
+
+
Secant function.
+
+
second - Variable in class io.github.cvc5.Pair
+
 
+
second - Variable in class io.github.cvc5.Triplet
+
 
+
SELECT - io.github.cvc5.Kind
+
+
Array select.
+
+
SEP_EMP - io.github.cvc5.Kind
+
+
Separation logic empty heap.
+
+
SEP_NIL - io.github.cvc5.Kind
+
+
Separation logic nil.
+
+
SEP_PTO - io.github.cvc5.Kind
+
+
Separation logic points-to relation.
+
+
SEP_STAR - io.github.cvc5.Kind
+
+
Separation logic star.
+
+
SEP_WAND - io.github.cvc5.Kind
+
+
Separation logic magic wand.
+
+
SEQ_AT - io.github.cvc5.Kind
+
+
Sequence element at.
+
+
SEQ_CONCAT - io.github.cvc5.Kind
+
+
Sequence concat.
+
+
SEQ_CONTAINS - io.github.cvc5.Kind
+
+
Sequence contains.
+
+
SEQ_EXTRACT - io.github.cvc5.Kind
+
+
Sequence extract.
+
+
SEQ_INDEXOF - io.github.cvc5.Kind
+
+
Sequence index-of.
+
+
SEQ_LENGTH - io.github.cvc5.Kind
+
+
Sequence length.
+
+
SEQ_NTH - io.github.cvc5.Kind
+
+
Sequence nth.
+
+
SEQ_PREFIX - io.github.cvc5.Kind
+
+
Sequence prefix-of.
+
+
SEQ_REPLACE - io.github.cvc5.Kind
+
+
Sequence replace.
+
+
SEQ_REPLACE_ALL - io.github.cvc5.Kind
+
+
Sequence replace all.
+
+
SEQ_REV - io.github.cvc5.Kind
+
+
Sequence reverse.
+
+
SEQ_SUFFIX - io.github.cvc5.Kind
+
+
Sequence suffix-of.
+
+
SEQ_UNIT - io.github.cvc5.Kind
+
+
Sequence unit.
+
+
SEQ_UPDATE - io.github.cvc5.Kind
+
+
Sequence update.
+
+
SET_CARD - io.github.cvc5.Kind
+
+
Set cardinality.
+
+
SET_CHOOSE - io.github.cvc5.Kind
+
+
Set choose.
+
+
SET_COMPLEMENT - io.github.cvc5.Kind
+
+
Set complement with respect to finite universe.
+
+
SET_COMPREHENSION - io.github.cvc5.Kind
+
+
Set comprehension + + + A set comprehension is specified by a variable list x_1 ... x_n, + a predicate P[x_1...x_n], and a term t[x_1...x_n].
+
+
SET_EMPTY - io.github.cvc5.Kind
+
+
Empty set.
+
+
SET_FILTER - io.github.cvc5.Kind
+
+
Set filter.
+
+
SET_FOLD - io.github.cvc5.Kind
+
+
Set fold.
+
+
SET_INSERT - io.github.cvc5.Kind
+
+
The set obtained by inserting elements; + + + Arity: n > 0 + + + 1..n-1: Terms of any Sort (must match the element sort of the given set Term) + n: Term of set Sort + + + + + Create Term of this Kind with: + + + Solver.mkTerm(Kind, Term[]) + Solver.mkTerm(Op, Term[]) + + + + + Create Op of this kind with: + + + Solver.mkOp(Kind, int[]) + +
+
+
SET_INTER - io.github.cvc5.Kind
+
+
Set intersection.
+
+
SET_IS_SINGLETON - io.github.cvc5.Kind
+
+
Set is singleton tester.
+
+
SET_MAP - io.github.cvc5.Kind
+
+
Set map.
+
+
SET_MEMBER - io.github.cvc5.Kind
+
+
Set membership predicate.
+
+
SET_MINUS - io.github.cvc5.Kind
+
+
Set subtraction.
+
+
SET_SINGLETON - io.github.cvc5.Kind
+
+
Singleton set.
+
+
SET_SUBSET - io.github.cvc5.Kind
+
+
Subset predicate.
+
+
SET_UNION - io.github.cvc5.Kind
+
+
Set union.
+
+
SET_UNIVERSE - io.github.cvc5.Kind
+
+
Finite universe set.
+
+
setInfo(String, String) - Method in class io.github.cvc5.Solver
+
+
Set info.
+
+
setLogic(String) - Method in class io.github.cvc5.Solver
+
+
Set logic.
+
+
setOption(String, String) - Method in class io.github.cvc5.Solver
+
+
Set option.
+
+
SEXPR - io.github.cvc5.Kind
+
+
Symbolic expression.
+
+
simplify(Term) - Method in class io.github.cvc5.Solver
+
+
Simplify a formula without doing "much" work.
+
+
SINE - io.github.cvc5.Kind
+
+
Sine function.
+
+
SKOLEM_ADD_TO_POOL - io.github.cvc5.Kind
+
+
A skolemization-add-to-pool annotation.
+
+
Solver - Class in io.github.cvc5
+
+
A cvc5 solver.
+
+
Solver() - Constructor for class io.github.cvc5.Solver
+
 
+
Sort - Class in io.github.cvc5
+
+
The sort of a cvc5 term.
+
+
SQRT - io.github.cvc5.Kind
+
+
Square root.
+
+
Stat - Class in io.github.cvc5
+
+
Represents a snapshot of a single statistic value.
+
+
Statistics - Class in io.github.cvc5
+
 
+
Statistics.ConstIterator - Class in io.github.cvc5
+
 
+
STORE - io.github.cvc5.Kind
+
+
Array store.
+
+
STRING_CHARAT - io.github.cvc5.Kind
+
+
String character at.
+
+
STRING_CONCAT - io.github.cvc5.Kind
+
+
String concat.
+
+
STRING_CONTAINS - io.github.cvc5.Kind
+
+
String contains.
+
+
STRING_FROM_CODE - io.github.cvc5.Kind
+
+
String from code.
+
+
STRING_FROM_INT - io.github.cvc5.Kind
+
+
Conversion from Int to String.
+
+
STRING_IN_REGEXP - io.github.cvc5.Kind
+
+
String membership.
+
+
STRING_INDEXOF - io.github.cvc5.Kind
+
+
String index-of.
+
+
STRING_INDEXOF_RE - io.github.cvc5.Kind
+
+
String index-of regular expression match.
+
+
STRING_IS_DIGIT - io.github.cvc5.Kind
+
+
String is-digit.
+
+
STRING_LENGTH - io.github.cvc5.Kind
+
+
String length.
+
+
STRING_LEQ - io.github.cvc5.Kind
+
+
String less than or equal.
+
+
STRING_LT - io.github.cvc5.Kind
+
+
String less than.
+
+
STRING_PREFIX - io.github.cvc5.Kind
+
+
String prefix-of.
+
+
STRING_REPLACE - io.github.cvc5.Kind
+
+
String replace.
+
+
STRING_REPLACE_ALL - io.github.cvc5.Kind
+
+
String replace all.
+
+
STRING_REPLACE_RE - io.github.cvc5.Kind
+
+
String replace regular expression match.
+
+
STRING_REPLACE_RE_ALL - io.github.cvc5.Kind
+
+
String replace all regular expression matches.
+
+
STRING_REV - io.github.cvc5.Kind
+
+
String reverse.
+
+
STRING_SUBSTR - io.github.cvc5.Kind
+
+
String substring.
+
+
STRING_SUFFIX - io.github.cvc5.Kind
+
+
String suffix-of.
+
+
STRING_TO_CODE - io.github.cvc5.Kind
+
+
String to code.
+
+
STRING_TO_INT - io.github.cvc5.Kind
+
+
String to integer (total function).
+
+
STRING_TO_LOWER - io.github.cvc5.Kind
+
+
String to lower case.
+
+
STRING_TO_REGEXP - io.github.cvc5.Kind
+
+
Conversion from string to regexp.
+
+
STRING_TO_UPPER - io.github.cvc5.Kind
+
+
String to upper case.
+
+
STRING_UPDATE - io.github.cvc5.Kind
+
+
String update.
+
+
stringValue() - Method in class io.github.cvc5.OptionInfo
+
+
Obtain the current value as a string.
+
+
SUB - io.github.cvc5.Kind
+
+
Arithmetic subtraction, left associative.
+
+
substitute(Sort[], Sort[]) - Method in class io.github.cvc5.Sort
+
+
Simultaneous substitution of Sorts.
+
+
substitute(Sort, Sort) - Method in class io.github.cvc5.Sort
+
+
Substitution of Sorts.
+
+
substitute(Term[], Term[]) - Method in class io.github.cvc5.Term
+
+
Simultaneously replace terms with replacements in this + term.
+
+
substitute(Term, Term) - Method in class io.github.cvc5.Term
+
+
Replace term with replacement in this term.
+
+
synthFun(String, Term[], Sort) - Method in class io.github.cvc5.Solver
+
+
Synthesize n-ary function.
+
+
synthFun(String, Term[], Sort, Grammar) - Method in class io.github.cvc5.Solver
+
+
Synthesize n-ary function following specified syntactic constraints.
+
+
synthInv(String, Term[]) - Method in class io.github.cvc5.Solver
+
+
Synthesize invariant.
+
+
synthInv(String, Term[], Grammar) - Method in class io.github.cvc5.Solver
+
+
Synthesize invariant following specified syntactic constraints.
+
+
SynthResult - Class in io.github.cvc5
+
+
Encapsulation of a solver synth result.
+
+
+ + + +

T

+
+
TABLE_AGGREGATE - io.github.cvc5.Kind
+
+
Table aggregate operator has the form + ((\_ \; table.aggr \; n_1 ... n_k) \; f \; i \; A) + where n_1, ..., n_k are natural numbers, + f is a function of type + (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T), + i has the type T, + and A has type (Table \; T_1 \; ... \; T_j).
+
+
TABLE_GROUP - io.github.cvc5.Kind
+
+
Table group + + + ((\_ \; table.group \; n_1 \; \dots \; n_k) \; A) partitions tuples + of table A such that tuples that have the same projection + with indices n_1 \; \dots \; n_k are in the same part.
+
+
TABLE_JOIN - io.github.cvc5.Kind
+
+
Table join operator has the form + ((\_ \; table.join \; m_1 \; n_1 \; \dots \; m_k \; n_k) \; A \; B) + where m_1 \; n_1 \; \dots \; m_k \; n_k are natural numbers, + and A, B are tables.
+
+
TABLE_PRODUCT - io.github.cvc5.Kind
+
+
Table cross product.
+
+
TABLE_PROJECT - io.github.cvc5.Kind
+
+
Table projection operator extends tuple projection operator to tables.
+
+
TANGENT - io.github.cvc5.Kind
+
+
Tangent function.
+
+
Term - Class in io.github.cvc5
+
+
A cvc5 Term.
+
+
Term.ConstIterator - Class in io.github.cvc5
+
 
+
third - Variable in class io.github.cvc5.Triplet
+
 
+
TIMEOUT - io.github.cvc5.UnknownExplanation
+
+
Time limit reached.
+
+
TO_INTEGER - io.github.cvc5.Kind
+
+
Convert Term of sort Int or Real to Int via the floor function.
+
+
TO_REAL - io.github.cvc5.Kind
+
+
Convert Term of Sort Int or Real to Real.
+
+
toString() - Method in class io.github.cvc5.OptionInfo
+
 
+
toString(long) - Method in class io.github.cvc5.Datatype
+
 
+
toString(long) - Method in class io.github.cvc5.DatatypeConstructor
+
 
+
toString(long) - Method in class io.github.cvc5.DatatypeConstructorDecl
+
 
+
toString(long) - Method in class io.github.cvc5.DatatypeDecl
+
 
+
toString(long) - Method in class io.github.cvc5.DatatypeSelector
+
 
+
toString(long) - Method in class io.github.cvc5.Grammar
+
 
+
toString(long) - Method in class io.github.cvc5.Op
+
 
+
toString(long) - Method in class io.github.cvc5.OptionInfo
+
 
+
toString(long) - Method in class io.github.cvc5.Result
+
 
+
toString(long) - Method in class io.github.cvc5.Sort
+
 
+
toString(long) - Method in class io.github.cvc5.Stat
+
 
+
toString(long) - Method in class io.github.cvc5.Statistics
+
 
+
toString(long) - Method in class io.github.cvc5.SynthResult
+
 
+
toString(long) - Method in class io.github.cvc5.Term
+
 
+
Triplet<A,​B,​C> - Class in io.github.cvc5
+
 
+
Triplet(A, B, C) - Constructor for class io.github.cvc5.Triplet
+
 
+
TUPLE_PROJECT - io.github.cvc5.Kind
+
+
Tuple projection.
+
+
+ + + +

U

+
+
UNDEFINED_KIND - io.github.cvc5.Kind
+
+
Undefined kind.
+
+
UNINTERPRETED_SORT_VALUE - io.github.cvc5.Kind
+
+
The value of an uninterpreted constant.
+
+
UNKNOWN_REASON - io.github.cvc5.UnknownExplanation
+
+
No specific reason given.
+
+
UnknownExplanation - Enum in io.github.cvc5
+
 
+
UNSUPPORTED - io.github.cvc5.UnknownExplanation
+
+
Unsupported feature encountered.
+
+
Utils - Class in io.github.cvc5
+
 
+
Utils() - Constructor for class io.github.cvc5.Utils
+
 
+
+ + + +

V

+
+
validateUnsigned(int[], String) - Static method in class io.github.cvc5.Utils
+
 
+
validateUnsigned(int, String) - Static method in class io.github.cvc5.Utils
+
 
+
validateUnsigned(long[], String) - Static method in class io.github.cvc5.Utils
+
 
+
validateUnsigned(long, String) - Static method in class io.github.cvc5.Utils
+
 
+
ValueInfo(T, T) - Constructor for class io.github.cvc5.OptionInfo.ValueInfo
+
 
+
valueOf(String) - Static method in enum io.github.cvc5.Kind
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum io.github.cvc5.RoundingMode
+
+
Returns the enum constant of this type with the specified name.
+
+
valueOf(String) - Static method in enum io.github.cvc5.UnknownExplanation
+
+
Returns the enum constant of this type with the specified name.
+
+
values() - Static method in enum io.github.cvc5.Kind
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum io.github.cvc5.RoundingMode
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
values() - Static method in enum io.github.cvc5.UnknownExplanation
+
+
Returns an array containing the constants of this enum type, in +the order they are declared.
+
+
VARIABLE - io.github.cvc5.Kind
+
+
(Bound) variable.
+
+
VARIABLE_LIST - io.github.cvc5.Kind
+
+
Variable list.
+
+
VoidInfo() - Constructor for class io.github.cvc5.OptionInfo.VoidInfo
+
 
+
+ + + +

W

+
+
WITNESS - io.github.cvc5.Kind
+
+
Witness.
+
+
+ + + +

X

+
+
XOR - io.github.cvc5.Kind
+
+
Logical exclusive disjunction, left associative.
+
+
xorTerm(Term) - Method in class io.github.cvc5.Term
+
+
Boolean exclusive or.
+
+
+A B C D E F G H I K L M N O P R S T U V W X 
All Classes All Packages
+
+ + + diff --git a/cvc5-1.0.2/api/java/index.html b/cvc5-1.0.2/api/java/index.html new file mode 100644 index 0000000..03b9bf3 --- /dev/null +++ b/cvc5-1.0.2/api/java/index.html @@ -0,0 +1,23 @@ + + + + + +Generated Documentation (Untitled) + + + + + + + +
+ +

io/github/cvc5/package-summary.html

+
+ + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiException.html b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiException.html new file mode 100644 index 0000000..c9d0c0f --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiException.html @@ -0,0 +1,292 @@ + + + + + +CVC5ApiException + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class CVC5ApiException

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.io.Serializable
    +
    +
    +
    Direct Known Subclasses:
    +
    CVC5ApiRecoverableException
    +
    +
    +
    public class CVC5ApiException
    +extends java.lang.Exception
    +
    +
    See Also:
    +
    Serialized Form
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      CVC5ApiException​(java.lang.String message) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      +
        +
      • + + +

        Methods inherited from class java.lang.Throwable

        +addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toString
      • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        CVC5ApiException

        +
        public CVC5ApiException​(java.lang.String message)
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiOptionException.html b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiOptionException.html new file mode 100644 index 0000000..4b0ffc2 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiOptionException.html @@ -0,0 +1,298 @@ + + + + + +CVC5ApiOptionException + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class CVC5ApiOptionException

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      CVC5ApiOptionException​(java.lang.String message) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      +
        +
      • + + +

        Methods inherited from class java.lang.Throwable

        +addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toString
      • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        CVC5ApiOptionException

        +
        public CVC5ApiOptionException​(java.lang.String message)
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiRecoverableException.html b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiRecoverableException.html new file mode 100644 index 0000000..df5c07b --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/CVC5ApiRecoverableException.html @@ -0,0 +1,297 @@ + + + + + +CVC5ApiRecoverableException + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class CVC5ApiRecoverableException

+
+
+ +
+ +
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Summary

      +
        +
      • + + +

        Methods inherited from class java.lang.Throwable

        +addSuppressed, fillInStackTrace, getCause, getLocalizedMessage, getMessage, getStackTrace, getSuppressed, initCause, printStackTrace, printStackTrace, printStackTrace, setStackTrace, toString
      • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        CVC5ApiRecoverableException

        +
        public CVC5ApiRecoverableException​(java.lang.String message)
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.ConstIterator.html b/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.ConstIterator.html new file mode 100644 index 0000000..27a3be8 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.ConstIterator.html @@ -0,0 +1,339 @@ + + + + + +Datatype.ConstIterator + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Datatype.ConstIterator

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ConstIterator() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanhasNext() 
      DatatypeConstructornext() 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
        +
      • + + +

        Methods inherited from interface java.util.Iterator

        +forEachRemaining, remove
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ConstIterator

        +
        public ConstIterator()
        +
      • +
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.html b/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.html new file mode 100644 index 0000000..18fac23 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Datatype.html @@ -0,0 +1,702 @@ + + + + + +Datatype + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Datatype

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.Iterable<DatatypeConstructor>
    +
    +
    +
    public class Datatype
    +extends java.lang.Object
    +implements java.lang.Iterable<DatatypeConstructor>
    +
    A cvc5 datatype.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        getConstructor

        +
        public DatatypeConstructor getConstructor​(int idx)
        +
        Get the datatype constructor at a given index.
        +
        +
        Parameters:
        +
        idx - The index of the datatype constructor to return.
        +
        Returns:
        +
        The datatype constructor with the given index.
        +
        +
      • +
      + + + +
        +
      • +

        getConstructor

        +
        public DatatypeConstructor getConstructor​(java.lang.String name)
        +
        Get the datatype constructor with the given name. + This is a linear search through the constructors, so in case of multiple, + similarly-named constructors, the first is returned.
        +
        +
        Parameters:
        +
        name - The name of the datatype constructor.
        +
        Returns:
        +
        The datatype constructor with the given name.
        +
        +
      • +
      + + + +
        +
      • +

        getSelector

        +
        public DatatypeSelector getSelector​(java.lang.String name)
        +
        Get the datatype constructor with the given name. + This is a linear search through the constructors and their selectors, so + in case of multiple, similarly-named selectors, the first is returned.
        +
        +
        Parameters:
        +
        name - The name of the datatype selector.
        +
        Returns:
        +
        The datatype selector with the given name.
        +
        +
      • +
      + + + +
        +
      • +

        getName

        +
        public java.lang.String getName()
        +
        +
        Returns:
        +
        The name of this Datatype.
        +
        +
      • +
      + + + +
        +
      • +

        getNumConstructors

        +
        public int getNumConstructors()
        +
        +
        Returns:
        +
        The number of constructors for this Datatype.
        +
        +
      • +
      + + + +
        +
      • +

        getParameters

        +
        public Sort[] getParameters()
        +
        +
        Returns:
        +
        The parameters of this datatype, if it is parametric. An exception. + is thrown if this datatype is not parametric.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        isParametric

        +
        public boolean isParametric()
        +
        +
        Returns:
        +
        True if this datatype is parametric.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        isCodatatype

        +
        public boolean isCodatatype()
        +
        +
        Returns:
        +
        True if this datatype corresponds to a co-datatype
        +
        +
      • +
      + + + +
        +
      • +

        isTuple

        +
        public boolean isTuple()
        +
        +
        Returns:
        +
        True if this datatype corresponds to a tuple
        +
        +
      • +
      + + + +
        +
      • +

        isRecord

        +
        public boolean isRecord()
        +
        +
        Returns:
        +
        True if this datatype corresponds to a record.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        isFinite

        +
        public boolean isFinite()
        +
        +
        Returns:
        +
        True if this datatype is finite
        +
        +
      • +
      + + + +
        +
      • +

        isWellFounded

        +
        public boolean isWellFounded()
        +
        Is this datatype well-founded? If this datatype is not a codatatype, + this returns false if there are no values of this datatype that are of + finite size.
        +
        +
        Returns:
        +
        True if this datatype is well-founded.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if this Datatype is a null object.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this datatype.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.ConstIterator.html b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.ConstIterator.html new file mode 100644 index 0000000..7a520b4 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.ConstIterator.html @@ -0,0 +1,339 @@ + + + + + +DatatypeConstructor.ConstIterator + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class DatatypeConstructor.ConstIterator

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ConstIterator() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanhasNext() 
      DatatypeSelectornext() 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
        +
      • + + +

        Methods inherited from interface java.util.Iterator

        +forEachRemaining, remove
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ConstIterator

        +
        public ConstIterator()
        +
      • +
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.html b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.html new file mode 100644 index 0000000..70f6898 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructor.html @@ -0,0 +1,639 @@ + + + + + +DatatypeConstructor + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class DatatypeConstructor

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.Iterable<DatatypeSelector>
    +
    +
    +
    public class DatatypeConstructor
    +extends java.lang.Object
    +implements java.lang.Iterable<DatatypeSelector>
    +
    A cvc5 datatype constructor.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        getName

        +
        public java.lang.String getName()
        +
        +
        Returns:
        +
        The name of this Datatype constructor.
        +
        +
      • +
      + + + +
        +
      • +

        getTerm

        +
        public Term getTerm()
        +
        Get the constructor term of this datatype constructor. + + Datatype constructors are a special class of function-like terms whose sort + is datatype constructor (Sort.isDatatypeConstructor()). All + datatype constructors, including nullary ones, should be used as the + first argument to Terms whose kind is Kind.APPLY_CONSTRUCTOR. + For example, the nil list is represented by the term + (APPLY_CONSTRUCTOR nil), where nil is the term returned by + this method.
        +
        +
        Returns:
        +
        The constructor term.
        +
        Note:
        +
        This method should not be used for parametric datatypes. Instead, + use method + getInstantiatedTerm(Sort) below.
        +
        +
      • +
      + + + +
        +
      • +

        getInstantiatedTerm

        +
        public Term getInstantiatedTerm​(Sort retSort)
        +
        Get the constructor term of this datatype constructor whose return + type is retSort. + + This method is intended to be used on constructors of parametric datatypes + and can be seen as returning the constructor term that has been explicitly + cast to the given sort. + + This method is required for constructors of parametric datatypes whose + return type cannot be determined by type inference. For example, given: + (declare-datatype List (par (T) ((nil) (cons (head T) + (tail (List T)))))) + The type of nil terms need to be provided by the user. In SMT version 2.6, + this is done via the syntax for qualified identifiers: + (as nil (List Int)) + This method is equivalent of applying the above, where this + DatatypeConstructor is the one corresponding to nil, and + retSort is (List Int).
        +
        +
        Parameters:
        +
        retSort - The desired return sort of the constructor.
        +
        Returns:
        +
        The constructor term.
        +
        Note:
        +
        The returned constructor term t is used to construct the + above (nullary) application of nil with + Solver.mkTerm(APPLY_CONSTRUCTOR, new Term[] {t})., This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getTesterTerm

        +
        public Term getTesterTerm()
        +
        Get the tester term of this datatype constructor. + + Similar to constructors, testers are a class of function-like terms of + tester sort (Sort.isDatatypeTester()), and should be used as the + first argument of Terms of kind Kind.APPLY_TESTER.
        +
        +
        Returns:
        +
        The tester term.
        +
        +
      • +
      + + + +
        +
      • +

        getNumSelectors

        +
        public int getNumSelectors()
        +
        +
        Returns:
        +
        The number of selectors (so far) of this Datatype constructor.
        +
        +
      • +
      + + + +
        +
      • +

        getSelector

        +
        public DatatypeSelector getSelector​(int index)
        +
        Get the DatatypeSelector at the given index
        +
        +
        Parameters:
        +
        index - The given index i.
        +
        Returns:
        +
        The i^th DatatypeSelector.
        +
        +
      • +
      + + + +
        +
      • +

        getSelector

        +
        public DatatypeSelector getSelector​(java.lang.String name)
        +
        Get the datatype selector with the given name. + This is a linear search through the selectors, so in case of + multiple, similarly-named selectors, the first is returned.
        +
        +
        Parameters:
        +
        name - The name of the datatype selector.
        +
        Returns:
        +
        The first datatype selector with the given name.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if this DatatypeConstructor is a null object.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this datatype constructor.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructorDecl.html b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructorDecl.html new file mode 100644 index 0000000..4e6ba75 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeConstructorDecl.html @@ -0,0 +1,476 @@ + + + + + +DatatypeConstructorDecl + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class DatatypeConstructorDecl

+
+
+ +
+
    +
  • +
    +
    public class DatatypeConstructorDecl
    +extends java.lang.Object
    +
    A cvc5 datatype constructor declaration. A datatype constructor declaration + is a specification used for creating a datatype constructor.
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      voidaddSelector​(java.lang.String name, + Sort sort) +
      Add datatype selector declaration.
      +
      voidaddSelectorSelf​(java.lang.String name) +
      Add datatype selector declaration whose codomain type is the datatype + itself.
      +
      voidaddSelectorUnresolved​(java.lang.String name, + java.lang.String unresDataypeName) +
      Add datatype selector declaration whose codomain sort is an unresolved + datatype with the given name.
      +
      protected voiddeletePointer​(long pointer) 
      longgetPointer() 
      SolvergetSolver() 
      booleanisNull() 
      java.lang.StringtoString() 
      protected java.lang.StringtoString​(long pointer) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        addSelector

        +
        public void addSelector​(java.lang.String name,
        +                        Sort sort)
        +
        Add datatype selector declaration.
        +
        +
        Parameters:
        +
        name - The name of the datatype selector declaration to add.
        +
        sort - The codomain sort of the datatype selector declaration to add.
        +
        +
      • +
      + + + +
        +
      • +

        addSelectorSelf

        +
        public void addSelectorSelf​(java.lang.String name)
        +
        Add datatype selector declaration whose codomain type is the datatype + itself.
        +
        +
        Parameters:
        +
        name - The name of the datatype selector declaration to add.
        +
        +
      • +
      + + + +
        +
      • +

        addSelectorUnresolved

        +
        public void addSelectorUnresolved​(java.lang.String name,
        +                                  java.lang.String unresDataypeName)
        +
        Add datatype selector declaration whose codomain sort is an unresolved + datatype with the given name.
        +
        +
        Parameters:
        +
        name - The name of the datatype selector declaration to add.
        +
        unresDataypeName - The name of the unresolved datatype. The codomain + of the selector will be the resolved datatype with + the given name.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True If this DatatypeConstructorDecl is a null declaration.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A String representation of this datatype constructor declaration
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeDecl.html b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeDecl.html new file mode 100644 index 0000000..c8947f8 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeDecl.html @@ -0,0 +1,485 @@ + + + + + +DatatypeDecl + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class DatatypeDecl

+
+
+ +
+
    +
  • +
    +
    public class DatatypeDecl
    +extends java.lang.Object
    +
    A cvc5 datatype declaration. A datatype declaration is not itself a datatype + (see Datatype), but a specification for creating a datatype sort. + + The interface for a datatype declaration coincides with the syntax for the + SMT-LIB 2.6 command declare-datatype, or a single datatype within the + declare-datatypes command. + + Datatype sorts can be constructed from DatatypeDecl using the methods: + - Solver.mkDatatypeSort(DatatypeDecl) + - Solver.mkDatatypeSorts(DatatypeDecl[])
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        addConstructor

        +
        public void addConstructor​(DatatypeConstructorDecl ctor)
        +
        Add datatype constructor declaration.
        +
        +
        Parameters:
        +
        ctor - The datatype constructor declaration to add.
        +
        +
      • +
      + + + +
        +
      • +

        getNumConstructors

        +
        public int getNumConstructors()
        +
        Get the number of constructors (so far) for this Datatype declaration.
        +
      • +
      + + + +
        +
      • +

        isParametric

        +
        public boolean isParametric()
        +
        +
        Returns:
        +
        True if this DatatypeDecl is parametric.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if this DatatypeDecl is a null object.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this datatype declaration.
        +
        +
      • +
      + + + +
        +
      • +

        getName

        +
        public java.lang.String getName()
        +
        +
        Returns:
        +
        The name of this datatype declaration.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeSelector.html b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeSelector.html new file mode 100644 index 0000000..b2a0c04 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/DatatypeSelector.html @@ -0,0 +1,486 @@ + + + + + +DatatypeSelector + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class DatatypeSelector

+
+
+ +
+
    +
  • +
    +
    public class DatatypeSelector
    +extends java.lang.Object
    +
    A cvc5 datatype selector.
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        getName

        +
        public java.lang.String getName()
        +
        +
        Returns:
        +
        The Name of this Datatype selector.
        +
        +
      • +
      + + + +
        +
      • +

        getTerm

        +
        public Term getTerm()
        +
        Get the selector term of this datatype selector. + + Selector terms are a class of function-like terms of selector + sort (Sort::isDatatypeSelector), and should be used as the first + argument of Terms of kind APPLY_SELECTOR.
        +
        +
        Returns:
        +
        The Selector term.
        +
        +
      • +
      + + + +
        +
      • +

        getUpdaterTerm

        +
        public Term getUpdaterTerm()
        +
        Get the updater term of this datatype selector. + + Similar to selectors, updater terms are a class of function-like terms of + updater Sort (Sort::isDatatypeUpdater), and should be used as the first + argument of Terms of kind APPLY_UPDATER.
        +
        +
        Returns:
        +
        The Updater term.
        +
        +
      • +
      + + + +
        +
      • +

        getCodomainSort

        +
        public Sort getCodomainSort()
        +
        +
        Returns:
        +
        The Codomain sort of this selector.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True If this DatatypeSelector is a null object.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A String representation of this datatype selector.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Grammar.html b/cvc5-1.0.2/api/java/io/github/cvc5/Grammar.html new file mode 100644 index 0000000..59ecd4d --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Grammar.html @@ -0,0 +1,538 @@ + + + + + +Grammar + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Grammar

+
+
+ +
+
    +
  • +
    +
    public class Grammar
    +extends java.lang.Object
    +
    A Sygus Grammar. + + This class can be used to define a context-free grammar of terms. Its + interface coincides with the definition of grammars (GrammarDef) in + the SyGuS IF 2.1 standard.
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      Grammar​(Grammar grammar) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      voidaddAnyConstant​(Term ntSymbol) +
      Allow ntSymbol to be an arbitrary constant.
      +
      voidaddAnyVariable​(Term ntSymbol) +
      Allow ntSymbol to be any input variable to corresponding + synth-fun or synth-inv with the same sort as + ntSymbol.
      +
      voidaddRule​(Term ntSymbol, + Term rule) +
      Add rule to the set of rules corresponding to ntSymbol.
      +
      voidaddRules​(long pointer, + long ntSymbolPointer, + long[] rulePointers) 
      voidaddRules​(Term ntSymbol, + Term[] rules) +
      Add rules to the set of rules corresponding to ntSymbol.
      +
      protected voiddeletePointer​(long pointer) 
      longgetPointer() 
      SolvergetSolver() 
      java.lang.StringtoString() 
      protected java.lang.StringtoString​(long pointer) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        Grammar

        +
        public Grammar​(Grammar grammar)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        addRule

        +
        public void addRule​(Term ntSymbol,
        +                    Term rule)
        +
        Add rule to the set of rules corresponding to ntSymbol.
        +
        +
        Parameters:
        +
        ntSymbol - the non-terminal to which the rule is added.
        +
        rule - the rule to add.
        +
        +
      • +
      + + + +
        +
      • +

        addRules

        +
        public void addRules​(Term ntSymbol,
        +                     Term[] rules)
        +
        Add rules to the set of rules corresponding to ntSymbol.
        +
        +
        Parameters:
        +
        ntSymbol - the non-terminal to which the rules are added.
        +
        rules - the rules to add.
        +
        +
      • +
      + + + +
        +
      • +

        addRules

        +
        public void addRules​(long pointer,
        +                     long ntSymbolPointer,
        +                     long[] rulePointers)
        +
      • +
      + + + +
        +
      • +

        addAnyConstant

        +
        public void addAnyConstant​(Term ntSymbol)
        +
        Allow ntSymbol to be an arbitrary constant.
        +
        +
        Parameters:
        +
        ntSymbol - the non-terminal allowed to be any constant.
        +
        +
      • +
      + + + +
        +
      • +

        addAnyVariable

        +
        public void addAnyVariable​(Term ntSymbol)
        +
        Allow ntSymbol to be any input variable to corresponding + synth-fun or synth-inv with the same sort as + ntSymbol.
        +
        +
        Parameters:
        +
        ntSymbol - the non-terminal allowed to be any input constant.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A String representation of this grammar.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/IOracle.html b/cvc5-1.0.2/api/java/io/github/cvc5/IOracle.html new file mode 100644 index 0000000..7190eff --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/IOracle.html @@ -0,0 +1,255 @@ + + + + + +IOracle + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Interface IOracle

+
+
+
+
    +
  • +
    +
    Functional Interface:
    +
    This is a functional interface and can therefore be used as the assignment target for a lambda expression or method reference.
    +
    +
    +
    @FunctionalInterface
    +public interface IOracle
    +
  • +
+
+
+ +
+
+ +
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Kind.html b/cvc5-1.0.2/api/java/io/github/cvc5/Kind.html new file mode 100644 index 0000000..2b5cf59 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Kind.html @@ -0,0 +1,12072 @@ + + + + + +Kind + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Enum Kind

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.io.Serializable, java.lang.Comparable<Kind>
    +
    +
    +
    public enum Kind
    +extends java.lang.Enum<Kind>
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Detail

      + + + +
        +
      • +

        INTERNAL_KIND

        +
        public static final Kind INTERNAL_KIND
        +
        Internal kind. + + This kind serves as an abstraction for internal kinds that are not exposed + via the API but may appear in terms returned by API functions, e.g., + when querying the simplified form of a term.
        +
        +
        Note:
        +
        Should never be created via the API.
        +
        +
      • +
      + + + +
        +
      • +

        UNDEFINED_KIND

        +
        public static final Kind UNDEFINED_KIND
        +
        Undefined kind.
        +
        +
        Note:
        +
        Should never be exposed or created via the API.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        UNINTERPRETED_SORT_VALUE

        +
        public static final Kind UNINTERPRETED_SORT_VALUE
        +
        The value of an uninterpreted constant.
        +
        +
        Note:
        +
        May be returned as the result of an API call, but terms of this + kind may not be created explicitly via the API and may not + appear in assertions.
        +
        +
      • +
      + + + + + + + + + + + + + + + +
        +
      • +

        VARIABLE

        +
        public static final Kind VARIABLE
        +
        (Bound) variable. + +
        +
        +
        Note:
        +
        Only permitted in bindings and in lambda and quantifier bodies.
        +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        WITNESS

        +
        public static final Kind WITNESS
        +
        Witness. + + The syntax of a witness term is similar to a quantified formula except that + only one variable is allowed. + For example, the term + + .. code. smtlib + + (witness ((x S)) F) + + returns an element x of Sort S and asserts formula + F. + + The witness operator behaves like the description operator + (see https: + no x that satisfies F. But if such x exists, the + witness operator does not enforce the following axiom which ensures + uniqueness up to logical equivalence: + + .. math. + + \forall x. F \equiv G \Rightarrow witness~x. F = witness~x. G + + For example, if there are two elements of Sort S that satisfy + formula F, then the following formula is satisfiable: + + .. code. smtlib + + (distinct + (witness ((x Int)) F) + (witness ((x Int)) F)) + + + +
          +
        • Arity: 3 +
            + +
          • 1: Term of kind VARIABLE_LIST
          • +
          • 2: Term of Sort Bool (the body of the witness)
          • +
          • 3: (optional) Term of kind INST_PATTERN_LIST
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is primarily used internally, but may be returned in + models (e.g., for arithmetic terms in non-linear queries). However, + it is not supported by the parser. Moreover, the user of the API + should be cautious when using this operator. In general, all witness + terms (witness ((x Int)) F) should be such that ``(exists ((x Int)) + F)`` is a valid formula. If this is not the case, then the semantics + in formulas that use witness terms may be unintuitive. For example, + the following formula is unsatisfiable: + ``(or (= (witness ((x Int)) false) 0) (not (= (witness ((x Int)) + false) 0)), whereas notice that (or (= z 0) (not (= z 0)))`` is + true for any z.
        +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        CARDINALITY_CONSTRAINT

        +
        public static final Kind CARDINALITY_CONSTRAINT
        +
        Cardinality constraint on uninterpreted sort. + + + Interpreted as a predicate that is true when the cardinality of + uinterpreted Sort S is less than or equal to an upper bound. + + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        HO_APPLY

        +
        public static final Kind HO_APPLY
        +
        Higher-order applicative encoding of function application, left + associative. + +
          +
        • Arity: n = 2 +
            + +
          • 1: Function Term
          • +
          • 2: Argument Term of the domain Sort of the function
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        IAND

        +
        public static final Kind IAND
        +
        Integer and. + + + Operator for bit-wise AND over integers, parameterized by a (positive) + bit-width k. + + .. code. smtlib + + ((_ iand k) i_1 i_2) + + is equivalent to + + .. code. smtlib + + ((_ iand k) i_1 i_2) + (bv2int (bvand ((_ int2bv k) i_1) ((_ int2bv k) i_2))) + + for all integers i_1, i_2. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of Sort Int
          • + +
          • Indices: 1
          • + +
          • 1: Bit-width k
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        DIVISIBLE

        +
        public static final Kind DIVISIBLE
        +
        Operator for the divisibility-by-k predicate. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort Int
          • + +
          • Indices: 1
          • + +
          • 1: The integer k to divide by.
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        PI

        +
        public static final Kind PI
        +
        Pi constant. + +
        +
        +
        Note:
        +
        PI is considered a special symbol of Sort + Real, but is not a Real value, i.e., + Term.isRealValue() will return false.
        +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        BITVECTOR_UDIV

        +
        public static final Kind BITVECTOR_UDIV
        +
        Unsigned bit-vector division. + + Truncates towards 0. If the divisor is zero, the result is all ones. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bit-vector Sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_UREM

        +
        public static final Kind BITVECTOR_UREM
        +
        Unsigned bit-vector remainder. + + Remainder from unsigned bit-vector division. If the modulus is zero, the + result is the dividend. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bit-vector Sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_SDIV

        +
        public static final Kind BITVECTOR_SDIV
        +
        Signed bit-vector division. + + Two's complement signed division of two bit-vectors. If the divisor is + zero and the dividend is positive, the result is all ones. If the divisor + is zero and the dividend is negative, the result is one. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bit-vector Sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_SREM

        +
        public static final Kind BITVECTOR_SREM
        +
        Signed bit-vector remainder (sign follows dividend). + + Two's complement signed remainder of two bit-vectors where the sign + follows the dividend. If the modulus is zero, the result is the dividend. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bit-vector Sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_SMOD

        +
        public static final Kind BITVECTOR_SMOD
        +
        Signed bit-vector remainder (sign follows divisor). + + Two's complement signed remainder where the sign follows the divisor. If + the modulus is zero, the result is the dividend. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bit-vector Sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        BITVECTOR_ITE

        +
        public static final Kind BITVECTOR_ITE
        +
        Bit-vector if-then-else. + + Same semantics as regular ITE, but condition is bit-vector of size 1. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of bit-vector Sort of size `1`
          • +
          • 1..3: Terms of bit-vector sort (sorts must match)
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        BITVECTOR_EXTRACT

        +
        public static final Kind BITVECTOR_EXTRACT
        +
        Bit-vector extract. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 2
          • + +
          • 1: The upper bit index.
          • +
          • 2: The lower bit index.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_REPEAT

        +
        public static final Kind BITVECTOR_REPEAT
        +
        Bit-vector repeat. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 1
          • + +
          • 1: The number of times to repeat the given term.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_ZERO_EXTEND

        +
        public static final Kind BITVECTOR_ZERO_EXTEND
        +
        Bit-vector zero extension. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 1
          • + +
          • 1: The number of zeroes to extend the given term with.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_SIGN_EXTEND

        +
        public static final Kind BITVECTOR_SIGN_EXTEND
        +
        Bit-vector sign extension. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 1
          • + +
          • 1: The number of bits (of the value of the sign bit) to extend the given term with.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_ROTATE_LEFT

        +
        public static final Kind BITVECTOR_ROTATE_LEFT
        +
        Bit-vector rotate left. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 1
          • + +
          • 1: The number of bits to rotate the given term left.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        BITVECTOR_ROTATE_RIGHT

        +
        public static final Kind BITVECTOR_ROTATE_RIGHT
        +
        Bit-vector rotate right. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 1
          • + +
          • 1: The number of bits to rotate the given term right.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        INT_TO_BITVECTOR

        +
        public static final Kind INT_TO_BITVECTOR
        +
        Conversion from Int to bit-vector. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort Int
          • + +
          • Indices: 1
          • + +
          • 1: The size of the bit-vector to convert to.
          • + +
        • +
        + +
        +
      • +
      + + + + + + + +
        +
      • +

        CONST_FLOATINGPOINT

        +
        public static final Kind CONST_FLOATINGPOINT
        +
        Floating-point constant, created from IEEE-754 bit-vector representation + of the floating-point value. + +
        +
      • +
      + + + + + + + +
        +
      • +

        FLOATINGPOINT_FP

        +
        public static final Kind FLOATINGPOINT_FP
        +
        Create floating-point literal from bit-vector triple. + + +
          +
        • Arity: 3 +
            + +
          • 1: Term of bit-vector Sort of size `1` (sign bit)
          • +
          • 2: Term of bit-vector Sort of exponent size (exponent)
          • +
          • 3: Term of bit-vector Sort of significand size - 1 (significand without hidden bit)
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        FLOATINGPOINT_TO_FP_FROM_IEEE_BV

        +
        public static final Kind FLOATINGPOINT_TO_FP_FROM_IEEE_BV
        +
        Conversion to floating-point from IEEE-754 bit-vector. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bit-vector Sort
          • + +
          • Indices: 2
          • + +
          • 1: The exponent size
          • +
          • 2: The significand size
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_FP_FROM_FP

        +
        public static final Kind FLOATINGPOINT_TO_FP_FROM_FP
        +
        Conversion to floating-point from floating-point. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort RoundingMode
          • +
          • 2: Term of floating-point Sort
          • + +
          • Indices: 2
          • + +
          • 1: The exponent size
          • +
          • 2: The significand size
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_FP_FROM_REAL

        +
        public static final Kind FLOATINGPOINT_TO_FP_FROM_REAL
        +
        Conversion to floating-point from Real. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort RoundingMode
          • +
          • 2: Term of Sort Real
          • + +
          • Indices: 2
          • + +
          • 1: The exponent size
          • +
          • 2: The significand size
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_FP_FROM_SBV

        +
        public static final Kind FLOATINGPOINT_TO_FP_FROM_SBV
        +
        Conversion to floating-point from signed bit-vector. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort RoundingMode
          • +
          • 2: Term of bit-vector Sort
          • + +
          • Indices: 2
          • + +
          • 1: The exponent size
          • +
          • 2: The significand size
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_FP_FROM_UBV

        +
        public static final Kind FLOATINGPOINT_TO_FP_FROM_UBV
        +
        Conversion to floating-point from unsigned bit-vector. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort RoundingMode
          • +
          • 2: Term of bit-vector Sort
          • + +
          • Indices: 2
          • + +
          • 1: The exponent size
          • +
          • 2: The significand size
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_UBV

        +
        public static final Kind FLOATINGPOINT_TO_UBV
        +
        Conversion to unsigned bit-vector from floating-point. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of floating-point Sort
          • + +
          • Indices: 1
          • + +
          • 1: The size of the bit-vector to convert to.
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        FLOATINGPOINT_TO_SBV

        +
        public static final Kind FLOATINGPOINT_TO_SBV
        +
        Conversion to signed bit-vector from floating-point. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of floating-point Sort
          • + +
          • Indices: 1
          • + +
          • 1: The size of the bit-vector to convert to.
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + +
        +
      • +

        EQ_RANGE

        +
        public static final Kind EQ_RANGE
        +
        Equality over arrays a and b over a given range + [i,j], i.e., + + .. math. + + \forall k . i \leq k \leq j \Rightarrow a[k] = b[k] + + + +
          +
        • Arity: 4 +
            + +
          • 1: Term of array Sort (first array)
          • +
          • 2: Term of array Sort (second array)
          • +
          • 3: Term of array index Sort (lower bound of range, inclusive)
          • +
          • 4: Term of array index Sort (upper bound of range, inclusive)
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions., We currently support the creation of array equalities over index + Sorts bit-vector, floating-point, Int and Real. + Requires to enable option + :ref:`arrays-exp<lbl-option-arrays-exp>`.
        +
        +
      • +
      + + + + + + + + + + + + + + + +
        +
      • +

        APPLY_UPDATER

        +
        public static final Kind APPLY_UPDATER
        +
        Datatype update application. + +
          +
        • Arity: 3 +
            + +
          • 1: Datatype updater Term (see DatatypeSelector.getUpdaterTerm() )
          • +
          • 2: Term of Datatype Sort (DatatypeSelector of the updater must belong to a constructor of this Datatype Sort)
          • +
          • 3: Term of the codomain Sort of the selector (the Term to update the field of the datatype term with)
          • + +
        • +
        + +
        +
        +
        Note:
        +
        Does not change the datatype argument if misapplied.
        +
        +
      • +
      + + + +
        +
      • +

        MATCH

        +
        public static final Kind MATCH
        +
        Match expression. + + This kind is primarily used in the parser to support the + SMT-LIBv2 match expression. + + For example, the SMT-LIBv2 syntax for the following match term + + .. code. smtlib + + (match l (((cons h t) h) (nil 0))) + + is represented by the AST + + .. code. lisp + + (MATCH l + (MATCH_BIND_CASE (VARIABLE_LIST h t) (cons h t) h) + (MATCH_CASE nil 0)) + + Terms of kind MATCH_CASE are constant case expressions, + which are used for nullary constructors. Kind + MATCH_BIND_CASE is used for constructors with selectors + and variable match patterns. If not all constructors are covered, at least + one catch-all variable pattern must be included. + +
          +
        • Arity: n > 1 +
            + +
          • 1..n: Terms of kind MATCH_CASE and MATCH_BIND_CASE
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        MATCH_CASE

        +
        public static final Kind MATCH_CASE
        +
        Match case for nullary constructors. + + A (constant) case expression to be used within a match expression. + + +
          +
        • Arity: 2 +
            + +
          • 1: Term of kind APPLY_CONSTRUCTOR (the pattern to match against)
          • +
          • 2: Term of any Sort (the term the match term evaluates to)
          • + + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        MATCH_BIND_CASE

        +
        public static final Kind MATCH_BIND_CASE
        +
        Match case with binders, for constructors with selectors and variable + patterns. + + A (non-constant) case expression to be used within a match expression. + + +
          +
        • Arity: 3 +
            + +
          • For variable patterns:
          • + +
          • 1: Term of kind VARIABLE_LIST (containing the free variable of the case)
          • +
          • 2: Term of kind VARIABLE (the pattern expression, the free variable of the case)
          • +
          • 3: Term of any Sort (the term the pattern evaluates to)
          • + +
          • For constructors with selectors:
          • + +
          • 1: Term of kind VARIABLE_LIST (containing the free variable of the case)
          • +
          • 2: Term of kind APPLY_CONSTRUCTOR (the pattern expression, applying the set of variables to the constructor)
          • +
          • 3: Term of any Sort (the term the match term evaluates to)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        TUPLE_PROJECT

        +
        public static final Kind TUPLE_PROJECT
        +
        Tuple projection. + + This operator takes a tuple as an argument and returns a tuple obtained by + concatenating components of its argument at the provided indices. + + For example, + + .. code. smtlib + + ((_ tuple.project 1 2 2 3 1) (tuple 10 20 30 40)) + + yields + + .. code. smtlib + + (tuple 20 30 30 40 20) + + +
          +
        • Arity: 1 +
            + +
          • 1: Term of tuple Sort
          • + +
          • Indices: n
          • + +
          • 1..n: The tuple indices to project
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEP_NIL

        +
        public static final Kind SEP_NIL
        +
        Separation logic nil. + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SEP_EMP

        +
        public static final Kind SEP_EMP
        +
        Separation logic empty heap. + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SEP_PTO

        +
        public static final Kind SEP_PTO
        +
        Separation logic points-to relation. + +
          +
        • Arity: 2 +
            + +
          • 1: Term denoting the location of the points-to constraint
          • +
          • 2: Term denoting the data of the points-to constraint
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SEP_STAR

        +
        public static final Kind SEP_STAR
        +
        Separation logic star. + +
          +
        • Arity: n > 1 +
            + +
          • 1..n: Terms of sort Bool (the child constraints that hold in
          • +
        • +
        + disjoint (separated) heaps) + + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SEP_WAND

        +
        public static final Kind SEP_WAND
        +
        Separation logic magic wand. + +
          +
        • Arity: 2 +
            + +
          • 1: Terms of Sort Bool (the antecendant of the magic wand constraint)
          • +
          • 2: Terms of Sort Bool (conclusion of the magic wand constraint,
          • +
        • +
        + which is asserted to hold in all heaps that are disjoint + extensions of the antecedent) + + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_EMPTY

        +
        public static final Kind SET_EMPTY
        +
        Empty set. + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + +
        +
      • +

        SET_MEMBER

        +
        public static final Kind SET_MEMBER
        +
        Set membership predicate. + + Determines if the given set element is a member of the second set. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of any Sort (must match the element Sort of the given set Term)
          • +
          • 2: Term of set Sort
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SET_SINGLETON

        +
        public static final Kind SET_SINGLETON
        +
        Singleton set. + + Construct a singleton set from an element given as a parameter. + The returned set has the same Sort as the element. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of any Sort (the set element)
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + +
        +
      • +

        SET_UNIVERSE

        +
        public static final Kind SET_UNIVERSE
        +
        Finite universe set. + + All set variables must be interpreted as subsets of it. + +
        +
        +
        Note:
        +
        SET_UNIVERSE is considered a special symbol of + the theory of sets and is not considered as a set value, i.e., + Term.isSetValue() will return false.
        +
        +
      • +
      + + + +
        +
      • +

        SET_COMPREHENSION

        +
        public static final Kind SET_COMPREHENSION
        +
        Set comprehension + + + A set comprehension is specified by a variable list x_1 ... x_n, + a predicate P[x_1...x_n], and a term t[x_1...x_n]. A + comprehension C with the above form has members given by the + following semantics: + + .. math. + + \forall y. ( \exists x_1...x_n. P[x_1...x_n] \wedge t[x_1...x_n] = y ) + \Leftrightarrow (set.member \; y \; C) + + where y ranges over the element Sort of the (set) Sort of the + comprehension. If t[x_1..x_n] is not provided, it is equivalent + to y in the above formula. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Kind VARIABLE_LIST
          • +
          • 2: Term of sort Bool (the predicate of the comprehension)
          • +
          • 3: (optional) Term denoting the generator for the comprehension
          • + + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_CHOOSE

        +
        public static final Kind SET_CHOOSE
        +
        Set choose. + + + Select an element from a given set. For a set A = \{x\}, the term + (set.choose A) is equivalent to the term x_1. For an empty + set, it is an arbitrary value. For a set with cardinality > 1, it will + deterministically return an element in A. + + +
          +
        • Arity: 1 +
            + +
          • 1: Term of set Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_IS_SINGLETON

        +
        public static final Kind SET_IS_SINGLETON
        +
        Set is singleton tester. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of set Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_MAP

        +
        public static final Kind SET_MAP
        +
        Set map. + + + This operator applies the first argument, a function of + Sort (\rightarrow S_1 \; S_2), to every element of the second + argument, a set of Sort (Set S_1), and returns a set of Sort + (Set S_2). + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow S_1 \; S_2)
          • +
          • 2: Term of set Sort (Set S_1)
          • + + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_FILTER

        +
        public static final Kind SET_FILTER
        +
        Set filter. + + + This operator filters the elements of a set. + (set.filter p \; A) takes a predicate p of Sort + (\rightarrow T \; Bool) as a first argument, and a set A + of Sort (Set T) as a second argument, and returns a subset of Sort + (Set T) that includes all elements of A that satisfy + p. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow T \; Bool)
          • +
          • 2: Term of bag Sort (Set T)
          • + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        SET_FOLD

        +
        public static final Kind SET_FOLD
        +
        Set fold. + + + This operator combines elements of a set into a single value. + (set.fold f \; t \; A) folds the elements of set A + starting with Term t and using the combining function f. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow S_1 \; S_2 \; S_2)
          • +
          • 2: Term of Sort S_2 (the initial value)
          • +
          • 3: Term of bag Sort (Set S_1)
          • + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + + + + + + + + + + + + + + + + + +
        +
      • +

        RELATION_JOIN_IMAGE

        +
        public static final Kind RELATION_JOIN_IMAGE
        +
        Relation join image. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of relation Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        RELATION_GROUP

        +
        public static final Kind RELATION_GROUP
        +
        Relation group + + + ((\_ \; rel.group \; n_1 \; \dots \; n_k) \; A) partitions tuples + of relation A such that tuples that have the same projection + with indices n_1 \; \dots \; n_k are in the same part. + It returns a set of relations of type (Set \; T) where + T is the type of A. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of relation sort
          • + +
          • Indices: n
          • + +
          • 1..n: Indices of the projection
          • + + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        RELATION_AGGREGATE

        +
        public static final Kind RELATION_AGGREGATE
        +
        Relation aggregate operator has the form + ((\_ \; rel.aggr \; n_1 ... n_k) \; f \; i \; A) + where n_1, ..., n_k are natural numbers, + f is a function of type + (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T), + i has the type T, + and A has type (Relation \; T_1 \; ... \; T_j). + The returned type is (Set \; T). + + This operator aggregates elements in A that have the same tuple projection + with indices n_1, ..., n_k using the combining function f, + and initial value i. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sort (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)
          • +
          • 2: Term of Sort T
          • +
          • 3: Term of relation sort Relation T_1 ... T_j
          • + +
          • Indices: n
          • +
          • 1..n: Indices of the projection
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        RELATION_PROJECT

        +
        public static final Kind RELATION_PROJECT
        +
        Relation projection operator extends tuple projection operator to sets. + +
          +
        • Arity: 1 +
            +
          • 1: Term of relation Sort
          • + +
          • Indices: n
          • +
          • 1..n: Indices of the projection
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_EMPTY

        +
        public static final Kind BAG_EMPTY
        +
        Empty bag. + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        BAG_SUBBAG

        +
        public static final Kind BAG_SUBBAG
        +
        Bag inclusion predicate. + + Determine if multiplicities of the first bag are less than or equal to + multiplicities of the second bag. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of bag Sort
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        BAG_DUPLICATE_REMOVAL

        +
        public static final Kind BAG_DUPLICATE_REMOVAL
        +
        Bag duplicate removal. + + Eliminate duplicates in a given bag. The returned bag contains exactly the + same elements in the given bag, but with multiplicity one. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bag Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_MAKE

        +
        public static final Kind BAG_MAKE
        +
        Bag make. + + Construct a bag with the given element and given multiplicity. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of any Sort (the bag element)
          • +
          • 2: Term of Sort Int (the multiplicity of the element)
          • + +
        • +
        + +
        +
      • +
      + + + + + + + +
        +
      • +

        BAG_CHOOSE

        +
        public static final Kind BAG_CHOOSE
        +
        Bag choose. + + Select an element from a given bag. + + + For a bag A = \{(x,n)\} where n is the multiplicity, then + the term (choose A) is equivalent to the term x. For an + empty bag, then it is an arbitrary value. For a bag that contains distinct + elements, it will deterministically return an element in A. + + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bag Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_IS_SINGLETON

        +
        public static final Kind BAG_IS_SINGLETON
        +
        Bag is singleton tester. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of bag Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_FROM_SET

        +
        public static final Kind BAG_FROM_SET
        +
        Conversion from set to bag. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of set Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        BAG_MAP

        +
        public static final Kind BAG_MAP
        +
        Bag map. + + + This operator applies the first argument, a function of + Sort (\rightarrow S_1 \; S_2), to every element of the second + argument, a set of Sort (Bag S_1), and returns a set of Sort + (Bag S_2). + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow S_1 \; S_2)
          • +
          • 2: Term of bag Sort (Bag S_1)
          • + + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_FILTER

        +
        public static final Kind BAG_FILTER
        +
        Bag filter. + + + This operator filters the elements of a bag. + (bag.filter p \; B) takes a predicate p of Sort + (\rightarrow T \; Bool) as a first argument, and a bag B + of Sort (Bag T) as a second argument, and returns a subbag of Sort + (Bag T) that includes all elements of B that satisfy + p with the same multiplicity. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow T \; Bool)
          • +
          • 2: Term of bag Sort (Bag T)
          • + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_FOLD

        +
        public static final Kind BAG_FOLD
        +
        Bag fold. + + + This operator combines elements of a bag into a single value. + (bag.fold f \; t \; B) folds the elements of bag B + starting with Term t and using the combining function f. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow S_1 \; S_2 \; S_2)
          • +
          • 2: Term of Sort S_2 (the initial value)
          • +
          • 3: Term of bag Sort (Bag S_1)
          • + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        BAG_PARTITION

        +
        public static final Kind BAG_PARTITION
        +
        Bag partition. + + + This operator partitions of a bag of elements into disjoint bags. + (bag.partition r \; B) partitions the elements of bag B + of type (Bag \; E) based on the equivalence relations r of + type (\rightarrow \; E \; E \; Bool). + It returns a bag of bags of type (Bag \; (Bag \; E)). + +
          +
        • Arity: 2 +
            + +
          • 1: Term of function Sort (\rightarrow \; E \; E \; Bool)
          • +
          • 2: Term of bag Sort (Bag E)
          • + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        TABLE_PRODUCT

        +
        public static final Kind TABLE_PRODUCT
        +
        Table cross product. + +
          +
        • Arity: 2 +
            + +
          • 1..2: Terms of table Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        TABLE_PROJECT

        +
        public static final Kind TABLE_PROJECT
        +
        Table projection operator extends tuple projection operator to tables. + +
          +
        • Arity: 1 +
            +
          • 1: Term of table Sort
          • + +
          • Indices: n
          • +
          • 1..n: Indices of the projection
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        TABLE_AGGREGATE

        +
        public static final Kind TABLE_AGGREGATE
        +
        Table aggregate operator has the form + ((\_ \; table.aggr \; n_1 ... n_k) \; f \; i \; A) + where n_1, ..., n_k are natural numbers, + f is a function of type + (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T), + i has the type T, + and A has type (Table \; T_1 \; ... \; T_j). + The returned type is (Bag \; T). + + This operator aggregates elements in A that have the same tuple projection + with indices n_1, ..., n_k using the combining function f, + and initial value i. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sort (\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)
          • +
          • 2: Term of Sort T
          • +
          • 3: Term of table sort Table T_1 ... T_j
          • + +
          • Indices: n
          • +
          • 1..n: Indices of the projection
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        TABLE_JOIN

        +
        public static final Kind TABLE_JOIN
        +
        Table join operator has the form + ((\_ \; table.join \; m_1 \; n_1 \; \dots \; m_k \; n_k) \; A \; B) + where m_1 \; n_1 \; \dots \; m_k \; n_k are natural numbers, + and A, B are tables. + This operator filters the product of two bags based on the equality of + projected tuples using indices m_1, \dots, m_k in table A, + and indices n_1, \dots, n_k in table B. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of table Sort
          • + +
          • 2: Term of table Sort
          • + +
          • Indices: n
          • +
          • 1..n: Indices of the projection
          • + + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + +
        +
      • +

        TABLE_GROUP

        +
        public static final Kind TABLE_GROUP
        +
        Table group + + + ((\_ \; table.group \; n_1 \; \dots \; n_k) \; A) partitions tuples + of table A such that tuples that have the same projection + with indices n_1 \; \dots \; n_k are in the same part. + It returns a bag of tables of type (Bag \; T) where + T is the type of A. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of table sort
          • + +
          • Indices: n
          • + +
          • 1..n: Indices of the projection
          • + + + +
        • +
        +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions.
        +
        +
      • +
      + + + + + + + + + + + + + + + +
        +
      • +

        STRING_SUBSTR

        +
        public static final Kind STRING_SUBSTR
        +
        String substring. + + + Extracts a substring, starting at index i and of length l, + from a string s. If the start index is negative, the start index + is greater than the length of the string, or the length is negative, the + result is the empty string. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String
          • +
          • 2: Term of Sort Int (index i)
          • +
          • 3: Term of Sort Int (length l)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_UPDATE

        +
        public static final Kind STRING_UPDATE
        +
        String update. + + + Updates a string s by replacing its context starting at an index + with string t. If the start index is negative, the start index is + greater than the length of the string, the result is s. Otherwise, + the length of the original string is preserved. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String
          • +
          • 2: Term of Sort Int (index i)
          • +
          • 3: Term of Sort Strong (replacement string t)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_CHARAT

        +
        public static final Kind STRING_CHARAT
        +
        String character at. + + + Returns the character at index i from a string s. If the + index is negative or the index is greater than the length of the string, + the result is the empty string. Otherwise the result is a string of + length 1. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (string s)
          • +
          • 2: Term of Sort Int (index i)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_CONTAINS

        +
        public static final Kind STRING_CONTAINS
        +
        String contains. + + + Determines whether a string s_1 contains another string + s_2. If s_2 is empty, the result is always true. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (the string s_1)
          • +
          • 2: Term of Sort String (the string s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_INDEXOF

        +
        public static final Kind STRING_INDEXOF
        +
        String index-of. + + + Returns the index of a substring s_2 in a string s_1 + starting at index i. If the index is negative or greater than the + length of string s_1 or the substring s_2 does not appear + in string s_1 after index i, the result is -1. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (substring s_1)
          • +
          • 2: Term of Sort String (substring s_2)
          • +
          • 3: Term of Sort Int (index i)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_INDEXOF_RE

        +
        public static final Kind STRING_INDEXOF_RE
        +
        String index-of regular expression match. + + + Returns the first match of a regular expression r in a + string s. If the index is negative or greater than the length of + string s_1, or r does not match a substring in s + after index i, the result is -1. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String (string s)
          • +
          • 2: Term of Sort RegLan (regular expression r)
          • +
          • 3: Term of Sort Int (index i)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_REPLACE

        +
        public static final Kind STRING_REPLACE
        +
        String replace. + + + Replaces a string s_2 in a string s_1 with string + s_3. If s_2 does not appear in s_1, s_1 is + returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String (string s_1)
          • +
          • 2: Term of Sort String (string s_2)
          • +
          • 3: Term of Sort String (string s_3)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_REPLACE_ALL

        +
        public static final Kind STRING_REPLACE_ALL
        +
        String replace all. + + + Replaces all occurrences of a string s_2 in a string s_1 + with string s_3. If s_2 does not appear in s_1, + s_1 is returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort String (s_2)
          • +
          • 3: Term of Sort String (s_3)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_REPLACE_RE

        +
        public static final Kind STRING_REPLACE_RE
        +
        String replace regular expression match. + + + Replaces the first match of a regular expression r in + string s_1 with string s_2. If r does not match a + substring of s_1, s_1 is returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort RegLan
          • +
          • 3: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_REPLACE_RE_ALL

        +
        public static final Kind STRING_REPLACE_RE_ALL
        +
        String replace all regular expression matches. + + + Replaces all matches of a regular expression r in string + s_1 with string s_2. If r does not match a + substring of s_1, string s_1 is returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort RegLan
          • +
          • 3: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + +
        +
      • +

        STRING_FROM_CODE

        +
        public static final Kind STRING_FROM_CODE
        +
        String from code. + + Returns a string containing a single character whose code point matches + the argument to this function, or the empty string if the argument is + out-of-bounds. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort Int
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_LT

        +
        public static final Kind STRING_LT
        +
        String less than. + + + Returns true if string s_1 is (strictly) less than s_2 + based on a lexiographic ordering over code points. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_LEQ

        +
        public static final Kind STRING_LEQ
        +
        String less than or equal. + + + Returns true if string s_1 is less than or equal to s_2 + based on a lexiographic ordering over code points. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_PREFIX

        +
        public static final Kind STRING_PREFIX
        +
        String prefix-of. + + + Determines whether a string s_1 is a prefix of string s_2. + If string s1 is empty, this operator returns true. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        STRING_SUFFIX

        +
        public static final Kind STRING_SUFFIX
        +
        String suffix-of. + + + Determines whether a string s_1 is a suffix of the second string. + If string s_1 is empty, this operator returns true. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (s_1)
          • +
          • 2: Term of Sort String (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        STRING_TO_INT

        +
        public static final Kind STRING_TO_INT
        +
        String to integer (total function). + + If the string does not contain an integer or the integer is negative, the + operator returns `-1`. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort Int
          • + +
        • +
        + +
        +
      • +
      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        +
      • +

        REGEXP_RANGE

        +
        public static final Kind REGEXP_RANGE
        +
        Regular expression range. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of Sort String (lower bound character for the range)
          • +
          • 2: Term of Sort String (upper bound character for the range)
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        REGEXP_REPEAT

        +
        public static final Kind REGEXP_REPEAT
        +
        Operator for regular expression repeat. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort RegLan
          • + +
          • Indices: 1
          • + +
          • 1: The number of repetitions
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        REGEXP_LOOP

        +
        public static final Kind REGEXP_LOOP
        +
        Regular expression loop. + + Regular expression loop from lower bound to upper bound number of + repetitions. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of Sort RegLan
          • + +
          • Indices: 1
          • + +
          • 1: The lower bound
          • +
          • 2: The upper bound
          • + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        REGEXP_NONE

        +
        public static final Kind REGEXP_NONE
        +
        Regular expression none. + +
        +
      • +
      + + + +
        +
      • +

        REGEXP_ALL

        +
        public static final Kind REGEXP_ALL
        +
        Regular expression all. + +
        +
      • +
      + + + +
        +
      • +

        REGEXP_ALLCHAR

        +
        public static final Kind REGEXP_ALLCHAR
        +
        Regular expression all characters. + +
        +
      • +
      + + + + + + + + + + + + + + + +
        +
      • +

        SEQ_EXTRACT

        +
        public static final Kind SEQ_EXTRACT
        +
        Sequence extract. + + + Extracts a subsequence, starting at index i and of length l, + from a sequence s. If the start index is negative, the start index + is greater than the length of the sequence, or the length is negative, the + result is the empty sequence. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sequence Sort
          • +
          • 2: Term of Sort Int (index i)
          • +
          • 3: Term of Sort Int (length l)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_UPDATE

        +
        public static final Kind SEQ_UPDATE
        +
        Sequence update. + + + Updates a sequence s by replacing its context starting at an index + with string t. If the start index is negative, the start index is + greater than the length of the sequence, the result is s. Otherwise, + the length of the original sequence is preserved. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sequence Sort
          • +
          • 2: Term of Sort Int (index i)
          • +
          • 3: Term of sequence Sort (replacement sequence t)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_AT

        +
        public static final Kind SEQ_AT
        +
        Sequence element at. + + + Returns the element at index i from a sequence s. If the index + is negative or the index is greater or equal to the length of the + sequence, the result is the empty sequence. Otherwise the result is a + sequence of length 1. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of sequence Sort
          • +
          • 2: Term of Sort Int (index i)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_CONTAINS

        +
        public static final Kind SEQ_CONTAINS
        +
        Sequence contains. + + + Checks whether a sequence s_1 contains another sequence + s_2. If s_2 is empty, the result is always true. + +
          +
        • Arity: 2 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_INDEXOF

        +
        public static final Kind SEQ_INDEXOF
        +
        Sequence index-of. + + + Returns the index of a subsequence s_2 in a sequence s_1 + starting at index i. If the index is negative or greater than the + length of sequence s_1 or the subsequence s_2 does not + appear in sequence s_1 after index i, the result is -1. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • +
          • 3: Term of Sort Int (i)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_REPLACE

        +
        public static final Kind SEQ_REPLACE
        +
        Sequence replace. + + + Replaces the first occurrence of a sequence s_2 in a + sequence s_1 with sequence s_3. If s_2 does not + appear in s_1, s_1 is returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • +
          • 3: Term of sequence Sort (s_3)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_REPLACE_ALL

        +
        public static final Kind SEQ_REPLACE_ALL
        +
        Sequence replace all. + + + Replaces all occurrences of a sequence s_2 in a sequence + s_1 with sequence s_3. If s_2 does not appear in + s_1, sequence s_1 is returned unmodified. + +
          +
        • Arity: 3 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • +
          • 3: Term of sequence Sort (s_3)
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + +
        +
      • +

        SEQ_PREFIX

        +
        public static final Kind SEQ_PREFIX
        +
        Sequence prefix-of. + + + Checks whether a sequence s_1 is a prefix of sequence s_2. + If sequence s_1 is empty, this operator returns true. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        SEQ_SUFFIX

        +
        public static final Kind SEQ_SUFFIX
        +
        Sequence suffix-of. + + + Checks whether a sequence s_1 is a suffix of sequence s_2. + If sequence s_1 is empty, this operator returns true. + +
          +
        • Arity: 1 +
            + +
          • 1: Term of sequence Sort (s_1)
          • +
          • 2: Term of sequence Sort (s_2)
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        CONST_SEQUENCE

        +
        public static final Kind CONST_SEQUENCE
        +
        Constant sequence. + + A constant sequence is a term that is equivalent to: + + .. code. smtlib + + (seq.++ (seq.unit c1) ... (seq.unit cn)) + + where n \leq 0 and c_1, ..., c_n are constants of some + sort. The elements can be extracted with Term.getSequenceValue(). + + +
        +
      • +
      + + + + + + + + + + + +
        +
      • +

        FORALL

        +
        public static final Kind FORALL
        +
        Universally quantified formula. + + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Kind VARIABLE_LIST
          • +
          • 2: Term of Sort Bool (the quantifier body)
          • +
          • 3: (optional) Term of Kind INST_PATTERN
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        EXISTS

        +
        public static final Kind EXISTS
        +
        Existentially quantified formula. + + +
          +
        • Arity: 3 +
            + +
          • 1: Term of Kind VARIABLE_LIST
          • +
          • 2: Term of Sort Bool (the quantifier body)
          • +
          • 3: (optional) Term of Kind INST_PATTERN
          • + + +
        • +
        + +
        +
      • +
      + + + + + + + +
        +
      • +

        INST_PATTERN

        +
        public static final Kind INST_PATTERN
        +
        Instantiation pattern. + + Specifies a (list of) terms to be used as a pattern for quantifier + instantiation. + +
          +
        • Arity: n > 0 +
            + +
          • 1..n: Terms of any Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        INST_NO_PATTERN

        +
        public static final Kind INST_NO_PATTERN
        +
        Instantiation no-pattern. + + Specifies a (list of) terms that should not be used as a pattern for + quantifier instantiation. + +
          +
        • Arity: n > 0 +
            + +
          • 1..n: Terms of any Sort
          • + +
        • +
        + +
        +
        +
        Note:
        +
        Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        INST_POOL

        +
        public static final Kind INST_POOL
        +
        Instantiation pool annotation. + + Specifies an annotation for pool based instantiation. + + In detail, pool symbols can be declared via the method + + A pool symbol represents a set of terms of a given sort. An instantiation + pool annotation should match the types of the quantified formula. + + For example, for a quantified formula: + + + .. code. lisp + + (FORALL (VARIABLE_LIST x y) F (INST_PATTERN_LIST (INST_POOL p q))) + + if x and y have Sorts S_1 and S_2, then + pool symbols p and q should have Sorts (Set S_1) + and (Set S_2), respectively. This annotation specifies that the + quantified formula above should be instantiated with the product of all + terms that occur in the sets p and q. + + +
          +
        • Arity: n > 0 +
            + +
          • 1..n: Terms that comprise the pools, which are one-to-one with the variables of the quantified formula to be instantiated
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions., Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        INST_ADD_TO_POOL

        +
        public static final Kind INST_ADD_TO_POOL
        +
        A instantantiation-add-to-pool annotation. + + An instantantiation-add-to-pool annotation indicates that when a quantified + formula is instantiated, the instantiated version of a term should be + added to the given pool. + + For example, consider a quantified formula: + + + .. code. lisp + + (FORALL (VARIABLE_LIST x) F + (INST_PATTERN_LIST (INST_ADD_TO_POOL (ADD x 1) p))) + + where assume that x has type Int. When this quantified formula is + instantiated with, e.g., the term t, the term (ADD t 1) is + added to pool p. + + +
          +
        • Arity: 2 +
            + +
          • 1: The Term whose free variables are bound by the quantified formula.
          • +
          • 2: The pool to add to, whose Sort should be a set of elements that match the Sort of the first argument.
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions., Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        SKOLEM_ADD_TO_POOL

        +
        public static final Kind SKOLEM_ADD_TO_POOL
        +
        A skolemization-add-to-pool annotation. + + An skolemization-add-to-pool annotation indicates that when a quantified + formula is skolemized, the skolemized version of a term should be added to + the given pool. + + For example, consider a quantified formula: + + + .. code. lisp + + (FORALL (VARIABLE_LIST x) F + (INST_PATTERN_LIST (SKOLEM_ADD_TO_POOL (ADD x 1) p))) + + where assume that x has type Int. When this quantified formula is + skolemized, e.g., with k of type Int, then the term (ADD k 1) + is added to the pool p. + + +
          +
        • Arity: 2 +
            + +
          • 1: The Term whose free variables are bound by the quantified formula.
          • +
          • 2: The pool to add to, whose Sort should be a set of elements that match the Sort of the first argument.
          • + +
        • +
        + +
        +
        +
        Note:
        +
        This kind is experimental and may be changed or removed in + future versions., Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        INST_ATTRIBUTE

        +
        public static final Kind INST_ATTRIBUTE
        +
        Instantiation attribute. + + Specifies a custom property for a quantified formula given by a + term that is ascribed a user attribute. + +
          +
        • Arity: n > 0 +
            + +
          • 1: Term of Kind CONST_STRING (the keyword of the attribute)
          • +
          • 2...n: Terms representing the values of the attribute
          • + +
        • +
        + +
        +
        +
        Note:
        +
        Should only be used as a child of + INST_PATTERN_LIST.
        +
        +
      • +
      + + + +
        +
      • +

        INST_PATTERN_LIST

        +
        public static final Kind INST_PATTERN_LIST
        +
        A list of instantiation patterns, attributes or annotations. + + +
          +
        • Arity: n > 1 +
            + +
          • 1..n: Terms of Kind INST_PATTERN, INST_NO_PATTERN, INST_POOL, INST_ADD_TO_POOL, SKOLEM_ADD_TO_POOL, INST_ATTRIBUTE
          • + + +
        • +
        + +
        +
      • +
      + + + +
        +
      • +

        LAST_KIND

        +
        public static final Kind LAST_KIND
        +
        Marks the upper-bound of this enumeration.
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static Kind[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (Kind c : Kind.values())
        +    System.out.println(c);
        +
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
      • +
      + + + +
        +
      • +

        valueOf

        +
        public static Kind valueOf​(java.lang.String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        java.lang.IllegalArgumentException - if this enum type has no constant with the specified name
        +
        java.lang.NullPointerException - if the argument is null
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getValue

        +
        public int getValue()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Op.html b/cvc5-1.0.2/api/java/io/github/cvc5/Op.html new file mode 100644 index 0000000..16d1552 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Op.html @@ -0,0 +1,511 @@ + + + + + +Op + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Op

+
+
+ +
+
    +
  • +
    +
    public class Op
    +extends java.lang.Object
    +
    A cvc5 operator. + + An operator is a term that represents certain operators, instantiated + with its required parameters, e.g., a Term of kind + Kind.BITVECTOR_EXTRACT.
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object t)
        +
        Syntactic equality operator.
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        Parameters:
        +
        t - The operator to compare to for equality.
        +
        Returns:
        +
        True if the operators are syntactically identical.
        +
        Note:
        +
        Both operators must belong to the same solver object.
        +
        +
      • +
      + + + +
        +
      • +

        getKind

        +
        public Kind getKind()
        +
        +
        Returns:
        +
        The kind of this operator.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if this operator is a null term.
        +
        +
      • +
      + + + +
        +
      • +

        isIndexed

        +
        public boolean isIndexed()
        +
        +
        Returns:
        +
        True iff this operator is indexed.
        +
        +
      • +
      + + + +
        +
      • +

        getNumIndices

        +
        public int getNumIndices()
        +
        +
        Returns:
        +
        The number of indices of this op.
        +
        +
      • +
      + + + +
        +
      • +

        get

        +
        public Term get​(int i)
        +         throws CVC5ApiException
        +
        Get the index at position i.
        +
        +
        Parameters:
        +
        i - The position of the index to return.
        +
        Returns:
        +
        The index at position i.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this operator.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.BaseInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.BaseInfo.html new file mode 100644 index 0000000..c5c175f --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.BaseInfo.html @@ -0,0 +1,272 @@ + + + + + +OptionInfo.BaseInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo.BaseInfo

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      BaseInfo() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        BaseInfo

        +
        public BaseInfo()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ModeInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ModeInfo.html new file mode 100644 index 0000000..9e13ebd --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ModeInfo.html @@ -0,0 +1,326 @@ + + + + + +OptionInfo.ModeInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo.ModeInfo

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ModeInfo​(java.lang.String defaultValue, + java.lang.String currentValue, + java.lang.String[] modes) 
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ModeInfo

        +
        public ModeInfo​(java.lang.String defaultValue,
        +                java.lang.String currentValue,
        +                java.lang.String[] modes)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getModes

        +
        public java.lang.String[] getModes()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.NumberInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.NumberInfo.html new file mode 100644 index 0000000..5b6a39e --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.NumberInfo.html @@ -0,0 +1,345 @@ + + + + + +OptionInfo.NumberInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo.NumberInfo<T>

+
+
+ +
+
    +
  • +
    +
    Enclosing class:
    +
    OptionInfo
    +
    +
    +
    public class OptionInfo.NumberInfo<T>
    +extends OptionInfo.ValueInfo<T>
    +
    Default value, current value, minimum and maximum of a numeric value
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + + + +
        +
      • +

        NumberInfo

        +
        public NumberInfo​(T defaultValue,
        +                  T currentValue,
        +                  T minimum,
        +                  T maximum)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getMinimum

        +
        public T getMinimum()
        +
      • +
      + + + +
        +
      • +

        getMaximum

        +
        public T getMaximum()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ValueInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ValueInfo.html new file mode 100644 index 0000000..08fbbfa --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.ValueInfo.html @@ -0,0 +1,333 @@ + + + + + +OptionInfo.ValueInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo.ValueInfo<T>

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ValueInfo​(T defaultValue, + T currentValue) 
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + + + +
        +
      • +

        ValueInfo

        +
        public ValueInfo​(T defaultValue,
        +                 T currentValue)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getDefaultValue

        +
        public T getDefaultValue()
        +
      • +
      + + + +
        +
      • +

        getCurrentValue

        +
        public T getCurrentValue()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.VoidInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.VoidInfo.html new file mode 100644 index 0000000..cc47ed0 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.VoidInfo.html @@ -0,0 +1,273 @@ + + + + + +OptionInfo.VoidInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo.VoidInfo

+
+
+ +
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      VoidInfo() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        VoidInfo

        +
        public VoidInfo()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.html b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.html new file mode 100644 index 0000000..89de92d --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/OptionInfo.html @@ -0,0 +1,584 @@ + + + + + +OptionInfo + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class OptionInfo

+
+
+ +
+
    +
  • +
    +
    public class OptionInfo
    +extends java.lang.Object
    +
    Holds some description about a particular option, including its name, its + aliases, whether the option was explicitly set by the user, and information + concerning its value. The valueInfo member holds any of the following + alternatives: +
      +
    • + OptionInfo.VoidInfo if the option holds no value (or the value + has no native type) +
    • +
    • + OptionInfo.ValueInfo if the option is of type boolean or String, + holds the current value and the default value. +
    • +
    • + OptionInfo.NumberInfo if the option is of type BigInteger or + double, holds the current and default value, as well as the minimum and + maximum. +
    • +
    • + OptionInfo.ModeInfo if the option is a mode option, holds the + current and default values, as well as a list of valid modes. +
    • +
    + + Additionally, this class provides convenience functions to obtain the + current value of an option in a type-safe manner using + booleanValue(), stringValue(), + intValue(), and doubleValue(). + They assert that the option has the respective type and return the current + value.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this OptionInfo.
        +
        +
      • +
      + + + +
        +
      • +

        getName

        +
        public java.lang.String getName()
        +
      • +
      + + + +
        +
      • +

        getAliases

        +
        public java.lang.String[] getAliases()
        +
      • +
      + + + +
        +
      • +

        getSetByUser

        +
        public boolean getSetByUser()
        +
      • +
      + + + + + + + +
        +
      • +

        booleanValue

        +
        public boolean booleanValue()
        +
        Obtain the current value as a boolean. Asserts that valueInfo holds a boolean.
        +
      • +
      + + + +
        +
      • +

        stringValue

        +
        public java.lang.String stringValue()
        +
        Obtain the current value as a string. Asserts that valueInfo holds a + string.
        +
      • +
      + + + +
        +
      • +

        intValue

        +
        public java.math.BigInteger intValue()
        +
        Obtain the current value as as int. Asserts that valueInfo holds an int.
        +
      • +
      + + + +
        +
      • +

        doubleValue

        +
        public double doubleValue()
        +
        Obtain the current value as a double. Asserts that valueInfo holds a + double.
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Pair.html b/cvc5-1.0.2/api/java/io/github/cvc5/Pair.html new file mode 100644 index 0000000..0204d41 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Pair.html @@ -0,0 +1,365 @@ + + + + + +Pair + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Pair<K,​V>

+
+
+ +
+
    +
  • +
    +
    public class Pair<K,​V>
    +extends java.lang.Object
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      Kfirst 
      Vsecond 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      Pair​(K first, + V second) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanequals​(java.lang.Object pair) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        first

        +
        public K first
        +
      • +
      + + + +
        +
      • +

        second

        +
        public V second
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + + + +
        +
      • +

        Pair

        +
        public Pair​(K first,
        +            V second)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object pair)
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Result.html b/cvc5-1.0.2/api/java/io/github/cvc5/Result.html new file mode 100644 index 0000000..92c0923 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Result.html @@ -0,0 +1,501 @@ + + + + + +Result + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Result

+
+
+ +
+
    +
  • +
    +
    public class Result
    +extends java.lang.Object
    +
    Encapsulation of a three-valued solver result, with explanations.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if Result is empty, i.e., a nullary Result, and not an actual + result returned from a checkSat() (and friends) query.
        +
        +
      • +
      + + + +
        +
      • +

        isSat

        +
        public boolean isSat()
        +
        +
        Returns:
        +
        True if query was a satisfiable checkSat() or checkSatAssuming() + query.
        +
        +
      • +
      + + + +
        +
      • +

        isUnsat

        +
        public boolean isUnsat()
        +
        +
        Returns:
        +
        True if query was an unsatisfiable checkSat() or + checkSatAssuming() query.
        +
        +
      • +
      + + + +
        +
      • +

        isUnknown

        +
        public boolean isUnknown()
        +
        +
        Returns:
        +
        True if query was a checkSat() or checkSatAssuming() query and + cvc5 was not able to determine (un)satisfiability.
        +
        +
      • +
      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object r)
        +
        Operator overloading for equality of two results.
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        Parameters:
        +
        r - the result to compare to for equality
        +
        Returns:
        +
        True if the results are equal
        +
        +
      • +
      + + + +
        +
      • +

        getUnknownExplanation

        +
        public UnknownExplanation getUnknownExplanation()
        +
        +
        Returns:
        +
        An explanation for an unknown query result.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this result.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/RoundingMode.html b/cvc5-1.0.2/api/java/io/github/cvc5/RoundingMode.html new file mode 100644 index 0000000..e8d06d7 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/RoundingMode.html @@ -0,0 +1,477 @@ + + + + + +RoundingMode + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Enum RoundingMode

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.io.Serializable, java.lang.Comparable<RoundingMode>
    +
    +
    +
    public enum RoundingMode
    +extends java.lang.Enum<RoundingMode>
    +
  • +
+
+
+
    +
  • + +
    + +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Static Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static RoundingModefromInt​(int value) 
      intgetValue() 
      static RoundingModevalueOf​(java.lang.String name) +
      Returns the enum constant of this type with the specified name.
      +
      static RoundingMode[]values() +
      Returns an array containing the constants of this enum type, in +the order they are declared.
      +
      +
        +
      • + + +

        Methods inherited from class java.lang.Enum

        +clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf
      • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +getClass, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Detail

      + + + +
        +
      • +

        ROUND_NEAREST_TIES_TO_EVEN

        +
        public static final RoundingMode ROUND_NEAREST_TIES_TO_EVEN
        +
        Round to the nearest even number. + + If the two nearest floating-point numbers bracketing an unrepresentable + infinitely precise result are equally near, the one with an even least + significant digit will be delivered.
        +
      • +
      + + + +
        +
      • +

        ROUND_TOWARD_POSITIVE

        +
        public static final RoundingMode ROUND_TOWARD_POSITIVE
        +
        Round towards positive infinity (SMT-LIB: +oo). + + The result shall be the format's floating-point number (possibly +oo) + closest to and no less than the infinitely precise result.
        +
      • +
      + + + +
        +
      • +

        ROUND_TOWARD_NEGATIVE

        +
        public static final RoundingMode ROUND_TOWARD_NEGATIVE
        +
        Round towards negative infinity (-oo). + + The result shall be the format's floating-point number (possibly -oo) + closest to and no less than the infinitely precise result.
        +
      • +
      + + + +
        +
      • +

        ROUND_TOWARD_ZERO

        +
        public static final RoundingMode ROUND_TOWARD_ZERO
        +
        Round towards zero. + + The result shall be the format's floating-point number closest to and no + greater in magnitude than the infinitely precise result.
        +
      • +
      + + + +
        +
      • +

        ROUND_NEAREST_TIES_TO_AWAY

        +
        public static final RoundingMode ROUND_NEAREST_TIES_TO_AWAY
        +
        Round to the nearest number away from zero. + + If the two nearest floating-point numbers bracketing an unrepresentable + infinitely precise result are equally near, the one with larger magnitude + will be selected.
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static RoundingMode[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (RoundingMode c : RoundingMode.values())
        +    System.out.println(c);
        +
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
      • +
      + + + +
        +
      • +

        valueOf

        +
        public static RoundingMode valueOf​(java.lang.String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        java.lang.IllegalArgumentException - if this enum type has no constant with the specified name
        +
        java.lang.NullPointerException - if the argument is null
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getValue

        +
        public int getValue()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Solver.html b/cvc5-1.0.2/api/java/io/github/cvc5/Solver.html new file mode 100644 index 0000000..f6b8b57 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Solver.html @@ -0,0 +1,4963 @@ + + + + + +Solver + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Solver

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.AutoCloseable
    +
    +
    +
    public class Solver
    +extends java.lang.Object
    +implements java.lang.AutoCloseable
    +
    A cvc5 solver.
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      Solver() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      voidaddSygusAssume​(Term term) +
      Add a forumla to the set of Sygus assumptions.
      +
      voidaddSygusConstraint​(Term term) +
      Add a forumla to the set of Sygus constraints.
      +
      voidaddSygusInvConstraint​(Term inv, + Term pre, + Term trans, + Term post) +
      Add a set of Sygus constraints to the current state that correspond to an + invariant synthesis problem.
      +
      voidassertFormula​(Term term) +
      Assert a formula.
      +
      voidblockModel​(io.github.cvc5.modes.BlockModelsMode mode) +
      Block the current model.
      +
      voidblockModelValues​(Term[] terms) +
      Block the current model values of (at least) the values in terms.
      +
      ResultcheckSat() +
      Check satisfiability.
      +
      ResultcheckSatAssuming​(Term assumption) +
      Check satisfiability assuming the given formula.
      +
      ResultcheckSatAssuming​(Term[] assumptions) +
      Check satisfiability assuming the given formulas.
      +
      SynthResultcheckSynth() +
      Try to find a solution for the synthesis conjecture corresponding to the + current list of functions-to-synthesize, universal variables and + constraints.
      +
      SynthResultcheckSynthNext() +
      Try to find a next solution for the synthesis conjecture corresponding to + the current list of functions-to-synthesize, universal variables and + constraints.
      +
      voidclose() 
      SortdeclareDatatype​(java.lang.String symbol, + DatatypeConstructorDecl[] ctors) +
      Create datatype sort.
      +
      TermdeclareFun​(java.lang.String symbol, + Sort[] sorts, + Sort sort) +
      Declare n-ary function symbol.
      +
      TermdeclareOracleFun​(java.lang.String symbol, + Sort[] sorts, + Sort sort, + IOracle oracle) +
      Declare an oracle function with reference to an implementation.
      +
      TermdeclarePool​(java.lang.String symbol, + Sort sort, + Term[] initValue) +
      Declare a symbolic pool of terms with the given initial value.
      +
      voiddeclareSepHeap​(Sort locSort, + Sort dataSort) +
      When using separation logic, this sets the location sort and the + datatype sort to the given ones.
      +
      SortdeclareSort​(java.lang.String symbol, + int arity) +
      Declare uninterpreted sort.
      +
      TermdeclareSygusVar​(java.lang.String symbol, + Sort sort) +
      Append symbol to the current list of universal variables.
      +
      TermdefineFun​(java.lang.String symbol, + Term[] boundVars, + Sort sort, + Term term) +
      Define n-ary function in the current context.
      +
      TermdefineFun​(java.lang.String symbol, + Term[] boundVars, + Sort sort, + Term term, + boolean global) +
      Define n-ary function.
      +
      TermdefineFunRec​(Term fun, + Term[] boundVars, + Term term) +
      Define recursive function in the current context.
      +
      TermdefineFunRec​(Term fun, + Term[] boundVars, + Term term, + boolean global) +
      Define recursive function.
      +
      TermdefineFunRec​(java.lang.String symbol, + Term[] boundVars, + Sort sort, + Term term) +
      Define recursive function in the current context.
      +
      TermdefineFunRec​(java.lang.String symbol, + Term[] boundVars, + Sort sort, + Term term, + boolean global) +
      Define recursive function.
      +
      voiddefineFunsRec​(Term[] funs, + Term[][] boundVars, + Term[] terms) +
      Define recursive functions in the current context.
      +
      voiddefineFunsRec​(Term[] funs, + Term[][] boundVars, + Term[] terms, + boolean global) +
      Define recursive functions.
      +
      voiddeletePointer() 
      TermgetAbduct​(Term conj) +
      Get an abduct.
      +
      TermgetAbduct​(Term conj, + Grammar grammar) +
      Get an abduct.
      +
      TermgetAbductNext() +
      Get the next abduct.
      +
      Term[]getAssertions() +
      Get the list of asserted formulas.
      +
      SortgetBooleanSort() 
      java.util.Map<Term,​Term>getDifficulty() +
      Get a difficulty estimate for an asserted formula.
      +
      java.lang.StringgetInfo​(java.lang.String flag) +
      Get info from the solver.
      +
      java.lang.StringgetInstantiations() +
      Return a string that contains information about all instantiations made by + the quantifiers module.
      +
      SortgetIntegerSort() 
      longgetIntegerSort​(long pointer) 
      TermgetInterpolant​(Term conj) +
      Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
      +
      TermgetInterpolant​(Term conj, + Grammar grammar) +
      Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> <g> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
      +
      TermgetInterpolantNext() +
      Get the next interpolant.
      +
      Term[]getLearnedLiterals() +
      Get a list of input literals that are entailed by the current set of + assertions.
      +
      Term[]getLearnedLiterals​(io.github.cvc5.modes.LearnedLitType type) +
      Get a list of literals that are entailed by the current set of assertions.
      +
      java.lang.StringgetModel​(Sort[] sorts, + Term[] vars) +
      Get the model + + SMT-LIB: + + ( get-model ) + + + Requires to enable option produce-models.
      +
      Term[]getModelDomainElements​(Sort s) +
      Get the domain elements of uninterpreted sort s in the current model.
      +
      DatatypeDeclgetNullDatatypeDecl() 
      OpgetNullOp() 
      ResultgetNullResult() 
      SortgetNullSort() 
      SynthResultgetNullSynthResult() 
      TermgetNullTerm() 
      java.lang.StringgetOption​(java.lang.String option) +
      Get the value of a given option.
      +
      OptionInfogetOptionInfo​(java.lang.String option) +
      Get some information about the given option.
      +
      java.lang.String[]getOptionNames() +
      Get all option names that can be used with + setOption(String, String), + getOption(String) and + getOptionInfo(String).
      +
      longgetPointer() 
      java.lang.StringgetProof() +
      Get refutation proof for the most recent call to checkSat.
      +
      java.lang.StringgetProof​(io.github.cvc5.modes.ProofComponent c) +
      Get a proof associated with the most recent call to checkSat.
      +
      TermgetQuantifierElimination​(Term q) +
      Do quantifier elimination.
      +
      TermgetQuantifierEliminationDisjunct​(Term q) +
      Do partial quantifier elimination, which can be used for incrementally + computing the result of a quantifier elimination.
      +
      SortgetRealSort() 
      SortgetRegExpSort() 
      SortgetRoundingModeSort() 
      StatisticsgetStatistics() +
      Returns a snapshot of the current state of the statistic values of this + solver.
      +
      SortgetStringSort() 
      TermgetSynthSolution​(Term term) +
      Get the synthesis solution of the given term.
      +
      Term[]getSynthSolutions​(Term[] terms) +
      Get the synthesis solutions of the given terms.
      +
      Term[]getUnsatAssumptions() +
      Get the set of unsat ("failed") assumptions.
      +
      Term[]getUnsatCore() +
      Get the unsatisfiable core.
      +
      TermgetValue​(Term term) +
      Get the value of the given term in the current model.
      +
      Term[]getValue​(Term[] terms) +
      Get the values of the given terms in the current model.
      +
      TermgetValueSepHeap() +
      When using separation logic, obtain the term for the heap.
      +
      TermgetValueSepNil() +
      When using separation logic, obtain the term for nil.
      +
      booleanisModelCoreSymbol​(Term v) +
      This returns false if the model value of free constant v was not + essential for showing the satisfiability of the last call to + checkSat() using the current model.
      +
      SortmkArraySort​(Sort indexSort, + Sort elemSort) +
      Create an array sort.
      +
      SortmkBagSort​(Sort elemSort) +
      Create a bag sort.
      +
      TermmkBitVector​(int size) +
      Create a bit-vector constant of given size and value = 0.
      +
      TermmkBitVector​(int size, + long val) +
      Create a bit-vector constant of given size and value.
      +
      TermmkBitVector​(int size, + java.lang.String s, + int base) +
      Create a bit-vector constant of a given bit-width from a given string of + base 2, 10 or 16.
      +
      SortmkBitVectorSort​(int size) +
      Create a bit-vector sort.
      +
      TermmkBoolean​(boolean val) +
      Create a Boolean constant.
      +
      TermmkCardinalityConstraint​(Sort sort, + int upperBound) +
      Create a cardinality constraint for an uninterpreted sort.
      +
      TermmkConst​(Sort sort) +
      Create a free constant with a default symbol name.
      +
      TermmkConst​(Sort sort, + java.lang.String symbol) +
      Create a free constant.
      +
      TermmkConstArray​(Sort sort, + Term val) +
      Create a constant array with the provided constant value stored at + every index
      +
      DatatypeConstructorDeclmkDatatypeConstructorDecl​(java.lang.String name) +
      Create a datatype constructor declaration.
      +
      DatatypeDeclmkDatatypeDecl​(java.lang.String name) +
      Create a datatype declaration.
      +
      DatatypeDeclmkDatatypeDecl​(java.lang.String name, + boolean isCoDatatype) +
      Create a datatype declaration.
      +
      DatatypeDeclmkDatatypeDecl​(java.lang.String name, + Sort[] params) +
      Create a datatype declaration.
      +
      DatatypeDeclmkDatatypeDecl​(java.lang.String name, + Sort[] params, + boolean isCoDatatype) +
      Create a datatype declaration.
      +
      SortmkDatatypeSort​(DatatypeDecl dtypedecl) +
      Create a datatype sort.
      +
      Sort[]mkDatatypeSorts​(DatatypeDecl[] dtypedecls) +
      Create a vector of datatype sorts.
      +
      TermmkEmptyBag​(Sort sort) +
      Create a constant representing an empty bag of the given sort.
      +
      TermmkEmptySequence​(Sort sort) +
      Create an empty sequence of the given element sort.
      +
      TermmkEmptySet​(Sort sort) +
      Create a constant representing an empty set of the given sort.
      +
      TermmkFalse() +
      Create a Boolean false constant.
      +
      TermmkFloatingPoint​(int exp, + int sig, + Term val) +
      Create a floating-point constant.
      +
      TermmkFloatingPointNaN​(int exp, + int sig) +
      Create a not-a-number floating-point constant (SMT-LIB: NaN).
      +
      TermmkFloatingPointNegInf​(int exp, + int sig) +
      Create a negative infinity floating-point constant (SMT-LIB: -oo).
      +
      TermmkFloatingPointNegZero​(int exp, + int sig) +
      Create a negative zero floating-point constant (SMT-LIB: -zero).
      +
      TermmkFloatingPointPosInf​(int exp, + int sig) +
      Create a positive infinity floating-point constant (SMT-LIB: +oo).
      +
      TermmkFloatingPointPosZero​(int exp, + int sig) +
      Create a positive zero floating-point constant (SMT-LIB: +zero).
      +
      SortmkFloatingPointSort​(int exp, + int sig) +
      Create a floating-point sort.
      +
      SortmkFunctionSort​(Sort[] sorts, + Sort codomain) +
      Create function sort.
      +
      SortmkFunctionSort​(Sort domain, + Sort codomain) +
      Create function sort.
      +
      GrammarmkGrammar​(Term[] boundVars, + Term[] ntSymbols) +
      Create a Sygus grammar.
      +
      TermmkInteger​(long val) +
      Create an integer constant from a C++ int.
      +
      TermmkInteger​(java.lang.String s) +
      Create an integer constant from a string.
      +
      OpmkOp​(Kind kind) +
      Create an operator for a builtin Kind + The Kind may not be the Kind for an indexed operator + (e.g., Kind.BITVECTOR_EXTRACT).
      +
      OpmkOp​(Kind kind, + int arg) +
      Create operator of kind: + + DIVISIBLE + BITVECTOR_REPEAT + BITVECTOR_ZERO_EXTEND + BITVECTOR_SIGN_EXTEND + BITVECTOR_ROTATE_LEFT + BITVECTOR_ROTATE_RIGHT + INT_TO_BITVECTOR + FLOATINGPOINT_TO_UBV + FLOATINGPOINT_TO_UBV_TOTAL + FLOATINGPOINT_TO_SBV + FLOATINGPOINT_TO_SBV_TOTAL + TUPLE_UPDATE + + See enum Kind for a description of the parameters.
      +
      OpmkOp​(Kind kind, + int[] args) +
      Create operator of Kind: + + TUPLE_PROJECT + + See enum Kind for a description of the parameters.
      +
      OpmkOp​(Kind kind, + int arg1, + int arg2) +
      Create operator of Kind: + + BITVECTOR_EXTRACT + FLOATINGPOINT_TO_FP_FROM_IEEE_BV + FLOATINGPOINT_TO_FP_FROM_FP + FLOATINGPOINT_TO_FP_FROM_REAL + FLOATINGPOINT_TO_FP_FROM_SBV + FLOATINGPOINT_TO_FP_FROM_UBV + + See enum Kind for a description of the parameters.
      +
      OpmkOp​(Kind kind, + java.lang.String arg) +
      Create operator of kind: + + + Kind.DIVISIBLE (to support arbitrary precision integers) + + + See enum Kind for a description of the parameters.
      +
      SortmkParamSort() +
      Create a sort parameter.
      +
      SortmkParamSort​(java.lang.String symbol) +
      Create a sort parameter.
      +
      TermmkPi() +
      Create a constant representing the number Pi.
      +
      SortmkPredicateSort​(Sort[] sorts) +
      Create a predicate sort.
      +
      TermmkReal​(long val) +
      Create a real constant from an integer.
      +
      TermmkReal​(long num, + long den) +
      Create a real constant from a rational.
      +
      TermmkReal​(java.lang.String s) +
      Create a real constant from a string.
      +
      SortmkRecordSort​(Pair<java.lang.String,​Sort>[] fields) +
      Create a record sort
      +
      TermmkRegexpAll() +
      Create a regular expression all (re.all) term.
      +
      TermmkRegexpAllchar() +
      Create a regular expression allchar (re.allchar) term.
      +
      TermmkRegexpNone() +
      Create a regular expression none (re.none) term.
      +
      TermmkRoundingMode​(RoundingMode rm) +
      Create a rounding mode constant.
      +
      TermmkSepEmp() +
      Create a separation logic empty term.
      +
      TermmkSepNil​(Sort sort) +
      Create a separation logic nil term.
      +
      SortmkSequenceSort​(Sort elemSort) +
      Create a sequence sort.
      +
      SortmkSetSort​(Sort elemSort) +
      Create a set sort.
      +
      TermmkString​(int[] s) +
      Create a String constant.
      +
      TermmkString​(java.lang.String s) +
      Create a String constant.
      +
      TermmkString​(java.lang.String s, + boolean useEscSequences) +
      Create a String constant.
      +
      TermmkTerm​(Kind kind) +
      Create 0-ary term of given kind.
      +
      TermmkTerm​(Kind kind, + Term child) +
      Create a unary term of given kind.
      +
      TermmkTerm​(Kind kind, + Term[] children) +
      Create n-ary term of given kind.
      +
      TermmkTerm​(Kind kind, + Term child1, + Term child2) +
      Create binary term of given kind.
      +
      TermmkTerm​(Kind kind, + Term child1, + Term child2, + Term child3) +
      Create ternary term of given kind.
      +
      TermmkTerm​(Op op) +
      Create nullary term of given kind from a given operator.
      +
      TermmkTerm​(Op op, + Term child) +
      Create unary term of given kind from a given operator.
      +
      TermmkTerm​(Op op, + Term[] children) +
      Create n-ary term of given kind from a given operator.
      +
      TermmkTerm​(Op op, + Term child1, + Term child2) +
      Create binary term of given kind from a given operator.
      +
      TermmkTerm​(Op op, + Term child1, + Term child2, + Term child3) +
      Create ternary term of given kind from a given operator.
      +
      TermmkTrue() +
      Create a Boolean true constant.
      +
      TermmkTuple​(Sort[] sorts, + Term[] terms) +
      Create a tuple term.
      +
      SortmkTupleSort​(Sort[] sorts) +
      Create a tuple sort.
      +
      SortmkUninterpretedSort() +
      Create an uninterpreted sort.
      +
      SortmkUninterpretedSort​(java.lang.String symbol) +
      Create an uninterpreted sort.
      +
      SortmkUninterpretedSortConstructorSort​(int arity) +
      Create a sort constructor sort.
      +
      SortmkUninterpretedSortConstructorSort​(int arity, + java.lang.String symbol) +
      Create a sort constructor sort.
      +
      TermmkUniverseSet​(Sort sort) +
      Create a universe set of the given sort.
      +
      SortmkUnresolvedDatatypeSort​(java.lang.String symbol) +
      Create an unresolved datatype sort.
      +
      SortmkUnresolvedDatatypeSort​(java.lang.String symbol, + int arity) +
      Create an unresolved datatype sort.
      +
      TermmkVar​(Sort sort) +
      Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
      +
      TermmkVar​(Sort sort, + java.lang.String symbol) +
      Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
      +
      voidpop() +
      Pop a level from the assertion stack.
      +
      voidpop​(int nscopes) +
      Pop (a) level(s) from the assertion stack.
      +
      voidpush() +
      Push a level to the assertion stack.
      +
      voidpush​(int nscopes) +
      Push (a) level(s) to the assertion stack.
      +
      voidresetAssertions() +
      Remove all assertions.
      +
      voidsetInfo​(java.lang.String keyword, + java.lang.String value) +
      Set info.
      +
      voidsetLogic​(java.lang.String logic) +
      Set logic.
      +
      voidsetOption​(java.lang.String option, + java.lang.String value) +
      Set option.
      +
      Termsimplify​(Term t) +
      Simplify a formula without doing "much" work.
      +
      TermsynthFun​(java.lang.String symbol, + Term[] boundVars, + Sort sort) +
      Synthesize n-ary function.
      +
      TermsynthFun​(java.lang.String symbol, + Term[] boundVars, + Sort sort, + Grammar grammar) +
      Synthesize n-ary function following specified syntactic constraints.
      +
      TermsynthInv​(java.lang.String symbol, + Term[] boundVars) +
      Synthesize invariant.
      +
      TermsynthInv​(java.lang.String symbol, + Term[] boundVars, + Grammar grammar) +
      Synthesize invariant following specified syntactic constraints.
      +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        Solver

        +
        public Solver()
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        deletePointer

        +
        public void deletePointer()
        +
      • +
      + + + +
        +
      • +

        close

        +
        public void close()
        +
        +
        Specified by:
        +
        close in interface java.lang.AutoCloseable
        +
        +
      • +
      + + + +
        +
      • +

        getNullSort

        +
        public Sort getNullSort()
        +
        +
        Returns:
        +
        Sort null.
        +
        +
      • +
      + + + +
        +
      • +

        getBooleanSort

        +
        public Sort getBooleanSort()
        +
        +
        Returns:
        +
        Sort Boolean.
        +
        +
      • +
      + + + +
        +
      • +

        getIntegerSort

        +
        public Sort getIntegerSort()
        +
        +
        Returns:
        +
        Sort Integer.
        +
        +
      • +
      + + + +
        +
      • +

        getIntegerSort

        +
        public long getIntegerSort​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getRealSort

        +
        public Sort getRealSort()
        +
        +
        Returns:
        +
        Sort Real.
        +
        +
      • +
      + + + +
        +
      • +

        getRegExpSort

        +
        public Sort getRegExpSort()
        +
        +
        Returns:
        +
        Sort RegExp.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getStringSort

        +
        public Sort getStringSort()
        +
        +
        Returns:
        +
        Sort String.
        +
        +
      • +
      + + + +
        +
      • +

        mkArraySort

        +
        public Sort mkArraySort​(Sort indexSort,
        +                        Sort elemSort)
        +
        Create an array sort.
        +
        +
        Parameters:
        +
        indexSort - The array index sort.
        +
        elemSort - The array element sort.
        +
        Returns:
        +
        The array sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkBitVectorSort

        +
        public Sort mkBitVectorSort​(int size)
        +                     throws CVC5ApiException
        +
        Create a bit-vector sort.
        +
        +
        Parameters:
        +
        size - The bit-width of the bit-vector sort.
        +
        Returns:
        +
        The bit-vector sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointSort

        +
        public Sort mkFloatingPointSort​(int exp,
        +                                int sig)
        +                         throws CVC5ApiException
        +
        Create a floating-point sort.
        +
        +
        Parameters:
        +
        exp - The bit-width of the exponent of the floating-point sort.
        +
        sig - The bit-width of the significand of the floating-point sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeSort

        +
        public Sort mkDatatypeSort​(DatatypeDecl dtypedecl)
        +                    throws CVC5ApiException
        +
        Create a datatype sort.
        +
        +
        Parameters:
        +
        dtypedecl - The datatype declaration from which the sort is created.
        +
        Returns:
        +
        The datatype sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeSorts

        +
        public Sort[] mkDatatypeSorts​(DatatypeDecl[] dtypedecls)
        +                       throws CVC5ApiException
        +
        Create a vector of datatype sorts. + + The names of the datatype declarations must be distinct.
        +
        +
        Parameters:
        +
        dtypedecls - The datatype declarations from which the sort is created.
        +
        Returns:
        +
        The datatype sorts.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFunctionSort

        +
        public Sort mkFunctionSort​(Sort domain,
        +                           Sort codomain)
        +
        Create function sort.
        +
        +
        Parameters:
        +
        domain - The sort of the fuction argument.
        +
        codomain - The sort of the function return value.
        +
        Returns:
        +
        The function sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkFunctionSort

        +
        public Sort mkFunctionSort​(Sort[] sorts,
        +                           Sort codomain)
        +
        Create function sort.
        +
        +
        Parameters:
        +
        sorts - The sort of the function arguments.
        +
        codomain - The sort of the function return value.
        +
        Returns:
        +
        The function sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkParamSort

        +
        public Sort mkParamSort​(java.lang.String symbol)
        +
        Create a sort parameter.
        +
        +
        Parameters:
        +
        symbol - The name of the sort.
        +
        Returns:
        +
        The sort parameter.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkParamSort

        +
        public Sort mkParamSort()
        +
        Create a sort parameter.
        +
        +
        Returns:
        +
        The sort parameter.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkPredicateSort

        +
        public Sort mkPredicateSort​(Sort[] sorts)
        +
        Create a predicate sort.
        +
        +
        Parameters:
        +
        sorts - The list of sorts of the predicate.
        +
        Returns:
        +
        The predicate sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkRecordSort

        +
        public Sort mkRecordSort​(Pair<java.lang.String,​Sort>[] fields)
        +
        Create a record sort
        +
        +
        Parameters:
        +
        fields - The list of fields of the record.
        +
        Returns:
        +
        The record sort.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkSetSort

        +
        public Sort mkSetSort​(Sort elemSort)
        +
        Create a set sort.
        +
        +
        Parameters:
        +
        elemSort - The sort of the set elements.
        +
        Returns:
        +
        The set sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkBagSort

        +
        public Sort mkBagSort​(Sort elemSort)
        +
        Create a bag sort.
        +
        +
        Parameters:
        +
        elemSort - The sort of the bag elements.
        +
        Returns:
        +
        The bag sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkSequenceSort

        +
        public Sort mkSequenceSort​(Sort elemSort)
        +
        Create a sequence sort.
        +
        +
        Parameters:
        +
        elemSort - The sort of the sequence elements.
        +
        Returns:
        +
        The sequence sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkUninterpretedSort

        +
        public Sort mkUninterpretedSort​(java.lang.String symbol)
        +
        Create an uninterpreted sort.
        +
        +
        Parameters:
        +
        symbol - The name of the sort.
        +
        Returns:
        +
        The uninterpreted sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkUninterpretedSort

        +
        public Sort mkUninterpretedSort()
        +
        Create an uninterpreted sort.
        +
        +
        Returns:
        +
        The uninterpreted sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkUnresolvedDatatypeSort

        +
        public Sort mkUnresolvedDatatypeSort​(java.lang.String symbol,
        +                                     int arity)
        +                              throws CVC5ApiException
        +
        Create an unresolved datatype sort. + + This is for creating yet unresolved sort placeholders for mutually + recursive parametric datatypes.
        +
        +
        Parameters:
        +
        symbol - The symbol of the sort.
        +
        arity - The number of sort parameters of the sort.
        +
        Returns:
        +
        The unresolved sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkUnresolvedDatatypeSort

        +
        public Sort mkUnresolvedDatatypeSort​(java.lang.String symbol)
        +                              throws CVC5ApiException
        +
        Create an unresolved datatype sort. + + This is for creating yet unresolved sort placeholders for mutually + recursive datatypes without sort parameters.
        +
        +
        Parameters:
        +
        symbol - The symbol of the sort.
        +
        Returns:
        +
        The unresolved sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkUninterpretedSortConstructorSort

        +
        public Sort mkUninterpretedSortConstructorSort​(int arity,
        +                                               java.lang.String symbol)
        +                                        throws CVC5ApiException
        +
        Create a sort constructor sort. + + An uninterpreted sort constructor is an uninterpreted sort with + arity > 0.
        +
        +
        Parameters:
        +
        arity - The arity of the sort (must be > 0)
        +
        symbol - The symbol of the sort.
        +
        Returns:
        +
        The sort constructor sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkUninterpretedSortConstructorSort

        +
        public Sort mkUninterpretedSortConstructorSort​(int arity)
        +                                        throws CVC5ApiException
        +
        Create a sort constructor sort. + + An uninterpreted sort constructor is an uninterpreted sort with + arity > 0.
        +
        +
        Parameters:
        +
        arity - The arity of the sort (must be > 0)
        +
        Returns:
        +
        The sort constructor sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkTupleSort

        +
        public Sort mkTupleSort​(Sort[] sorts)
        +
        Create a tuple sort.
        +
        +
        Parameters:
        +
        sorts - Of the elements of the tuple.
        +
        Returns:
        +
        The tuple sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Kind kind)
        +
        Create 0-ary term of given kind.
        +
        +
        Parameters:
        +
        kind - The kind of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Kind kind,
        +                   Term child)
        +
        Create a unary term of given kind.
        +
        +
        Parameters:
        +
        kind - The kind of the term.
        +
        child - The child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Kind kind,
        +                   Term child1,
        +                   Term child2)
        +
        Create binary term of given kind.
        +
        +
        Parameters:
        +
        kind - The kind of the term.
        +
        child1 - The first child of the term.
        +
        child2 - The second child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Kind kind,
        +                   Term child1,
        +                   Term child2,
        +                   Term child3)
        +
        Create ternary term of given kind.
        +
        +
        Parameters:
        +
        kind - The kind of the term.
        +
        child1 - The first child of the term.
        +
        child2 - The second child of the term.
        +
        child3 - The third child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Kind kind,
        +                   Term[] children)
        +
        Create n-ary term of given kind.
        +
        +
        Parameters:
        +
        kind - The kind of the term.
        +
        children - The children of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Op op)
        +
        Create nullary term of given kind from a given operator. + Create operators with mkOp().
        +
        +
        Parameters:
        +
        op - The operator.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Op op,
        +                   Term child)
        +
        Create unary term of given kind from a given operator. + Create operators with mkOp().
        +
        +
        Parameters:
        +
        op - The operator.
        +
        child - The child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Op op,
        +                   Term child1,
        +                   Term child2)
        +
        Create binary term of given kind from a given operator. + Create operators with mkOp().
        +
        +
        Parameters:
        +
        op - The operator.
        +
        child1 - The first child of the term.
        +
        child2 - The second child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Op op,
        +                   Term child1,
        +                   Term child2,
        +                   Term child3)
        +
        Create ternary term of given kind from a given operator. + Create operators with mkOp().
        +
        +
        Parameters:
        +
        op - The operator.
        +
        child1 - The first child of the term.
        +
        child2 - The second child of the term.
        +
        child3 - The third child of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTerm

        +
        public Term mkTerm​(Op op,
        +                   Term[] children)
        +
        Create n-ary term of given kind from a given operator. + Create operators with mkOp().
        +
        +
        Parameters:
        +
        op - The operator.
        +
        children - The children of the term.
        +
        Returns:
        +
        The Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkTuple

        +
        public Term mkTuple​(Sort[] sorts,
        +                    Term[] terms)
        +
        Create a tuple term. Terms are automatically converted if sorts are + compatible.
        +
        +
        Parameters:
        +
        sorts - The sorts of the elements in the tuple.
        +
        terms - The elements in the tuple.
        +
        Returns:
        +
        The tuple Term.
        +
        +
      • +
      + + + +
        +
      • +

        mkOp

        +
        public Op mkOp​(Kind kind)
        +
        Create an operator for a builtin Kind + The Kind may not be the Kind for an indexed operator + (e.g., Kind.BITVECTOR_EXTRACT).
        +
        +
        Parameters:
        +
        kind - The kind to wrap.
        +
        Note:
        +
        In this case, the Op simply wraps the Kind. The Kind can be used + in mkTerm directly without creating an op first.
        +
        +
      • +
      + + + +
        +
      • +

        mkOp

        +
        public Op mkOp​(Kind kind,
        +               java.lang.String arg)
        +
        Create operator of kind: + + See enum Kind for a description of the parameters.
        +
        +
        Parameters:
        +
        kind - The kind of the operator.
        +
        arg - The string argument to this operator.
        +
        +
      • +
      + + + +
        +
      • +

        mkOp

        +
        public Op mkOp​(Kind kind,
        +               int arg)
        +        throws CVC5ApiException
        +
        Create operator of kind: +
          +
        • DIVISIBLE
        • +
        • BITVECTOR_REPEAT
        • +
        • BITVECTOR_ZERO_EXTEND
        • +
        • BITVECTOR_SIGN_EXTEND
        • +
        • BITVECTOR_ROTATE_LEFT
        • +
        • BITVECTOR_ROTATE_RIGHT
        • +
        • INT_TO_BITVECTOR
        • +
        • FLOATINGPOINT_TO_UBV
        • +
        • FLOATINGPOINT_TO_UBV_TOTAL
        • +
        • FLOATINGPOINT_TO_SBV
        • +
        • FLOATINGPOINT_TO_SBV_TOTAL
        • +
        • TUPLE_UPDATE
        • +
        + See enum Kind for a description of the parameters.
        +
        +
        Parameters:
        +
        kind - The kind of the operator.
        +
        arg - The unsigned int argument to this operator.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkOp

        +
        public Op mkOp​(Kind kind,
        +               int arg1,
        +               int arg2)
        +        throws CVC5ApiException
        +
        Create operator of Kind: +
          +
        • BITVECTOR_EXTRACT
        • +
        • FLOATINGPOINT_TO_FP_FROM_IEEE_BV
        • +
        • FLOATINGPOINT_TO_FP_FROM_FP
        • +
        • FLOATINGPOINT_TO_FP_FROM_REAL
        • +
        • FLOATINGPOINT_TO_FP_FROM_SBV
        • +
        • FLOATINGPOINT_TO_FP_FROM_UBV
        • +
        + See enum Kind for a description of the parameters.
        +
        +
        Parameters:
        +
        kind - The kind of the operator.
        +
        arg1 - The first unsigned int argument to this operator.
        +
        arg2 - The second unsigned int argument to this operator.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkOp

        +
        public Op mkOp​(Kind kind,
        +               int[] args)
        +        throws CVC5ApiException
        +
        Create operator of Kind: +
          +
        • TUPLE_PROJECT
        • +
        + See enum Kind for a description of the parameters.
        +
        +
        Parameters:
        +
        kind - The kind of the operator.
        +
        args - The arguments (indices) of the operator.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkTrue

        +
        public Term mkTrue()
        +
        Create a Boolean true constant.
        +
        +
        Returns:
        +
        The true constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkFalse

        +
        public Term mkFalse()
        +
        Create a Boolean false constant.
        +
        +
        Returns:
        +
        The false constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkBoolean

        +
        public Term mkBoolean​(boolean val)
        +
        Create a Boolean constant.
        +
        +
        Parameters:
        +
        val - The value of the constant.
        +
        Returns:
        +
        The Boolean constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkPi

        +
        public Term mkPi()
        +
        Create a constant representing the number Pi.
        +
        +
        Returns:
        +
        A constant representing Pi.
        +
        +
      • +
      + + + +
        +
      • +

        mkInteger

        +
        public Term mkInteger​(java.lang.String s)
        +               throws CVC5ApiException
        +
        Create an integer constant from a string.
        +
        +
        Parameters:
        +
        s - The string representation of the constant, may represent an. + integer (e.g., "123").
        +
        Returns:
        +
        A constant of sort Integer assuming s represents an + integer).
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkInteger

        +
        public Term mkInteger​(long val)
        +
        Create an integer constant from a C++ int.
        +
        +
        Parameters:
        +
        val - The value of the constant.
        +
        Returns:
        +
        A constant of sort Integer.
        +
        +
      • +
      + + + +
        +
      • +

        mkReal

        +
        public Term mkReal​(java.lang.String s)
        +            throws CVC5ApiException
        +
        Create a real constant from a string.
        +
        +
        Parameters:
        +
        s - The string representation of the constant, may represent an. + integer (e.g., "123") or real constant (e.g., "12.34" or + "12/34").
        +
        Returns:
        +
        A constant of sort Real.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkReal

        +
        public Term mkReal​(long val)
        +
        Create a real constant from an integer.
        +
        +
        Parameters:
        +
        val - The value of the constant.
        +
        Returns:
        +
        A constant of sort Integer.
        +
        +
      • +
      + + + +
        +
      • +

        mkReal

        +
        public Term mkReal​(long num,
        +                   long den)
        +
        Create a real constant from a rational.
        +
        +
        Parameters:
        +
        num - The value of the numerator.
        +
        den - The value of the denominator.
        +
        Returns:
        +
        A constant of sort Real.
        +
        +
      • +
      + + + +
        +
      • +

        mkRegexpNone

        +
        public Term mkRegexpNone()
        +
        Create a regular expression none (re.none) term.
        +
        +
        Returns:
        +
        The none term.
        +
        +
      • +
      + + + +
        +
      • +

        mkRegexpAll

        +
        public Term mkRegexpAll()
        +
        Create a regular expression all (re.all) term.
        +
        +
        Returns:
        +
        The all term.
        +
        +
      • +
      + + + +
        +
      • +

        mkRegexpAllchar

        +
        public Term mkRegexpAllchar()
        +
        Create a regular expression allchar (re.allchar) term.
        +
        +
        Returns:
        +
        The allchar term.
        +
        +
      • +
      + + + +
        +
      • +

        mkEmptySet

        +
        public Term mkEmptySet​(Sort sort)
        +
        Create a constant representing an empty set of the given sort.
        +
        +
        Parameters:
        +
        sort - The sort of the set elements.
        +
        Returns:
        +
        The empty set constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkEmptyBag

        +
        public Term mkEmptyBag​(Sort sort)
        +
        Create a constant representing an empty bag of the given sort.
        +
        +
        Parameters:
        +
        sort - The sort of the bag elements.
        +
        Returns:
        +
        The empty bag constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkSepEmp

        +
        public Term mkSepEmp()
        +
        Create a separation logic empty term.
        +
        +
        Returns:
        +
        The separation logic empty term.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkSepNil

        +
        public Term mkSepNil​(Sort sort)
        +
        Create a separation logic nil term.
        +
        +
        Parameters:
        +
        sort - The sort of the nil term.
        +
        Returns:
        +
        The separation logic nil term.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkString

        +
        public Term mkString​(java.lang.String s)
        +
        Create a String constant.
        +
        +
        Parameters:
        +
        s - The string this constant represents.
        +
        Returns:
        +
        The String constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkString

        +
        public Term mkString​(java.lang.String s,
        +                     boolean useEscSequences)
        +
        Create a String constant.
        +
        +
        Parameters:
        +
        s - The string this constant represents.
        +
        useEscSequences - Determines whether escape sequences in s + should be converted to the corresponding unicode + character.
        +
        Returns:
        +
        The String constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkString

        +
        public Term mkString​(int[] s)
        +              throws CVC5ApiException
        +
        Create a String constant.
        +
        +
        Parameters:
        +
        s - A list of unsigned (unicode) values this constant represents + as string.
        +
        Returns:
        +
        The String constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkEmptySequence

        +
        public Term mkEmptySequence​(Sort sort)
        +
        Create an empty sequence of the given element sort.
        +
        +
        Parameters:
        +
        sort - The element sort of the sequence.
        +
        Returns:
        +
        The empty sequence with given element sort.
        +
        +
      • +
      + + + +
        +
      • +

        mkUniverseSet

        +
        public Term mkUniverseSet​(Sort sort)
        +
        Create a universe set of the given sort.
        +
        +
        Parameters:
        +
        sort - The sort of the set elements.
        +
        Returns:
        +
        The universe set constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkBitVector

        +
        public Term mkBitVector​(int size)
        +                 throws CVC5ApiException
        +
        Create a bit-vector constant of given size and value = 0.
        +
        +
        Parameters:
        +
        size - The bit-width of the bit-vector sort.
        +
        Returns:
        +
        The bit-vector constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkBitVector

        +
        public Term mkBitVector​(int size,
        +                        long val)
        +                 throws CVC5ApiException
        +
        Create a bit-vector constant of given size and value.
        +
        +
        Parameters:
        +
        size - The bit-width of the bit-vector sort.
        +
        val - The value of the constant.
        +
        Returns:
        +
        The bit-vector constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        Note:
        +
        The given value must fit into a bit-vector of the given size.
        +
        +
      • +
      + + + +
        +
      • +

        mkBitVector

        +
        public Term mkBitVector​(int size,
        +                        java.lang.String s,
        +                        int base)
        +                 throws CVC5ApiException
        +
        Create a bit-vector constant of a given bit-width from a given string of + base 2, 10 or 16.
        +
        +
        Parameters:
        +
        size - The bit-width of the constant.
        +
        s - The string representation of the constant.
        +
        base - The base of the string representation (2, 10, or 16)
        +
        Returns:
        +
        The bit-vector constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        Note:
        +
        The given value must fit into a bit-vector of the given size.
        +
        +
      • +
      + + + +
        +
      • +

        mkConstArray

        +
        public Term mkConstArray​(Sort sort,
        +                         Term val)
        +
        Create a constant array with the provided constant value stored at + every index
        +
        +
        Parameters:
        +
        sort - The sort of the constant array (must be an array sort)
        +
        val - The constant value to store (must match the sort's element + sort).
        +
        Returns:
        +
        The constant array term.
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointPosInf

        +
        public Term mkFloatingPointPosInf​(int exp,
        +                                  int sig)
        +                           throws CVC5ApiException
        +
        Create a positive infinity floating-point constant (SMT-LIB: +oo).
        +
        +
        Parameters:
        +
        exp - Number of bits in the exponent.
        +
        sig - Number of bits in the significand.
        +
        Returns:
        +
        The floating-point constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointNegInf

        +
        public Term mkFloatingPointNegInf​(int exp,
        +                                  int sig)
        +                           throws CVC5ApiException
        +
        Create a negative infinity floating-point constant (SMT-LIB: -oo).
        +
        +
        Parameters:
        +
        exp - Number of bits in the exponent.
        +
        sig - Number of bits in the significand.
        +
        Returns:
        +
        The floating-point constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointNaN

        +
        public Term mkFloatingPointNaN​(int exp,
        +                               int sig)
        +                        throws CVC5ApiException
        +
        Create a not-a-number floating-point constant (SMT-LIB: NaN).
        +
        +
        Parameters:
        +
        exp - Number of bits in the exponent.
        +
        sig - Number of bits in the significand.
        +
        Returns:
        +
        The floating-point constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointPosZero

        +
        public Term mkFloatingPointPosZero​(int exp,
        +                                   int sig)
        +                            throws CVC5ApiException
        +
        Create a positive zero floating-point constant (SMT-LIB: +zero).
        +
        +
        Parameters:
        +
        exp - Number of bits in the exponent.
        +
        sig - Number of bits in the significand.
        +
        Returns:
        +
        The floating-point constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPointNegZero

        +
        public Term mkFloatingPointNegZero​(int exp,
        +                                   int sig)
        +                            throws CVC5ApiException
        +
        Create a negative zero floating-point constant (SMT-LIB: -zero).
        +
        +
        Parameters:
        +
        exp - Number of bits in the exponent.
        +
        sig - Number of bits in the significand.
        +
        Returns:
        +
        The floating-point constant.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkRoundingMode

        +
        public Term mkRoundingMode​(RoundingMode rm)
        +
        Create a rounding mode constant.
        +
        +
        Parameters:
        +
        rm - The floating point rounding mode this constant represents.
        +
        +
      • +
      + + + +
        +
      • +

        mkFloatingPoint

        +
        public Term mkFloatingPoint​(int exp,
        +                            int sig,
        +                            Term val)
        +                     throws CVC5ApiException
        +
        Create a floating-point constant.
        +
        +
        Parameters:
        +
        exp - Size of the exponent.
        +
        sig - Size of the significand.
        +
        val - Value of the floating-point constant as a bit-vector term.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        mkCardinalityConstraint

        +
        public Term mkCardinalityConstraint​(Sort sort,
        +                                    int upperBound)
        +                             throws CVC5ApiException
        +
        Create a cardinality constraint for an uninterpreted sort.
        +
        +
        Parameters:
        +
        sort - The sort the cardinality constraint is for.
        +
        upperBound - The upper bound on the cardinality of the sort.
        +
        Returns:
        +
        The cardinality constraint.
        +
        Throws:
        +
        CVC5ApiException
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkConst

        +
        public Term mkConst​(Sort sort,
        +                    java.lang.String symbol)
        +
        Create a free constant. + + SMT-LIB: + + ( declare-const <symbol> <sort> ) + ( declare-fun <symbol> ( ) <sort> ) +
        +
        +
        Parameters:
        +
        sort - The sort of the constant.
        +
        symbol - The name of the constant.
        +
        Returns:
        +
        The first-order constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkConst

        +
        public Term mkConst​(Sort sort)
        +
        Create a free constant with a default symbol name.
        +
        +
        Parameters:
        +
        sort - The sort of the constant.
        +
        Returns:
        +
        The first-order constant.
        +
        +
      • +
      + + + +
        +
      • +

        mkVar

        +
        public Term mkVar​(Sort sort)
        +
        Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
        +
        +
        Parameters:
        +
        sort - The sort of the variable.
        +
        Returns:
        +
        The variable.
        +
        +
      • +
      + + + +
        +
      • +

        mkVar

        +
        public Term mkVar​(Sort sort,
        +                  java.lang.String symbol)
        +
        Create a bound variable to be used in a binder (i.e., a quantifier, a + lambda, or a witness binder).
        +
        +
        Parameters:
        +
        sort - The sort of the variable.
        +
        symbol - The name of the variable.
        +
        Returns:
        +
        The variable.
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeConstructorDecl

        +
        public DatatypeConstructorDecl mkDatatypeConstructorDecl​(java.lang.String name)
        +
        Create a datatype constructor declaration.
        +
        +
        Parameters:
        +
        name - The name of the datatype constructor.
        +
        Returns:
        +
        The DatatypeConstructorDecl.
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeDecl

        +
        public DatatypeDecl mkDatatypeDecl​(java.lang.String name)
        +
        Create a datatype declaration.
        +
        +
        Parameters:
        +
        name - The name of the datatype.
        +
        Returns:
        +
        The DatatypeDecl.
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeDecl

        +
        public DatatypeDecl mkDatatypeDecl​(java.lang.String name,
        +                                   boolean isCoDatatype)
        +
        Create a datatype declaration.
        +
        +
        Parameters:
        +
        name - The name of the datatype.
        +
        isCoDatatype - True if a codatatype is to be constructed.
        +
        Returns:
        +
        The DatatypeDecl.
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeDecl

        +
        public DatatypeDecl mkDatatypeDecl​(java.lang.String name,
        +                                   Sort[] params)
        +
        Create a datatype declaration. + + Create sorts parameter with mkParamSort(String).
        +
        +
        Parameters:
        +
        name - The name of the datatype.
        +
        params - A list of sort parameters.
        +
        Returns:
        +
        The DatatypeDecl.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        mkDatatypeDecl

        +
        public DatatypeDecl mkDatatypeDecl​(java.lang.String name,
        +                                   Sort[] params,
        +                                   boolean isCoDatatype)
        +
        Create a datatype declaration. + + Create sorts parameter with mkParamSort(String).
        +
        +
        Parameters:
        +
        name - The name of the datatype.
        +
        params - A list of sort parameters.
        +
        isCoDatatype - True if a codatatype is to be constructed.
        +
        Returns:
        +
        The DatatypeDecl.
        +
        +
      • +
      + + + +
        +
      • +

        simplify

        +
        public Term simplify​(Term t)
        +
        Simplify a formula without doing "much" work. + + Does not involve the SAT Engine in the simplification, but uses the + current definitions, assertions, and the current partial model, if one has + been constructed. It also involves theory normalization.
        +
        +
        Parameters:
        +
        t - The formula to simplify.
        +
        Returns:
        +
        The simplified formula.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        assertFormula

        +
        public void assertFormula​(Term term)
        +
        Assert a formula. + SMT-LIB: + + ( assert <term> ) +
        +
        +
        Parameters:
        +
        term - The formula to assert.
        +
        +
      • +
      + + + +
        +
      • +

        checkSat

        +
        public Result checkSat()
        +
        Check satisfiability. + + SMT-LIB: + + ( check-sat ) +
        +
        +
        Returns:
        +
        The result of the satisfiability check.
        +
        +
      • +
      + + + +
        +
      • +

        checkSatAssuming

        +
        public Result checkSatAssuming​(Term assumption)
        +
        Check satisfiability assuming the given formula. + + SMT-LIB: + + ( check-sat-assuming ( <prop_literal> ) ) +
        +
        +
        Parameters:
        +
        assumption - The formula to assume.
        +
        Returns:
        +
        The result of the satisfiability check.
        +
        +
      • +
      + + + +
        +
      • +

        checkSatAssuming

        +
        public Result checkSatAssuming​(Term[] assumptions)
        +
        Check satisfiability assuming the given formulas. + + SMT-LIB: + + ( check-sat-assuming ( <prop_literal>+ ) ) +
        +
        +
        Parameters:
        +
        assumptions - The formulas to assume.
        +
        Returns:
        +
        The result of the satisfiability check.
        +
        +
      • +
      + + + +
        +
      • +

        declareDatatype

        +
        public Sort declareDatatype​(java.lang.String symbol,
        +                            DatatypeConstructorDecl[] ctors)
        +
        Create datatype sort. + + SMT-LIB: + + ( declare-datatype <symbol> <datatype_decl> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the datatype sort.
        +
        ctors - The constructor declarations of the datatype sort.
        +
        Returns:
        +
        The datatype sort.
        +
        +
      • +
      + + + +
        +
      • +

        declareFun

        +
        public Term declareFun​(java.lang.String symbol,
        +                       Sort[] sorts,
        +                       Sort sort)
        +
        Declare n-ary function symbol. + + SMT-LIB: + + ( declare-fun <symbol> ( <sort>* ) <sort> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        sorts - The sorts of the parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        declareSort

        +
        public Sort declareSort​(java.lang.String symbol,
        +                        int arity)
        +                 throws CVC5ApiException
        +
        Declare uninterpreted sort. + + SMT-LIB: + + ( declare-sort <symbol> <numeral> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the sort.
        +
        arity - The arity of the sort.
        +
        Returns:
        +
        The sort.
        +
        Throws:
        +
        CVC5ApiException
        +
        Note:
        +
        This corresponds to mkUninterpretedSort() const if arity = 0, and + to mkUninterpretedSortConstructorSort() const if arity > 0.
        +
        +
      • +
      + + + +
        +
      • +

        defineFun

        +
        public Term defineFun​(java.lang.String symbol,
        +                      Term[] boundVars,
        +                      Sort sort,
        +                      Term term)
        +
        Define n-ary function in the current context. + + SMT-LIB: + + ( define-fun <function_def> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        term - The function body.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFun

        +
        public Term defineFun​(java.lang.String symbol,
        +                      Term[] boundVars,
        +                      Sort sort,
        +                      Term term,
        +                      boolean global)
        +
        Define n-ary function. + + SMT-LIB: + + ( define-fun <function_def> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        term - The function body.
        +
        global - Determines whether this definition is global (i.e., persists + when popping the context).
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunRec

        +
        public Term defineFunRec​(java.lang.String symbol,
        +                         Term[] boundVars,
        +                         Sort sort,
        +                         Term term)
        +
        Define recursive function in the current context. + + SMT-LIB: + + ( define-fun-rec <function_def> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        term - The function body.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunRec

        +
        public Term defineFunRec​(java.lang.String symbol,
        +                         Term[] boundVars,
        +                         Sort sort,
        +                         Term term,
        +                         boolean global)
        +
        Define recursive function. + + SMT-LIB: + + ( define-fun-rec <function_def> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        term - The function body.
        +
        global - Determines whether this definition is global (i.e., persists + when popping the context).
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunRec

        +
        public Term defineFunRec​(Term fun,
        +                         Term[] boundVars,
        +                         Term term)
        +
        Define recursive function in the current context. + + SMT-LIB: + + ( define-fun-rec <function_def> ) + + + Create parameter fun with mkConst(Sort).
        +
        +
        Parameters:
        +
        fun - The sorted function.
        +
        boundVars - The parameters to this function.
        +
        term - The function body.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunRec

        +
        public Term defineFunRec​(Term fun,
        +                         Term[] boundVars,
        +                         Term term,
        +                         boolean global)
        +
        Define recursive function. + + SMT-LIB: + + ( define-fun-rec <function_def> ) + + + Create parameter fun with mkConst(Sort).
        +
        +
        Parameters:
        +
        fun - The sorted function.
        +
        boundVars - The parameters to this function.
        +
        term - The function body.
        +
        global - Determines whether this definition is global (i.e., persists + when popping the context).
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunsRec

        +
        public void defineFunsRec​(Term[] funs,
        +                          Term[][] boundVars,
        +                          Term[] terms)
        +
        Define recursive functions in the current context. + + SMT-LIB: + + ( define-funs-rec ( <function_decl>^{n+1} ) ( <term>^{n+1} ) ) + + + Create elements of parameter funs with + mkConst(Sort).
        +
        +
        Parameters:
        +
        funs - The sorted functions.
        +
        boundVars - The list of parameters to the functions.
        +
        terms - The list of function bodies of the functions.
        +
        +
      • +
      + + + +
        +
      • +

        defineFunsRec

        +
        public void defineFunsRec​(Term[] funs,
        +                          Term[][] boundVars,
        +                          Term[] terms,
        +                          boolean global)
        +
        Define recursive functions. + + SMT-LIB: + + ( define-funs-rec ( <function_decl>^{n+1} ) ( <term>^{n+1} ) ) + + + Create elements of parameter funs with + mkConst(Sort).
        +
        +
        Parameters:
        +
        funs - The sorted functions.
        +
        boundVars - The list of parameters to the functions.
        +
        terms - The list of function bodies of the functions.
        +
        global - Determines whether this definition is global (i.e., persists + when popping the context).
        +
        +
      • +
      + + + +
        +
      • +

        getLearnedLiterals

        +
        public Term[] getLearnedLiterals()
        +
        Get a list of input literals that are entailed by the current set of + assertions. + + SMT-LIB: + + ( get-learned-literals ) +
        +
        +
        Returns:
        +
        The list of learned literals.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getLearnedLiterals

        +
        public Term[] getLearnedLiterals​(io.github.cvc5.modes.LearnedLitType type)
        +
        Get a list of literals that are entailed by the current set of assertions. + + SMT-LIB: + + ( get-learned-literals :type ) +
        +
        +
        Parameters:
        +
        type - The type of learned literals to return
        +
        Returns:
        +
        The list of learned literals.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getAssertions

        +
        public Term[] getAssertions()
        +
        Get the list of asserted formulas. + + SMT-LIB: + + ( get-assertions ) +
        +
        +
        Returns:
        +
        The list of asserted formulas.
        +
        +
      • +
      + + + +
        +
      • +

        getInfo

        +
        public java.lang.String getInfo​(java.lang.String flag)
        +
        Get info from the solver. + SMT-LIB: ( get-info <info_flag> )
        +
        +
        Returns:
        +
        The info.
        +
        +
      • +
      + + + +
        +
      • +

        getOption

        +
        public java.lang.String getOption​(java.lang.String option)
        +
        Get the value of a given option. + SMT-LIB: + + ( get-option <keyword> ) +
        +
        +
        Parameters:
        +
        option - The option for which the value is queried.
        +
        Returns:
        +
        A string representation of the option value.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getOptionInfo

        +
        public OptionInfo getOptionInfo​(java.lang.String option)
        +
        Get some information about the given option. + + Check the OptionInfo class for more details on which information + is available.
        +
        +
        Returns:
        +
        Information about the given option.
        +
        +
      • +
      + + + +
        +
      • +

        getUnsatAssumptions

        +
        public Term[] getUnsatAssumptions()
        +
        Get the set of unsat ("failed") assumptions. + + SMT-LIB: + + ( get-unsat-assumptions ) + + + Requires to enable option produce-unsat-assumptions.
        +
        +
        Returns:
        +
        The set of unsat assumptions.
        +
        +
      • +
      + + + +
        +
      • +

        getUnsatCore

        +
        public Term[] getUnsatCore()
        +
        Get the unsatisfiable core. + SMT-LIB: + + (get-unsat-core) + + Requires to enable option produce-unsat-cores.
        +
        +
        Returns:
        +
        A set of terms representing the unsatisfiable core.
        +
        Note:
        +
        In contrast to SMT-LIB, cvc5's API does not distinguish between + named and unnamed assertions when producing an unsatisfiable + core. Additionally, the API allows this option to be called after + a check with assumptions. A subset of those assumptions may be + included in the unsatisfiable core returned by this method.
        +
        +
      • +
      + + + +
        +
      • +

        getDifficulty

        +
        public java.util.Map<Term,​Term> getDifficulty()
        +
        Get a difficulty estimate for an asserted formula. This method is + intended to be called immediately after any response to a checkSat.
        +
        +
        Returns:
        +
        A map from (a subset of) the input assertions to a real value that. + is an estimate of how difficult each assertion was to solve. Unmentioned + assertions can be assumed to have zero difficulty.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getProof

        +
        public java.lang.String getProof()
        +
        Get refutation proof for the most recent call to checkSat. + + SMT-LIB: + + ( get-proof ) + + + Requires to enable option produce-proofs.
        +
        +
        Returns:
        +
        A string representing the proof. This is impacted by the value of + proof-format-mode.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getProof

        +
        public java.lang.String getProof​(io.github.cvc5.modes.ProofComponent c)
        +
        Get a proof associated with the most recent call to checkSat. + + SMT-LIB: + + ( get-proof :c) + + + Requires to enable option produce-proofs.
        +
        +
        Parameters:
        +
        c - The component of the proof to return
        +
        Returns:
        +
        A string representing the proof. This is equivalent to getProof + when c is PROOF_COMPONENT_FULL.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getValue

        +
        public Term getValue​(Term term)
        +
        Get the value of the given term in the current model. + + SMT-LIB: + + ( get-value ( <term> ) ) +
        +
        +
        Parameters:
        +
        term - The term for which the value is queried.
        +
        Returns:
        +
        The value of the given term.
        +
        +
      • +
      + + + +
        +
      • +

        getValue

        +
        public Term[] getValue​(Term[] terms)
        +
        Get the values of the given terms in the current model. + + SMT-LIB: + + ( get-value ( <term>+ ) ) +
        +
        +
        Parameters:
        +
        terms - The terms for which the value is queried.
        +
        Returns:
        +
        The values of the given terms.
        +
        +
      • +
      + + + +
        +
      • +

        getModelDomainElements

        +
        public Term[] getModelDomainElements​(Sort s)
        +
        Get the domain elements of uninterpreted sort s in the current model. + + The current model interprets s as the finite sort whose domain + elements are given in the return value of this method.
        +
        +
        Parameters:
        +
        s - The uninterpreted sort in question.
        +
        Returns:
        +
        The domain elements of s in the current model.
        +
        +
      • +
      + + + +
        +
      • +

        isModelCoreSymbol

        +
        public boolean isModelCoreSymbol​(Term v)
        +
        This returns false if the model value of free constant v was not + essential for showing the satisfiability of the last call to + checkSat() using the current model. This method will only + return false (for any v) if the option model-cores has + been set.
        +
        +
        Parameters:
        +
        v - The term in question.
        +
        Returns:
        +
        True if v is a model core symbol.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getModel

        +
        public java.lang.String getModel​(Sort[] sorts,
        +                                 Term[] vars)
        +
        Get the model + + SMT-LIB: + + ( get-model ) + + + Requires to enable option produce-models.
        +
        +
        Parameters:
        +
        sorts - The list of uninterpreted sorts that should be printed in the. + model.
        +
        vars - The list of free constants that should be printed in the. + model. A subset of these may be printed based on + isModelCoreSymbol(Term).
        +
        Returns:
        +
        A string representing the model.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getQuantifierElimination

        +
        public Term getQuantifierElimination​(Term q)
        +
        Do quantifier elimination. + + SMT-LIB: + + ( get-qe <q> ) + + + Quantifier Elimination is is only complete for logics such as LRA, + LIA and BV.
        +
        +
        Parameters:
        +
        q - A quantified formula of the form: + Q x1...xn. P( x1...xn, y1...yn ) + where P( x1...xn, y1...yn ) is a quantifier-free formula.
        +
        Returns:
        +
        A formula ret such that, given the current set of formulas + A asserted to this solver: + - ( A && q ) and ( A && ret ) are equivalent + - ret is quantifier-free formula containing only free + variables in y1...yn.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getQuantifierEliminationDisjunct

        +
        public Term getQuantifierEliminationDisjunct​(Term q)
        +
        Do partial quantifier elimination, which can be used for incrementally + computing the result of a quantifier elimination. + + SMT-LIB: + + ( get-qe-disjunct <q> ) + + + Quantifier Elimination is is only complete for logics such as LRA, + LIA and BV.
        +
        +
        Parameters:
        +
        q - A quantified formula of the form: + Q x1...xn. P( x1...xn, y1...yn ) + where P( x1...xn, y1...yn ) is a quantifier-free formula.
        +
        Returns:
        +
        A formula ret such that, given the current set of formulas A + asserted to this solver: + - (A ^ q) => (A ^ ret) if Q is forall or + (A ^ ret) => (A ^ q) if Q is exists, + - ret is quantifier-free formula containing only free variables + in y1...yn, + - If Q is exists, let A && Q_n be the formula + A && ~(ret && Q_1) && ... && ~(ret && Q_n) + where for each i=1,...n, formula ret && Q_i + is the result of calling + getQuantifierEliminationDisjunct(Term) + for q with the set of assertions + A && Q_{i-1}. Similarly, if Q is forall, then + let A && Q_n be + A && (ret && Q_1) && ... && (ret&& Q_n) + where ret && Q_i is the same as above. In either case, + we have that ret && Q_j will eventually be true or + false, for some finite j.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        declareSepHeap

        +
        public void declareSepHeap​(Sort locSort,
        +                           Sort dataSort)
        +
        When using separation logic, this sets the location sort and the + datatype sort to the given ones. This method should be invoked exactly + once, before any separation logic constraints are provided.
        +
        +
        Parameters:
        +
        locSort - The location sort of the heap.
        +
        dataSort - The data sort of the heap.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getValueSepHeap

        +
        public Term getValueSepHeap()
        +
        When using separation logic, obtain the term for the heap.
        +
        +
        Returns:
        +
        The term for the heap.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getValueSepNil

        +
        public Term getValueSepNil()
        +
        When using separation logic, obtain the term for nil.
        +
        +
        Returns:
        +
        The term for nil.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        declarePool

        +
        public Term declarePool​(java.lang.String symbol,
        +                        Sort sort,
        +                        Term[] initValue)
        +
        Declare a symbolic pool of terms with the given initial value. + + SMT-LIB: + + ( declare-pool <symbol> <sort> ( <term>* ) ) +
        +
        +
        Parameters:
        +
        symbol - The name of the pool.
        +
        sort - The sort of the elements of the pool.
        +
        initValue - The initial value of the pool.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        declareOracleFun

        +
        public Term declareOracleFun​(java.lang.String symbol,
        +                             Sort[] sorts,
        +                             Sort sort,
        +                             IOracle oracle)
        +
        Declare an oracle function with reference to an implementation. + + Oracle functions have a different semantics with respect to ordinary + declared functions. In particular, for an input to be satisfiable, + its oracle functions are implicitly universally quantified. + + This method is used in part for implementing this command: + + + (declare-oracle-fun <sym> (<sort>*) <sort> <sym>) + + + + In particular, the above command is implemented by constructing a + function over terms that wraps a call to binary sym via a text interface.
        +
        +
        Parameters:
        +
        symbol - The name of the oracle
        +
        sorts - The sorts of the parameters to this function
        +
        sort - The sort of the return value of this function
        +
        oracle - An object that implements the oracle interface.
        +
        Returns:
        +
        The oracle function
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        pop

        +
        public void pop()
        +         throws CVC5ApiException
        +
        Pop a level from the assertion stack. + + SMT-LIB: + + ( pop <numeral> ) +
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        pop

        +
        public void pop​(int nscopes)
        +         throws CVC5ApiException
        +
        Pop (a) level(s) from the assertion stack. + + SMT-LIB: + + ( pop <numeral> ) +
        +
        +
        Parameters:
        +
        nscopes - The number of levels to pop.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        getInterpolant

        +
        public Term getInterpolant​(Term conj)
        +
        Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
        +
        +
        Parameters:
        +
        conj - The conjecture term.
        +
        Returns:
        +
        A Term I such that A->I and I->B are valid, where + A is the current set of assertions and B is given + in the input by conj, or the null term if such a term + cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getInterpolant

        +
        public Term getInterpolant​(Term conj,
        +                           Grammar grammar)
        +
        Get an interpolant + + SMT-LIB: + + ( get-interpolant <conj> <g> ) + + + Requires option produce-interpolants to be set to a mode different + from none.
        +
        +
        Parameters:
        +
        conj - The conjecture term.
        +
        grammar - The grammar for the interpolant I.
        +
        Returns:
        +
        A Term I such that A->I and I->B are valid, where + A is the current set of assertions and B is given + in the input by conj, or the null term if such a term + cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getInterpolantNext

        +
        public Term getInterpolantNext()
        +
        Get the next interpolant. + + Can only be called immediately after a successful call to + get-interpolant or get-interpolant-next. Is guaranteed to + produce a syntactically different interpolant wrt the last returned + interpolant if successful. + + SMT-LIB: + + (get-interpolant-next) + + + Requires to enable incremental mode, and option + produce-interpolants to be set to a mode different from + none.
        +
        +
        Returns:
        +
        A Term I such that A->I and I->B are valid, + where A is the current set of assertions and B + is given in the input by conj on the last call to getInterpolant, + or the null term if such a term cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getAbduct

        +
        public Term getAbduct​(Term conj)
        +
        Get an abduct. + + SMT-LIB: + + ( get-abduct <conj> ) + + Requires enabling option produce-abducts.
        +
        +
        Parameters:
        +
        conj - The conjecture term.
        +
        Returns:
        +
        A term C such that A && C is satisfiable, and + A && ~B && C is unsatisfiable, where A is the + current set of assertions and B is given in the input by + conj, or the null term if such a term cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getAbduct

        +
        public Term getAbduct​(Term conj,
        +                      Grammar grammar)
        +
        Get an abduct. + + SMT-LIB: + + ( get-abduct <conj> <g> ) + + + Requires enabling option produce-abducts.
        +
        +
        Parameters:
        +
        conj - The conjecture term.
        +
        grammar - The grammar for the abduct C.
        +
        Returns:
        +
        A term C such that A && C is satisfiable, and + A && ~B && C is unsatisfiable, where A is the + current set of assertions and B is given in the input by + conj, or the null term if such a term cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getAbductNext

        +
        public Term getAbductNext()
        +
        Get the next abduct. Can only be called immediately after a successful + call to get-abduct or get-abduct-next. Is guaranteed to produce a + syntactically different abduct wrt the last returned abduct if successful. + SMT-LIB: + + ( get-abduct-next ) + + Requires enabling incremental mode and option produce-abducts.
        +
        +
        Returns:
        +
        A term C such that A^C is satisfiable, and A^~B^C is. + unsatisfiable, where A is the current set of assertions and B is + given in the input by conj in the last call to getAbduct, or the + null term if such a term cannot be found.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        blockModel

        +
        public void blockModel​(io.github.cvc5.modes.BlockModelsMode mode)
        +
        Block the current model. + + Can be called only if immediately preceded by a SAT or INVALID query. + + SMT-LIB: + + ( block-model ) + + + Requires enabling option produce-models.
        +
        +
        Parameters:
        +
        mode - The mode to use for blocking.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        blockModelValues

        +
        public void blockModelValues​(Term[] terms)
        +
        Block the current model values of (at least) the values in terms. + + Can be called only if immediately preceded by a SAT or NOT_ENTAILED query. + + SMT-LIB: + + ( block-model-values ( <terms>+ ) ) + + + Requires enabling option produce-models.
        +
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getInstantiations

        +
        public java.lang.String getInstantiations()
        +
        Return a string that contains information about all instantiations made by + the quantifiers module.
        +
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        push

        +
        public void push()
        +          throws CVC5ApiException
        +
        Push a level to the assertion stack. + + SMT-LIB: + + ( push <numeral> ) +
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        push

        +
        public void push​(int nscopes)
        +          throws CVC5ApiException
        +
        Push (a) level(s) to the assertion stack. + + SMT-LIB: + + ( push <numeral> ) +
        +
        +
        Parameters:
        +
        nscopes - The number of levels to push.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        resetAssertions

        +
        public void resetAssertions()
        +
        Remove all assertions. + + SMT-LIB: + + ( reset-assertions ) +
        +
      • +
      + + + +
        +
      • +

        setInfo

        +
        public void setInfo​(java.lang.String keyword,
        +                    java.lang.String value)
        +             throws CVC5ApiException
        +
        Set info. + + SMT-LIB: + + ( set-info <attribute> ) +
        +
        +
        Parameters:
        +
        keyword - The info flag.
        +
        value - The value of the info flag.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        setLogic

        +
        public void setLogic​(java.lang.String logic)
        +              throws CVC5ApiException
        +
        Set logic. + + SMT-LIB: + + ( set-logic <symbol> ) +
        +
        +
        Parameters:
        +
        logic - The logic to set.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        setOption

        +
        public void setOption​(java.lang.String option,
        +                      java.lang.String value)
        +
        Set option. + + SMT-LIB: + + ( set-option <option> ) +
        +
        +
        Parameters:
        +
        option - The option name.
        +
        value - The option value.
        +
        +
      • +
      + + + +
        +
      • +

        declareSygusVar

        +
        public Term declareSygusVar​(java.lang.String symbol,
        +                            Sort sort)
        +
        Append symbol to the current list of universal variables. + + SyGuS v2: + + ( declare-var <symbol> <sort> ) +
        +
        +
        Parameters:
        +
        sort - The sort of the universal variable.
        +
        symbol - The name of the universal variable.
        +
        Returns:
        +
        The universal variable.
        +
        +
      • +
      + + + +
        +
      • +

        mkGrammar

        +
        public Grammar mkGrammar​(Term[] boundVars,
        +                         Term[] ntSymbols)
        +
        Create a Sygus grammar. + + The first non-terminal is treated as the starting non-terminal, so the + order of non-terminals matters.
        +
        +
        Parameters:
        +
        boundVars - The parameters to corresponding synth-fun/synth-inv.
        +
        ntSymbols - The pre-declaration of the non-terminal symbols.
        +
        Returns:
        +
        The grammar.
        +
        +
      • +
      + + + +
        +
      • +

        synthFun

        +
        public Term synthFun​(java.lang.String symbol,
        +                     Term[] boundVars,
        +                     Sort sort)
        +
        Synthesize n-ary function. + + SyGuS v2: + + ( synth-fun <symbol> ( <boundVars>* ) <sort> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        synthFun

        +
        public Term synthFun​(java.lang.String symbol,
        +                     Term[] boundVars,
        +                     Sort sort,
        +                     Grammar grammar)
        +
        Synthesize n-ary function following specified syntactic constraints. + + SyGuS v2: + + ( synth-fun <symbol> ( <boundVars>* ) <sort> <g> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the function.
        +
        boundVars - The parameters to this function.
        +
        sort - The sort of the return value of this function.
        +
        grammar - The syntactic constraints.
        +
        Returns:
        +
        The function.
        +
        +
      • +
      + + + +
        +
      • +

        synthInv

        +
        public Term synthInv​(java.lang.String symbol,
        +                     Term[] boundVars)
        +
        Synthesize invariant. + + SyGuS v2: + + ( synth-inv <symbol> ( <boundVars>* ) ) +
        +
        +
        Parameters:
        +
        symbol - The name of the invariant.
        +
        boundVars - The parameters to this invariant.
        +
        Returns:
        +
        The invariant.
        +
        +
      • +
      + + + +
        +
      • +

        synthInv

        +
        public Term synthInv​(java.lang.String symbol,
        +                     Term[] boundVars,
        +                     Grammar grammar)
        +
        Synthesize invariant following specified syntactic constraints. + + SyGuS v2: + + ( synth-inv <symbol> ( <boundVars>* ) <g> ) +
        +
        +
        Parameters:
        +
        symbol - The name of the invariant.
        +
        boundVars - The parameters to this invariant.
        +
        grammar - The syntactic constraints.
        +
        Returns:
        +
        The invariant.
        +
        +
      • +
      + + + +
        +
      • +

        addSygusConstraint

        +
        public void addSygusConstraint​(Term term)
        +
        Add a forumla to the set of Sygus constraints. + + SyGuS v2: + + ( constraint <term> ) +
        +
        +
        Parameters:
        +
        term - The formula to add as a constraint.
        +
        +
      • +
      + + + +
        +
      • +

        addSygusAssume

        +
        public void addSygusAssume​(Term term)
        +
        Add a forumla to the set of Sygus assumptions. + + SyGuS v2: + + ( assume <term> ) +
        +
        +
        Parameters:
        +
        term - The formula to add as an assumption.
        +
        +
      • +
      + + + +
        +
      • +

        addSygusInvConstraint

        +
        public void addSygusInvConstraint​(Term inv,
        +                                  Term pre,
        +                                  Term trans,
        +                                  Term post)
        +
        Add a set of Sygus constraints to the current state that correspond to an + invariant synthesis problem. + + SyGuS v2: + + ( inv-constraint <inv> <pre> <trans> <post> ) +
        +
        +
        Parameters:
        +
        inv - The function-to-synthesize.
        +
        pre - The pre-condition.
        +
        trans - The transition relation.
        +
        post - The post-condition.
        +
        +
      • +
      + + + +
        +
      • +

        checkSynth

        +
        public SynthResult checkSynth()
        +
        Try to find a solution for the synthesis conjecture corresponding to the + current list of functions-to-synthesize, universal variables and + constraints. + + SyGuS v2: + + ( check-synth ) +
        +
        +
        Returns:
        +
        The result of the check, which is "solution" if the check found a. + solution in which case solutions are available via + getSynthSolutions, "no solution" if it was determined there is no + solution, or "unknown" otherwise.
        +
        +
      • +
      + + + +
        +
      • +

        checkSynthNext

        +
        public SynthResult checkSynthNext()
        +
        Try to find a next solution for the synthesis conjecture corresponding to + the current list of functions-to-synthesize, universal variables and + constraints. Must be called immediately after a successful call to + check-synth or check-synth-next.
        +
        +
        Returns:
        +
        The result of the check, which is "solution" if the check found a + solution in which case solutions are available via + getSynthSolutions, "no solution" if it was determined there is no + solution, or "unknown" otherwise.
        +
        Note:
        +
        Requires incremental mode. + + SyGuS v2: + + ( check-synth-next ) +
        +
        +
      • +
      + + + +
        +
      • +

        getSynthSolution

        +
        public Term getSynthSolution​(Term term)
        +
        Get the synthesis solution of the given term. + + This method should be called immediately after the solver answers unsat + for sygus input.
        +
        +
        Parameters:
        +
        term - The term for which the synthesis solution is queried.
        +
        Returns:
        +
        The synthesis solution of the given term.
        +
        +
      • +
      + + + +
        +
      • +

        getSynthSolutions

        +
        public Term[] getSynthSolutions​(Term[] terms)
        +
        Get the synthesis solutions of the given terms. + + This method should be called immediately after the solver answers unsat + for sygus input.
        +
        +
        Parameters:
        +
        terms - The terms for which the synthesis solutions is queried.
        +
        Returns:
        +
        The synthesis solutions of the given terms.
        +
        +
      • +
      + + + +
        +
      • +

        getStatistics

        +
        public Statistics getStatistics()
        +
        Returns a snapshot of the current state of the statistic values of this + solver. The returned object is completely decoupled from the solver and + will not change when the solver is used again.
        +
      • +
      + + + +
        +
      • +

        getNullTerm

        +
        public Term getNullTerm()
        +
        +
        Returns:
        +
        Null term.
        +
        +
      • +
      + + + +
        +
      • +

        getNullResult

        +
        public Result getNullResult()
        +
        +
        Returns:
        +
        Null result.
        +
        +
      • +
      + + + +
        +
      • +

        getNullSynthResult

        +
        public SynthResult getNullSynthResult()
        +
        +
        Returns:
        +
        Null synth result.
        +
        +
      • +
      + + + +
        +
      • +

        getNullOp

        +
        public Op getNullOp()
        +
        +
        Returns:
        +
        Null op.
        +
        +
      • +
      + + + +
        +
      • +

        getNullDatatypeDecl

        +
        public DatatypeDecl getNullDatatypeDecl()
        +
        +
        Returns:
        +
        Null op.
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Sort.html b/cvc5-1.0.2/api/java/io/github/cvc5/Sort.html new file mode 100644 index 0000000..8db4c3a --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Sort.html @@ -0,0 +1,1572 @@ + + + + + +Sort + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Sort

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.Comparable<Sort>
    +
    +
    +
    public class Sort
    +extends java.lang.Object
    +implements java.lang.Comparable<Sort>
    +
    The sort of a cvc5 term.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object s)
        +
        Comparison for structural equality.
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        Parameters:
        +
        s - The sort to compare to.
        +
        Returns:
        +
        True if the sorts are equal.
        +
        +
      • +
      + + + +
        +
      • +

        compareTo

        +
        public int compareTo​(Sort s)
        +
        Comparison for ordering on sorts.
        +
        +
        Specified by:
        +
        compareTo in interface java.lang.Comparable<Sort>
        +
        Parameters:
        +
        s - The sort to compare to.
        +
        Returns:
        +
        A negative integer, zero, or a positive integer as this sort + is less than, equal to, or greater than the specified sort.
        +
        +
      • +
      + + + +
        +
      • +

        hasSymbol

        +
        public boolean hasSymbol()
        +
        +
        Returns:
        +
        True if the sort has a symbol.
        +
        +
      • +
      + + + +
        +
      • +

        getSymbol

        +
        public java.lang.String getSymbol()
        +
        +
        Returns:
        +
        The raw symbol of the symbol.
        +
        Note:
        +
        Asserts hasSymbol().
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        Determine if this is the null sort.
        +
        +
        Returns:
        +
        True if this Sort is the null sort.
        +
        +
      • +
      + + + +
        +
      • +

        isBoolean

        +
        public boolean isBoolean()
        +
        Determine if this is the Boolean sort (SMT-LIB: Bool).
        +
        +
        Returns:
        +
        True if this sort is the Boolean sort.
        +
        +
      • +
      + + + +
        +
      • +

        isInteger

        +
        public boolean isInteger()
        +
        Determine if this is the integer sort (SMT-LIB: Int).
        +
        +
        Returns:
        +
        True if this sort is the integer sort.
        +
        +
      • +
      + + + +
        +
      • +

        isReal

        +
        public boolean isReal()
        +
        Determine if this is the real sort (SMT-LIB: Real).
        +
        +
        Returns:
        +
        True if this sort is the real sort.
        +
        +
      • +
      + + + +
        +
      • +

        isString

        +
        public boolean isString()
        +
        Determine if this is the string sort (SMT-LIB: String)..
        +
        +
        Returns:
        +
        True if this sort is the string sort.
        +
        +
      • +
      + + + +
        +
      • +

        isRegExp

        +
        public boolean isRegExp()
        +
        Determine if this is the regular expression sort (SMT-LIB: RegLan).
        +
        +
        Returns:
        +
        True if this sort is the regular expression sort.
        +
        +
      • +
      + + + +
        +
      • +

        isRoundingMode

        +
        public boolean isRoundingMode()
        +
        Determine if this is the rounding mode sort (SMT-LIB: RoundingMode).
        +
        +
        Returns:
        +
        True if this sort is the rounding mode sort.
        +
        +
      • +
      + + + +
        +
      • +

        isBitVector

        +
        public boolean isBitVector()
        +
        Determine if this is a bit-vector sort (SMT-LIB: (_ BitVec i)).
        +
        +
        Returns:
        +
        True if this sort is a bit-vector sort.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPoint

        +
        public boolean isFloatingPoint()
        +
        Determine if this is a floatingpoint sort + (SMT-LIB: (_ FloatingPoint eb sb)).
        +
        +
        Returns:
        +
        True if this sort is a floating-point sort.
        +
        +
      • +
      + + + +
        +
      • +

        isDatatype

        +
        public boolean isDatatype()
        +
        Determine if this is a datatype sort.
        +
        +
        Returns:
        +
        True if this sort is a datatype sort.
        +
        +
      • +
      + + + +
        +
      • +

        isDatatypeConstructor

        +
        public boolean isDatatypeConstructor()
        +
        Determine if this is a datatype constructor sort.
        +
        +
        Returns:
        +
        True if this sort is a datatype constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        isDatatypeSelector

        +
        public boolean isDatatypeSelector()
        +
        Determine if this is a datatype selector sort.
        +
        +
        Returns:
        +
        True if this sort is a datatype selector sort.
        +
        +
      • +
      + + + +
        +
      • +

        isDatatypeTester

        +
        public boolean isDatatypeTester()
        +
        Determine if this is a datatype tester sort.
        +
        +
        Returns:
        +
        True if this sort is a datatype tester sort.
        +
        +
      • +
      + + + +
        +
      • +

        isDatatypeUpdater

        +
        public boolean isDatatypeUpdater()
        +
        Determine if this is a datatype updater sort.
        +
        +
        Returns:
        +
        True if this sort is a datatype updater sort.
        +
        +
      • +
      + + + +
        +
      • +

        isFunction

        +
        public boolean isFunction()
        +
        Determine if this is a function sort.
        +
        +
        Returns:
        +
        True if this sort is a function sort.
        +
        +
      • +
      + + + +
        +
      • +

        isPredicate

        +
        public boolean isPredicate()
        +
        Determine if this is a predicate sort. + + A predicate sort is a function sort that maps to the Boolean sort. All + predicate sorts are also function sorts.
        +
        +
        Returns:
        +
        True if this sort is a predicate sort.
        +
        +
      • +
      + + + +
        +
      • +

        isTuple

        +
        public boolean isTuple()
        +
        Determine if this a tuple sort.
        +
        +
        Returns:
        +
        True if this sort is a tuple sort.
        +
        +
      • +
      + + + +
        +
      • +

        isRecord

        +
        public boolean isRecord()
        +
        Determine if this is a record sort.
        +
        +
        Returns:
        +
        True if the sort is a record sort.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        isArray

        +
        public boolean isArray()
        +
        Determine if this is an array sort.
        +
        +
        Returns:
        +
        True if the sort is an array sort.
        +
        +
      • +
      + + + +
        +
      • +

        isSet

        +
        public boolean isSet()
        +
        Determine if this is a Set sort.
        +
        +
        Returns:
        +
        True if the sort is a Set sort.
        +
        +
      • +
      + + + +
        +
      • +

        isBag

        +
        public boolean isBag()
        +
        Determine if this is a Bag sort.
        +
        +
        Returns:
        +
        True if the sort is a Bag sort.
        +
        +
      • +
      + + + +
        +
      • +

        isSequence

        +
        public boolean isSequence()
        +
        Determine if this is a Sequence sort.
        +
        +
        Returns:
        +
        True if the sort is a Sequence sort.
        +
        +
      • +
      + + + +
        +
      • +

        isUninterpretedSort

        +
        public boolean isUninterpretedSort()
        +
        Determine if this is an uninterpreted sort.
        +
        +
        Returns:
        +
        True if this is an uninterpreted sort.
        +
        +
      • +
      + + + +
        +
      • +

        isUninterpretedSortConstructor

        +
        public boolean isUninterpretedSortConstructor()
        +
        Determine if this is an uninterpreted sort constructor. + + An uninterpreted sort constructor has arity > 0 and can be instantiated + to construct uninterpreted sorts with given sort parameters.
        +
        +
        Returns:
        +
        True if this is a sort constructor kind.
        +
        +
      • +
      + + + +
        +
      • +

        isInstantiated

        +
        public boolean isInstantiated()
        +
        Determine if this is an instantiated (parametric datatype or uninterpreted + sort constructor) sort. + + An instantiated sort is a sort that has been constructed from + instantiating a sort with sort arguments + (see instantiate(Sort[])).
        +
        +
        Returns:
        +
        True if this is an instantiated sort.
        +
        +
      • +
      + + + +
        +
      • +

        getUninterpretedSortConstructor

        +
        public Sort getUninterpretedSortConstructor()
        +
        Get the associated uninterpreted sort constructor of an instantiated + uninterpreted sort.
        +
        +
        Returns:
        +
        The uninterpreted sort constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatype

        +
        public Datatype getDatatype()
        +
        +
        Returns:
        +
        The underlying datatype of a datatype sort.
        +
        +
      • +
      + + + +
        +
      • +

        instantiate

        +
        public Sort instantiate​(Sort[] params)
        +
        Instantiate a parameterized datatype sort or uninterpreted sort + constructor sort. + + Create sorts parameter with Solver.mkParamSort(String)).
        +
        +
        Parameters:
        +
        params - The list of sort parameters to instantiate with.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        getInstantiatedParameters

        +
        public Sort[] getInstantiatedParameters()
        +
        Get the sorts used to instantiate the sort parameters of a parametric + sort (parametric datatype or uninterpreted sort constructor sort, + see instantiate(Sort[])).
        +
        +
        Returns:
        +
        The sorts used to instantiate the sort parameters of a + parametric sort.
        +
        +
      • +
      + + + +
        +
      • +

        substitute

        +
        public Sort substitute​(Sort sort,
        +                       Sort replacement)
        +
        Substitution of Sorts. + + Note that this replacement is applied during a pre-order traversal and + only once to the sort. It is not run until fix point.
        +
        +
        Parameters:
        +
        sort - The subsort to be substituted within this sort.
        +
        replacement - The sort replacing the substituted subsort.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        substitute

        +
        public Sort substitute​(Sort[] sorts,
        +                       Sort[] replacements)
        +
        Simultaneous substitution of Sorts. + + Note that this replacement is applied during a pre-order traversal and + only once to the sort. It is not run until fix point. In the case that + sorts contains duplicates, the replacement earliest in the list takes + priority. + + For example, + (Array A B).substitute({A, C}, {(Array C D), (Array A B)}) will + return (Array (Array C D) B).
        +
        +
        Parameters:
        +
        sorts - The subsorts to be substituted within this sort.
        +
        replacements - The sort replacing the substituted subsorts.
        +
        Note:
        +
        This method is experimental and may change in future versions.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeConstructorArity

        +
        public int getDatatypeConstructorArity()
        +
        +
        Returns:
        +
        The arity of a datatype constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeConstructorDomainSorts

        +
        public Sort[] getDatatypeConstructorDomainSorts()
        +
        +
        Returns:
        +
        The domain sorts of a datatype constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeConstructorCodomainSort

        +
        public Sort getDatatypeConstructorCodomainSort()
        +
        +
        Returns:
        +
        The codomain sort of a datatype constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeSelectorDomainSort

        +
        public Sort getDatatypeSelectorDomainSort()
        +
        +
        Returns:
        +
        The domain sort of a datatype selector sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeSelectorCodomainSort

        +
        public Sort getDatatypeSelectorCodomainSort()
        +
        +
        Returns:
        +
        The codomain sort of a datatype selector sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeTesterDomainSort

        +
        public Sort getDatatypeTesterDomainSort()
        +
        +
        Returns:
        +
        The domain sort of a datatype tester sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeTesterCodomainSort

        +
        public Sort getDatatypeTesterCodomainSort()
        +
        +
        Returns:
        +
        The codomain sort of a datatype tester sort, which is the Boolean + sort.
        +
        +
      • +
      + + + +
        +
      • +

        getFunctionArity

        +
        public int getFunctionArity()
        +
        +
        Returns:
        +
        The arity of a function sort.
        +
        +
      • +
      + + + +
        +
      • +

        getFunctionDomainSorts

        +
        public Sort[] getFunctionDomainSorts()
        +
        +
        Returns:
        +
        The domain sorts of a function sort.
        +
        +
      • +
      + + + +
        +
      • +

        getFunctionCodomainSort

        +
        public Sort getFunctionCodomainSort()
        +
        +
        Returns:
        +
        The codomain sort of a function sort.
        +
        +
      • +
      + + + +
        +
      • +

        getArrayIndexSort

        +
        public Sort getArrayIndexSort()
        +
        +
        Returns:
        +
        The array index sort of an array sort.
        +
        +
      • +
      + + + +
        +
      • +

        getArrayElementSort

        +
        public Sort getArrayElementSort()
        +
        +
        Returns:
        +
        The array element sort of an array element sort.
        +
        +
      • +
      + + + +
        +
      • +

        getSetElementSort

        +
        public Sort getSetElementSort()
        +
        +
        Returns:
        +
        The element sort of a set sort.
        +
        +
      • +
      + + + +
        +
      • +

        getBagElementSort

        +
        public Sort getBagElementSort()
        +
        +
        Returns:
        +
        The element sort of a bag sort.
        +
        +
      • +
      + + + +
        +
      • +

        getSequenceElementSort

        +
        public Sort getSequenceElementSort()
        +
        +
        Returns:
        +
        The element sort of a sequence sort.
        +
        +
      • +
      + + + +
        +
      • +

        getUninterpretedSortConstructorArity

        +
        public int getUninterpretedSortConstructorArity()
        +
        +
        Returns:
        +
        The arity of an uninterpreted sort constructor sort.
        +
        +
      • +
      + + + +
        +
      • +

        getBitVectorSize

        +
        public int getBitVectorSize()
        +
        +
        Returns:
        +
        The bit-width of the bit-vector sort.
        +
        +
      • +
      + + + +
        +
      • +

        getFloatingPointExponentSize

        +
        public int getFloatingPointExponentSize()
        +
        +
        Returns:
        +
        The bit-width of the exponent of the floating-point sort.
        +
        +
      • +
      + + + +
        +
      • +

        getFloatingPointSignificandSize

        +
        public int getFloatingPointSignificandSize()
        +
        +
        Returns:
        +
        The width of the significand of the floating-point sort.
        +
        +
      • +
      + + + +
        +
      • +

        getDatatypeArity

        +
        public int getDatatypeArity()
        +
        +
        Returns:
        +
        The arity of a datatype sort.
        +
        +
      • +
      + + + +
        +
      • +

        getTupleLength

        +
        public int getTupleLength()
        +
        +
        Returns:
        +
        The length of a tuple sort.
        +
        +
      • +
      + + + +
        +
      • +

        getTupleSorts

        +
        public Sort[] getTupleSorts()
        +
        +
        Returns:
        +
        The element sorts of a tuple sort.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Stat.html b/cvc5-1.0.2/api/java/io/github/cvc5/Stat.html new file mode 100644 index 0000000..646b1e1 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Stat.html @@ -0,0 +1,598 @@ + + + + + +Stat + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Stat

+
+
+ +
+
    +
  • +
    +
    public class Stat
    +extends java.lang.Object
    +
    Represents a snapshot of a single statistic value. + A value can be of type long, double, String or a histogram + (Map<String, Long>). + The value type can be queried (using isInt(), isDouble(), etc.) and + the stored value can be accessed (using getInt(), getDouble(), etc.). + It is possible to query whether this statistic is an internal statistic by + isInternal() and whether its value is the default value by isDefault().
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      protected voiddeletePointer​(long pointer) 
      doublegetDouble() +
      Return the double value.
      +
      java.util.Map<java.lang.String,​java.lang.Long>getHistogram() +
      Return the histogram value.
      +
      longgetInt() +
      Return the integer value.
      +
      longgetPointer() 
      SolvergetSolver() 
      java.lang.StringgetString() +
      Return the string value.
      +
      booleanisDefault() +
      Does this value hold the default value?
      +
      booleanisDouble() +
      Is this value a double?
      +
      booleanisHistogram() +
      Is this value a histogram?
      +
      booleanisInt() +
      Is this value an integer?
      +
      booleanisInternal() +
      Is this value intended for internal use only?
      +
      booleanisString() +
      Is this value a string?
      +
      java.lang.StringtoString() 
      protected java.lang.StringtoString​(long pointer) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this Stat.
        +
        +
      • +
      + + + +
        +
      • +

        isInternal

        +
        public boolean isInternal()
        +
        Is this value intended for internal use only?
        +
        +
        Returns:
        +
        Whether this is an internal statistic.
        +
        +
      • +
      + + + +
        +
      • +

        isDefault

        +
        public boolean isDefault()
        +
        Does this value hold the default value?
        +
        +
        Returns:
        +
        Whether this is a defaulted statistic.
        +
        +
      • +
      + + + +
        +
      • +

        isInt

        +
        public boolean isInt()
        +
        Is this value an integer?
        +
        +
        Returns:
        +
        Whether the value is an integer.
        +
        +
      • +
      + + + +
        +
      • +

        getInt

        +
        public long getInt()
        +
        Return the integer value.
        +
        +
        Returns:
        +
        The integer value.
        +
        +
      • +
      + + + +
        +
      • +

        isDouble

        +
        public boolean isDouble()
        +
        Is this value a double?
        +
        +
        Returns:
        +
        Whether the value is a double.
        +
        +
      • +
      + + + +
        +
      • +

        getDouble

        +
        public double getDouble()
        +
        Return the double value.
        +
        +
        Returns:
        +
        The double value.
        +
        +
      • +
      + + + +
        +
      • +

        isString

        +
        public boolean isString()
        +
        Is this value a string?
        +
        +
        Returns:
        +
        Whether the value is a string.
        +
        +
      • +
      + + + +
        +
      • +

        getString

        +
        public java.lang.String getString()
        +
        Return the string value.
        +
        +
        Returns:
        +
        The string value.
        +
        +
      • +
      + + + +
        +
      • +

        isHistogram

        +
        public boolean isHistogram()
        +
        Is this value a histogram?
        +
        +
        Returns:
        +
        Whether the value is a histogram.
        +
        +
      • +
      + + + +
        +
      • +

        getHistogram

        +
        public java.util.Map<java.lang.String,​java.lang.Long> getHistogram()
        +
        Return the histogram value.
        +
        +
        Returns:
        +
        The histogram value.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.ConstIterator.html b/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.ConstIterator.html new file mode 100644 index 0000000..ee2e369 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.ConstIterator.html @@ -0,0 +1,354 @@ + + + + + +Statistics.ConstIterator + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Statistics.ConstIterator

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.util.Iterator<java.util.Map.Entry<java.lang.String,​Stat>>
    +
    +
    +
    Enclosing class:
    +
    Statistics
    +
    +
    +
    public class Statistics.ConstIterator
    +extends java.lang.Object
    +implements java.util.Iterator<java.util.Map.Entry<java.lang.String,​Stat>>
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ConstIterator() 
      ConstIterator​(boolean internal, + boolean defaulted) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanhasNext() 
      java.util.Map.Entry<java.lang.String,​Stat>next() 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
        +
      • + + +

        Methods inherited from interface java.util.Iterator

        +forEachRemaining, remove
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ConstIterator

        +
        public ConstIterator​(boolean internal,
        +                     boolean defaulted)
        +
      • +
      + + + +
        +
      • +

        ConstIterator

        +
        public ConstIterator()
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        hasNext

        +
        public boolean hasNext()
        +
        +
        Specified by:
        +
        hasNext in interface java.util.Iterator<java.util.Map.Entry<java.lang.String,​Stat>>
        +
        +
      • +
      + + + +
        +
      • +

        next

        +
        public java.util.Map.Entry<java.lang.String,​Stat> next()
        +
        +
        Specified by:
        +
        next in interface java.util.Iterator<java.util.Map.Entry<java.lang.String,​Stat>>
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.html b/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.html new file mode 100644 index 0000000..ab947ef --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Statistics.html @@ -0,0 +1,475 @@ + + + + + +Statistics + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Statistics

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.Iterable<java.util.Map.Entry<java.lang.String,​Stat>>
    +
    +
    +
    public class Statistics
    +extends java.lang.Object
    +implements java.lang.Iterable<java.util.Map.Entry<java.lang.String,​Stat>>
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Nested Class Summary

      + + + + + + + + + + + + +
      Nested Classes 
      Modifier and TypeClassDescription
      class Statistics.ConstIterator 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      protected longpointer 
      protected Solversolver 
      +
    • +
    +
    + +
    + +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this Statistics.
        +
        +
      • +
      + + + +
        +
      • +

        get

        +
        public Stat get​(java.lang.String name)
        +
        Retrieve the statistic with the given name. + Asserts that a statistic with the given name actually exists and throws + a CVC5ApiRecoverableException if it does not.
        +
        +
        Parameters:
        +
        name - Name of the statistic.
        +
        Returns:
        +
        The statistic with the given name.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        iterator

        +
        public Statistics.ConstIterator iterator()
        +
        +
        Specified by:
        +
        iterator in interface java.lang.Iterable<java.util.Map.Entry<java.lang.String,​Stat>>
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/SynthResult.html b/cvc5-1.0.2/api/java/io/github/cvc5/SynthResult.html new file mode 100644 index 0000000..939a8fc --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/SynthResult.html @@ -0,0 +1,463 @@ + + + + + +SynthResult + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class SynthResult

+
+
+ +
+
    +
  • +
    +
    public class SynthResult
    +extends java.lang.Object
    +
    Encapsulation of a solver synth result. + + This is the return value of the API methods: + - Solver.checkSynth() + - Solver.checkSynthNext() + + which we call synthesis queries. This class indicates whether the + synthesis query has a solution, has no solution, or is unknown.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if SynthResult is empty, i.e., a nullary SynthResult, and not + an actual result returned from a synthesis query.
        +
        +
      • +
      + + + +
        +
      • +

        hasSolution

        +
        public boolean hasSolution()
        +
        +
        Returns:
        +
        True if the synthesis query has a solution.
        +
        +
      • +
      + + + +
        +
      • +

        hasNoSolution

        +
        public boolean hasNoSolution()
        +
        +
        Returns:
        +
        True if the synthesis query has no solution. In this case, it was + determined there was no solution.
        +
        +
      • +
      + + + +
        +
      • +

        isUnknown

        +
        public boolean isUnknown()
        +
        +
        Returns:
        +
        True if the result of the synthesis query could not be determined.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this result.
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Term.ConstIterator.html b/cvc5-1.0.2/api/java/io/github/cvc5/Term.ConstIterator.html new file mode 100644 index 0000000..d4a7ed8 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Term.ConstIterator.html @@ -0,0 +1,339 @@ + + + + + +Term.ConstIterator + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Term.ConstIterator

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.util.Iterator<Term>
    +
    +
    +
    Enclosing class:
    +
    Term
    +
    +
    +
    public class Term.ConstIterator
    +extends java.lang.Object
    +implements java.util.Iterator<Term>
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      ConstIterator() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanhasNext() 
      Termnext() 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
        +
      • + + +

        Methods inherited from interface java.util.Iterator

        +forEachRemaining, remove
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        ConstIterator

        +
        public ConstIterator()
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        hasNext

        +
        public boolean hasNext()
        +
        +
        Specified by:
        +
        hasNext in interface java.util.Iterator<Term>
        +
        +
      • +
      + + + +
        +
      • +

        next

        +
        public Term next()
        +
        +
        Specified by:
        +
        next in interface java.util.Iterator<Term>
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Term.html b/cvc5-1.0.2/api/java/io/github/cvc5/Term.html new file mode 100644 index 0000000..89aa6b3 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Term.html @@ -0,0 +1,1576 @@ + + + + + +Term + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Term

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.lang.Comparable<Term>, java.lang.Iterable<Term>
    +
    +
    +
    public class Term
    +extends java.lang.Object
    +implements java.lang.Comparable<Term>, java.lang.Iterable<Term>
    +
    A cvc5 Term.
    +
  • +
+
+
+ +
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        solver

        +
        protected final Solver solver
        +
      • +
      + + + +
        +
      • +

        pointer

        +
        protected long pointer
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        deletePointer

        +
        protected void deletePointer​(long pointer)
        +
      • +
      + + + +
        +
      • +

        getPointer

        +
        public long getPointer()
        +
      • +
      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object t)
        +
        Syntactic equality operator. + Return true if both terms are syntactically identical. + Both terms must belong to the same solver object.
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        Parameters:
        +
        t - The term to compare to for equality.
        +
        Returns:
        +
        True if the terms are equal.
        +
        +
      • +
      + + + +
        +
      • +

        compareTo

        +
        public int compareTo​(Term t)
        +
        Comparison for ordering on terms.
        +
        +
        Specified by:
        +
        compareTo in interface java.lang.Comparable<Term>
        +
        Parameters:
        +
        t - The term to compare to.
        +
        Returns:
        +
        A negative integer, zero, or a positive integer as this term. + is less than, equal to, or greater than the specified term.
        +
        +
      • +
      + + + +
        +
      • +

        getNumChildren

        +
        public int getNumChildren()
        +
        +
        Returns:
        +
        The number of children of this term.
        +
        +
      • +
      + + + +
        +
      • +

        getChild

        +
        public Term getChild​(int index)
        +              throws CVC5ApiException
        +
        Get the child term at a given index.
        +
        +
        Parameters:
        +
        index - The index of the child term to return.
        +
        Returns:
        +
        The child term with the given index.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        getId

        +
        public long getId()
        +
        +
        Returns:
        +
        The id of this term.
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getSort

        +
        public Sort getSort()
        +
        +
        Returns:
        +
        The sort of this term.
        +
        +
      • +
      + + + +
        +
      • +

        substitute

        +
        public Term substitute​(Term term,
        +                       Term replacement)
        +
        Replace term with replacement in this term.
        +
        +
        Returns:
        +
        The result of replacing term with replacement in + this term.
        +
        Note:
        +
        This replacement is applied during a pre-order traversal and + only once (it is not run until fixed point).
        +
        +
      • +
      + + + +
        +
      • +

        substitute

        +
        public Term substitute​(Term[] terms,
        +                       Term[] replacements)
        +
        Simultaneously replace terms with replacements in this + term. + + In the case that terms contains duplicates, the replacement earliest in + the vector takes priority. For example, calling substitute on + f(x,y) with terms = { x, z }, + replacements = { g(z), w } results in the term + f(g(z),y).
        +
        +
        Returns:
        +
        The result of simultaneously replacing terms with + replacements in this term.
        +
        Note:
        +
        This replacement is applied during a pre-order traversal and + only once (it is not run until fixed point).
        +
        +
      • +
      + + + +
        +
      • +

        hasOp

        +
        public boolean hasOp()
        +
        +
        Returns:
        +
        True iff this term has an operator.
        +
        +
      • +
      + + + +
        +
      • +

        getOp

        +
        public Op getOp()
        +
        +
        Returns:
        +
        The Op used to create this term.
        +
        Note:
        +
        This is safe to call when hasOp() returns true.
        +
        +
      • +
      + + + +
        +
      • +

        hasSymbol

        +
        public boolean hasSymbol()
        +
        +
        Returns:
        +
        True if the term has a symbol.
        +
        +
      • +
      + + + +
        +
      • +

        getSymbol

        +
        public java.lang.String getSymbol()
        +
        Asserts hasSymbol().
        +
        +
        Returns:
        +
        The raw symbol of the term.
        +
        +
      • +
      + + + +
        +
      • +

        isNull

        +
        public boolean isNull()
        +
        +
        Returns:
        +
        True if this Term is a null term.
        +
        +
      • +
      + + + +
        +
      • +

        notTerm

        +
        public Term notTerm()
        +
        Boolean negation.
        +
        +
        Returns:
        +
        The Boolean negation of this term.
        +
        +
      • +
      + + + +
        +
      • +

        andTerm

        +
        public Term andTerm​(Term t)
        +
        Boolean and.
        +
        +
        Parameters:
        +
        t - A Boolean term.
        +
        Returns:
        +
        The conjunction of this term and the given term.
        +
        +
      • +
      + + + +
        +
      • +

        orTerm

        +
        public Term orTerm​(Term t)
        +
        Boolean or.
        +
        +
        Parameters:
        +
        t - A Boolean term.
        +
        Returns:
        +
        The disjunction of this term and the given term.
        +
        +
      • +
      + + + +
        +
      • +

        xorTerm

        +
        public Term xorTerm​(Term t)
        +
        Boolean exclusive or.
        +
        +
        Parameters:
        +
        t - A Boolean term.
        +
        Returns:
        +
        The exclusive disjunction of this term and the given term.
        +
        +
      • +
      + + + +
        +
      • +

        eqTerm

        +
        public Term eqTerm​(Term t)
        +
        Equality.
        +
        +
        Parameters:
        +
        t - A Boolean term.
        +
        Returns:
        +
        The Boolean equivalence of this term and the given term.
        +
        +
      • +
      + + + +
        +
      • +

        impTerm

        +
        public Term impTerm​(Term t)
        +
        Boolean implication.
        +
        +
        Parameters:
        +
        t - A Boolean term.
        +
        Returns:
        +
        The implication of this term and the given term.
        +
        +
      • +
      + + + +
        +
      • +

        iteTerm

        +
        public Term iteTerm​(Term thenTerm,
        +                    Term elseTerm)
        +
        If-then-else with this term as the Boolean condition.
        +
        +
        Parameters:
        +
        thenTerm - The 'then' term.
        +
        elseTerm - The 'else' term.
        +
        Returns:
        +
        The if-then-else term with this term as the Boolean condition.
        +
        +
      • +
      + + + +
        +
      • +

        toString

        +
        protected java.lang.String toString​(long pointer)
        +
        +
        Returns:
        +
        A string representation of this term.
        +
        +
      • +
      + + + +
        +
      • +

        getRealOrIntegerValueSign

        +
        public int getRealOrIntegerValueSign()
        +
        Get integer or real value sign. Must be called on integer or real values, + or otherwise an exception is thrown.
        +
        +
        Returns:
        +
        0 if this term is zero, -1 if this term is a negative real or + integer value, 1 if this term is a positive real or integer value.
        +
        +
      • +
      + + + +
        +
      • +

        isIntegerValue

        +
        public boolean isIntegerValue()
        +
        +
        Returns:
        +
        True if the term is an integer value.
        +
        +
      • +
      + + + +
        +
      • +

        getIntegerValue

        +
        public java.math.BigInteger getIntegerValue()
        +
        Asserts isIntegerValue().
        +
        +
        Returns:
        +
        The integer represented by this term.
        +
        +
      • +
      + + + +
        +
      • +

        isStringValue

        +
        public boolean isStringValue()
        +
        +
        Returns:
        +
        True if the term is a string constant.
        +
        +
      • +
      + + + +
        +
      • +

        getStringValue

        +
        public java.lang.String getStringValue()
        +
        +
        Returns:
        +
        The stored string constant. + + Asserts isString().
        +
        Note:
        +
        This method is not to be confused with Object.toString()) + which returns the term in some string representation, whatever + data it may hold.
        +
        +
      • +
      + + + +
        +
      • +

        isRealValue

        +
        public boolean isRealValue()
        +
        +
        Returns:
        +
        True if the term is a rational value.
        +
        +
      • +
      + + + +
        +
      • +

        getRealValue

        +
        public Pair<java.math.BigInteger,​java.math.BigInteger> getRealValue()
        +
        Asserts isRealValue().
        +
        +
        Returns:
        +
        The representation of a rational value as a pair of its numerator. + and denominator.
        +
        +
      • +
      + + + +
        +
      • +

        isConstArray

        +
        public boolean isConstArray()
        +
        +
        Returns:
        +
        True if the term is a constant array.
        +
        +
      • +
      + + + +
        +
      • +

        getConstArrayBase

        +
        public Term getConstArrayBase()
        +
        Asserts isConstArray().
        +
        +
        Returns:
        +
        The base (element stored at all indices) of a constant array.
        +
        +
      • +
      + + + +
        +
      • +

        isBooleanValue

        +
        public boolean isBooleanValue()
        +
        +
        Returns:
        +
        True if the term is a Boolean value.
        +
        +
      • +
      + + + +
        +
      • +

        getBooleanValue

        +
        public boolean getBooleanValue()
        +
        Asserts isBooleanValue().
        +
        +
        Returns:
        +
        The representation of a Boolean value as a native Boolean value.
        +
        +
      • +
      + + + +
        +
      • +

        isBitVectorValue

        +
        public boolean isBitVectorValue()
        +
        +
        Returns:
        +
        True if the term is a bit-vector value.
        +
        +
      • +
      + + + +
        +
      • +

        getBitVectorValue

        +
        public java.lang.String getBitVectorValue()
        +                                   throws CVC5ApiException
        +
        Asserts isBitVectorValue().
        +
        +
        Returns:
        +
        The representation of a bit-vector value in bit string + representation.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        getBitVectorValue

        +
        public java.lang.String getBitVectorValue​(int base)
        +                                   throws CVC5ApiException
        +
        Get the string representation of a bit-vector value. + + Supported values for base are 2 (bit string), 10 + (decimal string) or 16 (hexadecimal string).
        +
        +
        Returns:
        +
        The string representation of a bit-vector value.
        +
        Throws:
        +
        CVC5ApiException
        +
        Note:
        +
        Asserts Term#isBitVectorValue().
        +
        +
      • +
      + + + +
        +
      • +

        isUninterpretedSortValue

        +
        public boolean isUninterpretedSortValue()
        +
        +
        Returns:
        +
        True if the term is an uninterpreted sort value.
        +
        +
      • +
      + + + +
        +
      • +

        getUninterpretedSortValue

        +
        public java.lang.String getUninterpretedSortValue()
        +
        Asserts isUninterpretedSortValue().
        +
        +
        Returns:
        +
        The representation of an uninterpreted sort value as a string.
        +
        +
      • +
      + + + +
        +
      • +

        isRoundingModeValue

        +
        public boolean isRoundingModeValue()
        +
        +
        Returns:
        +
        True if the term is a floating-point rounding mode value.
        +
        +
      • +
      + + + +
        +
      • +

        getRoundingModeValue

        +
        public RoundingMode getRoundingModeValue()
        +                                  throws CVC5ApiException
        +
        Asserts isRoundingModeValue().
        +
        +
        Returns:
        +
        The floating-point rounding mode value held by the term.
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        isTupleValue

        +
        public boolean isTupleValue()
        +
        +
        Returns:
        +
        True if the term is a tuple value.
        +
        +
      • +
      + + + +
        +
      • +

        getTupleValue

        +
        public Term[] getTupleValue()
        +
        Asserts isTupleValue().
        +
        +
        Returns:
        +
        The representation of a tuple value as a vector of terms.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointPosZero

        +
        public boolean isFloatingPointPosZero()
        +
        +
        Returns:
        +
        True if the term is the floating-point value for positive zero.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointNegZero

        +
        public boolean isFloatingPointNegZero()
        +
        +
        Returns:
        +
        True if the term is the floating-point value for negative zero.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointPosInf

        +
        public boolean isFloatingPointPosInf()
        +
        +
        Returns:
        +
        True if the term is the floating-point value for positive. + infinity.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointNegInf

        +
        public boolean isFloatingPointNegInf()
        +
        +
        Returns:
        +
        True if the term is the floating-point value for negative. + infinity.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointNaN

        +
        public boolean isFloatingPointNaN()
        +
        +
        Returns:
        +
        True if the term is the floating-point value for not a number.
        +
        +
      • +
      + + + +
        +
      • +

        isFloatingPointValue

        +
        public boolean isFloatingPointValue()
        +
        +
        Returns:
        +
        True if the term is a floating-point value.
        +
        +
      • +
      + + + +
        +
      • +

        getFloatingPointValue

        +
        public Triplet<java.lang.Long,​java.lang.Long,​Term> getFloatingPointValue()
        +
        Asserts isFloatingPointValue().
        +
        +
        Returns:
        +
        The representation of a floating-point value as a tuple of the. + exponent width, the significand width and a bit-vector value.
        +
        +
      • +
      + + + +
        +
      • +

        isSetValue

        +
        public boolean isSetValue()
        +
        +
        Returns:
        +
        True if the term is a set value.
        +
        +
      • +
      + + + +
        +
      • +

        getSetValue

        +
        public java.util.Set<Term> getSetValue()
        +
        Asserts isSetValue().
        +
        +
        Returns:
        +
        The representation of a set value as a set of terms.
        +
        +
      • +
      + + + +
        +
      • +

        isSequenceValue

        +
        public boolean isSequenceValue()
        +
        +
        Returns:
        +
        True if the term is a sequence value.
        +
        +
      • +
      + + + +
        +
      • +

        getSequenceValue

        +
        public Term[] getSequenceValue()
        +
        Asserts isSequenceValue().
        +
        +
        Returns:
        +
        The representation of a sequence value as a vector of terms.
        +
        Note:
        +
        It is usually necessary for sequences to call + Solver.simplify(Term) to turn a sequence that is + constructed by, e.g., concatenation of unit sequences, into a + sequence value.
        +
        +
      • +
      + + + +
        +
      • +

        isCardinalityConstraint

        +
        public boolean isCardinalityConstraint()
        +
        +
        Returns:
        +
        True if the term is a cardinality constraint.
        +
        +
      • +
      + + + +
        +
      • +

        getCardinalityConstraint

        +
        public Pair<Sort,​java.math.BigInteger> getCardinalityConstraint()
        +
        Asserts isCardinalityConstraint().
        +
        +
        Returns:
        +
        The sort the cardinality constraint is for and its upper bound.
        +
        +
      • +
      + + + +
        +
      • +

        iterator

        +
        public java.util.Iterator<Term> iterator()
        +
        +
        Specified by:
        +
        iterator in interface java.lang.Iterable<Term>
        +
        +
      • +
      + + + +
        +
      • +

        getSolver

        +
        public Solver getSolver()
        +
      • +
      + + + +
        +
      • +

        toString

        +
        public java.lang.String toString()
        +
        +
        Overrides:
        +
        toString in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Triplet.html b/cvc5-1.0.2/api/java/io/github/cvc5/Triplet.html new file mode 100644 index 0000000..050cf3d --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Triplet.html @@ -0,0 +1,381 @@ + + + + + +Triplet + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Triplet<A,​B,​C>

+
+
+ +
+
    +
  • +
    +
    public class Triplet<A,​B,​C>
    +extends java.lang.Object
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Summary

      + + + + + + + + + + + + + + + + + + + + + + +
      Fields 
      Modifier and TypeFieldDescription
      Afirst 
      Bsecond 
      Cthird 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      Triplet​(A first, + B second, + C third) 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + +
      All Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      booleanequals​(java.lang.Object object) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Field Detail

      + + + +
        +
      • +

        first

        +
        public A first
        +
      • +
      + + + +
        +
      • +

        second

        +
        public B second
        +
      • +
      + + + +
        +
      • +

        third

        +
        public C third
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Constructor Detail

      + + + + + +
        +
      • +

        Triplet

        +
        public Triplet​(A first,
        +               B second,
        +               C third)
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        equals

        +
        public boolean equals​(java.lang.Object object)
        +
        +
        Overrides:
        +
        equals in class java.lang.Object
        +
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/UnknownExplanation.html b/cvc5-1.0.2/api/java/io/github/cvc5/UnknownExplanation.html new file mode 100644 index 0000000..d1d245e --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/UnknownExplanation.html @@ -0,0 +1,526 @@ + + + + + +UnknownExplanation + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Enum UnknownExplanation

+
+
+ +
+
    +
  • +
    +
    All Implemented Interfaces:
    +
    java.io.Serializable, java.lang.Comparable<UnknownExplanation>
    +
    +
    +
    public enum UnknownExplanation
    +extends java.lang.Enum<UnknownExplanation>
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      Enum Constants 
      Enum ConstantDescription
      INCOMPLETE +
      Incomplete theory solver.
      +
      INTERRUPTED +
      Solver was interrupted.
      +
      MEMOUT +
      Memory limit reached.
      +
      OTHER +
      Other reason.
      +
      REQUIRES_FULL_CHECK +
      Full satisfiability check required (e.g., if only preprocessing was + performed).
      +
      RESOURCEOUT +
      Resource limit reached.
      +
      TIMEOUT +
      Time limit reached.
      +
      UNKNOWN_REASON +
      No specific reason given.
      +
      UNSUPPORTED +
      Unsupported feature encountered.
      +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Static Methods Instance Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static UnknownExplanationfromInt​(int value) 
      intgetValue() 
      static UnknownExplanationvalueOf​(java.lang.String name) +
      Returns the enum constant of this type with the specified name.
      +
      static UnknownExplanation[]values() +
      Returns an array containing the constants of this enum type, in +the order they are declared.
      +
      +
        +
      • + + +

        Methods inherited from class java.lang.Enum

        +clone, compareTo, equals, finalize, getDeclaringClass, hashCode, name, ordinal, toString, valueOf
      • +
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +getClass, notify, notifyAll, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Enum Constant Detail

      + + + +
        +
      • +

        REQUIRES_FULL_CHECK

        +
        public static final UnknownExplanation REQUIRES_FULL_CHECK
        +
        Full satisfiability check required (e.g., if only preprocessing was + performed).
        +
      • +
      + + + +
        +
      • +

        INCOMPLETE

        +
        public static final UnknownExplanation INCOMPLETE
        +
        Incomplete theory solver.
        +
      • +
      + + + + + + + +
        +
      • +

        RESOURCEOUT

        +
        public static final UnknownExplanation RESOURCEOUT
        +
        Resource limit reached.
        +
      • +
      + + + + + + + +
        +
      • +

        INTERRUPTED

        +
        public static final UnknownExplanation INTERRUPTED
        +
        Solver was interrupted.
        +
      • +
      + + + +
        +
      • +

        UNSUPPORTED

        +
        public static final UnknownExplanation UNSUPPORTED
        +
        Unsupported feature encountered.
        +
      • +
      + + + + + + + +
        +
      • +

        UNKNOWN_REASON

        +
        public static final UnknownExplanation UNKNOWN_REASON
        +
        No specific reason given.
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        values

        +
        public static UnknownExplanation[] values()
        +
        Returns an array containing the constants of this enum type, in +the order they are declared. This method may be used to iterate +over the constants as follows: +
        +for (UnknownExplanation c : UnknownExplanation.values())
        +    System.out.println(c);
        +
        +
        +
        Returns:
        +
        an array containing the constants of this enum type, in the order they are declared
        +
        +
      • +
      + + + +
        +
      • +

        valueOf

        +
        public static UnknownExplanation valueOf​(java.lang.String name)
        +
        Returns the enum constant of this type with the specified name. +The string must match exactly an identifier used to declare an +enum constant in this type. (Extraneous whitespace characters are +not permitted.)
        +
        +
        Parameters:
        +
        name - the name of the enum constant to be returned.
        +
        Returns:
        +
        the enum constant with the specified name
        +
        Throws:
        +
        java.lang.IllegalArgumentException - if this enum type has no constant with the specified name
        +
        java.lang.NullPointerException - if the argument is null
        +
        +
      • +
      + + + + + + + +
        +
      • +

        getValue

        +
        public int getValue()
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/Utils.html b/cvc5-1.0.2/api/java/io/github/cvc5/Utils.html new file mode 100644 index 0000000..b619922 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/Utils.html @@ -0,0 +1,508 @@ + + + + + +Utils + + + + + + + + + + + + + +
+ +
+ +
+
+ +

Class Utils

+
+
+ +
+
    +
  • +
    +
    public class Utils
    +extends java.lang.Object
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Summary

      + + + + + + + + + + +
      Constructors 
      ConstructorDescription
      Utils() 
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Summary

      + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
      All Methods Static Methods Concrete Methods 
      Modifier and TypeMethodDescription
      static <K> Pair<K,​java.lang.Long>[]getPairs​(Pair<K,​? extends io.github.cvc5.AbstractPointer>[] abstractPointers) 
      static long[]getPointers​(io.github.cvc5.IPointer[] objects) +
      get pointers from one dimensional array
      +
      static long[][]getPointers​(io.github.cvc5.IPointer[][] objects) +
      get pointers from two dimensional matrix
      +
      static java.lang.StringgetRational​(Pair<java.math.BigInteger,​java.math.BigInteger> pair) +
      Convert a pair of BigIntegers to a rational string a/b
      +
      static Pair<java.math.BigInteger,​java.math.BigInteger>getRational​(java.lang.String rational) +
      Convert a rational string a/b to a pair of BigIntegers
      +
      static Sort[]getSorts​(Solver solver, + long[] pointers) +
      return sorts array from array of pointers
      +
      static Term[]getTerms​(Solver solver, + long[] pointers) +
      return terms array from array of pointers
      +
      static voidloadLibraries() +
      load cvc5 jni library
      +
      static voidvalidateUnsigned​(int[] integers, + java.lang.String name) 
      static voidvalidateUnsigned​(int integer, + java.lang.String name) 
      static voidvalidateUnsigned​(long[] integers, + java.lang.String name) 
      static voidvalidateUnsigned​(long integer, + java.lang.String name) 
      +
        +
      • + + +

        Methods inherited from class java.lang.Object

        +clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
      • +
      +
    • +
    +
    +
  • +
+
+
+
    +
  • + +
    +
      +
    • + + +

      Constructor Detail

      + + + +
        +
      • +

        Utils

        +
        public Utils()
        +
      • +
      +
    • +
    +
    + +
    +
      +
    • + + +

      Method Detail

      + + + +
        +
      • +

        loadLibraries

        +
        public static void loadLibraries()
        +
        load cvc5 jni library
        +
      • +
      + + + +
        +
      • +

        getSorts

        +
        public static Sort[] getSorts​(Solver solver,
        +                              long[] pointers)
        +
        return sorts array from array of pointers
        +
      • +
      + + + +
        +
      • +

        getTerms

        +
        public static Term[] getTerms​(Solver solver,
        +                              long[] pointers)
        +
        return terms array from array of pointers
        +
      • +
      + + + +
        +
      • +

        getPointers

        +
        public static long[] getPointers​(io.github.cvc5.IPointer[] objects)
        +
        get pointers from one dimensional array
        +
      • +
      + + + +
        +
      • +

        getPointers

        +
        public static long[][] getPointers​(io.github.cvc5.IPointer[][] objects)
        +
        get pointers from two dimensional matrix
        +
      • +
      + + + +
        +
      • +

        validateUnsigned

        +
        public static void validateUnsigned​(int integer,
        +                                    java.lang.String name)
        +                             throws CVC5ApiException
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        validateUnsigned

        +
        public static void validateUnsigned​(long integer,
        +                                    java.lang.String name)
        +                             throws CVC5ApiException
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        validateUnsigned

        +
        public static void validateUnsigned​(int[] integers,
        +                                    java.lang.String name)
        +                             throws CVC5ApiException
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        validateUnsigned

        +
        public static void validateUnsigned​(long[] integers,
        +                                    java.lang.String name)
        +                             throws CVC5ApiException
        +
        +
        Throws:
        +
        CVC5ApiException
        +
        +
      • +
      + + + +
        +
      • +

        getPairs

        +
        public static <K> Pair<K,​java.lang.Long>[] getPairs​(Pair<K,​? extends io.github.cvc5.AbstractPointer>[] abstractPointers)
        +
      • +
      + + + +
        +
      • +

        getRational

        +
        public static Pair<java.math.BigInteger,​java.math.BigInteger> getRational​(java.lang.String rational)
        +
        Convert a rational string a/b to a pair of BigIntegers
        +
      • +
      + + + +
        +
      • +

        getRational

        +
        public static java.lang.String getRational​(Pair<java.math.BigInteger,​java.math.BigInteger> pair)
        +
        Convert a pair of BigIntegers to a rational string a/b
        +
      • +
      +
    • +
    +
    +
  • +
+
+
+
+ + + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/package-summary.html b/cvc5-1.0.2/api/java/io/github/cvc5/package-summary.html new file mode 100644 index 0000000..b2a6df5 --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/package-summary.html @@ -0,0 +1,320 @@ + + + + + +io.github.cvc5 + + + + + + + + + + + + + +
+ +
+
+
+

Package io.github.cvc5

+
+
+ +
+
+ + + diff --git a/cvc5-1.0.2/api/java/io/github/cvc5/package-tree.html b/cvc5-1.0.2/api/java/io/github/cvc5/package-tree.html new file mode 100644 index 0000000..f64f42f --- /dev/null +++ b/cvc5-1.0.2/api/java/io/github/cvc5/package-tree.html @@ -0,0 +1,225 @@ + + + + + +io.github.cvc5 Class Hierarchy + + + + + + + + + + + + + +
+ +
+
+
+

Hierarchy For Package io.github.cvc5

+
+
+
+

Class Hierarchy

+ +
+
+

Interface Hierarchy

+ +
+
+

Enum Hierarchy

+
    +
  • java.lang.Object +
      +
    • java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable) + +
    • +
    +
  • +
+
+
+
+ + + diff --git a/cvc5-1.0.2/api/java/java.html b/cvc5-1.0.2/api/java/java.html new file mode 100644 index 0000000..035cd87 --- /dev/null +++ b/cvc5-1.0.2/api/java/java.html @@ -0,0 +1,566 @@ + + + + + + + + Java API — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Java API + + ¶ + +

+

+ The Java API for cvc5 mostly mirrors the + + + C++ API + + + and supports operator +overloading, iterators, and exceptions. +There are a few differences from the C++ API, such as using arbitrary-precision integer pairs, +specifically, pairs of Java + + BigInteger + + objects, to represent rational numbers. +The + + + quickstart guide + + + gives a short introduction, +and more examples can be found + + here + + . +

+

+ For most applications, the + + Solver + + class is the main entry point to cvc5. +The class hierarchy of + + cvc5 package + + provides more details on the individual classes. +

+
+
+
+

+ Building cvc5 Java API + + ¶ + +

+
+
+
$ git clone https://github.com/cvc5/cvc5
+$ cd cvc5
+$ ./configure.sh production --java-bindings --auto-download --prefix=build/install
+$ cd build
+$ make
+$ make install
+
+$ ls install/lib
+  cmake  libcvc5jni.so  libcvc5parser.so  libcvc5parser.so.1  libcvc5.so
+  libpicpoly.a  libpicpolyxx.a  libpoly.so libpoly.so.0  libpoly.so.0.1.9
+  libpolyxx.so  libpolyxx.so.0  libpolyxx.so.0.1.9  objects-Production
+$ ls install/share/java/
+  cvc5-0.0.5-dev.jar  cvc5.jar
+
+# compile example QuickStart.java with cvc5 jar file
+$ javac -cp "install/share/java/cvc5.jar" ../examples/api/java/QuickStart.java -d .
+
+# run example QuickStart with cvc5 jar file and cvc5 shared libraries
+$ java -cp "install/share/java/cvc5.jar:." "-Djava.library.path=install/lib" QuickStart
+  expected: sat
+  result: sat
+  value for x: 1/6
+  value for y: 1/6
+  expected: unsat
+  result: unsat
+  unsat core size: 3
+  unsat core:
+  (< 0 a)
+  (< 0 b)
+  (< (+ a b) 1)
+
+
+
+
+
+

+ + Package io.github.cvc5 + + + ¶ + +

+
+
+ +
+
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/java/jquery/external/jquery/jquery.js b/cvc5-1.0.2/api/java/jquery/external/jquery/jquery.js new file mode 100644 index 0000000..5093733 --- /dev/null +++ b/cvc5-1.0.2/api/java/jquery/external/jquery/jquery.js @@ -0,0 +1,10872 @@ +/*! + * jQuery JavaScript Library v3.5.1 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2020-05-04T22:49Z + */ +( function( global, factory ) { + + "use strict"; + + if ( typeof module === "object" && typeof module.exports === "object" ) { + + // For CommonJS and CommonJS-like environments where a proper `window` + // is present, execute the factory and get jQuery. + // For environments that do not have a `window` with a `document` + // (such as Node.js), expose a factory as module.exports. + // This accentuates the need for the creation of a real `window`. + // e.g. var jQuery = require("jquery")(window); + // See ticket #14549 for more info. + module.exports = global.document ? + factory( global, true ) : + function( w ) { + if ( !w.document ) { + throw new Error( "jQuery requires a window with a document" ); + } + return factory( w ); + }; + } else { + factory( global ); + } + +// Pass this if window is not defined yet +} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { + +// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 +// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode +// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common +// enough that all such attempts are guarded in a try block. +"use strict"; + +var arr = []; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var flat = arr.flat ? function( array ) { + return arr.flat.call( array ); +} : function( array ) { + return arr.concat.apply( [], array ); +}; + + +var push = arr.push; + +var indexOf = arr.indexOf; + +var class2type = {}; + +var toString = class2type.toString; + +var hasOwn = class2type.hasOwnProperty; + +var fnToString = hasOwn.toString; + +var ObjectFunctionString = fnToString.call( Object ); + +var support = {}; + +var isFunction = function isFunction( obj ) { + + // Support: Chrome <=57, Firefox <=52 + // In some browsers, typeof returns "function" for HTML elements + // (i.e., `typeof document.createElement( "object" ) === "function"`). + // We don't want to classify *any* DOM node as a function. + return typeof obj === "function" && typeof obj.nodeType !== "number"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + +var document = window.document; + + + + var preservedScriptAttributes = { + type: true, + src: true, + nonce: true, + noModule: true + }; + + function DOMEval( code, node, doc ) { + doc = doc || document; + + var i, val, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + + // Support: Firefox 64+, Edge 18+ + // Some browsers don't support the "nonce" property on scripts. + // On the other hand, just using `getAttribute` is not enough as + // the `nonce` attribute is reset to an empty string whenever it + // becomes browsing-context connected. + // See https://github.com/whatwg/html/issues/2369 + // See https://html.spec.whatwg.org/#nonce-attributes + // The `node.getAttribute` check was added for the sake of + // `jQuery.globalEval` so that it can fake a nonce-containing node + // via an object. + val = node[ i ] || node.getAttribute && node.getAttribute( i ); + if ( val ) { + script.setAttribute( i, val ); + } + } + } + doc.head.appendChild( script ).parentNode.removeChild( script ); + } + + +function toType( obj ) { + if ( obj == null ) { + return obj + ""; + } + + // Support: Android <=2.3 only (functionish RegExp) + return typeof obj === "object" || typeof obj === "function" ? + class2type[ toString.call( obj ) ] || "object" : + typeof obj; +} +/* global Symbol */ +// Defining this global in .eslintrc.json would create a danger of using the global +// unguarded in another place, it seems safer to define global only for this module + + + +var + version = "3.5.1", + + // Define a local copy of jQuery + jQuery = function( selector, context ) { + + // The jQuery object is actually just the init constructor 'enhanced' + // Need init if jQuery is called (just allow error to be thrown if not included) + return new jQuery.fn.init( selector, context ); + }; + +jQuery.fn = jQuery.prototype = { + + // The current version of jQuery being used + jquery: version, + + constructor: jQuery, + + // The default length of a jQuery object is 0 + length: 0, + + toArray: function() { + return slice.call( this ); + }, + + // Get the Nth element in the matched element set OR + // Get the whole matched element set as a clean array + get: function( num ) { + + // Return all the elements in a clean array + if ( num == null ) { + return slice.call( this ); + } + + // Return just the one element from the set + return num < 0 ? this[ num + this.length ] : this[ num ]; + }, + + // Take an array of elements and push it onto the stack + // (returning the new matched element set) + pushStack: function( elems ) { + + // Build a new jQuery matched element set + var ret = jQuery.merge( this.constructor(), elems ); + + // Add the old object onto the stack (as a reference) + ret.prevObject = this; + + // Return the newly-formed element set + return ret; + }, + + // Execute a callback for every element in the matched set. + each: function( callback ) { + return jQuery.each( this, callback ); + }, + + map: function( callback ) { + return this.pushStack( jQuery.map( this, function( elem, i ) { + return callback.call( elem, i, elem ); + } ) ); + }, + + slice: function() { + return this.pushStack( slice.apply( this, arguments ) ); + }, + + first: function() { + return this.eq( 0 ); + }, + + last: function() { + return this.eq( -1 ); + }, + + even: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return ( i + 1 ) % 2; + } ) ); + }, + + odd: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return i % 2; + } ) ); + }, + + eq: function( i ) { + var len = this.length, + j = +i + ( i < 0 ? len : 0 ); + return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); + }, + + end: function() { + return this.prevObject || this.constructor(); + }, + + // For internal use only. + // Behaves like an Array's method, not like a jQuery method. + push: push, + sort: arr.sort, + splice: arr.splice +}; + +jQuery.extend = jQuery.fn.extend = function() { + var options, name, src, copy, copyIsArray, clone, + target = arguments[ 0 ] || {}, + i = 1, + length = arguments.length, + deep = false; + + // Handle a deep copy situation + if ( typeof target === "boolean" ) { + deep = target; + + // Skip the boolean and the target + target = arguments[ i ] || {}; + i++; + } + + // Handle case when target is a string or something (possible in deep copy) + if ( typeof target !== "object" && !isFunction( target ) ) { + target = {}; + } + + // Extend jQuery itself if only one argument is passed + if ( i === length ) { + target = this; + i--; + } + + for ( ; i < length; i++ ) { + + // Only deal with non-null/undefined values + if ( ( options = arguments[ i ] ) != null ) { + + // Extend the base object + for ( name in options ) { + copy = options[ name ]; + + // Prevent Object.prototype pollution + // Prevent never-ending loop + if ( name === "__proto__" || target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + src = target[ name ]; + + // Ensure proper type for the source value + if ( copyIsArray && !Array.isArray( src ) ) { + clone = []; + } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { + clone = {}; + } else { + clone = src; + } + copyIsArray = false; + + // Never move original objects, clone them + target[ name ] = jQuery.extend( deep, clone, copy ); + + // Don't bring in undefined values + } else if ( copy !== undefined ) { + target[ name ] = copy; + } + } + } + } + + // Return the modified object + return target; +}; + +jQuery.extend( { + + // Unique for each copy of jQuery on the page + expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), + + // Assume jQuery is ready without the ready module + isReady: true, + + error: function( msg ) { + throw new Error( msg ); + }, + + noop: function() {}, + + isPlainObject: function( obj ) { + var proto, Ctor; + + // Detect obvious negatives + // Use toString instead of jQuery.type to catch host objects + if ( !obj || toString.call( obj ) !== "[object Object]" ) { + return false; + } + + proto = getProto( obj ); + + // Objects with no prototype (e.g., `Object.create( null )`) are plain + if ( !proto ) { + return true; + } + + // Objects with prototype are plain iff they were constructed by a global Object function + Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; + return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; + }, + + isEmptyObject: function( obj ) { + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a provided context; falls back to the global one + // if not specified. + globalEval: function( code, options, doc ) { + DOMEval( code, { nonce: options && options.nonce }, doc ); + }, + + each: function( obj, callback ) { + var length, i = 0; + + if ( isArrayLike( obj ) ) { + length = obj.length; + for ( ; i < length; i++ ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } else { + for ( i in obj ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } + + return obj; + }, + + // results is for internal usage only + makeArray: function( arr, results ) { + var ret = results || []; + + if ( arr != null ) { + if ( isArrayLike( Object( arr ) ) ) { + jQuery.merge( ret, + typeof arr === "string" ? + [ arr ] : arr + ); + } else { + push.call( ret, arr ); + } + } + + return ret; + }, + + inArray: function( elem, arr, i ) { + return arr == null ? -1 : indexOf.call( arr, elem, i ); + }, + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + merge: function( first, second ) { + var len = +second.length, + j = 0, + i = first.length; + + for ( ; j < len; j++ ) { + first[ i++ ] = second[ j ]; + } + + first.length = i; + + return first; + }, + + grep: function( elems, callback, invert ) { + var callbackInverse, + matches = [], + i = 0, + length = elems.length, + callbackExpect = !invert; + + // Go through the array, only saving the items + // that pass the validator function + for ( ; i < length; i++ ) { + callbackInverse = !callback( elems[ i ], i ); + if ( callbackInverse !== callbackExpect ) { + matches.push( elems[ i ] ); + } + } + + return matches; + }, + + // arg is for internal usage only + map: function( elems, callback, arg ) { + var length, value, + i = 0, + ret = []; + + // Go through the array, translating each of the items to their new values + if ( isArrayLike( elems ) ) { + length = elems.length; + for ( ; i < length; i++ ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + + // Go through every key on the object, + } else { + for ( i in elems ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + } + + // Flatten any nested arrays + return flat( ret ); + }, + + // A global GUID counter for objects + guid: 1, + + // jQuery.support is not used in Core but other projects attach their + // properties to it so it needs to exist. + support: support +} ); + +if ( typeof Symbol === "function" ) { + jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; +} + +// Populate the class2type map +jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), +function( _i, name ) { + class2type[ "[object " + name + "]" ] = name.toLowerCase(); +} ); + +function isArrayLike( obj ) { + + // Support: real iOS 8.2 only (not reproducible in simulator) + // `in` check used to prevent JIT error (gh-2145) + // hasOwn isn't used here due to false negatives + // regarding Nodelist length in IE + var length = !!obj && "length" in obj && obj.length, + type = toType( obj ); + + if ( isFunction( obj ) || isWindow( obj ) ) { + return false; + } + + return type === "array" || length === 0 || + typeof length === "number" && length > 0 && ( length - 1 ) in obj; +} +var Sizzle = +/*! + * Sizzle CSS Selector Engine v2.3.5 + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://js.foundation/ + * + * Date: 2020-03-14 + */ +( function( window ) { +var i, + support, + Expr, + getText, + isXML, + tokenize, + compile, + select, + outermostContext, + sortInput, + hasDuplicate, + + // Local document vars + setDocument, + document, + docElem, + documentIsHTML, + rbuggyQSA, + rbuggyMatches, + matches, + contains, + + // Instance-specific data + expando = "sizzle" + 1 * new Date(), + preferredDoc = window.document, + dirruns = 0, + done = 0, + classCache = createCache(), + tokenCache = createCache(), + compilerCache = createCache(), + nonnativeSelectorCache = createCache(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ( {} ).hasOwnProperty, + arr = [], + pop = arr.pop, + pushNative = arr.push, + push = arr.push, + slice = arr.slice, + + // Use a stripped-down indexOf as it's faster than native + // https://jsperf.com/thor-indexof-vs-for/5 + indexOf = function( list, elem ) { + var i = 0, + len = list.length; + for ( ; i < len; i++ ) { + if ( list[ i ] === elem ) { + return i; + } + } + return -1; + }, + + booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + + "ismap|loop|multiple|open|readonly|required|scoped", + + // Regular expressions + + // http://www.w3.org/TR/css3-selectors/#whitespace + whitespace = "[\\x20\\t\\r\\n\\f]", + + // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram + identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", + + // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors + attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + + + // Operator (capture 2) + "*([*^$|!~]?=)" + whitespace + + + // "Attribute values must be CSS identifiers [capture 5] + // or strings [capture 3 or capture 4]" + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + + whitespace + "*\\]", + + pseudos = ":(" + identifier + ")(?:\\((" + + + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: + // 1. quoted (capture 3; capture 4 or capture 5) + "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + + + // 2. simple (capture 6) + "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + + + // 3. anything else (capture 2) + ".*" + + ")\\)|)", + + // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter + rwhitespace = new RegExp( whitespace + "+", "g" ), + rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + + whitespace + "+$", "g" ), + + rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), + rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + + "*" ), + rdescend = new RegExp( whitespace + "|>" ), + + rpseudo = new RegExp( pseudos ), + ridentifier = new RegExp( "^" + identifier + "$" ), + + matchExpr = { + "ID": new RegExp( "^#(" + identifier + ")" ), + "CLASS": new RegExp( "^\\.(" + identifier + ")" ), + "TAG": new RegExp( "^(" + identifier + "|[*])" ), + "ATTR": new RegExp( "^" + attributes ), + "PSEUDO": new RegExp( "^" + pseudos ), + "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), + "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), + + // For use in libraries implementing .is() + // We use this for POS matching in `select` + "needsContext": new RegExp( "^" + whitespace + + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) + }, + + rhtml = /HTML$/i, + rinputs = /^(?:input|select|textarea|button)$/i, + rheader = /^h\d$/i, + + rnative = /^[^{]+\{\s*\[native \w/, + + // Easily-parseable/retrievable ID or TAG or CLASS selectors + rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, + + rsibling = /[+~]/, + + // CSS escapes + // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters + runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), + funescape = function( escape, nonHex ) { + var high = "0x" + escape.slice( 1 ) - 0x10000; + + return nonHex ? + + // Strip the backslash prefix from a non-hex escape sequence + nonHex : + + // Replace a hexadecimal escape sequence with the encoded Unicode code point + // Support: IE <=11+ + // For values outside the Basic Multilingual Plane (BMP), manually construct a + // surrogate pair + high < 0 ? + String.fromCharCode( high + 0x10000 ) : + String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); + }, + + // CSS string/identifier serialization + // https://drafts.csswg.org/cssom/#common-serializing-idioms + rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, + fcssescape = function( ch, asCodePoint ) { + if ( asCodePoint ) { + + // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER + if ( ch === "\0" ) { + return "\uFFFD"; + } + + // Control characters and (dependent upon position) numbers get escaped as code points + return ch.slice( 0, -1 ) + "\\" + + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; + } + + // Other potentially-special ASCII characters get backslash-escaped + return "\\" + ch; + }, + + // Used for iframes + // See setDocument() + // Removing the function wrapper causes a "Permission Denied" + // error in IE + unloadHandler = function() { + setDocument(); + }, + + inDisabledFieldset = addCombinator( + function( elem ) { + return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; + }, + { dir: "parentNode", next: "legend" } + ); + +// Optimize for push.apply( _, NodeList ) +try { + push.apply( + ( arr = slice.call( preferredDoc.childNodes ) ), + preferredDoc.childNodes + ); + + // Support: Android<4.0 + // Detect silently failing push.apply + // eslint-disable-next-line no-unused-expressions + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + pushNative.apply( target, slice.call( els ) ); + } : + + // Support: IE<9 + // Otherwise append directly + function( target, els ) { + var j = target.length, + i = 0; + + // Can't trust NodeList.length + while ( ( target[ j++ ] = els[ i++ ] ) ) {} + target.length = j - 1; + } + }; +} + +function Sizzle( selector, context, results, seed ) { + var m, i, elem, nid, match, groups, newSelector, + newContext = context && context.ownerDocument, + + // nodeType defaults to 9, since context defaults to document + nodeType = context ? context.nodeType : 9; + + results = results || []; + + // Return early from calls with invalid selector or context + if ( typeof selector !== "string" || !selector || + nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { + + return results; + } + + // Try to shortcut find operations (as opposed to filters) in HTML documents + if ( !seed ) { + setDocument( context ); + context = context || document; + + if ( documentIsHTML ) { + + // If the selector is sufficiently simple, try using a "get*By*" DOM method + // (excepting DocumentFragment context, where the methods don't exist) + if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { + + // ID selector + if ( ( m = match[ 1 ] ) ) { + + // Document context + if ( nodeType === 9 ) { + if ( ( elem = context.getElementById( m ) ) ) { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( elem.id === m ) { + results.push( elem ); + return results; + } + } else { + return results; + } + + // Element context + } else { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( newContext && ( elem = newContext.getElementById( m ) ) && + contains( context, elem ) && + elem.id === m ) { + + results.push( elem ); + return results; + } + } + + // Type selector + } else if ( match[ 2 ] ) { + push.apply( results, context.getElementsByTagName( selector ) ); + return results; + + // Class selector + } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && + context.getElementsByClassName ) { + + push.apply( results, context.getElementsByClassName( m ) ); + return results; + } + } + + // Take advantage of querySelectorAll + if ( support.qsa && + !nonnativeSelectorCache[ selector + " " ] && + ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && + + // Support: IE 8 only + // Exclude object elements + ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { + + newSelector = selector; + newContext = context; + + // qSA considers elements outside a scoping root when evaluating child or + // descendant combinators, which is not what we want. + // In such cases, we work around the behavior by prefixing every selector in the + // list with an ID selector referencing the scope context. + // The technique has to be used as well when a leading combinator is used + // as such selectors are not recognized by querySelectorAll. + // Thanks to Andrew Dupont for this technique. + if ( nodeType === 1 && + ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + + // We can use :scope instead of the ID hack if the browser + // supports it & if we're not changing the context. + if ( newContext !== context || !support.scope ) { + + // Capture the context ID, setting it first if necessary + if ( ( nid = context.getAttribute( "id" ) ) ) { + nid = nid.replace( rcssescape, fcssescape ); + } else { + context.setAttribute( "id", ( nid = expando ) ); + } + } + + // Prefix every selector in the list + groups = tokenize( selector ); + i = groups.length; + while ( i-- ) { + groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + + toSelector( groups[ i ] ); + } + newSelector = groups.join( "," ); + } + + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + nonnativeSelectorCache( selector, true ); + } finally { + if ( nid === expando ) { + context.removeAttribute( "id" ); + } + } + } + } + } + + // All others + return select( selector.replace( rtrim, "$1" ), context, results, seed ); +} + +/** + * Create key-value caches of limited size + * @returns {function(string, object)} Returns the Object data after storing it on itself with + * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) + * deleting the oldest entry + */ +function createCache() { + var keys = []; + + function cache( key, value ) { + + // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) + if ( keys.push( key + " " ) > Expr.cacheLength ) { + + // Only keep the most recent entries + delete cache[ keys.shift() ]; + } + return ( cache[ key + " " ] = value ); + } + return cache; +} + +/** + * Mark a function for special use by Sizzle + * @param {Function} fn The function to mark + */ +function markFunction( fn ) { + fn[ expando ] = true; + return fn; +} + +/** + * Support testing using an element + * @param {Function} fn Passed the created element and returns a boolean result + */ +function assert( fn ) { + var el = document.createElement( "fieldset" ); + + try { + return !!fn( el ); + } catch ( e ) { + return false; + } finally { + + // Remove from its parent by default + if ( el.parentNode ) { + el.parentNode.removeChild( el ); + } + + // release memory in IE + el = null; + } +} + +/** + * Adds the same handler for all of the specified attrs + * @param {String} attrs Pipe-separated list of attributes + * @param {Function} handler The method that will be applied + */ +function addHandle( attrs, handler ) { + var arr = attrs.split( "|" ), + i = arr.length; + + while ( i-- ) { + Expr.attrHandle[ arr[ i ] ] = handler; + } +} + +/** + * Checks document order of two siblings + * @param {Element} a + * @param {Element} b + * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b + */ +function siblingCheck( a, b ) { + var cur = b && a, + diff = cur && a.nodeType === 1 && b.nodeType === 1 && + a.sourceIndex - b.sourceIndex; + + // Use IE sourceIndex if available on both nodes + if ( diff ) { + return diff; + } + + // Check if b follows a + if ( cur ) { + while ( ( cur = cur.nextSibling ) ) { + if ( cur === b ) { + return -1; + } + } + } + + return a ? 1 : -1; +} + +/** + * Returns a function to use in pseudos for input types + * @param {String} type + */ +function createInputPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for buttons + * @param {String} type + */ +function createButtonPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return ( name === "input" || name === "button" ) && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for :enabled/:disabled + * @param {Boolean} disabled true for :disabled; false for :enabled + */ +function createDisabledPseudo( disabled ) { + + // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable + return function( elem ) { + + // Only certain elements can match :enabled or :disabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled + if ( "form" in elem ) { + + // Check for inherited disabledness on relevant non-disabled elements: + // * listed form-associated elements in a disabled fieldset + // https://html.spec.whatwg.org/multipage/forms.html#category-listed + // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled + // * option elements in a disabled optgroup + // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled + // All such elements have a "form" property. + if ( elem.parentNode && elem.disabled === false ) { + + // Option elements defer to a parent optgroup if present + if ( "label" in elem ) { + if ( "label" in elem.parentNode ) { + return elem.parentNode.disabled === disabled; + } else { + return elem.disabled === disabled; + } + } + + // Support: IE 6 - 11 + // Use the isDisabled shortcut property to check for disabled fieldset ancestors + return elem.isDisabled === disabled || + + // Where there is no isDisabled, check manually + /* jshint -W018 */ + elem.isDisabled !== !disabled && + inDisabledFieldset( elem ) === disabled; + } + + return elem.disabled === disabled; + + // Try to winnow out elements that can't be disabled before trusting the disabled property. + // Some victims get caught in our net (label, legend, menu, track), but it shouldn't + // even exist on them, let alone have a boolean value. + } else if ( "label" in elem ) { + return elem.disabled === disabled; + } + + // Remaining elements are neither :enabled nor :disabled + return false; + }; +} + +/** + * Returns a function to use in pseudos for positionals + * @param {Function} fn + */ +function createPositionalPseudo( fn ) { + return markFunction( function( argument ) { + argument = +argument; + return markFunction( function( seed, matches ) { + var j, + matchIndexes = fn( [], seed.length, argument ), + i = matchIndexes.length; + + // Match elements found at the specified indexes + while ( i-- ) { + if ( seed[ ( j = matchIndexes[ i ] ) ] ) { + seed[ j ] = !( matches[ j ] = seed[ j ] ); + } + } + } ); + } ); +} + +/** + * Checks a node for validity as a Sizzle context + * @param {Element|Object=} context + * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value + */ +function testContext( context ) { + return context && typeof context.getElementsByTagName !== "undefined" && context; +} + +// Expose support vars for convenience +support = Sizzle.support = {}; + +/** + * Detects XML nodes + * @param {Element|Object} elem An element or a document + * @returns {Boolean} True iff elem is a non-HTML XML node + */ +isXML = Sizzle.isXML = function( elem ) { + var namespace = elem.namespaceURI, + docElem = ( elem.ownerDocument || elem ).documentElement; + + // Support: IE <=8 + // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes + // https://bugs.jquery.com/ticket/4833 + return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); +}; + +/** + * Sets document-related variables once based on the current document + * @param {Element|Object} [doc] An element or document object to use to set the document + * @returns {Object} Returns the current document + */ +setDocument = Sizzle.setDocument = function( node ) { + var hasCompare, subWindow, + doc = node ? node.ownerDocument || node : preferredDoc; + + // Return early if doc is invalid or already selected + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { + return document; + } + + // Update global variables + document = doc; + docElem = document.documentElement; + documentIsHTML = !isXML( document ); + + // Support: IE 9 - 11+, Edge 12 - 18+ + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( preferredDoc != document && + ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { + + // Support: IE 11, Edge + if ( subWindow.addEventListener ) { + subWindow.addEventListener( "unload", unloadHandler, false ); + + // Support: IE 9 - 10 only + } else if ( subWindow.attachEvent ) { + subWindow.attachEvent( "onunload", unloadHandler ); + } + } + + // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, + // Safari 4 - 5 only, Opera <=11.6 - 12.x only + // IE/Edge & older browsers don't support the :scope pseudo-class. + // Support: Safari 6.0 only + // Safari 6.0 supports :scope but it's an alias of :root there. + support.scope = assert( function( el ) { + docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); + return typeof el.querySelectorAll !== "undefined" && + !el.querySelectorAll( ":scope fieldset div" ).length; + } ); + + /* Attributes + ---------------------------------------------------------------------- */ + + // Support: IE<8 + // Verify that getAttribute really returns attributes and not properties + // (excepting IE8 booleans) + support.attributes = assert( function( el ) { + el.className = "i"; + return !el.getAttribute( "className" ); + } ); + + /* getElement(s)By* + ---------------------------------------------------------------------- */ + + // Check if getElementsByTagName("*") returns only elements + support.getElementsByTagName = assert( function( el ) { + el.appendChild( document.createComment( "" ) ); + return !el.getElementsByTagName( "*" ).length; + } ); + + // Support: IE<9 + support.getElementsByClassName = rnative.test( document.getElementsByClassName ); + + // Support: IE<10 + // Check if getElementById returns elements by name + // The broken getElementById methods don't pick up programmatically-set names, + // so use a roundabout getElementsByName test + support.getById = assert( function( el ) { + docElem.appendChild( el ).id = expando; + return !document.getElementsByName || !document.getElementsByName( expando ).length; + } ); + + // ID filter and find + if ( support.getById ) { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + return elem.getAttribute( "id" ) === attrId; + }; + }; + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var elem = context.getElementById( id ); + return elem ? [ elem ] : []; + } + }; + } else { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + var node = typeof elem.getAttributeNode !== "undefined" && + elem.getAttributeNode( "id" ); + return node && node.value === attrId; + }; + }; + + // Support: IE 6 - 7 only + // getElementById is not reliable as a find shortcut + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var node, i, elems, + elem = context.getElementById( id ); + + if ( elem ) { + + // Verify the id attribute + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + + // Fall back on getElementsByName + elems = context.getElementsByName( id ); + i = 0; + while ( ( elem = elems[ i++ ] ) ) { + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + } + } + + return []; + } + }; + } + + // Tag + Expr.find[ "TAG" ] = support.getElementsByTagName ? + function( tag, context ) { + if ( typeof context.getElementsByTagName !== "undefined" ) { + return context.getElementsByTagName( tag ); + + // DocumentFragment nodes don't have gEBTN + } else if ( support.qsa ) { + return context.querySelectorAll( tag ); + } + } : + + function( tag, context ) { + var elem, + tmp = [], + i = 0, + + // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too + results = context.getElementsByTagName( tag ); + + // Filter out possible comments + if ( tag === "*" ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem.nodeType === 1 ) { + tmp.push( elem ); + } + } + + return tmp; + } + return results; + }; + + // Class + Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { + if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { + return context.getElementsByClassName( className ); + } + }; + + /* QSA/matchesSelector + ---------------------------------------------------------------------- */ + + // QSA and matchesSelector support + + // matchesSelector(:active) reports false when true (IE9/Opera 11.5) + rbuggyMatches = []; + + // qSa(:focus) reports false when true (Chrome 21) + // We allow this because of a bug in IE8/9 that throws an error + // whenever `document.activeElement` is accessed on an iframe + // So, we allow :focus to pass through QSA all the time to avoid the IE error + // See https://bugs.jquery.com/ticket/13378 + rbuggyQSA = []; + + if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { + + // Build QSA regex + // Regex strategy adopted from Diego Perini + assert( function( el ) { + + var input; + + // Select is set to empty string on purpose + // This is to test IE's treatment of not explicitly + // setting a boolean content attribute, + // since its presence should be enough + // https://bugs.jquery.com/ticket/12359 + docElem.appendChild( el ).innerHTML = "" + + ""; + + // Support: IE8, Opera 11-12.16 + // Nothing should be selected when empty strings follow ^= or $= or *= + // The test attribute must be unknown in Opera but "safe" for WinRT + // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section + if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { + rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); + } + + // Support: IE8 + // Boolean attributes and "value" are not treated correctly + if ( !el.querySelectorAll( "[selected]" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); + } + + // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ + if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { + rbuggyQSA.push( "~=" ); + } + + // Support: IE 11+, Edge 15 - 18+ + // IE 11/Edge don't find elements on a `[name='']` query in some cases. + // Adding a temporary attribute to the document before the selection works + // around the issue. + // Interestingly, IE 10 & older don't seem to have the issue. + input = document.createElement( "input" ); + input.setAttribute( "name", "" ); + el.appendChild( input ); + if ( !el.querySelectorAll( "[name='']" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + + whitespace + "*(?:''|\"\")" ); + } + + // Webkit/Opera - :checked should return selected option elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + // IE8 throws error here and will not see later tests + if ( !el.querySelectorAll( ":checked" ).length ) { + rbuggyQSA.push( ":checked" ); + } + + // Support: Safari 8+, iOS 8+ + // https://bugs.webkit.org/show_bug.cgi?id=136851 + // In-page `selector#id sibling-combinator selector` fails + if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { + rbuggyQSA.push( ".#.+[+~]" ); + } + + // Support: Firefox <=3.6 - 5 only + // Old Firefox doesn't throw on a badly-escaped identifier. + el.querySelectorAll( "\\\f" ); + rbuggyQSA.push( "[\\r\\n\\f]" ); + } ); + + assert( function( el ) { + el.innerHTML = "" + + ""; + + // Support: Windows 8 Native Apps + // The type and name attributes are restricted during .innerHTML assignment + var input = document.createElement( "input" ); + input.setAttribute( "type", "hidden" ); + el.appendChild( input ).setAttribute( "name", "D" ); + + // Support: IE8 + // Enforce case-sensitivity of name attribute + if ( el.querySelectorAll( "[name=d]" ).length ) { + rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); + } + + // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) + // IE8 throws error here and will not see later tests + if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: IE9-11+ + // IE's :disabled selector does not pick up the children of disabled fieldsets + docElem.appendChild( el ).disabled = true; + if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: Opera 10 - 11 only + // Opera 10-11 does not throw on post-comma invalid pseudos + el.querySelectorAll( "*,:x" ); + rbuggyQSA.push( ",.*:" ); + } ); + } + + if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || + docElem.webkitMatchesSelector || + docElem.mozMatchesSelector || + docElem.oMatchesSelector || + docElem.msMatchesSelector ) ) ) ) { + + assert( function( el ) { + + // Check to see if it's possible to do matchesSelector + // on a disconnected node (IE 9) + support.disconnectedMatch = matches.call( el, "*" ); + + // This should fail with an exception + // Gecko does not error, returns false instead + matches.call( el, "[s!='']:x" ); + rbuggyMatches.push( "!=", pseudos ); + } ); + } + + rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); + rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); + + /* Contains + ---------------------------------------------------------------------- */ + hasCompare = rnative.test( docElem.compareDocumentPosition ); + + // Element contains another + // Purposefully self-exclusive + // As in, an element does not contain itself + contains = hasCompare || rnative.test( docElem.contains ) ? + function( a, b ) { + var adown = a.nodeType === 9 ? a.documentElement : a, + bup = b && b.parentNode; + return a === bup || !!( bup && bup.nodeType === 1 && ( + adown.contains ? + adown.contains( bup ) : + a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 + ) ); + } : + function( a, b ) { + if ( b ) { + while ( ( b = b.parentNode ) ) { + if ( b === a ) { + return true; + } + } + } + return false; + }; + + /* Sorting + ---------------------------------------------------------------------- */ + + // Document order sorting + sortOrder = hasCompare ? + function( a, b ) { + + // Flag for duplicate removal + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + // Sort on method existence if only one input has compareDocumentPosition + var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; + if ( compare ) { + return compare; + } + + // Calculate position if both inputs belong to the same document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? + a.compareDocumentPosition( b ) : + + // Otherwise we know they are disconnected + 1; + + // Disconnected nodes + if ( compare & 1 || + ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { + + // Choose the first element that is related to our preferred document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( a == document || a.ownerDocument == preferredDoc && + contains( preferredDoc, a ) ) { + return -1; + } + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( b == document || b.ownerDocument == preferredDoc && + contains( preferredDoc, b ) ) { + return 1; + } + + // Maintain original order + return sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + } + + return compare & 4 ? -1 : 1; + } : + function( a, b ) { + + // Exit early if the nodes are identical + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + var cur, + i = 0, + aup = a.parentNode, + bup = b.parentNode, + ap = [ a ], + bp = [ b ]; + + // Parentless nodes are either documents or disconnected + if ( !aup || !bup ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + return a == document ? -1 : + b == document ? 1 : + /* eslint-enable eqeqeq */ + aup ? -1 : + bup ? 1 : + sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + + // If the nodes are siblings, we can do a quick check + } else if ( aup === bup ) { + return siblingCheck( a, b ); + } + + // Otherwise we need full lists of their ancestors for comparison + cur = a; + while ( ( cur = cur.parentNode ) ) { + ap.unshift( cur ); + } + cur = b; + while ( ( cur = cur.parentNode ) ) { + bp.unshift( cur ); + } + + // Walk down the tree looking for a discrepancy + while ( ap[ i ] === bp[ i ] ) { + i++; + } + + return i ? + + // Do a sibling check if the nodes have a common ancestor + siblingCheck( ap[ i ], bp[ i ] ) : + + // Otherwise nodes in our document sort first + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + ap[ i ] == preferredDoc ? -1 : + bp[ i ] == preferredDoc ? 1 : + /* eslint-enable eqeqeq */ + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + setDocument( elem ); + + if ( support.matchesSelector && documentIsHTML && + !nonnativeSelectorCache[ expr + " " ] && + ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && + ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { + + try { + var ret = matches.call( elem, expr ); + + // IE 9's matchesSelector returns false on disconnected nodes + if ( ret || support.disconnectedMatch || + + // As well, disconnected nodes are said to be in a document + // fragment in IE 9 + elem.document && elem.document.nodeType !== 11 ) { + return ret; + } + } catch ( e ) { + nonnativeSelectorCache( expr, true ); + } + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( context.ownerDocument || context ) != document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( elem.ownerDocument || elem ) != document ) { + setDocument( elem ); + } + + var fn = Expr.attrHandle[ name.toLowerCase() ], + + // Don't get fooled by Object.prototype properties (jQuery #13807) + val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? + fn( elem, name, !documentIsHTML ) : + undefined; + + return val !== undefined ? + val : + support.attributes || !documentIsHTML ? + elem.getAttribute( name ) : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; +}; + +Sizzle.escape = function( sel ) { + return ( sel + "" ).replace( rcssescape, fcssescape ); +}; + +Sizzle.error = function( msg ) { + throw new Error( "Syntax error, unrecognized expression: " + msg ); +}; + +/** + * Document sorting and removing duplicates + * @param {ArrayLike} results + */ +Sizzle.uniqueSort = function( results ) { + var elem, + duplicates = [], + j = 0, + i = 0; + + // Unless we *know* we can detect duplicates, assume their presence + hasDuplicate = !support.detectDuplicates; + sortInput = !support.sortStable && results.slice( 0 ); + results.sort( sortOrder ); + + if ( hasDuplicate ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem === results[ i ] ) { + j = duplicates.push( i ); + } + } + while ( j-- ) { + results.splice( duplicates[ j ], 1 ); + } + } + + // Clear input after sorting to release objects + // See https://github.com/jquery/sizzle/pull/225 + sortInput = null; + + return results; +}; + +/** + * Utility function for retrieving the text value of an array of DOM nodes + * @param {Array|Element} elem + */ +getText = Sizzle.getText = function( elem ) { + var node, + ret = "", + i = 0, + nodeType = elem.nodeType; + + if ( !nodeType ) { + + // If no nodeType, this is expected to be an array + while ( ( node = elem[ i++ ] ) ) { + + // Do not traverse comment nodes + ret += getText( node ); + } + } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { + + // Use textContent for elements + // innerText usage removed for consistency of new lines (jQuery #11153) + if ( typeof elem.textContent === "string" ) { + return elem.textContent; + } else { + + // Traverse its children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + ret += getText( elem ); + } + } + } else if ( nodeType === 3 || nodeType === 4 ) { + return elem.nodeValue; + } + + // Do not include comment or processing instruction nodes + + return ret; +}; + +Expr = Sizzle.selectors = { + + // Can be adjusted by the user + cacheLength: 50, + + createPseudo: markFunction, + + match: matchExpr, + + attrHandle: {}, + + find: {}, + + relative: { + ">": { dir: "parentNode", first: true }, + " ": { dir: "parentNode" }, + "+": { dir: "previousSibling", first: true }, + "~": { dir: "previousSibling" } + }, + + preFilter: { + "ATTR": function( match ) { + match[ 1 ] = match[ 1 ].replace( runescape, funescape ); + + // Move the given value to match[3] whether quoted or unquoted + match[ 3 ] = ( match[ 3 ] || match[ 4 ] || + match[ 5 ] || "" ).replace( runescape, funescape ); + + if ( match[ 2 ] === "~=" ) { + match[ 3 ] = " " + match[ 3 ] + " "; + } + + return match.slice( 0, 4 ); + }, + + "CHILD": function( match ) { + + /* matches from matchExpr["CHILD"] + 1 type (only|nth|...) + 2 what (child|of-type) + 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) + 4 xn-component of xn+y argument ([+-]?\d*n|) + 5 sign of xn-component + 6 x of xn-component + 7 sign of y-component + 8 y of y-component + */ + match[ 1 ] = match[ 1 ].toLowerCase(); + + if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { + + // nth-* requires argument + if ( !match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + // numeric x and y parameters for Expr.filter.CHILD + // remember that false/true cast respectively to 0/1 + match[ 4 ] = +( match[ 4 ] ? + match[ 5 ] + ( match[ 6 ] || 1 ) : + 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); + match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); + + // other types prohibit arguments + } else if ( match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + return match; + }, + + "PSEUDO": function( match ) { + var excess, + unquoted = !match[ 6 ] && match[ 2 ]; + + if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { + return null; + } + + // Accept quoted arguments as-is + if ( match[ 3 ] ) { + match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; + + // Strip excess characters from unquoted arguments + } else if ( unquoted && rpseudo.test( unquoted ) && + + // Get excess from tokenize (recursively) + ( excess = tokenize( unquoted, true ) ) && + + // advance to the next closing parenthesis + ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { + + // excess is a negative index + match[ 0 ] = match[ 0 ].slice( 0, excess ); + match[ 2 ] = unquoted.slice( 0, excess ); + } + + // Return only captures needed by the pseudo filter method (type and argument) + return match.slice( 0, 3 ); + } + }, + + filter: { + + "TAG": function( nodeNameSelector ) { + var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); + return nodeNameSelector === "*" ? + function() { + return true; + } : + function( elem ) { + return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; + }; + }, + + "CLASS": function( className ) { + var pattern = classCache[ className + " " ]; + + return pattern || + ( pattern = new RegExp( "(^|" + whitespace + + ")" + className + "(" + whitespace + "|$)" ) ) && classCache( + className, function( elem ) { + return pattern.test( + typeof elem.className === "string" && elem.className || + typeof elem.getAttribute !== "undefined" && + elem.getAttribute( "class" ) || + "" + ); + } ); + }, + + "ATTR": function( name, operator, check ) { + return function( elem ) { + var result = Sizzle.attr( elem, name ); + + if ( result == null ) { + return operator === "!="; + } + if ( !operator ) { + return true; + } + + result += ""; + + /* eslint-disable max-len */ + + return operator === "=" ? result === check : + operator === "!=" ? result !== check : + operator === "^=" ? check && result.indexOf( check ) === 0 : + operator === "*=" ? check && result.indexOf( check ) > -1 : + operator === "$=" ? check && result.slice( -check.length ) === check : + operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : + operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : + false; + /* eslint-enable max-len */ + + }; + }, + + "CHILD": function( type, what, _argument, first, last ) { + var simple = type.slice( 0, 3 ) !== "nth", + forward = type.slice( -4 ) !== "last", + ofType = what === "of-type"; + + return first === 1 && last === 0 ? + + // Shortcut for :nth-*(n) + function( elem ) { + return !!elem.parentNode; + } : + + function( elem, _context, xml ) { + var cache, uniqueCache, outerCache, node, nodeIndex, start, + dir = simple !== forward ? "nextSibling" : "previousSibling", + parent = elem.parentNode, + name = ofType && elem.nodeName.toLowerCase(), + useCache = !xml && !ofType, + diff = false; + + if ( parent ) { + + // :(first|last|only)-(child|of-type) + if ( simple ) { + while ( dir ) { + node = elem; + while ( ( node = node[ dir ] ) ) { + if ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) { + + return false; + } + } + + // Reverse direction for :only-* (if we haven't yet done so) + start = dir = type === "only" && !start && "nextSibling"; + } + return true; + } + + start = [ forward ? parent.firstChild : parent.lastChild ]; + + // non-xml :nth-child(...) stores cache data on `parent` + if ( forward && useCache ) { + + // Seek `elem` from a previously-cached index + + // ...in a gzip-friendly way + node = parent; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex && cache[ 2 ]; + node = nodeIndex && parent.childNodes[ nodeIndex ]; + + while ( ( node = ++nodeIndex && node && node[ dir ] || + + // Fallback to seeking `elem` from the start + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + // When found, cache indexes on `parent` and break + if ( node.nodeType === 1 && ++diff && node === elem ) { + uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; + break; + } + } + + } else { + + // Use previously-cached element index if available + if ( useCache ) { + + // ...in a gzip-friendly way + node = elem; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex; + } + + // xml :nth-child(...) + // or :nth-last-child(...) or :nth(-last)?-of-type(...) + if ( diff === false ) { + + // Use the same loop as above to seek `elem` from the start + while ( ( node = ++nodeIndex && node && node[ dir ] || + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + if ( ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) && + ++diff ) { + + // Cache the index of each encountered element + if ( useCache ) { + outerCache = node[ expando ] || + ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + uniqueCache[ type ] = [ dirruns, diff ]; + } + + if ( node === elem ) { + break; + } + } + } + } + } + + // Incorporate the offset, then check against cycle size + diff -= last; + return diff === first || ( diff % first === 0 && diff / first >= 0 ); + } + }; + }, + + "PSEUDO": function( pseudo, argument ) { + + // pseudo-class names are case-insensitive + // http://www.w3.org/TR/selectors/#pseudo-classes + // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters + // Remember that setFilters inherits from pseudos + var args, + fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || + Sizzle.error( "unsupported pseudo: " + pseudo ); + + // The user may use createPseudo to indicate that + // arguments are needed to create the filter function + // just as Sizzle does + if ( fn[ expando ] ) { + return fn( argument ); + } + + // But maintain support for old signatures + if ( fn.length > 1 ) { + args = [ pseudo, pseudo, "", argument ]; + return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? + markFunction( function( seed, matches ) { + var idx, + matched = fn( seed, argument ), + i = matched.length; + while ( i-- ) { + idx = indexOf( seed, matched[ i ] ); + seed[ idx ] = !( matches[ idx ] = matched[ i ] ); + } + } ) : + function( elem ) { + return fn( elem, 0, args ); + }; + } + + return fn; + } + }, + + pseudos: { + + // Potentially complex pseudos + "not": markFunction( function( selector ) { + + // Trim the selector passed to compile + // to avoid treating leading and trailing + // spaces as combinators + var input = [], + results = [], + matcher = compile( selector.replace( rtrim, "$1" ) ); + + return matcher[ expando ] ? + markFunction( function( seed, matches, _context, xml ) { + var elem, + unmatched = matcher( seed, null, xml, [] ), + i = seed.length; + + // Match elements unmatched by `matcher` + while ( i-- ) { + if ( ( elem = unmatched[ i ] ) ) { + seed[ i ] = !( matches[ i ] = elem ); + } + } + } ) : + function( elem, _context, xml ) { + input[ 0 ] = elem; + matcher( input, null, xml, results ); + + // Don't keep the element (issue #299) + input[ 0 ] = null; + return !results.pop(); + }; + } ), + + "has": markFunction( function( selector ) { + return function( elem ) { + return Sizzle( selector, elem ).length > 0; + }; + } ), + + "contains": markFunction( function( text ) { + text = text.replace( runescape, funescape ); + return function( elem ) { + return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; + }; + } ), + + // "Whether an element is represented by a :lang() selector + // is based solely on the element's language value + // being equal to the identifier C, + // or beginning with the identifier C immediately followed by "-". + // The matching of C against the element's language value is performed case-insensitively. + // The identifier C does not have to be a valid language name." + // http://www.w3.org/TR/selectors/#lang-pseudo + "lang": markFunction( function( lang ) { + + // lang value must be a valid identifier + if ( !ridentifier.test( lang || "" ) ) { + Sizzle.error( "unsupported lang: " + lang ); + } + lang = lang.replace( runescape, funescape ).toLowerCase(); + return function( elem ) { + var elemLang; + do { + if ( ( elemLang = documentIsHTML ? + elem.lang : + elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { + + elemLang = elemLang.toLowerCase(); + return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; + } + } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); + return false; + }; + } ), + + // Miscellaneous + "target": function( elem ) { + var hash = window.location && window.location.hash; + return hash && hash.slice( 1 ) === elem.id; + }, + + "root": function( elem ) { + return elem === docElem; + }, + + "focus": function( elem ) { + return elem === document.activeElement && + ( !document.hasFocus || document.hasFocus() ) && + !!( elem.type || elem.href || ~elem.tabIndex ); + }, + + // Boolean properties + "enabled": createDisabledPseudo( false ), + "disabled": createDisabledPseudo( true ), + + "checked": function( elem ) { + + // In CSS3, :checked should return both checked and selected elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + var nodeName = elem.nodeName.toLowerCase(); + return ( nodeName === "input" && !!elem.checked ) || + ( nodeName === "option" && !!elem.selected ); + }, + + "selected": function( elem ) { + + // Accessing this property makes selected-by-default + // options in Safari work properly + if ( elem.parentNode ) { + // eslint-disable-next-line no-unused-expressions + elem.parentNode.selectedIndex; + } + + return elem.selected === true; + }, + + // Contents + "empty": function( elem ) { + + // http://www.w3.org/TR/selectors/#empty-pseudo + // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), + // but not by others (comment: 8; processing instruction: 7; etc.) + // nodeType < 6 works because attributes (2) do not appear as children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + if ( elem.nodeType < 6 ) { + return false; + } + } + return true; + }, + + "parent": function( elem ) { + return !Expr.pseudos[ "empty" ]( elem ); + }, + + // Element/input types + "header": function( elem ) { + return rheader.test( elem.nodeName ); + }, + + "input": function( elem ) { + return rinputs.test( elem.nodeName ); + }, + + "button": function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === "button" || name === "button"; + }, + + "text": function( elem ) { + var attr; + return elem.nodeName.toLowerCase() === "input" && + elem.type === "text" && + + // Support: IE<8 + // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" + ( ( attr = elem.getAttribute( "type" ) ) == null || + attr.toLowerCase() === "text" ); + }, + + // Position-in-collection + "first": createPositionalPseudo( function() { + return [ 0 ]; + } ), + + "last": createPositionalPseudo( function( _matchIndexes, length ) { + return [ length - 1 ]; + } ), + + "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { + return [ argument < 0 ? argument + length : argument ]; + } ), + + "even": createPositionalPseudo( function( matchIndexes, length ) { + var i = 0; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "odd": createPositionalPseudo( function( matchIndexes, length ) { + var i = 1; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? + argument + length : + argument > length ? + length : + argument; + for ( ; --i >= 0; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? argument + length : argument; + for ( ; ++i < length; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ) + } +}; + +Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; + +// Add button/input type pseudos +for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { + Expr.pseudos[ i ] = createInputPseudo( i ); +} +for ( i in { submit: true, reset: true } ) { + Expr.pseudos[ i ] = createButtonPseudo( i ); +} + +// Easy API for creating new setFilters +function setFilters() {} +setFilters.prototype = Expr.filters = Expr.pseudos; +Expr.setFilters = new setFilters(); + +tokenize = Sizzle.tokenize = function( selector, parseOnly ) { + var matched, match, tokens, type, + soFar, groups, preFilters, + cached = tokenCache[ selector + " " ]; + + if ( cached ) { + return parseOnly ? 0 : cached.slice( 0 ); + } + + soFar = selector; + groups = []; + preFilters = Expr.preFilter; + + while ( soFar ) { + + // Comma and first run + if ( !matched || ( match = rcomma.exec( soFar ) ) ) { + if ( match ) { + + // Don't consume trailing commas as valid + soFar = soFar.slice( match[ 0 ].length ) || soFar; + } + groups.push( ( tokens = [] ) ); + } + + matched = false; + + // Combinators + if ( ( match = rcombinators.exec( soFar ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + + // Cast descendant combinators to space + type: match[ 0 ].replace( rtrim, " " ) + } ); + soFar = soFar.slice( matched.length ); + } + + // Filters + for ( type in Expr.filter ) { + if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || + ( match = preFilters[ type ]( match ) ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + type: type, + matches: match + } ); + soFar = soFar.slice( matched.length ); + } + } + + if ( !matched ) { + break; + } + } + + // Return the length of the invalid excess + // if we're just parsing + // Otherwise, throw an error or return tokens + return parseOnly ? + soFar.length : + soFar ? + Sizzle.error( selector ) : + + // Cache the tokens + tokenCache( selector, groups ).slice( 0 ); +}; + +function toSelector( tokens ) { + var i = 0, + len = tokens.length, + selector = ""; + for ( ; i < len; i++ ) { + selector += tokens[ i ].value; + } + return selector; +} + +function addCombinator( matcher, combinator, base ) { + var dir = combinator.dir, + skip = combinator.next, + key = skip || dir, + checkNonElements = base && key === "parentNode", + doneName = done++; + + return combinator.first ? + + // Check against closest ancestor/preceding element + function( elem, context, xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + return matcher( elem, context, xml ); + } + } + return false; + } : + + // Check against all ancestor/preceding elements + function( elem, context, xml ) { + var oldCache, uniqueCache, outerCache, + newCache = [ dirruns, doneName ]; + + // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching + if ( xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + if ( matcher( elem, context, xml ) ) { + return true; + } + } + } + } else { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + outerCache = elem[ expando ] || ( elem[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ elem.uniqueID ] || + ( outerCache[ elem.uniqueID ] = {} ); + + if ( skip && skip === elem.nodeName.toLowerCase() ) { + elem = elem[ dir ] || elem; + } else if ( ( oldCache = uniqueCache[ key ] ) && + oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { + + // Assign to newCache so results back-propagate to previous elements + return ( newCache[ 2 ] = oldCache[ 2 ] ); + } else { + + // Reuse newcache so results back-propagate to previous elements + uniqueCache[ key ] = newCache; + + // A match means we're done; a fail means we have to keep checking + if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { + return true; + } + } + } + } + } + return false; + }; +} + +function elementMatcher( matchers ) { + return matchers.length > 1 ? + function( elem, context, xml ) { + var i = matchers.length; + while ( i-- ) { + if ( !matchers[ i ]( elem, context, xml ) ) { + return false; + } + } + return true; + } : + matchers[ 0 ]; +} + +function multipleContexts( selector, contexts, results ) { + var i = 0, + len = contexts.length; + for ( ; i < len; i++ ) { + Sizzle( selector, contexts[ i ], results ); + } + return results; +} + +function condense( unmatched, map, filter, context, xml ) { + var elem, + newUnmatched = [], + i = 0, + len = unmatched.length, + mapped = map != null; + + for ( ; i < len; i++ ) { + if ( ( elem = unmatched[ i ] ) ) { + if ( !filter || filter( elem, context, xml ) ) { + newUnmatched.push( elem ); + if ( mapped ) { + map.push( i ); + } + } + } + } + + return newUnmatched; +} + +function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { + if ( postFilter && !postFilter[ expando ] ) { + postFilter = setMatcher( postFilter ); + } + if ( postFinder && !postFinder[ expando ] ) { + postFinder = setMatcher( postFinder, postSelector ); + } + return markFunction( function( seed, results, context, xml ) { + var temp, i, elem, + preMap = [], + postMap = [], + preexisting = results.length, + + // Get initial elements from seed or context + elems = seed || multipleContexts( + selector || "*", + context.nodeType ? [ context ] : context, + [] + ), + + // Prefilter to get matcher input, preserving a map for seed-results synchronization + matcherIn = preFilter && ( seed || !selector ) ? + condense( elems, preMap, preFilter, context, xml ) : + elems, + + matcherOut = matcher ? + + // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, + postFinder || ( seed ? preFilter : preexisting || postFilter ) ? + + // ...intermediate processing is necessary + [] : + + // ...otherwise use results directly + results : + matcherIn; + + // Find primary matches + if ( matcher ) { + matcher( matcherIn, matcherOut, context, xml ); + } + + // Apply postFilter + if ( postFilter ) { + temp = condense( matcherOut, postMap ); + postFilter( temp, [], context, xml ); + + // Un-match failing elements by moving them back to matcherIn + i = temp.length; + while ( i-- ) { + if ( ( elem = temp[ i ] ) ) { + matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); + } + } + } + + if ( seed ) { + if ( postFinder || preFilter ) { + if ( postFinder ) { + + // Get the final matcherOut by condensing this intermediate into postFinder contexts + temp = []; + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) ) { + + // Restore matcherIn since elem is not yet a final match + temp.push( ( matcherIn[ i ] = elem ) ); + } + } + postFinder( null, ( matcherOut = [] ), temp, xml ); + } + + // Move matched elements from seed to results to keep them synchronized + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) && + ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { + + seed[ temp ] = !( results[ temp ] = elem ); + } + } + } + + // Add elements to results, through postFinder if defined + } else { + matcherOut = condense( + matcherOut === results ? + matcherOut.splice( preexisting, matcherOut.length ) : + matcherOut + ); + if ( postFinder ) { + postFinder( null, results, matcherOut, xml ); + } else { + push.apply( results, matcherOut ); + } + } + } ); +} + +function matcherFromTokens( tokens ) { + var checkContext, matcher, j, + len = tokens.length, + leadingRelative = Expr.relative[ tokens[ 0 ].type ], + implicitRelative = leadingRelative || Expr.relative[ " " ], + i = leadingRelative ? 1 : 0, + + // The foundational matcher ensures that elements are reachable from top-level context(s) + matchContext = addCombinator( function( elem ) { + return elem === checkContext; + }, implicitRelative, true ), + matchAnyContext = addCombinator( function( elem ) { + return indexOf( checkContext, elem ) > -1; + }, implicitRelative, true ), + matchers = [ function( elem, context, xml ) { + var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( + ( checkContext = context ).nodeType ? + matchContext( elem, context, xml ) : + matchAnyContext( elem, context, xml ) ); + + // Avoid hanging onto element (issue #299) + checkContext = null; + return ret; + } ]; + + for ( ; i < len; i++ ) { + if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { + matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; + } else { + matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); + + // Return special upon seeing a positional matcher + if ( matcher[ expando ] ) { + + // Find the next relative operator (if any) for proper handling + j = ++i; + for ( ; j < len; j++ ) { + if ( Expr.relative[ tokens[ j ].type ] ) { + break; + } + } + return setMatcher( + i > 1 && elementMatcher( matchers ), + i > 1 && toSelector( + + // If the preceding token was a descendant combinator, insert an implicit any-element `*` + tokens + .slice( 0, i - 1 ) + .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) + ).replace( rtrim, "$1" ), + matcher, + i < j && matcherFromTokens( tokens.slice( i, j ) ), + j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), + j < len && toSelector( tokens ) + ); + } + matchers.push( matcher ); + } + } + + return elementMatcher( matchers ); +} + +function matcherFromGroupMatchers( elementMatchers, setMatchers ) { + var bySet = setMatchers.length > 0, + byElement = elementMatchers.length > 0, + superMatcher = function( seed, context, xml, results, outermost ) { + var elem, j, matcher, + matchedCount = 0, + i = "0", + unmatched = seed && [], + setMatched = [], + contextBackup = outermostContext, + + // We must always have either seed elements or outermost context + elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), + + // Use integer dirruns iff this is the outermost matcher + dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), + len = elems.length; + + if ( outermost ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + outermostContext = context == document || context || outermost; + } + + // Add elements passing elementMatchers directly to results + // Support: IE<9, Safari + // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id + for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { + if ( byElement && elem ) { + j = 0; + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( !context && elem.ownerDocument != document ) { + setDocument( elem ); + xml = !documentIsHTML; + } + while ( ( matcher = elementMatchers[ j++ ] ) ) { + if ( matcher( elem, context || document, xml ) ) { + results.push( elem ); + break; + } + } + if ( outermost ) { + dirruns = dirrunsUnique; + } + } + + // Track unmatched elements for set filters + if ( bySet ) { + + // They will have gone through all possible matchers + if ( ( elem = !matcher && elem ) ) { + matchedCount--; + } + + // Lengthen the array for every element, matched or not + if ( seed ) { + unmatched.push( elem ); + } + } + } + + // `i` is now the count of elements visited above, and adding it to `matchedCount` + // makes the latter nonnegative. + matchedCount += i; + + // Apply set filters to unmatched elements + // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` + // equals `i`), unless we didn't visit _any_ elements in the above loop because we have + // no element matchers and no seed. + // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that + // case, which will result in a "00" `matchedCount` that differs from `i` but is also + // numerically zero. + if ( bySet && i !== matchedCount ) { + j = 0; + while ( ( matcher = setMatchers[ j++ ] ) ) { + matcher( unmatched, setMatched, context, xml ); + } + + if ( seed ) { + + // Reintegrate element matches to eliminate the need for sorting + if ( matchedCount > 0 ) { + while ( i-- ) { + if ( !( unmatched[ i ] || setMatched[ i ] ) ) { + setMatched[ i ] = pop.call( results ); + } + } + } + + // Discard index placeholder values to get only actual matches + setMatched = condense( setMatched ); + } + + // Add matches to results + push.apply( results, setMatched ); + + // Seedless set matches succeeding multiple successful matchers stipulate sorting + if ( outermost && !seed && setMatched.length > 0 && + ( matchedCount + setMatchers.length ) > 1 ) { + + Sizzle.uniqueSort( results ); + } + } + + // Override manipulation of globals by nested matchers + if ( outermost ) { + dirruns = dirrunsUnique; + outermostContext = contextBackup; + } + + return unmatched; + }; + + return bySet ? + markFunction( superMatcher ) : + superMatcher; +} + +compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { + var i, + setMatchers = [], + elementMatchers = [], + cached = compilerCache[ selector + " " ]; + + if ( !cached ) { + + // Generate a function of recursive functions that can be used to check each element + if ( !match ) { + match = tokenize( selector ); + } + i = match.length; + while ( i-- ) { + cached = matcherFromTokens( match[ i ] ); + if ( cached[ expando ] ) { + setMatchers.push( cached ); + } else { + elementMatchers.push( cached ); + } + } + + // Cache the compiled function + cached = compilerCache( + selector, + matcherFromGroupMatchers( elementMatchers, setMatchers ) + ); + + // Save selector and tokenization + cached.selector = selector; + } + return cached; +}; + +/** + * A low-level selection function that works with Sizzle's compiled + * selector functions + * @param {String|Function} selector A selector or a pre-compiled + * selector function built with Sizzle.compile + * @param {Element} context + * @param {Array} [results] + * @param {Array} [seed] A set of elements to match against + */ +select = Sizzle.select = function( selector, context, results, seed ) { + var i, tokens, token, type, find, + compiled = typeof selector === "function" && selector, + match = !seed && tokenize( ( selector = compiled.selector || selector ) ); + + results = results || []; + + // Try to minimize operations if there is only one selector in the list and no seed + // (the latter of which guarantees us context) + if ( match.length === 1 ) { + + // Reduce context if the leading compound selector is an ID + tokens = match[ 0 ] = match[ 0 ].slice( 0 ); + if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && + context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { + + context = ( Expr.find[ "ID" ]( token.matches[ 0 ] + .replace( runescape, funescape ), context ) || [] )[ 0 ]; + if ( !context ) { + return results; + + // Precompiled matchers will still verify ancestry, so step up a level + } else if ( compiled ) { + context = context.parentNode; + } + + selector = selector.slice( tokens.shift().value.length ); + } + + // Fetch a seed set for right-to-left matching + i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; + while ( i-- ) { + token = tokens[ i ]; + + // Abort if we hit a combinator + if ( Expr.relative[ ( type = token.type ) ] ) { + break; + } + if ( ( find = Expr.find[ type ] ) ) { + + // Search, expanding context for leading sibling combinators + if ( ( seed = find( + token.matches[ 0 ].replace( runescape, funescape ), + rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || + context + ) ) ) { + + // If seed is empty or no tokens remain, we can return early + tokens.splice( i, 1 ); + selector = seed.length && toSelector( tokens ); + if ( !selector ) { + push.apply( results, seed ); + return results; + } + + break; + } + } + } + } + + // Compile and execute a filtering function if one is not provided + // Provide `match` to avoid retokenization if we modified the selector above + ( compiled || compile( selector, match ) )( + seed, + context, + !documentIsHTML, + results, + !context || rsibling.test( selector ) && testContext( context.parentNode ) || context + ); + return results; +}; + +// One-time assignments + +// Sort stability +support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; + +// Support: Chrome 14-35+ +// Always assume duplicates if they aren't passed to the comparison function +support.detectDuplicates = !!hasDuplicate; + +// Initialize against the default document +setDocument(); + +// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) +// Detached nodes confoundingly follow *each other* +support.sortDetached = assert( function( el ) { + + // Should return 1, but returns 4 (following) + return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; +} ); + +// Support: IE<8 +// Prevent attribute/property "interpolation" +// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx +if ( !assert( function( el ) { + el.innerHTML = ""; + return el.firstChild.getAttribute( "href" ) === "#"; +} ) ) { + addHandle( "type|href|height|width", function( elem, name, isXML ) { + if ( !isXML ) { + return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); + } + } ); +} + +// Support: IE<9 +// Use defaultValue in place of getAttribute("value") +if ( !support.attributes || !assert( function( el ) { + el.innerHTML = ""; + el.firstChild.setAttribute( "value", "" ); + return el.firstChild.getAttribute( "value" ) === ""; +} ) ) { + addHandle( "value", function( elem, _name, isXML ) { + if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { + return elem.defaultValue; + } + } ); +} + +// Support: IE<9 +// Use getAttributeNode to fetch booleans when getAttribute lies +if ( !assert( function( el ) { + return el.getAttribute( "disabled" ) == null; +} ) ) { + addHandle( booleans, function( elem, name, isXML ) { + var val; + if ( !isXML ) { + return elem[ name ] === true ? name.toLowerCase() : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; + } + } ); +} + +return Sizzle; + +} )( window ); + + + +jQuery.find = Sizzle; +jQuery.expr = Sizzle.selectors; + +// Deprecated +jQuery.expr[ ":" ] = jQuery.expr.pseudos; +jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; +jQuery.text = Sizzle.getText; +jQuery.isXMLDoc = Sizzle.isXML; +jQuery.contains = Sizzle.contains; +jQuery.escapeSelector = Sizzle.escape; + + + + +var dir = function( elem, dir, until ) { + var matched = [], + truncate = until !== undefined; + + while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { + if ( elem.nodeType === 1 ) { + if ( truncate && jQuery( elem ).is( until ) ) { + break; + } + matched.push( elem ); + } + } + return matched; +}; + + +var siblings = function( n, elem ) { + var matched = []; + + for ( ; n; n = n.nextSibling ) { + if ( n.nodeType === 1 && n !== elem ) { + matched.push( n ); + } + } + + return matched; +}; + + +var rneedsContext = jQuery.expr.match.needsContext; + + + +function nodeName( elem, name ) { + + return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); + +}; +var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); + + + +// Implement the identical functionality for filter and not +function winnow( elements, qualifier, not ) { + if ( isFunction( qualifier ) ) { + return jQuery.grep( elements, function( elem, i ) { + return !!qualifier.call( elem, i, elem ) !== not; + } ); + } + + // Single element + if ( qualifier.nodeType ) { + return jQuery.grep( elements, function( elem ) { + return ( elem === qualifier ) !== not; + } ); + } + + // Arraylike of elements (jQuery, arguments, Array) + if ( typeof qualifier !== "string" ) { + return jQuery.grep( elements, function( elem ) { + return ( indexOf.call( qualifier, elem ) > -1 ) !== not; + } ); + } + + // Filtered directly for both simple and complex selectors + return jQuery.filter( qualifier, elements, not ); +} + +jQuery.filter = function( expr, elems, not ) { + var elem = elems[ 0 ]; + + if ( not ) { + expr = ":not(" + expr + ")"; + } + + if ( elems.length === 1 && elem.nodeType === 1 ) { + return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; + } + + return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { + return elem.nodeType === 1; + } ) ); +}; + +jQuery.fn.extend( { + find: function( selector ) { + var i, ret, + len = this.length, + self = this; + + if ( typeof selector !== "string" ) { + return this.pushStack( jQuery( selector ).filter( function() { + for ( i = 0; i < len; i++ ) { + if ( jQuery.contains( self[ i ], this ) ) { + return true; + } + } + } ) ); + } + + ret = this.pushStack( [] ); + + for ( i = 0; i < len; i++ ) { + jQuery.find( selector, self[ i ], ret ); + } + + return len > 1 ? jQuery.uniqueSort( ret ) : ret; + }, + filter: function( selector ) { + return this.pushStack( winnow( this, selector || [], false ) ); + }, + not: function( selector ) { + return this.pushStack( winnow( this, selector || [], true ) ); + }, + is: function( selector ) { + return !!winnow( + this, + + // If this is a positional/relative selector, check membership in the returned set + // so $("p:first").is("p:last") won't return true for a doc with two "p". + typeof selector === "string" && rneedsContext.test( selector ) ? + jQuery( selector ) : + selector || [], + false + ).length; + } +} ); + + +// Initialize a jQuery object + + +// A central reference to the root jQuery(document) +var rootjQuery, + + // A simple way to check for HTML strings + // Prioritize #id over to avoid XSS via location.hash (#9521) + // Strict HTML recognition (#11290: must start with <) + // Shortcut simple #id case for speed + rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, + + init = jQuery.fn.init = function( selector, context, root ) { + var match, elem; + + // HANDLE: $(""), $(null), $(undefined), $(false) + if ( !selector ) { + return this; + } + + // Method init() accepts an alternate rootjQuery + // so migrate can support jQuery.sub (gh-2101) + root = root || rootjQuery; + + // Handle HTML strings + if ( typeof selector === "string" ) { + if ( selector[ 0 ] === "<" && + selector[ selector.length - 1 ] === ">" && + selector.length >= 3 ) { + + // Assume that strings that start and end with <> are HTML and skip the regex check + match = [ null, selector, null ]; + + } else { + match = rquickExpr.exec( selector ); + } + + // Match html or make sure no context is specified for #id + if ( match && ( match[ 1 ] || !context ) ) { + + // HANDLE: $(html) -> $(array) + if ( match[ 1 ] ) { + context = context instanceof jQuery ? context[ 0 ] : context; + + // Option to run scripts is true for back-compat + // Intentionally let the error be thrown if parseHTML is not present + jQuery.merge( this, jQuery.parseHTML( + match[ 1 ], + context && context.nodeType ? context.ownerDocument || context : document, + true + ) ); + + // HANDLE: $(html, props) + if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { + for ( match in context ) { + + // Properties of context are called as methods if possible + if ( isFunction( this[ match ] ) ) { + this[ match ]( context[ match ] ); + + // ...and otherwise set as attributes + } else { + this.attr( match, context[ match ] ); + } + } + } + + return this; + + // HANDLE: $(#id) + } else { + elem = document.getElementById( match[ 2 ] ); + + if ( elem ) { + + // Inject the element directly into the jQuery object + this[ 0 ] = elem; + this.length = 1; + } + return this; + } + + // HANDLE: $(expr, $(...)) + } else if ( !context || context.jquery ) { + return ( context || root ).find( selector ); + + // HANDLE: $(expr, context) + // (which is just equivalent to: $(context).find(expr) + } else { + return this.constructor( context ).find( selector ); + } + + // HANDLE: $(DOMElement) + } else if ( selector.nodeType ) { + this[ 0 ] = selector; + this.length = 1; + return this; + + // HANDLE: $(function) + // Shortcut for document ready + } else if ( isFunction( selector ) ) { + return root.ready !== undefined ? + root.ready( selector ) : + + // Execute immediately if ready is not present + selector( jQuery ); + } + + return jQuery.makeArray( selector, this ); + }; + +// Give the init function the jQuery prototype for later instantiation +init.prototype = jQuery.fn; + +// Initialize central reference +rootjQuery = jQuery( document ); + + +var rparentsprev = /^(?:parents|prev(?:Until|All))/, + + // Methods guaranteed to produce a unique set when starting from a unique set + guaranteedUnique = { + children: true, + contents: true, + next: true, + prev: true + }; + +jQuery.fn.extend( { + has: function( target ) { + var targets = jQuery( target, this ), + l = targets.length; + + return this.filter( function() { + var i = 0; + for ( ; i < l; i++ ) { + if ( jQuery.contains( this, targets[ i ] ) ) { + return true; + } + } + } ); + }, + + closest: function( selectors, context ) { + var cur, + i = 0, + l = this.length, + matched = [], + targets = typeof selectors !== "string" && jQuery( selectors ); + + // Positional selectors never match, since there's no _selection_ context + if ( !rneedsContext.test( selectors ) ) { + for ( ; i < l; i++ ) { + for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { + + // Always skip document fragments + if ( cur.nodeType < 11 && ( targets ? + targets.index( cur ) > -1 : + + // Don't pass non-elements to Sizzle + cur.nodeType === 1 && + jQuery.find.matchesSelector( cur, selectors ) ) ) { + + matched.push( cur ); + break; + } + } + } + } + + return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); + }, + + // Determine the position of an element within the set + index: function( elem ) { + + // No argument, return index in parent + if ( !elem ) { + return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; + } + + // Index in selector + if ( typeof elem === "string" ) { + return indexOf.call( jQuery( elem ), this[ 0 ] ); + } + + // Locate the position of the desired element + return indexOf.call( this, + + // If it receives a jQuery object, the first element is used + elem.jquery ? elem[ 0 ] : elem + ); + }, + + add: function( selector, context ) { + return this.pushStack( + jQuery.uniqueSort( + jQuery.merge( this.get(), jQuery( selector, context ) ) + ) + ); + }, + + addBack: function( selector ) { + return this.add( selector == null ? + this.prevObject : this.prevObject.filter( selector ) + ); + } +} ); + +function sibling( cur, dir ) { + while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} + return cur; +} + +jQuery.each( { + parent: function( elem ) { + var parent = elem.parentNode; + return parent && parent.nodeType !== 11 ? parent : null; + }, + parents: function( elem ) { + return dir( elem, "parentNode" ); + }, + parentsUntil: function( elem, _i, until ) { + return dir( elem, "parentNode", until ); + }, + next: function( elem ) { + return sibling( elem, "nextSibling" ); + }, + prev: function( elem ) { + return sibling( elem, "previousSibling" ); + }, + nextAll: function( elem ) { + return dir( elem, "nextSibling" ); + }, + prevAll: function( elem ) { + return dir( elem, "previousSibling" ); + }, + nextUntil: function( elem, _i, until ) { + return dir( elem, "nextSibling", until ); + }, + prevUntil: function( elem, _i, until ) { + return dir( elem, "previousSibling", until ); + }, + siblings: function( elem ) { + return siblings( ( elem.parentNode || {} ).firstChild, elem ); + }, + children: function( elem ) { + return siblings( elem.firstChild ); + }, + contents: function( elem ) { + if ( elem.contentDocument != null && + + // Support: IE 11+ + // elements with no `data` attribute has an object + // `contentDocument` with a `null` prototype. + getProto( elem.contentDocument ) ) { + + return elem.contentDocument; + } + + // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only + // Treat the template element as a regular one in browsers that + // don't support it. + if ( nodeName( elem, "template" ) ) { + elem = elem.content || elem; + } + + return jQuery.merge( [], elem.childNodes ); + } +}, function( name, fn ) { + jQuery.fn[ name ] = function( until, selector ) { + var matched = jQuery.map( this, fn, until ); + + if ( name.slice( -5 ) !== "Until" ) { + selector = until; + } + + if ( selector && typeof selector === "string" ) { + matched = jQuery.filter( selector, matched ); + } + + if ( this.length > 1 ) { + + // Remove duplicates + if ( !guaranteedUnique[ name ] ) { + jQuery.uniqueSort( matched ); + } + + // Reverse order for parents* and prev-derivatives + if ( rparentsprev.test( name ) ) { + matched.reverse(); + } + } + + return this.pushStack( matched ); + }; +} ); +var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); + + + +// Convert String-formatted options into Object-formatted ones +function createOptions( options ) { + var object = {}; + jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { + object[ flag ] = true; + } ); + return object; +} + +/* + * Create a callback list using the following parameters: + * + * options: an optional list of space-separated options that will change how + * the callback list behaves or a more traditional option object + * + * By default a callback list will act like an event callback list and can be + * "fired" multiple times. + * + * Possible options: + * + * once: will ensure the callback list can only be fired once (like a Deferred) + * + * memory: will keep track of previous values and will call any callback added + * after the list has been fired right away with the latest "memorized" + * values (like a Deferred) + * + * unique: will ensure a callback can only be added once (no duplicate in the list) + * + * stopOnFalse: interrupt callings when a callback returns false + * + */ +jQuery.Callbacks = function( options ) { + + // Convert options from String-formatted to Object-formatted if needed + // (we check in cache first) + options = typeof options === "string" ? + createOptions( options ) : + jQuery.extend( {}, options ); + + var // Flag to know if list is currently firing + firing, + + // Last fire value for non-forgettable lists + memory, + + // Flag to know if list was already fired + fired, + + // Flag to prevent firing + locked, + + // Actual callback list + list = [], + + // Queue of execution data for repeatable lists + queue = [], + + // Index of currently firing callback (modified by add/remove as needed) + firingIndex = -1, + + // Fire callbacks + fire = function() { + + // Enforce single-firing + locked = locked || options.once; + + // Execute callbacks for all pending executions, + // respecting firingIndex overrides and runtime changes + fired = firing = true; + for ( ; queue.length; firingIndex = -1 ) { + memory = queue.shift(); + while ( ++firingIndex < list.length ) { + + // Run callback and check for early termination + if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && + options.stopOnFalse ) { + + // Jump to end and forget the data so .add doesn't re-fire + firingIndex = list.length; + memory = false; + } + } + } + + // Forget the data if we're done with it + if ( !options.memory ) { + memory = false; + } + + firing = false; + + // Clean up if we're done firing for good + if ( locked ) { + + // Keep an empty list if we have data for future add calls + if ( memory ) { + list = []; + + // Otherwise, this object is spent + } else { + list = ""; + } + } + }, + + // Actual Callbacks object + self = { + + // Add a callback or a collection of callbacks to the list + add: function() { + if ( list ) { + + // If we have memory from a past run, we should fire after adding + if ( memory && !firing ) { + firingIndex = list.length - 1; + queue.push( memory ); + } + + ( function add( args ) { + jQuery.each( args, function( _, arg ) { + if ( isFunction( arg ) ) { + if ( !options.unique || !self.has( arg ) ) { + list.push( arg ); + } + } else if ( arg && arg.length && toType( arg ) !== "string" ) { + + // Inspect recursively + add( arg ); + } + } ); + } )( arguments ); + + if ( memory && !firing ) { + fire(); + } + } + return this; + }, + + // Remove a callback from the list + remove: function() { + jQuery.each( arguments, function( _, arg ) { + var index; + while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { + list.splice( index, 1 ); + + // Handle firing indexes + if ( index <= firingIndex ) { + firingIndex--; + } + } + } ); + return this; + }, + + // Check if a given callback is in the list. + // If no argument is given, return whether or not list has callbacks attached. + has: function( fn ) { + return fn ? + jQuery.inArray( fn, list ) > -1 : + list.length > 0; + }, + + // Remove all callbacks from the list + empty: function() { + if ( list ) { + list = []; + } + return this; + }, + + // Disable .fire and .add + // Abort any current/pending executions + // Clear all callbacks and values + disable: function() { + locked = queue = []; + list = memory = ""; + return this; + }, + disabled: function() { + return !list; + }, + + // Disable .fire + // Also disable .add unless we have memory (since it would have no effect) + // Abort any pending executions + lock: function() { + locked = queue = []; + if ( !memory && !firing ) { + list = memory = ""; + } + return this; + }, + locked: function() { + return !!locked; + }, + + // Call all callbacks with the given context and arguments + fireWith: function( context, args ) { + if ( !locked ) { + args = args || []; + args = [ context, args.slice ? args.slice() : args ]; + queue.push( args ); + if ( !firing ) { + fire(); + } + } + return this; + }, + + // Call all the callbacks with the given arguments + fire: function() { + self.fireWith( this, arguments ); + return this; + }, + + // To know if the callbacks have already been called at least once + fired: function() { + return !!fired; + } + }; + + return self; +}; + + +function Identity( v ) { + return v; +} +function Thrower( ex ) { + throw ex; +} + +function adoptValue( value, resolve, reject, noValue ) { + var method; + + try { + + // Check for promise aspect first to privilege synchronous behavior + if ( value && isFunction( ( method = value.promise ) ) ) { + method.call( value ).done( resolve ).fail( reject ); + + // Other thenables + } else if ( value && isFunction( ( method = value.then ) ) ) { + method.call( value, resolve, reject ); + + // Other non-thenables + } else { + + // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: + // * false: [ value ].slice( 0 ) => resolve( value ) + // * true: [ value ].slice( 1 ) => resolve() + resolve.apply( undefined, [ value ].slice( noValue ) ); + } + + // For Promises/A+, convert exceptions into rejections + // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in + // Deferred#then to conditionally suppress rejection. + } catch ( value ) { + + // Support: Android 4.0 only + // Strict mode functions invoked without .call/.apply get global-object context + reject.apply( undefined, [ value ] ); + } +} + +jQuery.extend( { + + Deferred: function( func ) { + var tuples = [ + + // action, add listener, callbacks, + // ... .then handlers, argument index, [final state] + [ "notify", "progress", jQuery.Callbacks( "memory" ), + jQuery.Callbacks( "memory" ), 2 ], + [ "resolve", "done", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 0, "resolved" ], + [ "reject", "fail", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 1, "rejected" ] + ], + state = "pending", + promise = { + state: function() { + return state; + }, + always: function() { + deferred.done( arguments ).fail( arguments ); + return this; + }, + "catch": function( fn ) { + return promise.then( null, fn ); + }, + + // Keep pipe for back-compat + pipe: function( /* fnDone, fnFail, fnProgress */ ) { + var fns = arguments; + + return jQuery.Deferred( function( newDefer ) { + jQuery.each( tuples, function( _i, tuple ) { + + // Map tuples (progress, done, fail) to arguments (done, fail, progress) + var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; + + // deferred.progress(function() { bind to newDefer or newDefer.notify }) + // deferred.done(function() { bind to newDefer or newDefer.resolve }) + // deferred.fail(function() { bind to newDefer or newDefer.reject }) + deferred[ tuple[ 1 ] ]( function() { + var returned = fn && fn.apply( this, arguments ); + if ( returned && isFunction( returned.promise ) ) { + returned.promise() + .progress( newDefer.notify ) + .done( newDefer.resolve ) + .fail( newDefer.reject ); + } else { + newDefer[ tuple[ 0 ] + "With" ]( + this, + fn ? [ returned ] : arguments + ); + } + } ); + } ); + fns = null; + } ).promise(); + }, + then: function( onFulfilled, onRejected, onProgress ) { + var maxDepth = 0; + function resolve( depth, deferred, handler, special ) { + return function() { + var that = this, + args = arguments, + mightThrow = function() { + var returned, then; + + // Support: Promises/A+ section 2.3.3.3.3 + // https://promisesaplus.com/#point-59 + // Ignore double-resolution attempts + if ( depth < maxDepth ) { + return; + } + + returned = handler.apply( that, args ); + + // Support: Promises/A+ section 2.3.1 + // https://promisesaplus.com/#point-48 + if ( returned === deferred.promise() ) { + throw new TypeError( "Thenable self-resolution" ); + } + + // Support: Promises/A+ sections 2.3.3.1, 3.5 + // https://promisesaplus.com/#point-54 + // https://promisesaplus.com/#point-75 + // Retrieve `then` only once + then = returned && + + // Support: Promises/A+ section 2.3.4 + // https://promisesaplus.com/#point-64 + // Only check objects and functions for thenability + ( typeof returned === "object" || + typeof returned === "function" ) && + returned.then; + + // Handle a returned thenable + if ( isFunction( then ) ) { + + // Special processors (notify) just wait for resolution + if ( special ) { + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ) + ); + + // Normal processors (resolve) also hook into progress + } else { + + // ...and disregard older resolution values + maxDepth++; + + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ), + resolve( maxDepth, deferred, Identity, + deferred.notifyWith ) + ); + } + + // Handle all other returned values + } else { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Identity ) { + that = undefined; + args = [ returned ]; + } + + // Process the value(s) + // Default process is resolve + ( special || deferred.resolveWith )( that, args ); + } + }, + + // Only normal processors (resolve) catch and reject exceptions + process = special ? + mightThrow : + function() { + try { + mightThrow(); + } catch ( e ) { + + if ( jQuery.Deferred.exceptionHook ) { + jQuery.Deferred.exceptionHook( e, + process.stackTrace ); + } + + // Support: Promises/A+ section 2.3.3.3.4.1 + // https://promisesaplus.com/#point-61 + // Ignore post-resolution exceptions + if ( depth + 1 >= maxDepth ) { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Thrower ) { + that = undefined; + args = [ e ]; + } + + deferred.rejectWith( that, args ); + } + } + }; + + // Support: Promises/A+ section 2.3.3.3.1 + // https://promisesaplus.com/#point-57 + // Re-resolve promises immediately to dodge false rejection from + // subsequent errors + if ( depth ) { + process(); + } else { + + // Call an optional hook to record the stack, in case of exception + // since it's otherwise lost when execution goes async + if ( jQuery.Deferred.getStackHook ) { + process.stackTrace = jQuery.Deferred.getStackHook(); + } + window.setTimeout( process ); + } + }; + } + + return jQuery.Deferred( function( newDefer ) { + + // progress_handlers.add( ... ) + tuples[ 0 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onProgress ) ? + onProgress : + Identity, + newDefer.notifyWith + ) + ); + + // fulfilled_handlers.add( ... ) + tuples[ 1 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onFulfilled ) ? + onFulfilled : + Identity + ) + ); + + // rejected_handlers.add( ... ) + tuples[ 2 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onRejected ) ? + onRejected : + Thrower + ) + ); + } ).promise(); + }, + + // Get a promise for this deferred + // If obj is provided, the promise aspect is added to the object + promise: function( obj ) { + return obj != null ? jQuery.extend( obj, promise ) : promise; + } + }, + deferred = {}; + + // Add list-specific methods + jQuery.each( tuples, function( i, tuple ) { + var list = tuple[ 2 ], + stateString = tuple[ 5 ]; + + // promise.progress = list.add + // promise.done = list.add + // promise.fail = list.add + promise[ tuple[ 1 ] ] = list.add; + + // Handle state + if ( stateString ) { + list.add( + function() { + + // state = "resolved" (i.e., fulfilled) + // state = "rejected" + state = stateString; + }, + + // rejected_callbacks.disable + // fulfilled_callbacks.disable + tuples[ 3 - i ][ 2 ].disable, + + // rejected_handlers.disable + // fulfilled_handlers.disable + tuples[ 3 - i ][ 3 ].disable, + + // progress_callbacks.lock + tuples[ 0 ][ 2 ].lock, + + // progress_handlers.lock + tuples[ 0 ][ 3 ].lock + ); + } + + // progress_handlers.fire + // fulfilled_handlers.fire + // rejected_handlers.fire + list.add( tuple[ 3 ].fire ); + + // deferred.notify = function() { deferred.notifyWith(...) } + // deferred.resolve = function() { deferred.resolveWith(...) } + // deferred.reject = function() { deferred.rejectWith(...) } + deferred[ tuple[ 0 ] ] = function() { + deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); + return this; + }; + + // deferred.notifyWith = list.fireWith + // deferred.resolveWith = list.fireWith + // deferred.rejectWith = list.fireWith + deferred[ tuple[ 0 ] + "With" ] = list.fireWith; + } ); + + // Make the deferred a promise + promise.promise( deferred ); + + // Call given func if any + if ( func ) { + func.call( deferred, deferred ); + } + + // All done! + return deferred; + }, + + // Deferred helper + when: function( singleValue ) { + var + + // count of uncompleted subordinates + remaining = arguments.length, + + // count of unprocessed arguments + i = remaining, + + // subordinate fulfillment data + resolveContexts = Array( i ), + resolveValues = slice.call( arguments ), + + // the master Deferred + master = jQuery.Deferred(), + + // subordinate callback factory + updateFunc = function( i ) { + return function( value ) { + resolveContexts[ i ] = this; + resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; + if ( !( --remaining ) ) { + master.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, master.done( updateFunc( i ) ).resolve, master.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( master.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return master.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), master.reject ); + } + + return master.promise(); + } +} ); + + +// These usually indicate a programmer mistake during development, +// warn about them ASAP rather than swallowing them by default. +var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; + +jQuery.Deferred.exceptionHook = function( error, stack ) { + + // Support: IE 8 - 9 only + // Console exists when dev tools are open, which can happen at any time + if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { + window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); + } +}; + + + + +jQuery.readyException = function( error ) { + window.setTimeout( function() { + throw error; + } ); +}; + + + + +// The deferred used on DOM ready +var readyList = jQuery.Deferred(); + +jQuery.fn.ready = function( fn ) { + + readyList + .then( fn ) + + // Wrap jQuery.readyException in a function so that the lookup + // happens at the time of error handling instead of callback + // registration. + .catch( function( error ) { + jQuery.readyException( error ); + } ); + + return this; +}; + +jQuery.extend( { + + // Is the DOM ready to be used? Set to true once it occurs. + isReady: false, + + // A counter to track how many items to wait for before + // the ready event fires. See #6781 + readyWait: 1, + + // Handle when the DOM is ready + ready: function( wait ) { + + // Abort if there are pending holds or we're already ready + if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { + return; + } + + // Remember that the DOM is ready + jQuery.isReady = true; + + // If a normal DOM Ready event fired, decrement, and wait if need be + if ( wait !== true && --jQuery.readyWait > 0 ) { + return; + } + + // If there are functions bound, to execute + readyList.resolveWith( document, [ jQuery ] ); + } +} ); + +jQuery.ready.then = readyList.then; + +// The ready event handler and self cleanup method +function completed() { + document.removeEventListener( "DOMContentLoaded", completed ); + window.removeEventListener( "load", completed ); + jQuery.ready(); +} + +// Catch cases where $(document).ready() is called +// after the browser event has already occurred. +// Support: IE <=9 - 10 only +// Older IE sometimes signals "interactive" too soon +if ( document.readyState === "complete" || + ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { + + // Handle it asynchronously to allow scripts the opportunity to delay ready + window.setTimeout( jQuery.ready ); + +} else { + + // Use the handy event callback + document.addEventListener( "DOMContentLoaded", completed ); + + // A fallback to window.onload, that will always work + window.addEventListener( "load", completed ); +} + + + + +// Multifunctional method to get and set values of a collection +// The value/s can optionally be executed if it's a function +var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { + var i = 0, + len = elems.length, + bulk = key == null; + + // Sets many values + if ( toType( key ) === "object" ) { + chainable = true; + for ( i in key ) { + access( elems, fn, i, key[ i ], true, emptyGet, raw ); + } + + // Sets one value + } else if ( value !== undefined ) { + chainable = true; + + if ( !isFunction( value ) ) { + raw = true; + } + + if ( bulk ) { + + // Bulk operations run against the entire set + if ( raw ) { + fn.call( elems, value ); + fn = null; + + // ...except when executing function values + } else { + bulk = fn; + fn = function( elem, _key, value ) { + return bulk.call( jQuery( elem ), value ); + }; + } + } + + if ( fn ) { + for ( ; i < len; i++ ) { + fn( + elems[ i ], key, raw ? + value : + value.call( elems[ i ], i, fn( elems[ i ], key ) ) + ); + } + } + } + + if ( chainable ) { + return elems; + } + + // Gets + if ( bulk ) { + return fn.call( elems ); + } + + return len ? fn( elems[ 0 ], key ) : emptyGet; +}; + + +// Matches dashed string for camelizing +var rmsPrefix = /^-ms-/, + rdashAlpha = /-([a-z])/g; + +// Used by camelCase as callback to replace() +function fcamelCase( _all, letter ) { + return letter.toUpperCase(); +} + +// Convert dashed to camelCase; used by the css and data modules +// Support: IE <=9 - 11, Edge 12 - 15 +// Microsoft forgot to hump their vendor prefix (#9572) +function camelCase( string ) { + return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); +} +var acceptData = function( owner ) { + + // Accepts only: + // - Node + // - Node.ELEMENT_NODE + // - Node.DOCUMENT_NODE + // - Object + // - Any + return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); +}; + + + + +function Data() { + this.expando = jQuery.expando + Data.uid++; +} + +Data.uid = 1; + +Data.prototype = { + + cache: function( owner ) { + + // Check if the owner object already has a cache + var value = owner[ this.expando ]; + + // If not, create one + if ( !value ) { + value = {}; + + // We can accept data for non-element nodes in modern browsers, + // but we should not, see #8335. + // Always return an empty object. + if ( acceptData( owner ) ) { + + // If it is a node unlikely to be stringify-ed or looped over + // use plain assignment + if ( owner.nodeType ) { + owner[ this.expando ] = value; + + // Otherwise secure it in a non-enumerable property + // configurable must be true to allow the property to be + // deleted when data is removed + } else { + Object.defineProperty( owner, this.expando, { + value: value, + configurable: true + } ); + } + } + } + + return value; + }, + set: function( owner, data, value ) { + var prop, + cache = this.cache( owner ); + + // Handle: [ owner, key, value ] args + // Always use camelCase key (gh-2257) + if ( typeof data === "string" ) { + cache[ camelCase( data ) ] = value; + + // Handle: [ owner, { properties } ] args + } else { + + // Copy the properties one-by-one to the cache object + for ( prop in data ) { + cache[ camelCase( prop ) ] = data[ prop ]; + } + } + return cache; + }, + get: function( owner, key ) { + return key === undefined ? + this.cache( owner ) : + + // Always use camelCase key (gh-2257) + owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; + }, + access: function( owner, key, value ) { + + // In cases where either: + // + // 1. No key was specified + // 2. A string key was specified, but no value provided + // + // Take the "read" path and allow the get method to determine + // which value to return, respectively either: + // + // 1. The entire cache object + // 2. The data stored at the key + // + if ( key === undefined || + ( ( key && typeof key === "string" ) && value === undefined ) ) { + + return this.get( owner, key ); + } + + // When the key is not a string, or both a key and value + // are specified, set or extend (existing objects) with either: + // + // 1. An object of properties + // 2. A key and value + // + this.set( owner, key, value ); + + // Since the "set" path can have two possible entry points + // return the expected data based on which path was taken[*] + return value !== undefined ? value : key; + }, + remove: function( owner, key ) { + var i, + cache = owner[ this.expando ]; + + if ( cache === undefined ) { + return; + } + + if ( key !== undefined ) { + + // Support array or space separated string of keys + if ( Array.isArray( key ) ) { + + // If key is an array of keys... + // We always set camelCase keys, so remove that. + key = key.map( camelCase ); + } else { + key = camelCase( key ); + + // If a key with the spaces exists, use it. + // Otherwise, create an array by matching non-whitespace + key = key in cache ? + [ key ] : + ( key.match( rnothtmlwhite ) || [] ); + } + + i = key.length; + + while ( i-- ) { + delete cache[ key[ i ] ]; + } + } + + // Remove the expando if there's no more data + if ( key === undefined || jQuery.isEmptyObject( cache ) ) { + + // Support: Chrome <=35 - 45 + // Webkit & Blink performance suffers when deleting properties + // from DOM nodes, so set to undefined instead + // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) + if ( owner.nodeType ) { + owner[ this.expando ] = undefined; + } else { + delete owner[ this.expando ]; + } + } + }, + hasData: function( owner ) { + var cache = owner[ this.expando ]; + return cache !== undefined && !jQuery.isEmptyObject( cache ); + } +}; +var dataPriv = new Data(); + +var dataUser = new Data(); + + + +// Implementation Summary +// +// 1. Enforce API surface and semantic compatibility with 1.9.x branch +// 2. Improve the module's maintainability by reducing the storage +// paths to a single mechanism. +// 3. Use the same single mechanism to support "private" and "user" data. +// 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) +// 5. Avoid exposing implementation details on user objects (eg. expando properties) +// 6. Provide a clear path for implementation upgrade to WeakMap in 2014 + +var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, + rmultiDash = /[A-Z]/g; + +function getData( data ) { + if ( data === "true" ) { + return true; + } + + if ( data === "false" ) { + return false; + } + + if ( data === "null" ) { + return null; + } + + // Only convert to a number if it doesn't change the string + if ( data === +data + "" ) { + return +data; + } + + if ( rbrace.test( data ) ) { + return JSON.parse( data ); + } + + return data; +} + +function dataAttr( elem, key, data ) { + var name; + + // If nothing was found internally, try to fetch any + // data from the HTML5 data-* attribute + if ( data === undefined && elem.nodeType === 1 ) { + name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); + data = elem.getAttribute( name ); + + if ( typeof data === "string" ) { + try { + data = getData( data ); + } catch ( e ) {} + + // Make sure we set the data so it isn't changed later + dataUser.set( elem, key, data ); + } else { + data = undefined; + } + } + return data; +} + +jQuery.extend( { + hasData: function( elem ) { + return dataUser.hasData( elem ) || dataPriv.hasData( elem ); + }, + + data: function( elem, name, data ) { + return dataUser.access( elem, name, data ); + }, + + removeData: function( elem, name ) { + dataUser.remove( elem, name ); + }, + + // TODO: Now that all calls to _data and _removeData have been replaced + // with direct calls to dataPriv methods, these can be deprecated. + _data: function( elem, name, data ) { + return dataPriv.access( elem, name, data ); + }, + + _removeData: function( elem, name ) { + dataPriv.remove( elem, name ); + } +} ); + +jQuery.fn.extend( { + data: function( key, value ) { + var i, name, data, + elem = this[ 0 ], + attrs = elem && elem.attributes; + + // Gets all values + if ( key === undefined ) { + if ( this.length ) { + data = dataUser.get( elem ); + + if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { + i = attrs.length; + while ( i-- ) { + + // Support: IE 11 only + // The attrs elements can be null (#14894) + if ( attrs[ i ] ) { + name = attrs[ i ].name; + if ( name.indexOf( "data-" ) === 0 ) { + name = camelCase( name.slice( 5 ) ); + dataAttr( elem, name, data[ name ] ); + } + } + } + dataPriv.set( elem, "hasDataAttrs", true ); + } + } + + return data; + } + + // Sets multiple values + if ( typeof key === "object" ) { + return this.each( function() { + dataUser.set( this, key ); + } ); + } + + return access( this, function( value ) { + var data; + + // The calling jQuery object (element matches) is not empty + // (and therefore has an element appears at this[ 0 ]) and the + // `value` parameter was not undefined. An empty jQuery object + // will result in `undefined` for elem = this[ 0 ] which will + // throw an exception if an attempt to read a data cache is made. + if ( elem && value === undefined ) { + + // Attempt to get data from the cache + // The key will always be camelCased in Data + data = dataUser.get( elem, key ); + if ( data !== undefined ) { + return data; + } + + // Attempt to "discover" the data in + // HTML5 custom data-* attrs + data = dataAttr( elem, key ); + if ( data !== undefined ) { + return data; + } + + // We tried really hard, but the data doesn't exist. + return; + } + + // Set the data... + this.each( function() { + + // We always store the camelCased key + dataUser.set( this, key, value ); + } ); + }, null, value, arguments.length > 1, null, true ); + }, + + removeData: function( key ) { + return this.each( function() { + dataUser.remove( this, key ); + } ); + } +} ); + + +jQuery.extend( { + queue: function( elem, type, data ) { + var queue; + + if ( elem ) { + type = ( type || "fx" ) + "queue"; + queue = dataPriv.get( elem, type ); + + // Speed up dequeue by getting out quickly if this is just a lookup + if ( data ) { + if ( !queue || Array.isArray( data ) ) { + queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); + } else { + queue.push( data ); + } + } + return queue || []; + } + }, + + dequeue: function( elem, type ) { + type = type || "fx"; + + var queue = jQuery.queue( elem, type ), + startLength = queue.length, + fn = queue.shift(), + hooks = jQuery._queueHooks( elem, type ), + next = function() { + jQuery.dequeue( elem, type ); + }; + + // If the fx queue is dequeued, always remove the progress sentinel + if ( fn === "inprogress" ) { + fn = queue.shift(); + startLength--; + } + + if ( fn ) { + + // Add a progress sentinel to prevent the fx queue from being + // automatically dequeued + if ( type === "fx" ) { + queue.unshift( "inprogress" ); + } + + // Clear up the last queue stop function + delete hooks.stop; + fn.call( elem, next, hooks ); + } + + if ( !startLength && hooks ) { + hooks.empty.fire(); + } + }, + + // Not public - generate a queueHooks object, or return the current one + _queueHooks: function( elem, type ) { + var key = type + "queueHooks"; + return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { + empty: jQuery.Callbacks( "once memory" ).add( function() { + dataPriv.remove( elem, [ type + "queue", key ] ); + } ) + } ); + } +} ); + +jQuery.fn.extend( { + queue: function( type, data ) { + var setter = 2; + + if ( typeof type !== "string" ) { + data = type; + type = "fx"; + setter--; + } + + if ( arguments.length < setter ) { + return jQuery.queue( this[ 0 ], type ); + } + + return data === undefined ? + this : + this.each( function() { + var queue = jQuery.queue( this, type, data ); + + // Ensure a hooks for this queue + jQuery._queueHooks( this, type ); + + if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { + jQuery.dequeue( this, type ); + } + } ); + }, + dequeue: function( type ) { + return this.each( function() { + jQuery.dequeue( this, type ); + } ); + }, + clearQueue: function( type ) { + return this.queue( type || "fx", [] ); + }, + + // Get a promise resolved when queues of a certain type + // are emptied (fx is the type by default) + promise: function( type, obj ) { + var tmp, + count = 1, + defer = jQuery.Deferred(), + elements = this, + i = this.length, + resolve = function() { + if ( !( --count ) ) { + defer.resolveWith( elements, [ elements ] ); + } + }; + + if ( typeof type !== "string" ) { + obj = type; + type = undefined; + } + type = type || "fx"; + + while ( i-- ) { + tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); + if ( tmp && tmp.empty ) { + count++; + tmp.empty.add( resolve ); + } + } + resolve(); + return defer.promise( obj ); + } +} ); +var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; + +var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); + + +var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; + +var documentElement = document.documentElement; + + + + var isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ); + }, + composed = { composed: true }; + + // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only + // Check attachment across shadow DOM boundaries when possible (gh-3504) + // Support: iOS 10.0-10.2 only + // Early iOS 10 versions support `attachShadow` but not `getRootNode`, + // leading to errors. We need to check for `getRootNode`. + if ( documentElement.getRootNode ) { + isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ) || + elem.getRootNode( composed ) === elem.ownerDocument; + }; + } +var isHiddenWithinTree = function( elem, el ) { + + // isHiddenWithinTree might be called from jQuery#filter function; + // in that case, element will be second argument + elem = el || elem; + + // Inline style trumps all + return elem.style.display === "none" || + elem.style.display === "" && + + // Otherwise, check computed style + // Support: Firefox <=43 - 45 + // Disconnected elements can have computed display: none, so first confirm that elem is + // in the document. + isAttached( elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + + + +function adjustCSS( elem, prop, valueParts, tween ) { + var adjusted, scale, + maxIterations = 20, + currentValue = tween ? + function() { + return tween.cur(); + } : + function() { + return jQuery.css( elem, prop, "" ); + }, + initial = currentValue(), + unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), + + // Starting value computation is required for potential unit mismatches + initialInUnit = elem.nodeType && + ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && + rcssNum.exec( jQuery.css( elem, prop ) ); + + if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { + + // Support: Firefox <=54 + // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) + initial = initial / 2; + + // Trust units reported by jQuery.css + unit = unit || initialInUnit[ 3 ]; + + // Iteratively approximate from a nonzero starting point + initialInUnit = +initial || 1; + + while ( maxIterations-- ) { + + // Evaluate and update our best guess (doubling guesses that zero out). + // Finish if the scale equals or crosses 1 (making the old*new product non-positive). + jQuery.style( elem, prop, initialInUnit + unit ); + if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { + maxIterations = 0; + } + initialInUnit = initialInUnit / scale; + + } + + initialInUnit = initialInUnit * 2; + jQuery.style( elem, prop, initialInUnit + unit ); + + // Make sure we update the tween properties later on + valueParts = valueParts || []; + } + + if ( valueParts ) { + initialInUnit = +initialInUnit || +initial || 0; + + // Apply relative offset (+=/-=) if specified + adjusted = valueParts[ 1 ] ? + initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : + +valueParts[ 2 ]; + if ( tween ) { + tween.unit = unit; + tween.start = initialInUnit; + tween.end = adjusted; + } + } + return adjusted; +} + + +var defaultDisplayMap = {}; + +function getDefaultDisplay( elem ) { + var temp, + doc = elem.ownerDocument, + nodeName = elem.nodeName, + display = defaultDisplayMap[ nodeName ]; + + if ( display ) { + return display; + } + + temp = doc.body.appendChild( doc.createElement( nodeName ) ); + display = jQuery.css( temp, "display" ); + + temp.parentNode.removeChild( temp ); + + if ( display === "none" ) { + display = "block"; + } + defaultDisplayMap[ nodeName ] = display; + + return display; +} + +function showHide( elements, show ) { + var display, elem, + values = [], + index = 0, + length = elements.length; + + // Determine new display value for elements that need to change + for ( ; index < length; index++ ) { + elem = elements[ index ]; + if ( !elem.style ) { + continue; + } + + display = elem.style.display; + if ( show ) { + + // Since we force visibility upon cascade-hidden elements, an immediate (and slow) + // check is required in this first loop unless we have a nonempty display value (either + // inline or about-to-be-restored) + if ( display === "none" ) { + values[ index ] = dataPriv.get( elem, "display" ) || null; + if ( !values[ index ] ) { + elem.style.display = ""; + } + } + if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { + values[ index ] = getDefaultDisplay( elem ); + } + } else { + if ( display !== "none" ) { + values[ index ] = "none"; + + // Remember what we're overwriting + dataPriv.set( elem, "display", display ); + } + } + } + + // Set the display of the elements in a second loop to avoid constant reflow + for ( index = 0; index < length; index++ ) { + if ( values[ index ] != null ) { + elements[ index ].style.display = values[ index ]; + } + } + + return elements; +} + +jQuery.fn.extend( { + show: function() { + return showHide( this, true ); + }, + hide: function() { + return showHide( this ); + }, + toggle: function( state ) { + if ( typeof state === "boolean" ) { + return state ? this.show() : this.hide(); + } + + return this.each( function() { + if ( isHiddenWithinTree( this ) ) { + jQuery( this ).show(); + } else { + jQuery( this ).hide(); + } + } ); + } +} ); +var rcheckableType = ( /^(?:checkbox|radio)$/i ); + +var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); + +var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); + + + +( function() { + var fragment = document.createDocumentFragment(), + div = fragment.appendChild( document.createElement( "div" ) ), + input = document.createElement( "input" ); + + // Support: Android 4.0 - 4.3 only + // Check state lost if the name is set (#11217) + // Support: Windows Web Apps (WWA) + // `name` and `type` must use .setAttribute for WWA (#14901) + input.setAttribute( "type", "radio" ); + input.setAttribute( "checked", "checked" ); + input.setAttribute( "name", "t" ); + + div.appendChild( input ); + + // Support: Android <=4.1 only + // Older WebKit doesn't clone checked state correctly in fragments + support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; + + // Support: IE <=11 only + // Make sure textarea (and checkbox) defaultValue is properly cloned + div.innerHTML = ""; + support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; + + // Support: IE <=9 only + // IE <=9 replaces "; + support.option = !!div.lastChild; +} )(); + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // XHTML parsers do not magically insert elements in the + // same way that tag soup parsers do. So we cannot shorten + // this by omitting or other required elements. + thead: [ 1, "", "
" ], + col: [ 2, "", "
" ], + tr: [ 2, "", "
" ], + td: [ 3, "", "
" ], + + _default: [ 0, "", "" ] +}; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + +// Support: IE <=9 only +if ( !support.option ) { + wrapMap.optgroup = wrapMap.option = [ 1, "" ]; +} + + +function getAll( context, tag ) { + + // Support: IE <=9 - 11 only + // Use typeof to avoid zero-argument method invocation on host objects (#15151) + var ret; + + if ( typeof context.getElementsByTagName !== "undefined" ) { + ret = context.getElementsByTagName( tag || "*" ); + + } else if ( typeof context.querySelectorAll !== "undefined" ) { + ret = context.querySelectorAll( tag || "*" ); + + } else { + ret = []; + } + + if ( tag === undefined || tag && nodeName( context, tag ) ) { + return jQuery.merge( [ context ], ret ); + } + + return ret; +} + + +// Mark scripts as having already been evaluated +function setGlobalEval( elems, refElements ) { + var i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + dataPriv.set( + elems[ i ], + "globalEval", + !refElements || dataPriv.get( refElements[ i ], "globalEval" ) + ); + } +} + + +var rhtml = /<|&#?\w+;/; + +function buildFragment( elems, context, scripts, selection, ignored ) { + var elem, tmp, tag, wrap, attached, j, + fragment = context.createDocumentFragment(), + nodes = [], + i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + elem = elems[ i ]; + + if ( elem || elem === 0 ) { + + // Add nodes directly + if ( toType( elem ) === "object" ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); + + // Convert non-html into a text node + } else if ( !rhtml.test( elem ) ) { + nodes.push( context.createTextNode( elem ) ); + + // Convert html into DOM nodes + } else { + tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); + + // Deserialize a standard representation + tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); + wrap = wrapMap[ tag ] || wrapMap._default; + tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; + + // Descend through wrappers to the right content + j = wrap[ 0 ]; + while ( j-- ) { + tmp = tmp.lastChild; + } + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, tmp.childNodes ); + + // Remember the top-level container + tmp = fragment.firstChild; + + // Ensure the created nodes are orphaned (#12392) + tmp.textContent = ""; + } + } + } + + // Remove wrapper from fragment + fragment.textContent = ""; + + i = 0; + while ( ( elem = nodes[ i++ ] ) ) { + + // Skip elements already in the context collection (trac-4087) + if ( selection && jQuery.inArray( elem, selection ) > -1 ) { + if ( ignored ) { + ignored.push( elem ); + } + continue; + } + + attached = isAttached( elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( attached ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +var + rkeyEvent = /^key/, + rmouseEvent = /^(?:mouse|pointer|contextmenu|drag|drop)|click/, + rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 - 11+ +// focus() and blur() are asynchronous, except when they are no-op. +// So expect focus to be synchronous when the element is already active, +// and blur to be synchronous when the element is not already active. +// (focus and blur are always synchronous in other supported browsers, +// this just defines when we can count on it). +function expectSync( elem, type ) { + return ( elem === safeActiveElement() ) === ( type === "focus" ); +} + +// Support: IE <=9 only +// Accessing document.activeElement can throw unexpectedly +// https://bugs.jquery.com/ticket/13393 +function safeActiveElement() { + try { + return document.activeElement; + } catch ( err ) { } +} + +function on( elem, types, selector, data, fn, one ) { + var origFn, type; + + // Types can be a map of types/handlers + if ( typeof types === "object" ) { + + // ( types-Object, selector, data ) + if ( typeof selector !== "string" ) { + + // ( types-Object, data ) + data = data || selector; + selector = undefined; + } + for ( type in types ) { + on( elem, type, selector, data, types[ type ], one ); + } + return elem; + } + + if ( data == null && fn == null ) { + + // ( types, fn ) + fn = selector; + data = selector = undefined; + } else if ( fn == null ) { + if ( typeof selector === "string" ) { + + // ( types, selector, fn ) + fn = data; + data = undefined; + } else { + + // ( types, data, fn ) + fn = data; + data = selector; + selector = undefined; + } + } + if ( fn === false ) { + fn = returnFalse; + } else if ( !fn ) { + return elem; + } + + if ( one === 1 ) { + origFn = fn; + fn = function( event ) { + + // Can use an empty set, since event contains the info + jQuery().off( event ); + return origFn.apply( this, arguments ); + }; + + // Use same guid so caller can remove using origFn + fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); + } + return elem.each( function() { + jQuery.event.add( this, types, fn, data, selector ); + } ); +} + +/* + * Helper functions for managing events -- not part of the public interface. + * Props to Dean Edwards' addEvent library for many of the ideas. + */ +jQuery.event = { + + global: {}, + + add: function( elem, types, handler, data, selector ) { + + var handleObjIn, eventHandle, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.get( elem ); + + // Only attach events to objects that accept data + if ( !acceptData( elem ) ) { + return; + } + + // Caller can pass in an object of custom data in lieu of the handler + if ( handler.handler ) { + handleObjIn = handler; + handler = handleObjIn.handler; + selector = handleObjIn.selector; + } + + // Ensure that invalid selectors throw exceptions at attach time + // Evaluate against documentElement in case elem is a non-element node (e.g., document) + if ( selector ) { + jQuery.find.matchesSelector( documentElement, selector ); + } + + // Make sure that the handler has a unique ID, used to find/remove it later + if ( !handler.guid ) { + handler.guid = jQuery.guid++; + } + + // Init the element's event structure and main handler, if this is the first + if ( !( events = elemData.events ) ) { + events = elemData.events = Object.create( null ); + } + if ( !( eventHandle = elemData.handle ) ) { + eventHandle = elemData.handle = function( e ) { + + // Discard the second event of a jQuery.event.trigger() and + // when an event is called after a page has unloaded + return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? + jQuery.event.dispatch.apply( elem, arguments ) : undefined; + }; + } + + // Handle multiple events separated by a space + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // There *must* be a type, no attaching namespace-only handlers + if ( !type ) { + continue; + } + + // If event changes its type, use the special event handlers for the changed type + special = jQuery.event.special[ type ] || {}; + + // If selector defined, determine special event api type, otherwise given type + type = ( selector ? special.delegateType : special.bindType ) || type; + + // Update special based on newly reset type + special = jQuery.event.special[ type ] || {}; + + // handleObj is passed to all event handlers + handleObj = jQuery.extend( { + type: type, + origType: origType, + data: data, + handler: handler, + guid: handler.guid, + selector: selector, + needsContext: selector && jQuery.expr.match.needsContext.test( selector ), + namespace: namespaces.join( "." ) + }, handleObjIn ); + + // Init the event handler queue if we're the first + if ( !( handlers = events[ type ] ) ) { + handlers = events[ type ] = []; + handlers.delegateCount = 0; + + // Only use addEventListener if the special events handler returns false + if ( !special.setup || + special.setup.call( elem, data, namespaces, eventHandle ) === false ) { + + if ( elem.addEventListener ) { + elem.addEventListener( type, eventHandle ); + } + } + } + + if ( special.add ) { + special.add.call( elem, handleObj ); + + if ( !handleObj.handler.guid ) { + handleObj.handler.guid = handler.guid; + } + } + + // Add to the element's handler list, delegates in front + if ( selector ) { + handlers.splice( handlers.delegateCount++, 0, handleObj ); + } else { + handlers.push( handleObj ); + } + + // Keep track of which events have ever been used, for event optimization + jQuery.event.global[ type ] = true; + } + + }, + + // Detach an event or set of events from an element + remove: function( elem, types, handler, selector, mappedTypes ) { + + var j, origCount, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); + + if ( !elemData || !( events = elemData.events ) ) { + return; + } + + // Once for each type.namespace in types; type may be omitted + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // Unbind all events (on this namespace, if provided) for the element + if ( !type ) { + for ( type in events ) { + jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); + } + continue; + } + + special = jQuery.event.special[ type ] || {}; + type = ( selector ? special.delegateType : special.bindType ) || type; + handlers = events[ type ] || []; + tmp = tmp[ 2 ] && + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); + + // Remove matching events + origCount = j = handlers.length; + while ( j-- ) { + handleObj = handlers[ j ]; + + if ( ( mappedTypes || origType === handleObj.origType ) && + ( !handler || handler.guid === handleObj.guid ) && + ( !tmp || tmp.test( handleObj.namespace ) ) && + ( !selector || selector === handleObj.selector || + selector === "**" && handleObj.selector ) ) { + handlers.splice( j, 1 ); + + if ( handleObj.selector ) { + handlers.delegateCount--; + } + if ( special.remove ) { + special.remove.call( elem, handleObj ); + } + } + } + + // Remove generic event handler if we removed something and no more handlers exist + // (avoids potential for endless recursion during removal of special event handlers) + if ( origCount && !handlers.length ) { + if ( !special.teardown || + special.teardown.call( elem, namespaces, elemData.handle ) === false ) { + + jQuery.removeEvent( elem, type, elemData.handle ); + } + + delete events[ type ]; + } + } + + // Remove data and the expando if it's no longer used + if ( jQuery.isEmptyObject( events ) ) { + dataPriv.remove( elem, "handle events" ); + } + }, + + dispatch: function( nativeEvent ) { + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + + // Make a writable jQuery.Event from the native event object + event = jQuery.event.fix( nativeEvent ), + + handlers = ( + dataPriv.get( this, "events" ) || Object.create( null ) + )[ event.type ] || [], + special = jQuery.event.special[ event.type ] || {}; + + // Use the fix-ed jQuery.Event rather than the (read-only) native event + args[ 0 ] = event; + + for ( i = 1; i < arguments.length; i++ ) { + args[ i ] = arguments[ i ]; + } + + event.delegateTarget = this; + + // Call the preDispatch hook for the mapped type, and let it bail if desired + if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { + return; + } + + // Determine handlers + handlerQueue = jQuery.event.handlers.call( this, event, handlers ); + + // Run delegates first; they may want to stop propagation beneath us + i = 0; + while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { + event.currentTarget = matched.elem; + + j = 0; + while ( ( handleObj = matched.handlers[ j++ ] ) && + !event.isImmediatePropagationStopped() ) { + + // If the event is namespaced, then each handler is only invoked if it is + // specially universal or its namespaces are a superset of the event's. + if ( !event.rnamespace || handleObj.namespace === false || + event.rnamespace.test( handleObj.namespace ) ) { + + event.handleObj = handleObj; + event.data = handleObj.data; + + ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || + handleObj.handler ).apply( matched.elem, args ); + + if ( ret !== undefined ) { + if ( ( event.result = ret ) === false ) { + event.preventDefault(); + event.stopPropagation(); + } + } + } + } + } + + // Call the postDispatch hook for the mapped type + if ( special.postDispatch ) { + special.postDispatch.call( this, event ); + } + + return event.result; + }, + + handlers: function( event, handlers ) { + var i, handleObj, sel, matchedHandlers, matchedSelectors, + handlerQueue = [], + delegateCount = handlers.delegateCount, + cur = event.target; + + // Find delegate handlers + if ( delegateCount && + + // Support: IE <=9 + // Black-hole SVG instance trees (trac-13180) + cur.nodeType && + + // Support: Firefox <=42 + // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) + // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click + // Support: IE 11 only + // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) + !( event.type === "click" && event.button >= 1 ) ) { + + for ( ; cur !== this; cur = cur.parentNode || this ) { + + // Don't check non-elements (#13208) + // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) + if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { + matchedHandlers = []; + matchedSelectors = {}; + for ( i = 0; i < delegateCount; i++ ) { + handleObj = handlers[ i ]; + + // Don't conflict with Object.prototype properties (#13203) + sel = handleObj.selector + " "; + + if ( matchedSelectors[ sel ] === undefined ) { + matchedSelectors[ sel ] = handleObj.needsContext ? + jQuery( sel, this ).index( cur ) > -1 : + jQuery.find( sel, this, null, [ cur ] ).length; + } + if ( matchedSelectors[ sel ] ) { + matchedHandlers.push( handleObj ); + } + } + if ( matchedHandlers.length ) { + handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); + } + } + } + } + + // Add the remaining (directly-bound) handlers + cur = this; + if ( delegateCount < handlers.length ) { + handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); + } + + return handlerQueue; + }, + + addProp: function( name, hook ) { + Object.defineProperty( jQuery.Event.prototype, name, { + enumerable: true, + configurable: true, + + get: isFunction( hook ) ? + function() { + if ( this.originalEvent ) { + return hook( this.originalEvent ); + } + } : + function() { + if ( this.originalEvent ) { + return this.originalEvent[ name ]; + } + }, + + set: function( value ) { + Object.defineProperty( this, name, { + enumerable: true, + configurable: true, + writable: true, + value: value + } ); + } + } ); + }, + + fix: function( originalEvent ) { + return originalEvent[ jQuery.expando ] ? + originalEvent : + new jQuery.Event( originalEvent ); + }, + + special: { + load: { + + // Prevent triggered image.load events from bubbling to window.load + noBubble: true + }, + click: { + + // Utilize native event to ensure correct state for checkable inputs + setup: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Claim the first handler + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + // dataPriv.set( el, "click", ... ) + leverageNative( el, "click", returnTrue ); + } + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Force setup before triggering a click + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + leverageNative( el, "click" ); + } + + // Return non-false to allow normal event-path propagation + return true; + }, + + // For cross-browser consistency, suppress native .click() on links + // Also prevent it if we're currently inside a leveraged native-event stack + _default: function( event ) { + var target = event.target; + return rcheckableType.test( target.type ) && + target.click && nodeName( target, "input" ) && + dataPriv.get( target, "click" ) || + nodeName( target, "a" ); + } + }, + + beforeunload: { + postDispatch: function( event ) { + + // Support: Firefox 20+ + // Firefox doesn't alert if the returnValue field is not set. + if ( event.result !== undefined && event.originalEvent ) { + event.originalEvent.returnValue = event.result; + } + } + } + } +}; + +// Ensure the presence of an event listener that handles manually-triggered +// synthetic events by interrupting progress until reinvoked in response to +// *native* events that it fires directly, ensuring that state changes have +// already occurred before other listeners are invoked. +function leverageNative( el, type, expectSync ) { + + // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add + if ( !expectSync ) { + if ( dataPriv.get( el, type ) === undefined ) { + jQuery.event.add( el, type, returnTrue ); + } + return; + } + + // Register the controller as a special universal handler for all event namespaces + dataPriv.set( el, type, false ); + jQuery.event.add( el, type, { + namespace: false, + handler: function( event ) { + var notAsync, result, + saved = dataPriv.get( this, type ); + + if ( ( event.isTrigger & 1 ) && this[ type ] ) { + + // Interrupt processing of the outer synthetic .trigger()ed event + // Saved data should be false in such cases, but might be a leftover capture object + // from an async native handler (gh-4350) + if ( !saved.length ) { + + // Store arguments for use when handling the inner native event + // There will always be at least one argument (an event object), so this array + // will not be confused with a leftover capture object. + saved = slice.call( arguments ); + dataPriv.set( this, type, saved ); + + // Trigger the native event and capture its result + // Support: IE <=9 - 11+ + // focus() and blur() are asynchronous + notAsync = expectSync( this, type ); + this[ type ](); + result = dataPriv.get( this, type ); + if ( saved !== result || notAsync ) { + dataPriv.set( this, type, false ); + } else { + result = {}; + } + if ( saved !== result ) { + + // Cancel the outer synthetic event + event.stopImmediatePropagation(); + event.preventDefault(); + return result.value; + } + + // If this is an inner synthetic event for an event with a bubbling surrogate + // (focus or blur), assume that the surrogate already propagated from triggering the + // native event and prevent that from happening again here. + // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the + // bubbling surrogate propagates *after* the non-bubbling base), but that seems + // less bad than duplication. + } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { + event.stopPropagation(); + } + + // If this is a native event triggered above, everything is now in order + // Fire an inner synthetic event with the original arguments + } else if ( saved.length ) { + + // ...and capture the result + dataPriv.set( this, type, { + value: jQuery.event.trigger( + + // Support: IE <=9 - 11+ + // Extend with the prototype to reset the above stopImmediatePropagation() + jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), + saved.slice( 1 ), + this + ) + } ); + + // Abort handling of the native event + event.stopImmediatePropagation(); + } + } + } ); +} + +jQuery.removeEvent = function( elem, type, handle ) { + + // This "if" is needed for plain objects + if ( elem.removeEventListener ) { + elem.removeEventListener( type, handle ); + } +}; + +jQuery.Event = function( src, props ) { + + // Allow instantiation without the 'new' keyword + if ( !( this instanceof jQuery.Event ) ) { + return new jQuery.Event( src, props ); + } + + // Event object + if ( src && src.type ) { + this.originalEvent = src; + this.type = src.type; + + // Events bubbling up the document may have been marked as prevented + // by a handler lower down the tree; reflect the correct value. + this.isDefaultPrevented = src.defaultPrevented || + src.defaultPrevented === undefined && + + // Support: Android <=2.3 only + src.returnValue === false ? + returnTrue : + returnFalse; + + // Create target properties + // Support: Safari <=6 - 7 only + // Target should not be a text node (#504, #13143) + this.target = ( src.target && src.target.nodeType === 3 ) ? + src.target.parentNode : + src.target; + + this.currentTarget = src.currentTarget; + this.relatedTarget = src.relatedTarget; + + // Event type + } else { + this.type = src; + } + + // Put explicitly provided properties onto the event object + if ( props ) { + jQuery.extend( this, props ); + } + + // Create a timestamp if incoming event doesn't have one + this.timeStamp = src && src.timeStamp || Date.now(); + + // Mark it as fixed + this[ jQuery.expando ] = true; +}; + +// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding +// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html +jQuery.Event.prototype = { + constructor: jQuery.Event, + isDefaultPrevented: returnFalse, + isPropagationStopped: returnFalse, + isImmediatePropagationStopped: returnFalse, + isSimulated: false, + + preventDefault: function() { + var e = this.originalEvent; + + this.isDefaultPrevented = returnTrue; + + if ( e && !this.isSimulated ) { + e.preventDefault(); + } + }, + stopPropagation: function() { + var e = this.originalEvent; + + this.isPropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopPropagation(); + } + }, + stopImmediatePropagation: function() { + var e = this.originalEvent; + + this.isImmediatePropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopImmediatePropagation(); + } + + this.stopPropagation(); + } +}; + +// Includes all common event props including KeyEvent and MouseEvent specific props +jQuery.each( { + altKey: true, + bubbles: true, + cancelable: true, + changedTouches: true, + ctrlKey: true, + detail: true, + eventPhase: true, + metaKey: true, + pageX: true, + pageY: true, + shiftKey: true, + view: true, + "char": true, + code: true, + charCode: true, + key: true, + keyCode: true, + button: true, + buttons: true, + clientX: true, + clientY: true, + offsetX: true, + offsetY: true, + pointerId: true, + pointerType: true, + screenX: true, + screenY: true, + targetTouches: true, + toElement: true, + touches: true, + + which: function( event ) { + var button = event.button; + + // Add which for key events + if ( event.which == null && rkeyEvent.test( event.type ) ) { + return event.charCode != null ? event.charCode : event.keyCode; + } + + // Add which for click: 1 === left; 2 === middle; 3 === right + if ( !event.which && button !== undefined && rmouseEvent.test( event.type ) ) { + if ( button & 1 ) { + return 1; + } + + if ( button & 2 ) { + return 3; + } + + if ( button & 4 ) { + return 2; + } + + return 0; + } + + return event.which; + } +}, jQuery.event.addProp ); + +jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { + jQuery.event.special[ type ] = { + + // Utilize native event if possible so blur/focus sequence is correct + setup: function() { + + // Claim the first handler + // dataPriv.set( this, "focus", ... ) + // dataPriv.set( this, "blur", ... ) + leverageNative( this, type, expectSync ); + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function() { + + // Force setup before trigger + leverageNative( this, type ); + + // Return non-false to allow normal event-path propagation + return true; + }, + + delegateType: delegateType + }; +} ); + +// Create mouseenter/leave events using mouseover/out and event-time checks +// so that event delegation works in jQuery. +// Do the same for pointerenter/pointerleave and pointerover/pointerout +// +// Support: Safari 7 only +// Safari sends mouseenter too often; see: +// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 +// for the description of the bug (it existed in older Chrome versions as well). +jQuery.each( { + mouseenter: "mouseover", + mouseleave: "mouseout", + pointerenter: "pointerover", + pointerleave: "pointerout" +}, function( orig, fix ) { + jQuery.event.special[ orig ] = { + delegateType: fix, + bindType: fix, + + handle: function( event ) { + var ret, + target = this, + related = event.relatedTarget, + handleObj = event.handleObj; + + // For mouseenter/leave call the handler if related is outside the target. + // NB: No relatedTarget if the mouse left/entered the browser window + if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { + event.type = handleObj.origType; + ret = handleObj.handler.apply( this, arguments ); + event.type = fix; + } + return ret; + } + }; +} ); + +jQuery.fn.extend( { + + on: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn ); + }, + one: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn, 1 ); + }, + off: function( types, selector, fn ) { + var handleObj, type; + if ( types && types.preventDefault && types.handleObj ) { + + // ( event ) dispatched jQuery.Event + handleObj = types.handleObj; + jQuery( types.delegateTarget ).off( + handleObj.namespace ? + handleObj.origType + "." + handleObj.namespace : + handleObj.origType, + handleObj.selector, + handleObj.handler + ); + return this; + } + if ( typeof types === "object" ) { + + // ( types-object [, selector] ) + for ( type in types ) { + this.off( type, selector, types[ type ] ); + } + return this; + } + if ( selector === false || typeof selector === "function" ) { + + // ( types [, fn] ) + fn = selector; + selector = undefined; + } + if ( fn === false ) { + fn = returnFalse; + } + return this.each( function() { + jQuery.event.remove( this, types, fn, selector ); + } ); + } +} ); + + +var + + // Support: IE <=10 - 11, Edge 12 - 13 only + // In IE/Edge using regex groups here causes severe slowdowns. + // See https://connect.microsoft.com/IE/feedback/details/1736512/ + rnoInnerhtml = /\s*$/g; + +// Prefer a tbody over its parent table for containing new rows +function manipulationTarget( elem, content ) { + if ( nodeName( elem, "table" ) && + nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { + + return jQuery( elem ).children( "tbody" )[ 0 ] || elem; + } + + return elem; +} + +// Replace/restore the type attribute of script elements for safe DOM manipulation +function disableScript( elem ) { + elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; + return elem; +} +function restoreScript( elem ) { + if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { + elem.type = elem.type.slice( 5 ); + } else { + elem.removeAttribute( "type" ); + } + + return elem; +} + +function cloneCopyEvent( src, dest ) { + var i, l, type, pdataOld, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.get( src ); + events = pdataOld.events; + + if ( events ) { + dataPriv.remove( dest, "handle events" ); + + for ( type in events ) { + for ( i = 0, l = events[ type ].length; i < l; i++ ) { + jQuery.event.add( dest, type, events[ type ][ i ] ); + } + } + } + } + + // 2. Copy user data + if ( dataUser.hasData( src ) ) { + udataOld = dataUser.access( src ); + udataCur = jQuery.extend( {}, udataOld ); + + dataUser.set( dest, udataCur ); + } +} + +// Fix IE bugs, see support tests +function fixInput( src, dest ) { + var nodeName = dest.nodeName.toLowerCase(); + + // Fails to persist the checked state of a cloned checkbox or radio button. + if ( nodeName === "input" && rcheckableType.test( src.type ) ) { + dest.checked = src.checked; + + // Fails to return the selected option to the default selected state when cloning options + } else if ( nodeName === "input" || nodeName === "textarea" ) { + dest.defaultValue = src.defaultValue; + } +} + +function domManip( collection, args, callback, ignored ) { + + // Flatten any nested arrays + args = flat( args ); + + var fragment, first, scripts, hasScripts, node, doc, + i = 0, + l = collection.length, + iNoClone = l - 1, + value = args[ 0 ], + valueIsFunction = isFunction( value ); + + // We can't cloneNode fragments that contain checked, in WebKit + if ( valueIsFunction || + ( l > 1 && typeof value === "string" && + !support.checkClone && rchecked.test( value ) ) ) { + return collection.each( function( index ) { + var self = collection.eq( index ); + if ( valueIsFunction ) { + args[ 0 ] = value.call( this, index, self.html() ); + } + domManip( self, args, callback, ignored ); + } ); + } + + if ( l ) { + fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); + first = fragment.firstChild; + + if ( fragment.childNodes.length === 1 ) { + fragment = first; + } + + // Require either new content or an interest in ignored elements to invoke the callback + if ( first || ignored ) { + scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); + hasScripts = scripts.length; + + // Use the original fragment for the last item + // instead of the first because it can end up + // being emptied incorrectly in certain situations (#8070). + for ( ; i < l; i++ ) { + node = fragment; + + if ( i !== iNoClone ) { + node = jQuery.clone( node, true, true ); + + // Keep references to cloned scripts for later restoration + if ( hasScripts ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( scripts, getAll( node, "script" ) ); + } + } + + callback.call( collection[ i ], node, i ); + } + + if ( hasScripts ) { + doc = scripts[ scripts.length - 1 ].ownerDocument; + + // Reenable scripts + jQuery.map( scripts, restoreScript ); + + // Evaluate executable scripts on first document insertion + for ( i = 0; i < hasScripts; i++ ) { + node = scripts[ i ]; + if ( rscriptType.test( node.type || "" ) && + !dataPriv.access( node, "globalEval" ) && + jQuery.contains( doc, node ) ) { + + if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { + + // Optional AJAX dependency, but won't run scripts if not present + if ( jQuery._evalUrl && !node.noModule ) { + jQuery._evalUrl( node.src, { + nonce: node.nonce || node.getAttribute( "nonce" ) + }, doc ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); + } + } + } + } + } + } + + return collection; +} + +function remove( elem, selector, keepData ) { + var node, + nodes = selector ? jQuery.filter( selector, elem ) : elem, + i = 0; + + for ( ; ( node = nodes[ i ] ) != null; i++ ) { + if ( !keepData && node.nodeType === 1 ) { + jQuery.cleanData( getAll( node ) ); + } + + if ( node.parentNode ) { + if ( keepData && isAttached( node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html; + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = isAttached( elem ); + + // Fix IE cloning issues + if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && + !jQuery.isXMLDoc( elem ) ) { + + // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 + destElements = getAll( clone ); + srcElements = getAll( elem ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + fixInput( srcElements[ i ], destElements[ i ] ); + } + } + + // Copy the events from the original to the clone + if ( dataAndEvents ) { + if ( deepDataAndEvents ) { + srcElements = srcElements || getAll( elem ); + destElements = destElements || getAll( clone ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + cloneCopyEvent( srcElements[ i ], destElements[ i ] ); + } + } else { + cloneCopyEvent( elem, clone ); + } + } + + // Preserve script evaluation history + destElements = getAll( clone, "script" ); + if ( destElements.length > 0 ) { + setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); + } + + // Return the cloned set + return clone; + }, + + cleanData: function( elems ) { + var data, elem, type, + special = jQuery.event.special, + i = 0; + + for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { + if ( acceptData( elem ) ) { + if ( ( data = elem[ dataPriv.expando ] ) ) { + if ( data.events ) { + for ( type in data.events ) { + if ( special[ type ] ) { + jQuery.event.remove( elem, type ); + + // This is a shortcut to avoid jQuery.event.remove's overhead + } else { + jQuery.removeEvent( elem, type, data.handle ); + } + } + } + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataPriv.expando ] = undefined; + } + if ( elem[ dataUser.expando ] ) { + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataUser.expando ] = undefined; + } + } + } + } +} ); + +jQuery.fn.extend( { + detach: function( selector ) { + return remove( this, selector, true ); + }, + + remove: function( selector ) { + return remove( this, selector ); + }, + + text: function( value ) { + return access( this, function( value ) { + return value === undefined ? + jQuery.text( this ) : + this.empty().each( function() { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + this.textContent = value; + } + } ); + }, null, value, arguments.length ); + }, + + append: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.appendChild( elem ); + } + } ); + }, + + prepend: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.insertBefore( elem, target.firstChild ); + } + } ); + }, + + before: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this ); + } + } ); + }, + + after: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this.nextSibling ); + } + } ); + }, + + empty: function() { + var elem, + i = 0; + + for ( ; ( elem = this[ i ] ) != null; i++ ) { + if ( elem.nodeType === 1 ) { + + // Prevent memory leaks + jQuery.cleanData( getAll( elem, false ) ); + + // Remove any remaining nodes + elem.textContent = ""; + } + } + + return this; + }, + + clone: function( dataAndEvents, deepDataAndEvents ) { + dataAndEvents = dataAndEvents == null ? false : dataAndEvents; + deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; + + return this.map( function() { + return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); + } ); + }, + + html: function( value ) { + return access( this, function( value ) { + var elem = this[ 0 ] || {}, + i = 0, + l = this.length; + + if ( value === undefined && elem.nodeType === 1 ) { + return elem.innerHTML; + } + + // See if we can take a shortcut and just use innerHTML + if ( typeof value === "string" && !rnoInnerhtml.test( value ) && + !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { + + value = jQuery.htmlPrefilter( value ); + + try { + for ( ; i < l; i++ ) { + elem = this[ i ] || {}; + + // Remove element nodes and prevent memory leaks + if ( elem.nodeType === 1 ) { + jQuery.cleanData( getAll( elem, false ) ); + elem.innerHTML = value; + } + } + + elem = 0; + + // If using innerHTML throws an exception, use the fallback method + } catch ( e ) {} + } + + if ( elem ) { + this.empty().append( value ); + } + }, null, value, arguments.length ); + }, + + replaceWith: function() { + var ignored = []; + + // Make the changes, replacing each non-ignored context element with the new content + return domManip( this, arguments, function( elem ) { + var parent = this.parentNode; + + if ( jQuery.inArray( this, ignored ) < 0 ) { + jQuery.cleanData( getAll( this ) ); + if ( parent ) { + parent.replaceChild( elem, this ); + } + } + + // Force callback invocation + }, ignored ); + } +} ); + +jQuery.each( { + appendTo: "append", + prependTo: "prepend", + insertBefore: "before", + insertAfter: "after", + replaceAll: "replaceWith" +}, function( name, original ) { + jQuery.fn[ name ] = function( selector ) { + var elems, + ret = [], + insert = jQuery( selector ), + last = insert.length - 1, + i = 0; + + for ( ; i <= last; i++ ) { + elems = i === last ? this : this.clone( true ); + jQuery( insert[ i ] )[ original ]( elems ); + + // Support: Android <=4.0 only, PhantomJS 1 only + // .get() because push.apply(_, arraylike) throws on ancient WebKit + push.apply( ret, elems.get() ); + } + + return this.pushStack( ret ); + }; +} ); +var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); + +var getStyles = function( elem ) { + + // Support: IE <=11 only, Firefox <=30 (#15098, #14150) + // IE throws on elements created in popups + // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" + var view = elem.ownerDocument.defaultView; + + if ( !view || !view.opener ) { + view = window; + } + + return view.getComputedStyle( elem ); + }; + +var swap = function( elem, options, callback ) { + var ret, name, + old = {}; + + // Remember the old values, and insert the new ones + for ( name in options ) { + old[ name ] = elem.style[ name ]; + elem.style[ name ] = options[ name ]; + } + + ret = callback.call( elem ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + +var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); + + + +( function() { + + // Executing both pixelPosition & boxSizingReliable tests require only one layout + // so they're executed at the same time to save the second computation. + function computeStyleTests() { + + // This is a singleton, we need to execute it only once + if ( !div ) { + return; + } + + container.style.cssText = "position:absolute;left:-11111px;width:60px;" + + "margin-top:1px;padding:0;border:0"; + div.style.cssText = + "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + + "margin:auto;border:1px;padding:1px;" + + "width:60%;top:1%"; + documentElement.appendChild( container ).appendChild( div ); + + var divStyle = window.getComputedStyle( div ); + pixelPositionVal = divStyle.top !== "1%"; + + // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 + reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; + + // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 + // Some styles come back with percentage values, even though they shouldn't + div.style.right = "60%"; + pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; + + // Support: IE 9 - 11 only + // Detect misreporting of content dimensions for box-sizing:border-box elements + boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; + + // Support: IE 9 only + // Detect overflow:scroll screwiness (gh-3699) + // Support: Chrome <=64 + // Don't get tricked when zoom affects offsetWidth (gh-4029) + div.style.position = "absolute"; + scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; + + documentElement.removeChild( container ); + + // Nullify the div so it wouldn't be stored in the memory and + // it will also be a sign that checks already performed + div = null; + } + + function roundPixelMeasures( measure ) { + return Math.round( parseFloat( measure ) ); + } + + var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, + reliableTrDimensionsVal, reliableMarginLeftVal, + container = document.createElement( "div" ), + div = document.createElement( "div" ); + + // Finish early in limited (non-browser) environments + if ( !div.style ) { + return; + } + + // Support: IE <=9 - 11 only + // Style of cloned element affects source element cloned (#8908) + div.style.backgroundClip = "content-box"; + div.cloneNode( true ).style.backgroundClip = ""; + support.clearCloneStyle = div.style.backgroundClip === "content-box"; + + jQuery.extend( support, { + boxSizingReliable: function() { + computeStyleTests(); + return boxSizingReliableVal; + }, + pixelBoxStyles: function() { + computeStyleTests(); + return pixelBoxStylesVal; + }, + pixelPosition: function() { + computeStyleTests(); + return pixelPositionVal; + }, + reliableMarginLeft: function() { + computeStyleTests(); + return reliableMarginLeftVal; + }, + scrollboxSize: function() { + computeStyleTests(); + return scrollboxSizeVal; + }, + + // Support: IE 9 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Behavior in IE 9 is more subtle than in newer versions & it passes + // some versions of this test; make sure not to make it pass there! + reliableTrDimensions: function() { + var table, tr, trChild, trStyle; + if ( reliableTrDimensionsVal == null ) { + table = document.createElement( "table" ); + tr = document.createElement( "tr" ); + trChild = document.createElement( "div" ); + + table.style.cssText = "position:absolute;left:-11111px"; + tr.style.height = "1px"; + trChild.style.height = "9px"; + + documentElement + .appendChild( table ) + .appendChild( tr ) + .appendChild( trChild ); + + trStyle = window.getComputedStyle( tr ); + reliableTrDimensionsVal = parseInt( trStyle.height ) > 3; + + documentElement.removeChild( table ); + } + return reliableTrDimensionsVal; + } + } ); +} )(); + + +function curCSS( elem, name, computed ) { + var width, minWidth, maxWidth, ret, + + // Support: Firefox 51+ + // Retrieving style before computed somehow + // fixes an issue with getting wrong values + // on detached elements + style = elem.style; + + computed = computed || getStyles( elem ); + + // getPropertyValue is needed for: + // .css('filter') (IE 9 only, #12537) + // .css('--customProperty) (#3144) + if ( computed ) { + ret = computed.getPropertyValue( name ) || computed[ name ]; + + if ( ret === "" && !isAttached( elem ) ) { + ret = jQuery.style( elem, name ); + } + + // A tribute to the "awesome hack by Dean Edwards" + // Android Browser returns percentage for some values, + // but width seems to be reliably pixels. + // This is against the CSSOM draft spec: + // https://drafts.csswg.org/cssom/#resolved-values + if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { + + // Remember the original values + width = style.width; + minWidth = style.minWidth; + maxWidth = style.maxWidth; + + // Put in the new values to get a computed value out + style.minWidth = style.maxWidth = style.width = ret; + ret = computed.width; + + // Revert the changed values + style.width = width; + style.minWidth = minWidth; + style.maxWidth = maxWidth; + } + } + + return ret !== undefined ? + + // Support: IE <=9 - 11 only + // IE returns zIndex value as an integer. + ret + "" : + ret; +} + + +function addGetHookIf( conditionFn, hookFn ) { + + // Define the hook, we'll check on the first run if it's really needed. + return { + get: function() { + if ( conditionFn() ) { + + // Hook not needed (or it's not possible to use it due + // to missing dependency), remove it. + delete this.get; + return; + } + + // Hook needed; redefine it so that the support test is not executed again. + return ( this.get = hookFn ).apply( this, arguments ); + } + }; +} + + +var cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style, + vendorProps = {}; + +// Return a vendor-prefixed property or undefined +function vendorPropName( name ) { + + // Check for vendor prefixed names + var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), + i = cssPrefixes.length; + + while ( i-- ) { + name = cssPrefixes[ i ] + capName; + if ( name in emptyStyle ) { + return name; + } + } +} + +// Return a potentially-mapped jQuery.cssProps or vendor prefixed property +function finalPropName( name ) { + var final = jQuery.cssProps[ name ] || vendorProps[ name ]; + + if ( final ) { + return final; + } + if ( name in emptyStyle ) { + return name; + } + return vendorProps[ name ] = vendorPropName( name ) || name; +} + + +var + + // Swappable if display is none or starts with table + // except "table", "table-cell", or "table-caption" + // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display + rdisplayswap = /^(none|table(?!-c[ea]).+)/, + rcustomProp = /^--/, + cssShow = { position: "absolute", visibility: "hidden", display: "block" }, + cssNormalTransform = { + letterSpacing: "0", + fontWeight: "400" + }; + +function setPositiveNumber( _elem, value, subtract ) { + + // Any relative (+/-) values have already been + // normalized at this point + var matches = rcssNum.exec( value ); + return matches ? + + // Guard against undefined "subtract", e.g., when used as in cssHooks + Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : + value; +} + +function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { + var i = dimension === "width" ? 1 : 0, + extra = 0, + delta = 0; + + // Adjustment may not be necessary + if ( box === ( isBorderBox ? "border" : "content" ) ) { + return 0; + } + + for ( ; i < 4; i += 2 ) { + + // Both box models exclude margin + if ( box === "margin" ) { + delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); + } + + // If we get here with a content-box, we're seeking "padding" or "border" or "margin" + if ( !isBorderBox ) { + + // Add padding + delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + + // For "border" or "margin", add border + if ( box !== "padding" ) { + delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + + // But still keep track of it otherwise + } else { + extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + + // If we get here with a border-box (content + padding + border), we're seeking "content" or + // "padding" or "margin" + } else { + + // For "content", subtract padding + if ( box === "content" ) { + delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + } + + // For "content" or "padding", subtract border + if ( box !== "margin" ) { + delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + } + } + + // Account for positive content-box scroll gutter when requested by providing computedVal + if ( !isBorderBox && computedVal >= 0 ) { + + // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border + // Assuming integer scroll gutter, subtract the rest and round down + delta += Math.max( 0, Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + computedVal - + delta - + extra - + 0.5 + + // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter + // Use an explicit zero to avoid NaN (gh-3964) + ) ) || 0; + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). + // Fake content-box until we know it's needed to know the true value. + boxSizingNeeded = !support.boxSizingReliable() || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox, + + val = curCSS( elem, dimension, styles ), + offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + + // Support: IE 9 - 11 only + // Use offsetWidth/offsetHeight for when box sizing is unreliable. + // In those cases, the computed value can be trusted to be border-box. + if ( ( !support.boxSizingReliable() && isBorderBox || + + // Support: IE 10 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Interestingly, in some cases IE 9 doesn't suffer from this issue. + !support.reliableTrDimensions() && nodeName( elem, "tr" ) || + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + val === "auto" || + + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && + + // Make sure the element is visible & connected + elem.getClientRects().length ) { + + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; + + // Where available, offsetWidth/offsetHeight approximate border box dimensions. + // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the + // retrieved value as a content box dimension. + valueIsBorderBox = offsetProp in elem; + if ( valueIsBorderBox ) { + val = elem[ offsetProp ]; + } + } + + // Normalize "" and auto + val = parseFloat( val ) || 0; + + // Adjust for the element's box model + return ( val + + boxModelAdjustment( + elem, + dimension, + extra || ( isBorderBox ? "border" : "content" ), + valueIsBorderBox, + styles, + + // Provide the current computed size to request scroll gutter calculation (gh-3589) + val + ) + ) + "px"; +} + +jQuery.extend( { + + // Add in style property hooks for overriding the default + // behavior of getting and setting a style property + cssHooks: { + opacity: { + get: function( elem, computed ) { + if ( computed ) { + + // We should always get a number back from opacity + var ret = curCSS( elem, "opacity" ); + return ret === "" ? "1" : ret; + } + } + } + }, + + // Don't automatically add "px" to these possibly-unitless properties + cssNumber: { + "animationIterationCount": true, + "columnCount": true, + "fillOpacity": true, + "flexGrow": true, + "flexShrink": true, + "fontWeight": true, + "gridArea": true, + "gridColumn": true, + "gridColumnEnd": true, + "gridColumnStart": true, + "gridRow": true, + "gridRowEnd": true, + "gridRowStart": true, + "lineHeight": true, + "opacity": true, + "order": true, + "orphans": true, + "widows": true, + "zIndex": true, + "zoom": true + }, + + // Add in properties whose names you wish to fix before + // setting or getting the value + cssProps: {}, + + // Get and set the style property on a DOM Node + style: function( elem, name, value, extra ) { + + // Don't set styles on text and comment nodes + if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { + return; + } + + // Make sure that we're working with the right name + var ret, type, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ), + style = elem.style; + + // Make sure that we're working with the right name. We don't + // want to query the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Gets hook for the prefixed version, then unprefixed version + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // Check if we're setting a value + if ( value !== undefined ) { + type = typeof value; + + // Convert "+=" or "-=" to relative numbers (#7345) + if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { + value = adjustCSS( elem, name, ret ); + + // Fixes bug #9237 + type = "number"; + } + + // Make sure that null and NaN values aren't set (#7116) + if ( value == null || value !== value ) { + return; + } + + // If a number was passed in, add the unit (except for certain CSS properties) + // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append + // "px" to a few hardcoded values. + if ( type === "number" && !isCustomProp ) { + value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); + } + + // background-* props affect original clone's values + if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { + style[ name ] = "inherit"; + } + + // If a hook was provided, use that value, otherwise just set the specified value + if ( !hooks || !( "set" in hooks ) || + ( value = hooks.set( elem, value, extra ) ) !== undefined ) { + + if ( isCustomProp ) { + style.setProperty( name, value ); + } else { + style[ name ] = value; + } + } + + } else { + + // If a hook was provided get the non-computed value from there + if ( hooks && "get" in hooks && + ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { + + return ret; + } + + // Otherwise just get the value from the style object + return style[ name ]; + } + }, + + css: function( elem, name, extra, styles ) { + var val, num, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ); + + // Make sure that we're working with the right name. We don't + // want to modify the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Try prefixed name followed by the unprefixed name + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // If a hook was provided get the computed value from there + if ( hooks && "get" in hooks ) { + val = hooks.get( elem, true, extra ); + } + + // Otherwise, if a way to get the computed value exists, use that + if ( val === undefined ) { + val = curCSS( elem, name, styles ); + } + + // Convert "normal" to computed value + if ( val === "normal" && name in cssNormalTransform ) { + val = cssNormalTransform[ name ]; + } + + // Make numeric if forced or a qualifier was provided and val looks numeric + if ( extra === "" || extra ) { + num = parseFloat( val ); + return extra === true || isFinite( num ) ? num || 0 : val; + } + + return val; + } +} ); + +jQuery.each( [ "height", "width" ], function( _i, dimension ) { + jQuery.cssHooks[ dimension ] = { + get: function( elem, computed, extra ) { + if ( computed ) { + + // Certain elements can have dimension info if we invisibly show them + // but it must have a current display style that would benefit + return rdisplayswap.test( jQuery.css( elem, "display" ) ) && + + // Support: Safari 8+ + // Table columns in Safari have non-zero offsetWidth & zero + // getBoundingClientRect().width unless display is changed. + // Support: IE <=11 only + // Running getBoundingClientRect on a disconnected node + // in IE throws an error. + ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? + swap( elem, cssShow, function() { + return getWidthOrHeight( elem, dimension, extra ); + } ) : + getWidthOrHeight( elem, dimension, extra ); + } + }, + + set: function( elem, value, extra ) { + var matches, + styles = getStyles( elem ), + + // Only read styles.position if the test has a chance to fail + // to avoid forcing a reflow. + scrollboxSizeBuggy = !support.scrollboxSize() && + styles.position === "absolute", + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) + boxSizingNeeded = scrollboxSizeBuggy || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra ? + boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ) : + 0; + + // Account for unreliable border-box dimensions by comparing offset* to computed and + // faking a content-box to get border and padding (gh-3699) + if ( isBorderBox && scrollboxSizeBuggy ) { + subtract -= Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + parseFloat( styles[ dimension ] ) - + boxModelAdjustment( elem, dimension, "border", false, styles ) - + 0.5 + ); + } + + // Convert to pixels if value adjustment is needed + if ( subtract && ( matches = rcssNum.exec( value ) ) && + ( matches[ 3 ] || "px" ) !== "px" ) { + + elem.style[ dimension ] = value; + value = jQuery.css( elem, dimension ); + } + + return setPositiveNumber( elem, value, subtract ); + } + }; +} ); + +jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, + function( elem, computed ) { + if ( computed ) { + return ( parseFloat( curCSS( elem, "marginLeft" ) ) || + elem.getBoundingClientRect().left - + swap( elem, { marginLeft: 0 }, function() { + return elem.getBoundingClientRect().left; + } ) + ) + "px"; + } + } +); + +// These hooks are used by animate to expand properties +jQuery.each( { + margin: "", + padding: "", + border: "Width" +}, function( prefix, suffix ) { + jQuery.cssHooks[ prefix + suffix ] = { + expand: function( value ) { + var i = 0, + expanded = {}, + + // Assumes a single number if not a string + parts = typeof value === "string" ? value.split( " " ) : [ value ]; + + for ( ; i < 4; i++ ) { + expanded[ prefix + cssExpand[ i ] + suffix ] = + parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; + } + + return expanded; + } + }; + + if ( prefix !== "margin" ) { + jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; + } +} ); + +jQuery.fn.extend( { + css: function( name, value ) { + return access( this, function( elem, name, value ) { + var styles, len, + map = {}, + i = 0; + + if ( Array.isArray( name ) ) { + styles = getStyles( elem ); + len = name.length; + + for ( ; i < len; i++ ) { + map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); + } + + return map; + } + + return value !== undefined ? + jQuery.style( elem, name, value ) : + jQuery.css( elem, name ); + }, name, value, arguments.length > 1 ); + } +} ); + + +function Tween( elem, options, prop, end, easing ) { + return new Tween.prototype.init( elem, options, prop, end, easing ); +} +jQuery.Tween = Tween; + +Tween.prototype = { + constructor: Tween, + init: function( elem, options, prop, end, easing, unit ) { + this.elem = elem; + this.prop = prop; + this.easing = easing || jQuery.easing._default; + this.options = options; + this.start = this.now = this.cur(); + this.end = end; + this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); + }, + cur: function() { + var hooks = Tween.propHooks[ this.prop ]; + + return hooks && hooks.get ? + hooks.get( this ) : + Tween.propHooks._default.get( this ); + }, + run: function( percent ) { + var eased, + hooks = Tween.propHooks[ this.prop ]; + + if ( this.options.duration ) { + this.pos = eased = jQuery.easing[ this.easing ]( + percent, this.options.duration * percent, 0, 1, this.options.duration + ); + } else { + this.pos = eased = percent; + } + this.now = ( this.end - this.start ) * eased + this.start; + + if ( this.options.step ) { + this.options.step.call( this.elem, this.now, this ); + } + + if ( hooks && hooks.set ) { + hooks.set( this ); + } else { + Tween.propHooks._default.set( this ); + } + return this; + } +}; + +Tween.prototype.init.prototype = Tween.prototype; + +Tween.propHooks = { + _default: { + get: function( tween ) { + var result; + + // Use a property on the element directly when it is not a DOM element, + // or when there is no matching style property that exists. + if ( tween.elem.nodeType !== 1 || + tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { + return tween.elem[ tween.prop ]; + } + + // Passing an empty string as a 3rd parameter to .css will automatically + // attempt a parseFloat and fallback to a string if the parse fails. + // Simple values such as "10px" are parsed to Float; + // complex values such as "rotate(1rad)" are returned as-is. + result = jQuery.css( tween.elem, tween.prop, "" ); + + // Empty strings, null, undefined and "auto" are converted to 0. + return !result || result === "auto" ? 0 : result; + }, + set: function( tween ) { + + // Use step hook for back compat. + // Use cssHook if its there. + // Use .style if available and use plain properties where available. + if ( jQuery.fx.step[ tween.prop ] ) { + jQuery.fx.step[ tween.prop ]( tween ); + } else if ( tween.elem.nodeType === 1 && ( + jQuery.cssHooks[ tween.prop ] || + tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { + jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); + } else { + tween.elem[ tween.prop ] = tween.now; + } + } + } +}; + +// Support: IE <=9 only +// Panic based approach to setting things on disconnected nodes +Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { + set: function( tween ) { + if ( tween.elem.nodeType && tween.elem.parentNode ) { + tween.elem[ tween.prop ] = tween.now; + } + } +}; + +jQuery.easing = { + linear: function( p ) { + return p; + }, + swing: function( p ) { + return 0.5 - Math.cos( p * Math.PI ) / 2; + }, + _default: "swing" +}; + +jQuery.fx = Tween.prototype.init; + +// Back compat <1.8 extension point +jQuery.fx.step = {}; + + + + +var + fxNow, inProgress, + rfxtypes = /^(?:toggle|show|hide)$/, + rrun = /queueHooks$/; + +function schedule() { + if ( inProgress ) { + if ( document.hidden === false && window.requestAnimationFrame ) { + window.requestAnimationFrame( schedule ); + } else { + window.setTimeout( schedule, jQuery.fx.interval ); + } + + jQuery.fx.tick(); + } +} + +// Animations created synchronously will run synchronously +function createFxNow() { + window.setTimeout( function() { + fxNow = undefined; + } ); + return ( fxNow = Date.now() ); +} + +// Generate parameters to create a standard animation +function genFx( type, includeWidth ) { + var which, + i = 0, + attrs = { height: type }; + + // If we include width, step value is 1 to do all cssExpand values, + // otherwise step value is 2 to skip over Left and Right + includeWidth = includeWidth ? 1 : 0; + for ( ; i < 4; i += 2 - includeWidth ) { + which = cssExpand[ i ]; + attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; + } + + if ( includeWidth ) { + attrs.opacity = attrs.width = type; + } + + return attrs; +} + +function createTween( value, prop, animation ) { + var tween, + collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), + index = 0, + length = collection.length; + for ( ; index < length; index++ ) { + if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { + + // We're done with this property + return tween; + } + } +} + +function defaultPrefilter( elem, props, opts ) { + var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, + isBox = "width" in props || "height" in props, + anim = this, + orig = {}, + style = elem.style, + hidden = elem.nodeType && isHiddenWithinTree( elem ), + dataShow = dataPriv.get( elem, "fxshow" ); + + // Queue-skipping animations hijack the fx hooks + if ( !opts.queue ) { + hooks = jQuery._queueHooks( elem, "fx" ); + if ( hooks.unqueued == null ) { + hooks.unqueued = 0; + oldfire = hooks.empty.fire; + hooks.empty.fire = function() { + if ( !hooks.unqueued ) { + oldfire(); + } + }; + } + hooks.unqueued++; + + anim.always( function() { + + // Ensure the complete handler is called before this completes + anim.always( function() { + hooks.unqueued--; + if ( !jQuery.queue( elem, "fx" ).length ) { + hooks.empty.fire(); + } + } ); + } ); + } + + // Detect show/hide animations + for ( prop in props ) { + value = props[ prop ]; + if ( rfxtypes.test( value ) ) { + delete props[ prop ]; + toggle = toggle || value === "toggle"; + if ( value === ( hidden ? "hide" : "show" ) ) { + + // Pretend to be hidden if this is a "show" and + // there is still data from a stopped show/hide + if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { + hidden = true; + + // Ignore all other no-op show/hide data + } else { + continue; + } + } + orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); + } + } + + // Bail out if this is a no-op like .hide().hide() + propTween = !jQuery.isEmptyObject( props ); + if ( !propTween && jQuery.isEmptyObject( orig ) ) { + return; + } + + // Restrict "overflow" and "display" styles during box animations + if ( isBox && elem.nodeType === 1 ) { + + // Support: IE <=9 - 11, Edge 12 - 15 + // Record all 3 overflow attributes because IE does not infer the shorthand + // from identically-valued overflowX and overflowY and Edge just mirrors + // the overflowX value there. + opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; + + // Identify a display type, preferring old show/hide data over the CSS cascade + restoreDisplay = dataShow && dataShow.display; + if ( restoreDisplay == null ) { + restoreDisplay = dataPriv.get( elem, "display" ); + } + display = jQuery.css( elem, "display" ); + if ( display === "none" ) { + if ( restoreDisplay ) { + display = restoreDisplay; + } else { + + // Get nonempty value(s) by temporarily forcing visibility + showHide( [ elem ], true ); + restoreDisplay = elem.style.display || restoreDisplay; + display = jQuery.css( elem, "display" ); + showHide( [ elem ] ); + } + } + + // Animate inline elements as inline-block + if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { + if ( jQuery.css( elem, "float" ) === "none" ) { + + // Restore the original display value at the end of pure show/hide animations + if ( !propTween ) { + anim.done( function() { + style.display = restoreDisplay; + } ); + if ( restoreDisplay == null ) { + display = style.display; + restoreDisplay = display === "none" ? "" : display; + } + } + style.display = "inline-block"; + } + } + } + + if ( opts.overflow ) { + style.overflow = "hidden"; + anim.always( function() { + style.overflow = opts.overflow[ 0 ]; + style.overflowX = opts.overflow[ 1 ]; + style.overflowY = opts.overflow[ 2 ]; + } ); + } + + // Implement show/hide animations + propTween = false; + for ( prop in orig ) { + + // General show/hide setup for this element animation + if ( !propTween ) { + if ( dataShow ) { + if ( "hidden" in dataShow ) { + hidden = dataShow.hidden; + } + } else { + dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); + } + + // Store hidden/visible for toggle so `.stop().toggle()` "reverses" + if ( toggle ) { + dataShow.hidden = !hidden; + } + + // Show elements before animating them + if ( hidden ) { + showHide( [ elem ], true ); + } + + /* eslint-disable no-loop-func */ + + anim.done( function() { + + /* eslint-enable no-loop-func */ + + // The final step of a "hide" animation is actually hiding the element + if ( !hidden ) { + showHide( [ elem ] ); + } + dataPriv.remove( elem, "fxshow" ); + for ( prop in orig ) { + jQuery.style( elem, prop, orig[ prop ] ); + } + } ); + } + + // Per-property setup + propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); + if ( !( prop in dataShow ) ) { + dataShow[ prop ] = propTween.start; + if ( hidden ) { + propTween.end = propTween.start; + propTween.start = 0; + } + } + } +} + +function propFilter( props, specialEasing ) { + var index, name, easing, value, hooks; + + // camelCase, specialEasing and expand cssHook pass + for ( index in props ) { + name = camelCase( index ); + easing = specialEasing[ name ]; + value = props[ index ]; + if ( Array.isArray( value ) ) { + easing = value[ 1 ]; + value = props[ index ] = value[ 0 ]; + } + + if ( index !== name ) { + props[ name ] = value; + delete props[ index ]; + } + + hooks = jQuery.cssHooks[ name ]; + if ( hooks && "expand" in hooks ) { + value = hooks.expand( value ); + delete props[ name ]; + + // Not quite $.extend, this won't overwrite existing keys. + // Reusing 'index' because we have the correct "name" + for ( index in value ) { + if ( !( index in props ) ) { + props[ index ] = value[ index ]; + specialEasing[ index ] = easing; + } + } + } else { + specialEasing[ name ] = easing; + } + } +} + +function Animation( elem, properties, options ) { + var result, + stopped, + index = 0, + length = Animation.prefilters.length, + deferred = jQuery.Deferred().always( function() { + + // Don't match elem in the :animated selector + delete tick.elem; + } ), + tick = function() { + if ( stopped ) { + return false; + } + var currentTime = fxNow || createFxNow(), + remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), + + // Support: Android 2.3 only + // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) + temp = remaining / animation.duration || 0, + percent = 1 - temp, + index = 0, + length = animation.tweens.length; + + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( percent ); + } + + deferred.notifyWith( elem, [ animation, percent, remaining ] ); + + // If there's more to do, yield + if ( percent < 1 && length ) { + return remaining; + } + + // If this was an empty animation, synthesize a final progress notification + if ( !length ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + } + + // Resolve the animation and report its conclusion + deferred.resolveWith( elem, [ animation ] ); + return false; + }, + animation = deferred.promise( { + elem: elem, + props: jQuery.extend( {}, properties ), + opts: jQuery.extend( true, { + specialEasing: {}, + easing: jQuery.easing._default + }, options ), + originalProperties: properties, + originalOptions: options, + startTime: fxNow || createFxNow(), + duration: options.duration, + tweens: [], + createTween: function( prop, end ) { + var tween = jQuery.Tween( elem, animation.opts, prop, end, + animation.opts.specialEasing[ prop ] || animation.opts.easing ); + animation.tweens.push( tween ); + return tween; + }, + stop: function( gotoEnd ) { + var index = 0, + + // If we are going to the end, we want to run all the tweens + // otherwise we skip this part + length = gotoEnd ? animation.tweens.length : 0; + if ( stopped ) { + return this; + } + stopped = true; + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( 1 ); + } + + // Resolve when we played the last frame; otherwise, reject + if ( gotoEnd ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + deferred.resolveWith( elem, [ animation, gotoEnd ] ); + } else { + deferred.rejectWith( elem, [ animation, gotoEnd ] ); + } + return this; + } + } ), + props = animation.props; + + propFilter( props, animation.opts.specialEasing ); + + for ( ; index < length; index++ ) { + result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); + if ( result ) { + if ( isFunction( result.stop ) ) { + jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = + result.stop.bind( result ); + } + return result; + } + } + + jQuery.map( props, createTween, animation ); + + if ( isFunction( animation.opts.start ) ) { + animation.opts.start.call( elem, animation ); + } + + // Attach callbacks from options + animation + .progress( animation.opts.progress ) + .done( animation.opts.done, animation.opts.complete ) + .fail( animation.opts.fail ) + .always( animation.opts.always ); + + jQuery.fx.timer( + jQuery.extend( tick, { + elem: elem, + anim: animation, + queue: animation.opts.queue + } ) + ); + + return animation; +} + +jQuery.Animation = jQuery.extend( Animation, { + + tweeners: { + "*": [ function( prop, value ) { + var tween = this.createTween( prop, value ); + adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); + return tween; + } ] + }, + + tweener: function( props, callback ) { + if ( isFunction( props ) ) { + callback = props; + props = [ "*" ]; + } else { + props = props.match( rnothtmlwhite ); + } + + var prop, + index = 0, + length = props.length; + + for ( ; index < length; index++ ) { + prop = props[ index ]; + Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; + Animation.tweeners[ prop ].unshift( callback ); + } + }, + + prefilters: [ defaultPrefilter ], + + prefilter: function( callback, prepend ) { + if ( prepend ) { + Animation.prefilters.unshift( callback ); + } else { + Animation.prefilters.push( callback ); + } + } +} ); + +jQuery.speed = function( speed, easing, fn ) { + var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { + complete: fn || !fn && easing || + isFunction( speed ) && speed, + duration: speed, + easing: fn && easing || easing && !isFunction( easing ) && easing + }; + + // Go to the end state if fx are off + if ( jQuery.fx.off ) { + opt.duration = 0; + + } else { + if ( typeof opt.duration !== "number" ) { + if ( opt.duration in jQuery.fx.speeds ) { + opt.duration = jQuery.fx.speeds[ opt.duration ]; + + } else { + opt.duration = jQuery.fx.speeds._default; + } + } + } + + // Normalize opt.queue - true/undefined/null -> "fx" + if ( opt.queue == null || opt.queue === true ) { + opt.queue = "fx"; + } + + // Queueing + opt.old = opt.complete; + + opt.complete = function() { + if ( isFunction( opt.old ) ) { + opt.old.call( this ); + } + + if ( opt.queue ) { + jQuery.dequeue( this, opt.queue ); + } + }; + + return opt; +}; + +jQuery.fn.extend( { + fadeTo: function( speed, to, easing, callback ) { + + // Show any hidden elements after setting opacity to 0 + return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() + + // Animate to the value specified + .end().animate( { opacity: to }, speed, easing, callback ); + }, + animate: function( prop, speed, easing, callback ) { + var empty = jQuery.isEmptyObject( prop ), + optall = jQuery.speed( speed, easing, callback ), + doAnimation = function() { + + // Operate on a copy of prop so per-property easing won't be lost + var anim = Animation( this, jQuery.extend( {}, prop ), optall ); + + // Empty animations, or finishing resolves immediately + if ( empty || dataPriv.get( this, "finish" ) ) { + anim.stop( true ); + } + }; + doAnimation.finish = doAnimation; + + return empty || optall.queue === false ? + this.each( doAnimation ) : + this.queue( optall.queue, doAnimation ); + }, + stop: function( type, clearQueue, gotoEnd ) { + var stopQueue = function( hooks ) { + var stop = hooks.stop; + delete hooks.stop; + stop( gotoEnd ); + }; + + if ( typeof type !== "string" ) { + gotoEnd = clearQueue; + clearQueue = type; + type = undefined; + } + if ( clearQueue ) { + this.queue( type || "fx", [] ); + } + + return this.each( function() { + var dequeue = true, + index = type != null && type + "queueHooks", + timers = jQuery.timers, + data = dataPriv.get( this ); + + if ( index ) { + if ( data[ index ] && data[ index ].stop ) { + stopQueue( data[ index ] ); + } + } else { + for ( index in data ) { + if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { + stopQueue( data[ index ] ); + } + } + } + + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && + ( type == null || timers[ index ].queue === type ) ) { + + timers[ index ].anim.stop( gotoEnd ); + dequeue = false; + timers.splice( index, 1 ); + } + } + + // Start the next in the queue if the last step wasn't forced. + // Timers currently will call their complete callbacks, which + // will dequeue but only if they were gotoEnd. + if ( dequeue || !gotoEnd ) { + jQuery.dequeue( this, type ); + } + } ); + }, + finish: function( type ) { + if ( type !== false ) { + type = type || "fx"; + } + return this.each( function() { + var index, + data = dataPriv.get( this ), + queue = data[ type + "queue" ], + hooks = data[ type + "queueHooks" ], + timers = jQuery.timers, + length = queue ? queue.length : 0; + + // Enable finishing flag on private data + data.finish = true; + + // Empty the queue first + jQuery.queue( this, type, [] ); + + if ( hooks && hooks.stop ) { + hooks.stop.call( this, true ); + } + + // Look for any active animations, and finish them + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && timers[ index ].queue === type ) { + timers[ index ].anim.stop( true ); + timers.splice( index, 1 ); + } + } + + // Look for any animations in the old queue and finish them + for ( index = 0; index < length; index++ ) { + if ( queue[ index ] && queue[ index ].finish ) { + queue[ index ].finish.call( this ); + } + } + + // Turn off finishing flag + delete data.finish; + } ); + } +} ); + +jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { + var cssFn = jQuery.fn[ name ]; + jQuery.fn[ name ] = function( speed, easing, callback ) { + return speed == null || typeof speed === "boolean" ? + cssFn.apply( this, arguments ) : + this.animate( genFx( name, true ), speed, easing, callback ); + }; +} ); + +// Generate shortcuts for custom animations +jQuery.each( { + slideDown: genFx( "show" ), + slideUp: genFx( "hide" ), + slideToggle: genFx( "toggle" ), + fadeIn: { opacity: "show" }, + fadeOut: { opacity: "hide" }, + fadeToggle: { opacity: "toggle" } +}, function( name, props ) { + jQuery.fn[ name ] = function( speed, easing, callback ) { + return this.animate( props, speed, easing, callback ); + }; +} ); + +jQuery.timers = []; +jQuery.fx.tick = function() { + var timer, + i = 0, + timers = jQuery.timers; + + fxNow = Date.now(); + + for ( ; i < timers.length; i++ ) { + timer = timers[ i ]; + + // Run the timer and safely remove it when done (allowing for external removal) + if ( !timer() && timers[ i ] === timer ) { + timers.splice( i--, 1 ); + } + } + + if ( !timers.length ) { + jQuery.fx.stop(); + } + fxNow = undefined; +}; + +jQuery.fx.timer = function( timer ) { + jQuery.timers.push( timer ); + jQuery.fx.start(); +}; + +jQuery.fx.interval = 13; +jQuery.fx.start = function() { + if ( inProgress ) { + return; + } + + inProgress = true; + schedule(); +}; + +jQuery.fx.stop = function() { + inProgress = null; +}; + +jQuery.fx.speeds = { + slow: 600, + fast: 200, + + // Default speed + _default: 400 +}; + + +// Based off of the plugin by Clint Helfers, with permission. +// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ +jQuery.fn.delay = function( time, type ) { + time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; + type = type || "fx"; + + return this.queue( type, function( next, hooks ) { + var timeout = window.setTimeout( next, time ); + hooks.stop = function() { + window.clearTimeout( timeout ); + }; + } ); +}; + + +( function() { + var input = document.createElement( "input" ), + select = document.createElement( "select" ), + opt = select.appendChild( document.createElement( "option" ) ); + + input.type = "checkbox"; + + // Support: Android <=4.3 only + // Default value for a checkbox should be "on" + support.checkOn = input.value !== ""; + + // Support: IE <=11 only + // Must access selectedIndex to make default options select + support.optSelected = opt.selected; + + // Support: IE <=11 only + // An input loses its value after becoming a radio + input = document.createElement( "input" ); + input.value = "t"; + input.type = "radio"; + support.radioValue = input.value === "t"; +} )(); + + +var boolHook, + attrHandle = jQuery.expr.attrHandle; + +jQuery.fn.extend( { + attr: function( name, value ) { + return access( this, jQuery.attr, name, value, arguments.length > 1 ); + }, + + removeAttr: function( name ) { + return this.each( function() { + jQuery.removeAttr( this, name ); + } ); + } +} ); + +jQuery.extend( { + attr: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set attributes on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + // Fallback to prop when attributes are not supported + if ( typeof elem.getAttribute === "undefined" ) { + return jQuery.prop( elem, name, value ); + } + + // Attribute hooks are determined by the lowercase version + // Grab necessary hook if one is defined + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + hooks = jQuery.attrHooks[ name.toLowerCase() ] || + ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); + } + + if ( value !== undefined ) { + if ( value === null ) { + jQuery.removeAttr( elem, name ); + return; + } + + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + elem.setAttribute( name, value + "" ); + return value; + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + ret = jQuery.find.attr( elem, name ); + + // Non-existent attributes return null, we normalize to undefined + return ret == null ? undefined : ret; + }, + + attrHooks: { + type: { + set: function( elem, value ) { + if ( !support.radioValue && value === "radio" && + nodeName( elem, "input" ) ) { + var val = elem.value; + elem.setAttribute( "type", value ); + if ( val ) { + elem.value = val; + } + return value; + } + } + } + }, + + removeAttr: function( elem, value ) { + var name, + i = 0, + + // Attribute names can contain non-HTML whitespace characters + // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 + attrNames = value && value.match( rnothtmlwhite ); + + if ( attrNames && elem.nodeType === 1 ) { + while ( ( name = attrNames[ i++ ] ) ) { + elem.removeAttribute( name ); + } + } + } +} ); + +// Hooks for boolean attributes +boolHook = { + set: function( elem, value, name ) { + if ( value === false ) { + + // Remove boolean attributes when set to false + jQuery.removeAttr( elem, name ); + } else { + elem.setAttribute( name, name ); + } + return name; + } +}; + +jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { + var getter = attrHandle[ name ] || jQuery.find.attr; + + attrHandle[ name ] = function( elem, name, isXML ) { + var ret, handle, + lowercaseName = name.toLowerCase(); + + if ( !isXML ) { + + // Avoid an infinite loop by temporarily removing this function from the getter + handle = attrHandle[ lowercaseName ]; + attrHandle[ lowercaseName ] = ret; + ret = getter( elem, name, isXML ) != null ? + lowercaseName : + null; + attrHandle[ lowercaseName ] = handle; + } + return ret; + }; +} ); + + + + +var rfocusable = /^(?:input|select|textarea|button)$/i, + rclickable = /^(?:a|area)$/i; + +jQuery.fn.extend( { + prop: function( name, value ) { + return access( this, jQuery.prop, name, value, arguments.length > 1 ); + }, + + removeProp: function( name ) { + return this.each( function() { + delete this[ jQuery.propFix[ name ] || name ]; + } ); + } +} ); + +jQuery.extend( { + prop: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set properties on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + + // Fix name and attach hooks + name = jQuery.propFix[ name ] || name; + hooks = jQuery.propHooks[ name ]; + } + + if ( value !== undefined ) { + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + return ( elem[ name ] = value ); + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + return elem[ name ]; + }, + + propHooks: { + tabIndex: { + get: function( elem ) { + + // Support: IE <=9 - 11 only + // elem.tabIndex doesn't always return the + // correct value when it hasn't been explicitly set + // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ + // Use proper attribute retrieval(#12072) + var tabindex = jQuery.find.attr( elem, "tabindex" ); + + if ( tabindex ) { + return parseInt( tabindex, 10 ); + } + + if ( + rfocusable.test( elem.nodeName ) || + rclickable.test( elem.nodeName ) && + elem.href + ) { + return 0; + } + + return -1; + } + } + }, + + propFix: { + "for": "htmlFor", + "class": "className" + } +} ); + +// Support: IE <=11 only +// Accessing the selectedIndex property +// forces the browser to respect setting selected +// on the option +// The getter ensures a default option is selected +// when in an optgroup +// eslint rule "no-unused-expressions" is disabled for this code +// since it considers such accessions noop +if ( !support.optSelected ) { + jQuery.propHooks.selected = { + get: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent && parent.parentNode ) { + parent.parentNode.selectedIndex; + } + return null; + }, + set: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent ) { + parent.selectedIndex; + + if ( parent.parentNode ) { + parent.parentNode.selectedIndex; + } + } + } + }; +} + +jQuery.each( [ + "tabIndex", + "readOnly", + "maxLength", + "cellSpacing", + "cellPadding", + "rowSpan", + "colSpan", + "useMap", + "frameBorder", + "contentEditable" +], function() { + jQuery.propFix[ this.toLowerCase() ] = this; +} ); + + + + + // Strip and collapse whitespace according to HTML spec + // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace + function stripAndCollapse( value ) { + var tokens = value.match( rnothtmlwhite ) || []; + return tokens.join( " " ); + } + + +function getClass( elem ) { + return elem.getAttribute && elem.getAttribute( "class" ) || ""; +} + +function classesToArray( value ) { + if ( Array.isArray( value ) ) { + return value; + } + if ( typeof value === "string" ) { + return value.match( rnothtmlwhite ) || []; + } + return []; +} + +jQuery.fn.extend( { + addClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + if ( cur.indexOf( " " + clazz + " " ) < 0 ) { + cur += clazz + " "; + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + removeClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + if ( !arguments.length ) { + return this.attr( "class", "" ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + + // This expression is here for better compressibility (see addClass) + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + + // Remove *all* instances + while ( cur.indexOf( " " + clazz + " " ) > -1 ) { + cur = cur.replace( " " + clazz + " ", " " ); + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + toggleClass: function( value, stateVal ) { + var type = typeof value, + isValidValue = type === "string" || Array.isArray( value ); + + if ( typeof stateVal === "boolean" && isValidValue ) { + return stateVal ? this.addClass( value ) : this.removeClass( value ); + } + + if ( isFunction( value ) ) { + return this.each( function( i ) { + jQuery( this ).toggleClass( + value.call( this, i, getClass( this ), stateVal ), + stateVal + ); + } ); + } + + return this.each( function() { + var className, i, self, classNames; + + if ( isValidValue ) { + + // Toggle individual class names + i = 0; + self = jQuery( this ); + classNames = classesToArray( value ); + + while ( ( className = classNames[ i++ ] ) ) { + + // Check each className given, space separated list + if ( self.hasClass( className ) ) { + self.removeClass( className ); + } else { + self.addClass( className ); + } + } + + // Toggle whole class name + } else if ( value === undefined || type === "boolean" ) { + className = getClass( this ); + if ( className ) { + + // Store className if set + dataPriv.set( this, "__className__", className ); + } + + // If the element has a class name or if we're passed `false`, + // then remove the whole classname (if there was one, the above saved it). + // Otherwise bring back whatever was previously saved (if anything), + // falling back to the empty string if nothing was stored. + if ( this.setAttribute ) { + this.setAttribute( "class", + className || value === false ? + "" : + dataPriv.get( this, "__className__" ) || "" + ); + } + } + } ); + }, + + hasClass: function( selector ) { + var className, elem, + i = 0; + + className = " " + selector + " "; + while ( ( elem = this[ i++ ] ) ) { + if ( elem.nodeType === 1 && + ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { + return true; + } + } + + return false; + } +} ); + + + + +var rreturn = /\r/g; + +jQuery.fn.extend( { + val: function( value ) { + var hooks, ret, valueIsFunction, + elem = this[ 0 ]; + + if ( !arguments.length ) { + if ( elem ) { + hooks = jQuery.valHooks[ elem.type ] || + jQuery.valHooks[ elem.nodeName.toLowerCase() ]; + + if ( hooks && + "get" in hooks && + ( ret = hooks.get( elem, "value" ) ) !== undefined + ) { + return ret; + } + + ret = elem.value; + + // Handle most common string cases + if ( typeof ret === "string" ) { + return ret.replace( rreturn, "" ); + } + + // Handle cases where value is null/undef or number + return ret == null ? "" : ret; + } + + return; + } + + valueIsFunction = isFunction( value ); + + return this.each( function( i ) { + var val; + + if ( this.nodeType !== 1 ) { + return; + } + + if ( valueIsFunction ) { + val = value.call( this, i, jQuery( this ).val() ); + } else { + val = value; + } + + // Treat null/undefined as ""; convert numbers to string + if ( val == null ) { + val = ""; + + } else if ( typeof val === "number" ) { + val += ""; + + } else if ( Array.isArray( val ) ) { + val = jQuery.map( val, function( value ) { + return value == null ? "" : value + ""; + } ); + } + + hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; + + // If set returns undefined, fall back to normal setting + if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { + this.value = val; + } + } ); + } +} ); + +jQuery.extend( { + valHooks: { + option: { + get: function( elem ) { + + var val = jQuery.find.attr( elem, "value" ); + return val != null ? + val : + + // Support: IE <=10 - 11 only + // option.text throws exceptions (#14686, #14858) + // Strip and collapse whitespace + // https://html.spec.whatwg.org/#strip-and-collapse-whitespace + stripAndCollapse( jQuery.text( elem ) ); + } + }, + select: { + get: function( elem ) { + var value, option, i, + options = elem.options, + index = elem.selectedIndex, + one = elem.type === "select-one", + values = one ? null : [], + max = one ? index + 1 : options.length; + + if ( index < 0 ) { + i = max; + + } else { + i = one ? index : 0; + } + + // Loop through all the selected options + for ( ; i < max; i++ ) { + option = options[ i ]; + + // Support: IE <=9 only + // IE8-9 doesn't update selected after form reset (#2551) + if ( ( option.selected || i === index ) && + + // Don't return options that are disabled or in a disabled optgroup + !option.disabled && + ( !option.parentNode.disabled || + !nodeName( option.parentNode, "optgroup" ) ) ) { + + // Get the specific value for the option + value = jQuery( option ).val(); + + // We don't need an array for one selects + if ( one ) { + return value; + } + + // Multi-Selects return an array + values.push( value ); + } + } + + return values; + }, + + set: function( elem, value ) { + var optionSet, option, + options = elem.options, + values = jQuery.makeArray( value ), + i = options.length; + + while ( i-- ) { + option = options[ i ]; + + /* eslint-disable no-cond-assign */ + + if ( option.selected = + jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 + ) { + optionSet = true; + } + + /* eslint-enable no-cond-assign */ + } + + // Force browsers to behave consistently when non-matching value is set + if ( !optionSet ) { + elem.selectedIndex = -1; + } + return values; + } + } + } +} ); + +// Radios and checkboxes getter/setter +jQuery.each( [ "radio", "checkbox" ], function() { + jQuery.valHooks[ this ] = { + set: function( elem, value ) { + if ( Array.isArray( value ) ) { + return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); + } + } + }; + if ( !support.checkOn ) { + jQuery.valHooks[ this ].get = function( elem ) { + return elem.getAttribute( "value" ) === null ? "on" : elem.value; + }; + } +} ); + + + + +// Return jQuery for attributes-only inclusion + + +support.focusin = "onfocusin" in window; + + +var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, + stopPropagationCallback = function( e ) { + e.stopPropagation(); + }; + +jQuery.extend( jQuery.event, { + + trigger: function( event, data, elem, onlyHandlers ) { + + var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, + eventPath = [ elem || document ], + type = hasOwn.call( event, "type" ) ? event.type : event, + namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; + + cur = lastElement = tmp = elem = elem || document; + + // Don't do events on text and comment nodes + if ( elem.nodeType === 3 || elem.nodeType === 8 ) { + return; + } + + // focus/blur morphs to focusin/out; ensure we're not firing them right now + if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { + return; + } + + if ( type.indexOf( "." ) > -1 ) { + + // Namespaced trigger; create a regexp to match event type in handle() + namespaces = type.split( "." ); + type = namespaces.shift(); + namespaces.sort(); + } + ontype = type.indexOf( ":" ) < 0 && "on" + type; + + // Caller can pass in a jQuery.Event object, Object, or just an event type string + event = event[ jQuery.expando ] ? + event : + new jQuery.Event( type, typeof event === "object" && event ); + + // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) + event.isTrigger = onlyHandlers ? 2 : 3; + event.namespace = namespaces.join( "." ); + event.rnamespace = event.namespace ? + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : + null; + + // Clean up the event in case it is being reused + event.result = undefined; + if ( !event.target ) { + event.target = elem; + } + + // Clone any incoming data and prepend the event, creating the handler arg list + data = data == null ? + [ event ] : + jQuery.makeArray( data, [ event ] ); + + // Allow special events to draw outside the lines + special = jQuery.event.special[ type ] || {}; + if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { + return; + } + + // Determine event propagation path in advance, per W3C events spec (#9951) + // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) + if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { + + bubbleType = special.delegateType || type; + if ( !rfocusMorph.test( bubbleType + type ) ) { + cur = cur.parentNode; + } + for ( ; cur; cur = cur.parentNode ) { + eventPath.push( cur ); + tmp = cur; + } + + // Only add window if we got to document (e.g., not plain obj or detached DOM) + if ( tmp === ( elem.ownerDocument || document ) ) { + eventPath.push( tmp.defaultView || tmp.parentWindow || window ); + } + } + + // Fire handlers on the event path + i = 0; + while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { + lastElement = cur; + event.type = i > 1 ? + bubbleType : + special.bindType || type; + + // jQuery handler + handle = ( + dataPriv.get( cur, "events" ) || Object.create( null ) + )[ event.type ] && + dataPriv.get( cur, "handle" ); + if ( handle ) { + handle.apply( cur, data ); + } + + // Native handler + handle = ontype && cur[ ontype ]; + if ( handle && handle.apply && acceptData( cur ) ) { + event.result = handle.apply( cur, data ); + if ( event.result === false ) { + event.preventDefault(); + } + } + } + event.type = type; + + // If nobody prevented the default action, do it now + if ( !onlyHandlers && !event.isDefaultPrevented() ) { + + if ( ( !special._default || + special._default.apply( eventPath.pop(), data ) === false ) && + acceptData( elem ) ) { + + // Call a native DOM method on the target with the same name as the event. + // Don't do default actions on window, that's where global variables be (#6170) + if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { + + // Don't re-trigger an onFOO event when we call its FOO() method + tmp = elem[ ontype ]; + + if ( tmp ) { + elem[ ontype ] = null; + } + + // Prevent re-triggering of the same event, since we already bubbled it above + jQuery.event.triggered = type; + + if ( event.isPropagationStopped() ) { + lastElement.addEventListener( type, stopPropagationCallback ); + } + + elem[ type ](); + + if ( event.isPropagationStopped() ) { + lastElement.removeEventListener( type, stopPropagationCallback ); + } + + jQuery.event.triggered = undefined; + + if ( tmp ) { + elem[ ontype ] = tmp; + } + } + } + } + + return event.result; + }, + + // Piggyback on a donor event to simulate a different one + // Used only for `focus(in | out)` events + simulate: function( type, elem, event ) { + var e = jQuery.extend( + new jQuery.Event(), + event, + { + type: type, + isSimulated: true + } + ); + + jQuery.event.trigger( e, null, elem ); + } + +} ); + +jQuery.fn.extend( { + + trigger: function( type, data ) { + return this.each( function() { + jQuery.event.trigger( type, data, this ); + } ); + }, + triggerHandler: function( type, data ) { + var elem = this[ 0 ]; + if ( elem ) { + return jQuery.event.trigger( type, data, elem, true ); + } + } +} ); + + +// Support: Firefox <=44 +// Firefox doesn't have focus(in | out) events +// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 +// +// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 +// focus(in | out) events fire after focus & blur events, +// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order +// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 +if ( !support.focusin ) { + jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { + + // Attach a single capturing handler on the document while someone wants focusin/focusout + var handler = function( event ) { + jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); + }; + + jQuery.event.special[ fix ] = { + setup: function() { + + // Handle: regular nodes (via `this.ownerDocument`), window + // (via `this.document`) & document (via `this`). + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ); + + if ( !attaches ) { + doc.addEventListener( orig, handler, true ); + } + dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); + }, + teardown: function() { + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ) - 1; + + if ( !attaches ) { + doc.removeEventListener( orig, handler, true ); + dataPriv.remove( doc, fix ); + + } else { + dataPriv.access( doc, fix, attaches ); + } + } + }; + } ); +} +var location = window.location; + +var nonce = { guid: Date.now() }; + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml; + if ( !data || typeof data !== "string" ) { + return null; + } + + // Support: IE 9 - 11 only + // IE throws on parseFromString with invalid input. + try { + xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); + } catch ( e ) { + xml = undefined; + } + + if ( !xml || xml.getElementsByTagName( "parsererror" ).length ) { + jQuery.error( "Invalid XML: " + data ); + } + return xml; +}; + + +var + rbracket = /\[\]$/, + rCRLF = /\r?\n/g, + rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, + rsubmittable = /^(?:input|select|textarea|keygen)/i; + +function buildParams( prefix, obj, traditional, add ) { + var name; + + if ( Array.isArray( obj ) ) { + + // Serialize array item. + jQuery.each( obj, function( i, v ) { + if ( traditional || rbracket.test( prefix ) ) { + + // Treat each array item as a scalar. + add( prefix, v ); + + } else { + + // Item is non-scalar (array or object), encode its numeric index. + buildParams( + prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", + v, + traditional, + add + ); + } + } ); + + } else if ( !traditional && toType( obj ) === "object" ) { + + // Serialize object item. + for ( name in obj ) { + buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); + } + + } else { + + // Serialize scalar item. + add( prefix, obj ); + } +} + +// Serialize an array of form elements or a set of +// key/values into a query string +jQuery.param = function( a, traditional ) { + var prefix, + s = [], + add = function( key, valueOrFunction ) { + + // If value is a function, invoke it and use its return value + var value = isFunction( valueOrFunction ) ? + valueOrFunction() : + valueOrFunction; + + s[ s.length ] = encodeURIComponent( key ) + "=" + + encodeURIComponent( value == null ? "" : value ); + }; + + if ( a == null ) { + return ""; + } + + // If an array was passed in, assume that it is an array of form elements. + if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { + + // Serialize the form elements + jQuery.each( a, function() { + add( this.name, this.value ); + } ); + + } else { + + // If traditional, encode the "old" way (the way 1.3.2 or older + // did it), otherwise encode params recursively. + for ( prefix in a ) { + buildParams( prefix, a[ prefix ], traditional, add ); + } + } + + // Return the resulting serialization + return s.join( "&" ); +}; + +jQuery.fn.extend( { + serialize: function() { + return jQuery.param( this.serializeArray() ); + }, + serializeArray: function() { + return this.map( function() { + + // Can add propHook for "elements" to filter or add form elements + var elements = jQuery.prop( this, "elements" ); + return elements ? jQuery.makeArray( elements ) : this; + } ) + .filter( function() { + var type = this.type; + + // Use .is( ":disabled" ) so that fieldset[disabled] works + return this.name && !jQuery( this ).is( ":disabled" ) && + rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && + ( this.checked || !rcheckableType.test( type ) ); + } ) + .map( function( _i, elem ) { + var val = jQuery( this ).val(); + + if ( val == null ) { + return null; + } + + if ( Array.isArray( val ) ) { + return jQuery.map( val, function( val ) { + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ); + } + + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ).get(); + } +} ); + + +var + r20 = /%20/g, + rhash = /#.*$/, + rantiCache = /([?&])_=[^&]*/, + rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, + + // #7653, #8125, #8152: local protocol detection + rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, + rnoContent = /^(?:GET|HEAD)$/, + rprotocol = /^\/\//, + + /* Prefilters + * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) + * 2) These are called: + * - BEFORE asking for a transport + * - AFTER param serialization (s.data is a string if s.processData is true) + * 3) key is the dataType + * 4) the catchall symbol "*" can be used + * 5) execution will start with transport dataType and THEN continue down to "*" if needed + */ + prefilters = {}, + + /* Transports bindings + * 1) key is the dataType + * 2) the catchall symbol "*" can be used + * 3) selection will start with transport dataType and THEN go to "*" if needed + */ + transports = {}, + + // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression + allTypes = "*/".concat( "*" ), + + // Anchor tag for parsing the document origin + originAnchor = document.createElement( "a" ); + originAnchor.href = location.href; + +// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport +function addToPrefiltersOrTransports( structure ) { + + // dataTypeExpression is optional and defaults to "*" + return function( dataTypeExpression, func ) { + + if ( typeof dataTypeExpression !== "string" ) { + func = dataTypeExpression; + dataTypeExpression = "*"; + } + + var dataType, + i = 0, + dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; + + if ( isFunction( func ) ) { + + // For each dataType in the dataTypeExpression + while ( ( dataType = dataTypes[ i++ ] ) ) { + + // Prepend if requested + if ( dataType[ 0 ] === "+" ) { + dataType = dataType.slice( 1 ) || "*"; + ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); + + // Otherwise append + } else { + ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); + } + } + } + }; +} + +// Base inspection function for prefilters and transports +function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { + + var inspected = {}, + seekingTransport = ( structure === transports ); + + function inspect( dataType ) { + var selected; + inspected[ dataType ] = true; + jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { + var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); + if ( typeof dataTypeOrTransport === "string" && + !seekingTransport && !inspected[ dataTypeOrTransport ] ) { + + options.dataTypes.unshift( dataTypeOrTransport ); + inspect( dataTypeOrTransport ); + return false; + } else if ( seekingTransport ) { + return !( selected = dataTypeOrTransport ); + } + } ); + return selected; + } + + return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); +} + +// A special extend for ajax options +// that takes "flat" options (not to be deep extended) +// Fixes #9887 +function ajaxExtend( target, src ) { + var key, deep, + flatOptions = jQuery.ajaxSettings.flatOptions || {}; + + for ( key in src ) { + if ( src[ key ] !== undefined ) { + ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; + } + } + if ( deep ) { + jQuery.extend( true, target, deep ); + } + + return target; +} + +/* Handles responses to an ajax request: + * - finds the right dataType (mediates between content-type and expected dataType) + * - returns the corresponding response + */ +function ajaxHandleResponses( s, jqXHR, responses ) { + + var ct, type, finalDataType, firstDataType, + contents = s.contents, + dataTypes = s.dataTypes; + + // Remove auto dataType and get content-type in the process + while ( dataTypes[ 0 ] === "*" ) { + dataTypes.shift(); + if ( ct === undefined ) { + ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); + } + } + + // Check if we're dealing with a known content-type + if ( ct ) { + for ( type in contents ) { + if ( contents[ type ] && contents[ type ].test( ct ) ) { + dataTypes.unshift( type ); + break; + } + } + } + + // Check to see if we have a response for the expected dataType + if ( dataTypes[ 0 ] in responses ) { + finalDataType = dataTypes[ 0 ]; + } else { + + // Try convertible dataTypes + for ( type in responses ) { + if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { + finalDataType = type; + break; + } + if ( !firstDataType ) { + firstDataType = type; + } + } + + // Or just use first one + finalDataType = finalDataType || firstDataType; + } + + // If we found a dataType + // We add the dataType to the list if needed + // and return the corresponding response + if ( finalDataType ) { + if ( finalDataType !== dataTypes[ 0 ] ) { + dataTypes.unshift( finalDataType ); + } + return responses[ finalDataType ]; + } +} + +/* Chain conversions given the request and the original response + * Also sets the responseXXX fields on the jqXHR instance + */ +function ajaxConvert( s, response, jqXHR, isSuccess ) { + var conv2, current, conv, tmp, prev, + converters = {}, + + // Work with a copy of dataTypes in case we need to modify it for conversion + dataTypes = s.dataTypes.slice(); + + // Create converters map with lowercased keys + if ( dataTypes[ 1 ] ) { + for ( conv in s.converters ) { + converters[ conv.toLowerCase() ] = s.converters[ conv ]; + } + } + + current = dataTypes.shift(); + + // Convert to each sequential dataType + while ( current ) { + + if ( s.responseFields[ current ] ) { + jqXHR[ s.responseFields[ current ] ] = response; + } + + // Apply the dataFilter if provided + if ( !prev && isSuccess && s.dataFilter ) { + response = s.dataFilter( response, s.dataType ); + } + + prev = current; + current = dataTypes.shift(); + + if ( current ) { + + // There's only work to do if current dataType is non-auto + if ( current === "*" ) { + + current = prev; + + // Convert response if prev dataType is non-auto and differs from current + } else if ( prev !== "*" && prev !== current ) { + + // Seek a direct converter + conv = converters[ prev + " " + current ] || converters[ "* " + current ]; + + // If none found, seek a pair + if ( !conv ) { + for ( conv2 in converters ) { + + // If conv2 outputs current + tmp = conv2.split( " " ); + if ( tmp[ 1 ] === current ) { + + // If prev can be converted to accepted input + conv = converters[ prev + " " + tmp[ 0 ] ] || + converters[ "* " + tmp[ 0 ] ]; + if ( conv ) { + + // Condense equivalence converters + if ( conv === true ) { + conv = converters[ conv2 ]; + + // Otherwise, insert the intermediate dataType + } else if ( converters[ conv2 ] !== true ) { + current = tmp[ 0 ]; + dataTypes.unshift( tmp[ 1 ] ); + } + break; + } + } + } + } + + // Apply converter (if not an equivalence) + if ( conv !== true ) { + + // Unless errors are allowed to bubble, catch and return them + if ( conv && s.throws ) { + response = conv( response ); + } else { + try { + response = conv( response ); + } catch ( e ) { + return { + state: "parsererror", + error: conv ? e : "No conversion from " + prev + " to " + current + }; + } + } + } + } + } + } + + return { state: "success", data: response }; +} + +jQuery.extend( { + + // Counter for holding the number of active queries + active: 0, + + // Last-Modified header cache for next request + lastModified: {}, + etag: {}, + + ajaxSettings: { + url: location.href, + type: "GET", + isLocal: rlocalProtocol.test( location.protocol ), + global: true, + processData: true, + async: true, + contentType: "application/x-www-form-urlencoded; charset=UTF-8", + + /* + timeout: 0, + data: null, + dataType: null, + username: null, + password: null, + cache: null, + throws: false, + traditional: false, + headers: {}, + */ + + accepts: { + "*": allTypes, + text: "text/plain", + html: "text/html", + xml: "application/xml, text/xml", + json: "application/json, text/javascript" + }, + + contents: { + xml: /\bxml\b/, + html: /\bhtml/, + json: /\bjson\b/ + }, + + responseFields: { + xml: "responseXML", + text: "responseText", + json: "responseJSON" + }, + + // Data converters + // Keys separate source (or catchall "*") and destination types with a single space + converters: { + + // Convert anything to text + "* text": String, + + // Text to html (true = no transformation) + "text html": true, + + // Evaluate text as a json expression + "text json": JSON.parse, + + // Parse text as xml + "text xml": jQuery.parseXML + }, + + // For options that shouldn't be deep extended: + // you can add your own custom options here if + // and when you create one that shouldn't be + // deep extended (see ajaxExtend) + flatOptions: { + url: true, + context: true + } + }, + + // Creates a full fledged settings object into target + // with both ajaxSettings and settings fields. + // If target is omitted, writes into ajaxSettings. + ajaxSetup: function( target, settings ) { + return settings ? + + // Building a settings object + ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : + + // Extending ajaxSettings + ajaxExtend( jQuery.ajaxSettings, target ); + }, + + ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), + ajaxTransport: addToPrefiltersOrTransports( transports ), + + // Main method + ajax: function( url, options ) { + + // If url is an object, simulate pre-1.5 signature + if ( typeof url === "object" ) { + options = url; + url = undefined; + } + + // Force options to be an object + options = options || {}; + + var transport, + + // URL without anti-cache param + cacheURL, + + // Response headers + responseHeadersString, + responseHeaders, + + // timeout handle + timeoutTimer, + + // Url cleanup var + urlAnchor, + + // Request state (becomes false upon send and true upon completion) + completed, + + // To know if global events are to be dispatched + fireGlobals, + + // Loop variable + i, + + // uncached part of the url + uncached, + + // Create the final options object + s = jQuery.ajaxSetup( {}, options ), + + // Callbacks context + callbackContext = s.context || s, + + // Context for global events is callbackContext if it is a DOM node or jQuery collection + globalEventContext = s.context && + ( callbackContext.nodeType || callbackContext.jquery ) ? + jQuery( callbackContext ) : + jQuery.event, + + // Deferreds + deferred = jQuery.Deferred(), + completeDeferred = jQuery.Callbacks( "once memory" ), + + // Status-dependent callbacks + statusCode = s.statusCode || {}, + + // Headers (they are sent all at once) + requestHeaders = {}, + requestHeadersNames = {}, + + // Default abort message + strAbort = "canceled", + + // Fake xhr + jqXHR = { + readyState: 0, + + // Builds headers hashtable if needed + getResponseHeader: function( key ) { + var match; + if ( completed ) { + if ( !responseHeaders ) { + responseHeaders = {}; + while ( ( match = rheaders.exec( responseHeadersString ) ) ) { + responseHeaders[ match[ 1 ].toLowerCase() + " " ] = + ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) + .concat( match[ 2 ] ); + } + } + match = responseHeaders[ key.toLowerCase() + " " ]; + } + return match == null ? null : match.join( ", " ); + }, + + // Raw string + getAllResponseHeaders: function() { + return completed ? responseHeadersString : null; + }, + + // Caches the header + setRequestHeader: function( name, value ) { + if ( completed == null ) { + name = requestHeadersNames[ name.toLowerCase() ] = + requestHeadersNames[ name.toLowerCase() ] || name; + requestHeaders[ name ] = value; + } + return this; + }, + + // Overrides response content-type header + overrideMimeType: function( type ) { + if ( completed == null ) { + s.mimeType = type; + } + return this; + }, + + // Status-dependent callbacks + statusCode: function( map ) { + var code; + if ( map ) { + if ( completed ) { + + // Execute the appropriate callbacks + jqXHR.always( map[ jqXHR.status ] ); + } else { + + // Lazy-add the new callbacks in a way that preserves old ones + for ( code in map ) { + statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; + } + } + } + return this; + }, + + // Cancel the request + abort: function( statusText ) { + var finalText = statusText || strAbort; + if ( transport ) { + transport.abort( finalText ); + } + done( 0, finalText ); + return this; + } + }; + + // Attach deferreds + deferred.promise( jqXHR ); + + // Add protocol if not provided (prefilters might expect it) + // Handle falsy url in the settings object (#10093: consistency with old signature) + // We also use the url parameter if available + s.url = ( ( url || s.url || location.href ) + "" ) + .replace( rprotocol, location.protocol + "//" ); + + // Alias method option to type as per ticket #12004 + s.type = options.method || options.type || s.method || s.type; + + // Extract dataTypes list + s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; + + // A cross-domain request is in order when the origin doesn't match the current origin. + if ( s.crossDomain == null ) { + urlAnchor = document.createElement( "a" ); + + // Support: IE <=8 - 11, Edge 12 - 15 + // IE throws exception on accessing the href property if url is malformed, + // e.g. http://example.com:80x/ + try { + urlAnchor.href = s.url; + + // Support: IE <=8 - 11 only + // Anchor's host property isn't correctly set when s.url is relative + urlAnchor.href = urlAnchor.href; + s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== + urlAnchor.protocol + "//" + urlAnchor.host; + } catch ( e ) { + + // If there is an error parsing the URL, assume it is crossDomain, + // it can be rejected by the transport if it is invalid + s.crossDomain = true; + } + } + + // Convert data if not already a string + if ( s.data && s.processData && typeof s.data !== "string" ) { + s.data = jQuery.param( s.data, s.traditional ); + } + + // Apply prefilters + inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); + + // If request was aborted inside a prefilter, stop there + if ( completed ) { + return jqXHR; + } + + // We can fire global events as of now if asked to + // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) + fireGlobals = jQuery.event && s.global; + + // Watch for a new set of requests + if ( fireGlobals && jQuery.active++ === 0 ) { + jQuery.event.trigger( "ajaxStart" ); + } + + // Uppercase the type + s.type = s.type.toUpperCase(); + + // Determine if request has content + s.hasContent = !rnoContent.test( s.type ); + + // Save the URL in case we're toying with the If-Modified-Since + // and/or If-None-Match header later on + // Remove hash to simplify url manipulation + cacheURL = s.url.replace( rhash, "" ); + + // More options handling for requests with no content + if ( !s.hasContent ) { + + // Remember the hash so we can put it back + uncached = s.url.slice( cacheURL.length ); + + // If data is available and should be processed, append data to url + if ( s.data && ( s.processData || typeof s.data === "string" ) ) { + cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; + + // #9682: remove data so that it's not used in an eventual retry + delete s.data; + } + + // Add or update anti-cache param if needed + if ( s.cache === false ) { + cacheURL = cacheURL.replace( rantiCache, "$1" ); + uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + + uncached; + } + + // Put hash and anti-cache on the URL that will be requested (gh-1732) + s.url = cacheURL + uncached; + + // Change '%20' to '+' if this is encoded form body content (gh-2658) + } else if ( s.data && s.processData && + ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { + s.data = s.data.replace( r20, "+" ); + } + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + if ( jQuery.lastModified[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); + } + if ( jQuery.etag[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); + } + } + + // Set the correct header, if data is being sent + if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { + jqXHR.setRequestHeader( "Content-Type", s.contentType ); + } + + // Set the Accepts header for the server, depending on the dataType + jqXHR.setRequestHeader( + "Accept", + s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? + s.accepts[ s.dataTypes[ 0 ] ] + + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : + s.accepts[ "*" ] + ); + + // Check for headers option + for ( i in s.headers ) { + jqXHR.setRequestHeader( i, s.headers[ i ] ); + } + + // Allow custom headers/mimetypes and early abort + if ( s.beforeSend && + ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { + + // Abort if not done already and return + return jqXHR.abort(); + } + + // Aborting is no longer a cancellation + strAbort = "abort"; + + // Install callbacks on deferreds + completeDeferred.add( s.complete ); + jqXHR.done( s.success ); + jqXHR.fail( s.error ); + + // Get transport + transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); + + // If no transport, we auto-abort + if ( !transport ) { + done( -1, "No Transport" ); + } else { + jqXHR.readyState = 1; + + // Send global event + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); + } + + // If request was aborted inside ajaxSend, stop there + if ( completed ) { + return jqXHR; + } + + // Timeout + if ( s.async && s.timeout > 0 ) { + timeoutTimer = window.setTimeout( function() { + jqXHR.abort( "timeout" ); + }, s.timeout ); + } + + try { + completed = false; + transport.send( requestHeaders, done ); + } catch ( e ) { + + // Rethrow post-completion exceptions + if ( completed ) { + throw e; + } + + // Propagate others as results + done( -1, e ); + } + } + + // Callback for when everything is done + function done( status, nativeStatusText, responses, headers ) { + var isSuccess, success, error, response, modified, + statusText = nativeStatusText; + + // Ignore repeat invocations + if ( completed ) { + return; + } + + completed = true; + + // Clear timeout if it exists + if ( timeoutTimer ) { + window.clearTimeout( timeoutTimer ); + } + + // Dereference transport for early garbage collection + // (no matter how long the jqXHR object will be used) + transport = undefined; + + // Cache response headers + responseHeadersString = headers || ""; + + // Set readyState + jqXHR.readyState = status > 0 ? 4 : 0; + + // Determine if successful + isSuccess = status >= 200 && status < 300 || status === 304; + + // Get response data + if ( responses ) { + response = ajaxHandleResponses( s, jqXHR, responses ); + } + + // Use a noop converter for missing script + if ( !isSuccess && jQuery.inArray( "script", s.dataTypes ) > -1 ) { + s.converters[ "text script" ] = function() {}; + } + + // Convert no matter what (that way responseXXX fields are always set) + response = ajaxConvert( s, response, jqXHR, isSuccess ); + + // If successful, handle type chaining + if ( isSuccess ) { + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + modified = jqXHR.getResponseHeader( "Last-Modified" ); + if ( modified ) { + jQuery.lastModified[ cacheURL ] = modified; + } + modified = jqXHR.getResponseHeader( "etag" ); + if ( modified ) { + jQuery.etag[ cacheURL ] = modified; + } + } + + // if no content + if ( status === 204 || s.type === "HEAD" ) { + statusText = "nocontent"; + + // if not modified + } else if ( status === 304 ) { + statusText = "notmodified"; + + // If we have data, let's convert it + } else { + statusText = response.state; + success = response.data; + error = response.error; + isSuccess = !error; + } + } else { + + // Extract error from statusText and normalize for non-aborts + error = statusText; + if ( status || !statusText ) { + statusText = "error"; + if ( status < 0 ) { + status = 0; + } + } + } + + // Set data for the fake xhr object + jqXHR.status = status; + jqXHR.statusText = ( nativeStatusText || statusText ) + ""; + + // Success/Error + if ( isSuccess ) { + deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); + } else { + deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); + } + + // Status-dependent callbacks + jqXHR.statusCode( statusCode ); + statusCode = undefined; + + if ( fireGlobals ) { + globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", + [ jqXHR, s, isSuccess ? success : error ] ); + } + + // Complete + completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); + + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); + + // Handle the global AJAX counter + if ( !( --jQuery.active ) ) { + jQuery.event.trigger( "ajaxStop" ); + } + } + } + + return jqXHR; + }, + + getJSON: function( url, data, callback ) { + return jQuery.get( url, data, callback, "json" ); + }, + + getScript: function( url, callback ) { + return jQuery.get( url, undefined, callback, "script" ); + } +} ); + +jQuery.each( [ "get", "post" ], function( _i, method ) { + jQuery[ method ] = function( url, data, callback, type ) { + + // Shift arguments if data argument was omitted + if ( isFunction( data ) ) { + type = type || callback; + callback = data; + data = undefined; + } + + // The url can be an options object (which then must have .url) + return jQuery.ajax( jQuery.extend( { + url: url, + type: method, + dataType: type, + data: data, + success: callback + }, jQuery.isPlainObject( url ) && url ) ); + }; +} ); + +jQuery.ajaxPrefilter( function( s ) { + var i; + for ( i in s.headers ) { + if ( i.toLowerCase() === "content-type" ) { + s.contentType = s.headers[ i ] || ""; + } + } +} ); + + +jQuery._evalUrl = function( url, options, doc ) { + return jQuery.ajax( { + url: url, + + // Make this explicit, since user can override this through ajaxSetup (#11264) + type: "GET", + dataType: "script", + cache: true, + async: false, + global: false, + + // Only evaluate the response if it is successful (gh-4126) + // dataFilter is not invoked for failure responses, so using it instead + // of the default converter is kludgy but it works. + converters: { + "text script": function() {} + }, + dataFilter: function( response ) { + jQuery.globalEval( response, options, doc ); + } + } ); +}; + + +jQuery.fn.extend( { + wrapAll: function( html ) { + var wrap; + + if ( this[ 0 ] ) { + if ( isFunction( html ) ) { + html = html.call( this[ 0 ] ); + } + + // The elements to wrap the target around + wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); + + if ( this[ 0 ].parentNode ) { + wrap.insertBefore( this[ 0 ] ); + } + + wrap.map( function() { + var elem = this; + + while ( elem.firstElementChild ) { + elem = elem.firstElementChild; + } + + return elem; + } ).append( this ); + } + + return this; + }, + + wrapInner: function( html ) { + if ( isFunction( html ) ) { + return this.each( function( i ) { + jQuery( this ).wrapInner( html.call( this, i ) ); + } ); + } + + return this.each( function() { + var self = jQuery( this ), + contents = self.contents(); + + if ( contents.length ) { + contents.wrapAll( html ); + + } else { + self.append( html ); + } + } ); + }, + + wrap: function( html ) { + var htmlIsFunction = isFunction( html ); + + return this.each( function( i ) { + jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); + } ); + }, + + unwrap: function( selector ) { + this.parent( selector ).not( "body" ).each( function() { + jQuery( this ).replaceWith( this.childNodes ); + } ); + return this; + } +} ); + + +jQuery.expr.pseudos.hidden = function( elem ) { + return !jQuery.expr.pseudos.visible( elem ); +}; +jQuery.expr.pseudos.visible = function( elem ) { + return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); +}; + + + + +jQuery.ajaxSettings.xhr = function() { + try { + return new window.XMLHttpRequest(); + } catch ( e ) {} +}; + +var xhrSuccessStatus = { + + // File protocol always yields status code 0, assume 200 + 0: 200, + + // Support: IE <=9 only + // #1450: sometimes IE returns 1223 when it should be 204 + 1223: 204 + }, + xhrSupported = jQuery.ajaxSettings.xhr(); + +support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); +support.ajax = xhrSupported = !!xhrSupported; + +jQuery.ajaxTransport( function( options ) { + var callback, errorCallback; + + // Cross domain only allowed if supported through XMLHttpRequest + if ( support.cors || xhrSupported && !options.crossDomain ) { + return { + send: function( headers, complete ) { + var i, + xhr = options.xhr(); + + xhr.open( + options.type, + options.url, + options.async, + options.username, + options.password + ); + + // Apply custom fields if provided + if ( options.xhrFields ) { + for ( i in options.xhrFields ) { + xhr[ i ] = options.xhrFields[ i ]; + } + } + + // Override mime type if needed + if ( options.mimeType && xhr.overrideMimeType ) { + xhr.overrideMimeType( options.mimeType ); + } + + // X-Requested-With header + // For cross-domain requests, seeing as conditions for a preflight are + // akin to a jigsaw puzzle, we simply never set it to be sure. + // (it can always be set on a per-request basis or even using ajaxSetup) + // For same-domain requests, won't change header if already provided. + if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { + headers[ "X-Requested-With" ] = "XMLHttpRequest"; + } + + // Set headers + for ( i in headers ) { + xhr.setRequestHeader( i, headers[ i ] ); + } + + // Callback + callback = function( type ) { + return function() { + if ( callback ) { + callback = errorCallback = xhr.onload = + xhr.onerror = xhr.onabort = xhr.ontimeout = + xhr.onreadystatechange = null; + + if ( type === "abort" ) { + xhr.abort(); + } else if ( type === "error" ) { + + // Support: IE <=9 only + // On a manual native abort, IE9 throws + // errors on any property access that is not readyState + if ( typeof xhr.status !== "number" ) { + complete( 0, "error" ); + } else { + complete( + + // File: protocol always yields status 0; see #8605, #14207 + xhr.status, + xhr.statusText + ); + } + } else { + complete( + xhrSuccessStatus[ xhr.status ] || xhr.status, + xhr.statusText, + + // Support: IE <=9 only + // IE9 has no XHR2 but throws on binary (trac-11426) + // For XHR2 non-text, let the caller handle it (gh-2498) + ( xhr.responseType || "text" ) !== "text" || + typeof xhr.responseText !== "string" ? + { binary: xhr.response } : + { text: xhr.responseText }, + xhr.getAllResponseHeaders() + ); + } + } + }; + }; + + // Listen to events + xhr.onload = callback(); + errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); + + // Support: IE 9 only + // Use onreadystatechange to replace onabort + // to handle uncaught aborts + if ( xhr.onabort !== undefined ) { + xhr.onabort = errorCallback; + } else { + xhr.onreadystatechange = function() { + + // Check readyState before timeout as it changes + if ( xhr.readyState === 4 ) { + + // Allow onerror to be called first, + // but that will not handle a native abort + // Also, save errorCallback to a variable + // as xhr.onerror cannot be accessed + window.setTimeout( function() { + if ( callback ) { + errorCallback(); + } + } ); + } + }; + } + + // Create the abort callback + callback = callback( "abort" ); + + try { + + // Do send the request (this may raise an exception) + xhr.send( options.hasContent && options.data || null ); + } catch ( e ) { + + // #14683: Only rethrow if this hasn't been notified as an error yet + if ( callback ) { + throw e; + } + } + }, + + abort: function() { + if ( callback ) { + callback(); + } + } + }; + } +} ); + + + + +// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) +jQuery.ajaxPrefilter( function( s ) { + if ( s.crossDomain ) { + s.contents.script = false; + } +} ); + +// Install script dataType +jQuery.ajaxSetup( { + accepts: { + script: "text/javascript, application/javascript, " + + "application/ecmascript, application/x-ecmascript" + }, + contents: { + script: /\b(?:java|ecma)script\b/ + }, + converters: { + "text script": function( text ) { + jQuery.globalEval( text ); + return text; + } + } +} ); + +// Handle cache's special case and crossDomain +jQuery.ajaxPrefilter( "script", function( s ) { + if ( s.cache === undefined ) { + s.cache = false; + } + if ( s.crossDomain ) { + s.type = "GET"; + } +} ); + +// Bind script tag hack transport +jQuery.ajaxTransport( "script", function( s ) { + + // This transport only deals with cross domain or forced-by-attrs requests + if ( s.crossDomain || s.scriptAttrs ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( "\r\n"; + +// inject VBScript +document.write(IEBinaryToArray_ByteStr_Script); + +global.JSZipUtils._getBinaryFromXHR = function (xhr) { + var binary = xhr.responseBody; + var byteMapping = {}; + for ( var i = 0; i < 256; i++ ) { + for ( var j = 0; j < 256; j++ ) { + byteMapping[ String.fromCharCode( i + (j << 8) ) ] = + String.fromCharCode(i) + String.fromCharCode(j); + } + } + var rawBytes = IEBinaryToArray_ByteStr(binary); + var lastChr = IEBinaryToArray_ByteStr_Last(binary); + return rawBytes.replace(/[\s\S]/g, function( match ) { + return byteMapping[match]; + }) + lastChr; +}; + +// enforcing Stuk's coding style +// vim: set shiftwidth=4 softtabstop=4: + +},{}]},{},[1]) +; diff --git a/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils-ie.min.js b/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils-ie.min.js new file mode 100644 index 0000000..93d8bc8 --- /dev/null +++ b/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils-ie.min.js @@ -0,0 +1,10 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g\r\n";document.write(b),a.JSZipUtils._getBinaryFromXHR=function(a){for(var b=a.responseBody,c={},d=0;256>d;d++)for(var e=0;256>e;e++)c[String.fromCharCode(d+(e<<8))]=String.fromCharCode(d)+String.fromCharCode(e);var f=IEBinaryToArray_ByteStr(b),g=IEBinaryToArray_ByteStr_Last(b);return f.replace(/[\s\S]/g,function(a){return c[a]})+g}},{}]},{},[1]); diff --git a/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils.js b/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils.js new file mode 100644 index 0000000..775895e --- /dev/null +++ b/cvc5-1.0.2/api/java/jquery/jszip-utils/dist/jszip-utils.js @@ -0,0 +1,118 @@ +/*! + +JSZipUtils - A collection of cross-browser utilities to go along with JSZip. + + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(e){"object"==typeof exports?module.exports=e():"function"==typeof define&&define.amd?define(e):"undefined"!=typeof window?window.JSZipUtils=e():"undefined"!=typeof global?global.JSZipUtils=e():"undefined"!=typeof self&&(self.JSZipUtils=e())}(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);throw new Error("Cannot find module '"+o+"'")}var f=n[o]={exports:{}};t[o][0].call(f.exports,function(e){var n=t[o][1][e];return s(n?n:e)},f,f.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o + +(c) 2014 Stuart Knightley, David Duponchel +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip-utils/master/LICENSE.markdown. + +*/ +!function(a){"object"==typeof exports?module.exports=a():"function"==typeof define&&define.amd?define(a):"undefined"!=typeof window?window.JSZipUtils=a():"undefined"!=typeof global?global.JSZipUtils=a():"undefined"!=typeof self&&(self.JSZipUtils=a())}(function(){return function a(b,c,d){function e(g,h){if(!c[g]){if(!b[g]){var i="function"==typeof require&&require;if(!h&&i)return i(g,!0);if(f)return f(g,!0);throw new Error("Cannot find module '"+g+"'")}var j=c[g]={exports:{}};b[g][0].call(j.exports,function(a){var c=b[g][1][a];return e(c?c:a)},j,j.exports,a,b,c,d)}return c[g].exports}for(var f="function"==typeof require&&require,g=0;g + +(c) 2009-2016 Stuart Knightley +Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown. + +JSZip uses the library pako released under the MIT license : +https://github.com/nodeca/pako/blob/master/LICENSE +*/ + +(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.JSZip = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o> 2; + enc2 = ((chr1 & 3) << 4) | (chr2 >> 4); + enc3 = remainingBytes > 1 ? (((chr2 & 15) << 2) | (chr3 >> 6)) : 64; + enc4 = remainingBytes > 2 ? (chr3 & 63) : 64; + + output.push(_keyStr.charAt(enc1) + _keyStr.charAt(enc2) + _keyStr.charAt(enc3) + _keyStr.charAt(enc4)); + + } + + return output.join(""); +}; + +// public method for decoding +exports.decode = function(input) { + var chr1, chr2, chr3; + var enc1, enc2, enc3, enc4; + var i = 0, resultIndex = 0; + + var dataUrlPrefix = "data:"; + + if (input.substr(0, dataUrlPrefix.length) === dataUrlPrefix) { + // This is a common error: people give a data url + // (data:image/png;base64,iVBOR...) with a {base64: true} and + // wonders why things don't work. + // We can detect that the string input looks like a data url but we + // *can't* be sure it is one: removing everything up to the comma would + // be too dangerous. + throw new Error("Invalid base64 input, it looks like a data url."); + } + + input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); + + var totalLength = input.length * 3 / 4; + if(input.charAt(input.length - 1) === _keyStr.charAt(64)) { + totalLength--; + } + if(input.charAt(input.length - 2) === _keyStr.charAt(64)) { + totalLength--; + } + if (totalLength % 1 !== 0) { + // totalLength is not an integer, the length does not match a valid + // base64 content. That can happen if: + // - the input is not a base64 content + // - the input is *almost* a base64 content, with a extra chars at the + // beginning or at the end + // - the input uses a base64 variant (base64url for example) + throw new Error("Invalid base64 input, bad content length."); + } + var output; + if (support.uint8array) { + output = new Uint8Array(totalLength|0); + } else { + output = new Array(totalLength|0); + } + + while (i < input.length) { + + enc1 = _keyStr.indexOf(input.charAt(i++)); + enc2 = _keyStr.indexOf(input.charAt(i++)); + enc3 = _keyStr.indexOf(input.charAt(i++)); + enc4 = _keyStr.indexOf(input.charAt(i++)); + + chr1 = (enc1 << 2) | (enc2 >> 4); + chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); + chr3 = ((enc3 & 3) << 6) | enc4; + + output[resultIndex++] = chr1; + + if (enc3 !== 64) { + output[resultIndex++] = chr2; + } + if (enc4 !== 64) { + output[resultIndex++] = chr3; + } + + } + + return output; +}; + +},{"./support":30,"./utils":32}],2:[function(require,module,exports){ +'use strict'; + +var external = require("./external"); +var DataWorker = require('./stream/DataWorker'); +var Crc32Probe = require('./stream/Crc32Probe'); +var DataLengthProbe = require('./stream/DataLengthProbe'); + +/** + * Represent a compressed object, with everything needed to decompress it. + * @constructor + * @param {number} compressedSize the size of the data compressed. + * @param {number} uncompressedSize the size of the data after decompression. + * @param {number} crc32 the crc32 of the decompressed file. + * @param {object} compression the type of compression, see lib/compressions.js. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the compressed data. + */ +function CompressedObject(compressedSize, uncompressedSize, crc32, compression, data) { + this.compressedSize = compressedSize; + this.uncompressedSize = uncompressedSize; + this.crc32 = crc32; + this.compression = compression; + this.compressedContent = data; +} + +CompressedObject.prototype = { + /** + * Create a worker to get the uncompressed content. + * @return {GenericWorker} the worker. + */ + getContentWorker: function () { + var worker = new DataWorker(external.Promise.resolve(this.compressedContent)) + .pipe(this.compression.uncompressWorker()) + .pipe(new DataLengthProbe("data_length")); + + var that = this; + worker.on("end", function () { + if (this.streamInfo['data_length'] !== that.uncompressedSize) { + throw new Error("Bug : uncompressed data size mismatch"); + } + }); + return worker; + }, + /** + * Create a worker to get the compressed content. + * @return {GenericWorker} the worker. + */ + getCompressedWorker: function () { + return new DataWorker(external.Promise.resolve(this.compressedContent)) + .withStreamInfo("compressedSize", this.compressedSize) + .withStreamInfo("uncompressedSize", this.uncompressedSize) + .withStreamInfo("crc32", this.crc32) + .withStreamInfo("compression", this.compression) + ; + } +}; + +/** + * Chain the given worker with other workers to compress the content with the + * given compression. + * @param {GenericWorker} uncompressedWorker the worker to pipe. + * @param {Object} compression the compression object. + * @param {Object} compressionOptions the options to use when compressing. + * @return {GenericWorker} the new worker compressing the content. + */ +CompressedObject.createWorkerFrom = function (uncompressedWorker, compression, compressionOptions) { + return uncompressedWorker + .pipe(new Crc32Probe()) + .pipe(new DataLengthProbe("uncompressedSize")) + .pipe(compression.compressWorker(compressionOptions)) + .pipe(new DataLengthProbe("compressedSize")) + .withStreamInfo("compression", compression); +}; + +module.exports = CompressedObject; + +},{"./external":6,"./stream/Crc32Probe":25,"./stream/DataLengthProbe":26,"./stream/DataWorker":27}],3:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require("./stream/GenericWorker"); + +exports.STORE = { + magic: "\x00\x00", + compressWorker : function (compressionOptions) { + return new GenericWorker("STORE compression"); + }, + uncompressWorker : function () { + return new GenericWorker("STORE decompression"); + } +}; +exports.DEFLATE = require('./flate'); + +},{"./flate":7,"./stream/GenericWorker":28}],4:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); + +/** + * The following functions come from pako, from pako/lib/zlib/crc32.js + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Use ordinary array, since untyped makes no boost here +function makeTable() { + var c, table = []; + + for(var n =0; n < 256; n++){ + c = n; + for(var k =0; k < 8; k++){ + c = ((c&1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); + } + table[n] = c; + } + + return table; +} + +// Create table on load. Just 255 signed longs. Not a problem. +var crcTable = makeTable(); + + +function crc32(crc, buf, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +// That's all for the pako functions. + +/** + * Compute the crc32 of a string. + * This is almost the same as the function crc32, but for strings. Using the + * same function for the two use cases leads to horrible performances. + * @param {Number} crc the starting value of the crc. + * @param {String} str the string to use. + * @param {Number} len the length of the string. + * @param {Number} pos the starting position for the crc32 computation. + * @return {Number} the computed crc32. + */ +function crc32str(crc, str, len, pos) { + var t = crcTable, end = pos + len; + + crc = crc ^ (-1); + + for (var i = pos; i < end; i++ ) { + crc = (crc >>> 8) ^ t[(crc ^ str.charCodeAt(i)) & 0xFF]; + } + + return (crc ^ (-1)); // >>> 0; +} + +module.exports = function crc32wrapper(input, crc) { + if (typeof input === "undefined" || !input.length) { + return 0; + } + + var isArray = utils.getTypeOf(input) !== "string"; + + if(isArray) { + return crc32(crc|0, input, input.length, 0); + } else { + return crc32str(crc|0, input, input.length, 0); + } +}; + +},{"./utils":32}],5:[function(require,module,exports){ +'use strict'; +exports.base64 = false; +exports.binary = false; +exports.dir = false; +exports.createFolders = true; +exports.date = null; +exports.compression = null; +exports.compressionOptions = null; +exports.comment = null; +exports.unixPermissions = null; +exports.dosPermissions = null; + +},{}],6:[function(require,module,exports){ +/* global Promise */ +'use strict'; + +// load the global object first: +// - it should be better integrated in the system (unhandledRejection in node) +// - the environment may have a custom Promise implementation (see zone.js) +var ES6Promise = null; +if (typeof Promise !== "undefined") { + ES6Promise = Promise; +} else { + ES6Promise = require("lie"); +} + +/** + * Let the user use/change some implementations. + */ +module.exports = { + Promise: ES6Promise +}; + +},{"lie":37}],7:[function(require,module,exports){ +'use strict'; +var USE_TYPEDARRAY = (typeof Uint8Array !== 'undefined') && (typeof Uint16Array !== 'undefined') && (typeof Uint32Array !== 'undefined'); + +var pako = require("pako"); +var utils = require("./utils"); +var GenericWorker = require("./stream/GenericWorker"); + +var ARRAY_TYPE = USE_TYPEDARRAY ? "uint8array" : "array"; + +exports.magic = "\x08\x00"; + +/** + * Create a worker that uses pako to inflate/deflate. + * @constructor + * @param {String} action the name of the pako function to call : either "Deflate" or "Inflate". + * @param {Object} options the options to use when (de)compressing. + */ +function FlateWorker(action, options) { + GenericWorker.call(this, "FlateWorker/" + action); + + this._pako = null; + this._pakoAction = action; + this._pakoOptions = options; + // the `meta` object from the last chunk received + // this allow this worker to pass around metadata + this.meta = {}; +} + +utils.inherits(FlateWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +FlateWorker.prototype.processChunk = function (chunk) { + this.meta = chunk.meta; + if (this._pako === null) { + this._createPako(); + } + this._pako.push(utils.transformTo(ARRAY_TYPE, chunk.data), false); +}; + +/** + * @see GenericWorker.flush + */ +FlateWorker.prototype.flush = function () { + GenericWorker.prototype.flush.call(this); + if (this._pako === null) { + this._createPako(); + } + this._pako.push([], true); +}; +/** + * @see GenericWorker.cleanUp + */ +FlateWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this._pako = null; +}; + +/** + * Create the _pako object. + * TODO: lazy-loading this object isn't the best solution but it's the + * quickest. The best solution is to lazy-load the worker list. See also the + * issue #446. + */ +FlateWorker.prototype._createPako = function () { + this._pako = new pako[this._pakoAction]({ + raw: true, + level: this._pakoOptions.level || -1 // default compression + }); + var self = this; + this._pako.onData = function(data) { + self.push({ + data : data, + meta : self.meta + }); + }; +}; + +exports.compressWorker = function (compressionOptions) { + return new FlateWorker("Deflate", compressionOptions); +}; +exports.uncompressWorker = function () { + return new FlateWorker("Inflate", {}); +}; + +},{"./stream/GenericWorker":28,"./utils":32,"pako":38}],8:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); +var utf8 = require('../utf8'); +var crc32 = require('../crc32'); +var signature = require('../signature'); + +/** + * Transform an integer into a string in hexadecimal. + * @private + * @param {number} dec the number to convert. + * @param {number} bytes the number of bytes to generate. + * @returns {string} the result. + */ +var decToHex = function(dec, bytes) { + var hex = "", i; + for (i = 0; i < bytes; i++) { + hex += String.fromCharCode(dec & 0xff); + dec = dec >>> 8; + } + return hex; +}; + +/** + * Generate the UNIX part of the external file attributes. + * @param {Object} unixPermissions the unix permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * adapted from http://unix.stackexchange.com/questions/14705/the-zip-formats-external-file-attribute : + * + * TTTTsstrwxrwxrwx0000000000ADVSHR + * ^^^^____________________________ file type, see zipinfo.c (UNX_*) + * ^^^_________________________ setuid, setgid, sticky + * ^^^^^^^^^________________ permissions + * ^^^^^^^^^^______ not used ? + * ^^^^^^ DOS attribute bits : Archive, Directory, Volume label, System file, Hidden, Read only + */ +var generateUnixExternalFileAttr = function (unixPermissions, isDir) { + + var result = unixPermissions; + if (!unixPermissions) { + // I can't use octal values in strict mode, hence the hexa. + // 040775 => 0x41fd + // 0100664 => 0x81b4 + result = isDir ? 0x41fd : 0x81b4; + } + return (result & 0xFFFF) << 16; +}; + +/** + * Generate the DOS part of the external file attributes. + * @param {Object} dosPermissions the dos permissions or null. + * @param {Boolean} isDir true if the entry is a directory, false otherwise. + * @return {Number} a 32 bit integer. + * + * Bit 0 Read-Only + * Bit 1 Hidden + * Bit 2 System + * Bit 3 Volume Label + * Bit 4 Directory + * Bit 5 Archive + */ +var generateDosExternalFileAttr = function (dosPermissions, isDir) { + + // the dir flag is already set for compatibility + return (dosPermissions || 0) & 0x3F; +}; + +/** + * Generate the various parts used in the construction of the final zip file. + * @param {Object} streamInfo the hash with information about the compressed file. + * @param {Boolean} streamedContent is the content streamed ? + * @param {Boolean} streamingEnded is the stream finished ? + * @param {number} offset the current offset from the start of the zip file. + * @param {String} platform let's pretend we are this platform (change platform dependents fields) + * @param {Function} encodeFileName the function to encode the file name / comment. + * @return {Object} the zip parts. + */ +var generateZipParts = function(streamInfo, streamedContent, streamingEnded, offset, platform, encodeFileName) { + var file = streamInfo['file'], + compression = streamInfo['compression'], + useCustomEncoding = encodeFileName !== utf8.utf8encode, + encodedFileName = utils.transformTo("string", encodeFileName(file.name)), + utfEncodedFileName = utils.transformTo("string", utf8.utf8encode(file.name)), + comment = file.comment, + encodedComment = utils.transformTo("string", encodeFileName(comment)), + utfEncodedComment = utils.transformTo("string", utf8.utf8encode(comment)), + useUTF8ForFileName = utfEncodedFileName.length !== file.name.length, + useUTF8ForComment = utfEncodedComment.length !== comment.length, + dosTime, + dosDate, + extraFields = "", + unicodePathExtraField = "", + unicodeCommentExtraField = "", + dir = file.dir, + date = file.date; + + + var dataInfo = { + crc32 : 0, + compressedSize : 0, + uncompressedSize : 0 + }; + + // if the content is streamed, the sizes/crc32 are only available AFTER + // the end of the stream. + if (!streamedContent || streamingEnded) { + dataInfo.crc32 = streamInfo['crc32']; + dataInfo.compressedSize = streamInfo['compressedSize']; + dataInfo.uncompressedSize = streamInfo['uncompressedSize']; + } + + var bitflag = 0; + if (streamedContent) { + // Bit 3: the sizes/crc32 are set to zero in the local header. + // The correct values are put in the data descriptor immediately + // following the compressed data. + bitflag |= 0x0008; + } + if (!useCustomEncoding && (useUTF8ForFileName || useUTF8ForComment)) { + // Bit 11: Language encoding flag (EFS). + bitflag |= 0x0800; + } + + + var extFileAttr = 0; + var versionMadeBy = 0; + if (dir) { + // dos or unix, we set the dos dir flag + extFileAttr |= 0x00010; + } + if(platform === "UNIX") { + versionMadeBy = 0x031E; // UNIX, version 3.0 + extFileAttr |= generateUnixExternalFileAttr(file.unixPermissions, dir); + } else { // DOS or other, fallback to DOS + versionMadeBy = 0x0014; // DOS, version 2.0 + extFileAttr |= generateDosExternalFileAttr(file.dosPermissions, dir); + } + + // date + // @see http://www.delorie.com/djgpp/doc/rbinter/it/52/13.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/65/16.html + // @see http://www.delorie.com/djgpp/doc/rbinter/it/66/16.html + + dosTime = date.getUTCHours(); + dosTime = dosTime << 6; + dosTime = dosTime | date.getUTCMinutes(); + dosTime = dosTime << 5; + dosTime = dosTime | date.getUTCSeconds() / 2; + + dosDate = date.getUTCFullYear() - 1980; + dosDate = dosDate << 4; + dosDate = dosDate | (date.getUTCMonth() + 1); + dosDate = dosDate << 5; + dosDate = dosDate | date.getUTCDate(); + + if (useUTF8ForFileName) { + // set the unicode path extra field. unzip needs at least one extra + // field to correctly handle unicode path, so using the path is as good + // as any other information. This could improve the situation with + // other archive managers too. + // This field is usually used without the utf8 flag, with a non + // unicode path in the header (winrar, winzip). This helps (a bit) + // with the messy Windows' default compressed folders feature but + // breaks on p7zip which doesn't seek the unicode path extra field. + // So for now, UTF-8 everywhere ! + unicodePathExtraField = + // Version + decToHex(1, 1) + + // NameCRC32 + decToHex(crc32(encodedFileName), 4) + + // UnicodeName + utfEncodedFileName; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x70" + + // size + decToHex(unicodePathExtraField.length, 2) + + // content + unicodePathExtraField; + } + + if(useUTF8ForComment) { + + unicodeCommentExtraField = + // Version + decToHex(1, 1) + + // CommentCRC32 + decToHex(crc32(encodedComment), 4) + + // UnicodeName + utfEncodedComment; + + extraFields += + // Info-ZIP Unicode Path Extra Field + "\x75\x63" + + // size + decToHex(unicodeCommentExtraField.length, 2) + + // content + unicodeCommentExtraField; + } + + var header = ""; + + // version needed to extract + header += "\x0A\x00"; + // general purpose bit flag + header += decToHex(bitflag, 2); + // compression method + header += compression.magic; + // last mod file time + header += decToHex(dosTime, 2); + // last mod file date + header += decToHex(dosDate, 2); + // crc-32 + header += decToHex(dataInfo.crc32, 4); + // compressed size + header += decToHex(dataInfo.compressedSize, 4); + // uncompressed size + header += decToHex(dataInfo.uncompressedSize, 4); + // file name length + header += decToHex(encodedFileName.length, 2); + // extra field length + header += decToHex(extraFields.length, 2); + + + var fileRecord = signature.LOCAL_FILE_HEADER + header + encodedFileName + extraFields; + + var dirRecord = signature.CENTRAL_FILE_HEADER + + // version made by (00: DOS) + decToHex(versionMadeBy, 2) + + // file header (common to file and central directory) + header + + // file comment length + decToHex(encodedComment.length, 2) + + // disk number start + "\x00\x00" + + // internal file attributes TODO + "\x00\x00" + + // external file attributes + decToHex(extFileAttr, 4) + + // relative offset of local header + decToHex(offset, 4) + + // file name + encodedFileName + + // extra field + extraFields + + // file comment + encodedComment; + + return { + fileRecord: fileRecord, + dirRecord: dirRecord + }; +}; + +/** + * Generate the EOCD record. + * @param {Number} entriesCount the number of entries in the zip file. + * @param {Number} centralDirLength the length (in bytes) of the central dir. + * @param {Number} localDirLength the length (in bytes) of the local dir. + * @param {String} comment the zip file comment as a binary string. + * @param {Function} encodeFileName the function to encode the comment. + * @return {String} the EOCD record. + */ +var generateCentralDirectoryEnd = function (entriesCount, centralDirLength, localDirLength, comment, encodeFileName) { + var dirEnd = ""; + var encodedComment = utils.transformTo("string", encodeFileName(comment)); + + // end of central dir signature + dirEnd = signature.CENTRAL_DIRECTORY_END + + // number of this disk + "\x00\x00" + + // number of the disk with the start of the central directory + "\x00\x00" + + // total number of entries in the central directory on this disk + decToHex(entriesCount, 2) + + // total number of entries in the central directory + decToHex(entriesCount, 2) + + // size of the central directory 4 bytes + decToHex(centralDirLength, 4) + + // offset of start of central directory with respect to the starting disk number + decToHex(localDirLength, 4) + + // .ZIP file comment length + decToHex(encodedComment.length, 2) + + // .ZIP file comment + encodedComment; + + return dirEnd; +}; + +/** + * Generate data descriptors for a file entry. + * @param {Object} streamInfo the hash generated by a worker, containing information + * on the file entry. + * @return {String} the data descriptors. + */ +var generateDataDescriptors = function (streamInfo) { + var descriptor = ""; + descriptor = signature.DATA_DESCRIPTOR + + // crc-32 4 bytes + decToHex(streamInfo['crc32'], 4) + + // compressed size 4 bytes + decToHex(streamInfo['compressedSize'], 4) + + // uncompressed size 4 bytes + decToHex(streamInfo['uncompressedSize'], 4); + + return descriptor; +}; + + +/** + * A worker to concatenate other workers to create a zip file. + * @param {Boolean} streamFiles `true` to stream the content of the files, + * `false` to accumulate it. + * @param {String} comment the comment to use. + * @param {String} platform the platform to use, "UNIX" or "DOS". + * @param {Function} encodeFileName the function to encode file names and comments. + */ +function ZipFileWorker(streamFiles, comment, platform, encodeFileName) { + GenericWorker.call(this, "ZipFileWorker"); + // The number of bytes written so far. This doesn't count accumulated chunks. + this.bytesWritten = 0; + // The comment of the zip file + this.zipComment = comment; + // The platform "generating" the zip file. + this.zipPlatform = platform; + // the function to encode file names and comments. + this.encodeFileName = encodeFileName; + // Should we stream the content of the files ? + this.streamFiles = streamFiles; + // If `streamFiles` is false, we will need to accumulate the content of the + // files to calculate sizes / crc32 (and write them *before* the content). + // This boolean indicates if we are accumulating chunks (it will change a lot + // during the lifetime of this worker). + this.accumulate = false; + // The buffer receiving chunks when accumulating content. + this.contentBuffer = []; + // The list of generated directory records. + this.dirRecords = []; + // The offset (in bytes) from the beginning of the zip file for the current source. + this.currentSourceOffset = 0; + // The total number of entries in this zip file. + this.entriesCount = 0; + // the name of the file currently being added, null when handling the end of the zip file. + // Used for the emitted metadata. + this.currentFile = null; + + + + this._sources = []; +} +utils.inherits(ZipFileWorker, GenericWorker); + +/** + * @see GenericWorker.push + */ +ZipFileWorker.prototype.push = function (chunk) { + + var currentFilePercent = chunk.meta.percent || 0; + var entriesCount = this.entriesCount; + var remainingFiles = this._sources.length; + + if(this.accumulate) { + this.contentBuffer.push(chunk); + } else { + this.bytesWritten += chunk.data.length; + + GenericWorker.prototype.push.call(this, { + data : chunk.data, + meta : { + currentFile : this.currentFile, + percent : entriesCount ? (currentFilePercent + 100 * (entriesCount - remainingFiles - 1)) / entriesCount : 100 + } + }); + } +}; + +/** + * The worker started a new source (an other worker). + * @param {Object} streamInfo the streamInfo object from the new source. + */ +ZipFileWorker.prototype.openedSource = function (streamInfo) { + this.currentSourceOffset = this.bytesWritten; + this.currentFile = streamInfo['file'].name; + + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + + // don't stream folders (because they don't have any content) + if(streamedContent) { + var record = generateZipParts(streamInfo, streamedContent, false, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + } else { + // we need to wait for the whole file before pushing anything + this.accumulate = true; + } +}; + +/** + * The worker finished a source (an other worker). + * @param {Object} streamInfo the streamInfo object from the finished source. + */ +ZipFileWorker.prototype.closedSource = function (streamInfo) { + this.accumulate = false; + var streamedContent = this.streamFiles && !streamInfo['file'].dir; + var record = generateZipParts(streamInfo, streamedContent, true, this.currentSourceOffset, this.zipPlatform, this.encodeFileName); + + this.dirRecords.push(record.dirRecord); + if(streamedContent) { + // after the streamed file, we put data descriptors + this.push({ + data : generateDataDescriptors(streamInfo), + meta : {percent:100} + }); + } else { + // the content wasn't streamed, we need to push everything now + // first the file record, then the content + this.push({ + data : record.fileRecord, + meta : {percent:0} + }); + while(this.contentBuffer.length) { + this.push(this.contentBuffer.shift()); + } + } + this.currentFile = null; +}; + +/** + * @see GenericWorker.flush + */ +ZipFileWorker.prototype.flush = function () { + + var localDirLength = this.bytesWritten; + for(var i = 0; i < this.dirRecords.length; i++) { + this.push({ + data : this.dirRecords[i], + meta : {percent:100} + }); + } + var centralDirLength = this.bytesWritten - localDirLength; + + var dirEnd = generateCentralDirectoryEnd(this.dirRecords.length, centralDirLength, localDirLength, this.zipComment, this.encodeFileName); + + this.push({ + data : dirEnd, + meta : {percent:100} + }); +}; + +/** + * Prepare the next source to be read. + */ +ZipFileWorker.prototype.prepareNextSource = function () { + this.previous = this._sources.shift(); + this.openedSource(this.previous.streamInfo); + if (this.isPaused) { + this.previous.pause(); + } else { + this.previous.resume(); + } +}; + +/** + * @see GenericWorker.registerPrevious + */ +ZipFileWorker.prototype.registerPrevious = function (previous) { + this._sources.push(previous); + var self = this; + + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.closedSource(self.previous.streamInfo); + if(self._sources.length) { + self.prepareNextSource(); + } else { + self.end(); + } + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; +}; + +/** + * @see GenericWorker.resume + */ +ZipFileWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this.previous && this._sources.length) { + this.prepareNextSource(); + return true; + } + if (!this.previous && !this._sources.length && !this.generatedError) { + this.end(); + return true; + } +}; + +/** + * @see GenericWorker.error + */ +ZipFileWorker.prototype.error = function (e) { + var sources = this._sources; + if(!GenericWorker.prototype.error.call(this, e)) { + return false; + } + for(var i = 0; i < sources.length; i++) { + try { + sources[i].error(e); + } catch(e) { + // the `error` exploded, nothing to do + } + } + return true; +}; + +/** + * @see GenericWorker.lock + */ +ZipFileWorker.prototype.lock = function () { + GenericWorker.prototype.lock.call(this); + var sources = this._sources; + for(var i = 0; i < sources.length; i++) { + sources[i].lock(); + } +}; + +module.exports = ZipFileWorker; + +},{"../crc32":4,"../signature":23,"../stream/GenericWorker":28,"../utf8":31,"../utils":32}],9:[function(require,module,exports){ +'use strict'; + +var compressions = require('../compressions'); +var ZipFileWorker = require('./ZipFileWorker'); + +/** + * Find the compression to use. + * @param {String} fileCompression the compression defined at the file level, if any. + * @param {String} zipCompression the compression defined at the load() level. + * @return {Object} the compression object to use. + */ +var getCompression = function (fileCompression, zipCompression) { + + var compressionName = fileCompression || zipCompression; + var compression = compressions[compressionName]; + if (!compression) { + throw new Error(compressionName + " is not a valid compression method !"); + } + return compression; +}; + +/** + * Create a worker to generate a zip file. + * @param {JSZip} zip the JSZip instance at the right root level. + * @param {Object} options to generate the zip file. + * @param {String} comment the comment to use. + */ +exports.generateWorker = function (zip, options, comment) { + + var zipFileWorker = new ZipFileWorker(options.streamFiles, comment, options.platform, options.encodeFileName); + var entriesCount = 0; + try { + + zip.forEach(function (relativePath, file) { + entriesCount++; + var compression = getCompression(file.options.compression, options.compression); + var compressionOptions = file.options.compressionOptions || options.compressionOptions || {}; + var dir = file.dir, date = file.date; + + file._compressWorker(compression, compressionOptions) + .withStreamInfo("file", { + name : relativePath, + dir : dir, + date : date, + comment : file.comment || "", + unixPermissions : file.unixPermissions, + dosPermissions : file.dosPermissions + }) + .pipe(zipFileWorker); + }); + zipFileWorker.entriesCount = entriesCount; + } catch (e) { + zipFileWorker.error(e); + } + + return zipFileWorker; +}; + +},{"../compressions":3,"./ZipFileWorker":8}],10:[function(require,module,exports){ +'use strict'; + +/** + * Representation a of zip file in js + * @constructor + */ +function JSZip() { + // if this constructor is used without `new`, it adds `new` before itself: + if(!(this instanceof JSZip)) { + return new JSZip(); + } + + if(arguments.length) { + throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide."); + } + + // object containing the files : + // { + // "folder/" : {...}, + // "folder/data.txt" : {...} + // } + // NOTE: we use a null prototype because we do not + // want filenames like "toString" coming from a zip file + // to overwrite methods and attributes in a normal Object. + this.files = Object.create(null); + + this.comment = null; + + // Where we are in the hierarchy + this.root = ""; + this.clone = function() { + var newObj = new JSZip(); + for (var i in this) { + if (typeof this[i] !== "function") { + newObj[i] = this[i]; + } + } + return newObj; + }; +} +JSZip.prototype = require('./object'); +JSZip.prototype.loadAsync = require('./load'); +JSZip.support = require('./support'); +JSZip.defaults = require('./defaults'); + +// TODO find a better way to handle this version, +// a require('package.json').version doesn't work with webpack, see #327 +JSZip.version = "3.7.1"; + +JSZip.loadAsync = function (content, options) { + return new JSZip().loadAsync(content, options); +}; + +JSZip.external = require("./external"); +module.exports = JSZip; + +},{"./defaults":5,"./external":6,"./load":11,"./object":15,"./support":30}],11:[function(require,module,exports){ +'use strict'; +var utils = require('./utils'); +var external = require("./external"); +var utf8 = require('./utf8'); +var ZipEntries = require('./zipEntries'); +var Crc32Probe = require('./stream/Crc32Probe'); +var nodejsUtils = require("./nodejsUtils"); + +/** + * Check the CRC32 of an entry. + * @param {ZipEntry} zipEntry the zip entry to check. + * @return {Promise} the result. + */ +function checkEntryCRC32(zipEntry) { + return new external.Promise(function (resolve, reject) { + var worker = zipEntry.decompressed.getContentWorker().pipe(new Crc32Probe()); + worker.on("error", function (e) { + reject(e); + }) + .on("end", function () { + if (worker.streamInfo.crc32 !== zipEntry.decompressed.crc32) { + reject(new Error("Corrupted zip : CRC32 mismatch")); + } else { + resolve(); + } + }) + .resume(); + }); +} + +module.exports = function (data, options) { + var zip = this; + options = utils.extend(options || {}, { + base64: false, + checkCRC32: false, + optimizedBinaryString: false, + createFolders: false, + decodeFileName: utf8.utf8decode + }); + + if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + return external.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")); + } + + return utils.prepareContent("the loaded zip file", data, true, options.optimizedBinaryString, options.base64) + .then(function (data) { + var zipEntries = new ZipEntries(options); + zipEntries.load(data); + return zipEntries; + }).then(function checkCRC32(zipEntries) { + var promises = [external.Promise.resolve(zipEntries)]; + var files = zipEntries.files; + if (options.checkCRC32) { + for (var i = 0; i < files.length; i++) { + promises.push(checkEntryCRC32(files[i])); + } + } + return external.Promise.all(promises); + }).then(function addFiles(results) { + var zipEntries = results.shift(); + var files = zipEntries.files; + for (var i = 0; i < files.length; i++) { + var input = files[i]; + zip.file(input.fileNameStr, input.decompressed, { + binary: true, + optimizedBinaryString: true, + date: input.date, + dir: input.dir, + comment: input.fileCommentStr.length ? input.fileCommentStr : null, + unixPermissions: input.unixPermissions, + dosPermissions: input.dosPermissions, + createFolders: options.createFolders + }); + } + if (zipEntries.zipComment.length) { + zip.comment = zipEntries.zipComment; + } + + return zip; + }); +}; + +},{"./external":6,"./nodejsUtils":14,"./stream/Crc32Probe":25,"./utf8":31,"./utils":32,"./zipEntries":33}],12:[function(require,module,exports){ +"use strict"; + +var utils = require('../utils'); +var GenericWorker = require('../stream/GenericWorker'); + +/** + * A worker that use a nodejs stream as source. + * @constructor + * @param {String} filename the name of the file entry for this stream. + * @param {Readable} stream the nodejs stream. + */ +function NodejsStreamInputAdapter(filename, stream) { + GenericWorker.call(this, "Nodejs stream input adapter for " + filename); + this._upstreamEnded = false; + this._bindStream(stream); +} + +utils.inherits(NodejsStreamInputAdapter, GenericWorker); + +/** + * Prepare the stream and bind the callbacks on it. + * Do this ASAP on node 0.10 ! A lazy binding doesn't always work. + * @param {Stream} stream the nodejs stream to use. + */ +NodejsStreamInputAdapter.prototype._bindStream = function (stream) { + var self = this; + this._stream = stream; + stream.pause(); + stream + .on("data", function (chunk) { + self.push({ + data: chunk, + meta : { + percent : 0 + } + }); + }) + .on("error", function (e) { + if(self.isPaused) { + this.generatedError = e; + } else { + self.error(e); + } + }) + .on("end", function () { + if(self.isPaused) { + self._upstreamEnded = true; + } else { + self.end(); + } + }); +}; +NodejsStreamInputAdapter.prototype.pause = function () { + if(!GenericWorker.prototype.pause.call(this)) { + return false; + } + this._stream.pause(); + return true; +}; +NodejsStreamInputAdapter.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if(this._upstreamEnded) { + this.end(); + } else { + this._stream.resume(); + } + + return true; +}; + +module.exports = NodejsStreamInputAdapter; + +},{"../stream/GenericWorker":28,"../utils":32}],13:[function(require,module,exports){ +'use strict'; + +var Readable = require('readable-stream').Readable; + +var utils = require('../utils'); +utils.inherits(NodejsStreamOutputAdapter, Readable); + +/** +* A nodejs stream using a worker as source. +* @see the SourceWrapper in http://nodejs.org/api/stream.html +* @constructor +* @param {StreamHelper} helper the helper wrapping the worker +* @param {Object} options the nodejs stream options +* @param {Function} updateCb the update callback. +*/ +function NodejsStreamOutputAdapter(helper, options, updateCb) { + Readable.call(this, options); + this._helper = helper; + + var self = this; + helper.on("data", function (data, meta) { + if (!self.push(data)) { + self._helper.pause(); + } + if(updateCb) { + updateCb(meta); + } + }) + .on("error", function(e) { + self.emit('error', e); + }) + .on("end", function () { + self.push(null); + }); +} + + +NodejsStreamOutputAdapter.prototype._read = function() { + this._helper.resume(); +}; + +module.exports = NodejsStreamOutputAdapter; + +},{"../utils":32,"readable-stream":16}],14:[function(require,module,exports){ +'use strict'; + +module.exports = { + /** + * True if this is running in Nodejs, will be undefined in a browser. + * In a browser, browserify won't include this file and the whole module + * will be resolved an empty object. + */ + isNode : typeof Buffer !== "undefined", + /** + * Create a new nodejs Buffer from an existing content. + * @param {Object} data the data to pass to the constructor. + * @param {String} encoding the encoding to use. + * @return {Buffer} a new Buffer. + */ + newBufferFrom: function(data, encoding) { + if (Buffer.from && Buffer.from !== Uint8Array.from) { + return Buffer.from(data, encoding); + } else { + if (typeof data === "number") { + // Safeguard for old Node.js versions. On newer versions, + // Buffer.from(number) / Buffer(number, encoding) already throw. + throw new Error("The \"data\" argument must not be a number"); + } + return new Buffer(data, encoding); + } + }, + /** + * Create a new nodejs Buffer with the specified size. + * @param {Integer} size the size of the buffer. + * @return {Buffer} a new Buffer. + */ + allocBuffer: function (size) { + if (Buffer.alloc) { + return Buffer.alloc(size); + } else { + var buf = new Buffer(size); + buf.fill(0); + return buf; + } + }, + /** + * Find out if an object is a Buffer. + * @param {Object} b the object to test. + * @return {Boolean} true if the object is a Buffer, false otherwise. + */ + isBuffer : function(b){ + return Buffer.isBuffer(b); + }, + + isStream : function (obj) { + return obj && + typeof obj.on === "function" && + typeof obj.pause === "function" && + typeof obj.resume === "function"; + } +}; + +},{}],15:[function(require,module,exports){ +'use strict'; +var utf8 = require('./utf8'); +var utils = require('./utils'); +var GenericWorker = require('./stream/GenericWorker'); +var StreamHelper = require('./stream/StreamHelper'); +var defaults = require('./defaults'); +var CompressedObject = require('./compressedObject'); +var ZipObject = require('./zipObject'); +var generate = require("./generate"); +var nodejsUtils = require("./nodejsUtils"); +var NodejsStreamInputAdapter = require("./nodejs/NodejsStreamInputAdapter"); + + +/** + * Add a file in the current folder. + * @private + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data of the file + * @param {Object} originalOptions the options of the file + * @return {Object} the new file. + */ +var fileAdd = function(name, data, originalOptions) { + // be sure sub folders exist + var dataType = utils.getTypeOf(data), + parent; + + + /* + * Correct options. + */ + + var o = utils.extend(originalOptions || {}, defaults); + o.date = o.date || new Date(); + if (o.compression !== null) { + o.compression = o.compression.toUpperCase(); + } + + if (typeof o.unixPermissions === "string") { + o.unixPermissions = parseInt(o.unixPermissions, 8); + } + + // UNX_IFDIR 0040000 see zipinfo.c + if (o.unixPermissions && (o.unixPermissions & 0x4000)) { + o.dir = true; + } + // Bit 4 Directory + if (o.dosPermissions && (o.dosPermissions & 0x0010)) { + o.dir = true; + } + + if (o.dir) { + name = forceTrailingSlash(name); + } + if (o.createFolders && (parent = parentFolder(name))) { + folderAdd.call(this, parent, true); + } + + var isUnicodeString = dataType === "string" && o.binary === false && o.base64 === false; + if (!originalOptions || typeof originalOptions.binary === "undefined") { + o.binary = !isUnicodeString; + } + + + var isCompressedEmpty = (data instanceof CompressedObject) && data.uncompressedSize === 0; + + if (isCompressedEmpty || o.dir || !data || data.length === 0) { + o.base64 = false; + o.binary = true; + data = ""; + o.compression = "STORE"; + dataType = "string"; + } + + /* + * Convert content to fit. + */ + + var zipObjectContent = null; + if (data instanceof CompressedObject || data instanceof GenericWorker) { + zipObjectContent = data; + } else if (nodejsUtils.isNode && nodejsUtils.isStream(data)) { + zipObjectContent = new NodejsStreamInputAdapter(name, data); + } else { + zipObjectContent = utils.prepareContent(name, data, o.binary, o.optimizedBinaryString, o.base64); + } + + var object = new ZipObject(name, zipObjectContent, o); + this.files[name] = object; + /* + TODO: we can't throw an exception because we have async promises + (we can have a promise of a Date() for example) but returning a + promise is useless because file(name, data) returns the JSZip + object for chaining. Should we break that to allow the user + to catch the error ? + + return external.Promise.resolve(zipObjectContent) + .then(function () { + return object; + }); + */ +}; + +/** + * Find the parent folder of the path. + * @private + * @param {string} path the path to use + * @return {string} the parent folder, or "" + */ +var parentFolder = function (path) { + if (path.slice(-1) === '/') { + path = path.substring(0, path.length - 1); + } + var lastSlash = path.lastIndexOf('/'); + return (lastSlash > 0) ? path.substring(0, lastSlash) : ""; +}; + +/** + * Returns the path with a slash at the end. + * @private + * @param {String} path the path to check. + * @return {String} the path with a trailing slash. + */ +var forceTrailingSlash = function(path) { + // Check the name ends with a / + if (path.slice(-1) !== "/") { + path += "/"; // IE doesn't like substr(-1) + } + return path; +}; + +/** + * Add a (sub) folder in the current folder. + * @private + * @param {string} name the folder's name + * @param {boolean=} [createFolders] If true, automatically create sub + * folders. Defaults to false. + * @return {Object} the new folder. + */ +var folderAdd = function(name, createFolders) { + createFolders = (typeof createFolders !== 'undefined') ? createFolders : defaults.createFolders; + + name = forceTrailingSlash(name); + + // Does this folder already exist? + if (!this.files[name]) { + fileAdd.call(this, name, null, { + dir: true, + createFolders: createFolders + }); + } + return this.files[name]; +}; + +/** +* Cross-window, cross-Node-context regular expression detection +* @param {Object} object Anything +* @return {Boolean} true if the object is a regular expression, +* false otherwise +*/ +function isRegExp(object) { + return Object.prototype.toString.call(object) === "[object RegExp]"; +} + +// return the actual prototype of JSZip +var out = { + /** + * @see loadAsync + */ + load: function() { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + + /** + * Call a callback function for each entry at this folder level. + * @param {Function} cb the callback function: + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + */ + forEach: function(cb) { + var filename, relativePath, file; + /* jshint ignore:start */ + // ignore warning about unwanted properties because this.files is a null prototype object + for (filename in this.files) { + file = this.files[filename]; + relativePath = filename.slice(this.root.length, filename.length); + if (relativePath && filename.slice(0, this.root.length) === this.root) { // the file is in the current root + cb(relativePath, file); // TODO reverse the parameters ? need to be clean AND consistent with the filter search fn... + } + } + /* jshint ignore:end */ + }, + + /** + * Filter nested files/folders with the specified function. + * @param {Function} search the predicate to use : + * function (relativePath, file) {...} + * It takes 2 arguments : the relative path and the file. + * @return {Array} An array of matching elements. + */ + filter: function(search) { + var result = []; + this.forEach(function (relativePath, entry) { + if (search(relativePath, entry)) { // the file matches the function + result.push(entry); + } + + }); + return result; + }, + + /** + * Add a file to the zip file, or search a file. + * @param {string|RegExp} name The name of the file to add (if data is defined), + * the name of the file to find (if no data) or a regex to match files. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data The file data, either raw or base64 encoded + * @param {Object} o File options + * @return {JSZip|Object|Array} this JSZip object (when adding a file), + * a file (when searching by string) or an array of files (when searching by regex). + */ + file: function(name, data, o) { + if (arguments.length === 1) { + if (isRegExp(name)) { + var regexp = name; + return this.filter(function(relativePath, file) { + return !file.dir && regexp.test(relativePath); + }); + } + else { // text + var obj = this.files[this.root + name]; + if (obj && !obj.dir) { + return obj; + } else { + return null; + } + } + } + else { // more than one argument : we have data ! + name = this.root + name; + fileAdd.call(this, name, data, o); + } + return this; + }, + + /** + * Add a directory to the zip file, or search. + * @param {String|RegExp} arg The name of the directory to add, or a regex to search folders. + * @return {JSZip} an object with the new directory as the root, or an array containing matching folders. + */ + folder: function(arg) { + if (!arg) { + return this; + } + + if (isRegExp(arg)) { + return this.filter(function(relativePath, file) { + return file.dir && arg.test(relativePath); + }); + } + + // else, name is a new folder + var name = this.root + arg; + var newFolder = folderAdd.call(this, name); + + // Allow chaining by returning a new object with this folder as the root + var ret = this.clone(); + ret.root = newFolder.name; + return ret; + }, + + /** + * Delete a file, or a directory and all sub-files, from the zip + * @param {string} name the name of the file to delete + * @return {JSZip} this JSZip object + */ + remove: function(name) { + name = this.root + name; + var file = this.files[name]; + if (!file) { + // Look for any folders + if (name.slice(-1) !== "/") { + name += "/"; + } + file = this.files[name]; + } + + if (file && !file.dir) { + // file + delete this.files[name]; + } else { + // maybe a folder, delete recursively + var kids = this.filter(function(relativePath, file) { + return file.name.slice(0, name.length) === name; + }); + for (var i = 0; i < kids.length; i++) { + delete this.files[kids[i].name]; + } + } + + return this; + }, + + /** + * Generate the complete zip file + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the zip file + */ + generate: function(options) { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); + }, + + /** + * Generate the complete zip file as an internal stream. + * @param {Object} options the options to generate the zip file : + * - compression, "STORE" by default. + * - type, "base64" by default. Values are : string, base64, uint8array, arraybuffer, blob. + * @return {StreamHelper} the streamed zip file. + */ + generateInternalStream: function(options) { + var worker, opts = {}; + try { + opts = utils.extend(options || {}, { + streamFiles: false, + compression: "STORE", + compressionOptions : null, + type: "", + platform: "DOS", + comment: null, + mimeType: 'application/zip', + encodeFileName: utf8.utf8encode + }); + + opts.type = opts.type.toLowerCase(); + opts.compression = opts.compression.toUpperCase(); + + // "binarystring" is preferred but the internals use "string". + if(opts.type === "binarystring") { + opts.type = "string"; + } + + if (!opts.type) { + throw new Error("No output type specified."); + } + + utils.checkSupport(opts.type); + + // accept nodejs `process.platform` + if( + opts.platform === 'darwin' || + opts.platform === 'freebsd' || + opts.platform === 'linux' || + opts.platform === 'sunos' + ) { + opts.platform = "UNIX"; + } + if (opts.platform === 'win32') { + opts.platform = "DOS"; + } + + var comment = opts.comment || this.comment || ""; + worker = generate.generateWorker(this, opts, comment); + } catch (e) { + worker = new GenericWorker("error"); + worker.error(e); + } + return new StreamHelper(worker, opts.type || "string", opts.mimeType); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateAsync: function(options, onUpdate) { + return this.generateInternalStream(options).accumulate(onUpdate); + }, + /** + * Generate the complete zip file asynchronously. + * @see generateInternalStream + */ + generateNodeStream: function(options, onUpdate) { + options = options || {}; + if (!options.type) { + options.type = "nodebuffer"; + } + return this.generateInternalStream(options).toNodejsStream(onUpdate); + } +}; +module.exports = out; + +},{"./compressedObject":2,"./defaults":5,"./generate":9,"./nodejs/NodejsStreamInputAdapter":12,"./nodejsUtils":14,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31,"./utils":32,"./zipObject":35}],16:[function(require,module,exports){ +/* + * This file is used by module bundlers (browserify/webpack/etc) when + * including a stream implementation. We use "readable-stream" to get a + * consistent behavior between nodejs versions but bundlers often have a shim + * for "stream". Using this shim greatly improve the compatibility and greatly + * reduce the final size of the bundle (only one stream implementation, not + * two). + */ +module.exports = require("stream"); + +},{"stream":undefined}],17:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function ArrayReader(data) { + DataReader.call(this, data); + for(var i = 0; i < this.data.length; i++) { + data[i] = data[i] & 0xFF; + } +} +utils.inherits(ArrayReader, DataReader); +/** + * @see DataReader.byteAt + */ +ArrayReader.prototype.byteAt = function(i) { + return this.data[this.zero + i]; +}; +/** + * @see DataReader.lastIndexOfSignature + */ +ArrayReader.prototype.lastIndexOfSignature = function(sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3); + for (var i = this.length - 4; i >= 0; --i) { + if (this.data[i] === sig0 && this.data[i + 1] === sig1 && this.data[i + 2] === sig2 && this.data[i + 3] === sig3) { + return i - this.zero; + } + } + + return -1; +}; +/** + * @see DataReader.readAndCheckSignature + */ +ArrayReader.prototype.readAndCheckSignature = function (sig) { + var sig0 = sig.charCodeAt(0), + sig1 = sig.charCodeAt(1), + sig2 = sig.charCodeAt(2), + sig3 = sig.charCodeAt(3), + data = this.readData(4); + return sig0 === data[0] && sig1 === data[1] && sig2 === data[2] && sig3 === data[3]; +}; +/** + * @see DataReader.readData + */ +ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + return []; + } + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = ArrayReader; + +},{"../utils":32,"./DataReader":18}],18:[function(require,module,exports){ +'use strict'; +var utils = require('../utils'); + +function DataReader(data) { + this.data = data; // type : see implementation + this.length = data.length; + this.index = 0; + this.zero = 0; +} +DataReader.prototype = { + /** + * Check that the offset will not go too far. + * @param {string} offset the additional offset to check. + * @throws {Error} an Error if the offset is out of bounds. + */ + checkOffset: function(offset) { + this.checkIndex(this.index + offset); + }, + /** + * Check that the specified index will not be too far. + * @param {string} newIndex the index to check. + * @throws {Error} an Error if the index is out of bounds. + */ + checkIndex: function(newIndex) { + if (this.length < this.zero + newIndex || newIndex < 0) { + throw new Error("End of data reached (data length = " + this.length + ", asked index = " + (newIndex) + "). Corrupted zip ?"); + } + }, + /** + * Change the index. + * @param {number} newIndex The new index. + * @throws {Error} if the new index is out of the data. + */ + setIndex: function(newIndex) { + this.checkIndex(newIndex); + this.index = newIndex; + }, + /** + * Skip the next n bytes. + * @param {number} n the number of bytes to skip. + * @throws {Error} if the new index is out of the data. + */ + skip: function(n) { + this.setIndex(this.index + n); + }, + /** + * Get the byte at the specified index. + * @param {number} i the index to use. + * @return {number} a byte. + */ + byteAt: function(i) { + // see implementations + }, + /** + * Get the next number with a given byte size. + * @param {number} size the number of bytes to read. + * @return {number} the corresponding number. + */ + readInt: function(size) { + var result = 0, + i; + this.checkOffset(size); + for (i = this.index + size - 1; i >= this.index; i--) { + result = (result << 8) + this.byteAt(i); + } + this.index += size; + return result; + }, + /** + * Get the next string with a given byte size. + * @param {number} size the number of bytes to read. + * @return {string} the corresponding string. + */ + readString: function(size) { + return utils.transformTo("string", this.readData(size)); + }, + /** + * Get raw data without conversion, bytes. + * @param {number} size the number of bytes to read. + * @return {Object} the raw data, implementation specific. + */ + readData: function(size) { + // see implementations + }, + /** + * Find the last occurrence of a zip signature (4 bytes). + * @param {string} sig the signature to find. + * @return {number} the index of the last occurrence, -1 if not found. + */ + lastIndexOfSignature: function(sig) { + // see implementations + }, + /** + * Read the signature (4 bytes) at the current position and compare it with sig. + * @param {string} sig the expected signature + * @return {boolean} true if the signature matches, false otherwise. + */ + readAndCheckSignature: function(sig) { + // see implementations + }, + /** + * Get the next date. + * @return {Date} the date. + */ + readDate: function() { + var dostime = this.readInt(4); + return new Date(Date.UTC( + ((dostime >> 25) & 0x7f) + 1980, // year + ((dostime >> 21) & 0x0f) - 1, // month + (dostime >> 16) & 0x1f, // day + (dostime >> 11) & 0x1f, // hour + (dostime >> 5) & 0x3f, // minute + (dostime & 0x1f) << 1)); // second + } +}; +module.exports = DataReader; + +},{"../utils":32}],19:[function(require,module,exports){ +'use strict'; +var Uint8ArrayReader = require('./Uint8ArrayReader'); +var utils = require('../utils'); + +function NodeBufferReader(data) { + Uint8ArrayReader.call(this, data); +} +utils.inherits(NodeBufferReader, Uint8ArrayReader); + +/** + * @see DataReader.readData + */ +NodeBufferReader.prototype.readData = function(size) { + this.checkOffset(size); + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = NodeBufferReader; + +},{"../utils":32,"./Uint8ArrayReader":21}],20:[function(require,module,exports){ +'use strict'; +var DataReader = require('./DataReader'); +var utils = require('../utils'); + +function StringReader(data) { + DataReader.call(this, data); +} +utils.inherits(StringReader, DataReader); +/** + * @see DataReader.byteAt + */ +StringReader.prototype.byteAt = function(i) { + return this.data.charCodeAt(this.zero + i); +}; +/** + * @see DataReader.lastIndexOfSignature + */ +StringReader.prototype.lastIndexOfSignature = function(sig) { + return this.data.lastIndexOf(sig) - this.zero; +}; +/** + * @see DataReader.readAndCheckSignature + */ +StringReader.prototype.readAndCheckSignature = function (sig) { + var data = this.readData(4); + return sig === data; +}; +/** + * @see DataReader.readData + */ +StringReader.prototype.readData = function(size) { + this.checkOffset(size); + // this will work because the constructor applied the "& 0xff" mask. + var result = this.data.slice(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = StringReader; + +},{"../utils":32,"./DataReader":18}],21:[function(require,module,exports){ +'use strict'; +var ArrayReader = require('./ArrayReader'); +var utils = require('../utils'); + +function Uint8ArrayReader(data) { + ArrayReader.call(this, data); +} +utils.inherits(Uint8ArrayReader, ArrayReader); +/** + * @see DataReader.readData + */ +Uint8ArrayReader.prototype.readData = function(size) { + this.checkOffset(size); + if(size === 0) { + // in IE10, when using subarray(idx, idx), we get the array [0x00] instead of []. + return new Uint8Array(0); + } + var result = this.data.subarray(this.zero + this.index, this.zero + this.index + size); + this.index += size; + return result; +}; +module.exports = Uint8ArrayReader; + +},{"../utils":32,"./ArrayReader":17}],22:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var support = require('../support'); +var ArrayReader = require('./ArrayReader'); +var StringReader = require('./StringReader'); +var NodeBufferReader = require('./NodeBufferReader'); +var Uint8ArrayReader = require('./Uint8ArrayReader'); + +/** + * Create a reader adapted to the data. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data to read. + * @return {DataReader} the data reader. + */ +module.exports = function (data) { + var type = utils.getTypeOf(data); + utils.checkSupport(type); + if (type === "string" && !support.uint8array) { + return new StringReader(data); + } + if (type === "nodebuffer") { + return new NodeBufferReader(data); + } + if (support.uint8array) { + return new Uint8ArrayReader(utils.transformTo("uint8array", data)); + } + return new ArrayReader(utils.transformTo("array", data)); +}; + +},{"../support":30,"../utils":32,"./ArrayReader":17,"./NodeBufferReader":19,"./StringReader":20,"./Uint8ArrayReader":21}],23:[function(require,module,exports){ +'use strict'; +exports.LOCAL_FILE_HEADER = "PK\x03\x04"; +exports.CENTRAL_FILE_HEADER = "PK\x01\x02"; +exports.CENTRAL_DIRECTORY_END = "PK\x05\x06"; +exports.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x06\x07"; +exports.ZIP64_CENTRAL_DIRECTORY_END = "PK\x06\x06"; +exports.DATA_DESCRIPTOR = "PK\x07\x08"; + +},{}],24:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var utils = require('../utils'); + +/** + * A worker which convert chunks to a specified type. + * @constructor + * @param {String} destType the destination type. + */ +function ConvertWorker(destType) { + GenericWorker.call(this, "ConvertWorker to " + destType); + this.destType = destType; +} +utils.inherits(ConvertWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +ConvertWorker.prototype.processChunk = function (chunk) { + this.push({ + data : utils.transformTo(this.destType, chunk.data), + meta : chunk.meta + }); +}; +module.exports = ConvertWorker; + +},{"../utils":32,"./GenericWorker":28}],25:[function(require,module,exports){ +'use strict'; + +var GenericWorker = require('./GenericWorker'); +var crc32 = require('../crc32'); +var utils = require('../utils'); + +/** + * A worker which calculate the crc32 of the data flowing through. + * @constructor + */ +function Crc32Probe() { + GenericWorker.call(this, "Crc32Probe"); + this.withStreamInfo("crc32", 0); +} +utils.inherits(Crc32Probe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Crc32Probe.prototype.processChunk = function (chunk) { + this.streamInfo.crc32 = crc32(chunk.data, this.streamInfo.crc32 || 0); + this.push(chunk); +}; +module.exports = Crc32Probe; + +},{"../crc32":4,"../utils":32,"./GenericWorker":28}],26:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +/** + * A worker which calculate the total length of the data flowing through. + * @constructor + * @param {String} propName the name used to expose the length + */ +function DataLengthProbe(propName) { + GenericWorker.call(this, "DataLengthProbe for " + propName); + this.propName = propName; + this.withStreamInfo(propName, 0); +} +utils.inherits(DataLengthProbe, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +DataLengthProbe.prototype.processChunk = function (chunk) { + if(chunk) { + var length = this.streamInfo[this.propName] || 0; + this.streamInfo[this.propName] = length + chunk.data.length; + } + GenericWorker.prototype.processChunk.call(this, chunk); +}; +module.exports = DataLengthProbe; + + +},{"../utils":32,"./GenericWorker":28}],27:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var GenericWorker = require('./GenericWorker'); + +// the size of the generated chunks +// TODO expose this as a public variable +var DEFAULT_BLOCK_SIZE = 16 * 1024; + +/** + * A worker that reads a content and emits chunks. + * @constructor + * @param {Promise} dataP the promise of the data to split + */ +function DataWorker(dataP) { + GenericWorker.call(this, "DataWorker"); + var self = this; + this.dataIsReady = false; + this.index = 0; + this.max = 0; + this.data = null; + this.type = ""; + + this._tickScheduled = false; + + dataP.then(function (data) { + self.dataIsReady = true; + self.data = data; + self.max = data && data.length || 0; + self.type = utils.getTypeOf(data); + if(!self.isPaused) { + self._tickAndRepeat(); + } + }, function (e) { + self.error(e); + }); +} + +utils.inherits(DataWorker, GenericWorker); + +/** + * @see GenericWorker.cleanUp + */ +DataWorker.prototype.cleanUp = function () { + GenericWorker.prototype.cleanUp.call(this); + this.data = null; +}; + +/** + * @see GenericWorker.resume + */ +DataWorker.prototype.resume = function () { + if(!GenericWorker.prototype.resume.call(this)) { + return false; + } + + if (!this._tickScheduled && this.dataIsReady) { + this._tickScheduled = true; + utils.delay(this._tickAndRepeat, [], this); + } + return true; +}; + +/** + * Trigger a tick a schedule an other call to this function. + */ +DataWorker.prototype._tickAndRepeat = function() { + this._tickScheduled = false; + if(this.isPaused || this.isFinished) { + return; + } + this._tick(); + if(!this.isFinished) { + utils.delay(this._tickAndRepeat, [], this); + this._tickScheduled = true; + } +}; + +/** + * Read and push a chunk. + */ +DataWorker.prototype._tick = function() { + + if(this.isPaused || this.isFinished) { + return false; + } + + var size = DEFAULT_BLOCK_SIZE; + var data = null, nextIndex = Math.min(this.max, this.index + size); + if (this.index >= this.max) { + // EOF + return this.end(); + } else { + switch(this.type) { + case "string": + data = this.data.substring(this.index, nextIndex); + break; + case "uint8array": + data = this.data.subarray(this.index, nextIndex); + break; + case "array": + case "nodebuffer": + data = this.data.slice(this.index, nextIndex); + break; + } + this.index = nextIndex; + return this.push({ + data : data, + meta : { + percent : this.max ? this.index / this.max * 100 : 0 + } + }); + } +}; + +module.exports = DataWorker; + +},{"../utils":32,"./GenericWorker":28}],28:[function(require,module,exports){ +'use strict'; + +/** + * A worker that does nothing but passing chunks to the next one. This is like + * a nodejs stream but with some differences. On the good side : + * - it works on IE 6-9 without any issue / polyfill + * - it weights less than the full dependencies bundled with browserify + * - it forwards errors (no need to declare an error handler EVERYWHERE) + * + * A chunk is an object with 2 attributes : `meta` and `data`. The former is an + * object containing anything (`percent` for example), see each worker for more + * details. The latter is the real data (String, Uint8Array, etc). + * + * @constructor + * @param {String} name the name of the stream (mainly used for debugging purposes) + */ +function GenericWorker(name) { + // the name of the worker + this.name = name || "default"; + // an object containing metadata about the workers chain + this.streamInfo = {}; + // an error which happened when the worker was paused + this.generatedError = null; + // an object containing metadata to be merged by this worker into the general metadata + this.extraStreamInfo = {}; + // true if the stream is paused (and should not do anything), false otherwise + this.isPaused = true; + // true if the stream is finished (and should not do anything), false otherwise + this.isFinished = false; + // true if the stream is locked to prevent further structure updates (pipe), false otherwise + this.isLocked = false; + // the event listeners + this._listeners = { + 'data':[], + 'end':[], + 'error':[] + }; + // the previous worker, if any + this.previous = null; +} + +GenericWorker.prototype = { + /** + * Push a chunk to the next workers. + * @param {Object} chunk the chunk to push + */ + push : function (chunk) { + this.emit("data", chunk); + }, + /** + * End the stream. + * @return {Boolean} true if this call ended the worker, false otherwise. + */ + end : function () { + if (this.isFinished) { + return false; + } + + this.flush(); + try { + this.emit("end"); + this.cleanUp(); + this.isFinished = true; + } catch (e) { + this.emit("error", e); + } + return true; + }, + /** + * End the stream with an error. + * @param {Error} e the error which caused the premature end. + * @return {Boolean} true if this call ended the worker with an error, false otherwise. + */ + error : function (e) { + if (this.isFinished) { + return false; + } + + if(this.isPaused) { + this.generatedError = e; + } else { + this.isFinished = true; + + this.emit("error", e); + + // in the workers chain exploded in the middle of the chain, + // the error event will go downward but we also need to notify + // workers upward that there has been an error. + if(this.previous) { + this.previous.error(e); + } + + this.cleanUp(); + } + return true; + }, + /** + * Add a callback on an event. + * @param {String} name the name of the event (data, end, error) + * @param {Function} listener the function to call when the event is triggered + * @return {GenericWorker} the current object for chainability + */ + on : function (name, listener) { + this._listeners[name].push(listener); + return this; + }, + /** + * Clean any references when a worker is ending. + */ + cleanUp : function () { + this.streamInfo = this.generatedError = this.extraStreamInfo = null; + this._listeners = []; + }, + /** + * Trigger an event. This will call registered callback with the provided arg. + * @param {String} name the name of the event (data, end, error) + * @param {Object} arg the argument to call the callback with. + */ + emit : function (name, arg) { + if (this._listeners[name]) { + for(var i = 0; i < this._listeners[name].length; i++) { + this._listeners[name][i].call(this, arg); + } + } + }, + /** + * Chain a worker with an other. + * @param {Worker} next the worker receiving events from the current one. + * @return {worker} the next worker for chainability + */ + pipe : function (next) { + return next.registerPrevious(this); + }, + /** + * Same as `pipe` in the other direction. + * Using an API with `pipe(next)` is very easy. + * Implementing the API with the point of view of the next one registering + * a source is easier, see the ZipFileWorker. + * @param {Worker} previous the previous worker, sending events to this one + * @return {Worker} the current worker for chainability + */ + registerPrevious : function (previous) { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + + // sharing the streamInfo... + this.streamInfo = previous.streamInfo; + // ... and adding our own bits + this.mergeStreamInfo(); + this.previous = previous; + var self = this; + previous.on('data', function (chunk) { + self.processChunk(chunk); + }); + previous.on('end', function () { + self.end(); + }); + previous.on('error', function (e) { + self.error(e); + }); + return this; + }, + /** + * Pause the stream so it doesn't send events anymore. + * @return {Boolean} true if this call paused the worker, false otherwise. + */ + pause : function () { + if(this.isPaused || this.isFinished) { + return false; + } + this.isPaused = true; + + if(this.previous) { + this.previous.pause(); + } + return true; + }, + /** + * Resume a paused stream. + * @return {Boolean} true if this call resumed the worker, false otherwise. + */ + resume : function () { + if(!this.isPaused || this.isFinished) { + return false; + } + this.isPaused = false; + + // if true, the worker tried to resume but failed + var withError = false; + if(this.generatedError) { + this.error(this.generatedError); + withError = true; + } + if(this.previous) { + this.previous.resume(); + } + + return !withError; + }, + /** + * Flush any remaining bytes as the stream is ending. + */ + flush : function () {}, + /** + * Process a chunk. This is usually the method overridden. + * @param {Object} chunk the chunk to process. + */ + processChunk : function(chunk) { + this.push(chunk); + }, + /** + * Add a key/value to be added in the workers chain streamInfo once activated. + * @param {String} key the key to use + * @param {Object} value the associated value + * @return {Worker} the current worker for chainability + */ + withStreamInfo : function (key, value) { + this.extraStreamInfo[key] = value; + this.mergeStreamInfo(); + return this; + }, + /** + * Merge this worker's streamInfo into the chain's streamInfo. + */ + mergeStreamInfo : function () { + for(var key in this.extraStreamInfo) { + if (!this.extraStreamInfo.hasOwnProperty(key)) { + continue; + } + this.streamInfo[key] = this.extraStreamInfo[key]; + } + }, + + /** + * Lock the stream to prevent further updates on the workers chain. + * After calling this method, all calls to pipe will fail. + */ + lock: function () { + if (this.isLocked) { + throw new Error("The stream '" + this + "' has already been used."); + } + this.isLocked = true; + if (this.previous) { + this.previous.lock(); + } + }, + + /** + * + * Pretty print the workers chain. + */ + toString : function () { + var me = "Worker " + this.name; + if (this.previous) { + return this.previous + " -> " + me; + } else { + return me; + } + } +}; + +module.exports = GenericWorker; + +},{}],29:[function(require,module,exports){ +'use strict'; + +var utils = require('../utils'); +var ConvertWorker = require('./ConvertWorker'); +var GenericWorker = require('./GenericWorker'); +var base64 = require('../base64'); +var support = require("../support"); +var external = require("../external"); + +var NodejsStreamOutputAdapter = null; +if (support.nodestream) { + try { + NodejsStreamOutputAdapter = require('../nodejs/NodejsStreamOutputAdapter'); + } catch(e) {} +} + +/** + * Apply the final transformation of the data. If the user wants a Blob for + * example, it's easier to work with an U8intArray and finally do the + * ArrayBuffer/Blob conversion. + * @param {String} type the name of the final type + * @param {String|Uint8Array|Buffer} content the content to transform + * @param {String} mimeType the mime type of the content, if applicable. + * @return {String|Uint8Array|ArrayBuffer|Buffer|Blob} the content in the right format. + */ +function transformZipOutput(type, content, mimeType) { + switch(type) { + case "blob" : + return utils.newBlob(utils.transformTo("arraybuffer", content), mimeType); + case "base64" : + return base64.encode(content); + default : + return utils.transformTo(type, content); + } +} + +/** + * Concatenate an array of data of the given type. + * @param {String} type the type of the data in the given array. + * @param {Array} dataArray the array containing the data chunks to concatenate + * @return {String|Uint8Array|Buffer} the concatenated data + * @throws Error if the asked type is unsupported + */ +function concat (type, dataArray) { + var i, index = 0, res = null, totalLength = 0; + for(i = 0; i < dataArray.length; i++) { + totalLength += dataArray[i].length; + } + switch(type) { + case "string": + return dataArray.join(""); + case "array": + return Array.prototype.concat.apply([], dataArray); + case "uint8array": + res = new Uint8Array(totalLength); + for(i = 0; i < dataArray.length; i++) { + res.set(dataArray[i], index); + index += dataArray[i].length; + } + return res; + case "nodebuffer": + return Buffer.concat(dataArray); + default: + throw new Error("concat : unsupported type '" + type + "'"); + } +} + +/** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {StreamHelper} helper the helper to use. + * @param {Function} updateCallback a callback called on each update. Called + * with one arg : + * - the metadata linked to the update received. + * @return Promise the promise for the accumulation. + */ +function accumulate(helper, updateCallback) { + return new external.Promise(function (resolve, reject){ + var dataArray = []; + var chunkType = helper._internalType, + resultType = helper._outputType, + mimeType = helper._mimeType; + helper + .on('data', function (data, meta) { + dataArray.push(data); + if(updateCallback) { + updateCallback(meta); + } + }) + .on('error', function(err) { + dataArray = []; + reject(err); + }) + .on('end', function (){ + try { + var result = transformZipOutput(resultType, concat(chunkType, dataArray), mimeType); + resolve(result); + } catch (e) { + reject(e); + } + dataArray = []; + }) + .resume(); + }); +} + +/** + * An helper to easily use workers outside of JSZip. + * @constructor + * @param {Worker} worker the worker to wrap + * @param {String} outputType the type of data expected by the use + * @param {String} mimeType the mime type of the content, if applicable. + */ +function StreamHelper(worker, outputType, mimeType) { + var internalType = outputType; + switch(outputType) { + case "blob": + case "arraybuffer": + internalType = "uint8array"; + break; + case "base64": + internalType = "string"; + break; + } + + try { + // the type used internally + this._internalType = internalType; + // the type used to output results + this._outputType = outputType; + // the mime type + this._mimeType = mimeType; + utils.checkSupport(internalType); + this._worker = worker.pipe(new ConvertWorker(internalType)); + // the last workers can be rewired without issues but we need to + // prevent any updates on previous workers. + worker.lock(); + } catch(e) { + this._worker = new GenericWorker("error"); + this._worker.error(e); + } +} + +StreamHelper.prototype = { + /** + * Listen a StreamHelper, accumulate its content and concatenate it into a + * complete block. + * @param {Function} updateCb the update callback. + * @return Promise the promise for the accumulation. + */ + accumulate : function (updateCb) { + return accumulate(this, updateCb); + }, + /** + * Add a listener on an event triggered on a stream. + * @param {String} evt the name of the event + * @param {Function} fn the listener + * @return {StreamHelper} the current helper. + */ + on : function (evt, fn) { + var self = this; + + if(evt === "data") { + this._worker.on(evt, function (chunk) { + fn.call(self, chunk.data, chunk.meta); + }); + } else { + this._worker.on(evt, function () { + utils.delay(fn, arguments, self); + }); + } + return this; + }, + /** + * Resume the flow of chunks. + * @return {StreamHelper} the current helper. + */ + resume : function () { + utils.delay(this._worker.resume, [], this._worker); + return this; + }, + /** + * Pause the flow of chunks. + * @return {StreamHelper} the current helper. + */ + pause : function () { + this._worker.pause(); + return this; + }, + /** + * Return a nodejs stream for this helper. + * @param {Function} updateCb the update callback. + * @return {NodejsStreamOutputAdapter} the nodejs stream. + */ + toNodejsStream : function (updateCb) { + utils.checkSupport("nodestream"); + if (this._outputType !== "nodebuffer") { + // an object stream containing blob/arraybuffer/uint8array/string + // is strange and I don't know if it would be useful. + // I you find this comment and have a good usecase, please open a + // bug report ! + throw new Error(this._outputType + " is not supported by this method"); + } + + return new NodejsStreamOutputAdapter(this, { + objectMode : this._outputType !== "nodebuffer" + }, updateCb); + } +}; + + +module.exports = StreamHelper; + +},{"../base64":1,"../external":6,"../nodejs/NodejsStreamOutputAdapter":13,"../support":30,"../utils":32,"./ConvertWorker":24,"./GenericWorker":28}],30:[function(require,module,exports){ +'use strict'; + +exports.base64 = true; +exports.array = true; +exports.string = true; +exports.arraybuffer = typeof ArrayBuffer !== "undefined" && typeof Uint8Array !== "undefined"; +exports.nodebuffer = typeof Buffer !== "undefined"; +// contains true if JSZip can read/generate Uint8Array, false otherwise. +exports.uint8array = typeof Uint8Array !== "undefined"; + +if (typeof ArrayBuffer === "undefined") { + exports.blob = false; +} +else { + var buffer = new ArrayBuffer(0); + try { + exports.blob = new Blob([buffer], { + type: "application/zip" + }).size === 0; + } + catch (e) { + try { + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(buffer); + exports.blob = builder.getBlob('application/zip').size === 0; + } + catch (e) { + exports.blob = false; + } + } +} + +try { + exports.nodestream = !!require('readable-stream').Readable; +} catch(e) { + exports.nodestream = false; +} + +},{"readable-stream":16}],31:[function(require,module,exports){ +'use strict'; + +var utils = require('./utils'); +var support = require('./support'); +var nodejsUtils = require('./nodejsUtils'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * The following functions come from pako, from pako/lib/utils/strings + * released under the MIT license, see pako https://github.com/nodeca/pako/ + */ + +// Table with utf8 lengths (calculated by first byte of sequence) +// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS, +// because max possible codepoint is 0x10ffff +var _utf8len = new Array(256); +for (var i=0; i<256; i++) { + _utf8len[i] = (i >= 252 ? 6 : i >= 248 ? 5 : i >= 240 ? 4 : i >= 224 ? 3 : i >= 192 ? 2 : 1); +} +_utf8len[254]=_utf8len[254]=1; // Invalid sequence start + +// convert string to array (typed, when possible) +var string2buf = function (str) { + var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0; + + // count binary size + for (m_pos = 0; m_pos < str_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4; + } + + // allocate buffer + if (support.uint8array) { + buf = new Uint8Array(buf_len); + } else { + buf = new Array(buf_len); + } + + // convert + for (i=0, m_pos = 0; i < buf_len; m_pos++) { + c = str.charCodeAt(m_pos); + if ((c & 0xfc00) === 0xd800 && (m_pos+1 < str_len)) { + c2 = str.charCodeAt(m_pos+1); + if ((c2 & 0xfc00) === 0xdc00) { + c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00); + m_pos++; + } + } + if (c < 0x80) { + /* one byte */ + buf[i++] = c; + } else if (c < 0x800) { + /* two bytes */ + buf[i++] = 0xC0 | (c >>> 6); + buf[i++] = 0x80 | (c & 0x3f); + } else if (c < 0x10000) { + /* three bytes */ + buf[i++] = 0xE0 | (c >>> 12); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } else { + /* four bytes */ + buf[i++] = 0xf0 | (c >>> 18); + buf[i++] = 0x80 | (c >>> 12 & 0x3f); + buf[i++] = 0x80 | (c >>> 6 & 0x3f); + buf[i++] = 0x80 | (c & 0x3f); + } + } + + return buf; +}; + +// Calculate max possible position in utf8 buffer, +// that will not break sequence. If that's not possible +// - (very small limits) return max size as is. +// +// buf[] - utf8 bytes array +// max - length limit (mandatory); +var utf8border = function(buf, max) { + var pos; + + max = max || buf.length; + if (max > buf.length) { max = buf.length; } + + // go back from last position, until start of sequence found + pos = max-1; + while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; } + + // Fuckup - very small and broken sequence, + // return max, because we should return something anyway. + if (pos < 0) { return max; } + + // If we came to start of buffer - that means vuffer is too small, + // return max too. + if (pos === 0) { return max; } + + return (pos + _utf8len[buf[pos]] > max) ? pos : max; +}; + +// convert array to string +var buf2string = function (buf) { + var str, i, out, c, c_len; + var len = buf.length; + + // Reserve max possible length (2 words per char) + // NB: by unknown reasons, Array is significantly faster for + // String.fromCharCode.apply than Uint16Array. + var utf16buf = new Array(len*2); + + for (out=0, i=0; i 4) { utf16buf[out++] = 0xfffd; i += c_len-1; continue; } + + // apply mask on first byte + c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07; + // join the rest + while (c_len > 1 && i < len) { + c = (c << 6) | (buf[i++] & 0x3f); + c_len--; + } + + // terminated by end of string? + if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; } + + if (c < 0x10000) { + utf16buf[out++] = c; + } else { + c -= 0x10000; + utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff); + utf16buf[out++] = 0xdc00 | (c & 0x3ff); + } + } + + // shrinkBuf(utf16buf, out) + if (utf16buf.length !== out) { + if(utf16buf.subarray) { + utf16buf = utf16buf.subarray(0, out); + } else { + utf16buf.length = out; + } + } + + // return String.fromCharCode.apply(null, utf16buf); + return utils.applyFromCharCode(utf16buf); +}; + + +// That's all for the pako functions. + + +/** + * Transform a javascript string into an array (typed if possible) of bytes, + * UTF-8 encoded. + * @param {String} str the string to encode + * @return {Array|Uint8Array|Buffer} the UTF-8 encoded string. + */ +exports.utf8encode = function utf8encode(str) { + if (support.nodebuffer) { + return nodejsUtils.newBufferFrom(str, "utf-8"); + } + + return string2buf(str); +}; + + +/** + * Transform a bytes array (or a representation) representing an UTF-8 encoded + * string into a javascript string. + * @param {Array|Uint8Array|Buffer} buf the data de decode + * @return {String} the decoded string. + */ +exports.utf8decode = function utf8decode(buf) { + if (support.nodebuffer) { + return utils.transformTo("nodebuffer", buf).toString("utf-8"); + } + + buf = utils.transformTo(support.uint8array ? "uint8array" : "array", buf); + + return buf2string(buf); +}; + +/** + * A worker to decode utf8 encoded binary chunks into string chunks. + * @constructor + */ +function Utf8DecodeWorker() { + GenericWorker.call(this, "utf-8 decode"); + // the last bytes if a chunk didn't end with a complete codepoint. + this.leftOver = null; +} +utils.inherits(Utf8DecodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8DecodeWorker.prototype.processChunk = function (chunk) { + + var data = utils.transformTo(support.uint8array ? "uint8array" : "array", chunk.data); + + // 1st step, re-use what's left of the previous chunk + if (this.leftOver && this.leftOver.length) { + if(support.uint8array) { + var previousData = data; + data = new Uint8Array(previousData.length + this.leftOver.length); + data.set(this.leftOver, 0); + data.set(previousData, this.leftOver.length); + } else { + data = this.leftOver.concat(data); + } + this.leftOver = null; + } + + var nextBoundary = utf8border(data); + var usableData = data; + if (nextBoundary !== data.length) { + if (support.uint8array) { + usableData = data.subarray(0, nextBoundary); + this.leftOver = data.subarray(nextBoundary, data.length); + } else { + usableData = data.slice(0, nextBoundary); + this.leftOver = data.slice(nextBoundary, data.length); + } + } + + this.push({ + data : exports.utf8decode(usableData), + meta : chunk.meta + }); +}; + +/** + * @see GenericWorker.flush + */ +Utf8DecodeWorker.prototype.flush = function () { + if(this.leftOver && this.leftOver.length) { + this.push({ + data : exports.utf8decode(this.leftOver), + meta : {} + }); + this.leftOver = null; + } +}; +exports.Utf8DecodeWorker = Utf8DecodeWorker; + +/** + * A worker to endcode string chunks into utf8 encoded binary chunks. + * @constructor + */ +function Utf8EncodeWorker() { + GenericWorker.call(this, "utf-8 encode"); +} +utils.inherits(Utf8EncodeWorker, GenericWorker); + +/** + * @see GenericWorker.processChunk + */ +Utf8EncodeWorker.prototype.processChunk = function (chunk) { + this.push({ + data : exports.utf8encode(chunk.data), + meta : chunk.meta + }); +}; +exports.Utf8EncodeWorker = Utf8EncodeWorker; + +},{"./nodejsUtils":14,"./stream/GenericWorker":28,"./support":30,"./utils":32}],32:[function(require,module,exports){ +'use strict'; + +var support = require('./support'); +var base64 = require('./base64'); +var nodejsUtils = require('./nodejsUtils'); +var setImmediate = require('set-immediate-shim'); +var external = require("./external"); + + +/** + * Convert a string that pass as a "binary string": it should represent a byte + * array but may have > 255 char codes. Be sure to take only the first byte + * and returns the byte array. + * @param {String} str the string to transform. + * @return {Array|Uint8Array} the string in a binary format. + */ +function string2binary(str) { + var result = null; + if (support.uint8array) { + result = new Uint8Array(str.length); + } else { + result = new Array(str.length); + } + return stringToArrayLike(str, result); +} + +/** + * Create a new blob with the given content and the given type. + * @param {String|ArrayBuffer} part the content to put in the blob. DO NOT use + * an Uint8Array because the stock browser of android 4 won't accept it (it + * will be silently converted to a string, "[object Uint8Array]"). + * + * Use only ONE part to build the blob to avoid a memory leak in IE11 / Edge: + * when a large amount of Array is used to create the Blob, the amount of + * memory consumed is nearly 100 times the original data amount. + * + * @param {String} type the mime type of the blob. + * @return {Blob} the created blob. + */ +exports.newBlob = function(part, type) { + exports.checkSupport("blob"); + + try { + // Blob constructor + return new Blob([part], { + type: type + }); + } + catch (e) { + + try { + // deprecated, browser only, old way + var Builder = self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder; + var builder = new Builder(); + builder.append(part); + return builder.getBlob(type); + } + catch (e) { + + // well, fuck ?! + throw new Error("Bug : can't construct the Blob."); + } + } + + +}; +/** + * The identity function. + * @param {Object} input the input. + * @return {Object} the same input. + */ +function identity(input) { + return input; +} + +/** + * Fill in an array with a string. + * @param {String} str the string to use. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to fill in (will be mutated). + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated array. + */ +function stringToArrayLike(str, array) { + for (var i = 0; i < str.length; ++i) { + array[i] = str.charCodeAt(i) & 0xFF; + } + return array; +} + +/** + * An helper for the function arrayLikeToString. + * This contains static information and functions that + * can be optimized by the browser JIT compiler. + */ +var arrayToStringHelper = { + /** + * Transform an array of int into a string, chunk by chunk. + * See the performances notes on arrayLikeToString. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @param {String} type the type of the array. + * @param {Integer} chunk the chunk size. + * @return {String} the resulting string. + * @throws Error if the chunk is too big for the stack. + */ + stringifyByChunk: function(array, type, chunk) { + var result = [], k = 0, len = array.length; + // shortcut + if (len <= chunk) { + return String.fromCharCode.apply(null, array); + } + while (k < len) { + if (type === "array" || type === "nodebuffer") { + result.push(String.fromCharCode.apply(null, array.slice(k, Math.min(k + chunk, len)))); + } + else { + result.push(String.fromCharCode.apply(null, array.subarray(k, Math.min(k + chunk, len)))); + } + k += chunk; + } + return result.join(""); + }, + /** + * Call String.fromCharCode on every item in the array. + * This is the naive implementation, which generate A LOT of intermediate string. + * This should be used when everything else fail. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ + stringifyByChar: function(array){ + var resultStr = ""; + for(var i = 0; i < array.length; i++) { + resultStr += String.fromCharCode(array[i]); + } + return resultStr; + }, + applyCanBeUsed : { + /** + * true if the browser accepts to use String.fromCharCode on Uint8Array + */ + uint8array : (function () { + try { + return support.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1; + } catch (e) { + return false; + } + })(), + /** + * true if the browser accepts to use String.fromCharCode on nodejs Buffer. + */ + nodebuffer : (function () { + try { + return support.nodebuffer && String.fromCharCode.apply(null, nodejsUtils.allocBuffer(1)).length === 1; + } catch (e) { + return false; + } + })() + } +}; + +/** + * Transform an array-like object to a string. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} array the array to transform. + * @return {String} the result. + */ +function arrayLikeToString(array) { + // Performances notes : + // -------------------- + // String.fromCharCode.apply(null, array) is the fastest, see + // see http://jsperf.com/converting-a-uint8array-to-a-string/2 + // but the stack is limited (and we can get huge arrays !). + // + // result += String.fromCharCode(array[i]); generate too many strings ! + // + // This code is inspired by http://jsperf.com/arraybuffer-to-string-apply-performance/2 + // TODO : we now have workers that split the work. Do we still need that ? + var chunk = 65536, + type = exports.getTypeOf(array), + canUseApply = true; + if (type === "uint8array") { + canUseApply = arrayToStringHelper.applyCanBeUsed.uint8array; + } else if (type === "nodebuffer") { + canUseApply = arrayToStringHelper.applyCanBeUsed.nodebuffer; + } + + if (canUseApply) { + while (chunk > 1) { + try { + return arrayToStringHelper.stringifyByChunk(array, type, chunk); + } catch (e) { + chunk = Math.floor(chunk / 2); + } + } + } + + // no apply or chunk error : slow and painful algorithm + // default browser on android 4.* + return arrayToStringHelper.stringifyByChar(array); +} + +exports.applyFromCharCode = arrayLikeToString; + + +/** + * Copy the data from an array-like to an other array-like. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayFrom the origin array. + * @param {Array|ArrayBuffer|Uint8Array|Buffer} arrayTo the destination array which will be mutated. + * @return {Array|ArrayBuffer|Uint8Array|Buffer} the updated destination array. + */ +function arrayLikeToArrayLike(arrayFrom, arrayTo) { + for (var i = 0; i < arrayFrom.length; i++) { + arrayTo[i] = arrayFrom[i]; + } + return arrayTo; +} + +// a matrix containing functions to transform everything into everything. +var transform = {}; + +// string to ? +transform["string"] = { + "string": identity, + "array": function(input) { + return stringToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["string"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return stringToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": function(input) { + return stringToArrayLike(input, nodejsUtils.allocBuffer(input.length)); + } +}; + +// array to ? +transform["array"] = { + "string": arrayLikeToString, + "array": identity, + "arraybuffer": function(input) { + return (new Uint8Array(input)).buffer; + }, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// arraybuffer to ? +transform["arraybuffer"] = { + "string": function(input) { + return arrayLikeToString(new Uint8Array(input)); + }, + "array": function(input) { + return arrayLikeToArrayLike(new Uint8Array(input), new Array(input.byteLength)); + }, + "arraybuffer": identity, + "uint8array": function(input) { + return new Uint8Array(input); + }, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(new Uint8Array(input)); + } +}; + +// uint8array to ? +transform["uint8array"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return input.buffer; + }, + "uint8array": identity, + "nodebuffer": function(input) { + return nodejsUtils.newBufferFrom(input); + } +}; + +// nodebuffer to ? +transform["nodebuffer"] = { + "string": arrayLikeToString, + "array": function(input) { + return arrayLikeToArrayLike(input, new Array(input.length)); + }, + "arraybuffer": function(input) { + return transform["nodebuffer"]["uint8array"](input).buffer; + }, + "uint8array": function(input) { + return arrayLikeToArrayLike(input, new Uint8Array(input.length)); + }, + "nodebuffer": identity +}; + +/** + * Transform an input into any type. + * The supported output type are : string, array, uint8array, arraybuffer, nodebuffer. + * If no output type is specified, the unmodified input will be returned. + * @param {String} outputType the output type. + * @param {String|Array|ArrayBuffer|Uint8Array|Buffer} input the input to convert. + * @throws {Error} an Error if the browser doesn't support the requested output type. + */ +exports.transformTo = function(outputType, input) { + if (!input) { + // undefined, null, etc + // an empty string won't harm. + input = ""; + } + if (!outputType) { + return input; + } + exports.checkSupport(outputType); + var inputType = exports.getTypeOf(input); + var result = transform[inputType][outputType](input); + return result; +}; + +/** + * Return the type of the input. + * The type will be in a format valid for JSZip.utils.transformTo : string, array, uint8array, arraybuffer. + * @param {Object} input the input to identify. + * @return {String} the (lowercase) type of the input. + */ +exports.getTypeOf = function(input) { + if (typeof input === "string") { + return "string"; + } + if (Object.prototype.toString.call(input) === "[object Array]") { + return "array"; + } + if (support.nodebuffer && nodejsUtils.isBuffer(input)) { + return "nodebuffer"; + } + if (support.uint8array && input instanceof Uint8Array) { + return "uint8array"; + } + if (support.arraybuffer && input instanceof ArrayBuffer) { + return "arraybuffer"; + } +}; + +/** + * Throw an exception if the type is not supported. + * @param {String} type the type to check. + * @throws {Error} an Error if the browser doesn't support the requested type. + */ +exports.checkSupport = function(type) { + var supported = support[type.toLowerCase()]; + if (!supported) { + throw new Error(type + " is not supported by this platform"); + } +}; + +exports.MAX_VALUE_16BITS = 65535; +exports.MAX_VALUE_32BITS = -1; // well, "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF" is parsed as -1 + +/** + * Prettify a string read as binary. + * @param {string} str the string to prettify. + * @return {string} a pretty string. + */ +exports.pretty = function(str) { + var res = '', + code, i; + for (i = 0; i < (str || "").length; i++) { + code = str.charCodeAt(i); + res += '\\x' + (code < 16 ? "0" : "") + code.toString(16).toUpperCase(); + } + return res; +}; + +/** + * Defer the call of a function. + * @param {Function} callback the function to call asynchronously. + * @param {Array} args the arguments to give to the callback. + */ +exports.delay = function(callback, args, self) { + setImmediate(function () { + callback.apply(self || null, args || []); + }); +}; + +/** + * Extends a prototype with an other, without calling a constructor with + * side effects. Inspired by nodejs' `utils.inherits` + * @param {Function} ctor the constructor to augment + * @param {Function} superCtor the parent constructor to use + */ +exports.inherits = function (ctor, superCtor) { + var Obj = function() {}; + Obj.prototype = superCtor.prototype; + ctor.prototype = new Obj(); +}; + +/** + * Merge the objects passed as parameters into a new one. + * @private + * @param {...Object} var_args All objects to merge. + * @return {Object} a new object with the data of the others. + */ +exports.extend = function() { + var result = {}, i, attr; + for (i = 0; i < arguments.length; i++) { // arguments is not enumerable in some browsers + for (attr in arguments[i]) { + if (arguments[i].hasOwnProperty(attr) && typeof result[attr] === "undefined") { + result[attr] = arguments[i][attr]; + } + } + } + return result; +}; + +/** + * Transform arbitrary content into a Promise. + * @param {String} name a name for the content being processed. + * @param {Object} inputData the content to process. + * @param {Boolean} isBinary true if the content is not an unicode string + * @param {Boolean} isOptimizedBinaryString true if the string content only has one byte per character. + * @param {Boolean} isBase64 true if the string content is encoded with base64. + * @return {Promise} a promise in a format usable by JSZip. + */ +exports.prepareContent = function(name, inputData, isBinary, isOptimizedBinaryString, isBase64) { + + // if inputData is already a promise, this flatten it. + var promise = external.Promise.resolve(inputData).then(function(data) { + + + var isBlob = support.blob && (data instanceof Blob || ['[object File]', '[object Blob]'].indexOf(Object.prototype.toString.call(data)) !== -1); + + if (isBlob && typeof FileReader !== "undefined") { + return new external.Promise(function (resolve, reject) { + var reader = new FileReader(); + + reader.onload = function(e) { + resolve(e.target.result); + }; + reader.onerror = function(e) { + reject(e.target.error); + }; + reader.readAsArrayBuffer(data); + }); + } else { + return data; + } + }); + + return promise.then(function(data) { + var dataType = exports.getTypeOf(data); + + if (!dataType) { + return external.Promise.reject( + new Error("Can't read the data of '" + name + "'. Is it " + + "in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?") + ); + } + // special case : it's way easier to work with Uint8Array than with ArrayBuffer + if (dataType === "arraybuffer") { + data = exports.transformTo("uint8array", data); + } else if (dataType === "string") { + if (isBase64) { + data = base64.decode(data); + } + else if (isBinary) { + // optimizedBinaryString === true means that the file has already been filtered with a 0xFF mask + if (isOptimizedBinaryString !== true) { + // this is a string, not in a base64 format. + // Be sure that this is a correct "binary string" + data = string2binary(data); + } + } + } + return data; + }); +}; + +},{"./base64":1,"./external":6,"./nodejsUtils":14,"./support":30,"set-immediate-shim":54}],33:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var sig = require('./signature'); +var ZipEntry = require('./zipEntry'); +var utf8 = require('./utf8'); +var support = require('./support'); +// class ZipEntries {{{ +/** + * All the entries in the zip file. + * @constructor + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntries(loadOptions) { + this.files = []; + this.loadOptions = loadOptions; +} +ZipEntries.prototype = { + /** + * Check that the reader is on the specified signature. + * @param {string} expectedSignature the expected signature. + * @throws {Error} if it is an other signature. + */ + checkSignature: function(expectedSignature) { + if (!this.reader.readAndCheckSignature(expectedSignature)) { + this.reader.index -= 4; + var signature = this.reader.readString(4); + throw new Error("Corrupted zip or bug: unexpected signature " + "(" + utils.pretty(signature) + ", expected " + utils.pretty(expectedSignature) + ")"); + } + }, + /** + * Check if the given signature is at the given index. + * @param {number} askedIndex the index to check. + * @param {string} expectedSignature the signature to expect. + * @return {boolean} true if the signature is here, false otherwise. + */ + isSignature: function(askedIndex, expectedSignature) { + var currentIndex = this.reader.index; + this.reader.setIndex(askedIndex); + var signature = this.reader.readString(4); + var result = signature === expectedSignature; + this.reader.setIndex(currentIndex); + return result; + }, + /** + * Read the end of the central directory. + */ + readBlockEndOfCentral: function() { + this.diskNumber = this.reader.readInt(2); + this.diskWithCentralDirStart = this.reader.readInt(2); + this.centralDirRecordsOnThisDisk = this.reader.readInt(2); + this.centralDirRecords = this.reader.readInt(2); + this.centralDirSize = this.reader.readInt(4); + this.centralDirOffset = this.reader.readInt(4); + + this.zipCommentLength = this.reader.readInt(2); + // warning : the encoding depends of the system locale + // On a linux machine with LANG=en_US.utf8, this field is utf8 encoded. + // On a windows machine, this field is encoded with the localized windows code page. + var zipComment = this.reader.readData(this.zipCommentLength); + var decodeParamType = support.uint8array ? "uint8array" : "array"; + // To get consistent behavior with the generation part, we will assume that + // this is utf8 encoded unless specified otherwise. + var decodeContent = utils.transformTo(decodeParamType, zipComment); + this.zipComment = this.loadOptions.decodeFileName(decodeContent); + }, + /** + * Read the end of the Zip 64 central directory. + * Not merged with the method readEndOfCentral : + * The end of central can coexist with its Zip64 brother, + * I don't want to read the wrong number of bytes ! + */ + readBlockZip64EndOfCentral: function() { + this.zip64EndOfCentralSize = this.reader.readInt(8); + this.reader.skip(4); + // this.versionMadeBy = this.reader.readString(2); + // this.versionNeeded = this.reader.readInt(2); + this.diskNumber = this.reader.readInt(4); + this.diskWithCentralDirStart = this.reader.readInt(4); + this.centralDirRecordsOnThisDisk = this.reader.readInt(8); + this.centralDirRecords = this.reader.readInt(8); + this.centralDirSize = this.reader.readInt(8); + this.centralDirOffset = this.reader.readInt(8); + + this.zip64ExtensibleData = {}; + var extraDataSize = this.zip64EndOfCentralSize - 44, + index = 0, + extraFieldId, + extraFieldLength, + extraFieldValue; + while (index < extraDataSize) { + extraFieldId = this.reader.readInt(2); + extraFieldLength = this.reader.readInt(4); + extraFieldValue = this.reader.readData(extraFieldLength); + this.zip64ExtensibleData[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + }, + /** + * Read the end of the Zip 64 central directory locator. + */ + readBlockZip64EndOfCentralLocator: function() { + this.diskWithZip64CentralDirStart = this.reader.readInt(4); + this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8); + this.disksCount = this.reader.readInt(4); + if (this.disksCount > 1) { + throw new Error("Multi-volumes zip are not supported"); + } + }, + /** + * Read the local files, based on the offset read in the central part. + */ + readLocalFiles: function() { + var i, file; + for (i = 0; i < this.files.length; i++) { + file = this.files[i]; + this.reader.setIndex(file.localHeaderOffset); + this.checkSignature(sig.LOCAL_FILE_HEADER); + file.readLocalPart(this.reader); + file.handleUTF8(); + file.processAttributes(); + } + }, + /** + * Read the central directory. + */ + readCentralDir: function() { + var file; + + this.reader.setIndex(this.centralDirOffset); + while (this.reader.readAndCheckSignature(sig.CENTRAL_FILE_HEADER)) { + file = new ZipEntry({ + zip64: this.zip64 + }, this.loadOptions); + file.readCentralPart(this.reader); + this.files.push(file); + } + + if (this.centralDirRecords !== this.files.length) { + if (this.centralDirRecords !== 0 && this.files.length === 0) { + // We expected some records but couldn't find ANY. + // This is really suspicious, as if something went wrong. + throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length); + } else { + // We found some records but not all. + // Something is wrong but we got something for the user: no error here. + // console.warn("expected", this.centralDirRecords, "records in central dir, got", this.files.length); + } + } + }, + /** + * Read the end of central directory. + */ + readEndOfCentral: function() { + var offset = this.reader.lastIndexOfSignature(sig.CENTRAL_DIRECTORY_END); + if (offset < 0) { + // Check if the content is a truncated zip or complete garbage. + // A "LOCAL_FILE_HEADER" is not required at the beginning (auto + // extractible zip for example) but it can give a good hint. + // If an ajax request was used without responseType, we will also + // get unreadable data. + var isGarbage = !this.isSignature(0, sig.LOCAL_FILE_HEADER); + + if (isGarbage) { + throw new Error("Can't find end of central directory : is this a zip file ? " + + "If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html"); + } else { + throw new Error("Corrupted zip: can't find end of central directory"); + } + + } + this.reader.setIndex(offset); + var endOfCentralDirOffset = offset; + this.checkSignature(sig.CENTRAL_DIRECTORY_END); + this.readBlockEndOfCentral(); + + + /* extract from the zip spec : + 4) If one of the fields in the end of central directory + record is too small to hold required data, the field + should be set to -1 (0xFFFF or 0xFFFFFFFF) and the + ZIP64 format record should be created. + 5) The end of central directory record and the + Zip64 end of central directory locator record must + reside on the same disk when splitting or spanning + an archive. + */ + if (this.diskNumber === utils.MAX_VALUE_16BITS || this.diskWithCentralDirStart === utils.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === utils.MAX_VALUE_16BITS || this.centralDirRecords === utils.MAX_VALUE_16BITS || this.centralDirSize === utils.MAX_VALUE_32BITS || this.centralDirOffset === utils.MAX_VALUE_32BITS) { + this.zip64 = true; + + /* + Warning : the zip64 extension is supported, but ONLY if the 64bits integer read from + the zip file can fit into a 32bits integer. This cannot be solved : JavaScript represents + all numbers as 64-bit double precision IEEE 754 floating point numbers. + So, we have 53bits for integers and bitwise operations treat everything as 32bits. + see https://developer.mozilla.org/en-US/docs/JavaScript/Reference/Operators/Bitwise_Operators + and http://www.ecma-international.org/publications/files/ECMA-ST/ECMA-262.pdf section 8.5 + */ + + // should look for a zip64 EOCD locator + offset = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + if (offset < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator"); + } + this.reader.setIndex(offset); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_LOCATOR); + this.readBlockZip64EndOfCentralLocator(); + + // now the zip64 EOCD record + if (!this.isSignature(this.relativeOffsetEndOfZip64CentralDir, sig.ZIP64_CENTRAL_DIRECTORY_END)) { + // console.warn("ZIP64 end of central directory not where expected."); + this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + if (this.relativeOffsetEndOfZip64CentralDir < 0) { + throw new Error("Corrupted zip: can't find the ZIP64 end of central directory"); + } + } + this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir); + this.checkSignature(sig.ZIP64_CENTRAL_DIRECTORY_END); + this.readBlockZip64EndOfCentral(); + } + + var expectedEndOfCentralDirOffset = this.centralDirOffset + this.centralDirSize; + if (this.zip64) { + expectedEndOfCentralDirOffset += 20; // end of central dir 64 locator + expectedEndOfCentralDirOffset += 12 /* should not include the leading 12 bytes */ + this.zip64EndOfCentralSize; + } + + var extraBytes = endOfCentralDirOffset - expectedEndOfCentralDirOffset; + + if (extraBytes > 0) { + // console.warn(extraBytes, "extra bytes at beginning or within zipfile"); + if (this.isSignature(endOfCentralDirOffset, sig.CENTRAL_FILE_HEADER)) { + // The offsets seem wrong, but we have something at the specified offset. + // So… we keep it. + } else { + // the offset is wrong, update the "zero" of the reader + // this happens if data has been prepended (crx files for example) + this.reader.zero = extraBytes; + } + } else if (extraBytes < 0) { + throw new Error("Corrupted zip: missing " + Math.abs(extraBytes) + " bytes."); + } + }, + prepareReader: function(data) { + this.reader = readerFor(data); + }, + /** + * Read a zip file and create ZipEntries. + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the binary string representing a zip file. + */ + load: function(data) { + this.prepareReader(data); + this.readEndOfCentral(); + this.readCentralDir(); + this.readLocalFiles(); + } +}; +// }}} end of ZipEntries +module.exports = ZipEntries; + +},{"./reader/readerFor":22,"./signature":23,"./support":30,"./utf8":31,"./utils":32,"./zipEntry":34}],34:[function(require,module,exports){ +'use strict'; +var readerFor = require('./reader/readerFor'); +var utils = require('./utils'); +var CompressedObject = require('./compressedObject'); +var crc32fn = require('./crc32'); +var utf8 = require('./utf8'); +var compressions = require('./compressions'); +var support = require('./support'); + +var MADE_BY_DOS = 0x00; +var MADE_BY_UNIX = 0x03; + +/** + * Find a compression registered in JSZip. + * @param {string} compressionMethod the method magic to find. + * @return {Object|null} the JSZip compression object, null if none found. + */ +var findCompression = function(compressionMethod) { + for (var method in compressions) { + if (!compressions.hasOwnProperty(method)) { + continue; + } + if (compressions[method].magic === compressionMethod) { + return compressions[method]; + } + } + return null; +}; + +// class ZipEntry {{{ +/** + * An entry in the zip file. + * @constructor + * @param {Object} options Options of the current file. + * @param {Object} loadOptions Options for loading the stream. + */ +function ZipEntry(options, loadOptions) { + this.options = options; + this.loadOptions = loadOptions; +} +ZipEntry.prototype = { + /** + * say if the file is encrypted. + * @return {boolean} true if the file is encrypted, false otherwise. + */ + isEncrypted: function() { + // bit 1 is set + return (this.bitFlag & 0x0001) === 0x0001; + }, + /** + * say if the file has utf-8 filename/comment. + * @return {boolean} true if the filename/comment is in utf-8, false otherwise. + */ + useUTF8: function() { + // bit 11 is set + return (this.bitFlag & 0x0800) === 0x0800; + }, + /** + * Read the local part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readLocalPart: function(reader) { + var compression, localExtraFieldsLength; + + // we already know everything from the central dir ! + // If the central dir data are false, we are doomed. + // On the bright side, the local part is scary : zip64, data descriptors, both, etc. + // The less data we get here, the more reliable this should be. + // Let's skip the whole header and dash to the data ! + reader.skip(22); + // in some zip created on windows, the filename stored in the central dir contains \ instead of /. + // Strangely, the filename here is OK. + // I would love to treat these zip files as corrupted (see http://www.info-zip.org/FAQ.html#backslashes + // or APPNOTE#4.4.17.1, "All slashes MUST be forward slashes '/'") but there are a lot of bad zip generators... + // Search "unzip mismatching "local" filename continuing with "central" filename version" on + // the internet. + // + // I think I see the logic here : the central directory is used to display + // content and the local directory is used to extract the files. Mixing / and \ + // may be used to display \ to windows users and use / when extracting the files. + // Unfortunately, this lead also to some issues : http://seclists.org/fulldisclosure/2009/Sep/394 + this.fileNameLength = reader.readInt(2); + localExtraFieldsLength = reader.readInt(2); // can't be sure this will be the same as the central dir + // the fileName is stored as binary data, the handleUTF8 method will take care of the encoding. + this.fileName = reader.readData(this.fileNameLength); + reader.skip(localExtraFieldsLength); + + if (this.compressedSize === -1 || this.uncompressedSize === -1) { + throw new Error("Bug or corrupted zip : didn't get enough information from the central directory " + "(compressedSize === -1 || uncompressedSize === -1)"); + } + + compression = findCompression(this.compressionMethod); + if (compression === null) { // no compression found + throw new Error("Corrupted zip : compression " + utils.pretty(this.compressionMethod) + " unknown (inner file : " + utils.transformTo("string", this.fileName) + ")"); + } + this.decompressed = new CompressedObject(this.compressedSize, this.uncompressedSize, this.crc32, compression, reader.readData(this.compressedSize)); + }, + + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readCentralPart: function(reader) { + this.versionMadeBy = reader.readInt(2); + reader.skip(2); + // this.versionNeeded = reader.readInt(2); + this.bitFlag = reader.readInt(2); + this.compressionMethod = reader.readString(2); + this.date = reader.readDate(); + this.crc32 = reader.readInt(4); + this.compressedSize = reader.readInt(4); + this.uncompressedSize = reader.readInt(4); + var fileNameLength = reader.readInt(2); + this.extraFieldsLength = reader.readInt(2); + this.fileCommentLength = reader.readInt(2); + this.diskNumberStart = reader.readInt(2); + this.internalFileAttributes = reader.readInt(2); + this.externalFileAttributes = reader.readInt(4); + this.localHeaderOffset = reader.readInt(4); + + if (this.isEncrypted()) { + throw new Error("Encrypted zip are not supported"); + } + + // will be read in the local part, see the comments there + reader.skip(fileNameLength); + this.readExtraFields(reader); + this.parseZIP64ExtraField(reader); + this.fileComment = reader.readData(this.fileCommentLength); + }, + + /** + * Parse the external file attributes and get the unix/dos permissions. + */ + processAttributes: function () { + this.unixPermissions = null; + this.dosPermissions = null; + var madeBy = this.versionMadeBy >> 8; + + // Check if we have the DOS directory flag set. + // We look for it in the DOS and UNIX permissions + // but some unknown platform could set it as a compatibility flag. + this.dir = this.externalFileAttributes & 0x0010 ? true : false; + + if(madeBy === MADE_BY_DOS) { + // first 6 bits (0 to 5) + this.dosPermissions = this.externalFileAttributes & 0x3F; + } + + if(madeBy === MADE_BY_UNIX) { + this.unixPermissions = (this.externalFileAttributes >> 16) & 0xFFFF; + // the octal permissions are in (this.unixPermissions & 0x01FF).toString(8); + } + + // fail safe : if the name ends with a / it probably means a folder + if (!this.dir && this.fileNameStr.slice(-1) === '/') { + this.dir = true; + } + }, + + /** + * Parse the ZIP64 extra field and merge the info in the current ZipEntry. + * @param {DataReader} reader the reader to use. + */ + parseZIP64ExtraField: function(reader) { + + if (!this.extraFields[0x0001]) { + return; + } + + // should be something, preparing the extra reader + var extraReader = readerFor(this.extraFields[0x0001].value); + + // I really hope that these 64bits integer can fit in 32 bits integer, because js + // won't let us have more. + if (this.uncompressedSize === utils.MAX_VALUE_32BITS) { + this.uncompressedSize = extraReader.readInt(8); + } + if (this.compressedSize === utils.MAX_VALUE_32BITS) { + this.compressedSize = extraReader.readInt(8); + } + if (this.localHeaderOffset === utils.MAX_VALUE_32BITS) { + this.localHeaderOffset = extraReader.readInt(8); + } + if (this.diskNumberStart === utils.MAX_VALUE_32BITS) { + this.diskNumberStart = extraReader.readInt(4); + } + }, + /** + * Read the central part of a zip file and add the info in this object. + * @param {DataReader} reader the reader to use. + */ + readExtraFields: function(reader) { + var end = reader.index + this.extraFieldsLength, + extraFieldId, + extraFieldLength, + extraFieldValue; + + if (!this.extraFields) { + this.extraFields = {}; + } + + while (reader.index + 4 < end) { + extraFieldId = reader.readInt(2); + extraFieldLength = reader.readInt(2); + extraFieldValue = reader.readData(extraFieldLength); + + this.extraFields[extraFieldId] = { + id: extraFieldId, + length: extraFieldLength, + value: extraFieldValue + }; + } + + reader.setIndex(end); + }, + /** + * Apply an UTF8 transformation if needed. + */ + handleUTF8: function() { + var decodeParamType = support.uint8array ? "uint8array" : "array"; + if (this.useUTF8()) { + this.fileNameStr = utf8.utf8decode(this.fileName); + this.fileCommentStr = utf8.utf8decode(this.fileComment); + } else { + var upath = this.findExtraFieldUnicodePath(); + if (upath !== null) { + this.fileNameStr = upath; + } else { + // ASCII text or unsupported code page + var fileNameByteArray = utils.transformTo(decodeParamType, this.fileName); + this.fileNameStr = this.loadOptions.decodeFileName(fileNameByteArray); + } + + var ucomment = this.findExtraFieldUnicodeComment(); + if (ucomment !== null) { + this.fileCommentStr = ucomment; + } else { + // ASCII text or unsupported code page + var commentByteArray = utils.transformTo(decodeParamType, this.fileComment); + this.fileCommentStr = this.loadOptions.decodeFileName(commentByteArray); + } + } + }, + + /** + * Find the unicode path declared in the extra field, if any. + * @return {String} the unicode path, null otherwise. + */ + findExtraFieldUnicodePath: function() { + var upathField = this.extraFields[0x7075]; + if (upathField) { + var extraReader = readerFor(upathField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the filename changed, this field is out of date. + if (crc32fn(this.fileName) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(upathField.length - 5)); + } + return null; + }, + + /** + * Find the unicode comment declared in the extra field, if any. + * @return {String} the unicode comment, null otherwise. + */ + findExtraFieldUnicodeComment: function() { + var ucommentField = this.extraFields[0x6375]; + if (ucommentField) { + var extraReader = readerFor(ucommentField.value); + + // wrong version + if (extraReader.readInt(1) !== 1) { + return null; + } + + // the crc of the comment changed, this field is out of date. + if (crc32fn(this.fileComment) !== extraReader.readInt(4)) { + return null; + } + + return utf8.utf8decode(extraReader.readData(ucommentField.length - 5)); + } + return null; + } +}; +module.exports = ZipEntry; + +},{"./compressedObject":2,"./compressions":3,"./crc32":4,"./reader/readerFor":22,"./support":30,"./utf8":31,"./utils":32}],35:[function(require,module,exports){ +'use strict'; + +var StreamHelper = require('./stream/StreamHelper'); +var DataWorker = require('./stream/DataWorker'); +var utf8 = require('./utf8'); +var CompressedObject = require('./compressedObject'); +var GenericWorker = require('./stream/GenericWorker'); + +/** + * A simple object representing a file in the zip file. + * @constructor + * @param {string} name the name of the file + * @param {String|ArrayBuffer|Uint8Array|Buffer} data the data + * @param {Object} options the options of the file + */ +var ZipObject = function(name, data, options) { + this.name = name; + this.dir = options.dir; + this.date = options.date; + this.comment = options.comment; + this.unixPermissions = options.unixPermissions; + this.dosPermissions = options.dosPermissions; + + this._data = data; + this._dataBinary = options.binary; + // keep only the compression + this.options = { + compression : options.compression, + compressionOptions : options.compressionOptions + }; +}; + +ZipObject.prototype = { + /** + * Create an internal stream for the content of this object. + * @param {String} type the type of each chunk. + * @return StreamHelper the stream. + */ + internalStream: function (type) { + var result = null, outputType = "string"; + try { + if (!type) { + throw new Error("No output type specified."); + } + outputType = type.toLowerCase(); + var askUnicodeString = outputType === "string" || outputType === "text"; + if (outputType === "binarystring" || outputType === "text") { + outputType = "string"; + } + result = this._decompressWorker(); + + var isUnicodeString = !this._dataBinary; + + if (isUnicodeString && !askUnicodeString) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + if (!isUnicodeString && askUnicodeString) { + result = result.pipe(new utf8.Utf8DecodeWorker()); + } + } catch (e) { + result = new GenericWorker("error"); + result.error(e); + } + + return new StreamHelper(result, outputType, ""); + }, + + /** + * Prepare the content in the asked type. + * @param {String} type the type of the result. + * @param {Function} onUpdate a function to call on each internal update. + * @return Promise the promise of the result. + */ + async: function (type, onUpdate) { + return this.internalStream(type).accumulate(onUpdate); + }, + + /** + * Prepare the content as a nodejs stream. + * @param {String} type the type of each chunk. + * @param {Function} onUpdate a function to call on each internal update. + * @return Stream the stream. + */ + nodeStream: function (type, onUpdate) { + return this.internalStream(type || "nodebuffer").toNodejsStream(onUpdate); + }, + + /** + * Return a worker for the compressed content. + * @private + * @param {Object} compression the compression object to use. + * @param {Object} compressionOptions the options to use when compressing. + * @return Worker the worker. + */ + _compressWorker: function (compression, compressionOptions) { + if ( + this._data instanceof CompressedObject && + this._data.compression.magic === compression.magic + ) { + return this._data.getCompressedWorker(); + } else { + var result = this._decompressWorker(); + if(!this._dataBinary) { + result = result.pipe(new utf8.Utf8EncodeWorker()); + } + return CompressedObject.createWorkerFrom(result, compression, compressionOptions); + } + }, + /** + * Return a worker for the decompressed content. + * @private + * @return Worker the worker. + */ + _decompressWorker : function () { + if (this._data instanceof CompressedObject) { + return this._data.getContentWorker(); + } else if (this._data instanceof GenericWorker) { + return this._data; + } else { + return new DataWorker(this._data); + } + } +}; + +var removedMethods = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"]; +var removedFn = function () { + throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide."); +}; + +for(var i = 0; i < removedMethods.length; i++) { + ZipObject.prototype[removedMethods[i]] = removedFn; +} +module.exports = ZipObject; + +},{"./compressedObject":2,"./stream/DataWorker":27,"./stream/GenericWorker":28,"./stream/StreamHelper":29,"./utf8":31}],36:[function(require,module,exports){ +(function (global){ +'use strict'; +var Mutation = global.MutationObserver || global.WebKitMutationObserver; + +var scheduleDrain; + +{ + if (Mutation) { + var called = 0; + var observer = new Mutation(nextTick); + var element = global.document.createTextNode(''); + observer.observe(element, { + characterData: true + }); + scheduleDrain = function () { + element.data = (called = ++called % 2); + }; + } else if (!global.setImmediate && typeof global.MessageChannel !== 'undefined') { + var channel = new global.MessageChannel(); + channel.port1.onmessage = nextTick; + scheduleDrain = function () { + channel.port2.postMessage(0); + }; + } else if ('document' in global && 'onreadystatechange' in global.document.createElement('script')) { + scheduleDrain = function () { + + // Create a + + + + + + + + + +
+ +
+
+
+

Hierarchy For All Packages

+Package Hierarchies: + +
+
+
+

Class Hierarchy

+ +
+
+

Interface Hierarchy

+ +
+
+

Enum Hierarchy

+
    +
  • java.lang.Object +
      +
    • java.lang.Enum<E> (implements java.lang.Comparable<T>, java.io.Serializable) + +
    • +
    +
  • +
+
+
+
+
+ +
+ + diff --git a/cvc5-1.0.2/api/java/package-search-index.js b/cvc5-1.0.2/api/java/package-search-index.js new file mode 100644 index 0000000..32004a6 --- /dev/null +++ b/cvc5-1.0.2/api/java/package-search-index.js @@ -0,0 +1 @@ +packageSearchIndex = [{"l":"All Packages","url":"allpackages-index.html"},{"l":"io.github.cvc5"}] \ No newline at end of file diff --git a/cvc5-1.0.2/api/java/package-search-index.zip b/cvc5-1.0.2/api/java/package-search-index.zip new file mode 100644 index 0000000..668ff7d Binary files /dev/null and b/cvc5-1.0.2/api/java/package-search-index.zip differ diff --git a/cvc5-1.0.2/api/java/quickstart.html b/cvc5-1.0.2/api/java/quickstart.html new file mode 100644 index 0000000..5d75f82 --- /dev/null +++ b/cvc5-1.0.2/api/java/quickstart.html @@ -0,0 +1,1527 @@ + + + + + + + + Quickstart Guide — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+ +
+
+
+ +
+
+
+
+
+

+ Quickstart Guide + + ¶ + +

+

+ First, create a cvc5 + + Solver + + instance using try with resources: +

+
+
+
try (Solver solver = new Solver())
+{
+  /** write your code here */
+}
+
+
+
+

+ To produce models and unsat cores, we have to enable the following options. +

+
+
+
solver.setOption("produce-models", "true");
+solver.setOption("produce-unsat-cores", "true");
+
+
+
+

+ Next we set the logic. +The simplest way to set a logic for the solver is to choose + + + "ALL" + + + . +This enables all logics in the solver. +Alternatively, + + + "QF_ALL" + + + enables all logics without quantifiers. +To optimize the solver’s behavior for a more specific logic, +use the logic name, e.g. + + + "QF_BV" + + + or + + + "QF_AUFBV" + + + . +

+
+
+
solver.setLogic("ALL");
+
+
+
+

+ In the following, we will define real and integer constraints. +For this, we first query the solver for the corresponding sorts. +

+
+
+
Sort realSort = solver.getRealSort();
+Sort intSort = solver.getIntegerSort();
+
+
+
+

+ Now, we create two constants + + + x + + + and + + + y + + + of sort + + + Real + + + , +and two constants + + + a + + + and + + + b + + + of sort + + + Integer + + + . +Notice that these are + + symbolic + + constants, not actual values. +

+
+
+
Term x = solver.mkConst(realSort, "x");
+Term y = solver.mkConst(realSort, "y");
+Term a = solver.mkConst(intSort, "a");
+Term b = solver.mkConst(intSort, "b");
+
+
+
+

+ We define the following constraints regarding + + + x + + + and + + + y + + + : +

+
+ \[(0 < x) \wedge (0 < y) \wedge (x + y < 1) \wedge (x \leq y)\] +
+

+ We construct the required terms and assert them as follows: +

+
+
+
// Formally, constraints are also terms. Their sort is Boolean.
+// We will construct these constraints gradually,
+// by defining each of their components.
+// We start with the constant numerals 0 and 1:
+Term zero = solver.mkReal(0);
+Term one = solver.mkReal(1);
+
+// Next, we construct the term x + y
+Term xPlusY = solver.mkTerm(Kind.ADD, x, y);
+
+// Now we can define the constraints.
+// They use the operators +, <=, and <.
+// In the API, these are denoted by ADD, LEQ, and LT.
+// A list of available operators is available in:
+// src/api/cpp/cvc5_kind.h
+Term constraint1 = solver.mkTerm(Kind.LT, zero, x);
+Term constraint2 = solver.mkTerm(Kind.LT, zero, y);
+Term constraint3 = solver.mkTerm(Kind.LT, xPlusY, one);
+Term constraint4 = solver.mkTerm(Kind.LEQ, x, y);
+
+// Now we assert the constraints to the solver.
+solver.assertFormula(constraint1);
+solver.assertFormula(constraint2);
+solver.assertFormula(constraint3);
+solver.assertFormula(constraint4);
+
+
+
+

+ Now we check if the asserted formula is satisfiable, that is, we check if +there exist values of sort + + + Real + + + for + + + x + + + and + + + y + + + that satisfy all +the constraints. +

+
+
+
Result r1 = solver.checkSat();
+
+
+
+

+ The result we get from this satisfiability check is either + + + sat + + + , + + + unsat + + + or + + + unknown + + + . +It’s status can be queried via + + Result.isSat + + , + + Result.isUnsat + + and + + Result.isSatUnknown + + . +Alternatively, it can also be printed. +

+
+
+
System.out.println("expected: sat");
+System.out.println("result: " + r1);
+
+
+
+

+ This will print: +

+
+
+
expected: sat
+result: sat
+
+
+
+

+ Now, we query the solver for the values for + + + x + + + and + + + y + + + that satisfy +the constraints. +

+
+
+
Term xVal = solver.getValue(x);
+Term yVal = solver.getValue(y);
+
+
+
+

+ It is also possible to get values for terms that do not appear in the original +formula. +

+
+
+
Term xMinusY = solver.mkTerm(Kind.SUB, x, y);
+Term xMinusYVal = solver.getValue(xMinusY);
+
+
+
+

+ We can convert these values to Java types. +

+
+
+
Pair<BigInteger, BigInteger> xPair = xVal.getRealValue();
+Pair<BigInteger, BigInteger> yPair = yVal.getRealValue();
+Pair<BigInteger, BigInteger> xMinusYPair = xMinusYVal.getRealValue();
+
+System.out.println("value for x: " + xPair.first + "/" + xPair.second);
+System.out.println("value for y: " + yPair.first + "/" + yPair.second);
+System.out.println("value for x - y: " + xMinusYPair.first + "/" + xMinusYPair.second);
+
+
+
+

+ Another way to independently compute the value of + + + x + + + - + + + y + + + would be to +perform the (rational) arithmetic manually. +However, for more complex terms, it is easier to let the solver do the +evaluation. +

+
+
+
Pair<BigInteger, BigInteger> xMinusYComputed =
+    new Pair(xPair.first.multiply(yPair.second).subtract(xPair.second.multiply(yPair.first)),
+        xPair.second.multiply(yPair.second));
+BigInteger g = xMinusYComputed.first.gcd(xMinusYComputed.second);
+xMinusYComputed = new Pair(xMinusYComputed.first.divide(g), xMinusYComputed.second.divide(g));
+if (xMinusYComputed.equals(xMinusYPair))
+{
+  System.out.println("computed correctly");
+}
+else
+{
+  System.out.println("computed incorrectly");
+}
+
+
+
+

+ This will print: +

+
+
+
computed correctly
+
+
+
+

+ Next, we will check satisfiability of the same formula, +only this time over integer variables + + + a + + + and + + + b + + + . +For this, we first reset the assertions added to the solver. +

+
+
+
solver.resetAssertions();
+
+
+
+

+ Next, we assert the same assertions as above, but with integers. +This time, we inline the construction of terms +in the assertion command. +

+
+
+
solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), a));
+solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), b));
+solver.assertFormula(
+    solver.mkTerm(Kind.LT, solver.mkTerm(Kind.ADD, a, b), solver.mkInteger(1)));
+solver.assertFormula(solver.mkTerm(Kind.LEQ, a, b));
+
+
+
+

+ Now, we check whether the revised assertion is satisfiable. +

+
+
+
Result r2 = solver.checkSat();
+
+// This time the formula is unsatisfiable
+System.out.println("expected: unsat");
+System.out.println("result: " + r2);
+
+
+
+

+ This time the asserted formula is unsatisfiable: +

+
+
+
expected: unsat
+result: unsat
+
+
+
+

+ We can query the solver for an unsatisfiable core, that is, a subset +of the assertions that is already unsatisfiable. +

+
+
+
List<Term> unsatCore = Arrays.asList(solver.getUnsatCore());
+System.out.println("unsat core size: " + unsatCore.size());
+System.out.println("unsat core: ");
+for (Term t : unsatCore)
+{
+  System.out.println(t);
+}
+
+
+
+

+ This will print: +

+
+
+
unsat core size: 3
+unsat core:
+(< 0 a)
+(< 0 b)
+(< (+ a b) 1)
+
+
+
+
+

+ Example + + ¶ + +

+
+
+ + + + + +
+
+

+ + examples/api/java/QuickStart.java + +

+
+
+
  1 /******************************************************************************
+  2  * Top contributors (to current version):
+  3  *   Mudathir Mohamed, Aina Niemetz, Andres Noetzli
+  4  *
+  5  * This file is part of the cvc5 project.
+  6  *
+  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
+  8  * in the top-level source directory and their institutional affiliations.
+  9  * All rights reserved.  See the file COPYING in the top-level source
+ 10  * directory for licensing information.
+ 11  * ****************************************************************************
+ 12  *
+ 13  * A simple demonstration of the api capabilities of cvc5.
+ 14  *
+ 15  */
+ 16 
+ 17 import io.github.cvc5.*;
+ 18 import java.math.BigInteger;
+ 19 import java.util.ArrayList;
+ 20 import java.util.Arrays;
+ 21 import java.util.List;
+ 22 
+ 23 public class QuickStart
+ 24 {
+ 25   public static void main(String args[]) throws CVC5ApiException
+ 26   {
+ 27     // Create a solver
+ 28     try (Solver solver = new Solver())
+ 29     {
+ 30       // We will ask the solver to produce models and unsat cores,
+ 31       // hence these options should be turned on.
+ 32       //! [docs-java-quickstart-1 start]
+ 33       solver.setOption("produce-models", "true");
+ 34       solver.setOption("produce-unsat-cores", "true");
+ 35       //! [docs-java-quickstart-1 end]
+ 36 
+ 37       // The simplest way to set a logic for the solver is to choose "ALL".
+ 38       // This enables all logics in the solver.
+ 39       // Alternatively, "QF_ALL" enables all logics without quantifiers.
+ 40       // To optimize the solver's behavior for a more specific logic,
+ 41       // use the logic name, e.g. "QF_BV" or "QF_AUFBV".
+ 42 
+ 43       // Set the logic
+ 44       //! [docs-java-quickstart-2 start]
+ 45       solver.setLogic("ALL");
+ 46       //! [docs-java-quickstart-2 end]
+ 47 
+ 48       // In this example, we will define constraints over reals and integers.
+ 49       // Hence, we first obtain the corresponding sorts.
+ 50       //! [docs-java-quickstart-3 start]
+ 51       Sort realSort = solver.getRealSort();
+ 52       Sort intSort = solver.getIntegerSort();
+ 53       //! [docs-java-quickstart-3 end]
+ 54 
+ 55       // x and y will be real variables, while a and b will be integer variables.
+ 56       // Formally, their cpp type is Term,
+ 57       // and they are called "constants" in SMT jargon:
+ 58       //! [docs-java-quickstart-4 start]
+ 59       Term x = solver.mkConst(realSort, "x");
+ 60       Term y = solver.mkConst(realSort, "y");
+ 61       Term a = solver.mkConst(intSort, "a");
+ 62       Term b = solver.mkConst(intSort, "b");
+ 63       //! [docs-java-quickstart-4 end]
+ 64 
+ 65       // Our constraints regarding x and y will be:
+ 66       //
+ 67       //   (1)  0 < x
+ 68       //   (2)  0 < y
+ 69       //   (3)  x + y < 1
+ 70       //   (4)  x <= y
+ 71       //
+ 72 
+ 73       //! [docs-java-quickstart-5 start]
+ 74       // Formally, constraints are also terms. Their sort is Boolean.
+ 75       // We will construct these constraints gradually,
+ 76       // by defining each of their components.
+ 77       // We start with the constant numerals 0 and 1:
+ 78       Term zero = solver.mkReal(0);
+ 79       Term one = solver.mkReal(1);
+ 80 
+ 81       // Next, we construct the term x + y
+ 82       Term xPlusY = solver.mkTerm(Kind.ADD, x, y);
+ 83 
+ 84       // Now we can define the constraints.
+ 85       // They use the operators +, <=, and <.
+ 86       // In the API, these are denoted by ADD, LEQ, and LT.
+ 87       // A list of available operators is available in:
+ 88       // src/api/cpp/cvc5_kind.h
+ 89       Term constraint1 = solver.mkTerm(Kind.LT, zero, x);
+ 90       Term constraint2 = solver.mkTerm(Kind.LT, zero, y);
+ 91       Term constraint3 = solver.mkTerm(Kind.LT, xPlusY, one);
+ 92       Term constraint4 = solver.mkTerm(Kind.LEQ, x, y);
+ 93 
+ 94       // Now we assert the constraints to the solver.
+ 95       solver.assertFormula(constraint1);
+ 96       solver.assertFormula(constraint2);
+ 97       solver.assertFormula(constraint3);
+ 98       solver.assertFormula(constraint4);
+ 99       //! [docs-java-quickstart-5 end]
+100 
+101       // Check if the formula is satisfiable, that is,
+102       // are there real values for x and y that satisfy all the constraints?
+103       //! [docs-java-quickstart-6 start]
+104       Result r1 = solver.checkSat();
+105       //! [docs-java-quickstart-6 end]
+106 
+107       // The result is either SAT, UNSAT, or UNKNOWN.
+108       // In this case, it is SAT.
+109       //! [docs-java-quickstart-7 start]
+110       System.out.println("expected: sat");
+111       System.out.println("result: " + r1);
+112       //! [docs-java-quickstart-7 end]
+113 
+114       // We can get the values for x and y that satisfy the constraints.
+115       //! [docs-java-quickstart-8 start]
+116       Term xVal = solver.getValue(x);
+117       Term yVal = solver.getValue(y);
+118       //! [docs-java-quickstart-8 end]
+119 
+120       // It is also possible to get values for compound terms,
+121       // even if those did not appear in the original formula.
+122       //! [docs-java-quickstart-9 start]
+123       Term xMinusY = solver.mkTerm(Kind.SUB, x, y);
+124       Term xMinusYVal = solver.getValue(xMinusY);
+125       //! [docs-java-quickstart-9 end]
+126 
+127       // Further, we can convert the values to java types
+128       //! [docs-java-quickstart-10 start]
+129       Pair<BigInteger, BigInteger> xPair = xVal.getRealValue();
+130       Pair<BigInteger, BigInteger> yPair = yVal.getRealValue();
+131       Pair<BigInteger, BigInteger> xMinusYPair = xMinusYVal.getRealValue();
+132 
+133       System.out.println("value for x: " + xPair.first + "/" + xPair.second);
+134       System.out.println("value for y: " + yPair.first + "/" + yPair.second);
+135       System.out.println("value for x - y: " + xMinusYPair.first + "/" + xMinusYPair.second);
+136       //! [docs-java-quickstart-10 end]
+137 
+138       // Another way to independently compute the value of x - y would be
+139       // to perform the (rational) arithmetic manually.
+140       // However, for more complex terms,
+141       // it is easier to let the solver do the evaluation.
+142       //! [docs-java-quickstart-11 start]
+143       Pair<BigInteger, BigInteger> xMinusYComputed =
+144           new Pair(xPair.first.multiply(yPair.second).subtract(xPair.second.multiply(yPair.first)),
+145               xPair.second.multiply(yPair.second));
+146       BigInteger g = xMinusYComputed.first.gcd(xMinusYComputed.second);
+147       xMinusYComputed = new Pair(xMinusYComputed.first.divide(g), xMinusYComputed.second.divide(g));
+148       if (xMinusYComputed.equals(xMinusYPair))
+149       {
+150         System.out.println("computed correctly");
+151       }
+152       else
+153       {
+154         System.out.println("computed incorrectly");
+155       }
+156       //! [docs-java-quickstart-11 end]
+157 
+158       // Next, we will check satisfiability of the same formula,
+159       // only this time over integer variables a and b.
+160 
+161       // We start by resetting assertions added to the solver.
+162       //! [docs-java-quickstart-12 start]
+163       solver.resetAssertions();
+164       //! [docs-java-quickstart-12 end]
+165 
+166       // Next, we assert the same assertions above with integers.
+167       // This time, we inline the construction of terms
+168       // to the assertion command.
+169       //! [docs-java-quickstart-13 start]
+170       solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), a));
+171       solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), b));
+172       solver.assertFormula(
+173           solver.mkTerm(Kind.LT, solver.mkTerm(Kind.ADD, a, b), solver.mkInteger(1)));
+174       solver.assertFormula(solver.mkTerm(Kind.LEQ, a, b));
+175       //! [docs-java-quickstart-13 end]
+176 
+177       // We check whether the revised assertion is satisfiable.
+178       //! [docs-java-quickstart-14 start]
+179       Result r2 = solver.checkSat();
+180 
+181       // This time the formula is unsatisfiable
+182       System.out.println("expected: unsat");
+183       System.out.println("result: " + r2);
+184       //! [docs-java-quickstart-14 end]
+185 
+186       // We can query the solver for an unsatisfiable core, i.e., a subset
+187       // of the assertions that is already unsatisfiable.
+188       //! [docs-java-quickstart-15 start]
+189       List<Term> unsatCore = Arrays.asList(solver.getUnsatCore());
+190       System.out.println("unsat core size: " + unsatCore.size());
+191       System.out.println("unsat core: ");
+192       for (Term t : unsatCore)
+193       {
+194         System.out.println(t);
+195       }
+196       //! [docs-java-quickstart-15 end]
+197     }
+198   }
+199 }
+
+
+
+
+ + + + +
+
+
+
+
+ +
+
+
+
+ + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/java/resources/glass.png b/cvc5-1.0.2/api/java/resources/glass.png new file mode 100644 index 0000000..a7f591f Binary files /dev/null and b/cvc5-1.0.2/api/java/resources/glass.png differ diff --git a/cvc5-1.0.2/api/java/resources/x.png b/cvc5-1.0.2/api/java/resources/x.png new file mode 100644 index 0000000..30548a7 Binary files /dev/null and b/cvc5-1.0.2/api/java/resources/x.png differ diff --git a/cvc5-1.0.2/api/java/script.js b/cvc5-1.0.2/api/java/script.js new file mode 100644 index 0000000..7dc93c4 --- /dev/null +++ b/cvc5-1.0.2/api/java/script.js @@ -0,0 +1,149 @@ +/* + * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var moduleSearchIndex; +var packageSearchIndex; +var typeSearchIndex; +var memberSearchIndex; +var tagSearchIndex; +function loadScripts(doc, tag) { + createElem(doc, tag, 'jquery/jszip/dist/jszip.js'); + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils.js'); + if (window.navigator.userAgent.indexOf('MSIE ') > 0 || window.navigator.userAgent.indexOf('Trident/') > 0 || + window.navigator.userAgent.indexOf('Edge/') > 0) { + createElem(doc, tag, 'jquery/jszip-utils/dist/jszip-utils-ie.js'); + } + createElem(doc, tag, 'search.js'); + + $.get(pathtoroot + "module-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "module-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("module-search-index.json").async("text").then(function(content){ + moduleSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "package-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "package-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("package-search-index.json").async("text").then(function(content){ + packageSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "type-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "type-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("type-search-index.json").async("text").then(function(content){ + typeSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "member-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "member-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("member-search-index.json").async("text").then(function(content){ + memberSearchIndex = JSON.parse(content); + }); + }); + }); + }); + $.get(pathtoroot + "tag-search-index.zip") + .done(function() { + JSZipUtils.getBinaryContent(pathtoroot + "tag-search-index.zip", function(e, data) { + JSZip.loadAsync(data).then(function(zip){ + zip.file("tag-search-index.json").async("text").then(function(content){ + tagSearchIndex = JSON.parse(content); + }); + }); + }); + }); + if (!moduleSearchIndex) { + createElem(doc, tag, 'module-search-index.js'); + } + if (!packageSearchIndex) { + createElem(doc, tag, 'package-search-index.js'); + } + if (!typeSearchIndex) { + createElem(doc, tag, 'type-search-index.js'); + } + if (!memberSearchIndex) { + createElem(doc, tag, 'member-search-index.js'); + } + if (!tagSearchIndex) { + createElem(doc, tag, 'tag-search-index.js'); + } + $(window).resize(function() { + $('.navPadding').css('padding-top', $('.fixedNav').css("height")); + }); +} + +function createElem(doc, tag, path) { + var script = doc.createElement(tag); + var scriptElement = doc.getElementsByTagName(tag)[0]; + script.src = pathtoroot + path; + scriptElement.parentNode.insertBefore(script, scriptElement); +} + +function show(type) { + count = 0; + for (var key in data) { + var row = document.getElementById(key); + if ((data[key] & type) !== 0) { + row.style.display = ''; + row.className = (count++ % 2) ? rowColor : altColor; + } + else + row.style.display = 'none'; + } + updateTabs(type); +} + +function updateTabs(type) { + for (var value in tabs) { + var sNode = document.getElementById(tabs[value][0]); + var spanNode = sNode.firstChild; + if (value == type) { + sNode.className = activeTableTab; + spanNode.innerHTML = tabs[value][1]; + } + else { + sNode.className = tableTab; + spanNode.innerHTML = "" + tabs[value][1] + ""; + } + } +} + +function updateModuleFrame(pFrame, cFrame) { + top.packageFrame.location = pFrame; + top.classFrame.location = cFrame; +} diff --git a/cvc5-1.0.2/api/java/search.js b/cvc5-1.0.2/api/java/search.js new file mode 100644 index 0000000..b773531 --- /dev/null +++ b/cvc5-1.0.2/api/java/search.js @@ -0,0 +1,326 @@ +/* + * Copyright (c) 2015, 2018, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +var noResult = {l: "No results found"}; +var catModules = "Modules"; +var catPackages = "Packages"; +var catTypes = "Types"; +var catMembers = "Members"; +var catSearchTags = "SearchTags"; +var highlight = "$&"; +var camelCaseRegexp = ""; +var secondaryMatcher = ""; +function getHighlightedText(item) { + var ccMatcher = new RegExp(camelCaseRegexp); + var label = item.replace(ccMatcher, highlight); + if (label === item) { + label = item.replace(secondaryMatcher, highlight); + } + return label; +} +function getURLPrefix(ui) { + var urlPrefix=""; + if (useModuleDirectories) { + var slash = "/"; + if (ui.item.category === catModules) { + return ui.item.l + slash; + } else if (ui.item.category === catPackages && ui.item.m) { + return ui.item.m + slash; + } else if ((ui.item.category === catTypes && ui.item.p) || ui.item.category === catMembers) { + $.each(packageSearchIndex, function(index, item) { + if (ui.item.p == item.l) { + urlPrefix = item.m + slash; + } + }); + return urlPrefix; + } else { + return urlPrefix; + } + } + return urlPrefix; +} +var watermark = 'Search'; +$(function() { + $("#search").val(''); + $("#search").prop("disabled", false); + $("#reset").prop("disabled", false); + $("#search").val(watermark).addClass('watermark'); + $("#search").blur(function() { + if ($(this).val().length == 0) { + $(this).val(watermark).addClass('watermark'); + } + }); + $("#search").on('click keydown', function() { + if ($(this).val() == watermark) { + $(this).val('').removeClass('watermark'); + } + }); + $("#reset").click(function() { + $("#search").val(''); + $("#search").focus(); + }); + $("#search").focus(); + $("#search")[0].setSelectionRange(0, 0); +}); +$.widget("custom.catcomplete", $.ui.autocomplete, { + _create: function() { + this._super(); + this.widget().menu("option", "items", "> :not(.ui-autocomplete-category)"); + }, + _renderMenu: function(ul, items) { + var rMenu = this, + currentCategory = ""; + rMenu.menu.bindings = $(); + $.each(items, function(index, item) { + var li; + if (item.l !== noResult.l && item.category !== currentCategory) { + ul.append("
  • " + item.category + "
  • "); + currentCategory = item.category; + } + li = rMenu._renderItemData(ul, item); + if (item.category) { + li.attr("aria-label", item.category + " : " + item.l); + li.attr("class", "resultItem"); + } else { + li.attr("aria-label", item.l); + li.attr("class", "resultItem"); + } + }); + }, + _renderItem: function(ul, item) { + var label = ""; + if (item.category === catModules) { + label = getHighlightedText(item.l); + } else if (item.category === catPackages) { + label = (item.m) + ? getHighlightedText(item.m + "/" + item.l) + : getHighlightedText(item.l); + } else if (item.category === catTypes) { + label = (item.p) + ? getHighlightedText(item.p + "." + item.l) + : getHighlightedText(item.l); + } else if (item.category === catMembers) { + label = getHighlightedText(item.p + "." + (item.c + "." + item.l)); + } else if (item.category === catSearchTags) { + label = getHighlightedText(item.l); + } else { + label = item.l; + } + var li = $("
  • ").appendTo(ul); + var div = $("
    ").appendTo(li); + if (item.category === catSearchTags) { + if (item.d) { + div.html(label + " (" + item.h + ")
    " + + item.d + "
    "); + } else { + div.html(label + " (" + item.h + ")"); + } + } else { + div.html(label); + } + return li; + } +}); +$(function() { + $("#search").catcomplete({ + minLength: 1, + delay: 100, + source: function(request, response) { + var result = new Array(); + var presult = new Array(); + var tresult = new Array(); + var mresult = new Array(); + var tgresult = new Array(); + var secondaryresult = new Array(); + var displayCount = 0; + var exactMatcher = new RegExp("^" + $.ui.autocomplete.escapeRegex(request.term) + "$", "i"); + camelCaseRegexp = ($.ui.autocomplete.escapeRegex(request.term)).split(/(?=[A-Z])/).join("([a-z0-9_$]*?)"); + var camelCaseMatcher = new RegExp("^" + camelCaseRegexp); + secondaryMatcher = new RegExp($.ui.autocomplete.escapeRegex(request.term), "i"); + + // Return the nested innermost name from the specified object + function nestedName(e) { + return e.l.substring(e.l.lastIndexOf(".") + 1); + } + + function concatResults(a1, a2) { + a1 = a1.concat(a2); + a2.length = 0; + return a1; + } + + if (moduleSearchIndex) { + var mdleCount = 0; + $.each(moduleSearchIndex, function(index, item) { + item.category = catModules; + if (exactMatcher.test(item.l)) { + result.push(item); + mdleCount++; + } else if (camelCaseMatcher.test(item.l)) { + result.push(item); + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + displayCount = mdleCount; + result = concatResults(result, secondaryresult); + } + if (packageSearchIndex) { + var pCount = 0; + var pkg = ""; + $.each(packageSearchIndex, function(index, item) { + item.category = catPackages; + pkg = (item.m) + ? (item.m + "/" + item.l) + : item.l; + if (exactMatcher.test(item.l)) { + presult.push(item); + pCount++; + } else if (camelCaseMatcher.test(pkg)) { + presult.push(item); + } else if (secondaryMatcher.test(pkg)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(presult, secondaryresult)); + displayCount = (pCount > displayCount) ? pCount : displayCount; + } + if (typeSearchIndex) { + var tCount = 0; + $.each(typeSearchIndex, function(index, item) { + item.category = catTypes; + var s = nestedName(item); + if (exactMatcher.test(s)) { + tresult.push(item); + tCount++; + } else if (camelCaseMatcher.test(s)) { + tresult.push(item); + } else if (secondaryMatcher.test(item.p + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tresult, secondaryresult)); + displayCount = (tCount > displayCount) ? tCount : displayCount; + } + if (memberSearchIndex) { + var mCount = 0; + $.each(memberSearchIndex, function(index, item) { + item.category = catMembers; + var s = nestedName(item); + if (exactMatcher.test(s)) { + mresult.push(item); + mCount++; + } else if (camelCaseMatcher.test(s)) { + mresult.push(item); + } else if (secondaryMatcher.test(item.c + "." + item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(mresult, secondaryresult)); + displayCount = (mCount > displayCount) ? mCount : displayCount; + } + if (tagSearchIndex) { + var tgCount = 0; + $.each(tagSearchIndex, function(index, item) { + item.category = catSearchTags; + if (exactMatcher.test(item.l)) { + tgresult.push(item); + tgCount++; + } else if (secondaryMatcher.test(item.l)) { + secondaryresult.push(item); + } + }); + result = result.concat(concatResults(tgresult, secondaryresult)); + displayCount = (tgCount > displayCount) ? tgCount : displayCount; + } + displayCount = (displayCount > 500) ? displayCount : 500; + var counter = function() { + var count = {Modules: 0, Packages: 0, Types: 0, Members: 0, SearchTags: 0}; + var f = function(item) { + count[item.category] += 1; + return (count[item.category] <= displayCount); + }; + return f; + }(); + response(result.filter(counter)); + }, + response: function(event, ui) { + if (!ui.content.length) { + ui.content.push(noResult); + } else { + $("#search").empty(); + } + }, + autoFocus: true, + position: { + collision: "flip" + }, + select: function(event, ui) { + if (ui.item.l !== noResult.l) { + var url = getURLPrefix(ui); + if (ui.item.category === catModules) { + if (useModuleDirectories) { + url += "module-summary.html"; + } else { + url = ui.item.l + "-summary.html"; + } + } else if (ui.item.category === catPackages) { + if (ui.item.url) { + url = ui.item.url; + } else { + url += ui.item.l.replace(/\./g, '/') + "/package-summary.html"; + } + } else if (ui.item.category === catTypes) { + if (ui.item.url) { + url = ui.item.url; + } else if (ui.item.p === "") { + url += ui.item.l + ".html"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.l + ".html"; + } + } else if (ui.item.category === catMembers) { + if (ui.item.p === "") { + url += ui.item.c + ".html" + "#"; + } else { + url += ui.item.p.replace(/\./g, '/') + "/" + ui.item.c + ".html" + "#"; + } + if (ui.item.url) { + url += ui.item.url; + } else { + url += ui.item.l; + } + } else if (ui.item.category === catSearchTags) { + url += ui.item.u; + } + if (top !== window) { + parent.classFrame.location = pathtoroot + url; + } else { + window.location.href = pathtoroot + url; + } + $("#search").focus(); + } + } + }); +}); diff --git a/cvc5-1.0.2/api/java/serialized-form.html b/cvc5-1.0.2/api/java/serialized-form.html new file mode 100644 index 0000000..c8f3b42 --- /dev/null +++ b/cvc5-1.0.2/api/java/serialized-form.html @@ -0,0 +1,168 @@ + + + + + +Serialized Form + + + + + + + + + + + + + +
    + +
    +
    +
    +

    Serialized Form

    +
    +
    + +
    +
    +
    + +
    + + diff --git a/cvc5-1.0.2/api/java/stylesheet.css b/cvc5-1.0.2/api/java/stylesheet.css new file mode 100644 index 0000000..fa24676 --- /dev/null +++ b/cvc5-1.0.2/api/java/stylesheet.css @@ -0,0 +1,906 @@ +/* + * Javadoc style sheet + */ + +@import url('resources/fonts/dejavu.css'); + +/* + * Styles for individual HTML elements. + * + * These are styles that are specific to individual HTML elements. Changing them affects the style of a particular + * HTML element throughout the page. + */ + +body { + background-color:#ffffff; + color:#353833; + font-family:'DejaVu Sans', Arial, Helvetica, sans-serif; + font-size:14px; + margin:0; + padding:0; + height:100%; + width:100%; +} +iframe { + margin:0; + padding:0; + height:100%; + width:100%; + overflow-y:scroll; + border:none; +} +a:link, a:visited { + text-decoration:none; + color:#4A6782; +} +a[href]:hover, a[href]:focus { + text-decoration:none; + color:#bb7a2a; +} +a[name] { + color:#353833; +} +a[name]:before, a[name]:target, a[id]:before, a[id]:target { + content:""; + display:inline-block; + position:relative; + padding-top:129px; + margin-top:-129px; +} +pre { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; +} +h1 { + font-size:20px; +} +h2 { + font-size:18px; +} +h3 { + font-size:16px; + font-style:italic; +} +h4 { + font-size:13px; +} +h5 { + font-size:12px; +} +h6 { + font-size:11px; +} +ul { + list-style-type:disc; +} +code, tt { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + padding-top:4px; + margin-top:8px; + line-height:1.4em; +} +dt code { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + padding-top:4px; +} +table tr td dt code { + font-family:'DejaVu Sans Mono', monospace; + font-size:14px; + vertical-align:top; + padding-top:4px; +} +sup { + font-size:8px; +} + +/* + * Styles for HTML generated by javadoc. + * + * These are style classes that are used by the standard doclet to generate HTML documentation. + */ + +/* + * Styles for document title and copyright. + */ +.clear { + clear:both; + height:0px; + overflow:hidden; +} +.aboutLanguage { + float:right; + padding:0px 21px; + font-size:11px; + z-index:200; + margin-top:-9px; +} +.legalCopy { + margin-left:.5em; +} +.bar a, .bar a:link, .bar a:visited, .bar a:active { + color:#FFFFFF; + text-decoration:none; +} +.bar a:hover, .bar a:focus { + color:#bb7a2a; +} +.tab { + background-color:#0066FF; + color:#ffffff; + padding:8px; + width:5em; + font-weight:bold; +} +/* + * Styles for navigation bar. + */ +.bar { + background-color:#4D7A97; + color:#FFFFFF; + padding:.8em .5em .4em .8em; + height:auto;/*height:1.8em;*/ + font-size:11px; + margin:0; +} +.navPadding { + padding-top: 107px; +} +.fixedNav { + position:fixed; + width:100%; + z-index:999; + background-color:#ffffff; +} +.topNav { + background-color:#4D7A97; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; + font-size:12px; +} +.bottomNav { + margin-top:10px; + background-color:#4D7A97; + color:#FFFFFF; + float:left; + padding:0; + width:100%; + clear:right; + height:2.8em; + padding-top:10px; + overflow:hidden; + font-size:12px; +} +.subNav { + background-color:#dee3e9; + float:left; + width:100%; + overflow:hidden; + font-size:12px; +} +.subNav div { + clear:left; + float:left; + padding:0 0 5px 6px; + text-transform:uppercase; +} +ul.navList, ul.subNavList { + float:left; + margin:0 25px 0 0; + padding:0; +} +ul.navList li{ + list-style:none; + float:left; + padding: 5px 6px; + text-transform:uppercase; +} +ul.navListSearch { + float:right; + margin:0 0 0 0; + padding:0; +} +ul.navListSearch li { + list-style:none; + float:right; + padding: 5px 6px; + text-transform:uppercase; +} +ul.navListSearch li label { + position:relative; + right:-16px; +} +ul.subNavList li { + list-style:none; + float:left; +} +.topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited { + color:#FFFFFF; + text-decoration:none; + text-transform:uppercase; +} +.topNav a:hover, .bottomNav a:hover { + text-decoration:none; + color:#bb7a2a; + text-transform:uppercase; +} +.navBarCell1Rev { + background-color:#F8981D; + color:#253441; + margin: auto 5px; +} +.skipNav { + position:absolute; + top:auto; + left:-9999px; + overflow:hidden; +} +/* + * Styles for page header and footer. + */ +.header, .footer { + clear:both; + margin:0 20px; + padding:5px 0 0 0; +} +.indexNav { + position:relative; + font-size:12px; + background-color:#dee3e9; +} +.indexNav ul { + margin-top:0; + padding:5px; +} +.indexNav ul li { + display:inline; + list-style-type:none; + padding-right:10px; + text-transform:uppercase; +} +.indexNav h1 { + font-size:13px; +} +.title { + color:#2c4557; + margin:10px 0; +} +.subTitle { + margin:5px 0 0 0; +} +.header ul { + margin:0 0 15px 0; + padding:0; +} +.footer ul { + margin:20px 0 5px 0; +} +.header ul li, .footer ul li { + list-style:none; + font-size:13px; +} +/* + * Styles for headings. + */ +div.details ul.blockList ul.blockList ul.blockList li.blockList h4, div.details ul.blockList ul.blockList ul.blockListLast li.blockList h4 { + background-color:#dee3e9; + border:1px solid #d0d9e0; + margin:0 0 6px -8px; + padding:7px 5px; +} +ul.blockList ul.blockList ul.blockList li.blockList h3 { + background-color:#dee3e9; + border:1px solid #d0d9e0; + margin:0 0 6px -8px; + padding:7px 5px; +} +ul.blockList ul.blockList li.blockList h3 { + padding:0; + margin:15px 0; +} +ul.blockList li.blockList h2 { + padding:0px 0 20px 0; +} +/* + * Styles for page layout containers. + */ +.contentContainer, .sourceContainer, .classUseContainer, .serializedFormContainer, .constantValuesContainer, +.allClassesContainer, .allPackagesContainer { + clear:both; + padding:10px 20px; + position:relative; +} +.indexContainer { + margin:10px; + position:relative; + font-size:12px; +} +.indexContainer h2 { + font-size:13px; + padding:0 0 3px 0; +} +.indexContainer ul { + margin:0; + padding:0; +} +.indexContainer ul li { + list-style:none; + padding-top:2px; +} +.contentContainer .description dl dt, .contentContainer .details dl dt, .serializedFormContainer dl dt { + font-size:12px; + font-weight:bold; + margin:10px 0 0 0; + color:#4E4E4E; +} +.contentContainer .description dl dd, .contentContainer .details dl dd, .serializedFormContainer dl dd { + margin:5px 0 10px 0px; + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; +} +.serializedFormContainer dl.nameValue dt { + margin-left:1px; + font-size:1.1em; + display:inline; + font-weight:bold; +} +.serializedFormContainer dl.nameValue dd { + margin:0 0 0 1px; + font-size:1.1em; + display:inline; +} +/* + * Styles for lists. + */ +li.circle { + list-style:circle; +} +ul.horizontal li { + display:inline; + font-size:0.9em; +} +ul.inheritance { + margin:0; + padding:0; +} +ul.inheritance li { + display:inline; + list-style:none; +} +ul.inheritance li ul.inheritance { + margin-left:15px; + padding-left:15px; + padding-top:1px; +} +ul.blockList, ul.blockListLast { + margin:10px 0 10px 0; + padding:0; +} +ul.blockList li.blockList, ul.blockListLast li.blockList { + list-style:none; + margin-bottom:15px; + line-height:1.4; +} +ul.blockList ul.blockList li.blockList, ul.blockList ul.blockListLast li.blockList { + padding:0px 20px 5px 10px; + border:1px solid #ededed; + background-color:#f8f8f8; +} +ul.blockList ul.blockList ul.blockList li.blockList, ul.blockList ul.blockList ul.blockListLast li.blockList { + padding:0 0 5px 8px; + background-color:#ffffff; + border:none; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockList { + margin-left:0; + padding-left:0; + padding-bottom:15px; + border:none; +} +ul.blockList ul.blockList ul.blockList ul.blockList li.blockListLast { + list-style:none; + border-bottom:none; + padding-bottom:0; +} +table tr td dl, table tr td dl dt, table tr td dl dd { + margin-top:0; + margin-bottom:1px; +} +/* + * Styles for tables. + */ +.overviewSummary, .memberSummary, .typeSummary, .useSummary, .constantsSummary, .deprecatedSummary, +.requiresSummary, .packagesSummary, .providesSummary, .usesSummary { + width:100%; + border-spacing:0; + border-left:1px solid #EEE; + border-right:1px solid #EEE; + border-bottom:1px solid #EEE; +} +.overviewSummary, .memberSummary, .requiresSummary, .packagesSummary, .providesSummary, .usesSummary { + padding:0px; +} +.overviewSummary caption, .memberSummary caption, .typeSummary caption, +.useSummary caption, .constantsSummary caption, .deprecatedSummary caption, +.requiresSummary caption, .packagesSummary caption, .providesSummary caption, .usesSummary caption { + position:relative; + text-align:left; + background-repeat:no-repeat; + color:#253441; + font-weight:bold; + clear:none; + overflow:hidden; + padding:0px; + padding-top:10px; + padding-left:1px; + margin:0px; + white-space:pre; +} +.overviewSummary caption a:link, .memberSummary caption a:link, .typeSummary caption a:link, +.constantsSummary caption a:link, .deprecatedSummary caption a:link, +.requiresSummary caption a:link, .packagesSummary caption a:link, .providesSummary caption a:link, +.usesSummary caption a:link, +.overviewSummary caption a:hover, .memberSummary caption a:hover, .typeSummary caption a:hover, +.constantsSummary caption a:hover, .deprecatedSummary caption a:hover, +.requiresSummary caption a:hover, .packagesSummary caption a:hover, .providesSummary caption a:hover, +.usesSummary caption a:hover, +.overviewSummary caption a:active, .memberSummary caption a:active, .typeSummary caption a:active, +.constantsSummary caption a:active, .deprecatedSummary caption a:active, +.requiresSummary caption a:active, .packagesSummary caption a:active, .providesSummary caption a:active, +.usesSummary caption a:active, +.overviewSummary caption a:visited, .memberSummary caption a:visited, .typeSummary caption a:visited, +.constantsSummary caption a:visited, .deprecatedSummary caption a:visited, +.requiresSummary caption a:visited, .packagesSummary caption a:visited, .providesSummary caption a:visited, +.usesSummary caption a:visited { + color:#FFFFFF; +} +.useSummary caption a:link, .useSummary caption a:hover, .useSummary caption a:active, +.useSummary caption a:visited { + color:#1f389c; +} +.overviewSummary caption span, .memberSummary caption span, .typeSummary caption span, +.useSummary caption span, .constantsSummary caption span, .deprecatedSummary caption span, +.requiresSummary caption span, .packagesSummary caption span, .providesSummary caption span, +.usesSummary caption span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + padding-bottom:7px; + display:inline-block; + float:left; + background-color:#F8981D; + border: none; + height:16px; +} +.memberSummary caption span.activeTableTab span, .packagesSummary caption span.activeTableTab span, +.overviewSummary caption span.activeTableTab span, .typeSummary caption span.activeTableTab span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + margin-right:3px; + display:inline-block; + float:left; + background-color:#F8981D; + height:16px; +} +.memberSummary caption span.tableTab span, .packagesSummary caption span.tableTab span, +.overviewSummary caption span.tableTab span, .typeSummary caption span.tableTab span { + white-space:nowrap; + padding-top:5px; + padding-left:12px; + padding-right:12px; + margin-right:3px; + display:inline-block; + float:left; + background-color:#4D7A97; + height:16px; +} +.memberSummary caption span.tableTab, .memberSummary caption span.activeTableTab, +.packagesSummary caption span.tableTab, .packagesSummary caption span.activeTableTab, +.overviewSummary caption span.tableTab, .overviewSummary caption span.activeTableTab, +.typeSummary caption span.tableTab, .typeSummary caption span.activeTableTab { + padding-top:0px; + padding-left:0px; + padding-right:0px; + background-image:none; + float:none; + display:inline; +} +.overviewSummary .tabEnd, .memberSummary .tabEnd, .typeSummary .tabEnd, +.useSummary .tabEnd, .constantsSummary .tabEnd, .deprecatedSummary .tabEnd, +.requiresSummary .tabEnd, .packagesSummary .tabEnd, .providesSummary .tabEnd, .usesSummary .tabEnd { + display:none; + width:5px; + position:relative; + float:left; + background-color:#F8981D; +} +.memberSummary .activeTableTab .tabEnd, .packagesSummary .activeTableTab .tabEnd, +.overviewSummary .activeTableTab .tabEnd, .typeSummary .activeTableTab .tabEnd { + display:none; + width:5px; + margin-right:3px; + position:relative; + float:left; + background-color:#F8981D; +} +.memberSummary .tableTab .tabEnd, .packagesSummary .tableTab .tabEnd, +.overviewSummary .tableTab .tabEnd, .typeSummary .tableTab .tabEnd { + display:none; + width:5px; + margin-right:3px; + position:relative; + background-color:#4D7A97; + float:left; +} +.rowColor th, .altColor th { + font-weight:normal; +} +.overviewSummary td, .memberSummary td, .typeSummary td, +.useSummary td, .constantsSummary td, .deprecatedSummary td, +.requiresSummary td, .packagesSummary td, .providesSummary td, .usesSummary td { + text-align:left; + padding:0px 0px 12px 10px; +} +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .useSummary th, +.constantsSummary th, .packagesSummary th, td.colFirst, td.colSecond, td.colLast, .useSummary td, +.constantsSummary td { + vertical-align:top; + padding-right:0px; + padding-top:8px; + padding-bottom:3px; +} +th.colFirst, th.colSecond, th.colLast, th.colConstructorName, th.colDeprecatedItemName, .constantsSummary th, +.packagesSummary th { + background:#dee3e9; + text-align:left; + padding:8px 3px 3px 7px; +} +td.colFirst, th.colFirst { + font-size:13px; +} +td.colSecond, th.colSecond, td.colLast, th.colConstructorName, th.colDeprecatedItemName, th.colLast { + font-size:13px; +} +.constantsSummary th, .packagesSummary th { + font-size:13px; +} +.providesSummary th.colFirst, .providesSummary th.colLast, .providesSummary td.colFirst, +.providesSummary td.colLast { + white-space:normal; + font-size:13px; +} +.overviewSummary td.colFirst, .overviewSummary th.colFirst, +.requiresSummary td.colFirst, .requiresSummary th.colFirst, +.packagesSummary td.colFirst, .packagesSummary td.colSecond, .packagesSummary th.colFirst, .packagesSummary th, +.usesSummary td.colFirst, .usesSummary th.colFirst, +.providesSummary td.colFirst, .providesSummary th.colFirst, +.memberSummary td.colFirst, .memberSummary th.colFirst, +.memberSummary td.colSecond, .memberSummary th.colSecond, .memberSummary th.colConstructorName, +.typeSummary td.colFirst, .typeSummary th.colFirst { + vertical-align:top; +} +.packagesSummary th.colLast, .packagesSummary td.colLast { + white-space:normal; +} +td.colFirst a:link, td.colFirst a:visited, +td.colSecond a:link, td.colSecond a:visited, +th.colFirst a:link, th.colFirst a:visited, +th.colSecond a:link, th.colSecond a:visited, +th.colConstructorName a:link, th.colConstructorName a:visited, +th.colDeprecatedItemName a:link, th.colDeprecatedItemName a:visited, +.constantValuesContainer td a:link, .constantValuesContainer td a:visited, +.allClassesContainer td a:link, .allClassesContainer td a:visited, +.allPackagesContainer td a:link, .allPackagesContainer td a:visited { + font-weight:bold; +} +.tableSubHeadingColor { + background-color:#EEEEFF; +} +.altColor, .altColor th { + background-color:#FFFFFF; +} +.rowColor, .rowColor th { + background-color:#EEEEEF; +} +/* + * Styles for contents. + */ +.description pre { + margin-top:0; +} +.deprecatedContent { + margin:0; + padding:10px 0; +} +.docSummary { + padding:0; +} +ul.blockList ul.blockList ul.blockList li.blockList h3 { + font-style:normal; +} +div.block { + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; +} +td.colLast div { + padding-top:0px; +} +td.colLast a { + padding-bottom:3px; +} +/* + * Styles for formatting effect. + */ +.sourceLineNo { + color:green; + padding:0 30px 0 0; +} +h1.hidden { + visibility:hidden; + overflow:hidden; + font-size:10px; +} +.block { + display:block; + margin:3px 10px 2px 0px; + color:#474747; +} +.deprecatedLabel, .descfrmTypeLabel, .implementationLabel, .memberNameLabel, .memberNameLink, +.moduleLabelInPackage, .moduleLabelInType, .overrideSpecifyLabel, .packageLabelInType, +.packageHierarchyLabel, .paramLabel, .returnLabel, .seeLabel, .simpleTagLabel, +.throwsLabel, .typeNameLabel, .typeNameLink, .searchTagLink { + font-weight:bold; +} +.deprecationComment, .emphasizedPhrase, .interfaceName { + font-style:italic; +} +.deprecationBlock { + font-size:14px; + font-family:'DejaVu Serif', Georgia, "Times New Roman", Times, serif; + border-style:solid; + border-width:thin; + border-radius:10px; + padding:10px; + margin-bottom:10px; + margin-right:10px; + display:inline-block; +} +div.block div.deprecationComment, div.block div.block span.emphasizedPhrase, +div.block div.block span.interfaceName { + font-style:normal; +} +div.contentContainer ul.blockList li.blockList h2 { + padding-bottom:0px; +} +/* + * Styles for IFRAME. + */ +.mainContainer { + margin:0 auto; + padding:0; + height:100%; + width:100%; + position:fixed; + top:0; + left:0; +} +.leftContainer { + height:100%; + position:fixed; + width:320px; +} +.leftTop { + position:relative; + float:left; + width:315px; + top:0; + left:0; + height:30%; + border-right:6px solid #ccc; + border-bottom:6px solid #ccc; +} +.leftBottom { + position:relative; + float:left; + width:315px; + bottom:0; + left:0; + height:70%; + border-right:6px solid #ccc; + border-top:1px solid #000; +} +.rightContainer { + position:absolute; + left:320px; + top:0; + bottom:0; + height:100%; + right:0; + border-left:1px solid #000; +} +.rightIframe { + margin:0; + padding:0; + height:100%; + right:30px; + width:100%; + overflow:visible; + margin-bottom:30px; +} +/* + * Styles specific to HTML5 elements. + */ +main, nav, header, footer, section { + display:block; +} +/* + * Styles for javadoc search. + */ +.ui-autocomplete-category { + font-weight:bold; + font-size:15px; + padding:7px 0 7px 3px; + background-color:#4D7A97; + color:#FFFFFF; +} +.resultItem { + font-size:13px; +} +.ui-autocomplete { + max-height:85%; + max-width:65%; + overflow-y:scroll; + overflow-x:scroll; + white-space:nowrap; + box-shadow: 0 3px 6px rgba(0,0,0,0.16), 0 3px 6px rgba(0,0,0,0.23); +} +ul.ui-autocomplete { + position:fixed; + z-index:999999; +} +ul.ui-autocomplete li { + float:left; + clear:both; + width:100%; +} +.resultHighlight { + font-weight:bold; +} +#search { + background-image:url('resources/glass.png'); + background-size:13px; + background-repeat:no-repeat; + background-position:2px 3px; + padding-left:20px; + position:relative; + right:-18px; +} +#reset { + background-color: rgb(255,255,255); + background-image:url('resources/x.png'); + background-position:center; + background-repeat:no-repeat; + background-size:12px; + border:0 none; + width:16px; + height:17px; + position:relative; + left:-4px; + top:-4px; + font-size:0px; +} +.watermark { + color:#545454; +} +.searchTagDescResult { + font-style:italic; + font-size:11px; +} +.searchTagHolderResult { + font-style:italic; + font-size:12px; +} +.searchTagResult:before, .searchTagResult:target { + color:red; +} +.moduleGraph span { + display:none; + position:absolute; +} +.moduleGraph:hover span { + display:block; + margin: -100px 0 0 100px; + z-index: 1; +} +.methodSignature { + white-space:normal; +} + +/* + * Styles for user-provided tables. + * + * borderless: + * No borders, vertical margins, styled caption. + * This style is provided for use with existing doc comments. + * In general, borderless tables should not be used for layout purposes. + * + * plain: + * Plain borders around table and cells, vertical margins, styled caption. + * Best for small tables or for complex tables for tables with cells that span + * rows and columns, when the "striped" style does not work well. + * + * striped: + * Borders around the table and vertical borders between cells, striped rows, + * vertical margins, styled caption. + * Best for tables that have a header row, and a body containing a series of simple rows. + */ + +table.borderless, +table.plain, +table.striped { + margin-top: 10px; + margin-bottom: 10px; +} +table.borderless > caption, +table.plain > caption, +table.striped > caption { + font-weight: bold; + font-size: smaller; +} +table.borderless th, table.borderless td, +table.plain th, table.plain td, +table.striped th, table.striped td { + padding: 2px 5px; +} +table.borderless, +table.borderless > thead > tr > th, table.borderless > tbody > tr > th, table.borderless > tr > th, +table.borderless > thead > tr > td, table.borderless > tbody > tr > td, table.borderless > tr > td { + border: none; +} +table.borderless > thead > tr, table.borderless > tbody > tr, table.borderless > tr { + background-color: transparent; +} +table.plain { + border-collapse: collapse; + border: 1px solid black; +} +table.plain > thead > tr, table.plain > tbody tr, table.plain > tr { + background-color: transparent; +} +table.plain > thead > tr > th, table.plain > tbody > tr > th, table.plain > tr > th, +table.plain > thead > tr > td, table.plain > tbody > tr > td, table.plain > tr > td { + border: 1px solid black; +} +table.striped { + border-collapse: collapse; + border: 1px solid black; +} +table.striped > thead { + background-color: #E3E3E3; +} +table.striped > thead > tr > th, table.striped > thead > tr > td { + border: 1px solid black; +} +table.striped > tbody > tr:nth-child(even) { + background-color: #EEE +} +table.striped > tbody > tr:nth-child(odd) { + background-color: #FFF +} +table.striped > tbody > tr > th, table.striped > tbody > tr > td { + border-left: 1px solid black; + border-right: 1px solid black; +} +table.striped > tbody > tr > th { + font-weight: normal; +} diff --git a/cvc5-1.0.2/api/java/type-search-index.js b/cvc5-1.0.2/api/java/type-search-index.js new file mode 100644 index 0000000..8b8ee25 --- /dev/null +++ b/cvc5-1.0.2/api/java/type-search-index.js @@ -0,0 +1 @@ +typeSearchIndex = [{"l":"All Classes","url":"allclasses-index.html"},{"p":"io.github.cvc5","l":"OptionInfo.BaseInfo"},{"p":"io.github.cvc5","l":"Datatype.ConstIterator"},{"p":"io.github.cvc5","l":"DatatypeConstructor.ConstIterator"},{"p":"io.github.cvc5","l":"Statistics.ConstIterator"},{"p":"io.github.cvc5","l":"Term.ConstIterator"},{"p":"io.github.cvc5","l":"CVC5ApiException"},{"p":"io.github.cvc5","l":"CVC5ApiOptionException"},{"p":"io.github.cvc5","l":"CVC5ApiRecoverableException"},{"p":"io.github.cvc5","l":"Datatype"},{"p":"io.github.cvc5","l":"DatatypeConstructor"},{"p":"io.github.cvc5","l":"DatatypeConstructorDecl"},{"p":"io.github.cvc5","l":"DatatypeDecl"},{"p":"io.github.cvc5","l":"DatatypeSelector"},{"p":"io.github.cvc5","l":"Grammar"},{"p":"io.github.cvc5","l":"IOracle"},{"p":"io.github.cvc5","l":"Kind"},{"p":"io.github.cvc5","l":"OptionInfo.ModeInfo"},{"p":"io.github.cvc5","l":"OptionInfo.NumberInfo"},{"p":"io.github.cvc5","l":"Op"},{"p":"io.github.cvc5","l":"OptionInfo"},{"p":"io.github.cvc5","l":"Pair"},{"p":"io.github.cvc5","l":"Result"},{"p":"io.github.cvc5","l":"RoundingMode"},{"p":"io.github.cvc5","l":"Solver"},{"p":"io.github.cvc5","l":"Sort"},{"p":"io.github.cvc5","l":"Stat"},{"p":"io.github.cvc5","l":"Statistics"},{"p":"io.github.cvc5","l":"SynthResult"},{"p":"io.github.cvc5","l":"Term"},{"p":"io.github.cvc5","l":"Triplet"},{"p":"io.github.cvc5","l":"UnknownExplanation"},{"p":"io.github.cvc5","l":"Utils"},{"p":"io.github.cvc5","l":"OptionInfo.ValueInfo"},{"p":"io.github.cvc5","l":"OptionInfo.VoidInfo"}] \ No newline at end of file diff --git a/cvc5-1.0.2/api/java/type-search-index.zip b/cvc5-1.0.2/api/java/type-search-index.zip new file mode 100644 index 0000000..3fc26c0 Binary files /dev/null and b/cvc5-1.0.2/api/java/type-search-index.zip differ diff --git a/cvc5-1.0.2/api/python/base/datatype.html b/cvc5-1.0.2/api/python/base/datatype.html new file mode 100644 index 0000000..16bec03 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/datatype.html @@ -0,0 +1,1045 @@ + + + + + + + + Datatype — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Datatype + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Datatype + + + + ¶ + +
    +
    +

    + A cvc5 datatype. +

    +

    + Wrapper class for the C++ class + + + + cvc5::Datatype + + + + . +

    +
    +
    + + + __getitem__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the datatype constructor with the given index, where index can +be either a numeric id starting with zero, or the name of the +constructor. In the latter case, this is a linear search through the +constructors, so in case of multiple, similarly-named constructors, +the first is returned. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + index + + – The id or name of the datatype constructor. +

    +
    +
    + Returns + + : + +
    +
    +

    + The matching datatype constructor. +

    +
    +
    +
    +
    +
    +
    + + + __iter__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Iterate over all constructors. +

    +
    +
    +
    +
    + + + getConstructor + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + + ) + + + ¶ + +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + name + + – The name of the constructor. +

    +
    +
    + Returns + + : + +
    +
    +

    + A constructor by name. +

    +
    +
    +
    +
    +
    +
    + + + getName + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The name of the datatype. +

    +
    +
    +
    +
    +
    +
    + + + getNumConstructors + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The number of constructors in this datatype. +

    +
    +
    +
    +
    +
    +
    + + + getParameters + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The parameters of this datatype, if it is parametric. An +exception is thrown if this datatype is not parametric. +

    +
    +
    +
    +
    +
    +
    + + + getSelector + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + + ) + + + ¶ + +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + name + + – The name of the selector.. +

    +
    +
    + Returns + + : + +
    +
    +

    + A selector by name. +

    +
    +
    +
    +
    +
    +
    + + + isCodatatype + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype corresponds to a co-datatype. +

    +
    +
    +
    +
    +
    +
    + + + isFinite + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype is finite. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this Datatype is a null object. +

    +
    +
    +
    +
    +
    +
    + + + isParametric + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype is parametric. +

    +
    +
    +
    +
    +
    +
    + + + isRecord + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype corresponds to a record. +

    +
    +
    +
    +
    +
    +
    + + + isTuple + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype corresponds to a tuple. +

    +
    +
    +
    +
    +
    +
    + + + isWellFounded + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this datatype is well-founded. +

    +

    + If this datatype is not a codatatype, this returns false if there +are no values of this datatype that are of finite size. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype is well-founded +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/datatypeconstructor.html b/cvc5-1.0.2/api/python/base/datatypeconstructor.html new file mode 100644 index 0000000..c7651b7 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/datatypeconstructor.html @@ -0,0 +1,979 @@ + + + + + + + + DatatypeConstructor — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + DatatypeConstructor + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + DatatypeConstructor + + + + ¶ + +
    +
    +

    + A cvc5 datatype constructor. +

    +

    + Wrapper class for + + + + cvc5::DatatypeConstructor + + + + . +

    +
    +
    + + + __getitem__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the datatype selector with the given index, where index can be +either a numeric id starting with zero, or the name of the selector. +In the latter case, this is a linear search through the selectors, +so in case of multiple, similarly-named selectors, the first is +returned. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + index + + – The id or name of the datatype selector. +

    +
    +
    + Returns + + : + +
    +
    +

    + The matching datatype selector. +

    +
    +
    +
    +
    +
    +
    + + + __iter__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Iterate over all datatype selectors. +

    +
    +
    +
    +
    + + + getInstantiatedTerm + + + + ( + + + + + self + + + + , + + + + Sort + + + retSort + + + + + ) + + + ¶ + +
    +
    +

    + Get the constructor term of this datatype constructor whose +return type is retSort. This method is intended to be used on +constructors of parametric datatypes and can be seen as returning +the constructor term that has been explicitly cast to the given +sort. +

    +

    + This method is required for constructors of parametric datatypes +whose return type cannot be determined by type inference. For +example, given: +

    +
    +
    +
    (declare-datatype List
    +    (par (T) ((nil) (cons (head T) (tail (List T))))))
    +
    +
    +
    +

    + The type of nil terms must be provided by the user. In SMT version +2.6, this is done via the syntax for qualified identifiers: +

    +
    +
    +
    (as nil (List Int))
    +
    +
    +
    +

    + This method is equivalent of applying the above, where this +DatatypeConstructor is the one corresponding to nil, and retSort is + + + (List + + + Int) + + + . +

    +
    +

    + Note +

    +

    + The returned constructor term + + + t + + + is used to construct the +above (nullary) application of + + + nil + + + with + + + Solver.mkTerm(APPLY_CONSTRUCTOR, + + + t) + + + . +

    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + retSort + + – The desired return sort of the constructor. +

    +
    +
    + Returns + + : + +
    +
    +

    + The constructor term. +

    +
    +
    +
    +
    +
    +
    + + + getName + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The name of the constructor. +

    +
    +
    +
    +
    +
    +
    + + + getNumSelectors + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The number of selecters (so far) of this Datatype +constructor. +

    +
    +
    +
    +
    +
    +
    + + + getSelector + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + + ) + + + ¶ + +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + name + + – The name of the datatype selector. +

    +
    +
    + Returns + + : + +
    +
    +

    + The first datatype selector with the given name. +

    +
    +
    +
    +
    +
    +
    + + + getTerm + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the constructor term of this datatype constructor. +

    +

    + Datatype constructors are a special class of function-like terms +whose sort is datatype constructor +( + + + + Sort.isDatatypeConstructor() + + + + ). All datatype +constructors, including nullary ones, should be used as the first +argument to Terms whose kind is + + + + APPLY_CONSTRUCTOR + + + + . +For example, the nil list can be constructed via + + + Solver.mkTerm(APPLY_CONSTRUCTOR, + + + [nil]) + + + , where nil is the Term +returned by this method. +

    +
    +

    + Note +

    +

    + This method should not be used for parametric datatypes. +Instead, use the method + + + + DatatypeConstructor.getInstantiatedTerm() + + + + below. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The constructor term. +

    +
    +
    +
    +
    +
    +
    + + + getTesterTerm + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the tester term of this datatype constructor. +

    +

    + Similar to constructors, testers are a class of function-like terms +of tester sort ( + + + + Sort.isDatatypeTester() + + + + ), and should +be used as the first argument of Terms of kind + + + + Kind.APPLY_TESTER + + + + . +

    +
    +
    + Returns + + : + +
    +
    +

    + The tester term for this constructor. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this DatatypeConstructor is a null object. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/datatypeconstructordecl.html b/cvc5-1.0.2/api/python/base/datatypeconstructordecl.html new file mode 100644 index 0000000..af58cb9 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/datatypeconstructordecl.html @@ -0,0 +1,675 @@ + + + + + + + + DatatypeConstructorDecl — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + DatatypeConstructorDecl + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + DatatypeConstructorDecl + + + + ¶ + +
    +
    +

    + A cvc5 datatype constructor declaration. A datatype constructor +declaration is a specification used for creating a datatype constructor. +

    +

    + Wrapper class for + + + + cvc5::DatatypeConstructorDecl + + + + . +

    +
    +
    + + + addSelector + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Add datatype selector declaration. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + name + + – The name of the datatype selector declaration to add. +

      +
    • +
    • +

      + + sort + + – The codomain sort of the datatype selector declaration +to add. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + addSelectorSelf + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + + ) + + + ¶ + +
    +
    +

    + Add datatype selector declaration whose codomain sort is the +datatype itself. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + name + + – The name of the datatype selector declaration to add. +

    +
    +
    +
    +
    +
    +
    + + + addSelectorUnresolved + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + , + + + + unicode + + + unresDatatypeName + + + + + ) + + + ¶ + +
    +
    +

    + Add datatype selector declaration whose codomain sort is an +unresolved datatype with the given name. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + name + + – The name of the datatype selector declaration to add. +

      +
    • +
    • +

      + + unresDataypeName + + – The name of the unresolved datatype. The +codomain of the selector will be the +resolved datatype with the given name. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this DatatypeConstructorDecl is a null object. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/datatypedecl.html b/cvc5-1.0.2/api/python/base/datatypedecl.html new file mode 100644 index 0000000..7ec8f50 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/datatypedecl.html @@ -0,0 +1,702 @@ + + + + + + + + DatatypeDecl — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + DatatypeDecl + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + DatatypeDecl + + + + ¶ + +
    +
    +

    + A cvc5 datatype declaration. A datatype declaration is not itself a +datatype (see + + + + Datatype + + + + ), but a specification for creating a +datatype sort. +

    +

    + The interface for a datatype declaration coincides with the syntax for +the SMT-LIB 2.6 command + + declare-datatype + + , or a single datatype within +the + + declare-datatypes + + command. +

    +

    + Datatype sorts can be constructed from + + + + DatatypeDecl + + + + using +the methods: +

    +
    + +
    +

    + Wrapper class for + + + + cvc5::DatatypeDecl + + + + . +

    +
    +
    + + + addConstructor + + + + ( + + + + + self + + + + , + + + + DatatypeConstructorDecl + + + ctor + + + + + ) + + + ¶ + +
    +
    +

    + Add a datatype constructor declaration. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + ctor + + – The datatype constructor declaration to add. +

    +
    +
    +
    +
    +
    +
    + + + getName + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The name of this datatype declaration. +

    +
    +
    +
    +
    +
    +
    + + + getNumConstructors + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The number of constructors (so far) for this datatype +declaration. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this DatatypeDecl is a null object. +

    +
    +
    +
    +
    +
    +
    + + + isParametric + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this datatype declaration is parametric. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/datatypeselector.html b/cvc5-1.0.2/api/python/base/datatypeselector.html new file mode 100644 index 0000000..0cdc02a --- /dev/null +++ b/cvc5-1.0.2/api/python/base/datatypeselector.html @@ -0,0 +1,660 @@ + + + + + + + + DatatypeSelector — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + DatatypeSelector + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + DatatypeSelector + + + + ¶ + +
    +
    +

    + A cvc5 datatype selector. +

    +

    + Wrapper class for + + + + cvc5::DatatypeSelector + + + + . +

    +
    +
    + + + getCodomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The codomain sort of this selector. +

    +
    +
    +
    +
    +
    +
    + + + getName + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The name of this datatype selector. +

    +
    +
    +
    +
    +
    +
    + + + getTerm + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the selector term of this datatype selector. +

    +

    + Selector terms are a class of function-like terms of selector +sort ( + + + + Sort.isDatatypeSelector() + + + + ), and should be used as +the first argument of Terms of kind + + + + APPLY_SELECTOR + + + + . +

    +
    +
    + Returns + + : + +
    +
    +

    + The selector term of this datatype selector. +

    +
    +
    +
    +
    +
    +
    + + + getUpdaterTerm + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the updater term of this datatype selector. +

    +

    + Similar to selectors, updater terms are a class of function-like +terms of updater Sort ( + + + + Sort.isDatatypeUpdater() + + + + ), and +should be used as the first argument of Terms of kind + + + + APPLY_UPDATER + + + + . +

    +
    +
    + Returns + + : + +
    +
    +

    + The updater term of this datatype selector. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this DatatypeSelector is a null object. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/grammar.html b/cvc5-1.0.2/api/python/base/grammar.html new file mode 100644 index 0000000..ac7ce7f --- /dev/null +++ b/cvc5-1.0.2/api/python/base/grammar.html @@ -0,0 +1,734 @@ + + + + + + + + Grammar — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Grammar + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Grammar + + + + ¶ + +
    +
    +

    + A Sygus Grammar. This class can be used to define a context-free grammar +of terms. Its interface coincides with the definition of grammars +( + + + GrammarDef + + + ) in the SyGuS IF 2.1 standard. +

    +

    + Wrapper class for + + + + cvc5::Grammar + + + + . +

    +
    +
    + + + addAnyConstant + + + + ( + + + + + self + + + + , + + + + Term + + + ntSymbol + + + + + ) + + + ¶ + +
    +
    +

    + Allow + + + ntSymbol + + + to be an arbitrary constant. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + ntSymbol + + – The non-terminal allowed to be constant. +

    +
    +
    +
    +
    +
    +
    + + + addAnyVariable + + + + ( + + + + + self + + + + , + + + + Term + + + ntSymbol + + + + + ) + + + ¶ + +
    +
    +

    + Allow + + + ntSymbol + + + to be any input variable to corresponding +synth-fun/synth-inv with the same sort as + + + ntSymbol + + + . +

    +
    +
    + Parameters + + : + +
    +
    +

    + + ntSymbol + + – The non-terminal allowed to be any input variable. +

    +
    +
    +
    +
    +
    +
    + + + addRule + + + + ( + + + + + self + + + + , + + + + Term + + + ntSymbol + + + + , + + + + Term + + + rule + + + + + ) + + + ¶ + +
    +
    +

    + Add + + + rule + + + to the set of rules corresponding to + + + ntSymbol + + + . +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + ntSymbol + + – The non-terminal to which the rule is added. +

      +
    • +
    • +

      + + rule + + – The rule to add. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + addRules + + + + ( + + + + + self + + + + , + + + + Term + + + ntSymbol + + + + , + + + + rules + + + + + ) + + + ¶ + +
    +
    +

    + Add + + + ntSymbol + + + to the set of rules corresponding to + + + ntSymbol + + + . +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + ntSymbol + + – The non-terminal to which the rules are added. +

      +
    • +
    • +

      + + rules + + – The rules to add. +

      +
    • +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/kind.html b/cvc5-1.0.2/api/python/base/kind.html new file mode 100644 index 0000000..220c8f8 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/kind.html @@ -0,0 +1,24685 @@ + + + + + + + + Kind — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Kind + + ¶ + +

    +

    + Every + + + + Term + + + + has a kind which represents its type, for +example whether it is an equality ( + + + Equal + + + ), a +conjunction ( + + + And + + + ), or a bit-vector addtion +( + + + BVAdd + + + ). +The kinds below directly correspond to the enum values of the C++ + + + + Kind + + + + enum. +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Kind + + + + ( + + + + + value + + + + + ) + + + ¶ + +
    +
    +

    + The Kind enum +

    +
    +
    + + + ABS + + + + ¶ + +
    +
    +

    + Absolute value. +

    + +
    +
    +
    +
    + + + ADD + + + + ¶ + +
    +
    +

    + Arithmetic addition. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + AND + + + + ¶ + +
    +
    +

    + Logical conjunction. +

    + +
    +
    +
    +
    + + + APPLY_CONSTRUCTOR + + + + ¶ + +
    +
    +

    + Datatype constructor application. +

    + +
    +
    +
    +
    + + + APPLY_SELECTOR + + + + ¶ + +
    +
    +

    + Datatype selector application. +

    + +
    +

    + Note +

    +

    + Undefined if misapplied. +

    +
    +
    +
    +
    +
    + + + APPLY_TESTER + + + + ¶ + +
    +
    +

    + Datatype tester application. +

    + +
    +
    +
    +
    + + + APPLY_UF + + + + ¶ + +
    +
    +

    + Application of an uninterpreted function. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Function Term +

        +
      • +
      • +

        + + + 2..n: + + + Function argument instantiation Terms of any first-class Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + APPLY_UPDATER + + + + ¶ + +
    +
    +

    + Datatype update application. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Datatype updater Term (see + + + + DatatypeSelector.getUpdaterTerm() + + + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Datatype Sort (DatatypeSelector of the updater must belong to a constructor of this Datatype Sort) +

        +
      • +
      • +

        + + + 3: + + + Term of the codomain Sort of the selector (the Term to update the field of the datatype term with) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Note +

    +

    + Does not change the datatype argument if misapplied. +

    +
    +
    +
    +
    +
    + + + ARCCOSECANT + + + + ¶ + +
    +
    +

    + Arc cosecant function. +

    + +
    +
    +
    +
    + + + ARCCOSINE + + + + ¶ + +
    +
    +

    + Arc cosine function. +

    + +
    +
    +
    +
    + + + ARCCOTANGENT + + + + ¶ + +
    +
    +

    + Arc cotangent function. +

    + +
    +
    +
    +
    + + + ARCSECANT + + + + ¶ + +
    +
    +

    + Arc secant function. +

    + +
    +
    +
    +
    + + + ARCSINE + + + + ¶ + +
    +
    +

    + Arc sine function. +

    + +
    +
    +
    +
    + + + ARCTANGENT + + + + ¶ + +
    +
    +

    + Arc tangent function. +

    + +
    +
    +
    +
    + + + BAG_CARD + + + + ¶ + +
    +
    +

    + Bag cardinality. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_CHOOSE + + + + ¶ + +
    +
    +

    + Bag choose. +

    +

    + Select an element from a given bag. +

    +

    + For a bag + + \(A = \{(x,n)\}\) + + where + + \(n\) + + is the multiplicity, then +the term (choose + + \(A\) + + ) is equivalent to the term + + \(x\) + + . For an +empty bag, then it is an arbitrary value. For a bag that contains distinct +elements, it will deterministically return an element in + + \(A\) + + . +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_COUNT + + + + ¶ + +
    +
    +

    + Bag element multiplicity. +

    + +
    +
    +
    +
    + + + BAG_DIFFERENCE_REMOVE + + + + ¶ + +
    +
    +

    + Bag difference remove. +

    +

    + Removes shared elements in the two bags. +

    + +
    +
    +
    +
    + + + BAG_DIFFERENCE_SUBTRACT + + + + ¶ + +
    +
    +

    + Bag difference subtract. +

    +

    + Subtracts multiplicities of the second from the first. +

    + +
    +
    +
    +
    + + + BAG_DUPLICATE_REMOVAL + + + + ¶ + +
    +
    +

    + Bag duplicate removal. +

    +

    + Eliminate duplicates in a given bag. The returned bag contains exactly the +same elements in the given bag, but with multiplicity one. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_EMPTY + + + + ¶ + +
    +
    +

    + Empty bag. +

    + +
    +
    +
    +
    + + + BAG_FILTER + + + + ¶ + +
    +
    +

    + Bag filter. +

    +

    + This operator filters the elements of a bag. +(bag.filter + + \(p \; B\) + + ) takes a predicate + + \(p\) + + of Sort + + \((\rightarrow T \; Bool)\) + + as a first argument, and a bag + + \(B\) + + of Sort (Bag + + \(T\) + + ) as a second argument, and returns a subbag of Sort +(Bag + + \(T\) + + ) that includes all elements of + + \(B\) + + that satisfy + + \(p\) + + with the same multiplicity. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow T \; Bool)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of bag Sort (Bag + + \(T\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_FOLD + + + + ¶ + +
    +
    +

    + Bag fold. +

    +

    + This operator combines elements of a bag into a single value. +(bag.fold + + \(f \; t \; B\) + + ) folds the elements of bag + + \(B\) + + starting with Term + + \(t\) + + and using the combining function + + \(f\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2 \; S_2)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of Sort + + \(S_2\) + + (the initial value) +

        +
      • +
      • +

        + + + 3: + + + Term of bag Sort (Bag + + \(S_1\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_FROM_SET + + + + ¶ + +
    +
    +

    + Conversion from set to bag. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_INTER_MIN + + + + ¶ + +
    +
    +

    + Bag intersection (min). +

    + +
    +
    +
    +
    + + + BAG_IS_SINGLETON + + + + ¶ + +
    +
    +

    + Bag is singleton tester. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_MAKE + + + + ¶ + +
    +
    +

    + Bag make. +

    +

    + Construct a bag with the given element and given multiplicity. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of any Sort (the bag element) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (the multiplicity of the element) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BAG_MAP + + + + ¶ + +
    +
    +

    + Bag map. +

    +

    + This operator applies the first argument, a function of +Sort + + \((\rightarrow S_1 \; S_2)\) + + , to every element of the second +argument, a set of Sort (Bag + + \(S_1\) + + ), and returns a set of Sort +(Bag + + \(S_2\) + + ). +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of bag Sort (Bag + + \(S_1\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_MEMBER + + + + ¶ + +
    +
    +

    + Bag membership predicate. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of any Sort (must match the element Sort of the given bag Term) +

        +
      • +
      • +

        + + + 2: + + + Terms of bag Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BAG_PARTITION + + + + ¶ + +
    +
    +

    + Bag partition. +

    +

    + This operator partitions of a bag of elements into disjoint bags. +(bag.partition + + \(r \; B\) + + ) partitions the elements of bag + + \(B\) + + of type + + \((Bag \; E)\) + + based on the equivalence relations + + \(r\) + + of +type + + \((\rightarrow \; E \; E \; Bool)\) + + . +It returns a bag of bags of type + + \((Bag \; (Bag \; E))\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow \; E \; E \; Bool)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of bag Sort (Bag + + \(E\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_SUBBAG + + + + ¶ + +
    +
    +

    + Bag inclusion predicate. +

    +

    + Determine if multiplicities of the first bag are less than or equal to +multiplicities of the second bag. +

    + +
    +
    +
    +
    + + + BAG_TO_SET + + + + ¶ + +
    +
    +

    + Conversion from bag to set. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + BAG_UNION_DISJOINT + + + + ¶ + +
    +
    +

    + Bag disjoint union (sum). +

    + +
    +
    +
    +
    + + + BAG_UNION_MAX + + + + ¶ + +
    +
    +

    + Bag max union. +

    + +
    +
    +
    +
    + + + BITVECTOR_ADD + + + + ¶ + +
    +
    +

    + Addition of two or more bit-vectors. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_AND + + + + ¶ + +
    +
    +

    + Bit-wise and. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_ASHR + + + + ¶ + +
    +
    +

    + Bit-vector arithmetic shift right. +

    + +
    +
    +
    +
    + + + BITVECTOR_COMP + + + + ¶ + +
    +
    +

    + Equality comparison (returns bit-vector of size + + + 1 + + + ). +

    + +
    +
    +
    +
    + + + BITVECTOR_CONCAT + + + + ¶ + +
    +
    +

    + Concatenation of two or more bit-vectors. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_EXTRACT + + + + ¶ + +
    +
    +

    + Bit-vector extract. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The upper bit index. +

        +
      • +
      • +

        + + + 2: + + + The lower bit index. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_ITE + + + + ¶ + +
    +
    +

    + Bit-vector if-then-else. +

    +

    + Same semantics as regular ITE, but condition is bit-vector of size + + + 1 + + + . +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort of size + + 1 + +

        +
      • +
      • +

        + + + 1..3: + + + Terms of bit-vector sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_LSHR + + + + ¶ + +
    +
    +

    + Bit-vector logical shift right. +

    + +
    +
    +
    +
    + + + BITVECTOR_MULT + + + + ¶ + +
    +
    +

    + Multiplication of two or more bit-vectors. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_NAND + + + + ¶ + +
    +
    +

    + Bit-wise nand. +

    + +
    +
    +
    +
    + + + BITVECTOR_NEG + + + + ¶ + +
    +
    +

    + Negation of a bit-vector (two’s complement). +

    + +
    +
    +
    +
    + + + BITVECTOR_NOR + + + + ¶ + +
    +
    +

    + Bit-wise nor. +

    + +
    +
    +
    +
    + + + BITVECTOR_NOT + + + + ¶ + +
    +
    +

    + Bit-wise negation. +

    + +
    +
    +
    +
    + + + BITVECTOR_OR + + + + ¶ + +
    +
    +

    + Bit-wise or. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_REDAND + + + + ¶ + +
    +
    +

    + Bit-vector redand. +

    + +
    +
    +
    +
    + + + BITVECTOR_REDOR + + + + ¶ + +
    +
    +

    + Bit-vector redor. +

    + +
    +
    +
    +
    + + + BITVECTOR_REPEAT + + + + ¶ + +
    +
    +

    + Bit-vector repeat. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of times to repeat the given term. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_ROTATE_LEFT + + + + ¶ + +
    +
    +

    + Bit-vector rotate left. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of bits to rotate the given term left. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_ROTATE_RIGHT + + + + ¶ + +
    +
    +

    + Bit-vector rotate right. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of bits to rotate the given term right. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_SDIV + + + + ¶ + +
    +
    +

    + Signed bit-vector division. +

    +

    + Two’s complement signed division of two bit-vectors. If the divisor is +zero and the dividend is positive, the result is all ones. If the divisor +is zero and the dividend is negative, the result is one. +

    + +
    +
    +
    +
    + + + BITVECTOR_SGE + + + + ¶ + +
    +
    +

    + Bit-vector signed greater than or equal. +

    + +
    +
    +
    +
    + + + BITVECTOR_SGT + + + + ¶ + +
    +
    +

    + Bit-vector signed greater than. +

    + +
    +
    +
    +
    + + + BITVECTOR_SHL + + + + ¶ + +
    +
    +

    + Bit-vector shift left. +

    + +
    +
    +
    +
    + + + BITVECTOR_SIGN_EXTEND + + + + ¶ + +
    +
    +

    + Bit-vector sign extension. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of bits (of the value of the sign bit) to extend the given term with. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_SLE + + + + ¶ + +
    +
    +

    + Bit-vector signed less than or equal. +

    + +
    +
    +
    +
    + + + BITVECTOR_SLT + + + + ¶ + +
    +
    +

    + Bit-vector signed less than. +

    + +
    +
    +
    +
    + + + BITVECTOR_SLTBV + + + + ¶ + +
    +
    +

    + Bit-vector signed less than returning a bit-vector of size + + + 1 + + + . +

    + +
    +
    +
    +
    + + + BITVECTOR_SMOD + + + + ¶ + +
    +
    +

    + Signed bit-vector remainder (sign follows divisor). +

    +

    + Two’s complement signed remainder where the sign follows the divisor. If +the modulus is zero, the result is the dividend. +

    + +
    +
    +
    +
    + + + BITVECTOR_SREM + + + + ¶ + +
    +
    +

    + Signed bit-vector remainder (sign follows dividend). +

    +

    + Two’s complement signed remainder of two bit-vectors where the sign +follows the dividend. If the modulus is zero, the result is the dividend. +

    + +
    +
    +
    +
    + + + BITVECTOR_SUB + + + + ¶ + +
    +
    +

    + Subtraction of two bit-vectors. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_TO_NAT + + + + ¶ + +
    +
    +

    + Bit-vector conversion to (non-negative) integer. +

    + +
    +
    +
    +
    + + + BITVECTOR_UDIV + + + + ¶ + +
    +
    +

    + Unsigned bit-vector division. +

    +

    + Truncates towards + + + 0 + + + . If the divisor is zero, the result is all ones. +

    + +
    +
    +
    +
    + + + BITVECTOR_UGE + + + + ¶ + +
    +
    +

    + Bit-vector unsigned greater than or equal. +

    + +
    +
    +
    +
    + + + BITVECTOR_UGT + + + + ¶ + +
    +
    +

    + Bit-vector unsigned greater than. +

    + +
    +
    +
    +
    + + + BITVECTOR_ULE + + + + ¶ + +
    +
    +

    + Bit-vector unsigned less than or equal. +

    + +
    +
    +
    +
    + + + BITVECTOR_ULT + + + + ¶ + +
    +
    +

    + Bit-vector unsigned less than. +

    + +
    +
    +
    +
    + + + BITVECTOR_ULTBV + + + + ¶ + +
    +
    +

    + Bit-vector unsigned less than returning a bit-vector of size 1. +

    + +
    +
    +
    +
    + + + BITVECTOR_UREM + + + + ¶ + +
    +
    +

    + Unsigned bit-vector remainder. +

    +

    + Remainder from unsigned bit-vector division. If the modulus is zero, the +result is the dividend. +

    + +
    +
    +
    +
    + + + BITVECTOR_XNOR + + + + ¶ + +
    +
    +

    + Bit-wise xnor, left associative. +

    + +
    +
    +
    +
    + + + BITVECTOR_XOR + + + + ¶ + +
    +
    +

    + Bit-wise xor. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of bit-vector Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + BITVECTOR_ZERO_EXTEND + + + + ¶ + +
    +
    +

    + Bit-vector zero extension. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of zeroes to extend the given term with. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + CARDINALITY_CONSTRAINT + + + + ¶ + +
    +
    +

    + Cardinality constraint on uninterpreted sort. +

    +

    + Interpreted as a predicate that is true when the cardinality of +uinterpreted Sort + + \(S\) + + is less than or equal to an upper bound. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + CONSTANT + + + + ¶ + +
    +
    +

    + Free constant symbol. +

    + +
    +

    + Note +

    +

    + Not permitted in bindings (e.g., + + + + FORALL + + + + , + + + + EXISTS + + + + ). +

    +
    +
    +
    +
    +
    + + + CONST_ARRAY + + + + ¶ + +
    +
    +

    + Constant array. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of array Sort +

        +
      • +
      • +

        + + + 2: + + + Term of array element Sort (value) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + CONST_BITVECTOR + + + + ¶ + +
    +
    +

    + Fixed-size bit-vector constant. +

    + +
    +
    +
    +
    + + + CONST_BOOLEAN + + + + ¶ + +
    +
    +

    + Boolean constant. +

    + +
    +
    +
    +
    + + + CONST_FLOATINGPOINT + + + + ¶ + +
    +
    +

    + Floating-point constant, created from IEEE-754 bit-vector representation +of the floating-point value. +

    + +
    +
    +
    +
    + + + CONST_INTEGER + + + + ¶ + +
    +
    +

    + Arbitrary-precision integer constant. +

    + +
    +
    +
    +
    + + + CONST_RATIONAL + + + + ¶ + +
    +
    +

    + Arbitrary-precision rational constant. +

    + +
    +
    +
    +
    + + + CONST_ROUNDINGMODE + + + + ¶ + +
    +
    +

    + RoundingMode constant. +

    + +
    +
    +
    +
    + + + CONST_SEQUENCE + + + + ¶ + +
    +
    +

    + Constant sequence. +

    +

    + A constant sequence is a term that is equivalent to: +

    +
    +
    +
    (seq.++ (seq.unit c1) ... (seq.unit cn))
    +
    +
    +
    +

    + where + + \(n \leq 0\) + + and + + \(c_1, ..., c_n\) + + are constants of some +sort. The elements can be extracted with + + + + Term.getSequenceValue() + + + + . +

    + +
    +
    +
    +
    + + + CONST_STRING + + + + ¶ + +
    +
    +

    + Constant string. +

    + +
    +
    +
    +
    + + + COSECANT + + + + ¶ + +
    +
    +

    + Cosecant function. +

    + +
    +
    +
    +
    + + + COSINE + + + + ¶ + +
    +
    +

    + Cosine function. +

    + +
    +
    +
    +
    + + + COTANGENT + + + + ¶ + +
    +
    +

    + Cotangent function. +

    + +
    +
    +
    +
    + + + DISTINCT + + + + ¶ + +
    +
    +

    + Disequality. +

    + +
    +
    +
    +
    + + + DIVISIBLE + + + + ¶ + +
    +
    +

    + Operator for the divisibility-by- + + \(k\) + + predicate. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort Int +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The integer + + \(k\) + + to divide by. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + DIVISION + + + + ¶ + +
    +
    +

    + Real division, division by 0 undefined, left associative. +

    + +
    +
    +
    +
    + + + EQUAL + + + + ¶ + +
    +
    +

    + Equality, chainable. +

    + +
    +
    +
    +
    + + + EQ_RANGE + + + + ¶ + +
    +
    +

    + Equality over arrays + + \(a\) + + and + + \(b\) + + over a given range + + \([i,j]\) + + , i.e., +

    +
    + \[\forall k . i \leq k \leq j \Rightarrow a[k] = b[k]\] +
    +
      +
    • +

      + Arity: + + + 4 + + +

      +
        +
      • +

        + + + 1: + + + Term of array Sort (first array) +

        +
      • +
      • +

        + + + 2: + + + Term of array Sort (second array) +

        +
      • +
      • +

        + + + 3: + + + Term of array index Sort (lower bound of range, inclusive) +

        +
      • +
      • +

        + + + 4: + + + Term of array index Sort (upper bound of range, inclusive) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +

    + Note +

    +

    + We currently support the creation of array equalities over index +Sorts bit-vector, floating-point, Int and Real. +Requires to enable option + + + arrays-exp + + + . +

    +
    +
    +
    +
    +
    + + + EXISTS + + + + ¶ + +
    +
    +

    + Existentially quantified formula. +

    + +
    +
    +
    +
    + + + EXPONENTIAL + + + + ¶ + +
    +
    +

    + Exponential function. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_ABS + + + + ¶ + +
    +
    +

    + Floating-point absolute value. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_ADD + + + + ¶ + +
    +
    +

    + Floating-point addition. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2..3: + + + Terms of floating-point Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_DIV + + + + ¶ + +
    +
    +

    + Floating-point division. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2..3: + + + Terms of floating-point Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_EQ + + + + ¶ + +
    +
    +

    + Floating-point equality. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_FMA + + + + ¶ + +
    +
    +

    + Floating-point fused multiply and add. +

    +
      +
    • +

      + Arity: + + + 4 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2..4: + + + Terms of floating-point Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_FP + + + + ¶ + +
    +
    +

    + Create floating-point literal from bit-vector triple. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort of size + + 1 + + (sign bit) +

        +
      • +
      • +

        + + + 2: + + + Term of bit-vector Sort of exponent size (exponent) +

        +
      • +
      • +

        + + + 3: + + + Term of bit-vector Sort of significand size - 1 (significand without hidden bit) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_GEQ + + + + ¶ + +
    +
    +

    + Floating-point greater than or equal. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_GT + + + + ¶ + +
    +
    +

    + Floating-point greater than. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_INF + + + + ¶ + +
    +
    +

    + Floating-point is infinite tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_NAN + + + + ¶ + +
    +
    +

    + Floating-point is NaN tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_NEG + + + + ¶ + +
    +
    +

    + Floating-point is negative tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_NORMAL + + + + ¶ + +
    +
    +

    + Floating-point is normal tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_POS + + + + ¶ + +
    +
    +

    + Floating-point is positive tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_SUBNORMAL + + + + ¶ + +
    +
    +

    + Floating-point is sub-normal tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_IS_ZERO + + + + ¶ + +
    +
    +

    + Floating-point is zero tester. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_LEQ + + + + ¶ + +
    +
    +

    + Floating-point less than or equal. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_LT + + + + ¶ + +
    +
    +

    + Floating-point less than. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_MAX + + + + ¶ + +
    +
    +

    + Floating-point maximum. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_MIN + + + + ¶ + +
    +
    +

    + Floating-point minimum. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_MULT + + + + ¶ + +
    +
    +

    + Floating-point multiply. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2..3: + + + Terms of floating-point Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_NEG + + + + ¶ + +
    +
    +

    + Floating-point negation. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_REM + + + + ¶ + +
    +
    +

    + Floating-point remainder. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_RTI + + + + ¶ + +
    +
    +

    + Floating-point round to integral. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_SQRT + + + + ¶ + +
    +
    +

    + Floating-point square root. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2: + + + Term of floating-point Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_SUB + + + + ¶ + +
    +
    +

    + Floating-point sutraction. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2..3: + + + Terms of floating-point Sort (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_FP_FROM_FP + + + + ¶ + +
    +
    +

    + Conversion to floating-point from floating-point. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2: + + + Term of floating-point Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The exponent size +

        +
      • +
      • +

        + + + 2: + + + The significand size +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_FP_FROM_IEEE_BV + + + + ¶ + +
    +
    +

    + Conversion to floating-point from IEEE-754 bit-vector. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The exponent size +

        +
      • +
      • +

        + + + 2: + + + The significand size +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_FP_FROM_REAL + + + + ¶ + +
    +
    +

    + Conversion to floating-point from Real. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Real +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The exponent size +

        +
      • +
      • +

        + + + 2: + + + The significand size +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_FP_FROM_SBV + + + + ¶ + +
    +
    +

    + Conversion to floating-point from signed bit-vector. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The exponent size +

        +
      • +
      • +

        + + + 2: + + + The significand size +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_FP_FROM_UBV + + + + ¶ + +
    +
    +

    + Conversion to floating-point from unsigned bit-vector. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RoundingMode +

        +
      • +
      • +

        + + + 2: + + + Term of bit-vector Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The exponent size +

        +
      • +
      • +

        + + + 2: + + + The significand size +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_REAL + + + + ¶ + +
    +
    +

    + Conversion to Real from floating-point. +

    + +
    +
    +
    +
    + + + FLOATINGPOINT_TO_SBV + + + + ¶ + +
    +
    +

    + Conversion to signed bit-vector from floating-point. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of floating-point Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The size of the bit-vector to convert to. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FLOATINGPOINT_TO_UBV + + + + ¶ + +
    +
    +

    + Conversion to unsigned bit-vector from floating-point. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of floating-point Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The size of the bit-vector to convert to. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + FORALL + + + + ¶ + +
    +
    +

    + Universally quantified formula. +

    + +
    +
    +
    +
    + + + GEQ + + + + ¶ + +
    +
    +

    + Greater than or equal, chainable. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + GT + + + + ¶ + +
    +
    +

    + Greater than, chainable. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + HO_APPLY + + + + ¶ + +
    +
    +

    + Higher-order applicative encoding of function application, left +associative. +

    +
      +
    • +

      + Arity: + + + n + + + = + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Function Term +

        +
      • +
      • +

        + + + 2: + + + Argument Term of the domain Sort of the function +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + IAND + + + + ¶ + +
    +
    +

    + Integer and. +

    +

    + Operator for bit-wise + + + AND + + + over integers, parameterized by a (positive) +bit-width + + \(k\) + + . +

    +
    +
    +
    ((_ iand k) i_1 i_2)
    +
    +
    +
    +

    + is equivalent to +

    +
    +
    +
    ((_ iand k) i_1 i_2)
    +(bv2int (bvand ((_ int2bv k) i_1) ((_ int2bv k) i_2)))
    +
    +
    +
    +

    + for all integers + + + i_1 + + + , + + + i_2 + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1..2: + + + Terms of Sort Int +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Bit-width + + \(k\) + +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + IMPLIES + + + + ¶ + +
    +
    +

    + Logical implication. +

    + +
    +
    +
    +
    + + + INST_ADD_TO_POOL + + + + ¶ + +
    +
    +

    + A instantantiation-add-to-pool annotation. +

    +

    + An instantantiation-add-to-pool annotation indicates that when a quantified +formula is instantiated, the instantiated version of a term should be +added to the given pool. +

    +

    + For example, consider a quantified formula: +

    +
    +
    +
    (FORALL (VARIABLE_LIST x) F
    +        (INST_PATTERN_LIST (INST_ADD_TO_POOL (ADD x 1) p)))
    +
    +
    +
    +

    + where assume that + + \(x\) + + has type Int. When this quantified formula is +instantiated with, e.g., the term + + \(t\) + + , the term + + + (ADD + + + t + + + 1) + + + is +added to pool + + \(p\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The Term whose free variables are bound by the quantified formula. +

        +
      • +
      • +

        + + + 2: + + + The pool to add to, whose Sort should be a set of elements that match the Sort of the first argument. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + INST_ATTRIBUTE + + + + ¶ + +
    +
    +

    + Instantiation attribute. +

    +

    + Specifies a custom property for a quantified formula given by a +term that is ascribed a user attribute. +

    + +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + INST_NO_PATTERN + + + + ¶ + +
    +
    +

    + Instantiation no-pattern. +

    +

    + Specifies a (list of) terms that should not be used as a pattern for +quantifier instantiation. +

    + +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + INST_PATTERN + + + + ¶ + +
    +
    +

    + Instantiation pattern. +

    +

    + Specifies a (list of) terms to be used as a pattern for quantifier +instantiation. +

    + +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + INST_PATTERN_LIST + + + + ¶ + +
    +
    +

    + A list of instantiation patterns, attributes or annotations. +

    + +
    +
    +
    +
    + + + INST_POOL + + + + ¶ + +
    +
    +

    + Instantiation pool annotation. +

    +

    + Specifies an annotation for pool based instantiation. +

    +
    +
    + In detail, pool symbols can be declared via the method +
    +
    + +
    +
    +

    + A pool symbol represents a set of terms of a given sort. An instantiation +pool annotation should match the types of the quantified formula. +

    +

    + For example, for a quantified formula: +

    +
    +
    +
    (FORALL (VARIABLE_LIST x y) F (INST_PATTERN_LIST (INST_POOL p q)))
    +
    +
    +
    +

    + if + + \(x\) + + and + + \(y\) + + have Sorts + + \(S_1\) + + and + + \(S_2\) + + , then +pool symbols + + \(p\) + + and + + \(q\) + + should have Sorts (Set + + \(S_1\) + + ) +and (Set + + \(S_2\) + + ), respectively. This annotation specifies that the +quantified formula above should be instantiated with the product of all +terms that occur in the sets + + \(p\) + + and + + \(q\) + + . +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 0 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms that comprise the pools, which are one-to-one with the variables of the quantified formula to be instantiated +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + INTERNAL_KIND + + + + ¶ + +
    +
    +

    + Internal kind. +

    +

    + This kind serves as an abstraction for internal kinds that are not exposed +via the API but may appear in terms returned by API functions, e.g., +when querying the simplified form of a term. +

    +
    +

    + Note +

    +

    + Should never be created via the API. +

    +
    +
    +
    +
    +
    + + + INTS_DIVISION + + + + ¶ + +
    +
    +

    + Integer division, division by 0 undefined, left associative. +

    + +
    +
    +
    +
    + + + INTS_MODULUS + + + + ¶ + +
    +
    +

    + Integer modulus, modulus by 0 undefined. +

    + +
    +
    +
    +
    + + + INT_TO_BITVECTOR + + + + ¶ + +
    +
    +

    + Conversion from Int to bit-vector. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort Int +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The size of the bit-vector to convert to. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + IS_INTEGER + + + + ¶ + +
    +
    +

    + Is-integer predicate. +

    + +
    +
    +
    +
    + + + ITE + + + + ¶ + +
    +
    +

    + If-then-else. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort Bool +

        +
      • +
      • +

        + + + 2: + + + The ‘then’ term, Term of any Sort +

        +
      • +
      • +

        + + + 3: + + + The ‘else’ term, Term of the same sort as second argument +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + LAMBDA + + + + ¶ + +
    +
    +

    + Lambda expression. +

    + +
    +
    +
    +
    + + + LAST_KIND + + + + ¶ + +
    +
    +

    + Marks the upper-bound of this enumeration. +

    +
    +
    +
    +
    + + + LEQ + + + + ¶ + +
    +
    +

    + Less than or equal, chainable. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + LT + + + + ¶ + +
    +
    +

    + Less than, chainable. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + MATCH + + + + ¶ + +
    +
    +

    + Match expression. +

    +

    + This kind is primarily used in the parser to support the +SMT-LIBv2 + + + match + + + expression. +

    +

    + For example, the SMT-LIBv2 syntax for the following match term +

    +
    +
    +
    (match l (((cons h t) h) (nil 0)))
    +
    +
    +
    +

    + is represented by the AST +

    +
    +
    +
    (MATCH l
    +    (MATCH_BIND_CASE (VARIABLE_LIST h t) (cons h t) h)
    +    (MATCH_CASE nil 0))
    +
    +
    +
    +

    + Terms of kind + + + + MATCH_CASE + + + + are constant case expressions, +which are used for nullary constructors. Kind + + + + MATCH_BIND_CASE + + + + is used for constructors with selectors +and variable match patterns. If not all constructors are covered, at least +one catch-all variable pattern must be included. +

    + +
    +
    +
    +
    + + + MATCH_BIND_CASE + + + + ¶ + +
    +
    +

    + Match case with binders, for constructors with selectors and variable +patterns. +

    +

    + A (non-constant) case expression to be used within a match expression. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + For variable patterns: +

        +
          +
        • +

          + + + 1: + + + Term of kind + + + + VARIABLE_LIST + + + + (containing the free variable of the case) +

          +
        • +
        • +

          + + + 2: + + + Term of kind + + + + VARIABLE + + + + (the pattern expression, the free variable of the case) +

          +
        • +
        • +

          + + + 3: + + + Term of any Sort (the term the pattern evaluates to) +

          +
        • +
        +
      • +
      • +

        + For constructors with selectors: +

        +
          +
        • +

          + + + 1: + + + Term of kind + + + + VARIABLE_LIST + + + + (containing the free variable of the case) +

          +
        • +
        • +

          + + + 2: + + + Term of kind + + + + APPLY_CONSTRUCTOR + + + + (the pattern expression, applying the set of variables to the constructor) +

          +
        • +
        • +

          + + + 3: + + + Term of any Sort (the term the match term evaluates to) +

          +
        • +
        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + MATCH_CASE + + + + ¶ + +
    +
    +

    + Match case for nullary constructors. +

    +

    + A (constant) case expression to be used within a match expression. +

    + +
    +
    +
    +
    + + + MULT + + + + ¶ + +
    +
    +

    + Arithmetic multiplication. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + NEG + + + + ¶ + +
    +
    +

    + Arithmetic negation. +

    + +
    +
    +
    +
    + + + NOT + + + + ¶ + +
    +
    +

    + Logical negation. +

    + +
    +
    +
    +
    + + + NULL_TERM + + + + ¶ + +
    +
    +

    + Null kind. +

    +

    + The kind of a null term ( + + + Term.Term() + + + ). +

    +
    +

    + Note +

    +

    + May not be explicitly created via API functions other than + + + Term.Term() + + + . +

    +
    +
    +
    +
    +
    + + + OR + + + + ¶ + +
    +
    +

    + Logical disjunction. +

    + +
    +
    +
    +
    + + + PI + + + + ¶ + +
    +
    +

    + Pi constant. +

    + +
    +

    + Note +

    +

    + + + + PI + + + + is considered a special symbol of Sort +Real, but is not a Real value, i.e., + + + + Term.isRealValue() + + + + will return + + + false + + + . +

    +
    +
    +
    +
    +
    + + + POW + + + + ¶ + +
    +
    +

    + Arithmetic power. +

    + +
    +
    +
    +
    + + + POW2 + + + + ¶ + +
    +
    +

    + Power of two. +

    +

    + Operator for raising + + + 2 + + + to a non-negative integer power. +

    + +
    +
    +
    +
    + + + REGEXP_ALL + + + + ¶ + +
    +
    +

    + Regular expression all. +

    + +
    +
    +
    +
    + + + REGEXP_ALLCHAR + + + + ¶ + +
    +
    +

    + Regular expression all characters. +

    + +
    +
    +
    +
    + + + REGEXP_COMPLEMENT + + + + ¶ + +
    +
    +

    + Regular expression complement. +

    + +
    +
    +
    +
    + + + REGEXP_CONCAT + + + + ¶ + +
    +
    +

    + Regular expression concatenation. +

    + +
    +
    +
    +
    + + + REGEXP_DIFF + + + + ¶ + +
    +
    +

    + Regular expression difference. +

    + +
    +
    +
    +
    + + + REGEXP_INTER + + + + ¶ + +
    +
    +

    + Regular expression intersection. +

    + +
    +
    +
    +
    + + + REGEXP_LOOP + + + + ¶ + +
    +
    +

    + Regular expression loop. +

    +

    + Regular expression loop from lower bound to upper bound number of +repetitions. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RegLan +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The lower bound +

        +
      • +
      • +

        + + + 2: + + + The upper bound +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + REGEXP_NONE + + + + ¶ + +
    +
    +

    + Regular expression none. +

    + +
    +
    +
    +
    + + + REGEXP_OPT + + + + ¶ + +
    +
    +

    + Regular expression ?. +

    + +
    +
    +
    +
    + + + REGEXP_PLUS + + + + ¶ + +
    +
    +

    + Regular expression +. +

    + +
    +
    +
    +
    + + + REGEXP_RANGE + + + + ¶ + +
    +
    +

    + Regular expression range. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (lower bound character for the range) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String (upper bound character for the range) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + REGEXP_REPEAT + + + + ¶ + +
    +
    +

    + Operator for regular expression repeat. +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort RegLan +

        +
      • +
      +
    • +
    • +

      + Indices: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + The number of repetitions +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + REGEXP_STAR + + + + ¶ + +
    +
    +

    + Regular expression *. +

    + +
    +
    +
    +
    + + + REGEXP_UNION + + + + ¶ + +
    +
    +

    + Regular expression union. +

    + +
    +
    +
    +
    + + + RELATION_AGGREGATE + + + + ¶ + +
    +
    +

    + Relation aggregate operator has the form + + \(((\_ \; rel.aggr \; n_1 ... n_k) \; f \; i \; A)\) + + where + + \(n_1, ..., n_k\) + + are natural numbers, + + \(f\) + + is a function of type + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + + , + + \(i\) + + has the type + + \(T\) + + , +and + + \(A\) + + has type + + \((Relation \; T_1 \; ... \; T_j)\) + + . +The returned type is + + \((Set \; T)\) + + . +

    +

    + This operator aggregates elements in A that have the same tuple projection +with indices n_1, …, n_k using the combining function + + \(f\) + + , +and initial value + + \(i\) + + . +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sort + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of Sort + + \(T\) + +

        +
      • +
      • +

        + + + 3: + + + Term of relation sort + + \(Relation T_1 ... T_j\) + +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

      +
    • +
    • +

      + Create Term of this Kind with: +- + + + + Solver.mkTerm() + + + +

      +
    • +
    • +

      + Create Op of this kind with: +- + + + + Solver.mkOp() + + + +

      +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + RELATION_GROUP + + + + ¶ + +
    +
    +

    + Relation group +

    +

    + + \(((\_ \; rel.group \; n_1 \; \dots \; n_k) \; A)\) + + partitions tuples +of relation + + \(A\) + + such that tuples that have the same projection +with indices + + \(n_1 \; \dots \; n_k\) + + are in the same part. +It returns a set of relations of type + + \((Set \; T)\) + + where + + \(T\) + + is the type of + + \(A\) + + . +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of relation sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + +

      +
        +
      • +

        + + + 1..n: + + + Indices of the projection +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + RELATION_IDEN + + + + ¶ + +
    +
    +

    + Relation identity. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + RELATION_JOIN + + + + ¶ + +
    +
    +

    + Relation join. +

    + +
    +
    +
    +
    + + + RELATION_JOIN_IMAGE + + + + ¶ + +
    +
    +

    + Relation join image. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + RELATION_PRODUCT + + + + ¶ + +
    +
    +

    + Relation cartesian product. +

    + +
    +
    +
    +
    + + + RELATION_PROJECT + + + + ¶ + +
    +
    +

    + Relation projection operator extends tuple projection operator to sets. +

    +
      +
    • +

      + Arity: + + + 1 + + + - + + + 1: + + + Term of relation Sort +

      +
    • +
    • +

      + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

      +
    • +
    • +

      + Create Term of this Kind with: +- + + + + Solver.mkTerm() + + + +

      +
    • +
    • +

      + Create Op of this kind with: +- + + + + Solver.mkOp() + + + +

      +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + RELATION_TCLOSURE + + + + ¶ + +
    +
    +

    + Relation transitive closure. +

    + +
    +
    +
    +
    + + + RELATION_TRANSPOSE + + + + ¶ + +
    +
    +

    + Relation transpose. +

    + +
    +
    +
    +
    + + + SECANT + + + + ¶ + +
    +
    +

    + Secant function. +

    + +
    +
    +
    +
    + + + SELECT + + + + ¶ + +
    +
    +

    + Array select. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of array Sort +

        +
      • +
      • +

        + + + 2: + + + Term of array index Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEP_EMP + + + + ¶ + +
    +
    +

    + Separation logic empty heap. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SEP_NIL + + + + ¶ + +
    +
    +

    + Separation logic nil. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SEP_PTO + + + + ¶ + +
    +
    +

    + Separation logic points-to relation. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term denoting the location of the points-to constraint +

        +
      • +
      • +

        + + + 2: + + + Term denoting the data of the points-to constraint +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SEP_STAR + + + + ¶ + +
    +
    +

    + Separation logic star. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +
        +
        + + + 1..n: + + + Terms of sort Bool (the child constraints that hold in +
        +
        +

        + disjoint (separated) heaps) +

        +
        +
        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SEP_WAND + + + + ¶ + +
    +
    +

    + Separation logic magic wand. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Terms of Sort Bool (the antecendant of the magic wand constraint) +

        +
      • +
      • +
        +
        + + + 2: + + + Terms of Sort Bool (conclusion of the magic wand constraint, +
        +
        +

        + which is asserted to hold in all heaps that are disjoint +extensions of the antecedent) +

        +
        +
        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SEQ_AT + + + + ¶ + +
    +
    +

    + Sequence element at. +

    +

    + Returns the element at index + + \(i\) + + from a sequence + + \(s\) + + . If the index +is negative or the index is greater or equal to the length of the +sequence, the result is the empty sequence. Otherwise the result is a +sequence of length + + + 1 + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_CONCAT + + + + ¶ + +
    +
    +

    + Sequence concat. +

    + +
    +
    +
    +
    + + + SEQ_CONTAINS + + + + ¶ + +
    +
    +

    + Sequence contains. +

    +

    + Checks whether a sequence + + \(s_1\) + + contains another sequence + + \(s_2\) + + . If + + \(s_2\) + + is empty, the result is always + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_EXTRACT + + + + ¶ + +
    +
    +

    + Sequence extract. +

    +

    + Extracts a subsequence, starting at index + + \(i\) + + and of length + + \(l\) + + , +from a sequence + + \(s\) + + . If the start index is negative, the start index +is greater than the length of the sequence, or the length is negative, the +result is the empty sequence. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Int (length + + \(l\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_INDEXOF + + + + ¶ + +
    +
    +

    + Sequence index-of. +

    +

    + Returns the index of a subsequence + + \(s_2\) + + in a sequence + + \(s_1\) + + starting at index + + \(i\) + + . If the index is negative or greater than the +length of sequence + + \(s_1\) + + or the subsequence + + \(s_2\) + + does not +appear in sequence + + \(s_1\) + + after index + + \(i\) + + , the result is -1. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Int ( + + \(i\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_LENGTH + + + + ¶ + +
    +
    +

    + Sequence length. +

    + +
    +
    +
    +
    + + + SEQ_NTH + + + + ¶ + +
    +
    +

    + Sequence nth. +

    +

    + Corresponds to the nth element of a sequence. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int ( + + \(n\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_PREFIX + + + + ¶ + +
    +
    +

    + Sequence prefix-of. +

    +

    + Checks whether a sequence + + \(s_1\) + + is a prefix of sequence + + \(s_2\) + + . +If sequence + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_REPLACE + + + + ¶ + +
    +
    +

    + Sequence replace. +

    +

    + Replaces the first occurrence of a sequence + + \(s_2\) + + in a +sequence + + \(s_1\) + + with sequence + + \(s_3\) + + . If + + \(s_2\) + + does not +appear in + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of sequence Sort ( + + \(s_3\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_REPLACE_ALL + + + + ¶ + +
    +
    +

    + Sequence replace all. +

    +

    + Replaces all occurrences of a sequence + + \(s_2\) + + in a sequence + + \(s_1\) + + with sequence + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , sequence + + \(s_1\) + + is returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of sequence Sort ( + + \(s_3\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_REV + + + + ¶ + +
    +
    +

    + Sequence reverse. +

    + +
    +
    +
    +
    + + + SEQ_SUFFIX + + + + ¶ + +
    +
    +

    + Sequence suffix-of. +

    +

    + Checks whether a sequence + + \(s_1\) + + is a suffix of sequence + + \(s_2\) + + . +If sequence + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of sequence Sort ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SEQ_UNIT + + + + ¶ + +
    +
    +

    + Sequence unit. +

    +

    + Corresponds to a sequence of length one with the given term. +

    + +
    +
    +
    +
    + + + SEQ_UPDATE + + + + ¶ + +
    +
    +

    + Sequence update. +

    +

    + Updates a sequence + + \(s\) + + by replacing its context starting at an index +with string + + \(t\) + + . If the start index is negative, the start index is +greater than the length of the sequence, the result is + + \(s\) + + . Otherwise, +the length of the original sequence is preserved. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sequence Sort +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of sequence Sort (replacement sequence + + \(t\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SET_CARD + + + + ¶ + +
    +
    +

    + Set cardinality. +

    + +
    +
    +
    +
    + + + SET_CHOOSE + + + + ¶ + +
    +
    +

    + Set choose. +

    +

    + Select an element from a given set. For a set + + \(A = \{x\}\) + + , the term +(set.choose + + \(A\) + + ) is equivalent to the term + + \(x_1\) + + . For an empty +set, it is an arbitrary value. For a set with cardinality > 1, it will +deterministically return an element in + + \(A\) + + . +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_COMPLEMENT + + + + ¶ + +
    +
    +

    + Set complement with respect to finite universe. +

    + +
    +
    +
    +
    + + + SET_COMPREHENSION + + + + ¶ + +
    +
    +

    + Set comprehension +

    +

    + A set comprehension is specified by a variable list + + \(x_1 ... x_n\) + + , +a predicate + + \(P[x_1...x_n]\) + + , and a term + + \(t[x_1...x_n]\) + + . A +comprehension + + \(C\) + + with the above form has members given by the +following semantics: +

    +
    + \[\forall y. ( \exists x_1...x_n. P[x_1...x_n] \wedge t[x_1...x_n] = y ) +\Leftrightarrow (set.member \; y \; C)\] +
    +

    + where + + \(y\) + + ranges over the element Sort of the (set) Sort of the +comprehension. If + + \(t[x_1..x_n]\) + + is not provided, it is equivalent +to + + \(y\) + + in the above formula. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Kind + + + + VARIABLE_LIST + + + +

        +
      • +
      • +

        + + + 2: + + + Term of sort Bool (the predicate of the comprehension) +

        +
      • +
      • +

        + + + 3: + + + (optional) Term denoting the generator for the comprehension +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_EMPTY + + + + ¶ + +
    +
    +

    + Empty set. +

    + +
    +
    +
    +
    + + + SET_FILTER + + + + ¶ + +
    +
    +

    + Set filter. +

    +

    + This operator filters the elements of a set. +(set.filter + + \(p \; A\) + + ) takes a predicate + + \(p\) + + of Sort + + \((\rightarrow T \; Bool)\) + + as a first argument, and a set + + \(A\) + + of Sort (Set + + \(T\) + + ) as a second argument, and returns a subset of Sort +(Set + + \(T\) + + ) that includes all elements of + + \(A\) + + that satisfy + + \(p\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow T \; Bool)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of bag Sort (Set + + \(T\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_FOLD + + + + ¶ + +
    +
    +

    + Set fold. +

    +

    + This operator combines elements of a set into a single value. +(set.fold + + \(f \; t \; A\) + + ) folds the elements of set + + \(A\) + + starting with Term + + \(t\) + + and using the combining function + + \(f\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2 \; S_2)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of Sort + + \(S_2\) + + (the initial value) +

        +
      • +
      • +

        + + + 3: + + + Term of bag Sort (Set + + \(S_1\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_INSERT + + + + ¶ + +
    +
    +

    + The set obtained by inserting elements; +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 0 + + +

      +
        +
      • +

        + + + 1..n-1: + + + Terms of any Sort (must match the element sort of the given set Term) +

        +
      • +
      • +

        + + + n: + + + Term of set Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SET_INTER + + + + ¶ + +
    +
    +

    + Set intersection. +

    + +
    +
    +
    +
    + + + SET_IS_SINGLETON + + + + ¶ + +
    +
    +

    + Set is singleton tester. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_MAP + + + + ¶ + +
    +
    +

    + Set map. +

    +

    + This operator applies the first argument, a function of +Sort + + \((\rightarrow S_1 \; S_2)\) + + , to every element of the second +argument, a set of Sort (Set + + \(S_1\) + + ), and returns a set of Sort +(Set + + \(S_2\) + + ). +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of function Sort + + \((\rightarrow S_1 \; S_2)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of set Sort (Set + + \(S_1\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SET_MEMBER + + + + ¶ + +
    +
    +

    + Set membership predicate. +

    +

    + Determines if the given set element is a member of the second set. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of any Sort (must match the element Sort of the given set Term) +

        +
      • +
      • +

        + + + 2: + + + Term of set Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SET_MINUS + + + + ¶ + +
    +
    +

    + Set subtraction. +

    + +
    +
    +
    +
    + + + SET_SINGLETON + + + + ¶ + +
    +
    +

    + Singleton set. +

    +

    + Construct a singleton set from an element given as a parameter. +The returned set has the same Sort as the element. +

    + +
    +
    +
    +
    + + + SET_SUBSET + + + + ¶ + +
    +
    +

    + Subset predicate. +

    +

    + Determines if the first set is a subset of the second set. +

    + +
    +
    +
    +
    + + + SET_UNION + + + + ¶ + +
    +
    +

    + Set union. +

    + +
    +
    +
    +
    + + + SET_UNIVERSE + + + + ¶ + +
    +
    +

    + Finite universe set. +

    +

    + All set variables must be interpreted as subsets of it. +

    + +
    +

    + Note +

    +

    + + + + SET_UNIVERSE + + + + is considered a special symbol of +the theory of sets and is not considered as a set value, i.e., + + + + Term.isSetValue() + + + + will return + + + false + + + . +

    +
    +
    +
    +
    +
    + + + SEXPR + + + + ¶ + +
    +
    +

    + Symbolic expression. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + SINE + + + + ¶ + +
    +
    +

    + Sine function. +

    + +
    +
    +
    +
    + + + SKOLEM_ADD_TO_POOL + + + + ¶ + +
    +
    +

    + A skolemization-add-to-pool annotation. +

    +

    + An skolemization-add-to-pool annotation indicates that when a quantified +formula is skolemized, the skolemized version of a term should be added to +the given pool. +

    +

    + For example, consider a quantified formula: +

    +
    +
    +
    (FORALL (VARIABLE_LIST x) F
    +        (INST_PATTERN_LIST (SKOLEM_ADD_TO_POOL (ADD x 1) p)))
    +
    +
    +
    +

    + where assume that + + \(x\) + + has type Int. When this quantified formula is +skolemized, e.g., with + + \(k\) + + of type Int, then the term + + + (ADD + + + k + + + 1) + + + is added to the pool + + \(p\) + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + The Term whose free variables are bound by the quantified formula. +

        +
      • +
      • +

        + + + 2: + + + The pool to add to, whose Sort should be a set of elements that match the Sort of the first argument. +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +

    + Note +

    +

    + Should only be used as a child of + + + + INST_PATTERN_LIST + + + + . +

    +
    +
    +
    +
    +
    + + + SQRT + + + + ¶ + +
    +
    +

    + Square root. +

    + +
    +
    +
    +
    + + + STORE + + + + ¶ + +
    +
    +

    + Array store. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of array Sort +

        +
      • +
      • +

        + + + 2: + + + Term of array index Sort +

        +
      • +
      • +

        + + + 3: + + + Term of array element Sort +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_CHARAT + + + + ¶ + +
    +
    +

    + String character at. +

    +

    + Returns the character at index + + \(i\) + + from a string + + \(s\) + + . If the +index is negative or the index is greater than the length of the string, +the result is the empty string. Otherwise the result is a string of +length 1. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (string + + \(s\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_CONCAT + + + + ¶ + +
    +
    +

    + String concat. +

    + +
    +
    +
    +
    + + + STRING_CONTAINS + + + + ¶ + +
    +
    +

    + String contains. +

    +

    + Determines whether a string + + \(s_1\) + + contains another string + + \(s_2\) + + . If + + \(s_2\) + + is empty, the result is always + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (the string + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String (the string + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_FROM_CODE + + + + ¶ + +
    +
    +

    + String from code. +

    +

    + Returns a string containing a single character whose code point matches +the argument to this function, or the empty string if the argument is +out-of-bounds. +

    + +
    +
    +
    +
    + + + STRING_FROM_INT + + + + ¶ + +
    +
    +

    + Conversion from Int to String. +

    +

    + If the integer is negative this operator returns the empty string. +

    + +
    +
    +
    +
    + + + STRING_INDEXOF + + + + ¶ + +
    +
    +

    + String index-of. +

    +

    + Returns the index of a substring + + \(s_2\) + + in a string + + \(s_1\) + + starting at index + + \(i\) + + . If the index is negative or greater than the +length of string + + \(s_1\) + + or the substring + + \(s_2\) + + does not appear +in string + + \(s_1\) + + after index + + \(i\) + + , the result is -1. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (substring + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String (substring + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_INDEXOF_RE + + + + ¶ + +
    +
    +

    + String index-of regular expression match. +

    +

    + Returns the first match of a regular expression + + \(r\) + + in a +string + + \(s\) + + . If the index is negative or greater than the length of +string + + \(s_1\) + + , or + + \(r\) + + does not match a substring in + + \(s\) + + after index + + \(i\) + + , the result is -1. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (string + + \(s\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort RegLan (regular expression + + \(r\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_IN_REGEXP + + + + ¶ + +
    +
    +

    + String membership. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String +

        +
      • +
      • +

        + + + 2: + + + Term of Sort RegLan +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_IS_DIGIT + + + + ¶ + +
    +
    +

    + String is-digit. +

    +

    + Returns true if given string is a digit (it is one of + + + "0" + + + , …, + + + "9" + + + ). +

    + +
    +
    +
    +
    + + + STRING_LENGTH + + + + ¶ + +
    +
    +

    + String length. +

    + +
    +
    +
    +
    + + + STRING_LEQ + + + + ¶ + +
    +
    +

    + String less than or equal. +

    +

    + Returns true if string + + \(s_1\) + + is less than or equal to + + \(s_2\) + + based on a lexiographic ordering over code points. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_LT + + + + ¶ + +
    +
    +

    + String less than. +

    +

    + Returns true if string + + \(s_1\) + + is (strictly) less than + + \(s_2\) + + based on a lexiographic ordering over code points. +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_PREFIX + + + + ¶ + +
    +
    +

    + String prefix-of. +

    +

    + Determines whether a string + + \(s_1\) + + is a prefix of string + + \(s_2\) + + . +If string s1 is empty, this operator returns + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_REPLACE + + + + ¶ + +
    +
    +

    + String replace. +

    +

    + Replaces a string + + \(s_2\) + + in a string + + \(s_1\) + + with string + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , + + \(s_1\) + + is +returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String (string + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String (string + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort String (string + + \(s_3\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_REPLACE_ALL + + + + ¶ + +
    +
    +

    + String replace all. +

    +

    + Replaces all occurrences of a string + + \(s_2\) + + in a string + + \(s_1\) + + with string + + \(s_3\) + + . If + + \(s_2\) + + does not appear in + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort String ( + + \(s_3\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_REPLACE_RE + + + + ¶ + +
    +
    +

    + String replace regular expression match. +

    +

    + Replaces the first match of a regular expression + + \(r\) + + in +string + + \(s_1\) + + with string + + \(s_2\) + + . If + + \(r\) + + does not match a +substring of + + \(s_1\) + + , + + \(s_1\) + + is returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort RegLan +

        +
      • +
      • +

        + + + 3: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_REPLACE_RE_ALL + + + + ¶ + +
    +
    +

    + String replace all regular expression matches. +

    +

    + Replaces all matches of a regular expression + + \(r\) + + in string + + \(s_1\) + + with string + + \(s_2\) + + . If + + \(r\) + + does not match a +substring of + + \(s_1\) + + , string + + \(s_1\) + + is returned unmodified. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort RegLan +

        +
      • +
      • +

        + + + 3: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_REV + + + + ¶ + +
    +
    +

    + String reverse. +

    + +
    +
    +
    +
    + + + STRING_SUBSTR + + + + ¶ + +
    +
    +

    + String substring. +

    +

    + Extracts a substring, starting at index + + \(i\) + + and of length + + \(l\) + + , +from a string + + \(s\) + + . If the start index is negative, the start index +is greater than the length of the string, or the length is negative, the +result is the empty string. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Int (length + + \(l\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_SUFFIX + + + + ¶ + +
    +
    +

    + String suffix-of. +

    +

    + Determines whether a string + + \(s_1\) + + is a suffix of the second string. +If string + + \(s_1\) + + is empty, this operator returns + + + true + + + . +

    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String ( + + \(s_1\) + + ) +

        +
      • +
      • +

        + + + 2: + + + Term of Sort String ( + + \(s_2\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + STRING_TO_CODE + + + + ¶ + +
    +
    +

    + String to code. +

    +

    + Returns the code point of a string if it has length one, or returns + + -1 + + otherwise. +

    + +
    +
    +
    +
    + + + STRING_TO_INT + + + + ¶ + +
    +
    +

    + String to integer (total function). +

    +

    + If the string does not contain an integer or the integer is negative, the +operator returns + + -1 + + . +

    + +
    +
    +
    +
    + + + STRING_TO_LOWER + + + + ¶ + +
    +
    +

    + String to lower case. +

    + +
    +
    +
    +
    + + + STRING_TO_REGEXP + + + + ¶ + +
    +
    +

    + Conversion from string to regexp. +

    + +
    +
    +
    +
    + + + STRING_TO_UPPER + + + + ¶ + +
    +
    +

    + String to upper case. +

    + +
    +
    +
    +
    + + + STRING_UPDATE + + + + ¶ + +
    +
    +

    + String update. +

    +

    + Updates a string + + \(s\) + + by replacing its context starting at an index +with string + + \(t\) + + . If the start index is negative, the start index is +greater than the length of the string, the result is + + \(s\) + + . Otherwise, +the length of the original string is preserved. +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of Sort String +

        +
      • +
      • +

        + + + 2: + + + Term of Sort Int (index + + \(i\) + + ) +

        +
      • +
      • +

        + + + 3: + + + Term of Sort Strong (replacement string + + \(t\) + + ) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + SUB + + + + ¶ + +
    +
    +

    + Arithmetic subtraction, left associative. +

    +
      +
    • +

      + Arity: + + + n + + + > + + + 1 + + +

      +
        +
      • +

        + + + 1..n: + + + Terms of Sort Int or Real (sorts must match) +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + TABLE_AGGREGATE + + + + ¶ + +
    +
    +

    + Table aggregate operator has the form + + \(((\_ \; table.aggr \; n_1 ... n_k) \; f \; i \; A)\) + + where + + \(n_1, ..., n_k\) + + are natural numbers, + + \(f\) + + is a function of type + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + + , + + \(i\) + + has the type + + \(T\) + + , +and + + \(A\) + + has type + + \((Table \; T_1 \; ... \; T_j)\) + + . +The returned type is + + \((Bag \; T)\) + + . +

    +

    + This operator aggregates elements in A that have the same tuple projection +with indices n_1, …, n_k using the combining function + + \(f\) + + , +and initial value + + \(i\) + + . +

    +
      +
    • +

      + Arity: + + + 3 + + +

      +
        +
      • +

        + + + 1: + + + Term of sort + + \((\rightarrow (Tuple \; T_1 \; ... \; T_j)\; T \; T)\) + +

        +
      • +
      • +

        + + + 2: + + + Term of Sort + + \(T\) + +

        +
      • +
      • +

        + + + 3: + + + Term of table sort + + \(Table T_1 ... T_j\) + +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

      +
    • +
    • +

      + Create Term of this Kind with: +- + + + + Solver.mkTerm() + + + +

      +
    • +
    • +

      + Create Op of this kind with: +- + + + + Solver.mkOp() + + + +

      +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + TABLE_GROUP + + + + ¶ + +
    +
    +

    + Table group +

    +

    + + \(((\_ \; table.group \; n_1 \; \dots \; n_k) \; A)\) + + partitions tuples +of table + + \(A\) + + such that tuples that have the same projection +with indices + + \(n_1 \; \dots \; n_k\) + + are in the same part. +It returns a bag of tables of type + + \((Bag \; T)\) + + where + + \(T\) + + is the type of + + \(A\) + + . +

    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of table sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + +

      +
        +
      • +

        + + + 1..n: + + + Indices of the projection +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + TABLE_JOIN + + + + ¶ + +
    +
    +
    +
    + Table join operator has the form +
    +
    +

    + + \(((\_ \; table.join \; m_1 \; n_1 \; \dots \; m_k \; n_k) \; A \; B)\) + + where + + \(m_1 \; n_1 \; \dots \; m_k \; n_k\) + + are natural numbers, +and + + \(A, B\) + + are tables. +This operator filters the product of two bags based on the equality of +projected tuples using indices + + \(m_1, \dots, m_k\) + + in table + + \(A\) + + , +and indices + + \(n_1, \dots, n_k\) + + in table + + \(B\) + + . +

    +
    +
    +
      +
    • +

      + Arity: + + + 2 + + +

      +
        +
      • +

        + + + 1: + + + Term of table Sort +

        +
      • +
      • +

        + + + 2: + + + Term of table Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

      +
    • +
    • +

      + Create Term of this Kind with: +- + + + + Solver.mkTerm() + + + +

      +
    • +
    • +

      + Create Op of this kind with: +- + + + + Solver.mkOp() + + + +

      +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + TABLE_PRODUCT + + + + ¶ + +
    +
    +

    + Table cross product. +

    + +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + TABLE_PROJECT + + + + ¶ + +
    +
    +

    + Table projection operator extends tuple projection operator to tables. +

    +
      +
    • +

      + Arity: + + + 1 + + + - + + + 1: + + + Term of table Sort +

      +
    • +
    • +

      + Indices: + + + n + + + - + + + 1..n: + + + Indices of the projection +

      +
    • +
    • +

      + Create Term of this Kind with: +- + + + + Solver.mkTerm() + + + +

      +
    • +
    • +

      + Create Op of this kind with: +- + + + + Solver.mkOp() + + + +

      +
    • +
    +
    +

    + Warning +

    +

    + This kind is experimental and may be changed or removed in +future versions. +

    +
    +
    +
    +
    +
    + + + TANGENT + + + + ¶ + +
    +
    +

    + Tangent function. +

    + +
    +
    +
    +
    + + + TO_INTEGER + + + + ¶ + +
    +
    +

    + Convert Term of sort Int or Real to Int via the floor function. +

    + +
    +
    +
    +
    + + + TO_REAL + + + + ¶ + +
    +
    +

    + Convert Term of Sort Int or Real to Real. +

    + +
    +
    +
    +
    + + + TUPLE_PROJECT + + + + ¶ + +
    +
    +

    + Tuple projection. +

    +

    + This operator takes a tuple as an argument and returns a tuple obtained by +concatenating components of its argument at the provided indices. +

    +

    + For example, +

    +
    +
    +
    ((_ tuple.project 1 2 2 3 1) (tuple 10 20 30 40))
    +
    +
    +
    +

    + yields +

    +
    +
    +
    (tuple 20 30 30 40 20)
    +
    +
    +
    +
      +
    • +

      + Arity: + + + 1 + + +

      +
        +
      • +

        + + + 1: + + + Term of tuple Sort +

        +
      • +
      +
    • +
    • +

      + Indices: + + + n + + +

      +
        +
      • +

        + + + 1..n: + + + The tuple indices to project +

        +
      • +
      +
    • +
    • +

      + Create Term of this Kind with: +

      + +
    • +
    • +

      + Create Op of this kind with: +

      + +
    • +
    +
    +
    +
    +
    + + + UNDEFINED_KIND + + + + ¶ + +
    +
    +

    + Undefined kind. +

    +
    +

    + Note +

    +

    + Should never be exposed or created via the API. +

    +
    +
    +
    +
    +
    + + + UNINTERPRETED_SORT_VALUE + + + + ¶ + +
    +
    +

    + The value of an uninterpreted constant. +

    +
    +

    + Note +

    +

    + May be returned as the result of an API call, but terms of this +kind may not be created explicitly via the API and may not +appear in assertions. +

    +
    +
    +
    +
    +
    + + + VARIABLE + + + + ¶ + +
    +
    +

    + (Bound) variable. +

    + +
    +

    + Note +

    +

    + Only permitted in bindings and in lambda and quantifier bodies. +

    +
    +
    +
    +
    +
    + + + VARIABLE_LIST + + + + ¶ + +
    +
    +

    + Variable list. +

    +

    + A list of variables (used to bind variables under a quantifier) +

    + +
    +
    +
    +
    + + + WITNESS + + + + ¶ + +
    +
    +

    + Witness. +

    +

    + The syntax of a witness term is similar to a quantified formula except that +only one variable is allowed. +For example, the term +

    +
    +
    +
    (witness ((x S)) F)
    +
    +
    +
    +

    + returns an element + + \(x\) + + of Sort + + \(S\) + + and asserts formula + + \(F\) + + . +

    +

    + The witness operator behaves like the description operator +(see https: +no + + \(x\) + + that satisfies + + \(F\) + + . But if such + + \(x\) + + exists, the +witness operator does not enforce the following axiom which ensures +uniqueness up to logical equivalence: +

    +
    + \[\forall x. F \equiv G \Rightarrow witness~x. F = witness~x. G\] +
    +

    + For example, if there are two elements of Sort + + \(S\) + + that satisfy +formula + + \(F\) + + , then the following formula is satisfiable: +

    +
    +
    +
    (distinct
    +   (witness ((x Int)) F)
    +   (witness ((x Int)) F))
    +
    +
    +
    + +
    +

    + Note +

    +

    + This kind is primarily used internally, but may be returned in +models (e.g., for arithmetic terms in non-linear queries). However, +it is not supported by the parser. Moreover, the user of the API +should be cautious when using this operator. In general, all witness +terms + + + (witness + + + ((x + + + Int)) + + + F) + + + should be such that + + + (exists + + + ((x + + + Int)) + + + F) + + + is a valid formula. If this is not the case, then the semantics +in formulas that use witness terms may be unintuitive. For example, +the following formula is unsatisfiable: + + + (or + + + (= + + + (witness + + + ((x + + + Int)) + + + false) + + + 0) + + + (not + + + (= + + + (witness + + + ((x + + + Int)) + + + false) + + + 0)) + + + , whereas notice that + + + (or + + + (= + + + z + + + 0) + + + (not + + + (= + + + z + + + 0))) + + + is +true for any + + \(z\) + + . +

    +
    +
    +
    +
    +
    + + + XOR + + + + ¶ + +
    +
    +

    + Logical exclusive disjunction, left associative. +

    + +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/op.html b/cvc5-1.0.2/api/python/base/op.html new file mode 100644 index 0000000..1372c82 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/op.html @@ -0,0 +1,647 @@ + + + + + + + + Op — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Op + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Op + + + + ¶ + +
    +
    +

    + A cvc5 operator. +

    +

    + An operator is a term that represents certain operators, +instantiated with its required parameters, e.g., +a term of kind + + + + BITVECTOR_EXTRACT + + + + . +

    +

    + Wrapper class for + + + + cvc5::Op + + + + . +

    +
    +
    + + + __getitem__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the index at position + + + i + + + . +

    +
    +
    + Parameters + + : + +
    +
    +

    + + i + + – The position of the index to return. +

    +
    +
    + Returns + + : + +
    +
    +

    + The index at position + + + i + + + . +

    +
    +
    +
    +
    +
    +
    + + + getKind + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The kind of this operator. +

    +
    +
    +
    +
    +
    +
    + + + getNumIndices + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The number of indices of this op. +

    +
    +
    +
    +
    +
    +
    + + + isIndexed + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this operator is indexed. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this operator is a null term. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/python.html b/cvc5-1.0.2/api/python/base/python.html new file mode 100644 index 0000000..659a537 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/python.html @@ -0,0 +1,481 @@ + + + + + + + + Base Python API — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Base Python API + + ¶ + +

    +

    + This is the base Python API. +It is an almost exact copy of the + + + C++ API + + + . +

    +

    + See the + + + pythonic API + + + for a higher-level programming experience. +

    + +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/quickstart.html b/cvc5-1.0.2/api/python/base/quickstart.html new file mode 100644 index 0000000..ae83816 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/quickstart.html @@ -0,0 +1,1623 @@ + + + + + + + + Quickstart Guide — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Quickstart Guide + + ¶ + +

    +

    + First, create a cvc5 solver instance: +

    +
    +
    +
    solver = cvc5.Solver()
    +
    +
    +
    +

    + We will ask the solver to produce models and unsat cores in the following, +and for this we have to enable the following options. +

    +
    +
    +
    solver.setOption("produce-models", "true");
    +solver.setOption("produce-unsat-cores", "true");
    +
    +
    +
    +

    + Next we set the logic. +The simplest way to set a logic for the solver is to choose + + + "ALL" + + + . +This enables all logics in the solver. +Alternatively, + + + "QF_ALL" + + + enables all logics without quantifiers. +To optimize the solver’s behavior for a more specific logic, +use the logic name, e.g. + + + "QF_BV" + + + or + + + "QF_AUFBV" + + + . +

    +
    +
    +
    solver.setLogic("ALL");
    +
    +
    +
    +

    + In the following, we will define constraints of reals and integers. +For this, we first query the solver for the corresponding sorts. +

    +
    +
    +
    realSort = solver.getRealSort();
    +intSort = solver.getIntegerSort();
    +
    +
    +
    +

    + Now, we create two constants + + + x + + + and + + + y + + + of sort + + + Real + + + , +and two constants + + + a + + + and + + + b + + + of sort + + + Integer + + + . +Notice that these are + + symbolic + + constants, but not actual values. +

    +
    +
    +
    x = solver.mkConst(realSort, "x");
    +y = solver.mkConst(realSort, "y");
    +a = solver.mkConst(intSort, "a");
    +b = solver.mkConst(intSort, "b");
    +
    +
    +
    +

    + We define the following constraints regarding + + + x + + + and + + + y + + + : +

    +
    + \[(0 < x) \wedge (0 < y) \wedge (x + y < 1) \wedge (x \leq y)\] +
    +

    + We construct the required terms and assert them as follows: +

    +
    +
    +
    # Formally, constraints are also terms. Their sort is Boolean.
    +# We will construct these constraints gradually,
    +# by defining each of their components.
    +# We start with the constant numerals 0 and 1:
    +zero = solver.mkReal(0);
    +one = solver.mkReal(1);
    +
    +# Next, we construct the term x + y
    +xPlusY = solver.mkTerm(Kind.ADD, x, y);
    +
    +# Now we can define the constraints.
    +# They use the operators +, <=, and <.
    +# In the API, these are denoted by Plus, Leq, and Lt.
    +constraint1 = solver.mkTerm(Kind.LT, zero, x);
    +constraint2 = solver.mkTerm(Kind.LT, zero, y);
    +constraint3 = solver.mkTerm(Kind.LT, xPlusY, one);
    +constraint4 = solver.mkTerm(Kind.LEQ, x, y);
    +
    +# Now we assert the constraints to the solver.
    +solver.assertFormula(constraint1);
    +solver.assertFormula(constraint2);
    +solver.assertFormula(constraint3);
    +solver.assertFormula(constraint4);
    +
    +
    +
    +

    + Now we check if the asserted formula is satisfiable, that is, we check if +there exist values of sort + + + Real + + + for + + + x + + + and + + + y + + + that satisfy all +the constraints. +

    +
    +
    +
    r1 = solver.checkSat();
    +
    +
    +
    +

    + The result we get from this satisfiability check is either + + + sat + + + , + + + unsat + + + or + + + unknown + + + . +It’s status can be queried via + + isSat + + , + + isUnsat + + and + + isSatUnknown + + functions. +Alternatively, it can also be printed. +

    +
    +
    +
    print("expected: sat")
    +print("result: ", r1)
    +
    +
    +
    +

    + This will print: +

    +
    +
    +
    expected: sat
    +result: sat
    +
    +
    +
    +

    + Now, we query the solver for the values for + + + x + + + and + + + y + + + that satisfy +the constraints. +

    +
    +
    +
    xVal = solver.getValue(x);
    +yVal = solver.getValue(y);
    +
    +
    +
    +

    + It is also possible to get values for terms that do not appear in the original +formula. +

    +
    +
    +
    xMinusY = solver.mkTerm(Kind.SUB, x, y);
    +xMinusYVal = solver.getValue(xMinusY);
    +
    +
    +
    +

    + We can retrieve the Python representation of these values as follows. +

    +
    +
    +
    xPy = xVal.getRealValue();
    +yPy = yVal.getRealValue();
    +xMinusYPy = xMinusYVal.getRealValue();
    +
    +print("value for x: ", xPy)
    +print("value for y: ", yPy)
    +print("value for x - y: ", xMinusYPy)
    +
    +
    +
    +

    + This will print the following: +

    +
    +
    +
    value for x: 1/6
    +value for y: 1/6
    +value for x - y: 0
    +
    +
    +
    +

    + Another way to independently compute the value of + + + x + + + - + + + y + + + would be to +use the Python minus operator instead of asking the solver. +However, for more complex terms, it is easier to let the solver do the +evaluation. +

    +
    +
    +
    xMinusYComputed = xPy - yPy;
    +if xMinusYComputed == xMinusYPy:
    +  print("computed correctly")
    +else:
    +  print("computed incorrectly")
    +
    +
    +
    +

    + This will print: +

    +
    +
    +
    computed correctly
    +
    +
    +
    +

    + Further, we can convert these values to strings: +

    +
    +
    +
    xStr = str(xPy);
    +yStr = str(yPy);
    +xMinusYStr = str(xMinusYPy);
    +
    +
    +
    +

    + Next, we will check satisfiability of the same formula, +only this time over integer variables + + + a + + + and + + + b + + + . +For this, we first reset the assertions added to the solver. +

    +
    +
    +
    solver.resetAssertions();
    +
    +
    +
    +

    + Next, we assert the same assertions as above, but with integers. +This time, we inline the construction of terms +to the assertion command. +

    +
    +
    +
    solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), a));
    +solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), b));
    +solver.assertFormula(
    +    solver.mkTerm(
    +        Kind.LT, solver.mkTerm(Kind.ADD, a, b), solver.mkInteger(1)));
    +solver.assertFormula(solver.mkTerm(Kind.LEQ, a, b));
    +
    +
    +
    +

    + Now, we check whether the revised assertion is satisfiable. +

    +
    +
    +
    r2 = solver.checkSat();
    +
    +
    +
    +
    +
    +
    print("expected: unsat")
    +print("result:", r2)
    +
    +
    +
    +

    + This time the asserted formula is unsatisfiable: +

    +
    +
    +
    expected: unsat
    +result: unsat
    +
    +
    +
    +

    + We can query the solver for an unsatisfiable core, that is, a subset +of the assertions that is already unsatisfiable. +

    +
    +
    +
    unsatCore = solver.getUnsatCore();
    +print("unsat core size:", len(unsatCore))
    +print("unsat core:", unsatCore)
    +
    +
    +
    +

    + This will print: +

    +
    +
    +
    unsat core size: 3
    +unsat core: [(< 0 a), (< 0 b), (< (+ a b) 1)]
    +
    +
    +
    +
    +

    + Example + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/python/quickstart.py + +

    +
    +
    +
      1 #!/usr/bin/env python
    +  2 ###############################################################################
    +  3 # Top contributors (to current version):
    +  4 #   Yoni Zohar, Aina Niemetz, Alex Ozdemir
    +  5 #
    +  6 # This file is part of the cvc5 project.
    +  7 #
    +  8 # Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  9 # in the top-level source directory and their institutional affiliations.
    + 10 # All rights reserved.  See the file COPYING in the top-level source
    + 11 # directory for licensing information.
    + 12 # #############################################################################
    + 13 #
    + 14 # A simple demonstration of the api capabilities of cvc5, adapted from quickstart.cpp
    + 15 ##
    + 16 
    + 17 import cvc5
    + 18 from cvc5 import Kind
    + 19 
    + 20 if __name__ == "__main__":
    + 21   # Create a solver
    + 22   #! [docs-python-quickstart-1 start]
    + 23   solver = cvc5.Solver()
    + 24   #! [docs-python-quickstart-1 end]
    + 25 
    + 26   # We will ask the solver to produce models and unsat cores,
    + 27   # hence these options should be turned on.
    + 28   #! [docs-python-quickstart-2 start]
    + 29   solver.setOption("produce-models", "true");
    + 30   solver.setOption("produce-unsat-cores", "true");
    + 31   #! [docs-python-quickstart-2 end]
    + 32 
    + 33   # The simplest way to set a logic for the solver is to choose "ALL".
    + 34   # This enables all logics in the solver.
    + 35   # Alternatively, "QF_ALL" enables all logics without quantifiers.
    + 36   # To optimize the solver's behavior for a more specific logic,
    + 37   # use the logic name, e.g. "QF_BV" or "QF_AUFBV".
    + 38 
    + 39   # Set the logic
    + 40   #! [docs-python-quickstart-3 start]
    + 41   solver.setLogic("ALL");
    + 42   #! [docs-python-quickstart-3 end]
    + 43 
    + 44   # In this example, we will define constraints over reals and integers.
    + 45   # Hence, we first obtain the corresponding sorts.
    + 46   #! [docs-python-quickstart-4 start]
    + 47   realSort = solver.getRealSort();
    + 48   intSort = solver.getIntegerSort();
    + 49   #! [docs-python-quickstart-4 end]
    + 50 
    + 51   # x and y will be real variables, while a and b will be integer variables.
    + 52   # Formally, their python type is Term,
    + 53   # and they are called "constants" in SMT jargon:
    + 54   #! [docs-python-quickstart-5 start]
    + 55   x = solver.mkConst(realSort, "x");
    + 56   y = solver.mkConst(realSort, "y");
    + 57   a = solver.mkConst(intSort, "a");
    + 58   b = solver.mkConst(intSort, "b");
    + 59   #! [docs-python-quickstart-5 end]
    + 60 
    + 61   # Our constraints regarding x and y will be:
    + 62   #
    + 63   #   (1)  0 < x
    + 64   #   (2)  0 < y
    + 65   #   (3)  x + y < 1
    + 66   #   (4)  x <= y
    + 67   #
    + 68 
    + 69   #! [docs-python-quickstart-6 start]
    + 70   # Formally, constraints are also terms. Their sort is Boolean.
    + 71   # We will construct these constraints gradually,
    + 72   # by defining each of their components.
    + 73   # We start with the constant numerals 0 and 1:
    + 74   zero = solver.mkReal(0);
    + 75   one = solver.mkReal(1);
    + 76 
    + 77   # Next, we construct the term x + y
    + 78   xPlusY = solver.mkTerm(Kind.ADD, x, y);
    + 79 
    + 80   # Now we can define the constraints.
    + 81   # They use the operators +, <=, and <.
    + 82   # In the API, these are denoted by Plus, Leq, and Lt.
    + 83   constraint1 = solver.mkTerm(Kind.LT, zero, x);
    + 84   constraint2 = solver.mkTerm(Kind.LT, zero, y);
    + 85   constraint3 = solver.mkTerm(Kind.LT, xPlusY, one);
    + 86   constraint4 = solver.mkTerm(Kind.LEQ, x, y);
    + 87 
    + 88   # Now we assert the constraints to the solver.
    + 89   solver.assertFormula(constraint1);
    + 90   solver.assertFormula(constraint2);
    + 91   solver.assertFormula(constraint3);
    + 92   solver.assertFormula(constraint4);
    + 93   #! [docs-python-quickstart-6 end]
    + 94 
    + 95   # Check if the formula is satisfiable, that is,
    + 96   # are there real values for x and y that satisfy all the constraints?
    + 97   #! [docs-python-quickstart-7 start]
    + 98   r1 = solver.checkSat();
    + 99   #! [docs-python-quickstart-7 end]
    +100 
    +101   # The result is either SAT, UNSAT, or UNKNOWN.
    +102   # In this case, it is SAT.
    +103   #! [docs-python-quickstart-8 start]
    +104   print("expected: sat")
    +105   print("result: ", r1)
    +106   #! [docs-python-quickstart-8 end]
    +107 
    +108   # We can get the values for x and y that satisfy the constraints.
    +109   #! [docs-python-quickstart-9 start]
    +110   xVal = solver.getValue(x);
    +111   yVal = solver.getValue(y);
    +112   #! [docs-python-quickstart-9 end]
    +113 
    +114   # It is also possible to get values for compound terms,
    +115   # even if those did not appear in the original formula.
    +116   #! [docs-python-quickstart-10 start]
    +117   xMinusY = solver.mkTerm(Kind.SUB, x, y);
    +118   xMinusYVal = solver.getValue(xMinusY);
    +119   #! [docs-python-quickstart-10 end]
    +120 
    +121   # We can now obtain the values as python values
    +122   #! [docs-python-quickstart-11 start]
    +123   xPy = xVal.getRealValue();
    +124   yPy = yVal.getRealValue();
    +125   xMinusYPy = xMinusYVal.getRealValue();
    +126 
    +127   print("value for x: ", xPy)
    +128   print("value for y: ", yPy)
    +129   print("value for x - y: ", xMinusYPy)
    +130   #! [docs-python-quickstart-11 end]
    +131 
    +132   # Another way to independently compute the value of x - y would be
    +133   # to use the python minus operator instead of asking the solver.
    +134   # However, for more complex terms,
    +135   # it is easier to let the solver do the evaluation.
    +136   #! [docs-python-quickstart-12 start]
    +137   xMinusYComputed = xPy - yPy;
    +138   if xMinusYComputed == xMinusYPy:
    +139     print("computed correctly")
    +140   else:
    +141     print("computed incorrectly")
    +142   #! [docs-python-quickstart-12 end]
    +143 
    +144   # Further, we can convert the values to strings
    +145   #! [docs-python-quickstart-13 start]
    +146   xStr = str(xPy);
    +147   yStr = str(yPy);
    +148   xMinusYStr = str(xMinusYPy);
    +149   #! [docs-python-quickstart-13 end]
    +150 
    +151   # Next, we will check satisfiability of the same formula,
    +152   # only this time over integer variables a and b.
    +153 
    +154   # We start by resetting assertions added to the solver.
    +155   #! [docs-python-quickstart-14 start]
    +156   solver.resetAssertions();
    +157   #! [docs-python-quickstart-14 end]
    +158 
    +159   # Next, we assert the same assertions above with integers.
    +160   # This time, we inline the construction of terms
    +161   # to the assertion command.
    +162   #! [docs-python-quickstart-15 start]
    +163   solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), a));
    +164   solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), b));
    +165   solver.assertFormula(
    +166       solver.mkTerm(
    +167           Kind.LT, solver.mkTerm(Kind.ADD, a, b), solver.mkInteger(1)));
    +168   solver.assertFormula(solver.mkTerm(Kind.LEQ, a, b));
    +169   #! [docs-python-quickstart-15 end]
    +170 
    +171   # We check whether the revised assertion is satisfiable.
    +172   #! [docs-python-quickstart-16 start]
    +173   r2 = solver.checkSat();
    +174   #! [docs-python-quickstart-16 end]
    +175 
    +176   # This time the formula is unsatisfiable
    +177   #! [docs-python-quickstart-17 start]
    +178   print("expected: unsat")
    +179   print("result:", r2)
    +180   #! [docs-python-quickstart-17 end]
    +181 
    +182   # We can query the solver for an unsatisfiable core, i.e., a subset
    +183   # of the assertions that is already unsatisfiable.
    +184   #! [docs-python-quickstart-18 start]
    +185   unsatCore = solver.getUnsatCore();
    +186   print("unsat core size:", len(unsatCore))
    +187   print("unsat core:", unsatCore)
    +188   #! [docs-python-quickstart-18 end]
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/result.html b/cvc5-1.0.2/api/python/base/result.html new file mode 100644 index 0000000..229ed41 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/result.html @@ -0,0 +1,670 @@ + + + + + + + + Result — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Result + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Result + + + + ¶ + +
    +
    +

    + Encapsulation of a three-valued solver result, with explanations. +

    +

    + Wrapper class for + + + + cvc5::Result + + + + . +

    +
    +
    + + + getUnknownExplanation + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + An explanation for an unknown query result. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if Result is empty, i.e., a nullary Result, and not +an actual result returned from a + + + + Solver.checkSat() + + + + (and friends) query. +

    +
    +
    +
    +
    +
    +
    + + + isSat + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if query was a satisfiable + + + + Solver.checkSat() + + + + or + + + + Solver.checkSatAssuming() + + + + query. +

    +
    +
    +
    +
    +
    +
    + + + isUnknown + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if query was a + + + + Solver.checkSat() + + + + or + + + + Solver.checkSatAssuming() + + + + query and cvc5 was +not able to determine (un)satisfiability. +

    +
    +
    +
    +
    +
    +
    + + + isUnsat + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if query was an usatisfiable + + + + Solver.checkSat() + + + + or + + + + Solver.checkSatAssuming() + + + + query. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/roundingmode.html b/cvc5-1.0.2/api/python/base/roundingmode.html new file mode 100644 index 0000000..513d1bb --- /dev/null +++ b/cvc5-1.0.2/api/python/base/roundingmode.html @@ -0,0 +1,545 @@ + + + + + + + + RoundingMode — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + RoundingMode + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + RoundingMode + + + + ( + + + + + value + + + + + ) + + + ¶ + +
    +
    +

    + The RoundingMode enum +

    +
    +
    + + + ROUND_NEAREST_TIES_TO_AWAY + + + + ¶ + +
    +
    +

    + Round to the nearest number away from zero. +

    +

    + If the two nearest floating-point numbers bracketing an unrepresentable +infinitely precise result are equally near, the one with larger magnitude +will be selected. +

    +
    +
    +
    +
    + + + ROUND_NEAREST_TIES_TO_EVEN + + + + ¶ + +
    +
    +

    + Round to the nearest even number. +

    +

    + If the two nearest floating-point numbers bracketing an unrepresentable +infinitely precise result are equally near, the one with an even least +significant digit will be delivered. +

    +
    +
    +
    +
    + + + ROUND_TOWARD_NEGATIVE + + + + ¶ + +
    +
    +

    + Round towards negative infinity ( + + + -oo + + + ). +

    +

    + The result shall be the format’s floating-point number (possibly + + + -oo + + + ) +closest to and no less than the infinitely precise result. +

    +
    +
    +
    +
    + + + ROUND_TOWARD_POSITIVE + + + + ¶ + +
    +
    +

    + Round towards positive infinity (SMT-LIB: + + + +oo + + + ). +

    +

    + The result shall be the format’s floating-point number (possibly + + + +oo + + + ) +closest to and no less than the infinitely precise result. +

    +
    +
    +
    +
    + + + ROUND_TOWARD_ZERO + + + + ¶ + +
    +
    +

    + Round towards zero. +

    +

    + The result shall be the format’s floating-point number closest to and no +greater in magnitude than the infinitely precise result. +

    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/solver.html b/cvc5-1.0.2/api/python/base/solver.html new file mode 100644 index 0000000..84ae7c7 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/solver.html @@ -0,0 +1,9655 @@ + + + + + + + + Solver — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Solver + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Solver + + + + ¶ + +
    +
    +

    + A cvc5 solver. +

    +

    + Wrapper class for + + + + cvc5::Solver + + + + . +

    +
    +
    + + + addSygusAssume + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Add a formula to the set of Sygus assumptions. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( assume <term> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + term + + – The formuula to add as an assumption. +

    +
    +
    +
    +
    +
    +
    + + + addSygusConstraint + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Add a formula to the set of SyGuS constraints. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( constraint <term> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + term + + – The formula to add as a constraint. +

    +
    +
    +
    +
    +
    +
    + + + addSygusInvConstraint + + + + ( + + + + + self + + + + , + + + + Term + + + inv_f + + + + , + + + + Term + + + pre_f + + + + , + + + + Term + + + trans_f + + + + , + + + + Term + + + post_f + + + + + ) + + + ¶ + +
    +
    +

    + Add a set of SyGuS constraints to the current state that correspond +to an invariant synthesis problem. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( inv-constraint <inv> <pre> <trans> <post> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + inv + + – The function-to-synthesize. +

      +
    • +
    • +

      + + pre + + – The pre-condition. +

      +
    • +
    • +

      + + trans + + – The transition relation. +

      +
    • +
    • +

      + + post + + – The post-condition. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + assertFormula + + + + ( + + + + + self + + + + , + + + + Term + + + term + + + + + ) + + + ¶ + +
    +
    +

    + Assert a formula +

    +

    + SMT-LIB: +

    +
    +
    +
    ( assert <term> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + term + + – The formula to assert. +

    +
    +
    +
    +
    +
    +
    + + + blockModel + + + + ( + + + + + self + + + + , + + + + mode + + + + + ) + + + ¶ + +
    +
    +

    + Block the current model. Can be called only if immediately preceded +by a SAT or INVALID query. +

    +

    + SMT-LIB: +

    +
    +
    +
    (block-model)
    +
    +
    +
    +

    + Requires enabling option + + + produce-models + + + to a mode other than + + + none + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + mode + + – The mode to use for blocking +

    +
    +
    +
    +
    +
    +
    + + + blockModelValues + + + + ( + + + + + self + + + + , + + + + terms + + + + + ) + + + ¶ + +
    +
    +

    + Block the current model values of (at least) the values in terms. +Can be called only if immediately preceded by a SAT or NOT_ENTAILED +query. +

    +

    + SMT-LIB: +

    +
    +
    +
    (block-model-values ( <terms>+ ))
    +
    +
    +
    +

    + Requires enabling option + + + produce-models + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    +
    +
    + + + checkSat + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Check satisfiability. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( check-sat )
    +
    +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The result of the satisfiability check. +

    +
    +
    +
    +
    +
    +
    + + + checkSatAssuming + + + + ( + + + + + self + + + + , + + + + * + + + + + assumptions + + + + + ) + + + ¶ + +
    +
    +

    + Check satisfiability assuming the given formula. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( check-sat-assuming ( <prop_literal> ) )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + assumptions + + – The formulas to assume. +

    +
    +
    + Returns + + : + +
    +
    +

    + The result of the satisfiability check. +

    +
    +
    +
    +
    +
    +
    + + + checkSynth + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Try to find a solution for the synthesis conjecture corresponding +to the current list of functions-to-synthesize, universal variables +and constraints. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( check-synth )
    +
    +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The result of the check, which is “solution” if the check +found a solution in which case solutions are available via +getSynthSolutions, “no solution” if it was determined +there is no solution, or “unknown” otherwise. +

    +
    +
    +
    +
    +
    +
    + + + checkSynthNext + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Try to find a next solution for the synthesis conjecture +corresponding to the current list of functions-to-synthesize, +universal variables and constraints. Must be called immediately +after a successful call to check-synth or check-synth-next. +Requires incremental mode. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( check-synth )
    +
    +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The result of the check, which is “solution” if the check +found a solution in which case solutions are available via +getSynthSolutions, “no solution” if it was determined +there is no solution, or “unknown” otherwise. +

    +
    +
    +
    +
    +
    +
    + + + declareDatatype + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + *ctors + + + + + ) + + + ¶ + +
    +
    +

    + Create datatype sort. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( declare-datatype <symbol> <datatype_decl> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the datatype sort. +

      +
    • +
    • +

      + + ctors + + – The constructor declarations of the datatype sort. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The datatype sort. +

    +
    +
    +
    +
    +
    +
    + + + declareFun + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + list + + + sorts + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Declare n-ary function symbol. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( declare-fun <symbol> ( <sort>* ) <sort> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the function. +

      +
    • +
    • +

      + + sorts + + – The sorts of the parameters to this function. +

      +
    • +
    • +

      + + sort + + – The sort of the return value of this function. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The function. +

    +
    +
    +
    +
    +
    +
    + + + declarePool + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + Sort + + + sort + + + + , + + + + initValue + + + + + ) + + + ¶ + +
    +
    +

    + Declare a symbolic pool of terms with the given initial value. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( declare-pool <symbol> <sort> ( <term>* ) )
    +
    +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the pool. +

      +
    • +
    • +

      + + sort + + – The sort of the elements of the pool. +

      +
    • +
    • +

      + + initValue + + – The initial value of the pool. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + declareSepHeap + + + + ( + + + + + self + + + + , + + + + Sort + + + locType + + + + , + + + + Sort + + + dataType + + + + + ) + + + ¶ + +
    +
    +

    + When using separation logic, this sets the location sort and the +datatype sort to the given ones. This method should be invoked +exactly once, before any separation logic constraints are provided. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + locSort + + – The location sort of the heap. +

      +
    • +
    • +

      + + dataSort + + – The data sort of the heap. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + declareSort + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + int + + + arity + + + + + ) + + + ¶ + +
    +
    +

    + Declare uninterpreted sort. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( declare-sort <symbol> <numeral> )
    +
    +
    +
    +
    +

    + Note +

    +

    + This corresponds to + + + + Solver.mkUninterpretedSort() + + + + if +arity = 0, and to + + + + Solver.mkUninterpretedSortConstructorSort() + + + + if +arity > 0. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the sort. +

      +
    • +
    • +

      + + arity + + – The arity of the sort. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The sort. +

    +
    +
    +
    +
    +
    +
    + + + declareSygusVar + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Append symbol to the current list of universal variables. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( declare-var <symbol> <sort> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort + + – The sort of the universal variable. +

      +
    • +
    • +

      + + symbol + + – The name of the universal variable. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The universal variable. +

    +
    +
    +
    +
    +
    +
    + + + defineFun + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + list + + + bound_vars + + + + , + + + + Sort + + + sort + + + + , + + + + Term + + + term + + + + , + + + + glbl=False + + + + + ) + + + ¶ + +
    +
    +

    + Define n-ary function. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( define-fun <function_def> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the function. +

      +
    • +
    • +

      + + bound_vars + + – The parameters to this function. +

      +
    • +
    • +

      + + sort + + – The sort of the return value of this function. +

      +
    • +
    • +

      + + term + + – The function body. +

      +
    • +
    • +

      + + glbl + + – Determines whether this definition is global (i.e. +persists when popping the context). +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The function. +

    +
    +
    +
    +
    +
    +
    + + + defineFunRec + + + + ( + + + + + self + + + + , + + + + sym_or_fun + + + + , + + + + bound_vars + + + + , + + + + sort_or_term + + + + , + + + + t + + + + + = + + + + + None + + + + , + + + + glbl + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Define recursive functions. +

    +

    + Supports the following arguments: +

    +
      +
    • +

      + + + Term + + + defineFunRec(str + + + symbol, + + + List[Term] + + + bound_vars, + + + Sort + + + sort, + + + Term + + + term, + + + bool + + + glbl) + + +

      +
    • +
    • +

      + + + Term + + + defineFunRec(Term + + + fun, + + + List[Term] + + + bound_vars, + + + Term + + + term, + + + bool + + + glbl) + + +

      +
    • +
    +

    + SMT-LIB: +

    +
    +
    +
    ( define-funs-rec ( <function_decl>^n ) ( <term>^n ) )
    +
    +
    +
    +

    + Create elements of parameter + + + funs + + + with + + + + mkConst() + + + + . +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + funs + + – The sorted functions. +

      +
    • +
    • +

      + + bound_vars + + – The list of parameters to the functions. +

      +
    • +
    • +

      + + terms + + – The list of function bodies of the functions. +

      +
    • +
    • +

      + + global + + – Determines whether this definition is global (i.e. +persists when popping the context). +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The function. +

    +
    +
    +
    +
    +
    +
    + + + defineFunsRec + + + + ( + + + + + self + + + + , + + + + funs + + + + , + + + + bound_vars + + + + , + + + + terms + + + + , + + + + glb + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Define recursive functions. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( define-funs-rec ( <function_decl>^n ) ( <term>^n ) )
    +
    +
    +
    +

    + Create elements of parameter + + + funs + + + with + + + + mkConst() + + + + . +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + funs + + – The sorted functions. +

      +
    • +
    • +

      + + bound_vars + + – The list of parameters to the functions. +

      +
    • +
    • +

      + + terms + + – The list of function bodies of the functions. +

      +
    • +
    • +

      + + glb + + – Determines whether this definition is global (i.e. +persists when popping the context). +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + getAbduct + + + + ( + + + + + self + + + + , + + + + Term + + + conj + + + + , + + + + Grammar + + + grammar=None + + + + + ) + + + ¶ + +
    +
    +

    + Get an abduct. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-abduct <conj> )
    +( get-abduct <conj> <grammar> )
    +
    +
    +
    +

    + Requires to enable option + + + produce-abducts + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + conj + + – The conjecture term. +

      +
    • +
    • +

      + + grammar + + – A grammar for the abduct. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The abduct. +See + + + + cvc5::Solver::getAbduct() + + + + for details. +

    +
    +
    +
    +
    +
    +
    + + + getAbductNext + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the next abduct. +

    +

    + Can only be called immediately after a succesful call to + + + + Solver.getAbduct() + + + + or + + + + Solver.getAbductNext() + + + + . +Is guaranteed to produce a syntactically different abduct wrt the +last returned abduct if successful. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-abduct-next )
    +
    +
    +
    +

    + Requires to enable incremental mode, and +option + + + produce-abducts + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + output + + – The term where the result will be stored. +

    +
    +
    + Returns + + : + +
    +
    +

    + True iff an abduct was found. +

    +
    +
    +
    +
    +
    +
    + + + getAssertions + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the list of asserted formulas. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-assertions )
    +
    +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The list of asserted formulas. +

    +
    +
    +
    +
    +
    +
    + + + getBooleanSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + Sort Boolean. +

    +
    +
    +
    +
    +
    +
    + + + getDifficulty + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get a difficulty estimate for an asserted formula. This method is +intended to be called immediately after any response to a + + + + Solver.checkSat() + + + + call. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + A map from (a subset of) the input assertions to a real +value that is an estimate of how difficult each assertion +was to solver. Unmentioned assertions can be assumed to +have zero difficulty. +

    +
    +
    +
    +
    +
    +
    + + + getInfo + + + + ( + + + + + self + + + + , + + + + unicode + + + flag + + + + + ) + + + ¶ + +
    +
    +

    + Get info from the solver. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-info <info_flag> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + flag + + – The info flag. +

    +
    +
    + Returns + + : + +
    +
    +

    + The info. +

    +
    +
    +
    +
    +
    +
    + + + getInstantiations + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Return a string that contains information about all instantiations +made by the quantifiers module. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    +
    +
    + + + getIntegerSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + Sort Integer. +

    +
    +
    +
    +
    +
    +
    + + + getInterpolant + + + + ( + + + + + self + + + + , + + + + Term + + + conj + + + + , + + + + Grammar + + + grammar=None + + + + + ) + + + ¶ + +
    +
    +

    + Get an interpolant. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-interpolant <conj> )
    +( get-interpolant <conj> <grammar> )
    +
    +
    +
    +

    + Requires option + + + produce-interpolants + + + to be set to a mode different from + + none + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + conj + + – The conjecture term. +

      +
    • +
    • +

      + + grammar + + – A grammar for the inteprolant. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The interpolant. +See + + + + cvc5::Solver::getInterpolant() + + + + for details. +

    +
    +
    +
    +
    +
    +
    + + + getInterpolantNext + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the next interpolant. +

    +

    + Can only be called immediately after a successful call to + + + + Solver.getInterpolant() + + + + or + + + + Solver.getInterpolantNext() + + + + . +Is guaranteed to produce a syntactically different interpolant wrt +the last returned interpolant if successful. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-interpolant-next )
    +
    +
    +
    +

    + Requires to enable incremental mode, and option + + + produce-interpolants + + + to be +set to a mode different from + + + none + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + output + + – The term where the result will be stored. +

    +
    +
    + Returns + + : + +
    +
    +

    + True iff an interpolant was found. +

    +
    +
    +
    +
    +
    +
    + + + getLearnedLiterals + + + + ( + + + + + self + + + + , + + + + type + + + + + = + + + + + LearnedLitType.LEARNED_LIT_INPUT + + + + + ) + + + ¶ + +
    +
    +

    + Get a list of literals that are entailed by the current set of assertions +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-learned-literals )
    +
    +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + type + + – The type of learned literals to return +

    +
    +
    + Returns + + : + +
    +
    +

    + The list of literals. +

    +
    +
    +
    +
    +
    +
    + + + getModel + + + + ( + + + + + self + + + + , + + + + sorts + + + + , + + + + consts + + + + + ) + + + ¶ + +
    +
    +

    + Get the model +

    +

    + SMT-LIB: +

    +
    +
    +
    (get-model)
    +
    +
    +
    +

    + Requires to enable option + + + produce-models + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sorts + + – The list of uninterpreted sorts that should be +printed in the model. +

      +
    • +
    • +

      + + vars + + – The list of free constants that should be printed in +the model. A subset of these may be printed based on + + + + Solver.isModelCoreSymbol() + + + + . +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + A string representing the model. +

    +
    +
    +
    +
    +
    +
    + + + getModelDomainElements + + + + ( + + + + + self + + + + , + + + + Sort + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Get the domain elements of uninterpreted sort s in the current +model. The current model interprets s as the finite sort whose +domain elements are given in the return value of this method. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + s + + – The uninterpreted sort in question. +

    +
    +
    + Returns + + : + +
    +
    +

    + The domain elements of s in the current model. +

    +
    +
    +
    +
    +
    +
    + + + getNullSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + A null sort object. +

    +
    +
    +
    +
    +
    +
    + + + getOption + + + + ( + + + + + self + + + + , + + + + unicode + + + option + + + + + ) + + + ¶ + +
    +
    +

    + Get the value of a given option. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-option <keyword> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + option + + – The option for which the value is queried. +

    +
    +
    + Returns + + : + +
    +
    +

    + A string representation of the option value. +

    +
    +
    +
    +
    +
    +
    + + + getOptionInfo + + + + ( + + + + + self + + + + , + + + + unicode + + + option + + + + + ) + + + ¶ + +
    +
    +

    + Get some information about the given option. +Returns the information provided by the C++ + + + + OptionInfo + + + + as a dictionary. +

    +
    +
    + Returns + + : + +
    +
    +

    + Information about the given option. +

    +
    +
    +
    +
    +
    +
    + + + getOptionNames + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    +

    + Get all option names that can be used with + + + + Solver.setOption() + + + + , + + + + Solver.getOption() + + + + and + + + + Solver.getOptionInfo() + + + + . +

    +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + All option names. +

    +
    +
    +
    +
    +
    +
    + + + getProof + + + + ( + + + + + self + + + + , + + + + c + + + + + = + + + + + ProofComponent.PROOF_COMPONENT_FULL + + + + + ) + + + ¶ + +
    +
    +

    + Get a proof associated with the most recent call to checkSat. +

    +

    + SMT-LIB: +

    +
    +
    +
    (get-proof :c)
    +
    +
    +
    +

    + Requires to enable option + + + produce-proofs + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + c + + – The component of the proof to return +

    +
    +
    + Returns + + : + +
    +
    +

    + A string representing the proof. This takes into account +

    +
    +
    +

    + proof-format-mode when c is PROOF_COMPONENT_FULL. +

    +
    +
    +
    +
    + + + getQuantifierElimination + + + + ( + + + + + self + + + + , + + + + Term + + + term + + + + + ) + + + ¶ + +
    +
    +

    + Do quantifier elimination. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-qe <q> )
    +
    +
    +
    +

    + Requires a logic that supports quantifier elimination. +Currently, the only logics supported by quantifier elimination +are LRA and LIA. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + q + + – A quantified formula of the form + + \(Q\bar{x_1}\dots Q\bar{x}_n. P( x_1 \dots x_i, y_1 \dots y_j)\) + + where + + \(Q\bar{x}\) + + is a set of quantified variables of the +form + + \(Q x_1...x_k\) + + and + + \(P( x_1...x_i, y_1...y_j )\) + + is a quantifier-free +formula +

    +
    +
    + Returns + + : + +
    +
    +

    +

    +

    + A formula + + \(\phi\) + + such that, given the current set +of formulas + + \(A\) + + asserted to this solver: +

    +
      +
    • +

      + + \((A \wedge q)\) + + + \((A \wedge \phi)\) + + are +equivalent +

      +
    • +
    • +

      + + \(\phi\) + + is quantifier-free formula containing only +free variables in + + \(y_1...y_n\) + + . +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + getQuantifierEliminationDisjunct + + + + ( + + + + + self + + + + , + + + + Term + + + term + + + + + ) + + + ¶ + +
    +
    +

    + Do partial quantifier elimination, which can be used for +incrementally computing the result of a quantifier elimination. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-qe-disjunct <q> )
    +
    +
    +
    +

    + Requires a logic that supports quantifier elimination. +Currently, the only logics supported by quantifier elimination +are LRA and LIA. +

    +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + q + + – A quantified formula of the form + + \(Q\bar{x_1} ... Q\bar{x_n}. P( x_1...x_i, y_1...y_j)\) + + where + + \(Q\bar{x}\) + + is a set of quantified variables of +the form + + \(Q x_1...x_k\) + + and + + \(P( x_1...x_i, y_1...y_j )\) + + is a quantifier-free formula. +

    +
    +
    + Returns + + : + +
    +
    +

    +

    +

    + A formula + + \(\phi\) + + such that, given the current set +of formulas + + \(A\) + + asserted to this solver: +

    +
      +
    • +

      + + \((A \wedge q \implies A \wedge \phi)\) + + if + + \(Q\) + + is + + \(\forall\) + + , and + + \((A \wedge \phi \implies A \wedge q)\) + + if + + \(Q\) + + is + + \(\exists\) + +

      +
    • +
    • +

      + + \(\phi\) + + is quantifier-free formula containing only +free variables in + + \(y_1...y_n\) + +

      +
    • +
    • +

      + If + + \(Q\) + + is + + \(\exists\) + + , let + + \((A \wedge Q_n)\) + + be the formula + + \((A \wedge \neg (\phi \wedge Q_1) \wedge ... \wedge \neg (\phi \wedge Q_n))\) + + where for each + + \(i = 1...n\) + + , formula + + \((\phi \wedge Q_i)\) + + is the result of calling + + + + getQuantifierEliminationDisjunct() + + + + for + + \(q\) + + with the set of assertions + + \((A \wedge Q_{i-1})\) + + . +Similarly, if + + \(Q\) + + is + + \(\forall\) + + , then let + + \((A \wedge Q_n)\) + + be + + \((A \wedge (\phi \wedge Q_1) \wedge ... \wedge (\phi \wedge Q_n))\) + + where + + \((\phi \wedge Q_i)\) + + is the same as above. +In either case, we have that + + \((\phi \wedge Q_j)\) + + will eventually be true or false, for some finite + + \(j\) + + . +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + getRealSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + Sort Real. +

    +
    +
    +
    +
    +
    +
    + + + getRegExpSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The sort of regular expressions. +

    +
    +
    +
    +
    +
    +
    + + + getRoundingModeSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + Sort RoundingMode. +

    +
    +
    +
    +
    +
    +
    + + + getStatistics + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Returns a snapshot of the current state of the statistic values of +this solver. The returned object is completely decoupled from the +solver and will not change when the solver is used again. +

    +
    +
    +
    +
    + + + getStringSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + Sort String. +

    +
    +
    +
    +
    +
    +
    + + + getSynthSolution + + + + ( + + + + + self + + + + , + + + + Term + + + term + + + + + ) + + + ¶ + +
    +
    +

    + Get the synthesis solution of the given term. This method should be +called immediately after the solver answers unsat for sygus input. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + term + + – The term for which the synthesis solution is queried. +

    +
    +
    + Returns + + : + +
    +
    +

    + The synthesis solution of the given term. +

    +
    +
    +
    +
    +
    +
    + + + getSynthSolutions + + + + ( + + + + + self + + + + , + + + + list + + + terms + + + + + ) + + + ¶ + +
    +
    +

    + Get the synthesis solutions of the given terms. This method should +be called immediately after the solver answers unsat for sygus +input. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + terms + + – The terms for which the synthesis solutions is +queried. +

    +
    +
    + Returns + + : + +
    +
    +

    + The synthesis solutions of the given terms. +

    +
    +
    +
    +
    +
    +
    + + + getUnsatAssumptions + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the set of unsat (“failed”) assumptions. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-unsat-assumptions )
    +
    +
    +
    +

    + Requires to enable option + + + produce-unsat-assumptions + + + . +

    +
    +
    + Returns + + : + +
    +
    +

    + The set of unsat assumptions. +

    +
    +
    +
    +
    +
    +
    + + + getUnsatCore + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the unsatisfiable core. +

    +

    + SMT-LIB: +

    +
    +
    +
    (get-unsat-core)
    +
    +
    +
    +

    + Requires to enable option + + + produce-unsat-cores + + + . +

    +
    +

    + Note +

    +

    + In contrast to SMT-LIB, the API does not distinguish between +named and unnamed assertions when producing an unsatisfiable +core. Additionally, the API allows this option to be called after +a check with assumptions. A subset of those assumptions may be +included in the unsatisfiable core returned by this method. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + A set of terms representing the unsatisfiable core. +

    +
    +
    +
    +
    +
    +
    + + + getValue + + + + ( + + + + + self + + + + , + + + + term_or_list + + + + + ) + + + ¶ + +
    +
    +

    + Get the value of the given term or list of terms in the current +model. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( get-value ( <term>* ) )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + term_or_list + + – The term or list of terms for which the value +is queried. +

    +
    +
    + Returns + + : + +
    +
    +

    + The value or list of values of the given term or list of +terms. +

    +
    +
    +
    +
    +
    +
    + + + getValueSepHeap + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + When using separation logic, obtain the term for the heap. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The term for the heap. +

    +
    +
    +
    +
    +
    +
    + + + getValueSepNil + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + When using separation logic, obtain the term for nil. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The term for nil. +

    +
    +
    +
    +
    +
    +
    + + + isModelCoreSymbol + + + + ( + + + + + self + + + + , + + + + Term + + + v + + + + + ) + + + ¶ + +
    +
    +

    + This returns False if the model value of free constant v was not +essential for showing the satisfiability of the last call to +checkSat using the current model. This method will only return +false (for any v) if the model-cores option has been set. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + v + + – The term in question. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if v is a model core symbol. +

    +
    +
    +
    +
    +
    +
    + + + mkArraySort + + + + ( + + + + + self + + + + , + + + + Sort + + + indexSort + + + + , + + + + Sort + + + elemSort + + + + + ) + + + ¶ + +
    +
    +

    + Create an array sort. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + indexSort + + – The array index sort. +

      +
    • +
    • +

      + + elemSort + + – The array element sort. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The array sort. +

    +
    +
    +
    +
    +
    +
    + + + mkBagSort + + + + ( + + + + + self + + + + , + + + + Sort + + + elemSort + + + + + ) + + + ¶ + +
    +
    +

    + Create a bag sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + elemSort + + – The sort of the bag elements. +

    +
    +
    + Returns + + : + +
    +
    +

    + The bag sort. +

    +
    +
    +
    +
    +
    +
    + + + mkBitVector + + + + ( + + + + + self + + + + , + + + + int + + + size + + + + , + + + + *args + + + + + ) + + + ¶ + +
    +
    +

    + Create bit-vector value. +

    +

    + Supports the following arguments: +

    +
      +
    • +

      + + + Term + + + mkBitVector(int + + + size, + + + int + + + val=0) + + +

      +
    • +
    • +

      + + + Term + + + mkBitVector(int + + + size, + + + string + + + val, + + + int + + + base) + + +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + A Term representing a bit-vector value. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + size + + – The bit-width. +

      +
    • +
    • +

      + + val + + – An integer representating the value, in the first form. +In the second form, a string representing the value. +

      +
    • +
    • +

      + + base + + – The base of the string representation (second form +only). +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + mkBitVectorSort + + + + ( + + + + + self + + + + , + + + + uint32_t + + + size + + + + + ) + + + ¶ + +
    +
    +

    + Create a bit-vector sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + size + + – The bit-width of the bit-vector sort +

    +
    +
    + Returns + + : + +
    +
    +

    + The bit-vector sort +

    +
    +
    +
    +
    +
    +
    + + + mkBoolean + + + + ( + + + + + self + + + + , + + + + bool + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Create a Boolean constant. +

    +
    +
    + Returns + + : + +
    +
    +

    + The Boolean constant. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + val + + – The value of the constant. +

    +
    +
    +
    +
    +
    +
    + + + mkCardinalityConstraint + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + , + + + + int + + + index + + + + + ) + + + ¶ + +
    +
    +

    + Create cardinality constraint. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort + + – Sort of the constraint. +

      +
    • +
    • +

      + + index + + – The upper bound for the cardinality of the sort. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + mkConst + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + , + + + + symbol=None + + + + + ) + + + ¶ + +
    +
    +

    + Create (first-order) constant (0-arity function symbol). +

    +

    + SMT-LIB: +

    +
    +
    +
    ( declare-const <symbol> <sort> )
    +( declare-fun <symbol> ( ) <sort> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort + + – The sort of the constant. +

      +
    • +
    • +

      + + symbol + + – The name of the constant. If None, a default symbol +is used. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The first-order constant. +

    +
    +
    +
    +
    +
    +
    + + + mkConstArray + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + , + + + + Term + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Create a constant array with the provided constant value stored at +every index +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort + + – The sort of the constant array (must be an array sort). +

      +
    • +
    • +

      + + val + + – The constant value to store (must match the sort’s +element sort). +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The constant array term. +

    +
    +
    +
    +
    +
    +
    + + + mkDatatypeConstructorDecl + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + + ) + + + ¶ + +
    +
    +

    + Create datatype constructor declaration. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + name + + – The name of the constructor. +

    +
    +
    + Returns + + : + +
    +
    +

    + The datatype constructor declaration. +

    +
    +
    +
    +
    +
    +
    + + + mkDatatypeDecl + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + , + + + + sorts_or_bool=None + + + + , + + + + isCoDatatype=None + + + + + ) + + + ¶ + +
    +
    +

    + Create a datatype declaration. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + name + + – The name of the datatype. +

      +
    • +
    • +

      + + isCoDatatype + + – True if a codatatype is to be constructed. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The datatype declaration. +

    +
    +
    +
    +
    +
    +
    + + + mkDatatypeSort + + + + ( + + + + + self + + + + , + + + + DatatypeDecl + + + dtypedecl + + + + + ) + + + ¶ + +
    +
    +

    + Create a datatype sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + dtypedecl + + – The datatype declaration from which the sort is +created. +

    +
    +
    + Returns + + : + +
    +
    +

    + The datatype sort. +

    +
    +
    +
    +
    +
    +
    + + + mkDatatypeSorts + + + + ( + + + + + self + + + + , + + + + list + + + dtypedecls + + + + + ) + + + ¶ + +
    +
    +

    + Create a vector of datatype sorts using unresolved sorts. The names +of the datatype declarations in dtypedecls must be distinct. +

    +

    + When constructing datatypes, unresolved sorts are replaced by the +datatype sort constructed for the datatype declaration it is +associated with. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + dtypedecls + + – The datatype declarations from which the sort is +created. +

    +
    +
    + Returns + + : + +
    +
    +

    + The datatype sorts. +

    +
    +
    +
    +
    +
    +
    + + + mkEmptyBag + + + + ( + + + + + self + + + + , + + + + Sort + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a constant representing an empty bag of the given sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sort + + – The sort of the bag elements. +

    +
    +
    + Returns + + : + +
    +
    +

    + The empty bag constant. +

    +
    +
    +
    +
    +
    +
    + + + mkEmptySequence + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Create an empty sequence of the given element sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sort + + – The element sort of the sequence. +

    +
    +
    + Returns + + : + +
    +
    +

    + The empty sequence with given element sort. +

    +
    +
    +
    +
    +
    +
    + + + mkEmptySet + + + + ( + + + + + self + + + + , + + + + Sort + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a constant representing an empty set of the given sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sort + + – The sort of the set elements. +

    +
    +
    + Returns + + : + +
    +
    +

    + The empty set constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFalse + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a Boolean false constant. +

    +
    +
    + Returns + + : + +
    +
    +

    + The false constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPoint + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + , + + + + Term + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Create a floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Size of the exponent. +

      +
    • +
    • +

      + + sig + + – Size of the significand. +

      +
    • +
    • +

      + + val + + – Value of the floating-point constant as a bit-vector +term. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointNaN + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a not-a-number (NaN) floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Number of bits in the exponent. +

      +
    • +
    • +

      + + sig + + – Number of bits in the significand. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointNegInf + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a negative infinity floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Number of bits in the exponent. +

      +
    • +
    • +

      + + sig + + – Number of bits in the significand. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointNegZero + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a negative zero (+0.0) floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Number of bits in the exponent. +

      +
    • +
    • +

      + + sig + + – Number of bits in the significand. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointPosInf + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a positive infinity floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Number of bits in the exponent. +

      +
    • +
    • +

      + + sig + + – Number of bits in the significand. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointPosZero + + + + ( + + + + + self + + + + , + + + + int + + + exp + + + + , + + + + int + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a positive zero (+0.0) floating-point constant. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – Number of bits in the exponent. +

      +
    • +
    • +

      + + sig + + – Number of bits in the significand. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point constant. +

    +
    +
    +
    +
    +
    +
    + + + mkFloatingPointSort + + + + ( + + + + + self + + + + , + + + + uint32_t + + + exp + + + + , + + + + uint32_t + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a floating-point sort. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + exp + + – The bit-width of the exponent of the floating-point +sort. +

      +
    • +
    • +

      + + sig + + – The bit-width of the significand of the floating-point +sort. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + mkFunctionSort + + + + ( + + + + + self + + + + , + + + + sorts + + + + , + + + + Sort + + + codomain + + + + + ) + + + ¶ + +
    +
    +

    + Create function sort. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sorts + + – The sort of the function arguments. +

      +
    • +
    • +

      + + codomain + + – The sort of the function return value. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The function sort. +

    +
    +
    +
    +
    +
    +
    + + + mkGrammar + + + + ( + + + + + self + + + + , + + + + boundVars + + + + , + + + + ntSymbols + + + + + ) + + + ¶ + +
    +
    +

    + Create a SyGuS grammar. The first non-terminal is treated as the +starting non-terminal, so the order of non-terminals matters. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + boundVars + + – The parameters to corresponding +synth-fun/synth-inv. +

      +
    • +
    • +

      + + ntSymbols + + – The pre-declaration of the non-terminal symbols. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The grammar. +

    +
    +
    +
    +
    +
    +
    + + + mkInteger + + + + ( + + + + + self + + + + , + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Create an integer constant. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + val + + – Representation of the constant: either a string or +integer. +

    +
    +
    + Returns + + : + +
    +
    +

    + A constant of sort Integer. +

    +
    +
    +
    +
    +
    +
    + + + mkOp + + + + ( + + + + + self + + + + , + + + + k + + + + , + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create operator. +

    +

    + Supports the following arguments: +

    +
      +
    • +

      + + + Op + + + mkOp(Kind + + + kind) + + +

      +
    • +
    • +

      + + + Op + + + mkOp(Kind + + + kind, + + + const + + + string& + + + arg) + + +

      +
    • +
    • +

      + + + Op + + + mkOp(Kind + + + kind, + + + uint32_t + + + arg0, + + + ...) + + +

      +
    • +
    +
    +
    +
    +
    + + + mkParamSort + + + + ( + + + + + self + + + + , + + + + unicode + + + symbolname=None + + + + + ) + + + ¶ + +
    +
    +

    + Create a sort parameter. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + symbol + + – The name of the sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + The sort parameter. +

    +
    +
    +
    +
    +
    +
    + + + mkPi + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a constant representing the number Pi. +

    +
    +
    + Returns + + : + +
    +
    +

    + A constant representing + + + + PI + + + + . +

    +
    +
    +
    +
    +
    +
    + + + mkPredicateSort + + + + ( + + + + + self + + + + , + + + + * + + + + + sorts + + + + + ) + + + ¶ + +
    +
    +

    + Create a predicate sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sorts + + – The list of sorts of the predicate. +

    +
    +
    + Returns + + : + +
    +
    +

    + The predicate sort. +

    +
    +
    +
    +
    +
    +
    + + + mkReal + + + + ( + + + + + self + + + + , + + + + numerator + + + + , + + + + denominator + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a real constant from a numerator and an optional denominator. +

    +

    + First converts the arguments to a temporary string, either + + + "<numerator>" + + + or + + + "<numerator>/<denominator>" + + + . This temporary +string is forwarded to + + + + cvc5::Solver::mkReal() + + + + and should +thus represent an integer, a decimal number or a fraction. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + numerator + + – The numerator. +

      +
    • +
    • +

      + + denominator + + – The denominator, or + + + None + + + . +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + A real term with literal value. +

    +
    +
    +
    +
    +
    +
    + + + mkRecordSort + + + + ( + + + + + self + + + + , + + + + * + + + + + fields + + + + + ) + + + ¶ + +
    +
    +

    + Create a record sort +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + fields + + – The list of fields of the record. +

    +
    +
    + Returns + + : + +
    +
    +

    + The record sort. +

    +
    +
    +
    +
    +
    +
    + + + mkRegexpAll + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a regular expression all ( + + + re.all + + + ) term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The all term. +

    +
    +
    +
    +
    +
    +
    + + + mkRegexpAllchar + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a regular expression allchar ( + + + re.allchar + + + ) term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The allchar term. +

    +
    +
    +
    +
    +
    +
    + + + mkRegexpNone + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a regular expression none ( + + + re.none + + + ) term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The none term. +

    +
    +
    +
    +
    +
    +
    + + + mkRoundingMode + + + + ( + + + + + self + + + + , + + + + rm + + + + + ) + + + ¶ + +
    +
    +

    + Create a roundingmode constant. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + rm + + – The floating point rounding mode this constant +represents. +

    +
    +
    +
    +
    +
    +
    + + + mkSepEmp + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a separation logic empty term. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The separation logic empty term. +

    +
    +
    +
    +
    +
    +
    + + + mkSepNil + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Create a separation logic nil term. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + sort + + – The sort of the nil term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The separation logic nil term. +

    +
    +
    +
    +
    +
    +
    + + + mkSequenceSort + + + + ( + + + + + self + + + + , + + + + Sort + + + elemSort + + + + + ) + + + ¶ + +
    +
    +

    + Create a sequence sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + elemSort + + – The sort of the sequence elements +

    +
    +
    + Returns + + : + +
    +
    +

    + The sequence sort. +

    +
    +
    +
    +
    +
    +
    + + + mkSetSort + + + + ( + + + + + self + + + + , + + + + Sort + + + elemSort + + + + + ) + + + ¶ + +
    +
    +

    + Create a set sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + elemSort + + – The sort of the set elements. +

    +
    +
    + Returns + + : + +
    +
    +

    + The set sort. +

    +
    +
    +
    +
    +
    +
    + + + mkString + + + + ( + + + + + self + + + + , + + + + unicode + + + s + + + + , + + + + useEscSequences=None + + + + + ) + + + ¶ + +
    +
    +

    + Create a String constant from a + + + str + + + which may contain SMT-LIB +compatible escape sequences like + + + \u1234 + + + to encode unicode +characters. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + s + + – The string this constant represents. +

      +
    • +
    • +

      + + useEscSequences + + – Determines whether escape sequences in + + s + + should be converted to the corresponding +unicode character +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The String constant. +

    +
    +
    +
    +
    +
    +
    + + + mkTerm + + + + ( + + + + + self + + + + , + + + + kind_or_op + + + + , + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a term. +

    +

    + Supports the following arguments: +

    +
      +
    • +

      + + + Term + + + mkTerm(Kind + + + kind) + + +

      +
    • +
    • +

      + + + Term + + + mkTerm(Op + + + op) + + +

      +
    • +
    • +

      + + + Term + + + mkTerm(Kind + + + kind, + + + *args) + + +

      +
    • +
    • +

      + + + Term + + + mkTerm(Op + + + op, + + + *args) + + +

      +
    • +
    +

    + where + + + *args + + + is a comma-separated list of terms. +

    +
    +
    +
    +
    + + + mkTrue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Create a Boolean true constant. +

    +
    +
    + Returns + + : + +
    +
    +

    + The true constant. +

    +
    +
    +
    +
    +
    +
    + + + mkTuple + + + + ( + + + + + self + + + + , + + + + sorts + + + + , + + + + terms + + + + + ) + + + ¶ + +
    +
    +

    + Create a tuple term. Terms are automatically converted if sorts are +compatible. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sorts + + – The sorts of the elements in the tuple. +

      +
    • +
    • +

      + + terms + + – The elements in the tuple. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The tuple Term. +

    +
    +
    +
    +
    +
    +
    + + + mkTupleSort + + + + ( + + + + + self + + + + , + + + + * + + + + + sorts + + + + + ) + + + ¶ + +
    +
    +

    + Create a tuple sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sorts + + – Of the elements of the tuple. +

    +
    +
    + Returns + + : + +
    +
    +

    + The tuple sort. +

    +
    +
    +
    +
    +
    +
    + + + mkUninterpretedSort + + + + ( + + + + + self + + + + , + + + + unicode + + + name=None + + + + + ) + + + ¶ + +
    +
    +

    + Create an uninterpreted sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + symbol + + – The name of the sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + The uninterpreted sort. +

    +
    +
    +
    +
    +
    +
    + + + mkUninterpretedSortConstructorSort + + + + ( + + + + + self + + + + , + + + + size_t + + + arity + + + + , + + + + unicode + + + symbol=None + + + + + ) + + + ¶ + +
    +
    +

    + Create a sort constructor sort. +

    +

    + An uninterpreted sort constructor is an uninterpreted sort with +arity > 0. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The symbol of the sort. +

      +
    • +
    • +

      + + arity + + – The arity of the sort (must be > 0). +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The sort constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + mkUniverseSet + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Create a universe set of the given sort. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + sort + + – The sort of the set elements +

    +
    +
    + Returns + + : + +
    +
    +

    + The universe set constant +

    +
    +
    +
    +
    +
    +
    + + + mkUnresolvedDatatypeSort + + + + ( + + + + + self + + + + , + + + + unicode + + + name + + + + , + + + + size_t + + + arity=0 + + + + + ) + + + ¶ + +
    +
    +

    + Create an unresolved datatype sort. +

    +

    + This is for creating yet unresolved sort placeholders for mutually +recursive datatypes. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the sort. +

      +
    • +
    • +

      + + arity + + – The number of sort parameters of the sort. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The unresolved sort. +

    +
    +
    +
    +
    +
    +
    + + + mkVar + + + + ( + + + + + self + + + + , + + + + Sort + + + sort + + + + , + + + + symbol=None + + + + + ) + + + ¶ + +
    +
    +

    + Create a bound variable to be used in a binder (i.e. a quantifier, +a lambda, or a witness binder). +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort + + – The sort of the variable. +

      +
    • +
    • +

      + + symbol + + – The name of the variable. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The variable. +

    +
    +
    +
    +
    +
    +
    + + + pop + + + + ( + + + + + self + + + + , + + + + nscopes + + + + + = + + + + + 1 + + + + + ) + + + ¶ + +
    +
    +

    + Pop + + + nscopes + + + level(s) from the assertion stack. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( pop <numeral> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + nscopes + + – The number of levels to pop. +

    +
    +
    +
    +
    +
    +
    + + + push + + + + ( + + + + + self + + + + , + + + + nscopes + + + + + = + + + + + 1 + + + + + ) + + + ¶ + +
    +
    +

    + Push + + + nscopes + + + level(s) to the assertion stack. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( push <numeral> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + nscopes + + – The number of levels to push. +

    +
    +
    +
    +
    +
    +
    + + + resetAssertions + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Remove all assertions. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( reset-assertions )
    +
    +
    +
    +
    +
    +
    +
    + + + setInfo + + + + ( + + + + + self + + + + , + + + + unicode + + + keyword + + + + , + + + + unicode + + + value + + + + + ) + + + ¶ + +
    +
    +

    + Set info. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( set-info <attribute> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + keyword + + – The info flag. +

      +
    • +
    • +

      + + value + + – The value of the info flag. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + setLogic + + + + ( + + + + + self + + + + , + + + + unicode + + + logic + + + + + ) + + + ¶ + +
    +
    +

    + Set logic. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( set-logic <symbol> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + logic + + – The logic to set. +

    +
    +
    +
    +
    +
    +
    + + + setOption + + + + ( + + + + + self + + + + , + + + + unicode + + + option + + + + , + + + + unicode + + + value + + + + + ) + + + ¶ + +
    +
    +

    + Set option. +

    +

    + SMT-LIB: +

    +
    +
    +
    ( set-option <option> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + option + + – The option name. +

      +
    • +
    • +

      + + value + + – The option value. +

      +
    • +
    +
    +
    +
    +
    +
    +
    + + + simplify + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Simplify a formula without doing “much” work. Does not involve the +SAT Engine in the simplification, but uses the current definitions, +assertions, and the current partial model, if one has been +constructed. It also involves theory normalization. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – The formula to simplify. +

    +
    +
    + Returns + + : + +
    +
    +

    + The simplified formula. +

    +
    +
    +
    +
    +
    +
    + + + synthFun + + + + ( + + + + + self + + + + , + + + + unicode + + + symbol + + + + , + + + + bound_vars + + + + , + + + + Sort + + + sort + + + + , + + + + Grammar + + + grammar=None + + + + + ) + + + ¶ + +
    +
    +

    + Synthesize n-ary function following specified syntactic constraints. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( synth-fun <symbol> ( <boundVars>* ) <sort> <g> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the function. +

      +
    • +
    • +

      + + boundVars + + – The parameters to this function. +

      +
    • +
    • +

      + + sort + + – The sort of the return value of this function. +

      +
    • +
    • +

      + + grammar + + – The syntactic constraints. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The function. +

    +
    +
    +
    +
    +
    +
    + + + synthInv + + + + ( + + + + + self + + + + , + + + + symbol + + + + , + + + + bound_vars + + + + , + + + + Grammar + + + grammar=None + + + + + ) + + + ¶ + +
    +
    +

    + Synthesize invariant. +

    +

    + SyGuS v2: +

    +
    +
    +
    ( synth-inv <symbol> ( <boundVars>* ) <grammar> )
    +
    +
    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + symbol + + – The name of the invariant. +

      +
    • +
    • +

      + + boundVars + + – The parameters to this invariant. +

      +
    • +
    • +

      + + grammar + + – The syntactic constraints. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The invariant. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/sort.html b/cvc5-1.0.2/api/python/base/sort.html new file mode 100644 index 0000000..00266ff --- /dev/null +++ b/cvc5-1.0.2/api/python/base/sort.html @@ -0,0 +1,2923 @@ + + + + + + + + Sort — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Sort + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Sort + + + + ¶ + +
    +
    +

    + The sort of a cvc5 term. +

    +

    + Wrapper class for + + + + cvc5::Sort + + + + . +

    +
    +
    + + + getArrayElementSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The array element sort of an array sort. +

    +
    +
    +
    +
    +
    +
    + + + getArrayIndexSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The array index sort of an array sort. +

    +
    +
    +
    +
    +
    +
    + + + getBagElementSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The element sort of a bag sort. +

    +
    +
    +
    +
    +
    +
    + + + getBitVectorSize + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The bit-width of the bit-vector sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatype + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The underlying datatype of a datatype sort +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeArity + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The arity of a datatype sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeConstructorArity + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The arity of a datatype constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeConstructorCodomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The codomain sort of a datatype constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeConstructorDomainSorts + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The domain sorts of a datatype constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeSelectorCodomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The codomain sort of a datatype selector sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeSelectorDomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The domain sort of a datatype selector sort. +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeTesterCodomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + the codomain sort of a datatype tester sort, which is the +Boolean sort +

    +
    +
    +
    +
    +
    +
    + + + getDatatypeTesterDomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The domain sort of a datatype tester sort. +

    +
    +
    +
    +
    +
    +
    + + + getFloatingPointExponentSize + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The bit-width of the exponent of the floating-point sort. +

    +
    +
    +
    +
    +
    +
    + + + getFloatingPointSignificandSize + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The width of the significand of the floating-point sort. +

    +
    +
    +
    +
    +
    +
    + + + getFunctionArity + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The arity of a function sort. +

    +
    +
    +
    +
    +
    +
    + + + getFunctionCodomainSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The codomain sort of a function sort. +

    +
    +
    +
    +
    +
    +
    + + + getFunctionDomainSorts + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The domain sorts of a function sort. +

    +
    +
    +
    +
    +
    +
    + + + getInstantiatedParameters + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the sorts used to instantiate the sort parameters of a +parametric sort (parametric datatype or uninterpreted sort +constructor sort, see + + + + instantiate() + + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + The sorts used to instantiate the sort parameters of a +parametric sort +

    +
    +
    +
    +
    +
    +
    + + + getSequenceElementSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The element sort of a sequence sort. +

    +
    +
    +
    +
    +
    +
    + + + getSetElementSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The element sort of a set sort. +

    +
    +
    +
    +
    +
    +
    + + + getSymbol + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + hasSymbol() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The raw symbol of the sort. +

    +
    +
    +
    +
    +
    +
    + + + getTupleLength + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The length of a tuple sort. +

    +
    +
    +
    +
    +
    +
    + + + getTupleSorts + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The element sorts of a tuple sort. +

    +
    +
    +
    +
    +
    +
    + + + getUninterpretedSortConstructor + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get the associated uninterpreted sort constructor of an +instantiated uninterpreted sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + The uninterpreted sort constructor sort +

    +
    +
    +
    +
    +
    +
    + + + getUninterpretedSortConstructorArity + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The arity of a sort constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + hasSymbol + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this sort has a symbol. +

    +
    +
    +
    +
    +
    +
    + + + instantiate + + + + ( + + + + + self + + + + , + + + + params + + + + + ) + + + ¶ + +
    +
    +

    + Instantiate a parameterized datatype sort or uninterpreted sort +constructor sort. +

    +

    + Create sorts parameter with + + + + Solver.mkParamSort() + + + +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +

    + + params + + – The list of sort parameters to instantiate with +

    +
    +
    + Returns + + : + +
    +
    +

    + The instantiated sort +

    +
    +
    +
    +
    +
    +
    + + + isArray + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is an array sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is an array sort. +

    +
    +
    +
    +
    +
    +
    + + + isBag + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a bag sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a bag sort. +

    +
    +
    +
    +
    +
    +
    + + + isBitVector + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a bit-vector sort (SMT-LIB: + + + (_ + + + BitVec + + + i) + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a bit-vector sort. +

    +
    +
    +
    +
    +
    +
    + + + isBoolean + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the Boolean sort (SMT-LIB: + + + Bool + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the Boolean sort. +

    +
    +
    +
    +
    +
    +
    + + + isDatatype + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a datatype sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a datatype sort. +

    +
    +
    +
    +
    +
    +
    + + + isDatatypeConstructor + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a datatype constructor sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a datatype constructor sort. +

    +
    +
    +
    +
    +
    +
    + + + isDatatypeSelector + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a datatype selector sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a datatype selector sort. +

    +
    +
    +
    +
    +
    +
    + + + isDatatypeTester + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a tester sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a selector sort. +

    +
    +
    +
    +
    +
    +
    + + + isDatatypeUpdater + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a datatype updater sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a datatype updater sort. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPoint + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a floatingpoint sort +(SMT-LIB: + + + (_ + + + FloatingPoint + + + eb + + + sb) + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a bit-vector sort. +

    +
    +
    +
    +
    +
    +
    + + + isFunction + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a function sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a function sort. +

    +
    +
    +
    +
    +
    +
    + + + isInstantiated + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is an instantiated (parametric datatype or +uninterpreted sort constructor) sort. +

    +

    + An instantiated sort is a sort that has been constructed from +instantiating a sort parameters with sort arguments +(see + + + + instantiate() + + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if this is an instantiated sort. +

    +
    +
    +
    +
    +
    +
    + + + isInteger + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the integer sort (SMT-LIB: + + + Int + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the integer sort. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if this Sort is a null sort. +

    +
    +
    +
    +
    +
    +
    + + + isPredicate + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a predicate sort. +

    +

    + A predicate sort is a function sort that maps to the Boolean sort. +All predicate sorts are also function sorts. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a predicate sort. +

    +
    +
    +
    +
    +
    +
    + + + isReal + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the real sort (SMT-LIB: + + Real + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the real sort. +

    +
    +
    +
    +
    +
    +
    + + + isRecord + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a record sort. +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a record sort. +

    +
    +
    +
    +
    +
    +
    + + + isRegExp + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the regular expression sort (SMT-LIB: + + + RegLan + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the regexp sort. +

    +
    +
    +
    +
    +
    +
    + + + isRoundingMode + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the rounding mode sort (SMT-LIB: + + + RoundingMode + + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the rounding mode sort. +

    +
    +
    +
    +
    +
    +
    + + + isSequence + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a sequence sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a sequence sort. +

    +
    +
    +
    +
    +
    +
    + + + isSet + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a set sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a set sort. +

    +
    +
    +
    +
    +
    +
    + + + isString + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is the string sort (SMT-LIB: + + String + + ). +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is the string sort. +

    +
    +
    +
    +
    +
    +
    + + + isTuple + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a tuple sort. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is a tuple sort. +

    +
    +
    +
    +
    +
    +
    + + + isUninterpretedSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a sort uninterpreted. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if the sort is uninterpreted. +

    +
    +
    +
    +
    +
    +
    + + + isUninterpretedSortConstructor + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Determine if this is a sort constructor kind. +

    +

    + An uninterpreted sort constructor is an uninterpreted sort with +arity > 0. +

    +
    +
    + Returns + + : + +
    +
    +

    + True if this a sort constructor kind. +

    +
    +
    +
    +
    +
    +
    + + + substitute + + + + ( + + + + + self + + + + , + + + + sort_or_list_1 + + + + , + + + + sort_or_list_2 + + + + + ) + + + ¶ + +
    +
    +

    + Substitution of Sorts. +

    +

    + Note that this replacement is applied during a pre-order traversal +and only once to the sort. It is not run until fix point. In the +case that sort_or_list_1 contains duplicates, the replacement +earliest in the list takes priority. +

    +

    + For example, + + + (Array + + + A + + + B) + + + .substitute([A, + + + C], + + + [(Array + + + C + + + D), + + + (Array + + + A + + + B)]) + + + will return + + + (Array + + + (Array + + + C + + + D) + + + B) + + + . +

    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + sort_or_list_1 + + – The subsort or subsorts to be substituted +within this sort. +

      +
    • +
    • +

      + + sort_or_list_2 + + – The sort or list of sorts replacing the +substituted subsort. +

      +
    • +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/statistics.html b/cvc5-1.0.2/api/python/base/statistics.html new file mode 100644 index 0000000..ecfdbf3 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/statistics.html @@ -0,0 +1,531 @@ + + + + + + + + Statistics — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Statistics + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Statistics + + + + ¶ + +
    +
    +

    + The cvc5 Statistics. +

    +

    + Wrapper class for + + + + cvc5::Statistics + + + + . +Obtain a single statistic value using + + + stats["name"] + + + and a dictionary +with all (visible) statistics using + + + stats.get(internal=False, + + + defaulted=False) + + + . +

    +
    +
    + + + __getitem__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the statistics information for the statistic called + + + name + + + . +

    +
    +
    +
    +
    + + + get + + + + ( + + + + + self + + + + , + + + + bool + + + internal=False + + + + , + + + + bool + + + defaulted=False + + + + + ) + + + ¶ + +
    +
    +

    + Get all statistics as a dictionary. See + + + + cvc5::Statistics::begin() + + + + for more information on which statistics are included based on the parameters. +

    +
    +
    + Returns + + : + +
    +
    +

    + A dictionary with all available statistics. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/synthresult.html b/cvc5-1.0.2/api/python/base/synthresult.html new file mode 100644 index 0000000..3a8ca0d --- /dev/null +++ b/cvc5-1.0.2/api/python/base/synthresult.html @@ -0,0 +1,599 @@ + + + + + + + + SynthResult — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + SynthResult + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + SynthResult + + + + ¶ + +
    +
    +

    + Encapsulation of a solver synth result. +

    +

    + This is the return value of the API methods: +

    +
    + +
    +

    + which we call synthesis queries. This class indicates whether the +synthesis query has a solution, has no solution, or is unknown. +

    +
    +
    + + + hasNoSolution + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the synthesis query has no solution. +In this case, it was determined that there was no solution. +

    +
    +
    +
    +
    +
    +
    + + + hasSolution + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the synthesis query has a solution. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if SynthResult is null, i.e., not a SynthResult +returned from a synthesis query. +

    +
    +
    +
    +
    +
    +
    + + + isUnknown + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the result of the synthesis query could not be +determined. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/term.html b/cvc5-1.0.2/api/python/base/term.html new file mode 100644 index 0000000..3c4626a --- /dev/null +++ b/cvc5-1.0.2/api/python/base/term.html @@ -0,0 +1,3190 @@ + + + + + + + + Term — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Term + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + Term + + + + ¶ + +
    +
    +

    + A cvc5 Term. +

    +

    + Wrapper class for + + + + cvc5::Term + + + + . +

    +
    +
    + + + __getitem__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the child term at a given index. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + index + + – The index of the child term to return. +

    +
    +
    + Returns + + : + +
    +
    +

    + The child term with the given index. +

    +
    +
    +
    +
    +
    +
    + + + __iter__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Iterate over all child terms. +

    +
    +
    +
    +
    + + + andTerm + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Boolean and. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – A Boolean term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The conjunction of this term and the given term. +

    +
    +
    +
    +
    +
    +
    + + + eqTerm + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Equality +

    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – A Boolean term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The Boolean equivalence of this term and the given term. +

    +
    +
    +
    +
    +
    +
    + + + getBitVectorValue + + + + ( + + + + + self + + + + , + + + + base + + + + + = + + + + + 2 + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isBitVectorValue() + + + + . +

    +
    +

    + Supported bases are 2 (bit string), 10 (decimal string) or 16 +(hexdecimal string). +

    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a bit-vector value in string +representation. +

    +
    +
    +
    +
    +
    +
    + + + getBooleanValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isBooleanValue() + + + +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a Boolean value as a native Boolean +value. +

    +
    +
    +
    +
    +
    +
    + + + getCardinalityConstraint + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The sort the cardinality constraint is for and its upper +bound. +

    +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    +
    +
    + + + getConstArrayBase + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isConstArray() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The base (element stored at all indicies) of this constant +array. +

    +
    +
    +
    +
    +
    +
    + + + getFloatingPointValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isFloatingPointValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a floating-point value as a tuple of +the exponent width, the significand width and a bit-vector +value. +

    +
    +
    +
    +
    +
    +
    + + + getId + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The id of this term. +

    +
    +
    +
    +
    +
    +
    + + + getIntegerValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isIntegerValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The integer term as a native python integer. +

    +
    +
    +
    +
    +
    +
    + + + getKind + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The + + + + Kind + + + + of this term. +

    +
    +
    +
    +
    +
    +
    + + + getNumChildren + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The number of children of this term. +

    +
    +
    +
    +
    +
    +
    + + + getOp + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The + + + + Op + + + + used to create this Term. +

    +
    +
    +
    +

    + Note +

    +

    + This is safe to call when + + + + hasOp() + + + + returns True. +

    +
    +
    +
    +
    +
    + + + getRealOrIntegerValueSign + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Get integer or real value sign. Must be called on integer or real +values, or otherwise an exception is thrown. +

    +
    +
    + Returns + + : + +
    +
    +

    + 0 if this term is zero, -1 if this term is a negative real +or integer value, 1 if this term is a positive real or +integer value. +

    +
    +
    +
    +
    +
    +
    + + + getRealValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isRealValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a rational value as a python Fraction. +

    +
    +
    +
    +
    +
    +
    + + + getRoundingModeValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isRoundingModeValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The floating-point rounding mode value held by the term. +

    +
    +
    +
    +
    +
    +
    + + + getSequenceValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isSequenceValue() + + + + . +

    +
    +
    +

    + Note +

    +

    + It is usually necessary for sequences to call + + + + Solver.simplify() + + + + to turn a sequence that is +constructed by, e.g., concatenation of unit sequences, into a +sequence value. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a sequence value as a vector of +terms. +

    +
    +
    +
    +
    +
    +
    + + + getSetValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isSetValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a set value as a set of terms. +

    +
    +
    +
    +
    +
    +
    + + + getSort + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The + + + + Sort + + + + of this term. +

    +
    +
    +
    +
    +
    +
    + + + getStringValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isStringValue() + + + + . +

    +
    +
    +

    + Note +

    +

    + This method is not to be confused with + + + __str__() + + + which returns the term in some string representation, whatever +data it may hold. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The string term as a native string value. +

    +
    +
    +
    +
    +
    +
    + + + getSymbol + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + ..note:: Asserts + + + + hasSymbol() + + + + . +

    +
    +
    + Returns + + : + +
    +
    +

    + The raw symbol of the term. +

    +
    +
    +
    +
    +
    +
    + + + getTupleValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isTupleValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of a tuple value as a vector of terms. +

    +
    +
    +
    +
    +
    +
    + + + getUninterpretedSortValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +

    + Note +

    +

    + Asserts + + + + isUninterpretedSortValue() + + + + . +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + The representation of an uninterpreted value as a pair of +its sort and its index. +

    +
    +
    +
    +
    +
    +
    + + + hasOp + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term has an operator. +

    +
    +
    +
    +
    +
    +
    + + + hasSymbol + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term has a symbol. +

    +
    +
    +
    +
    +
    +
    + + + impTerm + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Boolean Implication. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – A Boolean term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The implication of this term and the given term. +

    +
    +
    +
    +
    +
    +
    + + + isBitVectorValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a bit-vector value. +

    +
    +
    +
    +
    +
    +
    + + + isBooleanValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a Boolean value. +

    +
    +
    +
    +
    +
    +
    + + + isCardinalityConstraint + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the term is a cardinality constraint. +

    +
    +
    +
    +

    + Warning +

    +

    + This method is experimental and may change in future +versions. +

    +
    +
    +
    +
    +
    + + + isConstArray + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a constant array. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointNaN + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff the term is the floating-point value for not a +number. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointNegInf + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff the term is the floating-point value for negative +infinity. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointNegZero + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff the term is the floating-point value for negative +zero. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointPosInf + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff the term is the floating-point value for positive +infinity. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointPosZero + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff the term is the floating-point value for positive +zero. +

    +
    +
    +
    +
    +
    +
    + + + isFloatingPointValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a floating-point value. +

    +
    +
    +
    +
    +
    +
    + + + isIntegerValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is an integer value. +

    +
    +
    +
    +
    +
    +
    + + + isNull + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a null term. +

    +
    +
    +
    +
    +
    +
    + + + isRealValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a rational value. +

    +
    +
    +
    +

    + Note +

    +

    + A term of kind + + + + PI + + + + is not considered +to be a real value. +

    +
    +
    +
    +
    +
    + + + isRoundingModeValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the term is a floating-point rounding mode +value. +

    +
    +
    +
    +
    +
    +
    + + + isSequenceValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a sequence value. +

    +
    +
    +
    +
    +
    +
    + + + isSetValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + A term is a set value if it is considered to be a (canonical) +constant set value. A canonical set value is one whose AST is: +

    +
    +
    +
    (set.union
    +    (set.singleton c1) ...
    +    (set.union (set.singleton c_{n-1}) (set.singleton c_n))))
    +
    +
    +
    +

    + where + + \(c_1 \dots c_n\) + + are values ordered by id such that + + \(c_1 > \cdots > c_n\) + + . +

    +
    +

    + Note +

    +

    + A universe set term +(kind + + + + SET_UNIVERSE + + + + ) +is not considered to be a set value. +

    +
    +
    +
    + Returns + + : + +
    +
    +

    + True if the term is a set value. +

    +
    +
    +
    +
    +
    +
    + + + isStringValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a string value. +

    +
    +
    +
    +
    +
    +
    + + + isTupleValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a tuple value. +

    +
    +
    +
    +
    +
    +
    + + + isUninterpretedSortValue + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + True iff this term is a value from an uninterpreted sort. +

    +
    +
    +
    +
    +
    +
    + + + iteTerm + + + + ( + + + + + self + + + + , + + + + Term + + + then_t + + + + , + + + + Term + + + else_t + + + + + ) + + + ¶ + +
    +
    +

    + If-then-else with this term as the Boolean condition. +

    +
    +
    + Parameters + + : + +
    +
    +
      +
    • +

      + + then_t + + – The + + then + + term. +

      +
    • +
    • +

      + + else_t + + – The + + else + + term. +

      +
    • +
    +
    +
    + Returns + + : + +
    +
    +

    + The if-then-else term with this term as the Boolean +condition. +

    +
    +
    +
    +
    +
    +
    + + + notTerm + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Boolean negation. +

    +
    +
    + Returns + + : + +
    +
    +

    + The Boolean negation of this term. +

    +
    +
    +
    +
    +
    +
    + + + orTerm + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Boolean or. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – A Boolean term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The disjunction of this term and the given term. +

    +
    +
    +
    +
    +
    +
    + + + substitute + + + + ( + + + + + self + + + + , + + + + term_or_list_1 + + + + , + + + + term_or_list_2 + + + + + ) + + + ¶ + +
    +
    +
    +
    + Returns + + : + +
    +
    +

    + The result of simultaneously replacing the term(s) stored +in + + + term_or_list_1 + + + by the term(s) stored in + + + term_or_list_2 + + + in this term. +

    +
    +
    +
    +

    + Note +

    +

    + This replacement is applied during a pre-order traversal and +only once to the term. It is not run until fix point. In the +case that terms contains duplicates, the replacement earliest +in the list takes priority. For example, calling substitute on + + + f(x,y) + + + with +

    +
    +
    +
    term_or_list_1 = [ x, z ], term_or_list_2 = [ g(z), w ]
    +
    +
    +
    +

    + results in the term + + + f(g(z),y) + + + . +

    +
    +
    +
    +
    +
    + + + toPythonObj + + + + ( + + + + + self + + + + + ) + + + ¶ + +
    +
    +

    + Converts a constant value Term to a Python object. +

    +

    + Currently supports: +

    +
      +
    • +

      + + Boolean: + + Returns a Python bool +

      +
    • +
    • +

      + + Int : + + Returns a Python int +

      +
    • +
    • +

      + + Real : + + Returns a Python Fraction +

      +
    • +
    • +

      + + BV : + + Returns a Python int (treats BV as unsigned) +

      +
    • +
    • +

      + + String : + + Returns a Python Unicode string +

      +
    • +
    • +

      + + Array : + + Returns a Python dict mapping indices to values. The constant base is returned as the default value. +

      +
    • +
    +
    +
    +
    +
    + + + xorTerm + + + + ( + + + + + self + + + + , + + + + Term + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Boolean exclusive or. +

    +
    +
    + Parameters + + : + +
    +
    +

    + + t + + – A Boolean term. +

    +
    +
    + Returns + + : + +
    +
    +

    + The exclusive disjunction of this term and the given term. +

    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/base/unknownexplanation.html b/cvc5-1.0.2/api/python/base/unknownexplanation.html new file mode 100644 index 0000000..1c47ca5 --- /dev/null +++ b/cvc5-1.0.2/api/python/base/unknownexplanation.html @@ -0,0 +1,568 @@ + + + + + + + + UnknownExplanation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + UnknownExplanation + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5. + + + + + UnknownExplanation + + + + ( + + + + + value + + + + + ) + + + ¶ + +
    +
    +

    + The UnknownExplanation enum +

    +
    +
    + + + INCOMPLETE + + + + ¶ + +
    +
    +

    + Incomplete theory solver. +

    +
    +
    +
    +
    + + + INTERRUPTED + + + + ¶ + +
    +
    +

    + Solver was interrupted. +

    +
    +
    +
    +
    + + + MEMOUT + + + + ¶ + +
    +
    +

    + Memory limit reached. +

    +
    +
    +
    +
    + + + OTHER + + + + ¶ + +
    +
    +

    + Other reason. +

    +
    +
    +
    +
    + + + REQUIRES_FULL_CHECK + + + + ¶ + +
    +
    +

    + Full satisfiability check required (e.g., if only preprocessing was +performed). +

    +
    +
    +
    +
    + + + RESOURCEOUT + + + + ¶ + +
    +
    +

    + Resource limit reached. +

    +
    +
    +
    +
    + + + TIMEOUT + + + + ¶ + +
    +
    +

    + Time limit reached. +

    +
    +
    +
    +
    + + + UNKNOWN_REASON + + + + ¶ + +
    +
    +

    + No specific reason given. +

    +
    +
    +
    +
    + + + UNSUPPORTED + + + + ¶ + +
    +
    +

    + Unsupported feature encountered. +

    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/python.html b/cvc5-1.0.2/api/python/python.html new file mode 100644 index 0000000..d8bd03d --- /dev/null +++ b/cvc5-1.0.2/api/python/python.html @@ -0,0 +1,370 @@ + + + + + + + + Python API — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Python API + + ¶ + +

    +

    + cvc5 offers two separate APIs for Python users. +The + + + base Python API + + + is an almost exact copy of the + + + C++ API + + + . +Alternatively, the + + + pythonic API + + + is a more pythonic API that aims to be fully compatible with + + Z3s Python API + + while adding functionality that Z3 does not support. +

    + +
    +

    + Which Python API should I use? + + ¶ + +

    +

    + If you are a new user, or already have an application that uses Z3’s python API, use the + + + pythonic API + + + . +

    +

    + If you would like a more feature-complete—yet verbose—python API, with the ability to do almost everything that the cpp API allows, use the + + + base Python API + + + . +

    +

    + You can compare examples using the two APIs by visiting the + + + examples page + + + . +

    +
    +
    +

    + Installation + + ¶ + +

    +

    + The base and pythonic Python API can be installed via + + pip + + as follows: +

    +
    +
    +
    pip install cvc5
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/arith.html b/cvc5-1.0.2/api/python/pythonic/arith.html new file mode 100644 index 0000000..c25a8a1 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/arith.html @@ -0,0 +1,6138 @@ + + + + + + + + Arithmetic — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Arithmetic + + ¶ + +

    +
    +

    + Basic Arithmetic Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Int + + + + ( + + + + + name + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an integer constant named + + name + + . If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> x = Int('x')
    +>>> is_int(x)
    +True
    +>>> is_int(x + 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Real + + + + ( + + + + + name + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a real constant named + + name + + . If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> x = Real('x')
    +>>> is_real(x)
    +True
    +>>> is_real(x + 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IntVal + + + + ( + + + + + val + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT integer value. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> IntVal(1)
    +1
    +>>> IntVal("100")
    +100
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RealVal + + + + ( + + + + + val + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT real value. +

    +

    + + val + + may be a Python int, long, float or string representing a number in decimal or rational notation. +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> RealVal(1)
    +1
    +>>> RealVal(1).sort()
    +Real
    +>>> RealVal("3/5")
    +3/5
    +>>> RealVal("1.5")
    +3/2
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RatVal + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT rational a/b. +

    +

    + If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> RatVal(3,5)
    +3/5
    +>>> RatVal(3,5).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Q + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT rational a/b. +

    +

    + If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> Q(3,5)
    +3/5
    +>>> Q(3,5).sort()
    +Real
    +>>> Q(4,8)
    +1/2
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IntSort + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return the integer sort in the given context. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> IntSort()
    +Int
    +>>> x = Const('x', IntSort())
    +>>> is_int(x)
    +True
    +>>> x.sort() == IntSort()
    +True
    +>>> x.sort() == BoolSort()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RealSort + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return the real sort in the given context. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> RealSort()
    +Real
    +>>> x = Const('x', RealSort())
    +>>> is_real(x)
    +True
    +>>> is_int(x)
    +False
    +>>> x.sort() == RealSort()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FreshInt + + + + ( + + + + + prefix + + + + + = + + + + + 'x' + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a fresh integer constant in the given context using the given prefix. +

    +
    +
    +
    >>> x = FreshInt()
    +>>> y = FreshInt()
    +>>> eq(x, y)
    +False
    +>>> x.sort()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Ints + + + + ( + + + + + names + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a tuple of Integer constants. +

    +
    +
    +
    >>> x, y, z = Ints('x y z')
    +>>> Sum(x, y, z)
    +x + y + z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IntVector + + + + ( + + + + + prefix + + + + , + + + + sz + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a list of integer constants of size + + sz + + . +

    +
    +
    +
    >>> X = IntVector('x', 3)
    +>>> X
    +[x__0, x__1, x__2]
    +>>> Sum(X)
    +x__0 + x__1 + x__2
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FreshReal + + + + ( + + + + + prefix + + + + + = + + + + + 'b' + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a fresh real constant in the given context using the given prefix. +

    +
    +
    +
    >>> x = FreshReal()
    +>>> y = FreshReal()
    +>>> eq(x, y)
    +False
    +>>> x.sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Reals + + + + ( + + + + + names + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a tuple of real constants. +

    +
    +
    +
    >>> x, y, z = Reals('x y z')
    +>>> Sum(x, y, z)
    +x + y + z
    +>>> Sum(x, y, z).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RealVector + + + + ( + + + + + prefix + + + + , + + + + sz + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a list of real constants of size + + sz + + . +

    +
    +
    +
    >>> X = RealVector('x', 3)
    +>>> X
    +[x__0, x__1, x__2]
    +>>> Sum(X)
    +x__0 + x__1 + x__2
    +>>> Sum(X).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    +

    + Arithmetic Overloads + + ¶ + +

    +

    + See the following operator overloads for building arithmetic terms. These terms +can also be built with builder functions listed below. +

    +
    +
    + addition ( + + + + + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__add__() + + + +

    +
    +
    + subtraction ( + + + - + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__sub__() + + + +

    +
    +
    + multiplication ( + + + * + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__mul__() + + + +

    +
    +
    + division ( + + + / + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__div__() + + + +

    +
    +
    + power ( + + + ** + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__pow__() + + + +

    +
    +
    + negation ( + + + - + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__neg__() + + + +

    +
    +
    + greater than ( + + + > + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__gt__() + + + +

    +
    +
    + less than ( + + + < + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__lt__() + + + +

    +
    +
    + greater than or equal to ( + + + >= + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__ge__() + + + +

    +
    +
    + less than or equal to ( + + + <= + + + ) +
    +
    +

    + + + + cvc5.pythonic.ArithRef.__le__() + + + +

    +
    +
    + equal ( + + + == + + + ) +
    +
    +

    + + + + cvc5.pythonic.ExprRef.__eq__() + + + +

    +
    +
    + not equal ( + + + != + + + ) +
    +
    +

    + + + + cvc5.pythonic.ExprRef.__ne__() + + + +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Add + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT addition. +

    +

    + See also the __add__ overload (+ operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Add(x, x, y)
    +x + x + y
    +>>> Add(x, x, y, main_ctx())
    +x + x + y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Mult + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT multiplication. +

    +

    + See also the __mul__ overload (* operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Mult(x, x, y)
    +x*x*y
    +>>> Mult(x, x, y, main_ctx())
    +x*x*y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Sub + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT subtraction. +

    +

    + See also the __sub__ overload (- operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Sub(x, y)
    +x - y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + UMinus + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT unary negation. +

    +

    + Deprecated. Kept for compatiblity with Z3. See “Neg”. +

    +

    + See also the __neg__ overload (unary - operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x = Int('x')
    +>>> UMinus(x)
    +-x
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Div + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT division. +

    +

    + See also the __div__ overload (/ operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> a, b = Reals('x y')
    +>>> Div(x, y).sexpr()
    +'(div x y)'
    +>>> Div(a, y).sexpr()
    +'(/ x (to_real y))'
    +>>> Div(a, b).sexpr()
    +'(/ x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Pow + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT power. +

    +

    + See also the __pow__ overload for arithmetic SMT expressions. +

    +
    +
    +
    >>> x = Int('x')
    +>>> Pow(x, 3)
    +x**3
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IntsModulus + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT integer modulus. +

    +

    + See also the __mod__ overload (% operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> IntsModulus(x, y)
    +x%y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Leq + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT less-than-or-equal-to. +

    +

    + See also the __le__ overload (<= operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Leq(x, y)
    +x <= y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Geq + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT greater-than-or-equal-to. +

    +

    + See also the __ge__ overload (>= operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Geq(x, y)
    +x >= y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Lt + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT less-than. +

    +

    + See also the __lt__ overload (< operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Lt(x, y)
    +x < y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Gt + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT greater-than. +

    +

    + See also the __gt__ overload (> operator) for arithmetic SMT expressions. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> Gt(x, y)
    +x > y
    +
    +
    +
    +
    +
    +
    +
    +

    + Other Arithmetic Operators + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + ToReal + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression ToReal(a). +

    +
    +
    +
    >>> x = Int('x')
    +>>> x.sort()
    +Int
    +>>> n = ToReal(x)
    +>>> n
    +ToReal(x)
    +>>> n.sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ToInt + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression ToInt(a). +

    +
    +
    +
    >>> x = Real('x')
    +>>> x.sort()
    +Real
    +>>> n = ToInt(x)
    +>>> n
    +ToInt(x)
    +>>> n.sort()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IsInt + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT predicate IsInt(a). +

    +
    +
    +
    >>> x = Real('x')
    +>>> IsInt(x + "1/2")
    +IsInt(x + 1/2)
    +>>> solve(IsInt(x + "1/2"), x > 0, x < 1)
    +[x = 1/2]
    +>>> solve(IsInt(x + "1/2"), x > 0, x < 1, x != "1/2")
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Sqrt + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT expression which represents the square root of a. +

    +

    + Can also operate on python builtins of arithemtic type. +

    +
    +
    +
    >>> x = Real('x')
    +>>> Sqrt(x)
    +x**(1/2)
    +>>> Sqrt(4)
    +4**(1/2)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Cbrt + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT expression which represents the cubic root of a. +

    +

    + Can also operate on python builtins of arithemtic type. +

    +
    +
    +
    >>> x = Real('x')
    +>>> Cbrt(x)
    +x**(1/3)
    +>>> Cbrt(4)
    +4**(1/3)
    +
    +
    +
    +
    +
    +
    +
    +

    + Transcendentals + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Pi + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the constant pi +

    +
    +
    +
    >>> Pi()
    +Pi
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Exponential + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an exponential function +

    +
    +
    +
    >>> x = Real('x')
    +>>> solve(Exponential(x) == 1)
    +[x = 0]
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Sine + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a sine function +

    +
    +
    +
    >>> x = Real('x')
    +>>> i = Int('i')
    +>>> prove(Sine(x) < 2)
    +proved
    +>>> prove(Sine(i) < 2)
    +proved
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Cosine + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a cosine function +

    +
    +
    +
    >>> x = Real('x')
    +>>> i = Int('i')
    +>>> prove(Cosine(x) < 2)
    +proved
    +>>> prove(Cosine(i) < 2)
    +proved
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Tangent + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a tangent function +

    +
    +
    +
    >>> Tangent(Real('x'))
    +Tangent(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arcsine + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arcsine function +

    +
    +
    +
    >>> Arcsine(Real('x'))
    +Arcsine(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arccosine + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arccosine function +

    +
    +
    +
    >>> Arccosine(Real('x'))
    +Arccosine(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arctangent + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arctangent function +

    +
    +
    +
    >>> Arctangent(Real('x'))
    +Arctangent(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Secant + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a secant function +

    +
    +
    +
    >>> Secant(Real('x'))
    +Secant(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Cosecant + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a cosecant function +

    +
    +
    +
    >>> Cosecant(Real('x'))
    +Cosecant(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Cotangent + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create a cotangent function +

    +
    +
    +
    >>> Cotangent(Real('x'))
    +Cotangent(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arcsecant + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arcsecant function +

    +
    +
    +
    >>> Arcsecant(Real('x'))
    +Arcsecant(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arccosecant + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arccosecant function +

    +
    +
    +
    >>> Arccosecant(Real('x'))
    +Arccosecant(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Arccotangent + + + + ( + + + + + x + + + + + ) + + + ¶ + +
    +
    +

    + Create an arccotangent function +

    +
    +
    +
    >>> Arccotangent(Real('x'))
    +Arccotangent(x)
    +
    +
    +
    +
    +
    +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_arith + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an arithmetical expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> is_arith(x)
    +True
    +>>> is_arith(x + 1)
    +True
    +>>> is_arith(1)
    +False
    +>>> is_arith(IntVal(1))
    +True
    +>>> y = Real('y')
    +>>> is_arith(y)
    +True
    +>>> is_arith(y + 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_int + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an integer expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> is_int(x + 1)
    +True
    +>>> is_int(1)
    +False
    +>>> is_int(IntVal(1))
    +True
    +>>> y = Real('y')
    +>>> is_int(y)
    +False
    +>>> is_int(y + 1)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_real + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a real expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> is_real(x + 1)
    +False
    +>>> y = Real('y')
    +>>> is_real(y)
    +True
    +>>> is_real(y + 1)
    +True
    +>>> is_real(1)
    +False
    +>>> is_real(RealVal(1))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_int_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an integer value of sort Int. +

    +
    +
    +
    >>> is_int_value(IntVal(1))
    +True
    +>>> is_int_value(1)
    +False
    +>>> is_int_value(Int('x'))
    +False
    +>>> n = Int('x') + 1
    +>>> n
    +x + 1
    +>>> n.arg(1)
    +1
    +>>> is_int_value(n.arg(1))
    +True
    +>>> is_int_value(RealVal("1/3"))
    +False
    +>>> is_int_value(RealVal(1))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_rational_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is rational value of sort Real. +

    +
    +
    +
    >>> is_rational_value(RealVal(1))
    +True
    +>>> is_rational_value(RealVal("3/5"))
    +True
    +>>> is_rational_value(IntVal(1))
    +False
    +>>> is_rational_value(1)
    +False
    +>>> n = Real('x') + 1
    +>>> n.arg(1)
    +1
    +>>> is_rational_value(n.arg(1))
    +True
    +>>> is_rational_value(Real('x'))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_arith_sort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if s is an arithmetical sort (type). +

    +
    +
    +
    >>> is_arith_sort(IntSort())
    +True
    +>>> is_arith_sort(RealSort())
    +True
    +>>> is_arith_sort(BoolSort())
    +False
    +>>> n = Int('x') + 1
    +>>> is_arith_sort(n.sort())
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_add + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b + c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_add(x + y)
    +True
    +>>> is_add(x - y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_mul + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b * c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_mul(x * y)
    +True
    +>>> is_mul(x - y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_sub + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b - c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_sub(x - y)
    +True
    +>>> is_sub(x + y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_div + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a rational division term (i.e. b / c). +

    +

    + Note: this returns false for integer division. See + + is_idiv + + . +

    +
    +
    +
    >>> x, y = Reals('x y')
    +>>> is_div(x / y)
    +True
    +>>> is_div(x + y)
    +False
    +>>> x, y = Ints('x y')
    +>>> is_div(x / y)
    +False
    +>>> is_idiv(x / y)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_idiv + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b div c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_idiv(x / y)
    +True
    +>>> is_idiv(x + y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_mod + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b % c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_mod(x % y)
    +True
    +>>> is_mod(x + y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_le + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b <= c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_le(x <= y)
    +True
    +>>> is_le(x < y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_lt + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b < c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_lt(x < y)
    +True
    +>>> is_lt(x == y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_ge + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b >= c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_ge(x >= y)
    +True
    +>>> is_ge(x == y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_gt + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form b > c. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_gt(x > y)
    +True
    +>>> is_gt(x == y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_is_int + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form IsInt(b). +

    +
    +
    +
    >>> x = Real('x')
    +>>> is_is_int(IsInt(x))
    +True
    +>>> is_is_int(x)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_to_real + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form ToReal(b). +

    +
    +
    +
    >>> x = Int('x')
    +>>> n = ToReal(x)
    +>>> n
    +ToReal(x)
    +>>> is_to_real(n)
    +True
    +>>> is_to_real(x)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_to_int + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an expression of the form ToInt(b). +

    +
    +
    +
    >>> x = Real('x')
    +>>> n = ToInt(x)
    +>>> n
    +ToInt(x)
    +>>> is_to_int(n)
    +True
    +>>> is_to_int(x)
    +False
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ArithSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Real and Integer sorts. +

    +
    +
    + + + cast + + + + ( + + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Try to cast + + val + + as an Integer or Real. +

    +
    +
    +
    >>> IntSort().cast(10)
    +10
    +>>> is_int(IntSort().cast(10))
    +True
    +>>> is_int(10)
    +False
    +>>> RealSort().cast(10)
    +10
    +>>> is_real(RealSort().cast(10))
    +True
    +>>> IntSort().cast(Bool('x'))
    +If(x, 1, 0)
    +>>> RealSort().cast(Bool('x'))
    +ToReal(If(x, 1, 0))
    +>>> try:
    +...   IntSort().cast(RealVal("1.1"))
    +... except SMTException as ex:
    +...   print("failed")
    +failed
    +
    +
    +
    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is of the sort Integer. +

    +
    +
    +
    >>> x = Int('x')
    +>>> x.is_int()
    +True
    +>>> (x + 1).is_int()
    +True
    +>>> x = Real('x')
    +>>> x.is_int()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + is_real + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is of the sort Real. +

    +
    +
    +
    >>> x = Real('x')
    +>>> x.is_real()
    +True
    +>>> (x + 1).is_real()
    +True
    +>>> x = Int('x')
    +>>> x.is_real()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + subsort + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a subsort of + + other + + . +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ArithRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Integer and Real expressions. +

    +
    +
    + + + __add__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self + other + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> x + y
    +x + y
    +>>> (x + y).sort()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + __div__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other/self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> x/y
    +x/y
    +>>> (x/y).sort()
    +Int
    +>>> (x/y).sexpr()
    +'(div x y)'
    +>>> x = Real('x')
    +>>> y = Real('y')
    +>>> x/y
    +x/y
    +>>> (x/y).sort()
    +Real
    +>>> (x/y).sexpr()
    +'(/ x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __ge__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other >= self + + . +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> x >= y
    +x >= y
    +>>> y = Real('y')
    +>>> x >= y
    +ToReal(x) >= y
    +
    +
    +
    +
    +
    +
    +
    + + + __gt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other > self + + . +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> x > y
    +x > y
    +>>> y = Real('y')
    +>>> x > y
    +ToReal(x) > y
    +
    +
    +
    +
    +
    +
    +
    + + + __le__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other <= self + + . +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> x <= y
    +x <= y
    +>>> y = Real('y')
    +>>> x <= y
    +ToReal(x) <= y
    +
    +
    +
    +
    +
    +
    +
    + + + __lt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other < self + + . +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> x < y
    +x < y
    +>>> y = Real('y')
    +>>> x < y
    +ToReal(x) < y
    +
    +
    +
    +
    +
    +
    +
    + + + __mod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other%self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> x % y
    +x%y
    +
    +
    +
    +
    +
    +
    +
    + + + __mul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self * other + + . +

    +
    +
    +
    >>> x = Real('x')
    +>>> y = Real('y')
    +>>> x * y
    +x*y
    +>>> (x * y).sort()
    +Real
    +>>> x * BoolVal(True)
    +If(True, x, 0)
    +
    +
    +
    +
    +
    +
    +
    + + + __neg__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an expression representing + + -self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> -x
    +-x
    +
    +
    +
    +
    +
    +
    +
    + + + __pos__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> +x
    +x
    +
    +
    +
    +
    +
    +
    +
    + + + __pow__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self**other + + (** is the power operator). +

    +
    +
    +
    >>> x = Real('x')
    +>>> x**3
    +x**3
    +>>> (x**3).sort()
    +Real
    +>>> solve([x ** 2 == x, x > 0])
    +[x = 1]
    +
    +
    +
    +
    +
    +
    +
    + + + __radd__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other + self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> 10 + x
    +10 + x
    +
    +
    +
    +
    +
    +
    +
    + + + __rdiv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other/self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> 10/x
    +10/x
    +>>> (10/x).sexpr()
    +'(div 10 x)'
    +>>> x = Real('x')
    +>>> 10/x
    +10/x
    +>>> (10/x).sexpr()
    +'(/ 10.0 x)'
    +
    +
    +
    +
    +
    +
    +
    + + + __rmod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other%self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> 10 % x
    +10%x
    +
    +
    +
    +
    +
    +
    +
    + + + __rmul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other * self + + . +

    +
    +
    +
    >>> x = Real('x')
    +>>> 10 * x
    +10*x
    +
    +
    +
    +
    +
    +
    +
    + + + __rpow__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other**self + + (** is the power operator). +

    +
    +
    +
    >>> x = Real('x')
    +>>> 2**x
    +2**x
    +>>> (2**x).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + __rsub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other - self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> 10 - x
    +10 - x
    +
    +
    +
    +
    +
    +
    +
    + + + __rtruediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other/self + + . +

    +
    +
    +
    +
    + + + __sub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self - other + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> x - y
    +x - y
    +>>> (x - y).sort()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + __truediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other/self + + . +

    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is an integer expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> x.is_int()
    +True
    +>>> (x + 1).is_int()
    +True
    +>>> y = Real('y')
    +>>> (x + y).is_int()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + is_real + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is an real expression. +

    +
    +
    +
    >>> x = Real('x')
    +>>> x.is_real()
    +True
    +>>> (x + 1).is_real()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort (type) of the arithmetical expression + + self + + . +

    +
    +
    +
    >>> Int('x').sort()
    +Int
    +>>> (Real('x') + 1).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + IntNumRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Integer values. +

    +
    +
    + + + as_binary_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT integer numeral as a Python binary string. +>>> v = IntVal(10) +>>> v.as_binary_string() +‘1010’ +

    +
    +
    +
    +
    + + + as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT integer numeral as a Python long (bignum) numeral. +

    +
    +
    +
    >>> v = IntVal(1)
    +>>> v + 1
    +1 + 1
    +>>> v.as_long() + 1
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + as_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT integer numeral as a Python string. +>>> v = IntVal(100) +>>> v.as_string() +‘100’ +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + RatNumRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Rational values. +

    +
    +
    + + + as_decimal + + + + ( + + + + + prec + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT rational value as a string in decimal notation using at most + + prec + + decimal places. +

    +
    +
    +
    >>> v = RealVal("1/5")
    +>>> v.as_decimal(3)
    +'0.2'
    +>>> v = RealVal("1/3")
    +>>> v.as_decimal(3)
    +'0.333'
    +
    +
    +
    +
    +
    +
    +
    + + + as_fraction + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT rational as a Python Fraction object. +

    +
    +
    +
    >>> v = RealVal("1/5")
    +>>> v.as_fraction()
    +Fraction(1, 5)
    +
    +
    +
    +
    +
    +
    +
    + + + as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Is this arithmetic value an integer? +>>> RealVal(“2/1”).as_long() +2 +>>> try: +… RealVal(“2/3”).as_long() +… except SMTException as e: +… print(“failed: %s” % e) +failed: Expected integer fraction +

    +
    +
    +
    +
    + + + as_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT rational numeral as a Python string. +

    +
    +
    +
    >>> v = Q(3,6)
    +>>> v.as_string()
    +'1/2'
    +
    +
    +
    +
    +
    +
    +
    + + + denominator + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the denominator of an SMT rational numeral. +

    +
    +
    +
    >>> is_rational_value(Q(3,5))
    +True
    +>>> n = Q(3,5)
    +>>> n.denominator()
    +5
    +
    +
    +
    +
    +
    +
    +
    + + + denominator_as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the denominator as a Python long. +

    +
    +
    +
    >>> v = RealVal("1/3")
    +>>> v
    +1/3
    +>>> v.denominator_as_long()
    +3
    +
    +
    +
    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is an integer expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> x.is_int()
    +True
    +>>> (x + 1).is_int()
    +True
    +>>> y = Real('y')
    +>>> (x + y).is_int()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + is_int_value + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Is this arithmetic value an integer? +>>> RealVal(“2/1”).is_int_value() +True +>>> RealVal(“2/3”).is_int_value() +False +

    +
    +
    +
    +
    + + + is_real + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is an real expression. +

    +
    +
    +
    >>> x = Real('x')
    +>>> x.is_real()
    +True
    +>>> (x + 1).is_real()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + numerator + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the numerator of an SMT rational numeral. +

    +
    +
    +
    >>> is_rational_value(RealVal("3/5"))
    +True
    +>>> n = RealVal("3/5")
    +>>> n.numerator()
    +3
    +>>> is_rational_value(Q(3,5))
    +True
    +>>> Q(3,5).numerator()
    +3
    +
    +
    +
    +
    +
    +
    +
    + + + numerator_as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the numerator as a Python long. +

    +
    +
    +
    >>> v = RealVal(10000000000)
    +>>> v
    +10000000000
    +>>> v + 1
    +10000000000 + 1
    +>>> v.numerator_as_long() + 1 == 10000000001
    +True
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/array.html b/cvc5-1.0.2/api/python/pythonic/array.html new file mode 100644 index 0000000..5c20d41 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/array.html @@ -0,0 +1,1661 @@ + + + + + + + + Arrays — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Arrays + + ¶ + +

    +
    +

    + Basic Array Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Array + + + + ( + + + + + name + + + + , + + + + dom + + + + , + + + + rng + + + + + ) + + + ¶ + +
    +
    +

    + Return an array constant named + + name + + with the given domain and range sorts. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> a.sort()
    +Array(Int, Int)
    +>>> a[0]
    +a[0]
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ConstArray + + + + ( + + + + + dom + + + + , + + + + v + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT constant array expression. +

    +
    +
    +
    >>> a = ConstArray(IntSort(), 10)
    +>>> a
    +ConstArray(Int, 10)
    +>>> a.sort()
    +Array(Int, Int)
    +>>> i = Int('i')
    +>>> a[i]
    +ConstArray(Int, 10)[i]
    +>>> simplify(a[i])
    +10
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + K + + + + ( + + + + + dom + + + + , + + + + v + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT constant array expression. An alias for ConstArray. +

    +
    +
    +
    >>> a = K(IntSort(), 10)
    +>>> a
    +ConstArray(Int, 10)
    +>>> a.sort()
    +Array(Int, Int)
    +>>> i = Int('i')
    +>>> a[i]
    +ConstArray(Int, 10)[i]
    +>>> simplify(a[i])
    +10
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ArraySort + + + + ( + + + + + * + + + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT array sort with the given domain and range sorts. +

    +
    +
    +
    >>> A = ArraySort(IntSort(), BoolSort())
    +>>> A
    +Array(Int, Bool)
    +>>> A.domain()
    +Int
    +>>> A.range()
    +Bool
    +>>> AA = ArraySort(IntSort(), A)
    +>>> AA
    +Array(Int, Array(Int, Bool))
    +>>> try:
    +...  ArraySort(IntSort(), IntSort(), BoolSort())
    +... except SMTException as e:
    +...  print("failed: %s" % e)
    +failed: Unimplemented: multi-domain array
    +
    +
    +
    +
    +
    +
    +
    +

    + Array Operators + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Select + + + + ( + + + + + a + + + + , + + + + i + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT select array expression. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> i = Int('i')
    +>>> Select(a, i)
    +a[i]
    +>>> eq(Select(a, i), a[i])
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Store + + + + ( + + + + + a + + + + , + + + + i + + + + , + + + + v + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT + + + store + + + array expression. +

    +
    +
    +
    >>> a    = Array('a', IntSort(), IntSort())
    +>>> i, v = Ints('i v')
    +>>> s    = Store(a, i, v)
    +>>> s.sort()
    +Array(Int, Int)
    +>>> prove(s[i] == v)
    +proved
    +>>> j    = Int('j')
    +>>> prove(Implies(i != j, s[j] == a[j]))
    +proved
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Update + + + + ( + + + + + a + + + + , + + + + i + + + + , + + + + v + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT + + + store + + + array expression. An alias for Store. +

    +
    +
    +
    >>> a    = Array('a', IntSort(), IntSort())
    +>>> i, v = Ints('i v')
    +>>> s    = Update(a, i, v)
    +>>> s.sort()
    +Array(Int, Int)
    +>>> prove(s[i] == v)
    +proved
    +>>> j    = Int('j')
    +>>> prove(Implies(i != j, s[j] == a[j]))
    +proved
    +
    +
    +
    +
    +
    +

    + See the following operator overloads for building other kinds of array +terms: +

    + +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_array_sort + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Is this an array sort? +

    +
    +
    +
    >>> is_array_sort(ArraySort(BoolSort(), BoolSort()))
    +True
    +>>> is_array_sort(BoolSort())
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_array + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT array expression. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> is_array(a)
    +True
    +>>> is_array(Store(a, 0, 1))
    +True
    +>>> is_array(a[0])
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_const_array + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT constant array. +

    +
    +
    +
    >>> a = ConstArray(IntSort(), 10)
    +>>> is_const_array(a)
    +True
    +>>> a = Array('a', IntSort(), IntSort())
    +>>> is_const_array(a)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_K + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT constant array. +An alias for is_const_array. +

    +
    +
    +
    >>> a = ConstArray(IntSort(), 10)
    +>>> is_K(a)
    +True
    +>>> a = Array('a', IntSort(), IntSort())
    +>>> is_K(a)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_select + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT array select application. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> is_select(a)
    +False
    +>>> i = Int('i')
    +>>> is_select(a[i])
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_store + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT array + + + store + + + application. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> is_store(a)
    +False
    +>>> is_store(Store(a, 0, 1))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_update + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT array + + + store + + + application. +An alias for is_store. +

    +
    +
    +
    >>> a = Array('a', IntSort(), IntSort())
    +>>> is_update(a)
    +False
    +>>> is_update(Update(a, 0, 1))
    +True
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ArraySortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Array sorts. +

    +
    +
    + + + domain + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the domain of the array sort + + self + + . +

    +
    +
    +
    >>> A = ArraySort(IntSort(), BoolSort())
    +>>> A.domain()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the range of the array sort + + self + + . +

    +
    +
    +
    >>> A = ArraySort(IntSort(), BoolSort())
    +>>> A.range()
    +Bool
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ArrayRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Array expressions. +

    +
    +
    + + + __getitem__ + + + + ( + + + + + arg + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression + + self[arg] + + . +

    +
    +
    +
    >>> a = Array('a', IntSort(), BoolSort())
    +>>> i = Int('i')
    +>>> a[i]
    +a[i]
    +>>> a[i].sexpr()
    +'(select a i)'
    +
    +
    +
    +
    +
    +
    +
    + + + arg + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + Get the “argument” (base element) of this constant array. +

    +
    +
    +
    >>> b = ConstArray(IntSort(), 1)
    +>>> b.arg(0)
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + default + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get the constant element of this (constant) array +>>> b = ConstArray(IntSort(), 1) +>>> b.default() +1 +

    +
    +
    +
    +
    + + + domain + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Shorthand for + + self.sort().domain() + + . +

    +
    +
    +
    >>> a = Array('a', IntSort(), BoolSort())
    +>>> a.domain()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Shorthand for + + self.sort().range() + + . +

    +
    +
    +
    >>> a = Array('a', IntSort(), BoolSort())
    +>>> a.range()
    +Bool
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the array sort of the array expression + + self + + . +

    +
    +
    +
    >>> a = Array('a', IntSort(), BoolSort())
    +>>> a.sort()
    +Array(Int, Bool)
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/bitvec.html b/cvc5-1.0.2/api/python/pythonic/bitvec.html new file mode 100644 index 0000000..8efdd76 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/bitvec.html @@ -0,0 +1,4977 @@ + + + + + + + + Bit-Vectors — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Bit-Vectors + + ¶ + +

    +
    +

    + Basic Bit-Vector Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + BitVec + + + + ( + + + + + name + + + + , + + + + bv + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a bit-vector constant named + + name + + . + + bv + + may be the number of bits of a bit-vector sort. +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> x  = BitVec('x', 16)
    +>>> is_bv(x)
    +True
    +>>> x.size()
    +16
    +>>> x.sort()
    +BitVec(16)
    +>>> word = BitVecSort(16)
    +>>> x2 = BitVec('x', word)
    +>>> eq(x, x2)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BitVecVal + + + + ( + + + + + val + + + + , + + + + bv + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a bit-vector value with the given number of bits. If + + ctx=None + + , then the global context is used. +The second argument can be a number of bits (integer) or a bit-vector sort. +

    +
    +
    +
    >>> v = BitVecVal(10, 32)
    +>>> v
    +10
    +>>> print("0x%.8x" % v.as_long())
    +0x0000000a
    +>>> s = BitVecSort(3)
    +>>> u = BitVecVal(10, s)
    +>>> u
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BitVecSort + + + + ( + + + + + sz + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT bit-vector sort of the given size. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> Byte = BitVecSort(8)
    +>>> Word = BitVecSort(16)
    +>>> Byte
    +BitVec(8)
    +>>> x = Const('x', Byte)
    +>>> eq(x, BitVec('x', 8))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BitVecs + + + + ( + + + + + names + + + + , + + + + bv + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a tuple of bit-vector constants of size bv. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 16)
    +>>> x.size()
    +16
    +>>> x.sort()
    +BitVec(16)
    +>>> Sum(x, y, z)
    +x + y + z
    +>>> Product(x, y, z)
    +x*y*z
    +
    +
    +
    +
    +
    +
    +
    +

    + Bit-Vector Overloads + + ¶ + +

    +

    + See the following operator overloads for building bit-vector terms. +Each kind of term can also be built with a builder function below. +

    + +
    +
    +

    + Bit-Vector Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + BV2Int + + + + ( + + + + + a + + + + , + + + + is_signed + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression BV2Int(a). +

    +
    +
    +
    >>> b = BitVec('b', 3)
    +>>> BV2Int(b).sort()
    +Int
    +>>> x = Int('x')
    +>>> x > BV2Int(b)
    +x > BV2Int(b)
    +>>> x > BV2Int(b, is_signed=False)
    +x > BV2Int(b)
    +>>> x > BV2Int(b, is_signed=True)
    +x > If(b < 0, BV2Int(b) - 8, BV2Int(b))
    +>>> solve(x > BV2Int(b), b == 1, x < 3)
    +[b = 1, x = 2]
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Int2BV + + + + ( + + + + + a + + + + , + + + + num_bits + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression Int2BV(a, num_bits). +It is a bit-vector of width num_bits and represents the +modulo of a by 2^num_bits +

    +
    +
    +
    >>> x = Int('x')
    +>>> bv_x = Int2BV(x, 2)
    +>>> bv_x_plus_4 = Int2BV(x + 4, 2)
    +>>> solve([bv_x != bv_x_plus_4])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Concat + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT bit-vector concatenation expression. +

    +
    +
    +
    >>> v = BitVecVal(1, 4)
    +>>> Concat(v, v+1, v)
    +Concat(1, 1 + 1, 1)
    +>>> evaluate(Concat(v, v+1, v))
    +289
    +>>> print("%.3x" % simplify(Concat(v, v+1, v)).as_long())
    +121
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Extract + + + + ( + + + + + high + + + + , + + + + low + + + + , + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT bit-vector extraction expression, or create a string extraction expression. +

    +
    +
    +
    >>> x = BitVec('x', 8)
    +>>> Extract(6, 2, x)
    +Extract(6, 2, x)
    +>>> Extract(6, 2, x).sort()
    +BitVec(5)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ULE + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) + + other <= self + + . +

    +

    + Use the operator <= for signed less than or equal to. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> ULE(x, y)
    +ULE(x, y)
    +>>> (x <= y).sexpr()
    +'(bvsle x y)'
    +>>> ULE(x, y).sexpr()
    +'(bvule x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ULT + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) + + other < self + + . +

    +

    + Use the operator < for signed less than. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> ULT(x, y)
    +ULT(x, y)
    +>>> (x < y).sexpr()
    +'(bvslt x y)'
    +>>> ULT(x, y).sexpr()
    +'(bvult x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + UGE + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) + + other >= self + + . +

    +

    + Use the operator >= for signed greater than or equal to. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> UGE(x, y)
    +UGE(x, y)
    +>>> (x >= y).sexpr()
    +'(bvsge x y)'
    +>>> UGE(x, y).sexpr()
    +'(bvuge x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + UGT + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) + + other > self + + . +

    +

    + Use the operator > for signed greater than. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> UGT(x, y)
    +UGT(x, y)
    +>>> (x > y).sexpr()
    +'(bvsgt x y)'
    +>>> UGT(x, y).sexpr()
    +'(bvugt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SLE + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other <= self + + . +

    +

    + See also the __le__ overload (<= operator) for BitVecRef +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> SLE(x, y).sexpr()
    +'(bvsle x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SLT + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other < self + + . +

    +

    + See also the __lt__ overload (< operator) for BitVecRef +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> SLT(x, y).sexpr()
    +'(bvslt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SGE + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other >= self + + . +

    +

    + See also the __ge__ overload (>= operator) for BitVecRef +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> SGE(x, y).sexpr()
    +'(bvsge x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SGT + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other > self + + . +

    +

    + See also the __gt__ overload (> operator) for BitVecRef +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> SGT(x, y).sexpr()
    +'(bvsgt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + UDiv + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) division + + self / other + + . +

    +

    + Use the operator / for signed division. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> UDiv(x, y)
    +UDiv(x, y)
    +>>> UDiv(x, y).sort()
    +BitVec(32)
    +>>> (x / y).sexpr()
    +'(bvsdiv x y)'
    +>>> UDiv(x, y).sexpr()
    +'(bvudiv x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + URem + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (unsigned) remainder + + self % other + + . +

    +

    + Use the operator % for signed modulus, and SRem() for signed remainder. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> URem(x, y)
    +URem(x, y)
    +>>> URem(x, y).sort()
    +BitVec(32)
    +>>> (x % y).sexpr()
    +'(bvsmod x y)'
    +>>> URem(x, y).sexpr()
    +'(bvurem x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SDiv + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT signed division expression. +

    +

    + See also the __div__ overload (/ operator) for BitVecRef. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> SDiv(x, y)
    +x/y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SMod + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT expression for the signed modulus + + self % other + + . +

    +

    + See also the __mod__ overload (% operator) for BitVecRef. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> SMod(x, y)
    +x%y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SRem + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression signed remainder. +

    +

    + Use the operator % for signed modulus, and URem() for unsigned remainder. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> SRem(x, y)
    +SRem(x, y)
    +>>> SRem(x, y).sort()
    +BitVec(32)
    +>>> (x % y).sexpr()
    +'(bvsmod x y)'
    +>>> SRem(x, y).sexpr()
    +'(bvsrem x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + LShR + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression logical right shift. +

    +

    + Use the operator >> for the arithmetical right shift. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> LShR(x, y)
    +LShR(x, y)
    +>>> (x >> y).sexpr()
    +'(bvashr x y)'
    +>>> LShR(x, y).sexpr()
    +'(bvlshr x y)'
    +>>> BitVecVal(4, 3)
    +4
    +>>> BitVecVal(4, 3).as_signed_long()
    +-4
    +>>> simplify(BitVecVal(4, 3) >> 1).as_signed_long()
    +-2
    +>>> simplify(BitVecVal(4, 3) >> 1)
    +6
    +>>> simplify(LShR(BitVecVal(4, 3), 1))
    +2
    +>>> simplify(BitVecVal(2, 3) >> 1)
    +1
    +>>> simplify(LShR(BitVecVal(2, 3), 1))
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RotateLeft + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Return an expression representing + + a + + rotated to the left + + b + + times. +

    +
    +
    +
    >>> a, b = BitVecs('a b', 16)
    +>>> RotateLeft(a, 10)
    +RotateLeft(a, 10)
    +>>> simplify(RotateLeft(a, 0))
    +a
    +>>> simplify(RotateLeft(a, 16))
    +a
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RotateRight + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Return an expression representing + + a + + rotated to the right + + b + + times. +

    +
    +
    +
    >>> a, b = BitVecs('a b', 16)
    +>>> RotateRight(a, 10)
    +RotateRight(a, 10)
    +>>> simplify(RotateRight(a, 0))
    +a
    +>>> simplify(RotateRight(a, 16))
    +a
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SignExt + + + + ( + + + + + n + + + + , + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return a bit-vector expression with + + n + + extra sign-bits. +

    +
    +
    +
    >>> x = BitVec('x', 16)
    +>>> n = SignExt(8, x)
    +>>> n.size()
    +24
    +>>> n
    +SignExt(8, x)
    +>>> n.sort()
    +BitVec(24)
    +>>> v0 = BitVecVal(2, 2)
    +>>> v0
    +2
    +>>> v0.size()
    +2
    +>>> v  = simplify(SignExt(6, v0))
    +>>> v
    +254
    +>>> v.size()
    +8
    +>>> print("%.x" % v.as_long())
    +fe
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + ZeroExt + + + + ( + + + + + n + + + + , + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return a bit-vector expression with + + n + + extra zero-bits. +

    +
    +
    +
    >>> x = BitVec('x', 16)
    +>>> n = ZeroExt(8, x)
    +>>> n.size()
    +24
    +>>> n
    +ZeroExt(8, x)
    +>>> n.sort()
    +BitVec(24)
    +>>> v0 = BitVecVal(2, 2)
    +>>> v0
    +2
    +>>> v0.size()
    +2
    +>>> v  = simplify(ZeroExt(6, v0))
    +>>> v
    +2
    +>>> v.size()
    +8
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RepeatBitVec + + + + ( + + + + + n + + + + , + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return an expression representing + + n + + copies of + + a + + . +

    +
    +
    +
    >>> x = BitVec('x', 8)
    +>>> n = RepeatBitVec(4, x)
    +>>> n
    +RepeatBitVec(4, x)
    +>>> n.size()
    +32
    +>>> v0 = BitVecVal(10, 4)
    +>>> print("%.x" % v0.as_long())
    +a
    +>>> v = simplify(RepeatBitVec(4, v0))
    +>>> v.size()
    +16
    +>>> print("%.x" % v.as_long())
    +aaaa
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVRedAnd + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return the reduction-and expression of + + a + + . +

    +
    +
    +
    >>> x = BitVec('x', 4)
    +>>> solve([BVRedAnd(x), BVRedOr(~x)])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVRedOr + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return the reduction-or expression of + + a + + . +

    +
    +
    +
    >>> x = BitVec('x', 4)
    +>>> solve([BVRedAnd(x), BVRedOr(~x)])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVAdd + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a sum of bit-vectors. +

    +

    + See also the __add__ overload (+ operator) for BitVecRef. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 32)
    +>>> BVAdd(x, y, z)
    +x + y + z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVMult + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a product of bit-vectors. +

    +

    + See also the __mul__ overload (* operator) for BitVecRef. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 32)
    +>>> BVMult(x, y, z)
    +x*y*z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVSub + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Create a difference of bit-vectors. +

    +

    + See also the __sub__ overload (- operator) for BitVecRef. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> BVSub(x, y)
    +x - y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVOr + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a bit-wise disjunction of bit-vectors. +

    +

    + See also the __or__ overload (| operator) for BitVecRef. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 32)
    +>>> BVOr(x, y, z)
    +x | y | z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVAnd + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a bit-wise conjunction of bit-vectors. +

    +

    + See also the __and__ overload (& operator) for BitVecRef. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 32)
    +>>> BVAnd(x, y, z)
    +x & y & z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVXor + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create a bit-wise exclusive disjunction of bit-vectors. +

    +

    + See also the __xor__ overload (^ operator) for BitVecRef. +

    +
    +
    +
    >>> x, y, z = BitVecs('x y z', 32)
    +>>> BVXor(x, y, z)
    +x ^ y ^ z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVNeg + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Create a negation (two’s complement) of a bit-vector +

    +

    + See also the __neg__ overload (unary - operator) for BitVecRef. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> BVNeg(x)
    +-x
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BVNot + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Create a bitwise not of a bit-vector +

    +

    + See also the __invert__ overload (unary ~ operator) for BitVecRef. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> BVNot(x)
    +~x
    +
    +
    +
    +
    +
    +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_bv_sort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Return True if + + s + + is an SMT bit-vector sort. +

    +
    +
    +
    >>> is_bv_sort(BitVecSort(32))
    +True
    +>>> is_bv_sort(IntSort())
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_bv + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT bit-vector expression. +

    +
    +
    +
    >>> b = BitVec('b', 32)
    +>>> is_bv(b)
    +True
    +>>> is_bv(b + 10)
    +True
    +>>> is_bv(Int('x'))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_bv_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT bit-vector numeral value. +

    +
    +
    +
    >>> b = BitVec('b', 32)
    +>>> is_bv_value(b)
    +False
    +>>> b = BitVecVal(10, 32)
    +>>> b
    +10
    +>>> is_bv_value(b)
    +True
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + BitVecSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Bit-vector sort. +

    +
    +
    + + + cast + + + + ( + + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Try to cast + + val + + as a Bit-Vector. +

    +
    +
    +
    >>> b = BitVecSort(32)
    +>>> b.cast(10)
    +10
    +>>> b.cast(10).sexpr()
    +'#b00000000000000000000000000001010'
    +
    +
    +
    +
    +
    +
    +
    + + + size + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the size (number of bits) of the bit-vector sort + + self + + . +

    +
    +
    +
    >>> b = BitVecSort(32)
    +>>> b.size()
    +32
    +
    +
    +
    +
    +
    +
    +
    + + + subsort + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a subsort of + + other + + . +

    +
    +
    +
    >>> IntSort().subsort(RealSort())
    +True
    +>>> BoolSort().subsort(RealSort())
    +True
    +>>> SetSort(BitVecSort(2)).subsort(SetSort(IntSort()))
    +False
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + BitVecRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Bit-vector expressions. +

    +
    +
    + + + __add__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self + other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x + y
    +x + y
    +>>> (x + y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + __and__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-and + + self & other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x & y
    +x & y
    +>>> (x & y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + __div__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) division + + self / other + + . +

    +

    + Use the function UDiv() for unsigned division. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x / y
    +x/y
    +>>> (x / y).sort()
    +BitVec(32)
    +>>> (x / y).sexpr()
    +'(bvsdiv x y)'
    +>>> UDiv(x, y).sexpr()
    +'(bvudiv x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __ge__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other >= self + + . +

    +

    + Use the function UGE() for unsigned greater than or equal to. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x >= y
    +x >= y
    +>>> (x >= y).sexpr()
    +'(bvsge x y)'
    +>>> UGE(x, y).sexpr()
    +'(bvuge x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __gt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other > self + + . +

    +

    + Use the function UGT() for unsigned greater than. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x > y
    +x > y
    +>>> (x > y).sexpr()
    +'(bvsgt x y)'
    +>>> UGT(x, y).sexpr()
    +'(bvugt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __invert__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-not + + ~self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> ~x
    +~x
    +>>> solve([~(~x) != x])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + __le__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other <= self + + . +

    +

    + Use the function ULE() for unsigned less than or equal to. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x <= y
    +x <= y
    +>>> (x <= y).sexpr()
    +'(bvsle x y)'
    +>>> ULE(x, y).sexpr()
    +'(bvule x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __lshift__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression left shift + + self << other + +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x << y
    +x << y
    +>>> (x << y).sexpr()
    +'(bvshl x y)'
    +>>> evaluate(BitVecVal(2, 3) << 1)
    +4
    +
    +
    +
    +
    +
    +
    +
    + + + __lt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) + + other < self + + . +

    +

    + Use the function ULT() for unsigned less than. +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x < y
    +x < y
    +>>> (x < y).sexpr()
    +'(bvslt x y)'
    +>>> ULT(x, y).sexpr()
    +'(bvult x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __mod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) mod + + self % other + + . +

    +

    + Use the function URem() for unsigned remainder, and SRem() for signed remainder. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x % y
    +x%y
    +>>> (x % y).sort()
    +BitVec(32)
    +>>> (x % y).sexpr()
    +'(bvsmod x y)'
    +>>> URem(x, y).sexpr()
    +'(bvurem x y)'
    +>>> SRem(x, y).sexpr()
    +'(bvsrem x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + __mul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self * other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x * y
    +x*y
    +>>> (x * y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + __neg__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an expression representing + + -self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> -x
    +-x
    +>>> solve([-(-x) != x])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + __or__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-or + + self | other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x | y
    +x | y
    +>>> (x | y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + __pos__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> +x
    +x
    +
    +
    +
    +
    +
    +
    +
    + + + __radd__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other + self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 + x
    +10 + x
    +
    +
    +
    +
    +
    +
    +
    + + + __rand__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-or + + other & self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 & x
    +10 & x
    +
    +
    +
    +
    +
    +
    +
    + + + __rdiv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) division + + other / self + + . +

    +

    + Use the function UDiv() for unsigned division. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 / x
    +10/x
    +>>> (10 / x).sexpr()
    +'(bvsdiv #b00000000000000000000000000001010 x)'
    +>>> UDiv(10, x).sexpr()
    +'(bvudiv #b00000000000000000000000000001010 x)'
    +
    +
    +
    +
    +
    +
    +
    + + + __rlshift__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression left shift + + other << self + + . +

    +

    + Use the function LShR() for the right logical shift +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 << x
    +10 << x
    +>>> (10 << x).sexpr()
    +'(bvshl #b00000000000000000000000000001010 x)'
    +
    +
    +
    +
    +
    +
    +
    + + + __rmod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) mod + + other % self + + . +

    +

    + Use the function URem() for unsigned remainder, and SRem() for signed remainder. +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 % x
    +10%x
    +>>> (10 % x).sexpr()
    +'(bvsmod #b00000000000000000000000000001010 x)'
    +>>> URem(10, x).sexpr()
    +'(bvurem #b00000000000000000000000000001010 x)'
    +>>> SRem(10, x).sexpr()
    +'(bvsrem #b00000000000000000000000000001010 x)'
    +
    +
    +
    +
    +
    +
    +
    + + + __rmul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other * self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 * x
    +10*x
    +
    +
    +
    +
    +
    +
    +
    + + + __ror__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-or + + other | self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 | x
    +10 | x
    +
    +
    +
    +
    +
    +
    +
    + + + __rrshift__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (arithmetical) right shift + + other + + >> + + self + + . +

    +

    + Use the function LShR() for the right logical shift +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 >> x
    +10 >> x
    +>>> (10 >> x).sexpr()
    +'(bvashr #b00000000000000000000000000001010 x)'
    +
    +
    +
    +
    +
    +
    +
    + + + __rshift__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (arithmetical) right shift + + self >> other + +

    +

    + Use the function LShR() for the right logical shift +

    +
    +
    +
    >>> x, y = BitVecs('x y', 32)
    +>>> x >> y
    +x >> y
    +>>> (x >> y).sexpr()
    +'(bvashr x y)'
    +>>> LShR(x, y).sexpr()
    +'(bvlshr x y)'
    +>>> BitVecVal(4, 3)
    +4
    +>>> BitVecVal(4, 3).as_signed_long()
    +-4
    +>>> evaluate(BitVecVal(4, 3) >> 1).as_signed_long()
    +-2
    +>>> evaluate(BitVecVal(4, 3) >> 1)
    +6
    +>>> evaluate(LShR(BitVecVal(4, 3), 1))
    +2
    +>>> evaluate(BitVecVal(2, 3) >> 1)
    +1
    +>>> evaluate(LShR(BitVecVal(2, 3), 1))
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + __rsub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other - self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 - x
    +10 - x
    +
    +
    +
    +
    +
    +
    +
    + + + __rtruediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) division + + other / self + + . +

    +
    +
    +
    +
    + + + __rxor__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-xor + + other ^ self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> 10 ^ x
    +10 ^ x
    +
    +
    +
    +
    +
    +
    +
    + + + __sub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self - other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x - y
    +x - y
    +>>> (x - y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + __truediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression (signed) division + + self / other + + . +

    +
    +
    +
    +
    + + + __xor__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression bitwise-xor + + self ^ other + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> y = BitVec('y', 32)
    +>>> x ^ y
    +x ^ y
    +>>> (x ^ y).sort()
    +BitVec(32)
    +
    +
    +
    +
    +
    +
    +
    + + + size + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of bits of the bit-vector expression + + self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> (x + 1).size()
    +32
    +>>> Concat(x, x).size()
    +64
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the bit-vector expression + + self + + . +

    +
    +
    +
    >>> x = BitVec('x', 32)
    +>>> x.sort()
    +BitVec(32)
    +>>> x.sort() == BitVecSort(32)
    +True
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + BitVecNumRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Bit-vector values. +

    +
    +
    + + + as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT bit-vector numeral as a Python long (bignum) numeral. +

    +
    +
    +
    >>> v = BitVecVal(0xbadc0de, 32)
    +>>> v
    +195936478
    +>>> print("0x%.8x" % v.as_long())
    +0x0badc0de
    +
    +
    +
    +
    +
    +
    +
    + + + as_signed_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an SMT bit-vector numeral as a Python long (bignum) numeral. +The most significant bit is assumed to be the sign. +

    +
    +
    +
    >>> BitVecVal(4, 3).as_signed_long()
    +-4
    +>>> BitVecVal(7, 3).as_signed_long()
    +-1
    +>>> BitVecVal(3, 3).as_signed_long()
    +3
    +>>> BitVecVal(2**32 - 1, 32).as_signed_long()
    +-1
    +>>> BitVecVal(2**64 - 1, 64).as_signed_long()
    +-1
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/boolean.html b/cvc5-1.0.2/api/python/pythonic/boolean.html new file mode 100644 index 0000000..b2db1d1 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/boolean.html @@ -0,0 +1,4589 @@ + + + + + + + + Core & Booleans — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Core & Booleans + + ¶ + +

    +
    +

    + Basic Boolean Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Bool + + + + ( + + + + + name + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a Boolean constant named + + name + + . If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> q = Bool('q')
    +>>> And(p, q)
    +And(p, q)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BoolVal + + + + ( + + + + + val + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return the Boolean value + + True + + or + + False + + . If + + ctx=None + + , then the +global context is used. +

    +
    +
    +
    >>> BoolVal(True)
    +True
    +>>> is_true(BoolVal(True))
    +True
    +>>> is_true(True)
    +False
    +>>> is_false(BoolVal(False))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BoolSort + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return the Boolean SMT sort. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> BoolSort()
    +Bool
    +>>> p = Const('p', BoolSort())
    +>>> is_bool(p)
    +True
    +>>> r = Function('r', IntSort(), IntSort(), BoolSort())
    +>>> r(0, 1)
    +r(0, 1)
    +>>> is_bool(r(0, 1))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FreshBool + + + + ( + + + + + prefix + + + + + = + + + + + 'b' + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a fresh Boolean constant in the given context using the given prefix. +

    +

    + If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> b1 = FreshBool()
    +>>> b2 = FreshBool()
    +>>> eq(b1, b2)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Bools + + + + ( + + + + + names + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a tuple of Boolean constants. +

    +

    + + names + + is a single string containing all names separated by blank spaces. +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> p, q, r = Bools('p q r')
    +>>> And(p, Or(q, r))
    +And(p, Or(q, r))
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + BoolVector + + + + ( + + + + + prefix + + + + , + + + + sz + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a list of Boolean constants of size + + sz + + . +

    +

    + The constants are named using the given prefix. +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> P = BoolVector('p', 3)
    +>>> P
    +[p__0, p__1, p__2]
    +>>> And(P)
    +And(p__0, p__1, p__2)
    +
    +
    +
    +
    +
    +
    +
    +

    + Basic Generic Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + Const + + + + ( + + + + + name + + + + , + + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Create a constant of the given sort. +

    +
    +
    +
    >>> Const('x', IntSort())
    +x
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Consts + + + + ( + + + + + names + + + + , + + + + sort + + + + + ) + + + ¶ + +
    +
    +

    + Create several constants of the given sort. +

    +

    + + names + + is a string containing the names of all constants to be created. +Blank spaces separate the names of different constants. +

    +
    +
    +
    >>> x, y, z = Consts('x y z', IntSort())
    +>>> x + y + z
    +x + y + z
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FreshConst + + + + ( + + + + + sort + + + + , + + + + prefix + + + + + = + + + + + 'c' + + + + + ) + + + ¶ + +
    +
    +

    + Create a fresh constant of a specified sort +

    +
    +
    +
    >>> x = FreshConst(BoolSort(), prefix="test")
    +>>> y = FreshConst(BoolSort(), prefix="test")
    +>>> x.eq(y)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Function + + + + ( + + + + + name + + + + , + + + + * + + + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a new SMT uninterpreted function with the given sorts. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> f(f(0))
    +f(f(0))
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FreshFunction + + + + ( + + + + + * + + + + + sig + + + + + ) + + + ¶ + +
    +
    +

    + Create a new fresh SMT uninterpreted function with the given sorts. +

    +
    +
    +
    >>> f = FreshFunction(IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> solve([f(x) != f(x)])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    +

    + Boolean Operators + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + And + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT and-expression or and-probe. +

    +
    +
    +
    >>> p, q, r = Bools('p q r')
    +>>> And(p, q, r)
    +And(p, q, r)
    +>>> And(p, q, r, main_ctx())
    +And(p, q, r)
    +>>> P = BoolVector('p', 5)
    +>>> And(P)
    +And(p__0, p__1, p__2, p__3, p__4)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Or + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT or-expression or or-probe. +

    +
    +
    +
    >>> p, q, r = Bools('p q r')
    +>>> Or(p, q, r)
    +Or(p, q, r)
    +>>> Or(p, q, r, main_ctx())
    +Or(p, q, r)
    +>>> P = BoolVector('p', 5)
    +>>> Or(P)
    +Or(p__0, p__1, p__2, p__3, p__4)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Not + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT not expression or probe. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> Not(Not(p))
    +Not(Not(p))
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + mk_not + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Negate a boolean expression. +Strips a negation if one is already present +

    +
    +
    +
    >>> x = Bool('x')
    +>>> mk_not(x)
    +Not(x)
    +>>> mk_not(mk_not(x))
    +x
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Implies + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT implies expression. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> Implies(p, q)
    +Implies(p, q)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Xor + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT Xor expression. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> Xor(p, q)
    +Xor(p, q)
    +
    +
    +
    +
    +
    +
    +
    +

    + Generic Operators + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + If + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + c + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT if-then-else expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> max = If(x > y, x, y)
    +>>> max
    +If(x > y, x, y)
    +>>> If(True, 1, 0, main_ctx())
    +If(True, 1, 0)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Distinct + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT distinct expression. +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> Distinct(x, y)
    +x != y
    +>>> z = Int('z')
    +>>> Distinct(x, y, z)
    +Distinct(x, y, z)
    +
    +
    +
    +
    +
    +
    +

    + Equality + + ¶ + +

    +

    + See + + + + cvc5.pythonic.ExprRef.__eq__() + + + + and + + + + cvc5.pythonic.ExprRef.__ne__() + + + + for building equality and disequality terms. +

    +
    +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_bool + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT Boolean expression. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> is_bool(p)
    +True
    +>>> q = Bool('q')
    +>>> is_bool(And(p, q))
    +True
    +>>> x = Real('x')
    +>>> is_bool(x)
    +False
    +>>> is_bool(x == 0)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_bool_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an integer value of sort Int. +

    +
    +
    +
    >>> is_bool_value(IntVal(1))
    +False
    +>>> is_bool_value(Bool('x'))
    +False
    +>>> is_bool_value(BoolVal(False))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_true + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is the SMT true expression. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> is_true(p)
    +False
    +>>> x = Real('x')
    +>>> is_true(x == 0)
    +False
    +>>> # True is a Python Boolean expression
    +>>> is_true(True)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_false + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is the SMT false expression. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> is_false(p)
    +False
    +>>> is_false(False)
    +False
    +>>> is_false(BoolVal(False))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_and + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT and expression. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> is_and(And(p, q))
    +True
    +>>> is_and(Or(p, q))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_or + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT or expression. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> is_or(Or(p, q))
    +True
    +>>> is_or(And(p, q))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_implies + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT implication expression. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> is_implies(Implies(p, q))
    +True
    +>>> is_implies(And(p, q))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_not + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT not expression. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> is_not(p)
    +False
    +>>> is_not(Not(p))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_eq + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT equality expression. +

    +
    +
    +
    >>> x, y = Ints('x y')
    +>>> is_eq(x == y)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_distinct + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT distinct expression. +

    +
    +
    +
    >>> x, y, z = Ints('x y z')
    +>>> is_distinct(x == y)
    +False
    +>>> is_distinct(Distinct(x, y, z))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_const + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is SMT constant/variable expression. +

    +
    +
    + These include: +
    +
    +
      +
    • +

      + concrete (i.e. literal, or non-symbolic) values +

      +
    • +
    • +

      + declared constants +

      +
    • +
    +
    +
    + These do not include: +
    +
    +
      +
    • +

      + bound variables +

      +
    • +
    • +

      + quantified formulae +

      +
    • +
    • +

      + applied operators +

      +
    • +
    +
    +
    +
    +
    +
    >>> a = Int('a')
    +>>> is_const(a)
    +True
    +>>> is_const(a + 1)
    +False
    +>>> is_const(1)
    +False
    +>>> is_const(IntVal(1))
    +True
    +>>> x = Int('x')
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_func_decl + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT function declaration. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> is_func_decl(f)
    +True
    +>>> x = Real('x')
    +>>> is_func_decl(x)
    +False
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ExprRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Constraints, formulas and terms are expressions. +

    +
    +
    + + + __bool__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Convert this expression to a python boolean. +

    +

    + Produces +* the appropriate value for a BoolVal. +* whether structural equality holds for an EQ-node +

    +
    +
    +
    >>> bool(BoolVal(True))
    +True
    +>>> bool(BoolVal(False))
    +False
    +>>> bool(BoolVal(False) == BoolVal(False))
    +True
    +>>> try:
    +...   bool(Int('y'))
    +... except SMTException as ex:
    +...   print("failed: %s" % ex)
    +failed: Symbolic expressions cannot be cast to concrete Boolean values.
    +
    +
    +
    +
    +
    +
    +
    + + + __eq__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT expression that represents the constraint + + self == other + + . +

    +

    + If + + other + + is + + None + + , then this method simply returns + + False + + . +

    +
    +
    +
    >>> a = Int('a')
    +>>> b = Int('b')
    +>>> a == b
    +a == b
    +>>> a is None
    +False
    +>>> a == None
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + __hash__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Hash code. +

    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __ne__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return an SMT expression that represents the constraint + + self != other + + . +

    +

    + If + + other + + is + + None + + , then this method simply returns + + True + + . +

    +
    +
    +
    >>> a = Int('a')
    +>>> b = Int('b')
    +>>> a != b
    +a != b
    +>>> a is not None
    +True
    +>>> a != None
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + __nonzero__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Convert this expression to a python boolean. See __bool__. +

    +
    +
    +
    >>> (BoolVal(False) == BoolVal(False)).__nonzero__()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return repr(self). +

    +
    +
    +
    +
    + + + __str__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return str(self). +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    + + + arg + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + Return argument + + idx + + of the application + + self + + . +

    +

    + This method assumes that + + self + + is a function application with at least + + idx+1 + + arguments. +

    +
    +
    +
    >>> a = Int('a')
    +>>> b = Int('b')
    +>>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort())
    +>>> t = f(a, b, 0)
    +>>> t.arg(0)
    +a
    +>>> t.arg(1)
    +b
    +>>> t.arg(2)
    +0
    +
    +
    +
    +
    +
    +
    +
    + + + as_ast + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a pointer to the underlying Term object. +

    +
    +
    +
    +
    + + + children + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a list containing the children of the given expression +

    +
    +
    +
    >>> a = Int('a')
    +>>> b = Int('b')
    +>>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort())
    +>>> t = f(a, b, 0)
    +>>> t.children()
    +[a, b, 0]
    +
    +
    +
    +
    +
    +
    +
    + + + decl + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the SMT function declaration associated with an SMT application. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> a = Int('a')
    +>>> t = f(a)
    +>>> eq(t.decl(), f)
    +True
    +>>> try:
    +...   Int('y').decl()
    +... except SMTException as ex:
    +...   print("failed: %s" % ex)
    +failed: Declarations for non-function applications
    +
    +
    +
    +
    +
    +
    +
    + + + eq + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + and + + other + + are structurally identical. +

    +
    +
    +
    >>> x = Int('x')
    +>>> n1 = x + 1
    +>>> n2 = 1 + x
    +>>> n1.eq(n2)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + get_id + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return unique identifier for object. +It can be used for hash-tables and maps. +

    +
    +
    +
    >>> BoolVal(True).get_id() == BoolVal(True).get_id()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + hash + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a hashcode for the + + self + + . +

    +
    +
    +
    >>> n1 = Int('x') + 1
    +>>> n2 = Int('x') + 1
    +>>> n1.hash() == n2.hash()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is of the sort Integer. +

    +
    +
    +
    >>> x = Int('x')
    +>>> x.is_int()
    +True
    +>>> (x + 1).is_int()
    +True
    +>>> x = Real('x')
    +>>> x.is_int()
    +False
    +>>> Set('x', IntSort()).is_int()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + kind + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the Kind of this term +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> a = Int('a')
    +>>> t = f(a)
    +>>> t.kind() == Kind.APPLY_UF
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + num_args + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of arguments of an SMT application. +

    +
    +
    +
    >>> a = Int('a')
    +>>> b = Int('b')
    +>>> (a + b).num_args()
    +2
    +>>> f = Function('f', IntSort(), IntSort(), IntSort(), IntSort())
    +>>> t = f(a, b, 0)
    +>>> t.num_args()
    +3
    +
    +
    +
    +
    +
    +
    +
    + + + sexpr + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a string representing the AST node in s-expression notation. +

    +
    +
    +
    >>> x = Int('x')
    +>>> ((x + 1)*x).sexpr()
    +'(* (+ x 1) x)'
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of expression + + self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> (x + 1).sort()
    +Int
    +>>> y = Real('y')
    +>>> (x + y).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + SortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + A Sort is essentially a type. Every term has a sort +

    +
    +
    + + + __eq__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self==value. +

    +
    +
    +
    +
    + + + __hash__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Hash code. +

    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __ne__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + and + + other + + are not the same SMT sort. +

    +
    +
    +
    >>> p = Bool('p')
    +>>> p.sort() != BoolSort()
    +False
    +>>> p.sort() != IntSort()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + A pretty-printed representation of this sort. +

    +
    +
    +
    >>> repr(IntSort())
    +'Int'
    +
    +
    +
    +
    +
    +
    +
    + + + __str__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + A pretty-printed representation of this sort. +

    +
    +
    +
    >>> str(IntSort())
    +'Int'
    +
    +
    +
    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    + + + as_ast + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a pointer to the underlying Sort object. +

    +
    +
    +
    +
    + + + cast + + + + ( + + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Try to cast + + val + + as an element of sort + + self + + . +

    +

    + This method is used in SMT to convert Python objects such as integers, +floats, longs and strings into SMT expressions. +

    +
    +
    +
    >>> x = Int('x')
    +>>> RealSort().cast(x)
    +ToReal(x)
    +
    +
    +
    +
    +
    +
    +
    + + + eq + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + and + + other + + are structurally identical. +

    +
    +
    +
    >>> x = Int('x')
    +>>> n1 = x + 1
    +>>> n2 = 1 + x
    +>>> n1.eq(n2)
    +False
    +>>> n1.eq(x + 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + hash + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a hashcode for the + + self + + . +

    +
    +
    +
    >>> n1 = IntSort()
    +>>> n2 = RealSort()
    +>>> n1.hash() == n2.hash()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Subclasses override +

    +
    +
    +
    >>> SetSort(IntSort()).is_int()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + name + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the name (string) of sort + + self + + . +

    +
    +
    +
    >>> BoolSort().name()
    +'Bool'
    +>>> ArraySort(IntSort(), IntSort()).name()
    +'(Array Int Int)'
    +
    +
    +
    +
    +
    +
    +
    + + + sexpr + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a string representing the AST node in s-expression notation. +

    +
    +
    +
    >>> IntSort().sexpr()
    +'Int'
    +
    +
    +
    +
    +
    +
    +
    + + + subsort + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a subsort of + + other + + . +

    +
    +
    +
    >>> IntSort().subsort(RealSort())
    +True
    +>>> BoolSort().subsort(RealSort())
    +True
    +>>> SetSort(BitVecSort(2)).subsort(SetSort(IntSort()))
    +False
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + BoolRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + All Boolean expressions are instances of this class. +

    +
    +
    + + + __mul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self * other + + . +

    +
    +
    +
    >>> x = Real("x")
    +>>> BoolVal(True) * x
    +If(True, x, 0)
    +
    +
    +
    +
    +
    +
    +
    + + + __rmul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    >>> x = Real("x")
    +>>> x * BoolVal(True)
    +If(True, x, 0)
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of expression + + self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> (x + 1).sort()
    +Int
    +>>> y = Real('y')
    +>>> (x + y).sort()
    +Real
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + BoolSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Boolean sort. +

    +
    +
    + + + cast + + + + ( + + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Try to cast + + val + + as a Boolean. +

    +
    +
    +
    >>> x = BoolSort().cast(True)
    +>>> x
    +True
    +>>> is_expr(x)
    +True
    +>>> is_expr(True)
    +False
    +>>> x.sort()
    +Bool
    +>>> try:
    +...   BoolSort().cast(Int('y'))
    +... except SMTException as ex:
    +...   print("failed")
    +failed
    +>>> try:
    +...   BoolSort().cast(1)
    +... except SMTException as ex:
    +...   print("failed")
    +failed
    +
    +
    +
    +
    +
    +
    +
    + + + is_bool + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is of the sort Boolean. +

    +
    +
    +
    >>> x = BoolSort()
    +>>> x.is_bool()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + is_int + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is of the sort Integer. +

    +
    +
    +
    >>> x = IntSort()
    +>>> x.is_int()
    +True
    +>>> x = RealSort()
    +>>> x.is_int()
    +False
    +>>> x = BoolSort()
    +>>> x.is_int()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + subsort + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a subsort of + + other + + . +

    +
    +
    +
    >>> IntSort().subsort(RealSort())
    +True
    +>>> BoolSort().subsort(RealSort())
    +True
    +>>> SetSort(BitVecSort(2)).subsort(SetSort(IntSort()))
    +False
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + FuncDeclRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Function declaration. +Every constant and function have an associated declaration. +

    +

    + The declaration assigns a name, a sort (i.e., type), and for function +the sort (i.e., type) of each of its arguments. Note that, in SMT, +a constant is a function with 0 arguments. +

    +
    +
    + + + __call__ + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create an SMT application expression using the function + + self + + , +and the given arguments. +

    +

    + The arguments must be SMT expressions. This method assumes that +the sorts of the elements in + + args + + match the sorts of the +domain. Limited coercion is supported. For example, if +args[0] is a Python integer, and the function expects a SMT +integer, then the argument is automatically converted into a +SMT integer. +

    +
    +
    +
    >>> f = Function('f', IntSort(), RealSort(), BoolSort())
    +>>> x = Int('x')
    +>>> y = Real('y')
    +>>> f(x, y)
    +f(x, y)
    +>>> f(x, x)
    +f(x, ToReal(x))
    +
    +
    +
    +
    +
    +
    +
    + + + arity + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of arguments of a function declaration. +If + + self + + is a constant, then + + self.arity() + + is 0. +

    +
    +
    +
    >>> f = Function('f', IntSort(), RealSort(), BoolSort())
    +>>> f.arity()
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + domain + + + + ( + + + + + i + + + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the argument + + i + + of a function declaration. +This method assumes that + + 0 <= i < self.arity() + + . +

    +
    +
    +
    >>> f = Function('f', IntSort(), RealSort(), BoolSort())
    +>>> f.domain(0)
    +Int
    +>>> f.domain(1)
    +Real
    +
    +
    +
    +
    +
    +
    +
    + + + name + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the name of the function declaration + + self + + . +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> f.name()
    +'f'
    +>>> isinstance(f.name(), str)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the range of a function declaration. +For constants, this is the sort of the constant. +

    +
    +
    +
    >>> f = Function('f', IntSort(), RealSort(), BoolSort())
    +>>> f.range()
    +Bool
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/dt.html b/cvc5-1.0.2/api/python/pythonic/dt.html new file mode 100644 index 0000000..7d0c964 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/dt.html @@ -0,0 +1,2469 @@ + + + + + + + + Datatypes — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Datatypes + + ¶ + +

    +
    +

    + Overview + + ¶ + +

    +

    + To manipulate instances of a datatype, one must first + + declare + + the datatype itself. +Declaration happens in three phases. Let’s consider declaring a cons-list of +integers. +

    +

    + First, we initialize the datatype with its + + name + +

    +
    +
    +
    >>> IntList = Datatype('IntList')
    +
    +
    +
    +

    + Second, we declare constructors for the datatype, giving the + + constructor name + + and + + field names and sorts + + . Here is the empty list constructor: +

    +
    +
    +
    >>> IntList.declare('nil', ())
    +
    +
    +
    +

    + Here is the cons constructor: +

    +
    +
    +
    >>> IntList.declare('cons', ('val', IntSort()), ('tail', IntList))
    +
    +
    +
    +

    + Third, after all constructors are declared, we can + + create + + the datatype, +finishing its declaration. +

    +
    +
    +
    >>> IntList = IntList.create()
    +
    +
    +
    +

    + Now, one has access to a number of tools for interacting with integer lists. +

    +
      +
    • +

      + + + IntList.nil + + + refers to the SMT term that is an empty list, +and + + + IntList.cons + + + refers to the cons constructor. +

      +
    • +
    • +

      + + + IntList.is_nil + + + and + + + IntList.is_cons + + + are testors (a.k.a., +recognizers) for those constructors. +

      +
    • +
    • +

      + + + IntList.val + + + and + + + IntList.tail + + + are selectors (a.k.a. accessors) +for the cons constructor. +

      +
    • +
    +

    + If constructor, accessor, or selector names are ambiguous (e.g., if different +constructors have selectors of the same name), then see the methods on + + + + cvc5.pythonic.DatatypeSortRef + + + + to unambiguously access a specific +function. +

    +

    + To create mutually recursive datatypes, see + + + + cvc5.pythonic.CreateDatatypes() + + + + . +

    +

    + To create a codataype (e.g., a possibly infinite stream of integers), pass the + + + isCoDatatype=True + + + argument to the + + + + cvc5.pythonic.Datatype + + + + constructor. +

    +
    +
    +
    >>> IntStream = Datatype('IntStream', isCoDatatype=True)
    +
    +
    +
    +
    +
    +

    + Declaration Utilities + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + CreateDatatypes + + + + ( + + + + + * + + + + + ds + + + + + ) + + + ¶ + +
    +
    +

    + Create mutually recursive SMT datatypes using 1 or more Datatype helper objects. +In the following example we define a Tree-List using two mutually recursive datatypes. +

    +
    +
    +
    >>> TreeList = Datatype('TreeList')
    +>>> Tree     = Datatype('Tree')
    +>>> # Tree has two constructors: leaf and node
    +>>> Tree.declare('leaf', ('val', IntSort()))
    +>>> # a node contains a list of trees
    +>>> Tree.declare('node', ('children', TreeList))
    +>>> TreeList.declare('nil')
    +>>> TreeList.declare('cons', ('car', Tree), ('cdr', TreeList))
    +>>> Tree, TreeList = CreateDatatypes(Tree, TreeList)
    +>>> Tree.val(Tree.leaf(10))
    +val(leaf(10))
    +>>> simplify(Tree.val(Tree.leaf(10)))
    +10
    +>>> l1 = TreeList.cons(Tree.leaf(10), TreeList.cons(Tree.leaf(20), TreeList.nil))
    +>>> n1 = Tree.node(TreeList.cons(Tree.leaf(10), TreeList.cons(Tree.leaf(20), TreeList.nil)))
    +>>> n1
    +node(cons(leaf(10), cons(leaf(20), nil)))
    +>>> n2 = Tree.node(TreeList.cons(n1, TreeList.nil))
    +>>> simplify(n2 == n1)
    +False
    +>>> simplify(TreeList.car(Tree.children(n2)) == n1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + TupleSort + + + + ( + + + + + name + + + + , + + + + sorts + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a named tuple sort base on a set of underlying sorts +

    +

    + Returns the tuple datatype, its constructor, and a list of accessors, in order. +

    +
    +
    +
    >>> pair, mk_pair, (first, second) = TupleSort("pair", [IntSort(), BoolSort()])
    +>>> b = Bool('b')
    +>>> i = Int('i')
    +>>> p = mk_pair(i, b)
    +>>> p
    +pair(i, b)
    +>>> solve([b != second(p)])
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + DisjointSum + + + + ( + + + + + name + + + + , + + + + sorts + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a named tagged union sort base on a set of underlying sorts. +

    +

    + See + + this page <https://en.wikipedia.org/wiki/Tagged_union> + + for +information about tagged unions. +

    +

    + Returns the created datatype and a tuple of (injector, extractor) pairs for +the different variants. +

    +
    +
    +
    >>> sum, ((inject0, extract0), (inject1, extract1)) = DisjointSum("+", [IntSort(), BoolSort()])
    +>>> b = Bool('b')
    +>>> i, j = Ints('i j')
    +>>> solve([inject0(i) == inject1(b)])
    +no solution
    +>>> solve([inject0(i) == inject0(j), extract0(inject0(i)) == 5])
    +[i = 5, j = 5]
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + Datatype + + + + ( + + + + + name + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + isCoDatatype + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Helper class for declaring datatypes. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> # List is now a declaration
    +>>> List.nil
    +nil
    +>>> List.cons(10, List.nil)
    +cons(10, nil)
    +>>> List.cons(10, List.nil).sort()
    +List
    +>>> cons = List.cons
    +>>> nil  = List.nil
    +>>> car  = List.car
    +>>> cdr  = List.cdr
    +>>> n = cons(1, cons(0, nil))
    +>>> n
    +cons(1, cons(0, nil))
    +>>> simplify(cdr(n))
    +cons(0, nil)
    +>>> simplify(car(n))
    +1
    +
    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + name + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + isCoDatatype + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return repr(self). +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    + + + create + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Create an SMT datatype based on the constructors declared using the method + + declare() + + . +The function + + CreateDatatypes() + + must be used to define mutually recursive datatypes. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.nil
    +nil
    +>>> List.cons(10, List.nil)
    +cons(10, nil)
    +>>> Stream = Datatype('Stream', isCoDatatype=True)
    +>>> Stream.declare('cons', ('car', IntSort()), ('cdr', Stream))
    +>>> Stream.declare('nil')
    +>>> Stream = Stream.create()
    +>>> a = Const('a', Stream)
    +>>> b = Const('b', Stream)
    +>>> s = Solver()
    +>>> s += a == Stream.cons(0, a)
    +>>> s.check()
    +sat
    +>>> s = Solver()
    +>>> s += a == Stream.cons(0, a)
    +>>> s += b == Stream.cons(0, b)
    +>>> s += a != b
    +>>> s.check()
    +unsat
    +
    +
    +
    +
    +
    +
    +
    + + + declare + + + + ( + + + + + name + + + + , + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Declare constructor named + + name + + with the given accessors + + args + + . +Each accessor is a pair + + (name, sort) + + , where + + name + + is a string and + + sort + + an SMT sort +or a reference to the datatypes being declared. +In the following example + + List.declare(‘cons’, (‘car’, IntSort()), (‘cdr’, List)) + + declares the constructor named + + cons + + that builds a new List using an integer and a List. +It also declares the accessors + + car + + and + + cdr + + . The accessor + + car + + extracts the integer +of a + + cons + + cell, and + + cdr + + the list of a + + cons + + cell. After all constructors were declared, +we use the method create() to create the actual datatype in SMT. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + DatatypeSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Datatype sorts. +

    +
    +
    + + + __init__ + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + accessor + + + + ( + + + + + i + + + + , + + + + j + + + + + ) + + + ¶ + +
    +
    +

    + In SMT, each constructor has 0 or more accessor. +The number of accessors is equal to the arity of the constructor. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0)
    +cons
    +>>> num_accs = List.constructor(0).arity()
    +>>> num_accs
    +2
    +>>> List.accessor(0, 0)
    +car
    +>>> List.accessor(0, 1)
    +cdr
    +>>> List.constructor(1)
    +nil
    +>>> num_accs = List.constructor(1).arity()
    +>>> num_accs
    +0
    +
    +
    +
    +
    +
    +
    +
    + + + constructor + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + Return a constructor of the datatype + + self + + . +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> # List is now a declaration
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0)
    +cons
    +>>> List.constructor(1)
    +nil
    +
    +
    +
    +
    +
    +
    +
    + + + num_constructors + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of constructors in the given datatype. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> # List is now a declaration
    +>>> List.num_constructors()
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + recognizer + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + In SMT, each constructor has an associated recognizer predicate. +If the constructor is named + + name + + , then the recognizer + + is_name + + . +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> # List is now a SMT declaration
    +>>> List.num_constructors()
    +2
    +>>> List.recognizer(0)
    +is_cons
    +>>> List.recognizer(1)
    +is_nil
    +>>> simplify(List.is_nil(List.cons(10, List.nil)))
    +False
    +>>> simplify(List.is_cons(List.cons(10, List.nil)))
    +True
    +>>> l = Const('l', List)
    +>>> simplify(List.is_cons(l))
    +is_cons(l)
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + DatatypeConstructorRef + + + + ( + + + + + datatype + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    + + + __call__ + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Apply this constructor. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0)(1, List.nil)
    +cons(1, nil)
    +
    +
    +
    +

    + The arguments must be SMT expressions. This method assumes that +the sorts of the elements in + + args + + match the sorts of the +domain. Limited coercion is supported. For example, if +args[0] is a Python integer, and the function expects a SMT +integer, then the argument is automatically converted into a +SMT integer. +

    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + datatype + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + arity + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of arguments of a constructor. +

    +

    + The number of accessors is equal to the arity of the constructor. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0).arity()
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + domain + + + + ( + + + + + i + + + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the argument + + i + + of a constructor. +This method assumes that + + 0 <= i < self.arity() + + . +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0).domain(0)
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the range of a function declaration. +For constants, this is the sort of the constant. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> List.num_constructors()
    +2
    +>>> List.constructor(0).range()
    +List
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + DatatypeSelectorRef + + + + ( + + + + + datatype + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    + + + __call__ + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Apply this selector. +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> l = List.cons(1, List.nil)
    +>>> solve([1 != List.car(l)])
    +no solution
    +
    +
    +
    +

    + The arguments must be SMT expressions. This method assumes that +the sorts of the elements in + + args + + match the sorts of the +domain. Limited coercion is supported. For example, if +args[0] is a Python integer, and the function expects a SMT +integer, then the argument is automatically converted into a +SMT integer. +

    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + datatype + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + arity + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of arguments of a selector (always 1). +

    +
    +
    +
    +
    + + + domain + + + + ( + + + + + i + + + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the argument + + i + + of a selector. +This method assumes that + + 0 <= i < self.arity() + + . +

    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the range of a function declaration. +For constants, this is the sort of the constant. +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + DatatypeRecognizerRef + + + + ( + + + + + constructor + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    + + + __call__ + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Apply this tester (a.k.a., recognizer). +

    +
    +
    +
    >>> List = Datatype('List')
    +>>> List.declare('cons', ('car', IntSort()), ('cdr', List))
    +>>> List.declare('nil')
    +>>> List = List.create()
    +>>> l = List.cons(1, List.nil)
    +>>> solve([List.is_nil(l)])
    +no solution
    +
    +
    +
    +

    + The arguments must be SMT expressions. This method assumes that +the sorts of the elements in + + args + + match the sorts of the +domain. Limited coercion is supported. For example, if +args[0] is a Python integer, and the function expects a SMT +integer, then the argument is automatically converted into a +SMT integer. +

    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + constructor + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + r + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + arity + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of arguments of a selector (always 1). +

    +
    +
    +
    +
    + + + domain + + + + ( + + + + + i + + + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the argument + + i + + of a selector. +This method assumes that + + 0 <= i < self.arity() + + . +

    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the range of a function declaration. +For constants, this is the sort of the constant. +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + DatatypeRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Datatype expressions. +

    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the datatype sort of the datatype expression + + self + + . +

    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/fp.html b/cvc5-1.0.2/api/python/pythonic/fp.html new file mode 100644 index 0000000..a89ac56 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/fp.html @@ -0,0 +1,6993 @@ + + + + + + + + Floating Point — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Floating Point + + ¶ + +

    +
    +

    + Basic FP Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + FP + + + + ( + + + + + name + + + + , + + + + fpsort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a floating-point constant named + + name + + . + + fpsort + + is the floating-point sort. +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> x  = FP('x', FPSort(8, 24))
    +>>> is_fp(x)
    +True
    +>>> x.ebits()
    +8
    +>>> x.sort()
    +FPSort(8, 24)
    +>>> word = FPSort(8, 24)
    +>>> x2 = FP('x', word)
    +>>> eq(x, x2)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FPs + + + + ( + + + + + names + + + + , + + + + fpsort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return an array of floating-point constants. +

    +
    +
    +
    >>> x, y, z = FPs('x y z', FPSort(8, 24))
    +>>> x.sort()
    +FPSort(8, 24)
    +>>> x.sbits()
    +24
    +>>> x.ebits()
    +8
    +>>> fpMul(RNE(), fpAdd(RNE(), x, y), z)
    +fpMul(RNE(), fpAdd(RNE(), x, y), z)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FPVal + + + + ( + + + + + val + + + + , + + + + exp + + + + + = + + + + + None + + + + , + + + + fps + + + + + = + + + + + None + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a floating-point value of value + + val + + and sort + + fps + + . +If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> v = FPVal(20.0, FPSort(8, 24))
    +>>> v
    +1.25*(2**4)
    +>>> print("0x%.8x" % v.exponent_as_long())
    +0x00000004
    +>>> v = FPVal(2.25, FPSort(8, 24))
    +>>> v
    +1.125*(2**1)
    +>>> v = FPVal(-2.25, FPSort(8, 24))
    +>>> v
    +-1.125*(2**1)
    +>>> FPVal(-0.0, FPSort(8, 24))
    +-0.0
    +>>> FPVal(0.0, FPSort(8, 24))
    ++0.0
    +>>> FPVal(+0.0, FPSort(8, 24))
    ++0.0
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpNaN + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point NaN term. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> set_fpa_pretty(True)
    +>>> fpNaN(s)
    +NaN
    +>>> pb = get_fpa_pretty()
    +>>> set_fpa_pretty(False)
    +>>> fpNaN(s)
    +fpNaN(FPSort(8, 24))
    +>>> set_fpa_pretty(pb)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpPlusInfinity + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point +oo term. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> pb = get_fpa_pretty()
    +>>> set_fpa_pretty(True)
    +>>> fpPlusInfinity(s)
    ++oo
    +>>> set_fpa_pretty(False)
    +>>> fpPlusInfinity(s)
    +fpPlusInfinity(FPSort(8, 24))
    +>>> set_fpa_pretty(pb)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpMinusInfinity + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point -oo term. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpInfinity + + + + ( + + + + + s + + + + , + + + + negative + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point +oo or -oo term. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpPlusZero + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point +0.0 term. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpMinusZero + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point -0.0 term. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpZero + + + + ( + + + + + s + + + + , + + + + negative + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point +0.0 or -0.0 term. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FPSort + + + + ( + + + + + ebits + + + + , + + + + sbits + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a SMT floating-point sort of the given sizes. If + + ctx=None + + , then the global context is used. +

    +
    +
    +
    >>> Single = FPSort(8, 24)
    +>>> Double = FPSort(11, 53)
    +>>> Single
    +FPSort(8, 24)
    +>>> x = Const('x', Single)
    +>>> eq(x, FP('x', FPSort(8, 24)))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Float16 + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 16-bit (half) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FloatHalf + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 16-bit (half) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Float32 + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 32-bit (single) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FloatSingle + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 32-bit (single) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Float64 + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 64-bit (double) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FloatDouble + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 64-bit (double) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Float128 + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 128-bit (quadruple) sort. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FloatQuadruple + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point 128-bit (quadruple) sort. +

    +
    +
    +
    +
    +

    + FP Operators + + ¶ + +

    +

    + See the following operator overloads for building basic floating-point terms: +

    + +
    +
    + + + cvc5.pythonic. + + + + + fpAbs + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point absolute value expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FPVal(1.0, s)
    +>>> fpAbs(x)
    +fpAbs(1)
    +>>> y = FPVal(-20.0, s)
    +>>> y
    +-1.25*(2**4)
    +>>> fpAbs(y)
    +fpAbs(-1.25*(2**4))
    +>>> fpAbs(-1.25*(2**4))
    +fpAbs(-1.25*(2**4))
    +>>> fpAbs(x).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpNeg + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point addition expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> fpNeg(x)
    +-x
    +>>> fpNeg(x).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpAdd + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point addition expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpAdd(rm, x, y)
    +fpAdd(RNE(), x, y)
    +>>> fpAdd(RTZ(), x, y) # default rounding mode is RTZ
    +x + y
    +>>> fpAdd(rm, x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpSub + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point subtraction expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpSub(rm, x, y)
    +fpSub(RNE(), x, y)
    +>>> fpSub(rm, x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpMul + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point multiplication expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpMul(rm, x, y)
    +fpMul(RNE(), x, y)
    +>>> fpMul(rm, x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpDiv + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point division expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpDiv(rm, x, y)
    +fpDiv(RNE(), x, y)
    +>>> fpDiv(rm, x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpRem + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point remainder expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpRem(x, y)
    +fpRem(x, y)
    +>>> fpRem(x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpMin + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point minimum expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpMin(x, y)
    +fpMin(x, y)
    +>>> fpMin(x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpMax + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point maximum expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> rm = RNE()
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpMax(x, y)
    +fpMax(x, y)
    +>>> fpMax(x, y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpFMA + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + b + + + + , + + + + c + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point fused multiply-add expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpSqrt + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point square root expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpRoundToIntegral + + + + ( + + + + + rm + + + + , + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point roundToIntegral expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsNaN + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isNaN expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> x = FP('x', s)
    +>>> y = FP('y', s)
    +>>> fpIsNaN(x)
    +fpIsNaN(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsInf + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isInfinite expression. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> x = FP('x', s)
    +>>> fpIsInf(x)
    +fpIsInf(x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsZero + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isZero expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsNormal + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isNormal expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsSubnormal + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isSubnormal expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsNegative + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isNegative expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpIsPositive + + + + ( + + + + + a + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point isPositive expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpLT + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + other < self + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpLT(x, y)
    +x < y
    +>>> (x < y).sexpr()
    +'(fp.lt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpLEQ + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + other <= self + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpLEQ(x, y)
    +x <= y
    +>>> (x <= y).sexpr()
    +'(fp.leq x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpGT + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + other > self + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpGT(x, y)
    +x > y
    +>>> (x > y).sexpr()
    +'(fp.gt x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpGEQ + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + other >= self + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpGEQ(x, y)
    +x >= y
    +>>> (x >= y).sexpr()
    +'(fp.geq x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpEQ + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + fpEQ(other, self) + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpEQ(x, y)
    +fpEQ(x, y)
    +>>> fpEQ(x, y).sexpr()
    +'(fp.eq x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpNEQ + + + + ( + + + + + a + + + + , + + + + b + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point expression + + Not(fpEQ(other, self)) + + . +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpNEQ(x, y)
    +Not(fpEQ(x, y))
    +>>> (x != y).sexpr()
    +'(distinct x y)'
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpFP + + + + ( + + + + + sgn + + + + , + + + + exp + + + + , + + + + sig + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT floating-point value + + fpFP(sgn, sig, exp) + + from the three bit-vectors sgn, sig, and exp. +

    +
    +
    +
    >>> s = FPSort(8, 24)
    +>>> x = fpFP(BitVecVal(1, 1), BitVecVal(2**7-1, 8), BitVecVal(2**22, 23))
    +>>> print(x)
    +fpToFP(Concat(1, 127, 4194304))
    +>>> xv = FPVal(-1.5, s)
    +>>> print(xv)
    +-1.5
    +>>> slvr = Solver()
    +>>> slvr.add(fpEQ(x, xv))
    +>>> slvr.check()
    +sat
    +>>> xv = FPVal(+1.5, s)
    +>>> print(xv)
    +1.5
    +>>> slvr = Solver()
    +>>> slvr.add(fpEQ(x, xv))
    +>>> slvr.check()
    +unsat
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpToFP + + + + ( + + + + + a1 + + + + , + + + + a2 + + + + + = + + + + + None + + + + , + + + + a3 + + + + + = + + + + + None + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression from other term sorts +to floating-point. +

    +

    + From a floating-point term with different precision: +

    +
    +
    +
    >>> x = FPVal(1.0, Float32())
    +>>> x_db = fpToFP(RNE(), x, Float64())
    +>>> x_db.sort()
    +FPSort(11, 53)
    +
    +
    +
    +

    + From a real term: +

    +
    +
    +
    >>> x_r = RealVal(1.5)
    +>>> simplify(fpToFP(RNE(), x_r, Float32()))
    +1.5
    +
    +
    +
    +

    + From a signed bit-vector term: +

    +
    +
    +
    >>> x_signed = BitVecVal(-5, BitVecSort(32))
    +>>> simplify(fpToFP(RNE(), x_signed, Float32()))
    +-1.25*(2**2)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpBVToFP + + + + ( + + + + + v + + + + , + + + + sort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression that represents the +conversion from a bit-vector term to a floating-point term. +

    +
    +
    +
    >>> x_bv = BitVecVal(0x3F800000, 32)
    +>>> x_fp = fpBVToFP(x_bv, Float32())
    +>>> x_fp
    +fpToFP(1065353216)
    +>>> simplify(x_fp)
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpFPToFP + + + + ( + + + + + rm + + + + , + + + + v + + + + , + + + + sort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression that represents the +conversion from a floating-point term to a floating-point term of different precision. +

    +
    +
    +
    >>> x_sgl = FPVal(1.0, Float32())
    +>>> x_dbl = fpFPToFP(RNE(), x_sgl, Float64())
    +>>> x_dbl
    +fpToFP(RNE(), 1)
    +>>> simplify(x_dbl)
    +1
    +>>> x_dbl.sort()
    +FPSort(11, 53)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpRealToFP + + + + ( + + + + + rm + + + + , + + + + v + + + + , + + + + sort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression that represents the +conversion from a real term to a floating-point term. +

    +
    +
    +
    >>> x_r = RealVal(1.5)
    +>>> x_fp = fpRealToFP(RNE(), x_r, Float32())
    +>>> x_fp
    +fpToFP(RNE(), 3/2)
    +>>> simplify(x_fp)
    +1.5
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpSignedToFP + + + + ( + + + + + rm + + + + , + + + + v + + + + , + + + + sort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression that represents the +conversion from a signed bit-vector term (encoding an integer) to a floating-point term. +

    +
    +
    +
    >>> x_signed = BitVecVal(-5, BitVecSort(32))
    +>>> x_fp = fpSignedToFP(RNE(), x_signed, Float32())
    +>>> x_fp
    +fpToFP(RNE(), 4294967291)
    +>>> simplify(x_fp)
    +-1.25*(2**2)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpUnsignedToFP + + + + ( + + + + + rm + + + + , + + + + v + + + + , + + + + sort + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression that represents the +conversion from an unsigned bit-vector term (encoding an integer) to a floating-point term. +

    +
    +
    +
    >>> x_signed = BitVecVal(-5, BitVecSort(32))
    +>>> x_fp = fpUnsignedToFP(RNE(), x_signed, Float32())
    +>>> x_fp
    +fpToFP(RNE(), 4294967291)
    +>>> simplify(x_fp)
    +1*(2**32)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpToFPUnsigned + + + + ( + + + + + rm + + + + , + + + + x + + + + , + + + + s + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression, from unsigned bit-vector to floating-point expression. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpToSBV + + + + ( + + + + + rm + + + + , + + + + x + + + + , + + + + s + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression, from floating-point expression to signed bit-vector. +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = fpToSBV(RTZ(), x, BitVecSort(32))
    +>>> print(is_fp(x))
    +True
    +>>> print(is_bv(y))
    +True
    +>>> print(is_fp(y))
    +False
    +>>> print(is_bv(x))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpToUBV + + + + ( + + + + + rm + + + + , + + + + x + + + + , + + + + s + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression, from floating-point expression to unsigned bit-vector. +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = fpToUBV(RTZ(), x, BitVecSort(32))
    +>>> print(is_fp(x))
    +True
    +>>> print(is_bv(y))
    +True
    +>>> print(is_fp(y))
    +False
    +>>> print(is_bv(x))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + fpToReal + + + + ( + + + + + x + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a SMT floating-point conversion expression, from floating-point expression to real. +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = fpToReal(x)
    +>>> print(is_fp(x))
    +True
    +>>> print(is_real(y))
    +True
    +>>> print(is_fp(y))
    +False
    +>>> print(is_real(x))
    +False
    +
    +
    +
    +
    +
    +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_fp_sort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Return True if + + s + + is a SMT floating-point sort. +

    +
    +
    +
    >>> is_fp_sort(FPSort(8, 24))
    +True
    +>>> is_fp_sort(IntSort())
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_fp + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a SMT floating-point expression. +

    +
    +
    +
    >>> b = FP('b', FPSort(8, 24))
    +>>> is_fp(b)
    +True
    +>>> is_fp(b + 1.0)
    +True
    +>>> is_fp(Int('x'))
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_fp_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a SMT floating-point numeral value. +

    +
    +
    +
    >>> b = FP('b', FPSort(8, 24))
    +>>> is_fp_value(b)
    +False
    +>>> b = FPVal(1.0, FPSort(8, 24))
    +>>> b
    +1
    +>>> is_fp_value(b)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_fprm_sort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Return True if + + s + + is a SMT floating-point rounding mode sort. +

    +
    +
    +
    >>> is_fprm_sort(FPSort(8, 24))
    +False
    +>>> is_fprm_sort(RNE().sort())
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_fprm + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a SMT floating-point rounding mode expression. +

    +
    +
    +
    >>> rm = RNE()
    +>>> is_fprm(rm)
    +True
    +>>> rm = 1.0
    +>>> is_fprm(rm)
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_fprm_value + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is a SMT floating-point rounding mode numeral value. +

    +
    +
    +
    +
    +

    + FP Rounding Modes + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + RoundNearestTiesToEven + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round to nearest, with ties broken towards even. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RoundNearestTiesToEven(), x, y)
    +fpMul(RNE(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RNE + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round to nearest, with ties broken towards even. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RNE(), x, y)
    +fpMul(RNE(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RoundNearestTiesToAway + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round to nearest, with ties broken away from zero. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RoundNearestTiesToAway(), x, y)
    +fpMul(RNA(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RNA + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round to nearest, with ties broken away from zero. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RNA(), x, y)
    +fpMul(RNA(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RoundTowardPositive + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards more positive values. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RoundTowardPositive(), x, y)
    +fpMul(RTP(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RTP + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards more positive values. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RTP(), x, y)
    +fpMul(RTP(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RoundTowardNegative + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards more negative values. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RoundTowardNegative(), x, y)
    +fpMul(RTN(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RTN + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards more negative values. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RTN(), x, y)
    +fpMul(RTN(), x, y)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RoundTowardZero + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards zero. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RoundTowardZero(), x, y)
    +x * y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + RTZ + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Round towards zero. +

    +

    + See + + Section 4.2 of the IEEE standard <https://doi.org/10.1109/IEEESTD.2019.8766229> + + or + + wikipedia <https://en.wikipedia.org/wiki/Floating-point_arithmetic#Rounding_modes> + + for details on rounding modes. +

    +
    +
    +
    >>> x, y = FPs('x y', FPSort(8, 24))
    +>>> fpMul(RTZ(), x, y)
    +x * y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + get_default_rounding_mode + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Retrieves the global default rounding mode. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + set_default_rounding_mode + + + + ( + + + + + rm + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Set the default rounding mode +

    +
    +
    +
    >>> x, y = FPs('x y', Float32())
    +>>> set_default_rounding_mode(RTN())
    +>>> sum1 = x + y
    +>>> set_default_rounding_mode(RTP())
    +>>> sum2 = x + y
    +>>> print((sum1 == sum2).sexpr())
    +(= (fp.add roundTowardNegative x y) (fp.add roundTowardPositive x y))
    +>>> s = SolverFor("QF_FP")
    +>>> s += sum1 != sum2
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> assert str(m[sum1]) != str(m[sum2])
    +
    +
    +
    +

    + Note the the FP term builders can take an explicit rounding mode. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + get_default_fp_sort + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + set_default_fp_sort + + + + ( + + + + + ebits + + + + , + + + + sbits + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + FPSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point sort. +

    +
    +
    + + + cast + + + + ( + + + + + val + + + + + ) + + + ¶ + +
    +
    +

    + Try to cast + + val + + as a floating-point expression. +>>> b = FPSort(8, 24) +>>> b.cast(1.0) +1 +>>> b.cast(1.0).sexpr() +‘(fp #b0 #b01111111 #b00000000000000000000000)’ +

    +
    +
    +
    +
    + + + ebits + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Retrieves the number of bits reserved for the exponent in the FloatingPoint sort + + self + + . +>>> b = FPSort(8, 24) +>>> b.ebits() +8 +

    +
    +
    +
    +
    + + + sbits + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Retrieves the number of bits reserved for the significand in the FloatingPoint sort + + self + + . +>>> b = FPSort(8, 24) +>>> b.sbits() +24 +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + FPRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point expressions. +

    +
    +
    + + + __add__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self + other + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x + y
    +x + y
    +>>> (x + y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + __div__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self / other + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x / y
    +x / y
    +>>> (x / y).sort()
    +FPSort(8, 24)
    +>>> 10 / y
    +1.25*(2**3) / y
    +
    +
    +
    +
    +
    +
    +
    + + + __ge__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self>=value. +

    +
    +
    +
    +
    + + + __gt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self>value. +

    +
    +
    +
    +
    + + + __le__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self<=value. +

    +
    +
    +
    +
    + + + __lt__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self<value. +

    +
    +
    +
    +
    + + + __mod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression mod + + self % other + + . +

    +
    +
    +
    +
    + + + __mul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self * other + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x * y
    +x * y
    +>>> (x * y).sort()
    +FPSort(8, 24)
    +>>> 10 * y
    +1.25*(2**3) * y
    +
    +
    +
    +
    +
    +
    +
    + + + __neg__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + -self + + . +

    +
    +
    +
    >>> x = FP('x', Float32())
    +>>> -x
    +-x
    +
    +
    +
    +
    +
    +
    +
    + + + __pos__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + +self + + . +

    +
    +
    +
    +
    + + + __radd__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other + self + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> 10 + x
    +1.25*(2**3) + x
    +
    +
    +
    +
    +
    +
    +
    + + + __rdiv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other / self + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x / y
    +x / y
    +>>> x / 10
    +x / 1.25*(2**3)
    +
    +
    +
    +
    +
    +
    +
    + + + __rmod__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression mod + + other % self + + . +

    +
    +
    +
    +
    + + + __rmul__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other * self + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x * y
    +x * y
    +>>> x * 10
    +x * 1.25*(2**3)
    +
    +
    +
    +
    +
    +
    +
    + + + __rsub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + other - self + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> 10 - x
    +1.25*(2**3) - x
    +
    +
    +
    +
    +
    +
    +
    + + + __rtruediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression division + + other / self + + . +

    +
    +
    +
    +
    + + + __sub__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression + + self - other + + . +

    +
    +
    +
    >>> x = FP('x', FPSort(8, 24))
    +>>> y = FP('y', FPSort(8, 24))
    +>>> x - y
    +x - y
    +>>> (x - y).sort()
    +FPSort(8, 24)
    +
    +
    +
    +
    +
    +
    +
    + + + __truediv__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Create the SMT expression division + + self / other + + . +

    +
    +
    +
    +
    + + + as_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a SMT floating point expression as a Python string. +

    +
    +
    +
    +
    + + + ebits + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Retrieves the number of bits reserved for the exponent in the FloatingPoint expression + + self + + . +>>> b = FPSort(8, 24) +>>> b.ebits() +8 +

    +
    +
    +
    +
    + + + sbits + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Retrieves the number of bits reserved for the exponent in the FloatingPoint expression + + self + + . +>>> b = FPSort(8, 24) +>>> b.sbits() +24 +

    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the sort of the floating-point expression + + self + + . +

    +
    +
    +
    >>> x = FP('1.0', FPSort(8, 24))
    +>>> x.sort()
    +FPSort(8, 24)
    +>>> x.sort() == FPSort(8, 24)
    +True
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + FPNumRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +
    +
    + + + as_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + The string representation of the numeral. +

    +
    +
    +
    >>> x = FPVal(20, FPSort(8, 24))
    +>>> print(x.as_string())
    +1.25*(2**4)
    +
    +
    +
    +
    +
    +
    +
    + + + exponent + + + + ( + + + + + biased + + + + + = + + + + + True + + + + + ) + + + ¶ + +
    +
    +

    + The exponent of the numeral. +

    +
    +
    +
    >>> x = FPVal(2.5, FPSort(8, 24))
    +>>> x.exponent()
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + exponent_as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + The exponent of the numeral as a long. +

    +
    +
    +
    >>> x = FPVal(2.5, FPSort(8, 24))
    +>>> x.exponent_as_long()
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + isInf + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is +oo or -oo. +

    +
    +
    +
    +
    + + + isNaN + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is a NaN. +

    +
    +
    +
    +
    + + + isNegative + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is negative. +

    +
    +
    +
    +
    + + + isNormal + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is normal. +

    +
    +
    +
    +
    + + + isPositive + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is positive. +

    +
    +
    +
    +
    + + + isSubnormal + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is subnormal. +

    +
    +
    +
    +
    + + + isZero + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Indicates whether the numeral is +zero or -zero. +

    +
    +
    +
    +
    + + + sign + + + + ( + + + ) + + + ¶ + +
    +
    +

    + The sign of the numeral. +

    +
    +
    +
    >>> x = FPVal(+1.0, FPSort(8, 24))
    +>>> x.sign()
    +False
    +>>> x = FPVal(-1.0, FPSort(8, 24))
    +>>> x.sign()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + significand + + + + ( + + + ) + + + ¶ + +
    +
    +

    + The significand of the numeral, as a double +

    +
    +
    +
    >>> x = FPVal(2.5, FPSort(8, 24))
    +>>> x.significand()
    +1.25
    +
    +
    +
    +
    +
    +
    +
    + + + significand_as_long + + + + ( + + + ) + + + ¶ + +
    +
    +

    + The significand of the numeral as a long. +

    +

    + This is missing the 1 +

    +
    +
    +
    >>> x = FPVal(2.5, FPSort(8, 24))
    +>>> x.significand_as_long()
    +2097152
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + FPRMRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Floating-point rounding mode expressions +

    +
    +
    + + + as_string + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a SMT floating point expression as a Python string. +

    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/internals.html b/cvc5-1.0.2/api/python/pythonic/internals.html new file mode 100644 index 0000000..2e3d786 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/internals.html @@ -0,0 +1,719 @@ + + + + + + + + Internals — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Internals + + ¶ + +

    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_expr + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT expression. +

    +
    +
    +
    >>> a = Int('a')
    +>>> is_expr(a)
    +True
    +>>> is_expr(a + 1)
    +True
    +>>> is_expr(IntSort())
    +False
    +>>> is_expr(1)
    +False
    +>>> is_expr(IntVal(1))
    +True
    +>>> x = Int('x')
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_sort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + s + + is an SMT sort. +

    +
    +
    +
    >>> is_sort(IntSort())
    +True
    +>>> is_sort(Int('x'))
    +False
    +>>> is_expr(Int('x'))
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_app + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT function application. +

    +

    + Note that, constants are function applications with 0 arguments. +

    +
    +
    +
    >>> a = Int('a')
    +>>> is_app(a)
    +True
    +>>> is_app(a + 1)
    +True
    +>>> is_app(IntSort())
    +False
    +>>> is_app(1)
    +False
    +>>> is_app(IntVal(1))
    +True
    +>>> x = Int('x')
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_app_of + + + + ( + + + + + a + + + + , + + + + k + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an application of the given kind + + k + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> n = x + 1
    +>>> is_app_of(n, Kind.ADD)
    +True
    +>>> is_app_of(n, Kind.MULT)
    +False
    +
    +
    +
    +
    +
    +
    +
    +

    + Exceptions + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + SMTException + + + + ( + + + + + value + + + + + ) + + + ¶ + +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + value + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __str__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return str(self). +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/pythonic.html b/cvc5-1.0.2/api/python/pythonic/pythonic.html new file mode 100644 index 0000000..1504669 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/pythonic.html @@ -0,0 +1,695 @@ + + + + + + + + Pythonic API — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Pythonic API + + ¶ + +

    +

    + This API is missing some features from cvc5 and Z3Py. +

    +

    + It does not (currently) support these cvc5 features: +

    +
      +
    • +

      + The theories of strings, sequences and bags +

      +
    • +
    • +

      + unsatisfiable cores +

      +
    • +
    • +

      + syntax-guided synthesis (SyGuS) +

      +
    • +
    +

    + It does not (currently) support the following features of Z3Py: +

    +
      +
    • +

      + Patterns for quantifier instantiation +

      +
    • +
    • +

      + Pseudo-boolean counting constraints: AtMost, AtLeast, … +

      +
    • +
    • +

      + Special relation classes: PartialOrder, LinearOrder, … +

      +
    • +
    • +

      + HTML integration +

      +
    • +
    • +

      + Hooks for user-defined propagation and probing +

      +
    • +
    • +

      + Fixedpoint API +

      +
    • +
    • +

      + Finite domains +

      +
    • +
    • +

      + SMT2 file parsing +

      +
    • +
    + +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/quant.html b/cvc5-1.0.2/api/python/pythonic/quant.html new file mode 100644 index 0000000..8345620 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/quant.html @@ -0,0 +1,1099 @@ + + + + + + + + Quantifiers — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Quantifiers + + ¶ + +

    +
    +

    + Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + ForAll + + + + ( + + + + + vs + + + + , + + + + body + + + + + ) + + + ¶ + +
    +
    +

    + Create a forall formula. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> y = Int('y')
    +>>> ForAll([x, y], f(x, y) >= x)
    +ForAll([x, y], f(x, y) >= x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Exists + + + + ( + + + + + vs + + + + , + + + + body + + + + + ) + + + ¶ + +
    +
    +

    + Create a exists formula. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> y = Int('y')
    +>>> q = Exists([x, y], f(x, y) >= x)
    +>>> q
    +Exists([x, y], f(x, y) >= x)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Lambda + + + + ( + + + + + vs + + + + , + + + + body + + + + + ) + + + ¶ + +
    +
    +

    + Create a lambda expression. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort(), IntSort())
    +>>> mem0 = Array('mem0', IntSort(), IntSort())
    +>>> lo, hi, e, i = Ints('lo hi e i')
    +>>> mem1 = Lambda([i], If(And(lo <= i, i <= hi), e, mem0[i]))
    +>>> mem1
    +Lambda(i, If(And(lo <= i, i <= hi), e, mem0[i]))
    +
    +
    +
    +
    +
    +
    +
    +

    + Testers + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + is_var + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is bound variable. +

    +
    +
    +
    >>> x = Int('x')
    +>>> is_var(x)
    +False
    +>>> is_const(x)
    +True
    +>>> is_var(BoolSort())
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + is_quantifier + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + a + + is an SMT quantifier, including lambda expressions. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = ForAll(x, f(x) == 0)
    +>>> p = Lambda(x, f(x) == 0)
    +>>> is_quantifier(q)
    +True
    +>>> is_quantifier(p)
    +True
    +>>> is_quantifier(f(x))
    +False
    +
    +
    +
    +
    +
    +
    +
    +

    + Classes + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + QuantifierRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Universally and Existentially quantified formulas. +

    +
    +
    + + + as_ast + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a pointer to the underlying Term object. +

    +
    +
    +
    +
    + + + body + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the expression being quantified. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = ForAll(x, f(x) == 0)
    +>>> q.body()
    +f(x) == 0
    +
    +
    +
    +
    +
    +
    +
    + + + children + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a list containing a single element self.body() +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = ForAll(x, f(x) == 0)
    +>>> q.children()
    +[f(x) == 0]
    +
    +
    +
    +
    +
    +
    +
    + + + is_exists + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is an existential quantifier. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = ForAll(x, f(x) == 0)
    +>>> q.is_exists()
    +False
    +>>> q = Exists(x, f(x) != 0)
    +>>> q.is_exists()
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + is_forall + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a universal quantifier. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = ForAll(x, f(x) == 0)
    +>>> q.is_forall()
    +True
    +>>> q = Exists(x, f(x) != 0)
    +>>> q.is_forall()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + is_lambda + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return + + True + + if + + self + + is a lambda expression. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> q = Lambda(x, f(x))
    +>>> q.is_lambda()
    +True
    +>>> q = Exists(x, f(x) != 0)
    +>>> q.is_lambda()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + num_vars + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of variables bounded by this quantifier. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> y = Int('y')
    +>>> q = ForAll([x, y], f(x, y) >= x)
    +>>> q.num_vars()
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the Boolean sort +

    +
    +
    +
    +
    + + + var_name + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + Return a string representing a name used when displaying the quantifier. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> y = Int('y')
    +>>> q = ForAll([x, y], f(x, y) >= x)
    +>>> q.var_name(0)
    +'x'
    +>>> q.var_name(1)
    +'y'
    +
    +
    +
    +
    +
    +
    +
    + + + var_sort + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + Return the sort of a bound variable. +

    +
    +
    +
    >>> f = Function('f', IntSort(), RealSort(), IntSort())
    +>>> x = Int('x')
    +>>> y = Real('y')
    +>>> q = ForAll([x, y], f(x, y) >= x)
    +>>> q.var_sort(0)
    +Int
    +>>> q.var_sort(1)
    +Real
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/quickstart.html b/cvc5-1.0.2/api/python/pythonic/quickstart.html new file mode 100644 index 0000000..b4abc21 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/quickstart.html @@ -0,0 +1,1301 @@ + + + + + + + + Quickstart Guide — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Quickstart Guide + + ¶ + +

    +

    + First, we create two constants + + + x + + + and + + + y + + + of sort + + + Real + + + , +and two constants + + + a + + + and + + + b + + + of sort + + + Integer + + + . +Notice that these are + + symbolic + + constants, but not actual values. +

    +
    +
    +
    x, y = Reals('x y')
    +a, b = Ints('a b')
    +
    +
    +
    +

    + We define the following constraints regarding + + + x + + + and + + + y + + + : +

    +
    + \[(0 < x) \wedge (0 < y) \wedge (x + y < 1) \wedge (x \leq y)\] +
    +

    + We check whether there is a solution to these constraints: +

    +
    +
    +
    solve(0 < x, 0 < y, x + y < 1, x <= y)
    +
    +
    +
    +

    + In this case, there is, so we get output: +

    +
    +
    +
    [x = 1/6, y = 1/6]
    +
    +
    +
    +

    + We can also get an explicit model (assignment) for the constraints. +

    +
    +
    +
    s = Solver()
    +s.add(0 < x, 0 < y, x + y < 1, x <= y)
    +assert sat == s.check()
    +m = s.model()
    +
    +
    +
    +

    + With the model, we can evaluate variables and terms: +

    +
    +
    +
    print('x:', m[x])
    +print('y:', m[y])
    +print('x - y:', m[x - y])
    +
    +
    +
    +

    + This will print: +

    +
    +
    +
    x: 1/6
    +y: 1/6
    +x - y: 0
    +
    +
    +
    +

    + We can also get these values in other forms: +

    +
    +
    +
    print('string x:', str(m[x]))
    +print('decimal x:', m[x].as_decimal(4))
    +print('fraction x:', m[x].as_fraction())
    +print('float x:', float(m[x].as_fraction()))
    +
    +
    +
    +

    + Next, we assert the same assertions as above, but with integers. +This time, there is no solution, so “no solution” is printed. +

    +
    +
    +
    solve(0 < a, 0 < b, a + b < 1, a <= b)
    +
    +
    +
    +
    +

    + Example + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/python/quickstart.py + +

    +
    +
    +
      1 #!/usr/bin/env python
    +  2 ###############################################################################
    +  3 # Top contributors (to current version):
    +  4 #   Yoni Zohar, Aina Niemetz, Alex Ozdemir
    +  5 #
    +  6 # This file is part of the cvc5 project.
    +  7 #
    +  8 # Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  9 # in the top-level source directory and their institutional affiliations.
    + 10 # All rights reserved.  See the file COPYING in the top-level source
    + 11 # directory for licensing information.
    + 12 # #############################################################################
    + 13 #
    + 14 # A simple demonstration of the api capabilities of cvc5, adapted from quickstart.cpp
    + 15 ##
    + 16 
    + 17 import cvc5
    + 18 from cvc5 import Kind
    + 19 
    + 20 if __name__ == "__main__":
    + 21   # Create a solver
    + 22   #! [docs-python-quickstart-1 start]
    + 23   solver = cvc5.Solver()
    + 24   #! [docs-python-quickstart-1 end]
    + 25 
    + 26   # We will ask the solver to produce models and unsat cores,
    + 27   # hence these options should be turned on.
    + 28   #! [docs-python-quickstart-2 start]
    + 29   solver.setOption("produce-models", "true");
    + 30   solver.setOption("produce-unsat-cores", "true");
    + 31   #! [docs-python-quickstart-2 end]
    + 32 
    + 33   # The simplest way to set a logic for the solver is to choose "ALL".
    + 34   # This enables all logics in the solver.
    + 35   # Alternatively, "QF_ALL" enables all logics without quantifiers.
    + 36   # To optimize the solver's behavior for a more specific logic,
    + 37   # use the logic name, e.g. "QF_BV" or "QF_AUFBV".
    + 38 
    + 39   # Set the logic
    + 40   #! [docs-python-quickstart-3 start]
    + 41   solver.setLogic("ALL");
    + 42   #! [docs-python-quickstart-3 end]
    + 43 
    + 44   # In this example, we will define constraints over reals and integers.
    + 45   # Hence, we first obtain the corresponding sorts.
    + 46   #! [docs-python-quickstart-4 start]
    + 47   realSort = solver.getRealSort();
    + 48   intSort = solver.getIntegerSort();
    + 49   #! [docs-python-quickstart-4 end]
    + 50 
    + 51   # x and y will be real variables, while a and b will be integer variables.
    + 52   # Formally, their python type is Term,
    + 53   # and they are called "constants" in SMT jargon:
    + 54   #! [docs-python-quickstart-5 start]
    + 55   x = solver.mkConst(realSort, "x");
    + 56   y = solver.mkConst(realSort, "y");
    + 57   a = solver.mkConst(intSort, "a");
    + 58   b = solver.mkConst(intSort, "b");
    + 59   #! [docs-python-quickstart-5 end]
    + 60 
    + 61   # Our constraints regarding x and y will be:
    + 62   #
    + 63   #   (1)  0 < x
    + 64   #   (2)  0 < y
    + 65   #   (3)  x + y < 1
    + 66   #   (4)  x <= y
    + 67   #
    + 68 
    + 69   #! [docs-python-quickstart-6 start]
    + 70   # Formally, constraints are also terms. Their sort is Boolean.
    + 71   # We will construct these constraints gradually,
    + 72   # by defining each of their components.
    + 73   # We start with the constant numerals 0 and 1:
    + 74   zero = solver.mkReal(0);
    + 75   one = solver.mkReal(1);
    + 76 
    + 77   # Next, we construct the term x + y
    + 78   xPlusY = solver.mkTerm(Kind.ADD, x, y);
    + 79 
    + 80   # Now we can define the constraints.
    + 81   # They use the operators +, <=, and <.
    + 82   # In the API, these are denoted by Plus, Leq, and Lt.
    + 83   constraint1 = solver.mkTerm(Kind.LT, zero, x);
    + 84   constraint2 = solver.mkTerm(Kind.LT, zero, y);
    + 85   constraint3 = solver.mkTerm(Kind.LT, xPlusY, one);
    + 86   constraint4 = solver.mkTerm(Kind.LEQ, x, y);
    + 87 
    + 88   # Now we assert the constraints to the solver.
    + 89   solver.assertFormula(constraint1);
    + 90   solver.assertFormula(constraint2);
    + 91   solver.assertFormula(constraint3);
    + 92   solver.assertFormula(constraint4);
    + 93   #! [docs-python-quickstart-6 end]
    + 94 
    + 95   # Check if the formula is satisfiable, that is,
    + 96   # are there real values for x and y that satisfy all the constraints?
    + 97   #! [docs-python-quickstart-7 start]
    + 98   r1 = solver.checkSat();
    + 99   #! [docs-python-quickstart-7 end]
    +100 
    +101   # The result is either SAT, UNSAT, or UNKNOWN.
    +102   # In this case, it is SAT.
    +103   #! [docs-python-quickstart-8 start]
    +104   print("expected: sat")
    +105   print("result: ", r1)
    +106   #! [docs-python-quickstart-8 end]
    +107 
    +108   # We can get the values for x and y that satisfy the constraints.
    +109   #! [docs-python-quickstart-9 start]
    +110   xVal = solver.getValue(x);
    +111   yVal = solver.getValue(y);
    +112   #! [docs-python-quickstart-9 end]
    +113 
    +114   # It is also possible to get values for compound terms,
    +115   # even if those did not appear in the original formula.
    +116   #! [docs-python-quickstart-10 start]
    +117   xMinusY = solver.mkTerm(Kind.SUB, x, y);
    +118   xMinusYVal = solver.getValue(xMinusY);
    +119   #! [docs-python-quickstart-10 end]
    +120 
    +121   # We can now obtain the values as python values
    +122   #! [docs-python-quickstart-11 start]
    +123   xPy = xVal.getRealValue();
    +124   yPy = yVal.getRealValue();
    +125   xMinusYPy = xMinusYVal.getRealValue();
    +126 
    +127   print("value for x: ", xPy)
    +128   print("value for y: ", yPy)
    +129   print("value for x - y: ", xMinusYPy)
    +130   #! [docs-python-quickstart-11 end]
    +131 
    +132   # Another way to independently compute the value of x - y would be
    +133   # to use the python minus operator instead of asking the solver.
    +134   # However, for more complex terms,
    +135   # it is easier to let the solver do the evaluation.
    +136   #! [docs-python-quickstart-12 start]
    +137   xMinusYComputed = xPy - yPy;
    +138   if xMinusYComputed == xMinusYPy:
    +139     print("computed correctly")
    +140   else:
    +141     print("computed incorrectly")
    +142   #! [docs-python-quickstart-12 end]
    +143 
    +144   # Further, we can convert the values to strings
    +145   #! [docs-python-quickstart-13 start]
    +146   xStr = str(xPy);
    +147   yStr = str(yPy);
    +148   xMinusYStr = str(xMinusYPy);
    +149   #! [docs-python-quickstart-13 end]
    +150 
    +151   # Next, we will check satisfiability of the same formula,
    +152   # only this time over integer variables a and b.
    +153 
    +154   # We start by resetting assertions added to the solver.
    +155   #! [docs-python-quickstart-14 start]
    +156   solver.resetAssertions();
    +157   #! [docs-python-quickstart-14 end]
    +158 
    +159   # Next, we assert the same assertions above with integers.
    +160   # This time, we inline the construction of terms
    +161   # to the assertion command.
    +162   #! [docs-python-quickstart-15 start]
    +163   solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), a));
    +164   solver.assertFormula(solver.mkTerm(Kind.LT, solver.mkInteger(0), b));
    +165   solver.assertFormula(
    +166       solver.mkTerm(
    +167           Kind.LT, solver.mkTerm(Kind.ADD, a, b), solver.mkInteger(1)));
    +168   solver.assertFormula(solver.mkTerm(Kind.LEQ, a, b));
    +169   #! [docs-python-quickstart-15 end]
    +170 
    +171   # We check whether the revised assertion is satisfiable.
    +172   #! [docs-python-quickstart-16 start]
    +173   r2 = solver.checkSat();
    +174   #! [docs-python-quickstart-16 end]
    +175 
    +176   # This time the formula is unsatisfiable
    +177   #! [docs-python-quickstart-17 start]
    +178   print("expected: unsat")
    +179   print("result:", r2)
    +180   #! [docs-python-quickstart-17 end]
    +181 
    +182   # We can query the solver for an unsatisfiable core, i.e., a subset
    +183   # of the assertions that is already unsatisfiable.
    +184   #! [docs-python-quickstart-18 start]
    +185   unsatCore = solver.getUnsatCore();
    +186   print("unsat core size:", len(unsatCore))
    +187   print("unsat core:", unsatCore)
    +188   #! [docs-python-quickstart-18 end]
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/set.html b/cvc5-1.0.2/api/python/pythonic/set.html new file mode 100644 index 0000000..a47495d --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/set.html @@ -0,0 +1,1526 @@ + + + + + + + + Sets — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Sets + + ¶ + +

    +
    +

    + Basic Set Term Builders + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + SetSort + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create a set sort over element sort s +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Set + + + + ( + + + + + name + + + + , + + + + elem_sort + + + + + ) + + + ¶ + +
    +
    +

    + Creates a symbolic set of elements +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + EmptySet + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create the empty set +

    +
    +
    +
    >>> EmptySet(IntSort())
    +Empty(Set(Int))
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Singleton + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + The single element set of just e +

    +
    +
    +
    >>> Singleton(IntVal(1))
    +Singleton(1)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + FullSet + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Create the full set +

    +
    +
    +
    >>> FullSet(IntSort())
    +Full(Set(Int))
    +
    +
    +
    +
    +
    +
    +
    +

    + Set Operators + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + SetUnion + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Take the union of sets +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> SetUnion(a, b)
    +SetUnion(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetIntersect + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Take the intersection of sets +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> SetIntersect(a, b)
    +SetIntersect(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetAdd + + + + ( + + + + + s + + + + , + + + + e + + + + + ) + + + ¶ + +
    +
    +

    + Add element e to set s +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> SetAdd(a, 1)
    +SetAdd(a, 1)
    +>>> SetAdd(a, 1).arg(0)
    +a
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetDel + + + + ( + + + + + s + + + + , + + + + e + + + + + ) + + + ¶ + +
    +
    +

    + Remove element e to set s +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> SetDel(a, 1)
    +SetDifference(a, Singleton(1))
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetComplement + + + + ( + + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + The complement of set s +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> SetComplement(a)
    +SetComplement(a)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetDifference + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + The set difference of a and b +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> SetDifference(a, b)
    +SetDifference(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SetMinus + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + The set difference of a and b +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> SetMinus(a, b)
    +SetDifference(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IsMember + + + + ( + + + + + e + + + + , + + + + s + + + + + ) + + + ¶ + +
    +
    +

    + Check if e is a member of set s +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> IsMember(1, a)
    +IsMember(1, a)
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + IsSubset + + + + ( + + + + + a + + + + , + + + + b + + + + + ) + + + ¶ + +
    +
    +

    + Check if a is a subset of b +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> IsSubset(a, b)
    +IsSubset(a, b)
    +
    +
    +
    +
    +
    +

    + See the following operator overload for set terms: +

    + +
    +
    +

    + Classes (with overloads) + + ¶ + +

    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + SetSortRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Array sorts. +

    +
    +
    + + + domain + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the domain of the set sort + + self + + . +

    +
    +
    +
    >>> A = SetSort(IntSort())
    +>>> A.domain()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the “range” of the set sort + + self + + . +Included for compatibility with arrays. +

    +
    +
    +
    >>> A = SetSort(IntSort())
    +>>> A.range()
    +Bool
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + SetRef + + + + ( + + + + + ast + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + reverse_children + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Array expressions. +

    +
    +
    + + + __and__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Intersection +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> a & b
    +SetIntersect(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + __getitem__ + + + + ( + + + + + arg + + + + + ) + + + ¶ + +
    +
    +

    + Return the SMT expression + + self[arg] + + . +Included for compatibility with arrays. +

    +
    +
    +
    >>> a = Set('a', IntSort())
    +>>> i = Int('i')
    +>>> a[i]
    +IsMember(i, a)
    +
    +
    +
    +
    +
    +
    +
    + + + __or__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Union +

    +
    +
    +
    >>> a = Const('a', SetSort(IntSort()))
    +>>> b = Const('b', SetSort(IntSort()))
    +>>> a | b
    +SetUnion(a, b)
    +
    +
    +
    +
    +
    +
    +
    + + + default + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Always returns false. +

    +

    + Included for compatibility with Arrays. +

    +
    +
    +
    >>> Set('a', IntSort()).default()
    +False
    +
    +
    +
    +
    +
    +
    +
    + + + domain + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Shorthand for + + self.sort().domain() + + . +

    +
    +
    +
    >>> a = Set('a', IntSort())
    +>>> a.domain()
    +Int
    +
    +
    +
    +
    +
    +
    +
    + + + range + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Shorthand for + + self.sort().range() + + . +Included for compatibility with arrays. +

    +
    +
    +
    >>> a = Set('a', IntSort())
    +>>> a.range()
    +Bool
    +
    +
    +
    +
    +
    +
    +
    + + + sort + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the set sort of the set expression + + self + + . +

    +
    +
    +
    >>> a = Set('a', IntSort())
    +>>> a.sort()
    +Set(Int)
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/api/python/pythonic/solver.html b/cvc5-1.0.2/api/python/pythonic/solver.html new file mode 100644 index 0000000..eff5989 --- /dev/null +++ b/cvc5-1.0.2/api/python/pythonic/solver.html @@ -0,0 +1,3048 @@ + + + + + + + + Solvers & Results — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Solvers & Results + + ¶ + +

    +
    +

    + Simple Solving + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + solve + + + + ( + + + + + * + + + + + args + + + + , + + + + ** + + + + + kwargs + + + + + ) + + + ¶ + +
    +
    +

    + Solve the constraints + + *args + + . +

    +

    + This is a simple function for creating demonstrations. It creates a solver, +configure it using the options in + + kwargs + + , adds the constraints +in + + args + + , and invokes check. +

    +
    +
    +
    >>> a = Int('a')
    +>>> solve(a > 0, a < 2)
    +[a = 1]
    +>>> solve(a > 0, a < 2, show=True)
    +Problem:
    +[a > 0, a < 2]
    +Solution:
    +[a = 1]
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + solve_using + + + + ( + + + + + s + + + + , + + + + * + + + + + args + + + + , + + + + ** + + + + + kwargs + + + + + ) + + + ¶ + +
    +
    +

    + Solve the constraints + + *args + + using solver + + s + + . +

    +

    + This is a simple function for creating demonstrations. +It is similar to + + solve + + , but it uses the given solver + + s + + . +It configures solver + + s + + using the options in + + kwargs + + , +adds the constraints in + + args + + , and invokes check. +

    +
    +
    +
    >>> a = Int('a')
    +>>> s = Solver()
    +>>> solve_using(s, a > 0, a < 2)
    +[a = 1]
    +>>> solve_using(s, a != 1, show=True)
    +Problem:
    +[a > 0, a < 2, a != 1]
    +no solution
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + prove + + + + ( + + + + + claim + + + + , + + + + ** + + + + + keywords + + + + + ) + + + ¶ + +
    +
    +

    + Try to prove the given claim. +

    +

    + This is a simple function for creating demonstrations. It tries to prove + + claim + + by showing the negation is unsatisfiable. +

    +
    +
    +
    >>> p, q = Bools('p q')
    +>>> prove(Not(And(p, q)) == Or(Not(p), Not(q)))
    +proved
    +>>> prove(p == True)
    +counterexample
    +[p = False]
    +>>> prove(p == True, show=True)
    +[Not(p == True)]
    +counterexample
    +[p = False]
    +
    +
    +
    +
    +
    +
    +
    +

    + The Solver Class + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + SolverFor + + + + ( + + + + + logic + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + logFile + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Create a solver customized for the given logic. +

    +

    + The parameter + + logic + + is a string. It should be the name of an SMT-LIB +logic. +See + + https://smtlib.cs.uiowa.edu/ + + for the name of all available logics. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + SimpleSolver + + + + ( + + + + + ctx + + + + + = + + + + + None + + + + , + + + + logFile + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Return a simple general purpose solver. +

    +
    +
    +
    >>> s = SimpleSolver()
    +>>> x = Int('x')
    +>>> s.add(x > 0)
    +>>> s.check()
    +sat
    +
    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + Solver + + + + ( + + + + + solver + + + + + = + + + + + None + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + logFile + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +

    + Solver API provides methods for implementing the main SMT 2.0 commands: +

    +
      +
    • +

      + push, +

      +
    • +
    • +

      + pop, +

      +
    • +
    • +

      + check, +

      +
    • +
    • +

      + get-model, +

      +
    • +
    • +

      + etc. +

      +
    • +
    +
    +
    + + + __iadd__ + + + + ( + + + + + fml + + + + + ) + + + ¶ + +
    +
    +

    + Assert constraints into the solver. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s += x > 0
    +>>> s += x < 2
    +>>> s
    +[x > 0, x < 2]
    +
    +
    +
    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + solver + + + + + = + + + + + None + + + + , + + + + ctx + + + + + = + + + + + None + + + + , + + + + logFile + + + + + = + + + + + None + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a formatted string with all added constraints. +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    + + + add + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Assert constraints into the solver. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, x < 2)
    +>>> s
    +[x > 0, x < 2]
    +
    +
    +
    +
    +
    +
    +
    + + + append + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Assert constraints into the solver. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.append(x > 0, x < 2)
    +>>> s
    +[x > 0, x < 2]
    +
    +
    +
    +
    +
    +
    +
    + + + assert_exprs + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Assert constraints into the solver. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.assert_exprs(x > 0, x < 2)
    +>>> s
    +[x > 0, x < 2]
    +
    +
    +
    +
    +
    +
    +
    + + + assertions + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return an AST vector containing all added constraints. +

    +
    +
    +
    >>> s = Solver()
    +>>> s.assertions()
    +[]
    +>>> a = Int('a')
    +>>> s.add(a > 0)
    +>>> s.add(a < 10)
    +>>> s.assertions()
    +[a > 0, a < 10]
    +
    +
    +
    +
    +
    +
    +
    + + + check + + + + ( + + + + + * + + + + + assumptions + + + + + ) + + + ¶ + +
    +
    +

    + Check whether the assertions in the given solver plus the optional +assumptions are consistent or not. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.check()
    +sat
    +>>> s.add(x > 0, x < 2)
    +>>> s.check()
    +sat
    +>>> s.model().eval(x)
    +1
    +>>> s.add(x < 1)
    +>>> s.check()
    +unsat
    +>>> s.resetAssertions()
    +
    +
    +
    +
    +
    +
    +
    + + + getOption + + + + ( + + + + + name + + + + + ) + + + ¶ + +
    +
    +

    + Get the current value of an option from the solver. The value is +returned as a string. For type-safe querying use + + + getOptionInfo() + + + . +

    +
    +
    +
    >>> main_ctx().reset()
    +>>> s = Solver()
    +>>> s.setOption(incremental=True)
    +>>> s.getOption("incremental")
    +'true'
    +
    +
    +
    +
    +
    +
    +
    + + + getOptionInfo + + + + ( + + + + + name + + + + + ) + + + ¶ + +
    +
    +

    + Get the current value of an option from the solver. The value is +returned as a string. For type-safe querying use + + + getOptionInfo() + + + . +

    +
    +
    +
    >>> main_ctx().reset()
    +>>> s = Solver()
    +>>> s.setOption(incremental=False)
    +>>> s.getOptionInfo("incremental")
    +{'name': 'incremental', 'aliases': [], 'setByUser': True, 'type': <class 'bool'>, 'current': False, 'default': True}
    +>>> main_ctx().reset()
    +
    +
    +
    +
    +
    +
    +
    + + + getOptionNames + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Get all option names that can be used with + + + getOption() + + + , + + + setOption() + + + and + + + getOptionInfo() + + + . +

    +
    +
    +
    >>> s = Solver()
    +>>> s.getOptionNames()[:3]
    +['abstract-values', 'ackermann', 'approx-branch-depth']
    +
    +
    +
    +
    +
    +
    +
    + + + insert + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Assert constraints into the solver. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.insert(x > 0, x < 2)
    +>>> s
    +[x > 0, x < 2]
    +
    +
    +
    +
    +
    +
    +
    + + + model + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a model for the last + + check() + + . +

    +

    + This function raises an exception if +a model is not available (e.g., last + + check() + + returned unsat). +

    +
    +
    +
    >>> s = Solver()
    +>>> a = Int('a')
    +>>> s.add(a + 2 == 0)
    +>>> s.check()
    +sat
    +>>> s.model()
    +[a = -2]
    +
    +
    +
    +
    +
    +
    +
    + + + num_scopes + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the current number of backtracking points. +

    +
    +
    +
    >>> s = Solver()
    +>>> s.num_scopes()
    +0
    +>>> s.push()
    +>>> s.num_scopes()
    +1
    +>>> s.push()
    +>>> s.num_scopes()
    +2
    +>>> s.pop()
    +>>> s.num_scopes()
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + pop + + + + ( + + + + + num + + + + + = + + + + + 1 + + + + + ) + + + ¶ + +
    +
    +

    + Backtrack num backtracking points. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0)
    +>>> s
    +[x > 0]
    +>>> s.push()
    +>>> s.add(x < 1)
    +>>> s
    +[x > 0, x < 1]
    +>>> s.check()
    +unsat
    +>>> s.pop()
    +>>> s.check()
    +sat
    +>>> s
    +[x > 0]
    +
    +
    +
    +
    +
    +
    +
    + + + push + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Create a backtracking point. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0)
    +>>> s
    +[x > 0]
    +>>> s.push()
    +>>> s.add(x < 1)
    +>>> s
    +[x > 0, x < 1]
    +>>> s.check()
    +unsat
    +>>> s.pop()
    +>>> s.check()
    +sat
    +>>> s
    +[x > 0]
    +
    +
    +
    +
    +
    +
    +
    + + + reason_unknown + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a string describing why the last + + check() + + returned + + unknown + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = SimpleSolver()
    +
    +
    +
    +
    +
    +
    +
    + + + reset + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Fully reset the solver. This actually destroys the solver object in +the context and recreates this. + + This invalidates all objects created +within this context and using them will most likely crash. + +

    +
    +
    +
    >>> s = Solver()
    +>>> x = Int('x')
    +>>> s.add(x > 0)
    +>>> s.check()
    +sat
    +>>> s.reset()
    +>>> s.setOption(incremental=True)
    +
    +
    +
    +
    +
    +
    +
    + + + resetAssertions + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Remove all asserted constraints and backtracking points created +using + + push() + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0)
    +>>> s
    +[x > 0]
    +>>> s.resetAssertions()
    +>>> s
    +[]
    +
    +
    +
    +
    +
    +
    +
    + + + set + + + + ( + + + + + * + + + + + args + + + + , + + + + ** + + + + + kwargs + + + + + ) + + + ¶ + +
    +
    +

    + Set an option on the solver. Wraps + + + setOption() + + + . +

    +
    +
    +
    >>> main_ctx().reset()
    +>>> s = Solver()
    +>>> s.set(incremental=True)
    +>>> s.set('incremental', 'true')
    +
    +
    +
    +
    +
    +
    +
    + + + setOption + + + + ( + + + + + name + + + + + = + + + + + None + + + + , + + + + value + + + + + = + + + + + None + + + + , + + + + ** + + + + + kwargs + + + + + ) + + + ¶ + +
    +
    +

    + Set options on the solver. Options can either be set via the + + + name + + + and + + + value + + + arguments in the form + + + setOption('foo', + + + 'bar') + + + , or as +keyword arguments using the syntax + + + setOption(foo='bar') + + + . +The option value is passed as a string internally. Boolean values are +properly converted manually, all other types are convertes using + + + str() + + + . +

    +
    +
    +
    >>> main_ctx().reset()
    +>>> s = Solver()
    +>>> s.setOption('incremental', True)
    +>>> s.setOption(incremental='true')
    +
    +
    +
    +
    +
    +
    +
    + + + sexpr + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a formatted string (in Lisp-like format) with all added +constraints. We say the string is in s-expression format. +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0)
    +>>> s.add(x < 2)
    +>>> r = s.sexpr()
    +
    +
    +
    +
    +
    +
    +
    + + + statistics + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the statistics of this solver. +

    +
    +
    +
    >>> c = Context()
    +>>> s = Solver(ctx=c)
    +>>> a = Int('a', c)
    +>>> s.add(a == 0)
    +>>> s.check()
    +sat
    +>>> stats = s.statistics()
    +>>> stats['cvc5::CONSTANT']
    +{'defaulted': False, 'internal': False, 'value': {'integer type': 1}}
    +>>> len(stats.get()) < 10
    +True
    +>>> len(stats.get(True, True)) > 30
    +True
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +

    + Results & Models + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + unsat + + + + ¶ + +
    +
    +

    + An + + UNSAT + + result. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + sat + + + + ¶ + +
    +
    +

    + A + + SAT + + result. +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + unknown + + + + ¶ + +
    +
    +

    + The satisfiability could not be determined. +

    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + CheckSatResult + + + + ( + + + + + r + + + + + ) + + + ¶ + +
    +
    +

    + Represents the result of a satisfiability check: sat, unsat, unknown. +

    +
    +
    +
    >>> s = Solver()
    +>>> s.check()
    +sat
    +>>> r = s.check()
    +>>> isinstance(r, CheckSatResult)
    +True
    +
    +
    +
    +
    +
    + + + __eq__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self==value. +

    +
    +
    +
    +
    + + + __hash__ + + + + + + + + = + + + + + + None + + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + r + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __ne__ + + + + ( + + + + + other + + + + + ) + + + ¶ + +
    +
    +

    + Return self!=value. +

    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return repr(self). +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    +
    +
    + + + class + + + + + + + cvc5.pythonic. + + + + + ModelRef + + + + ( + + + + + solver + + + + , + + + + ctx + + + + + ) + + + ¶ + +
    +
    +

    + Model/Solution of a satisfiability problem (aka system of constraints). +

    +
    +
    + + + __getitem__ + + + + ( + + + + + idx + + + + + ) + + + ¶ + +
    +
    +

    + If + + idx + + is an integer, +then the declaration at position + + idx + + in the model + + self + + is returned. +If + + idx + + is a declaration, then the actual interpretation is returned. +

    +

    + The elements can be retrieved using position or the actual declaration. +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, x < 2, f(x) == 0)
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> m.decls()
    +[f, x]
    +>>> len(m)
    +2
    +>>> m[0]
    +f
    +>>> m[1]
    +x
    +>>> m[x]
    +1
    +
    +
    +
    +
    +
    +
    +
    + + + __init__ + + + + ( + + + + + solver + + + + , + + + + ctx + + + + + ) + + + ¶ + +
    +
    +
    +
    +
    +
    + + + __len__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return the number of constant and function declarations in the model + + self + + . +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, f(x) != x)
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> len(m)
    +2
    +
    +
    +
    +
    +
    +
    +
    + + + __repr__ + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return repr(self). +

    +
    +
    +
    +
    + + + __weakref__ + + + + ¶ + +
    +
    +

    + list of weak references to the object (if defined) +

    +
    +
    +
    +
    + + + decls + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Return a list with all symbols that have an interpretation in the +model + + self + + . +

    +
    +
    +
    >>> f = Function('f', IntSort(), IntSort())
    +>>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, x < 2, f(x) == 0)
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> m.decls()
    +[f, x]
    +
    +
    +
    +
    +
    +
    +
    + + + eval + + + + ( + + + + + t + + + + , + + + + model_completion + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Evaluate the expression + + t + + in the model + + self + + . If + + model_completion + + is enabled, then a default interpretation is +automatically added for symbols that do not have an interpretation in +the model + + self + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, x < 2)
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> m.eval(x + 1)
    +2
    +>>> m.eval(x == 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + evaluate + + + + ( + + + + + t + + + + , + + + + model_completion + + + + + = + + + + + False + + + + + ) + + + ¶ + +
    +
    +

    + Alias for + + eval + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> s = Solver()
    +>>> s.add(x > 0, x < 2)
    +>>> s.check()
    +sat
    +>>> m = s.model()
    +>>> m.evaluate(x + 1)
    +2
    +>>> m.evaluate(x == 1)
    +True
    +
    +
    +
    +
    +
    +
    +
    + + + vars + + + + ( + + + ) + + + ¶ + +
    +
    +

    + Returns the free constants in an assertion, as terms +

    +
    +
    +
    +
    +
    +
    +

    + Utilities + + ¶ + +

    +
    +
    + + + cvc5.pythonic. + + + + + evaluate + + + + ( + + + + + t + + + + + ) + + + ¶ + +
    +
    +

    + Evaluates the given term (assuming it is constant!) +

    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + simplify + + + + ( + + + + + a + + + + + ) + + + ¶ + +
    +
    +

    + Simplify the expression + + a + + . +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> simplify(x + 1 + y + x + 1)
    +2 + 2*x + y
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + substitute + + + + ( + + + + + t + + + + , + + + + * + + + + + m + + + + + ) + + + ¶ + +
    +
    +

    + Apply substitution m on t, m is a list of pairs of the form (from, to). +Every occurrence in t of from is replaced with to. +

    +
    +
    +
    >>> x = Int('x')
    +>>> y = Int('y')
    +>>> f = Function('f', IntSort(), IntSort())
    +>>> substitute(f(x) + f(y), (f(x), IntVal(1)), (f(y), IntVal(1)))
    +1 + 1
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Sum + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create the sum of the SMT expressions. +

    +
    +
    +
    >>> a, b, c = Ints('a b c')
    +>>> Sum(a, b, c)
    +a + b + c
    +>>> Sum([a, b, c])
    +a + b + c
    +>>> A = IntVector('a', 5)
    +>>> Sum(A)
    +a__0 + a__1 + a__2 + a__3 + a__4
    +>>> Sum()
    +0
    +
    +
    +
    +
    +
    +
    +
    + + + cvc5.pythonic. + + + + + Product + + + + ( + + + + + * + + + + + args + + + + + ) + + + ¶ + +
    +
    +

    + Create the product of the SMT expressions. +

    +
    +
    +
    >>> a, b, c = Ints('a b c')
    +>>> Product(a, b, c)
    +a*b*c
    +>>> Product([a, b, c])
    +a*b*c
    +>>> A = IntVector('a', 5)
    +>>> Product(A)
    +a__0*a__1*a__2*a__3*a__4
    +>>> Product()
    +1
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/binary/binary.html b/cvc5-1.0.2/binary/binary.html new file mode 100644 index 0000000..f76d3f6 --- /dev/null +++ b/cvc5-1.0.2/binary/binary.html @@ -0,0 +1,283 @@ + + + + + + + + Binary Documentation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Binary Documentation +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Binary Documentation + + ¶ + +

    +

    + The easiest way to use cvc5 is usually to invoke the cvc5 binary via the command line. +The + + + quickstart guide + + + gives a short introduction on how to use cvc5 via the SMT-LIBv2 +interface. +

    +

    + The cvc5 binary supports the following input languages: +

    + +

    + Alternatively, cvc5 features + + + several APIs + + + for different programming languages. +

    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/binary/quickstart.html b/cvc5-1.0.2/binary/quickstart.html new file mode 100644 index 0000000..32800f5 --- /dev/null +++ b/cvc5-1.0.2/binary/quickstart.html @@ -0,0 +1,1385 @@ + + + + + + + + Quickstart Guide — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Quickstart Guide + + ¶ + +

    +

    + The primary input language for cvc5 is + + SMT-LIB v2 + + . +We give a short explanation of the SMT-LIB v2 quickstart +example here. +

    +

    + First, we set the logic. +The simplest way to set a logic for the solver is to choose “ALL”. +This enables all logics in the solver. +Alternatively, + + + "QF_ALL" + + + enables all logics without quantifiers. +To optimize the solver’s behavior for a more specific logic, +use the logic name, e.g. + + + "QF_BV" + + + or + + + "QF_AUFBV" + + + . +

    +
    +
    +
    (set-logic ALL)
    +
    +
    +
    +

    + We will ask the solver to produce models and unsat cores in the following, +and for this we have to enable the following options. +Furthermore, we enable incremental solving so that we can use the + + + (reset-assertions) + + + command later on. +

    +
    +
    +
    (set-option :produce-models true)
    +(set-option :incremental true)
    +; print unsat cores, include assertions in the unsat core that have not been named
    +(set-option :produce-unsat-cores true)
    +(set-option :dump-unsat-cores-full true)
    +
    +
    +
    +

    + Now, we create two constants + + + x + + + and + + + y + + + of sort + + + Real + + + . +Notice that these are + + symbolic + + constants, but not actual values. +

    +
    +
    +
    ; Declare real constants x,y
    +(declare-const x Real)
    +(declare-const y Real)
    +
    +
    +
    +

    + We define the following constraints regarding + + + x + + + and + + + y + + + : +

    +
    + \[(0 < x) \wedge (0 < y) \wedge (x + y < 1) \wedge (x \leq y)\] +
    +

    + We assert them as follows. Notice that in SMT-LIB v2, terms are written in prefix notation, e.g., we write + + (+ x y) + + instead of + + (x + y) + + . +

    +
    +
    +
    ; Our constraints regarding x and y will be:
    +;
    +;   (1)  0 < x
    +;   (2)  0 < y
    +;   (3)  x + y < 1
    +;   (4)  x <= y
    +
    +(assert (< 0 x))
    +(assert (< 0 y))
    +(assert (< (+ x y) 1))
    +(assert (<= x y))
    +
    +
    +
    +

    + Now we check if the asserted formula is satisfiable, that is, we check if +there exist values of sort + + + Real + + + for + + + x + + + and + + + y + + + that satisfy all +the constraints. +

    +
    +
    +
    (check-sat)
    +
    +
    +
    +

    + The result we get from this satisfiability check is either + + + sat + + + , + + + unsat + + + or + + + unknown + + + , and it is printed to standard output. +In this case, it will print + + + sat + + + . +

    +

    + Now, we query the solver for the values for + + + x + + + and + + + y + + + that satisfy +the constraints. +It is also possible to get values for terms that do not appear in the original +formula. +

    +
    +
    +
    (echo "Values of declared real constants and of compound terms built with them.")
    +(get-value (x y (- x y)))
    +
    +
    +
    +

    + This will print the values of + + x + + , + + y + + , and + + x-y + + , in a key-value format + + (<term> <value>) + + one after the other: +

    +
    +
    +
    ((x (/ 1 6)) (y (/ 1 6)) ((- x y) 0.0))
    +
    +
    +
    +

    + Next, we will check satisfiability of the same formula, +only this time over integer variables + + + a + + + and + + + b + + + . +For this, we first reset the assertions added to the solver and declare fresh +integer variables + + + a + + + and + + + b + + + . +

    +
    +
    +
    (echo "We will reset the solver with the (reset-assertions) command and check satisfiability of the same assertions but with the integers constants rather than with the real ones.")
    +(reset-assertions)
    +; Declare integer constants a,b
    +(declare-const a Int)
    +(declare-const b Int)
    +
    +
    +
    +

    + Next, we assert the same assertions as above, but with integers. +

    +
    +
    +
    (assert (< 0 a))
    +(assert (< 0 b))
    +(assert (< (+ a b) 1))
    +(assert (<= a b))
    +
    +
    +
    +

    + Now, we check whether the revised query is satisfiable. +

    +
    +
    +
    (check-sat)
    +
    +
    +
    +

    + This time the asserted formula is unsatisfiable and + + + unsat + + + is printed. +

    +

    + We can query the solver for an unsatisfiable core, that is, a subset +of the assertions that is already unsatisfiable. +

    +
    +
    +
    (get-unsat-core)
    +
    +
    +
    +

    + This will print: +

    +
    +
    +
    (
    +(< 0 a)
    +(< 0 b)
    +(< (+ a b) 1)
    +)
    +
    +
    +
    +
    +

    + Example + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/smtlib/quickstart.smt2 + +

    +
    +
    +
     1 ;! [docs-smt2-quickstart-1 start]
    + 2 (set-logic ALL)
    + 3 ;! [docs-smt2-quickstart-1 end]
    + 4 ;! [docs-smt2-quickstart-2 start]
    + 5 (set-option :produce-models true)
    + 6 (set-option :incremental true)
    + 7 ; print unsat cores, include assertions in the unsat core that have not been named
    + 8 (set-option :produce-unsat-cores true)
    + 9 (set-option :dump-unsat-cores-full true)
    +10 ;! [docs-smt2-quickstart-2 end]
    +11 
    +12 ;! [docs-smt2-quickstart-3 start]
    +13 ; Declare real constants x,y
    +14 (declare-const x Real)
    +15 (declare-const y Real)
    +16 ;! [docs-smt2-quickstart-3 end]
    +17 
    +18 ;! [docs-smt2-quickstart-4 start]
    +19 ; Our constraints regarding x and y will be:
    +20 ;
    +21 ;   (1)  0 < x
    +22 ;   (2)  0 < y
    +23 ;   (3)  x + y < 1
    +24 ;   (4)  x <= y
    +25 
    +26 (assert (< 0 x))
    +27 (assert (< 0 y))
    +28 (assert (< (+ x y) 1))
    +29 (assert (<= x y))
    +30 ;! [docs-smt2-quickstart-4 end]
    +31 
    +32 ;! [docs-smt2-quickstart-5 start]
    +33 (check-sat)
    +34 ;! [docs-smt2-quickstart-5 end]
    +35 ;! [docs-smt2-quickstart-6 start]
    +36 (echo "Values of declared real constants and of compound terms built with them.")
    +37 (get-value (x y (- x y)))
    +38 ;! [docs-smt2-quickstart-6 end]
    +39 
    +40 ;! [docs-smt2-quickstart-7 start]
    +41 (echo "We will reset the solver with the (reset-assertions) command and check satisfiability of the same assertions but with the integers constants rather than with the real ones.")
    +42 (reset-assertions)
    +43 ; Declare integer constants a,b
    +44 (declare-const a Int)
    +45 (declare-const b Int)
    +46 ;! [docs-smt2-quickstart-7 end]
    +47 ;! [docs-smt2-quickstart-8 start]
    +48 (assert (< 0 a))
    +49 (assert (< 0 b))
    +50 (assert (< (+ a b) 1))
    +51 (assert (<= a b))
    +52 ;! [docs-smt2-quickstart-8 end]
    +53 
    +54 ;! [docs-smt2-quickstart-9 start]
    +55 (check-sat)
    +56 ;! [docs-smt2-quickstart-9 end]
    +57 ;! [docs-smt2-quickstart-10 start]
    +58 (get-unsat-core)
    +59 ;! [docs-smt2-quickstart-10 end]
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/bags.html b/cvc5-1.0.2/examples/bags.html new file mode 100644 index 0000000..8d8cee7 --- /dev/null +++ b/cvc5-1.0.2/examples/bags.html @@ -0,0 +1,752 @@ + + + + + + + + Theory of Bags — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Bags + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/bags.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Mudathir Mohamed
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of reasoning about bags.
    + 14  */
    + 15 
    + 16 #include <cvc5/cvc5.h>
    + 17 
    + 18 #include <iostream>
    + 19 
    + 20 using namespace std;
    + 21 using namespace cvc5;
    + 22 
    + 23 int main()
    + 24 {
    + 25   Solver slv;
    + 26   slv.setLogic("ALL");
    + 27   // Produce models
    + 28   slv.setOption("produce-models", "true");
    + 29   slv.setOption("incremental", "true");
    + 30 
    + 31   Sort bag = slv.mkBagSort(slv.getStringSort());
    + 32   Term A = slv.mkConst(bag, "A");
    + 33   Term B = slv.mkConst(bag, "B");
    + 34   Term C = slv.mkConst(bag, "C");
    + 35   Term x = slv.mkConst(slv.getStringSort(), "x");
    + 36 
    + 37   Term intersectionAC = slv.mkTerm(BAG_INTER_MIN, {A, C});
    + 38   Term intersectionBC = slv.mkTerm(BAG_INTER_MIN, {B, C});
    + 39 
    + 40   // union disjoint does not distribute over intersection
    + 41   {
    + 42     Term unionDisjointAB = slv.mkTerm(BAG_UNION_DISJOINT, {A, B});
    + 43     Term lhs = slv.mkTerm(BAG_INTER_MIN, {unionDisjointAB, C});
    + 44     Term rhs = slv.mkTerm(BAG_UNION_DISJOINT, {intersectionAC, intersectionBC});
    + 45     Term guess = slv.mkTerm(EQUAL, {lhs, rhs});
    + 46     cout << "cvc5 reports: " << guess.notTerm() << " is "
    + 47          << slv.checkSatAssuming(guess.notTerm()) << "." << endl;
    + 48 
    + 49     cout << A << ": " << slv.getValue(A) << endl;
    + 50     cout << B << ": " << slv.getValue(B) << endl;
    + 51     cout << C << ": " << slv.getValue(C) << endl;
    + 52     cout << lhs << ": " << slv.getValue(lhs) << endl;
    + 53     cout << rhs << ": " << slv.getValue(rhs) << endl;
    + 54   }
    + 55 
    + 56   // union max distributes over intersection
    + 57   {
    + 58     Term unionMaxAB = slv.mkTerm(BAG_UNION_MAX, {A, B});
    + 59     Term lhs = slv.mkTerm(BAG_INTER_MIN, {unionMaxAB, C});
    + 60     Term rhs = slv.mkTerm(BAG_UNION_MAX, {intersectionAC, intersectionBC});
    + 61     Term theorem = slv.mkTerm(EQUAL, {lhs, rhs});
    + 62     cout << "cvc5 reports: " << theorem.notTerm() << " is "
    + 63          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    + 64   }
    + 65 
    + 66   // Verify emptbag is a subbag of any bag
    + 67   {
    + 68     Term emptybag = slv.mkEmptyBag(bag);
    + 69     Term theorem = slv.mkTerm(BAG_SUBBAG, {emptybag, A});
    + 70 
    + 71     cout << "cvc5 reports: " << theorem.notTerm() << " is "
    + 72          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    + 73   }
    + 74 
    + 75   // find an element with multiplicity 4 in the disjoint union of
    + 76   // ; {|"a", "a", "b", "b", "b"|} and {|"b", "c", "c"|}
    + 77 
    + 78   {
    + 79     Term one = slv.mkInteger(1);
    + 80     Term two = slv.mkInteger(2);
    + 81     Term three = slv.mkInteger(3);
    + 82     Term four = slv.mkInteger(4);
    + 83     Term a = slv.mkString("a");
    + 84     Term b = slv.mkString("b");
    + 85     Term c = slv.mkString("c");
    + 86 
    + 87     Term bag_a_2 = slv.mkTerm(BAG_MAKE, {a, two});
    + 88     Term bag_b_3 = slv.mkTerm(BAG_MAKE, {b, three});
    + 89     Term bag_b_1 = slv.mkTerm(BAG_MAKE, {b, one});
    + 90     Term bag_c_2 = slv.mkTerm(BAG_MAKE, {c, two});
    + 91     Term bag_a_2_b_3 = slv.mkTerm(BAG_UNION_DISJOINT, {bag_a_2, bag_b_3});
    + 92     Term bag_b_1_c_2 = slv.mkTerm(BAG_UNION_DISJOINT, {bag_b_1, bag_c_2});
    + 93     Term union_disjoint =
    + 94         slv.mkTerm(BAG_UNION_DISJOINT, {bag_a_2_b_3, bag_b_1_c_2});
    + 95 
    + 96     Term count_x = slv.mkTerm(BAG_COUNT, {x, union_disjoint});
    + 97     Term e = slv.mkTerm(EQUAL, {four, count_x});
    + 98     Result result = slv.checkSatAssuming(e);
    + 99 
    +100     cout << "cvc5 reports: " << e << " is " << result << "." << endl;
    +101     if (result.isSat())
    +102     {
    +103       cout << x << ": " << slv.getValue(x) << endl;
    +104     }
    +105   }
    +106 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/bitvectors.html b/cvc5-1.0.2/examples/bitvectors.html new file mode 100644 index 0000000..7877a05 --- /dev/null +++ b/cvc5-1.0.2/examples/bitvectors.html @@ -0,0 +1,869 @@ + + + + + + + + Theory of Bit-Vectors — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Bit-Vectors + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/bitvectors.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Liana Hadarean, Aina Niemetz, Mathias Preiner
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of the solving capabilities of the cvc5
    + 14  * bit-vector solver.
    + 15  *
    + 16  */
    + 17 
    + 18 #include <cvc5/cvc5.h>
    + 19 
    + 20 #include <iostream>
    + 21 
    + 22 using namespace std;
    + 23 using namespace cvc5;
    + 24 
    + 25 int main()
    + 26 {
    + 27   Solver slv;
    + 28   slv.setLogic("QF_BV");  // Set the logic
    + 29 
    + 30   // The following example has been adapted from the book A Hacker's Delight by
    + 31   // Henry S. Warren.
    + 32   //
    + 33   // Given a variable x that can only have two values, a or b. We want to
    + 34   // assign to x a value other than the current one. The straightforward code
    + 35   // to do that is:
    + 36   //
    + 37   //(0) if (x == a ) x = b;
    + 38   //    else x = a;
    + 39   //
    + 40   // Two more efficient yet equivalent methods are:
    + 41   //
    + 42   //(1) x = a ⊕ b ⊕ x;
    + 43   //
    + 44   //(2) x = a + b - x;
    + 45   //
    + 46   // We will use cvc5 to prove that the three pieces of code above are all
    + 47   // equivalent by encoding the problem in the bit-vector theory.
    + 48 
    + 49   // Creating a bit-vector type of width 32
    + 50   Sort bitvector32 = slv.mkBitVectorSort(32);
    + 51 
    + 52   // Variables
    + 53   Term x = slv.mkConst(bitvector32, "x");
    + 54   Term a = slv.mkConst(bitvector32, "a");
    + 55   Term b = slv.mkConst(bitvector32, "b");
    + 56 
    + 57   // First encode the assumption that x must be equal to a or b
    + 58   Term x_eq_a = slv.mkTerm(EQUAL, {x, a});
    + 59   Term x_eq_b = slv.mkTerm(EQUAL, {x, b});
    + 60   Term assumption = slv.mkTerm(OR, {x_eq_a, x_eq_b});
    + 61 
    + 62   // Assert the assumption
    + 63   slv.assertFormula(assumption);
    + 64 
    + 65   // Introduce a new variable for the new value of x after assignment.
    + 66   Term new_x = slv.mkConst(bitvector32, "new_x");  // x after executing code (0)
    + 67   Term new_x_ =
    + 68       slv.mkConst(bitvector32, "new_x_");  // x after executing code (1) or (2)
    + 69 
    + 70   // Encoding code (0)
    + 71   // new_x = x == a ? b : a;
    + 72   Term ite = slv.mkTerm(ITE, {x_eq_a, b, a});
    + 73   Term assignment0 = slv.mkTerm(EQUAL, {new_x, ite});
    + 74 
    + 75   // Assert the encoding of code (0)
    + 76   cout << "Asserting " << assignment0 << " to cvc5 " << endl;
    + 77   slv.assertFormula(assignment0);
    + 78   cout << "Pushing a new context." << endl;
    + 79   slv.push();
    + 80 
    + 81   // Encoding code (1)
    + 82   // new_x_ = a xor b xor x
    + 83   Term a_xor_b_xor_x = slv.mkTerm(BITVECTOR_XOR, {a, b, x});
    + 84   Term assignment1 = slv.mkTerm(EQUAL, {new_x_, a_xor_b_xor_x});
    + 85 
    + 86   // Assert encoding to cvc5 in current context;
    + 87   cout << "Asserting " << assignment1 << " to cvc5 " << endl;
    + 88   slv.assertFormula(assignment1);
    + 89   Term new_x_eq_new_x_ = slv.mkTerm(EQUAL, {new_x, new_x_});
    + 90 
    + 91   cout << " Check sat assuming: " << new_x_eq_new_x_.notTerm() << endl;
    + 92   cout << " Expect UNSAT. " << endl;
    + 93   cout << " cvc5: " << slv.checkSatAssuming(new_x_eq_new_x_.notTerm()) << endl;
    + 94   cout << " Popping context. " << endl;
    + 95   slv.pop();
    + 96 
    + 97   // Encoding code (2)
    + 98   // new_x_ = a + b - x
    + 99   Term a_plus_b = slv.mkTerm(BITVECTOR_ADD, {a, b});
    +100   Term a_plus_b_minus_x = slv.mkTerm(BITVECTOR_SUB, {a_plus_b, x});
    +101   Term assignment2 = slv.mkTerm(EQUAL, {new_x_, a_plus_b_minus_x});
    +102 
    +103   // Assert encoding to cvc5 in current context;
    +104   cout << "Asserting " << assignment2 << " to cvc5 " << endl;
    +105   slv.assertFormula(assignment2);
    +106 
    +107   cout << " Check sat assuming: " << new_x_eq_new_x_.notTerm() << endl;
    +108   cout << " Expect UNSAT. " << endl;
    +109   cout << " cvc5: " << slv.checkSatAssuming(new_x_eq_new_x_.notTerm()) << endl;
    +110 
    +111   Term x_neq_x = slv.mkTerm(EQUAL, {x, x}).notTerm();
    +112   std::vector<Term> v{new_x_eq_new_x_, x_neq_x};
    +113   Term query = slv.mkTerm(AND, {v});
    +114   cout << " Check sat assuming: " << query.notTerm() << endl;
    +115   cout << " Expect SAT. " << endl;
    +116   cout << " cvc5: " << slv.checkSatAssuming(query.notTerm()) << endl;
    +117 
    +118   // Assert that a is odd
    +119   Op extract_op = slv.mkOp(BITVECTOR_EXTRACT, {0, 0});
    +120   Term lsb_of_a = slv.mkTerm(extract_op, {a});
    +121   cout << "Sort of " << lsb_of_a << " is " << lsb_of_a.getSort() << endl;
    +122   Term a_odd = slv.mkTerm(EQUAL, {lsb_of_a, slv.mkBitVector(1u, 1u)});
    +123   cout << "Assert " << a_odd << endl;
    +124   cout << "Check satisfiability." << endl;
    +125   slv.assertFormula(a_odd);
    +126   cout << " Expect sat. " << endl;
    +127   cout << " cvc5: " << slv.checkSat() << endl;
    +128   return 0;
    +129 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/bitvectors_and_arrays.html b/cvc5-1.0.2/examples/bitvectors_and_arrays.html new file mode 100644 index 0000000..d3a06fb --- /dev/null +++ b/cvc5-1.0.2/examples/bitvectors_and_arrays.html @@ -0,0 +1,788 @@ + + + + + + + + Theory of Bit-Vectors and Arrays — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Bit-Vectors and Arrays + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/bitvectors_and_arrays.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Liana Hadarean, Aina Niemetz, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of the solving capabilities of the cvc5
    +14  * bit-vector and array solvers.
    +15  *
    +16  */
    +17 
    +18 #include <cvc5/cvc5.h>
    +19 
    +20 #include <cmath>
    +21 #include <iostream>
    +22 
    +23 using namespace std;
    +24 using namespace cvc5;
    +25 
    +26 int main()
    +27 {
    +28   Solver slv;
    +29   slv.setOption("produce-models", "true");      // Produce Models
    +30   slv.setOption("output-language", "smtlib"); // output-language
    +31   slv.setLogic("QF_AUFBV");                   // Set the logic
    +32 
    +33   // Consider the following code (where size is some previously defined constant):
    +34   //
    +35   //
    +36   //   Assert (current_array[0] > 0);
    +37   //   for (unsigned i = 1; i < k; ++i) {
    +38   //     current_array[i] = 2 * current_array[i - 1];
    +39   //     Assert (current_array[i-1] < current_array[i]);
    +40   //     }
    +41   //
    +42   // We want to check whether the assertion in the body of the for loop holds
    +43   // throughout the loop.
    +44 
    +45   // Setting up the problem parameters
    +46   unsigned k = 4;                // number of unrollings (should be a power of 2)
    +47   unsigned index_size = log2(k); // size of the index
    +48 
    +49 
    +50   // Sorts
    +51   Sort elementSort = slv.mkBitVectorSort(32);
    +52   Sort indexSort = slv.mkBitVectorSort(index_size);
    +53   Sort arraySort = slv.mkArraySort(indexSort, elementSort);
    +54 
    +55   // Variables
    +56   Term current_array = slv.mkConst(arraySort, "current_array");
    +57 
    +58   // Making a bit-vector constant
    +59   Term zero = slv.mkBitVector(index_size, 0u);
    +60 
    +61   // Asserting that current_array[0] > 0
    +62   Term current_array0 = slv.mkTerm(SELECT, {current_array, zero});
    +63   Term current_array0_gt_0 =
    +64       slv.mkTerm(BITVECTOR_SGT, {current_array0, slv.mkBitVector(32, 0u)});
    +65   slv.assertFormula(current_array0_gt_0);
    +66 
    +67   // Building the assertions in the loop unrolling
    +68   Term index = slv.mkBitVector(index_size, 0u);
    +69   Term old_current = slv.mkTerm(SELECT, {current_array, index});
    +70   Term two = slv.mkBitVector(32, 2u);
    +71 
    +72   std::vector<Term> assertions;
    +73   for (unsigned i = 1; i < k; ++i) {
    +74     index = slv.mkBitVector(index_size, i);
    +75     Term new_current = slv.mkTerm(BITVECTOR_MULT, {two, old_current});
    +76     // current[i] = 2 * current[i-1]
    +77     current_array = slv.mkTerm(STORE, {current_array, index, new_current});
    +78     // current[i-1] < current [i]
    +79     Term current_slt_new_current =
    +80         slv.mkTerm(BITVECTOR_SLT, {old_current, new_current});
    +81     assertions.push_back(current_slt_new_current);
    +82 
    +83     old_current = slv.mkTerm(SELECT, {current_array, index});
    +84   }
    +85 
    +86   Term query = slv.mkTerm(NOT, {slv.mkTerm(AND, assertions)});
    +87 
    +88   cout << "Asserting " << query << " to cvc5 " << endl;
    +89   slv.assertFormula(query);
    +90   cout << "Expect sat. " << endl;
    +91   cout << "cvc5: " << slv.checkSatAssuming(slv.mkTrue()) << endl;
    +92 
    +93   // Getting the model
    +94   cout << "The satisfying model is: " << endl;
    +95   cout << "  current_array = " << slv.getValue(current_array) << endl;
    +96   cout << "  current_array[0] = " << slv.getValue(current_array0) << endl;
    +97   return 0;
    +98 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/combination.html b/cvc5-1.0.2/examples/combination.html new file mode 100644 index 0000000..685ce1d --- /dev/null +++ b/cvc5-1.0.2/examples/combination.html @@ -0,0 +1,840 @@ + + + + + + + + Theory Combination — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Combination + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/combination.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Aina Niemetz, Mathias Preiner, Tim King
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of the capabilities of cvc5
    + 14  *
    + 15  * A simple demonstration of how to use uninterpreted functions, combining this
    + 16  * with arithmetic, and extracting a model at the end of a satisfiable query.
    + 17  * The model is displayed using getValue().
    + 18  */
    + 19 
    + 20 #include <cvc5/cvc5.h>
    + 21 
    + 22 #include <iostream>
    + 23 
    + 24 using namespace std;
    + 25 using namespace cvc5;
    + 26 
    + 27 void prefixPrintGetValue(Solver& slv, Term t, int level = 0)
    + 28 {
    + 29   cout << "slv.getValue(" << t << "): " << slv.getValue(t) << endl;
    + 30 
    + 31   for (const Term& c : t)
    + 32   {
    + 33     prefixPrintGetValue(slv, c, level + 1);
    + 34   }
    + 35 }
    + 36 
    + 37 int main()
    + 38 {
    + 39   Solver slv;
    + 40   slv.setOption("produce-models", "true");  // Produce Models
    + 41   slv.setOption("dag-thresh", "0"); // Disable dagifying the output
    + 42   slv.setOption("output-language", "smt2"); // use smt-lib v2 as output language
    + 43   slv.setLogic(string("QF_UFLIRA"));
    + 44 
    + 45   // Sorts
    + 46   Sort u = slv.mkUninterpretedSort("u");
    + 47   Sort integer = slv.getIntegerSort();
    + 48   Sort boolean = slv.getBooleanSort();
    + 49   Sort uToInt = slv.mkFunctionSort({u}, integer);
    + 50   Sort intPred = slv.mkFunctionSort({integer}, boolean);
    + 51 
    + 52   // Variables
    + 53   Term x = slv.mkConst(u, "x");
    + 54   Term y = slv.mkConst(u, "y");
    + 55 
    + 56   // Functions
    + 57   Term f = slv.mkConst(uToInt, "f");
    + 58   Term p = slv.mkConst(intPred, "p");
    + 59 
    + 60   // Constants
    + 61   Term zero = slv.mkInteger(0);
    + 62   Term one = slv.mkInteger(1);
    + 63 
    + 64   // Terms
    + 65   Term f_x = slv.mkTerm(APPLY_UF, {f, x});
    + 66   Term f_y = slv.mkTerm(APPLY_UF, {f, y});
    + 67   Term sum = slv.mkTerm(ADD, {f_x, f_y});
    + 68   Term p_0 = slv.mkTerm(APPLY_UF, {p, zero});
    + 69   Term p_f_y = slv.mkTerm(APPLY_UF, {p, f_y});
    + 70 
    + 71   // Construct the assertions
    + 72   Term assertions =
    + 73       slv.mkTerm(AND,
    + 74                  {
    + 75                      slv.mkTerm(LEQ, {zero, f_x}),  // 0 <= f(x)
    + 76                      slv.mkTerm(LEQ, {zero, f_y}),  // 0 <= f(y)
    + 77                      slv.mkTerm(LEQ, {sum, one}),   // f(x) + f(y) <= 1
    + 78                      p_0.notTerm(),                 // not p(0)
    + 79                      p_f_y                          // p(f(y))
    + 80                  });
    + 81   slv.assertFormula(assertions);
    + 82 
    + 83   cout << "Given the following assertions:" << endl
    + 84        << assertions << endl << endl;
    + 85 
    + 86   cout << "Prove x /= y is entailed. " << endl
    + 87        << "cvc5: " << slv.checkSatAssuming(slv.mkTerm(EQUAL, {x, y})) << "."
    + 88        << endl
    + 89        << endl;
    + 90 
    + 91   cout << "Call checkSat to show that the assertions are satisfiable. "
    + 92        << endl
    + 93        << "cvc5: "
    + 94        << slv.checkSat() << "."<< endl << endl;
    + 95 
    + 96   cout << "Call slv.getValue(...) on terms of interest."
    + 97        << endl;
    + 98   cout << "slv.getValue(" << f_x << "): " << slv.getValue(f_x) << endl;
    + 99   cout << "slv.getValue(" << f_y << "): " << slv.getValue(f_y) << endl;
    +100   cout << "slv.getValue(" << sum << "): " << slv.getValue(sum) << endl;
    +101   cout << "slv.getValue(" << p_0 << "): " << slv.getValue(p_0) << endl;
    +102   cout << "slv.getValue(" << p_f_y << "): " << slv.getValue(p_f_y)
    +103        << endl << endl;
    +104 
    +105   cout << "Alternatively, iterate over assertions and call slv.getValue(...) "
    +106        << "on all terms."
    +107        << endl;
    +108   prefixPrintGetValue(slv, assertions);
    +109 
    +110   cout << endl;
    +111   cout << "You can also use nested loops to iterate over terms." << endl;
    +112   for (Term::const_iterator it = assertions.begin();
    +113        it != assertions.end();
    +114        ++it)
    +115   {
    +116     cout << "term: " << *it << endl;
    +117     for (Term::const_iterator it2 = (*it).begin();
    +118          it2 != (*it).end();
    +119          ++it2)
    +120     {
    +121       cout << " + child: " << *it2 << std::endl;
    +122     }
    +123   }
    +124   cout << endl;
    +125   cout << "Alternatively, you can also use for-each loops." << endl;
    +126   for (const Term& t : assertions)
    +127   {
    +128     cout << "term: " << t << endl;
    +129     for (const Term& c : t)
    +130     {
    +131       cout << " + child: " << c << endl;
    +132     }
    +133   }
    +134 
    +135   return 0;
    +136 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/datatypes.html b/cvc5-1.0.2/examples/datatypes.html new file mode 100644 index 0000000..ef45765 --- /dev/null +++ b/cvc5-1.0.2/examples/datatypes.html @@ -0,0 +1,1005 @@ + + + + + + + + Theory of Datatypes — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Datatypes + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/datatypes.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Aina Niemetz, Morgan Deters, Andrew Reynolds
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * An example of using inductive datatypes in cvc5.
    + 14  */
    + 15 
    + 16 #include <cvc5/cvc5.h>
    + 17 
    + 18 #include <iostream>
    + 19 
    + 20 using namespace cvc5;
    + 21 
    + 22 void test(Solver& slv, Sort& consListSort)
    + 23 {
    + 24   // Now our old "consListSpec" is useless--the relevant information
    + 25   // has been copied out, so we can throw that spec away.  We can get
    + 26   // the complete spec for the datatype from the DatatypeSort, and
    + 27   // this Datatype object has constructor symbols (and others) filled in.
    + 28 
    + 29   const Datatype& consList = consListSort.getDatatype();
    + 30 
    + 31   // t = cons 0 nil
    + 32   //
    + 33   // Here, consList["cons"] gives you the DatatypeConstructor.  To get
    + 34   // the constructor symbol for application, use .getConstructor("cons"),
    + 35   // which is equivalent to consList["cons"].getConstructor().  Note that
    + 36   // "nil" is a constructor too, so it needs to be applied with
    + 37   // APPLY_CONSTRUCTOR, even though it has no arguments.
    + 38   Term t = slv.mkTerm(APPLY_CONSTRUCTOR,
    + 39                       {consList.getConstructor("cons").getTerm(),
    + 40                        slv.mkInteger(0),
    + 41                        slv.mkTerm(APPLY_CONSTRUCTOR,
    + 42                                   {consList.getConstructor("nil").getTerm()})});
    + 43 
    + 44   std::cout << "t is " << t << std::endl
    + 45             << "sort of cons is "
    + 46             << consList.getConstructor("cons").getTerm().getSort() << std::endl
    + 47             << "sort of nil is "
    + 48             << consList.getConstructor("nil").getTerm().getSort() << std::endl;
    + 49 
    + 50   // t2 = head(cons 0 nil), and of course this can be evaluated
    + 51   //
    + 52   // Here we first get the DatatypeConstructor for cons (with
    + 53   // consList["cons"]) in order to get the "head" selector symbol
    + 54   // to apply.
    + 55   Term t2 = slv.mkTerm(APPLY_SELECTOR,
    + 56                        {consList["cons"].getSelector("head").getTerm(), t});
    + 57 
    + 58   std::cout << "t2 is " << t2 << std::endl
    + 59             << "simplify(t2) is " << slv.simplify(t2) << std::endl
    + 60             << std::endl;
    + 61 
    + 62   // You can also iterate over a Datatype to get all its constructors,
    + 63   // and over a DatatypeConstructor to get all its "args" (selectors)
    + 64   for (Datatype::const_iterator i = consList.begin(); i != consList.end(); ++i)
    + 65   {
    + 66     std::cout << "ctor: " << *i << std::endl;
    + 67     for (DatatypeConstructor::const_iterator j = (*i).begin(); j != (*i).end();
    + 68          ++j)
    + 69     {
    + 70       std::cout << " + arg: " << *j << std::endl;
    + 71     }
    + 72   }
    + 73   std::cout << std::endl;
    + 74 
    + 75   // Alternatively, you can use for each loops.
    + 76   for (const auto& c : consList)
    + 77   {
    + 78     std::cout << "ctor: " << c << std::endl;
    + 79     for (const auto& s : c)
    + 80     {
    + 81       std::cout << " + arg: " << s << std::endl;
    + 82     }
    + 83   }
    + 84   std::cout << std::endl;
    + 85 
    + 86   // You can also define a tester term for constructor 'cons': (_ is cons)
    + 87   Term t_is_cons =
    + 88       slv.mkTerm(APPLY_TESTER, {consList["cons"].getTesterTerm(), t});
    + 89   std::cout << "t_is_cons is " << t_is_cons << std::endl << std::endl;
    + 90   slv.assertFormula(t_is_cons);
    + 91   // Updating t at 'head' with value 1 is defined as follows:
    + 92   Term t_updated = slv.mkTerm(
    + 93       APPLY_UPDATER,
    + 94       {consList["cons"]["head"].getUpdaterTerm(), t, slv.mkInteger(1)});
    + 95   std::cout << "t_updated is " << t_updated << std::endl << std::endl;
    + 96   slv.assertFormula(slv.mkTerm(DISTINCT, {t, t_updated}));
    + 97 
    + 98   // You can also define parameterized datatypes.
    + 99   // This example builds a simple parameterized list of sort T, with one
    +100   // constructor "cons".
    +101   Sort sort = slv.mkParamSort("T");
    +102   DatatypeDecl paramConsListSpec =
    +103       slv.mkDatatypeDecl("paramlist", {sort});  // give the datatype a name
    +104   DatatypeConstructorDecl paramCons = slv.mkDatatypeConstructorDecl("cons");
    +105   DatatypeConstructorDecl paramNil = slv.mkDatatypeConstructorDecl("nil");
    +106   paramCons.addSelector("head", sort);
    +107   paramCons.addSelectorSelf("tail");
    +108   paramConsListSpec.addConstructor(paramCons);
    +109   paramConsListSpec.addConstructor(paramNil);
    +110 
    +111   Sort paramConsListSort = slv.mkDatatypeSort(paramConsListSpec);
    +112   Sort paramConsIntListSort =
    +113       paramConsListSort.instantiate(std::vector<Sort>{slv.getIntegerSort()});
    +114 
    +115   const Datatype& paramConsList = paramConsListSort.getDatatype();
    +116 
    +117   std::cout << "parameterized datatype sort is " << std::endl;
    +118   for (const DatatypeConstructor& ctor : paramConsList)
    +119   {
    +120     std::cout << "ctor: " << ctor << std::endl;
    +121     for (const DatatypeSelector& stor : ctor)
    +122     {
    +123       std::cout << " + arg: " << stor << std::endl;
    +124     }
    +125   }
    +126 
    +127   Term a = slv.mkConst(paramConsIntListSort, "a");
    +128   std::cout << "term " << a << " is of sort " << a.getSort() << std::endl;
    +129 
    +130   Term head_a = slv.mkTerm(
    +131       APPLY_SELECTOR, {paramConsList["cons"].getSelector("head").getTerm(), a});
    +132   std::cout << "head_a is " << head_a << " of sort " << head_a.getSort()
    +133             << std::endl
    +134             << "sort of cons is "
    +135             << paramConsList.getConstructor("cons").getTerm().getSort()
    +136             << std::endl
    +137             << std::endl;
    +138 
    +139   Term assertion = slv.mkTerm(GT, {head_a, slv.mkInteger(50)});
    +140   std::cout << "Assert " << assertion << std::endl;
    +141   slv.assertFormula(assertion);
    +142   std::cout << "Expect sat." << std::endl;
    +143   std::cout << "cvc5: " << slv.checkSat() << std::endl;
    +144 }
    +145 
    +146 int main()
    +147 {
    +148   Solver slv;
    +149   // This example builds a simple "cons list" of integers, with
    +150   // two constructors, "cons" and "nil."
    +151 
    +152   // Building a datatype consists of two steps.
    +153   // First, the datatype is specified.
    +154   // Second, it is "resolved" to an actual sort, at which point function
    +155   // symbols are assigned to its constructors, selectors, and testers.
    +156 
    +157   DatatypeDecl consListSpec =
    +158       slv.mkDatatypeDecl("list");  // give the datatype a name
    +159   DatatypeConstructorDecl cons = slv.mkDatatypeConstructorDecl("cons");
    +160   cons.addSelector("head", slv.getIntegerSort());
    +161   cons.addSelectorSelf("tail");
    +162   consListSpec.addConstructor(cons);
    +163   DatatypeConstructorDecl nil = slv.mkDatatypeConstructorDecl("nil");
    +164   consListSpec.addConstructor(nil);
    +165 
    +166   std::cout << "spec is:" << std::endl << consListSpec << std::endl;
    +167 
    +168   // Keep in mind that "DatatypeDecl" is the specification class for
    +169   // datatypes---"DatatypeDecl" is not itself a cvc5 Sort.
    +170   // Now that our Datatype is fully specified, we can get a Sort for it.
    +171   // This step resolves the "SelfSort" reference and creates
    +172   // symbols for all the constructors, etc.
    +173 
    +174   Sort consListSort = slv.mkDatatypeSort(consListSpec);
    +175 
    +176   test(slv, consListSort);
    +177 
    +178   std::cout << std::endl
    +179             << ">>> Alternatively, use declareDatatype" << std::endl;
    +180   std::cout << std::endl;
    +181 
    +182   DatatypeConstructorDecl cons2 = slv.mkDatatypeConstructorDecl("cons");
    +183   cons2.addSelector("head", slv.getIntegerSort());
    +184   cons2.addSelectorSelf("tail");
    +185   DatatypeConstructorDecl nil2 = slv.mkDatatypeConstructorDecl("nil");
    +186   std::vector<DatatypeConstructorDecl> ctors = {cons2, nil2};
    +187   Sort consListSort2 = slv.declareDatatype("list2", ctors);
    +188   test(slv, consListSort2);
    +189 
    +190   return 0;
    +191 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/examples.html b/cvc5-1.0.2/examples/examples.html new file mode 100644 index 0000000..bb2d4ce --- /dev/null +++ b/cvc5-1.0.2/examples/examples.html @@ -0,0 +1,448 @@ + + + + + + + + Examples — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Examples +
    • +
    • +
    • +
    +
    +
    + + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/exceptions.html b/cvc5-1.0.2/examples/exceptions.html new file mode 100644 index 0000000..518f3ed --- /dev/null +++ b/cvc5-1.0.2/examples/exceptions.html @@ -0,0 +1,529 @@ + + + + + + + + Exception Handling — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Exception Handling + + ¶ + +

    +
    +
    + + + +
    +
    +

    + + examples/api/java/Exceptions.java + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Mudathir Mohamed, Andres Noetzli
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * Catching cvc5 exceptions via the Java API.
    +14  *
    +15  * A simple demonstration of catching cvc5 execptions via the Java API.
    +16  */
    +17 
    +18 import io.github.cvc5.*;
    +19 
    +20 public class Exceptions
    +21 {
    +22   public static void main(String[] args)
    +23   {
    +24     try (Solver solver = new Solver())
    +25     {
    +26       solver.setOption("produce-models", "true");
    +27 
    +28       // Setting an invalid option
    +29       try
    +30       {
    +31         solver.setOption("non-existing", "true");
    +32         System.exit(1);
    +33       }
    +34       catch (Exception e)
    +35       {
    +36         System.out.println(e.toString());
    +37       }
    +38 
    +39       // Creating a term with an invalid type
    +40       try
    +41       {
    +42         Sort integer = solver.getIntegerSort();
    +43         Term x = solver.mkVar(integer, "x");
    +44         Term invalidTerm = solver.mkTerm(Kind.AND, x, x);
    +45         solver.checkSatAssuming(invalidTerm);
    +46         System.exit(1);
    +47       }
    +48       catch (Exception e)
    +49       {
    +50         System.out.println(e.toString());
    +51       }
    +52 
    +53       // Asking for a model after unsat result
    +54       try
    +55       {
    +56         solver.checkSatAssuming(solver.mkBoolean(false));
    +57         solver.getModel(new Sort[] {}, new Term[] {});
    +58         System.exit(1);
    +59       }
    +60       catch (Exception e)
    +61       {
    +62         System.out.println(e.toString());
    +63       }
    +64     }
    +65   }
    +66 }
    +
    +
    +
    +
    + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/extract.html b/cvc5-1.0.2/examples/extract.html new file mode 100644 index 0000000..11825c9 --- /dev/null +++ b/cvc5-1.0.2/examples/extract.html @@ -0,0 +1,609 @@ + + + + + + + + Theory of Bit-Vectors: extract — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + + Examples + + » +
    • +
    • + Theory of Bit-Vectors: + + + extract + + +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Theory of Bit-Vectors: + + + extract + + + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/extract.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Mathias Preiner, Aina Niemetz, Clark Barrett
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of the solving capabilities of the cvc5
    +14  * bit-vector solver.
    +15  *
    +16  */
    +17 
    +18 #include <cvc5/cvc5.h>
    +19 
    +20 #include <iostream>
    +21 
    +22 using namespace std;
    +23 using namespace cvc5;
    +24 
    +25 int main()
    +26 {
    +27   Solver slv;
    +28   slv.setLogic("QF_BV"); // Set the logic
    +29 
    +30   Sort bitvector32 = slv.mkBitVectorSort(32);
    +31 
    +32   Term x = slv.mkConst(bitvector32, "a");
    +33 
    +34   Op ext_31_1 = slv.mkOp(BITVECTOR_EXTRACT, {31, 1});
    +35   Term x_31_1 = slv.mkTerm(ext_31_1, {x});
    +36 
    +37   Op ext_30_0 = slv.mkOp(BITVECTOR_EXTRACT, {30, 0});
    +38   Term x_30_0 = slv.mkTerm(ext_30_0, {x});
    +39 
    +40   Op ext_31_31 = slv.mkOp(BITVECTOR_EXTRACT, {31, 31});
    +41   Term x_31_31 = slv.mkTerm(ext_31_31, {x});
    +42 
    +43   Op ext_0_0 = slv.mkOp(BITVECTOR_EXTRACT, {0, 0});
    +44   Term x_0_0 = slv.mkTerm(ext_0_0, {x});
    +45 
    +46   Term eq = slv.mkTerm(EQUAL, {x_31_1, x_30_0});
    +47   cout << " Asserting: " << eq << endl;
    +48   slv.assertFormula(eq);
    +49 
    +50   Term eq2 = slv.mkTerm(EQUAL, {x_31_31, x_0_0});
    +51   cout << " Check sat assuming: " << eq2.notTerm() << endl;
    +52   cout << " Expect UNSAT. " << endl;
    +53   cout << " cvc5: " << slv.checkSatAssuming(eq2.notTerm()) << endl;
    +54 
    +55   return 0;
    +56 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/floatingpoint.html b/cvc5-1.0.2/examples/floatingpoint.html new file mode 100644 index 0000000..e095857 --- /dev/null +++ b/cvc5-1.0.2/examples/floatingpoint.html @@ -0,0 +1,745 @@ + + + + + + + + Theory of Floating-Points — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Floating-Points + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/floating_point_arith.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Mudathir Mohamed, Mathias Preiner, Andres Noetzli
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * An example of solving floating-point problems with cvc5's cpp API
    + 14  *
    + 15  * This example shows to create floating-point types, variables and expressions,
    + 16  * and how to create rounding mode constants by solving toy problems. The
    + 17  * example also shows making special values (such as NaN and +oo) and converting
    + 18  * an IEEE 754-2008 bit-vector to a floating-point number.
    + 19  */
    + 20 
    + 21 #include <cvc5/cvc5.h>
    + 22 
    + 23 #include <iostream>
    + 24 #include <cassert>
    + 25 
    + 26 using namespace std;
    + 27 using namespace cvc5;
    + 28 
    + 29 int main()
    + 30 {
    + 31   Solver solver;
    + 32   solver.setOption("produce-models", "true");
    + 33 
    + 34   // Make single precision floating-point variables
    + 35   Sort fpt32 = solver.mkFloatingPointSort(8, 24);
    + 36   Term a = solver.mkConst(fpt32, "a");
    + 37   Term b = solver.mkConst(fpt32, "b");
    + 38   Term c = solver.mkConst(fpt32, "c");
    + 39   Term d = solver.mkConst(fpt32, "d");
    + 40   Term e = solver.mkConst(fpt32, "e");
    + 41 
    + 42   // Assert that floating-point addition is not associative:
    + 43   // (a + (b + c)) != ((a + b) + c)
    + 44   Term rm = solver.mkRoundingMode(ROUND_NEAREST_TIES_TO_EVEN);
    + 45   Term lhs = solver.mkTerm(
    + 46       FLOATINGPOINT_ADD, {rm, a, solver.mkTerm(FLOATINGPOINT_ADD, {rm, b, c})});
    + 47   Term rhs = solver.mkTerm(
    + 48       FLOATINGPOINT_ADD, {rm, solver.mkTerm(FLOATINGPOINT_ADD, {rm, a, b}), c});
    + 49   solver.assertFormula(solver.mkTerm(NOT, {solver.mkTerm(EQUAL, {a, b})}));
    + 50 
    + 51   Result r = solver.checkSat();  // result is sat
    + 52   assert (r.isSat());
    + 53 
    + 54   cout << "a = " << solver.getValue(a) << endl;
    + 55   cout << "b = " << solver.getValue(b) << endl;
    + 56   cout << "c = " << solver.getValue(c) << endl;
    + 57 
    + 58   // Now, let's restrict `a` to be either NaN or positive infinity
    + 59   Term nan = solver.mkFloatingPointNaN(8, 24);
    + 60   Term inf = solver.mkFloatingPointPosInf(8, 24);
    + 61   solver.assertFormula(solver.mkTerm(
    + 62       OR, {solver.mkTerm(EQUAL, {a, inf}), solver.mkTerm(EQUAL, {a, nan})}));
    + 63 
    + 64   r = solver.checkSat();  // result is sat
    + 65   assert (r.isSat());
    + 66 
    + 67   cout << "a = " << solver.getValue(a) << endl;
    + 68   cout << "b = " << solver.getValue(b) << endl;
    + 69   cout << "c = " << solver.getValue(c) << endl;
    + 70 
    + 71   // And now for something completely different. Let's try to find a (normal)
    + 72   // floating-point number that rounds to different integer values for
    + 73   // different rounding modes.
    + 74   Term rtp = solver.mkRoundingMode(ROUND_TOWARD_POSITIVE);
    + 75   Term rtn = solver.mkRoundingMode(ROUND_TOWARD_NEGATIVE);
    + 76   Op op = solver.mkOp(FLOATINGPOINT_TO_SBV, {16});  // (_ fp.to_sbv 16)
    + 77   lhs = solver.mkTerm(op, {rtp, d});
    + 78   rhs = solver.mkTerm(op, {rtn, d});
    + 79   solver.assertFormula(solver.mkTerm(FLOATINGPOINT_IS_NORMAL, {d}));
    + 80   solver.assertFormula(solver.mkTerm(NOT, {solver.mkTerm(EQUAL, {lhs, rhs})}));
    + 81 
    + 82   r = solver.checkSat();  // result is sat
    + 83   assert (r.isSat());
    + 84 
    + 85   // Convert the result to a rational and print it
    + 86   Term val = solver.getValue(d);
    + 87   Term realVal = solver.getValue(solver.mkTerm(FLOATINGPOINT_TO_REAL, {val}));
    + 88   cout << "d = " << val << " = " << realVal << endl;
    + 89   cout << "((_ fp.to_sbv 16) RTP d) = " << solver.getValue(lhs) << endl;
    + 90   cout << "((_ fp.to_sbv 16) RTN d) = " << solver.getValue(rhs) << endl;
    + 91 
    + 92   // For our final trick, let's try to find a floating-point number between
    + 93   // positive zero and the smallest positive floating-point number
    + 94   Term zero = solver.mkFloatingPointPosZero(8, 24);
    + 95   Term smallest = solver.mkFloatingPoint(8, 24, solver.mkBitVector(32, 0b001));
    + 96   solver.assertFormula(
    + 97       solver.mkTerm(AND,
    + 98                     {solver.mkTerm(FLOATINGPOINT_LT, {zero, e}),
    + 99                      solver.mkTerm(FLOATINGPOINT_LT, {e, smallest})}));
    +100 
    +101   r = solver.checkSat();  // result is unsat
    +102   assert (!r.isSat());
    +103 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/helloworld.html b/cvc5-1.0.2/examples/helloworld.html new file mode 100644 index 0000000..a65cc88 --- /dev/null +++ b/cvc5-1.0.2/examples/helloworld.html @@ -0,0 +1,512 @@ + + + + + + + + Hello World — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Hello World + + ¶ + +

    +

    + This example shows the very basic usage of the API. +We create a solver, declare a Boolean variable and check whether it is entailed (by + + + true + + + , as nothing has been asserted to the solver). +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/helloworld.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Aina Niemetz, Tim King, Andrew Reynolds
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A very simple cvc5 example.
    +14  */
    +15 
    +16 #include <cvc5/cvc5.h>
    +17 
    +18 #include <iostream>
    +19 
    +20 using namespace cvc5;
    +21 
    +22 int main()
    +23 {
    +24   Solver slv;
    +25   Term helloworld = slv.mkConst(slv.getBooleanSort(), "Hello World!");
    +26   std::cout << helloworld << " is " << slv.checkSatAssuming(helloworld)
    +27             << std::endl;
    +28   return 0;
    +29 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/lineararith.html b/cvc5-1.0.2/examples/lineararith.html new file mode 100644 index 0000000..9a27b29 --- /dev/null +++ b/cvc5-1.0.2/examples/lineararith.html @@ -0,0 +1,746 @@ + + + + + + + + Theory of Linear Arithmetic — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Linear Arithmetic + + ¶ + +

    +

    + This example asserts three constraints over an integer variable + + + x + + + and a real variable + + + y + + + . +Firstly, it checks that these constraints entail an upper bound on the difference + + + y + + + - + + + x + + + <= + + + 2/3 + + + . +Secondly, it checks that this bound is tight by asserting + + + y + + + - + + + x + + + = + + + 2/3 + + + and checking for satisfiability. +The two checks are separated by using + + + push + + + and + + + pop + + + . +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/linear_arith.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Aina Niemetz, Tim King, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of the linear arithmetic solving capabilities and
    +14  * the push pop of cvc5. This also gives an example option.
    +15  */
    +16 
    +17 #include <iostream>
    +18 
    +19 #include <cvc5/cvc5.h>
    +20 
    +21 using namespace std;
    +22 using namespace cvc5;
    +23 
    +24 int main()
    +25 {
    +26   Solver slv;
    +27   slv.setLogic("QF_LIRA"); // Set the logic
    +28 
    +29   // Prove that if given x (Integer) and y (Real) then
    +30   // the maximum value of y - x is 2/3
    +31 
    +32   // Sorts
    +33   Sort real = slv.getRealSort();
    +34   Sort integer = slv.getIntegerSort();
    +35 
    +36   // Variables
    +37   Term x = slv.mkConst(integer, "x");
    +38   Term y = slv.mkConst(real, "y");
    +39 
    +40   // Constants
    +41   Term three = slv.mkInteger(3);
    +42   Term neg2 = slv.mkInteger(-2);
    +43   Term two_thirds = slv.mkReal(2, 3);
    +44 
    +45   // Terms
    +46   Term three_y = slv.mkTerm(MULT, {three, y});
    +47   Term diff = slv.mkTerm(SUB, {y, x});
    +48 
    +49   // Formulas
    +50   Term x_geq_3y = slv.mkTerm(GEQ, {x, three_y});
    +51   Term x_leq_y = slv.mkTerm(LEQ, {x, y});
    +52   Term neg2_lt_x = slv.mkTerm(LT, {neg2, x});
    +53 
    +54   Term assertions = slv.mkTerm(AND, {x_geq_3y, x_leq_y, neg2_lt_x});
    +55 
    +56   cout << "Given the assertions " << assertions << endl;
    +57   slv.assertFormula(assertions);
    +58 
    +59 
    +60   slv.push();
    +61   Term diff_leq_two_thirds = slv.mkTerm(LEQ, {diff, two_thirds});
    +62   cout << "Prove that " << diff_leq_two_thirds << " with cvc5." << endl;
    +63   cout << "cvc5 should report UNSAT." << endl;
    +64   cout << "Result from cvc5 is: "
    +65        << slv.checkSatAssuming(diff_leq_two_thirds.notTerm()) << endl;
    +66   slv.pop();
    +67 
    +68   cout << endl;
    +69 
    +70   slv.push();
    +71   Term diff_is_two_thirds = slv.mkTerm(EQUAL, {diff, two_thirds});
    +72   slv.assertFormula(diff_is_two_thirds);
    +73   cout << "Show that the assertions are consistent with " << endl;
    +74   cout << diff_is_two_thirds << " with cvc5." << endl;
    +75   cout << "cvc5 should report SAT." << endl;
    +76   cout << "Result from cvc5 is: " << slv.checkSat() << endl;
    +77   slv.pop();
    +78 
    +79   cout << "Thus the maximum value of (y - x) is 2/3."<< endl;
    +80 
    +81   return 0;
    +82 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/quickstart.html b/cvc5-1.0.2/examples/quickstart.html new file mode 100644 index 0000000..5584914 --- /dev/null +++ b/cvc5-1.0.2/examples/quickstart.html @@ -0,0 +1,1126 @@ + + + + + + + + Quickstart Example — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Quickstart Example + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/quickstart.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Yoni Zohar, Gereon Kremer, Mathias Preiner
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of the api capabilities of cvc5.
    + 14  *
    + 15  */
    + 16 
    + 17 #include <cvc5/cvc5.h>
    + 18 
    + 19 #include <iostream>
    + 20 #include <numeric>
    + 21 
    + 22 using namespace cvc5;
    + 23 
    + 24 int main()
    + 25 {
    + 26   // Create a solver
    + 27   //! [docs-cpp-quickstart-1 start]
    + 28   Solver solver;
    + 29   //! [docs-cpp-quickstart-1 end]
    + 30 
    + 31   // We will ask the solver to produce models and unsat cores,
    + 32   // hence these options should be turned on.
    + 33   //! [docs-cpp-quickstart-2 start]
    + 34   solver.setOption("produce-models", "true");
    + 35   solver.setOption("produce-unsat-cores", "true");
    + 36   //! [docs-cpp-quickstart-2 end]
    + 37 
    + 38   // The simplest way to set a logic for the solver is to choose "ALL".
    + 39   // This enables all logics in the solver.
    + 40   // Alternatively, "QF_ALL" enables all logics without quantifiers.
    + 41   // To optimize the solver's behavior for a more specific logic,
    + 42   // use the logic name, e.g. "QF_BV" or "QF_AUFBV".
    + 43 
    + 44   // Set the logic
    + 45   //! [docs-cpp-quickstart-3 start]
    + 46   solver.setLogic("ALL");
    + 47   //! [docs-cpp-quickstart-3 end]
    + 48 
    + 49   // In this example, we will define constraints over reals and integers.
    + 50   // Hence, we first obtain the corresponding sorts.
    + 51   //! [docs-cpp-quickstart-4 start]
    + 52   Sort realSort = solver.getRealSort();
    + 53   Sort intSort = solver.getIntegerSort();
    + 54   //! [docs-cpp-quickstart-4 end]
    + 55 
    + 56   // x and y will be real variables, while a and b will be integer variables.
    + 57   // Formally, their cpp type is Term,
    + 58   // and they are called "constants" in SMT jargon:
    + 59   //! [docs-cpp-quickstart-5 start]
    + 60   Term x = solver.mkConst(realSort, "x");
    + 61   Term y = solver.mkConst(realSort, "y");
    + 62   Term a = solver.mkConst(intSort, "a");
    + 63   Term b = solver.mkConst(intSort, "b");
    + 64   //! [docs-cpp-quickstart-5 end]
    + 65 
    + 66   // Our constraints regarding x and y will be:
    + 67   //
    + 68   //   (1)  0 < x
    + 69   //   (2)  0 < y
    + 70   //   (3)  x + y < 1
    + 71   //   (4)  x <= y
    + 72   //
    + 73 
    + 74   //! [docs-cpp-quickstart-6 start]
    + 75   // Formally, constraints are also terms. Their sort is Boolean.
    + 76   // We will construct these constraints gradually,
    + 77   // by defining each of their components.
    + 78   // We start with the constant numerals 0 and 1:
    + 79   Term zero = solver.mkReal(0);
    + 80   Term one = solver.mkReal(1);
    + 81 
    + 82   // Next, we construct the term x + y
    + 83   Term xPlusY = solver.mkTerm(ADD, {x, y});
    + 84 
    + 85   // Now we can define the constraints.
    + 86   // They use the operators +, <=, and <.
    + 87   // In the API, these are denoted by ADD, LEQ, and LT.
    + 88   // A list of available operators is available in:
    + 89   // src/api/cpp/cvc5_kind.h
    + 90   Term constraint1 = solver.mkTerm(LT, {zero, x});
    + 91   Term constraint2 = solver.mkTerm(LT, {zero, y});
    + 92   Term constraint3 = solver.mkTerm(LT, {xPlusY, one});
    + 93   Term constraint4 = solver.mkTerm(LEQ, {x, y});
    + 94 
    + 95   // Now we assert the constraints to the solver.
    + 96   solver.assertFormula(constraint1);
    + 97   solver.assertFormula(constraint2);
    + 98   solver.assertFormula(constraint3);
    + 99   solver.assertFormula(constraint4);
    +100   //! [docs-cpp-quickstart-6 end]
    +101 
    +102   // Check if the formula is satisfiable, that is,
    +103   // are there real values for x and y that satisfy all the constraints?
    +104   //! [docs-cpp-quickstart-7 start]
    +105   Result r1 = solver.checkSat();
    +106   //! [docs-cpp-quickstart-7 end]
    +107 
    +108   // The result is either SAT, UNSAT, or UNKNOWN.
    +109   // In this case, it is SAT.
    +110   //! [docs-cpp-quickstart-8 start]
    +111   std::cout << "expected: sat" << std::endl;
    +112   std::cout << "result: " << r1 << std::endl;
    +113   //! [docs-cpp-quickstart-8 end]
    +114 
    +115   // We can get the values for x and y that satisfy the constraints.
    +116   //! [docs-cpp-quickstart-9 start]
    +117   Term xVal = solver.getValue(x);
    +118   Term yVal = solver.getValue(y);
    +119   //! [docs-cpp-quickstart-9 end]
    +120 
    +121   // It is also possible to get values for compound terms,
    +122   // even if those did not appear in the original formula.
    +123   //! [docs-cpp-quickstart-10 start]
    +124   Term xMinusY = solver.mkTerm(SUB, {x, y});
    +125   Term xMinusYVal = solver.getValue(xMinusY);
    +126   //! [docs-cpp-quickstart-10 end]
    +127 
    +128   // We can now obtain the string representations of the values.
    +129   //! [docs-cpp-quickstart-11 start]
    +130   std::string xStr = xVal.getRealValue();
    +131   std::string yStr = yVal.getRealValue();
    +132   std::string xMinusYStr = xMinusYVal.getRealValue();
    +133 
    +134   std::cout << "value for x: " << xStr << std::endl;
    +135   std::cout << "value for y: " << yStr << std::endl;
    +136   std::cout << "value for x - y: " << xMinusYStr << std::endl;
    +137   //! [docs-cpp-quickstart-11 end]
    +138 
    +139   //! [docs-cpp-quickstart-12 start]
    +140   // Further, we can convert the values to cpp types
    +141   std::pair<int64_t, uint64_t> xPair = xVal.getReal64Value();
    +142   std::pair<int64_t, uint64_t> yPair = yVal.getReal64Value();
    +143   std::pair<int64_t, uint64_t> xMinusYPair = xMinusYVal.getReal64Value();
    +144 
    +145   std::cout << "value for x: " << xPair.first << "/" << xPair.second
    +146             << std::endl;
    +147   std::cout << "value for y: " << yPair.first << "/" << yPair.second
    +148             << std::endl;
    +149   std::cout << "value for x - y: " << xMinusYPair.first << "/"
    +150             << xMinusYPair.second << std::endl;
    +151   //! [docs-cpp-quickstart-12 end]
    +152 
    +153   // Another way to independently compute the value of x - y would be
    +154   // to perform the (rational) arithmetic manually.
    +155   // However, for more complex terms,
    +156   // it is easier to let the solver do the evaluation.
    +157   //! [docs-cpp-quickstart-13 start]
    +158   std::pair<int64_t, uint64_t> xMinusYComputed = {
    +159     xPair.first * yPair.second - xPair.second * yPair.first,
    +160     xPair.second * yPair.second
    +161   };
    +162   uint64_t g = std::gcd(xMinusYComputed.first, xMinusYComputed.second);
    +163   xMinusYComputed = { xMinusYComputed.first / g, xMinusYComputed.second / g };
    +164   if (xMinusYComputed == xMinusYPair)
    +165   {
    +166     std::cout << "computed correctly" << std::endl;
    +167   }
    +168   else
    +169   {
    +170     std::cout << "computed incorrectly" << std::endl;
    +171   }
    +172   //! [docs-cpp-quickstart-13 end]
    +173 
    +174   // Next, we will check satisfiability of the same formula,
    +175   // only this time over integer variables a and b.
    +176 
    +177   // We start by resetting assertions added to the solver.
    +178   //! [docs-cpp-quickstart-14 start]
    +179   solver.resetAssertions();
    +180   //! [docs-cpp-quickstart-14 end]
    +181 
    +182   // Next, we assert the same assertions above with integers.
    +183   // This time, we inline the construction of terms
    +184   // to the assertion command.
    +185   //! [docs-cpp-quickstart-15 start]
    +186   solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), a}));
    +187   solver.assertFormula(solver.mkTerm(LT, {solver.mkInteger(0), b}));
    +188   solver.assertFormula(
    +189       solver.mkTerm(LT, {solver.mkTerm(ADD, {a, b}), solver.mkInteger(1)}));
    +190   solver.assertFormula(solver.mkTerm(LEQ, {a, b}));
    +191   //! [docs-cpp-quickstart-15 end]
    +192 
    +193   // We check whether the revised assertion is satisfiable.
    +194   //! [docs-cpp-quickstart-16 start]
    +195   Result r2 = solver.checkSat();
    +196   //! [docs-cpp-quickstart-16 end]
    +197 
    +198   // This time the formula is unsatisfiable
    +199   //! [docs-cpp-quickstart-17 start]
    +200   std::cout << "expected: unsat" << std::endl;
    +201   std::cout << "result: " << r2 << std::endl;
    +202   //! [docs-cpp-quickstart-17 end]
    +203 
    +204   // We can query the solver for an unsatisfiable core, i.e., a subset
    +205   // of the assertions that is already unsatisfiable.
    +206   //! [docs-cpp-quickstart-18 start]
    +207   std::vector<Term> unsatCore = solver.getUnsatCore();
    +208   std::cout << "unsat core size: " << unsatCore.size() << std::endl;
    +209   std::cout << "unsat core: " << std::endl;
    +210   for (const Term& t : unsatCore)
    +211   {
    +212     std::cout << t << std::endl;
    +213   }
    +214   //! [docs-cpp-quickstart-18 end]
    +215 
    +216   return 0;
    +217 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/relations.html b/cvc5-1.0.2/examples/relations.html new file mode 100644 index 0000000..273f522 --- /dev/null +++ b/cvc5-1.0.2/examples/relations.html @@ -0,0 +1,1049 @@ + + + + + + + + Theory of Relations — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Relations + + ¶ + +

    +

    + This simple example demonstrates the combined + + theory of finite sets and finite relations + + using a family tree. +Relations are defined as sets of tuples with arity + + \(\geq 1\) + + . +The example includes the unary relations + + \(people, males,\) + + and + + \(females\) + + and the binary relations + + \(father, mother, parent, ancestor\) + + , and + + \(descendant\) + + . +

    +

    + We have the following list of constraints: +

    +
      +
    • +

      + All relations are nonempty. +

      +
    • +
    • +

      + People is the universe set. +

      +
    • +
    • +

      + Males and females are disjoint sets (i.e., + + \(males \cap females = \phi\) + + ). +

      +
    • +
    • +

      + Fathers are males (i.e., + + \(father \bowtie people \subseteq males\) + + ) + + + [ + + * + + ] + + + . +

      +
    • +
    • +

      + Mothers are females (i.e., + + \(mother \bowtie people \subseteq females\) + + ). +

      +
    • +
    • +

      + A parent is a father or a mother (i.e., + + \(parent = father \cup mother\) + + ). +

      +
    • +
    • +

      + Ancestor relation is the transitive closure of parent (i.e., + + \(ancestor = parent^{+}\) + + ). +

      +
    • +
    • +

      + Descendant relation is the transpose of ancestor (i.e., + + \(descendant = ancestor^{-1}\) + + ). +

      +
    • +
    • +

      + No self ancestor (i.e., + + \(\forall x: Person. \langle x, x \rangle \not\in ancestor\) + + ). +

      +
    • +
    + +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/relations.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Mudathir Mohamed, Mathias Preiner
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of reasoning about relations with cvc5 via C++ API.
    + 14  */
    + 15 
    + 16 #include <cvc5/cvc5.h>
    + 17 
    + 18 #include <iostream>
    + 19 
    + 20 using namespace cvc5;
    + 21 
    + 22 int main()
    + 23 {
    + 24   Solver solver;
    + 25 
    + 26   // Set the logic
    + 27   solver.setLogic("ALL");
    + 28 
    + 29   // options
    + 30   solver.setOption("produce-models", "true");
    + 31   // we need finite model finding to answer sat problems with universal
    + 32   // quantified formulas
    + 33   solver.setOption("finite-model-find", "true");
    + 34   // we need sets extension to support set.universe operator
    + 35   solver.setOption("sets-ext", "true");
    + 36 
    + 37   // (declare-sort Person 0)
    + 38   Sort personSort = solver.mkUninterpretedSort("Person");
    + 39 
    + 40   // (Tuple Person)
    + 41   Sort tupleArity1 = solver.mkTupleSort({personSort});
    + 42   // (Relation Person)
    + 43   Sort relationArity1 = solver.mkSetSort(tupleArity1);
    + 44 
    + 45   // (Tuple Person Person)
    + 46   Sort tupleArity2 = solver.mkTupleSort({personSort, personSort});
    + 47   // (Relation Person Person)
    + 48   Sort relationArity2 = solver.mkSetSort(tupleArity2);
    + 49 
    + 50   // empty set
    + 51   Term emptySetTerm = solver.mkEmptySet(relationArity1);
    + 52 
    + 53   // empty relation
    + 54   Term emptyRelationTerm = solver.mkEmptySet(relationArity2);
    + 55 
    + 56   // universe set
    + 57   Term universeSet = solver.mkUniverseSet(relationArity1);
    + 58 
    + 59   // variables
    + 60   Term people = solver.mkConst(relationArity1, "people");
    + 61   Term males = solver.mkConst(relationArity1, "males");
    + 62   Term females = solver.mkConst(relationArity1, "females");
    + 63   Term father = solver.mkConst(relationArity2, "father");
    + 64   Term mother = solver.mkConst(relationArity2, "mother");
    + 65   Term parent = solver.mkConst(relationArity2, "parent");
    + 66   Term ancestor = solver.mkConst(relationArity2, "ancestor");
    + 67   Term descendant = solver.mkConst(relationArity2, "descendant");
    + 68 
    + 69   Term isEmpty1 = solver.mkTerm(EQUAL, {males, emptySetTerm});
    + 70   Term isEmpty2 = solver.mkTerm(EQUAL, {females, emptySetTerm});
    + 71 
    + 72   // (assert (= people (as set.universe (Relation Person))))
    + 73   Term peopleAreTheUniverse = solver.mkTerm(EQUAL, {people, universeSet});
    + 74   // (assert (not (= males (as set.empty (Relation Person)))))
    + 75   Term maleSetIsNotEmpty = solver.mkTerm(NOT, {isEmpty1});
    + 76   // (assert (not (= females (as set.empty (Relation Person)))))
    + 77   Term femaleSetIsNotEmpty = solver.mkTerm(NOT, {isEmpty2});
    + 78 
    + 79   // (assert (= (set.inter males females)
    + 80   //            (as set.empty (Relation Person))))
    + 81   Term malesFemalesIntersection = solver.mkTerm(SET_INTER, {males, females});
    + 82   Term malesAndFemalesAreDisjoint =
    + 83       solver.mkTerm(EQUAL, {malesFemalesIntersection, emptySetTerm});
    + 84 
    + 85   // (assert (not (= father (as set.empty (Relation Person Person)))))
    + 86   // (assert (not (= mother (as set.empty (Relation Person Person)))))
    + 87   Term isEmpty3 = solver.mkTerm(EQUAL, {father, emptyRelationTerm});
    + 88   Term isEmpty4 = solver.mkTerm(EQUAL, {mother, emptyRelationTerm});
    + 89   Term fatherIsNotEmpty = solver.mkTerm(NOT, {isEmpty3});
    + 90   Term motherIsNotEmpty = solver.mkTerm(NOT, {isEmpty4});
    + 91 
    + 92   // fathers are males
    + 93   // (assert (set.subset (rel.join father people) males))
    + 94   Term fathers = solver.mkTerm(RELATION_JOIN, {father, people});
    + 95   Term fathersAreMales = solver.mkTerm(SET_SUBSET, {fathers, males});
    + 96 
    + 97   // mothers are females
    + 98   // (assert (set.subset (rel.join mother people) females))
    + 99   Term mothers = solver.mkTerm(RELATION_JOIN, {mother, people});
    +100   Term mothersAreFemales = solver.mkTerm(SET_SUBSET, {mothers, females});
    +101 
    +102   // (assert (= parent (set.union father mother)))
    +103   Term unionFatherMother = solver.mkTerm(SET_UNION, {father, mother});
    +104   Term parentIsFatherOrMother =
    +105       solver.mkTerm(EQUAL, {parent, unionFatherMother});
    +106 
    +107   // (assert (= ancestor (rel.tclosure parent)))
    +108   Term transitiveClosure = solver.mkTerm(RELATION_TCLOSURE, {parent});
    +109   Term ancestorFormula = solver.mkTerm(EQUAL, {ancestor, transitiveClosure});
    +110 
    +111   // (assert (= descendant (rel.transpose descendant)))
    +112   Term transpose = solver.mkTerm(RELATION_TRANSPOSE, {ancestor});
    +113   Term descendantFormula = solver.mkTerm(EQUAL, {descendant, transpose});
    +114 
    +115   // (assert (forall ((x Person)) (not (set.member (tuple x x) ancestor))))
    +116   Term x = solver.mkVar(personSort, "x");
    +117   Term xxTuple = solver.mkTuple({personSort, personSort}, {x, x});
    +118   Term member = solver.mkTerm(SET_MEMBER, {xxTuple, ancestor});
    +119   Term notMember = solver.mkTerm(NOT, {member});
    +120 
    +121   Term quantifiedVariables = solver.mkTerm(VARIABLE_LIST, {x});
    +122   Term noSelfAncestor = solver.mkTerm(FORALL, {quantifiedVariables, notMember});
    +123 
    +124   // formulas
    +125   solver.assertFormula(peopleAreTheUniverse);
    +126   solver.assertFormula(maleSetIsNotEmpty);
    +127   solver.assertFormula(femaleSetIsNotEmpty);
    +128   solver.assertFormula(malesAndFemalesAreDisjoint);
    +129   solver.assertFormula(fatherIsNotEmpty);
    +130   solver.assertFormula(motherIsNotEmpty);
    +131   solver.assertFormula(fathersAreMales);
    +132   solver.assertFormula(mothersAreFemales);
    +133   solver.assertFormula(parentIsFatherOrMother);
    +134   solver.assertFormula(descendantFormula);
    +135   solver.assertFormula(ancestorFormula);
    +136   solver.assertFormula(noSelfAncestor);
    +137 
    +138   // check sat
    +139   Result result = solver.checkSat();
    +140 
    +141   // output
    +142   std::cout << "Result     = " << result << std::endl;
    +143   std::cout << "people     = " << solver.getValue(people) << std::endl;
    +144   std::cout << "males      = " << solver.getValue(males) << std::endl;
    +145   std::cout << "females    = " << solver.getValue(females) << std::endl;
    +146   std::cout << "father     = " << solver.getValue(father) << std::endl;
    +147   std::cout << "mother     = " << solver.getValue(mother) << std::endl;
    +148   std::cout << "parent     = " << solver.getValue(parent) << std::endl;
    +149   std::cout << "descendant = " << solver.getValue(descendant) << std::endl;
    +150   std::cout << "ancestor   = " << solver.getValue(ancestor) << std::endl;
    +151 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/sequences.html b/cvc5-1.0.2/examples/sequences.html new file mode 100644 index 0000000..f25ba8f --- /dev/null +++ b/cvc5-1.0.2/examples/sequences.html @@ -0,0 +1,608 @@ + + + + + + + + Theory of Sequences — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Sequences + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/sequences.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Andres Noetzli, Mathias Preiner, Aina Niemetz
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of reasoning about sequences with cvc5 via C++ API.
    +14  */
    +15 
    +16 #include <cvc5/cvc5.h>
    +17 
    +18 #include <iostream>
    +19 
    +20 using namespace cvc5;
    +21 
    +22 int main()
    +23 {
    +24   Solver slv;
    +25 
    +26   // Set the logic
    +27   slv.setLogic("QF_SLIA");
    +28   // Produce models
    +29   slv.setOption("produce-models", "true");
    +30   // The option strings-exp is needed
    +31   slv.setOption("strings-exp", "true");
    +32   // Set output language to SMTLIB2
    +33   slv.setOption("output-language", "smt2");
    +34 
    +35   // Sequence sort
    +36   Sort intSeq = slv.mkSequenceSort(slv.getIntegerSort());
    +37 
    +38   // Sequence variables
    +39   Term x = slv.mkConst(intSeq, "x");
    +40   Term y = slv.mkConst(intSeq, "y");
    +41 
    +42   // Empty sequence
    +43   Term empty = slv.mkEmptySequence(slv.getIntegerSort());
    +44   // Sequence concatenation: x.y.empty
    +45   Term concat = slv.mkTerm(SEQ_CONCAT, {x, y, empty});
    +46   // Sequence length: |x.y.empty|
    +47   Term concat_len = slv.mkTerm(SEQ_LENGTH, {concat});
    +48   // |x.y.empty| > 1
    +49   Term formula1 = slv.mkTerm(GT, {concat_len, slv.mkInteger(1)});
    +50   // Sequence unit: seq(1)
    +51   Term unit = slv.mkTerm(SEQ_UNIT, {slv.mkInteger(1)});
    +52   // x = seq(1)
    +53   Term formula2 = slv.mkTerm(EQUAL, {x, unit});
    +54 
    +55   // Make a query
    +56   Term q = slv.mkTerm(AND, {formula1, formula2});
    +57 
    +58   // check sat
    +59   Result result = slv.checkSatAssuming(q);
    +60   std::cout << "cvc5 reports: " << q << " is " << result << "." << std::endl;
    +61 
    +62   if (result.isSat())
    +63   {
    +64     std::cout << "  x = " << slv.getValue(x) << std::endl;
    +65     std::cout << "  y = " << slv.getValue(y) << std::endl;
    +66   }
    +67 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/sets.html b/cvc5-1.0.2/examples/sets.html new file mode 100644 index 0000000..0cdf165 --- /dev/null +++ b/cvc5-1.0.2/examples/sets.html @@ -0,0 +1,744 @@ + + + + + + + + Theory of Sets — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Sets + + ¶ + +

    +
    +
    + + + + + +
    +
    +

    + + examples/api/cpp/sets.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Aina Niemetz, Kshitij Bansal, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of reasoning about sets with cvc5.
    +14  */
    +15 
    +16 #include <cvc5/cvc5.h>
    +17 
    +18 #include <iostream>
    +19 
    +20 using namespace std;
    +21 using namespace cvc5;
    +22 
    +23 int main()
    +24 {
    +25   Solver slv;
    +26 
    +27   // Optionally, set the logic. We need at least UF for equality predicate,
    +28   // integers (LIA) and sets (FS).
    +29   slv.setLogic("QF_UFLIAFS");
    +30 
    +31   // Produce models
    +32   slv.setOption("produce-models", "true");
    +33   slv.setOption("output-language", "smt2");
    +34 
    +35   Sort integer = slv.getIntegerSort();
    +36   Sort set = slv.mkSetSort(integer);
    +37 
    +38   // Verify union distributions over intersection
    +39   // (A union B) intersection C = (A intersection C) union (B intersection C)
    +40   {
    +41     Term A = slv.mkConst(set, "A");
    +42     Term B = slv.mkConst(set, "B");
    +43     Term C = slv.mkConst(set, "C");
    +44 
    +45     Term unionAB = slv.mkTerm(SET_UNION, {A, B});
    +46     Term lhs = slv.mkTerm(SET_INTER, {unionAB, C});
    +47 
    +48     Term intersectionAC = slv.mkTerm(SET_INTER, {A, C});
    +49     Term intersectionBC = slv.mkTerm(SET_INTER, {B, C});
    +50     Term rhs = slv.mkTerm(SET_UNION, {intersectionAC, intersectionBC});
    +51 
    +52     Term theorem = slv.mkTerm(EQUAL, {lhs, rhs});
    +53 
    +54     cout << "cvc5 reports: " << theorem << " is "
    +55          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    +56   }
    +57 
    +58   // Verify emptset is a subset of any set
    +59   {
    +60     Term A = slv.mkConst(set, "A");
    +61     Term emptyset = slv.mkEmptySet(set);
    +62 
    +63     Term theorem = slv.mkTerm(SET_SUBSET, {emptyset, A});
    +64 
    +65     cout << "cvc5 reports: " << theorem << " is "
    +66          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    +67   }
    +68 
    +69   // Find me an element in {1, 2} intersection {2, 3}, if there is one.
    +70   {
    +71     Term one = slv.mkInteger(1);
    +72     Term two = slv.mkInteger(2);
    +73     Term three = slv.mkInteger(3);
    +74 
    +75     Term singleton_one = slv.mkTerm(SET_SINGLETON, {one});
    +76     Term singleton_two = slv.mkTerm(SET_SINGLETON, {two});
    +77     Term singleton_three = slv.mkTerm(SET_SINGLETON, {three});
    +78     Term one_two = slv.mkTerm(SET_UNION, {singleton_one, singleton_two});
    +79     Term two_three = slv.mkTerm(SET_UNION, {singleton_two, singleton_three});
    +80     Term intersection = slv.mkTerm(SET_INTER, {one_two, two_three});
    +81 
    +82     Term x = slv.mkConst(integer, "x");
    +83 
    +84     Term e = slv.mkTerm(SET_MEMBER, {x, intersection});
    +85 
    +86     Result result = slv.checkSatAssuming(e);
    +87     cout << "cvc5 reports: " << e << " is " << result << "." << endl;
    +88 
    +89     if (result.isSat())
    +90     {
    +91       cout << "For instance, " << slv.getValue(x) << " is a member." << endl;
    +92     }
    +93   }
    +94 }
    +
    +
    +
    +
    + + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/strings.html b/cvc5-1.0.2/examples/strings.html new file mode 100644 index 0000000..0930422 --- /dev/null +++ b/cvc5-1.0.2/examples/strings.html @@ -0,0 +1,705 @@ + + + + + + + + Theory of Strings — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory of Strings + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/strings.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Tianyi Liang, Aina Niemetz, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of reasoning about strings with cvc5 via C++ API.
    +14  */
    +15 
    +16 #include <cvc5/cvc5.h>
    +17 
    +18 #include <iostream>
    +19 
    +20 using namespace cvc5;
    +21 
    +22 int main()
    +23 {
    +24   Solver slv;
    +25 
    +26   // Set the logic
    +27   slv.setLogic("QF_SLIA");
    +28   // Produce models
    +29   slv.setOption("produce-models", "true");
    +30   // The option strings-exp is needed
    +31   slv.setOption("strings-exp", "true");
    +32   // Set output language to SMTLIB2
    +33   slv.setOption("output-language", "smt2");
    +34 
    +35   // String type
    +36   Sort string = slv.getStringSort();
    +37 
    +38   // std::string
    +39   std::string str_ab("ab");
    +40   // String constants
    +41   Term ab  = slv.mkString(str_ab);
    +42   Term abc = slv.mkString("abc");
    +43   // String variables
    +44   Term x = slv.mkConst(string, "x");
    +45   Term y = slv.mkConst(string, "y");
    +46   Term z = slv.mkConst(string, "z");
    +47 
    +48   // String concatenation: x.ab.y
    +49   Term lhs = slv.mkTerm(STRING_CONCAT, {x, ab, y});
    +50   // String concatenation: abc.z
    +51   Term rhs = slv.mkTerm(STRING_CONCAT, {abc, z});
    +52   // x.ab.y = abc.z
    +53   Term formula1 = slv.mkTerm(EQUAL, {lhs, rhs});
    +54 
    +55   // Length of y: |y|
    +56   Term leny = slv.mkTerm(STRING_LENGTH, {y});
    +57   // |y| >= 0
    +58   Term formula2 = slv.mkTerm(GEQ, {leny, slv.mkInteger(0)});
    +59 
    +60   // Regular expression: (ab[c-e]*f)|g|h
    +61   Term r = slv.mkTerm(
    +62       REGEXP_UNION,
    +63 
    +64       {slv.mkTerm(
    +65            REGEXP_CONCAT,
    +66            {slv.mkTerm(STRING_TO_REGEXP, {slv.mkString("ab")}),
    +67             slv.mkTerm(REGEXP_STAR,
    +68                        {slv.mkTerm(REGEXP_RANGE,
    +69                                    {slv.mkString("c"), slv.mkString("e")})}),
    +70             slv.mkTerm(STRING_TO_REGEXP, {slv.mkString("f")})}),
    +71        slv.mkTerm(STRING_TO_REGEXP, {slv.mkString("g")}),
    +72        slv.mkTerm(STRING_TO_REGEXP, {slv.mkString("h")})});
    +73 
    +74   // String variables
    +75   Term s1 = slv.mkConst(string, "s1");
    +76   Term s2 = slv.mkConst(string, "s2");
    +77   // String concatenation: s1.s2
    +78   Term s = slv.mkTerm(STRING_CONCAT, {s1, s2});
    +79 
    +80   // s1.s2 in (ab[c-e]*f)|g|h
    +81   Term formula3 = slv.mkTerm(STRING_IN_REGEXP, {s, r});
    +82 
    +83   // Make a query
    +84   Term q = slv.mkTerm(AND, {formula1, formula2, formula3});
    +85 
    +86   // check sat
    +87   Result result = slv.checkSatAssuming(q);
    +88   std::cout << "cvc5 reports: " << q << " is " << result << "." << std::endl;
    +89 
    +90   if(result.isSat())
    +91   {
    +92     std::cout << "  x  = " << slv.getValue(x) << std::endl;
    +93     std::cout << "  s1.s2 = " << slv.getValue(s) << std::endl;
    +94   }
    +95 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/sygus-fun.html b/cvc5-1.0.2/examples/sygus-fun.html new file mode 100644 index 0000000..4f00b07 --- /dev/null +++ b/cvc5-1.0.2/examples/sygus-fun.html @@ -0,0 +1,1057 @@ + + + + + + + + SyGuS: Functions — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + SyGuS: Functions + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/sygus-fun.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Abdalrhman Mohamed, Mathias Preiner, Andrew Reynolds
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of the Sygus API.
    + 14  *
    + 15  * A simple demonstration of how to use the Sygus API to synthesize max and min
    + 16  * functions.
    + 17  */
    + 18 
    + 19 #include <cvc5/cvc5.h>
    + 20 
    + 21 #include <iostream>
    + 22 
    + 23 #include "utils.h"
    + 24 
    + 25 using namespace cvc5;
    + 26 
    + 27 int main()
    + 28 {
    + 29   Solver slv;
    + 30 
    + 31   // required options
    + 32   slv.setOption("sygus", "true");
    + 33   slv.setOption("incremental", "false");
    + 34 
    + 35   // set the logic
    + 36   slv.setLogic("LIA");
    + 37 
    + 38   Sort integer = slv.getIntegerSort();
    + 39   Sort boolean = slv.getBooleanSort();
    + 40 
    + 41   // declare input variables for the functions-to-synthesize
    + 42   Term x = slv.mkVar(integer, "x");
    + 43   Term y = slv.mkVar(integer, "y");
    + 44 
    + 45   // declare the grammar non-terminals
    + 46   Term start = slv.mkVar(integer, "Start");
    + 47   Term start_bool = slv.mkVar(boolean, "StartBool");
    + 48 
    + 49   // define the rules
    + 50   Term zero = slv.mkInteger(0);
    + 51   Term one = slv.mkInteger(1);
    + 52 
    + 53   Term plus = slv.mkTerm(ADD, {start, start});
    + 54   Term minus = slv.mkTerm(SUB, {start, start});
    + 55   Term ite = slv.mkTerm(ITE, {start_bool, start, start});
    + 56 
    + 57   Term And = slv.mkTerm(AND, {start_bool, start_bool});
    + 58   Term Not = slv.mkTerm(NOT, {start_bool});
    + 59   Term leq = slv.mkTerm(LEQ, {start, start});
    + 60 
    + 61   // create the grammar object
    + 62   Grammar g = slv.mkGrammar({x, y}, {start, start_bool});
    + 63 
    + 64   // bind each non-terminal to its rules
    + 65   g.addRules(start, {zero, one, x, y, plus, minus, ite});
    + 66   g.addRules(start_bool, {And, Not, leq});
    + 67 
    + 68   // declare the functions-to-synthesize. Optionally, provide the grammar
    + 69   // constraints
    + 70   Term max = slv.synthFun("max", {x, y}, integer, g);
    + 71   Term min = slv.synthFun("min", {x, y}, integer);
    + 72 
    + 73   // declare universal variables.
    + 74   Term varX = slv.declareSygusVar("x", integer);
    + 75   Term varY = slv.declareSygusVar("y", integer);
    + 76 
    + 77   Term max_x_y = slv.mkTerm(APPLY_UF, {max, varX, varY});
    + 78   Term min_x_y = slv.mkTerm(APPLY_UF, {min, varX, varY});
    + 79 
    + 80   // add semantic constraints
    + 81   // (constraint (>= (max x y) x))
    + 82   slv.addSygusConstraint(slv.mkTerm(GEQ, {max_x_y, varX}));
    + 83 
    + 84   // (constraint (>= (max x y) y))
    + 85   slv.addSygusConstraint(slv.mkTerm(GEQ, {max_x_y, varY}));
    + 86 
    + 87   // (constraint (or (= x (max x y))
    + 88   //                 (= y (max x y))))
    + 89   slv.addSygusConstraint(slv.mkTerm(OR,
    + 90                                     {slv.mkTerm(EQUAL, {max_x_y, varX}),
    + 91                                      slv.mkTerm(EQUAL, {max_x_y, varY})}));
    + 92 
    + 93   // (constraint (= (+ (max x y) (min x y))
    + 94   //                (+ x y)))
    + 95   slv.addSygusConstraint(slv.mkTerm(
    + 96       EQUAL,
    + 97       {slv.mkTerm(ADD, {max_x_y, min_x_y}), slv.mkTerm(ADD, {varX, varY})}));
    + 98 
    + 99   // print solutions if available
    +100   if (slv.checkSynth().hasSolution())
    +101   {
    +102     // Output should be equivalent to:
    +103     // (
    +104     //   (define-fun max ((x Int) (y Int)) Int (ite (<= x y) y x))
    +105     //   (define-fun min ((x Int) (y Int)) Int (ite (<= x y) x y))
    +106     // )
    +107     std::vector<Term> terms = {max, min};
    +108     utils::printSynthSolutions(terms, slv.getSynthSolutions(terms));
    +109   }
    +110 
    +111   return 0;
    +112 }
    +
    +
    +
    +
    + + + +
    +

    + The utility method used for printing the synthesis solutions in the examples +above is defined separately in the + + + utils + + + module: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/utils.h + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Abdalrhman Mohamed, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * Utility methods.
    +14  */
    +15 
    +16 #ifndef CVC5__UTILS_H
    +17 #define CVC5__UTILS_H
    +18 
    +19 #include <cvc5/cvc5.h>
    +20 
    +21 namespace utils {
    +22 
    +23 /**
    +24  * Print solutions for synthesis conjecture to the standard output stream.
    +25  * @param terms the terms for which the synthesis solutions were retrieved
    +26  * @param sols the synthesis solutions of the given terms
    +27  */
    +28 void printSynthSolutions(const std::vector<cvc5::Term>& terms,
    +29                          const std::vector<cvc5::Term>& sols);
    +30 
    +31 }  // namespace utils
    +32 
    +33 #endif  // CVC5__UTILS_H
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/sygus-grammar.html b/cvc5-1.0.2/examples/sygus-grammar.html new file mode 100644 index 0000000..48fac60 --- /dev/null +++ b/cvc5-1.0.2/examples/sygus-grammar.html @@ -0,0 +1,1026 @@ + + + + + + + + SyGuS: Grammars — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + SyGuS: Grammars + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/sygus-grammar.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Abdalrhman Mohamed, Mathias Preiner, Andrew Reynolds
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of the Sygus API.
    + 14  *
    + 15  * A simple demonstration of how to use Grammar to add syntax constraints to
    + 16  * the Sygus solution for the identity function.
    + 17  */
    + 18 
    + 19 #include <cvc5/cvc5.h>
    + 20 
    + 21 #include <iostream>
    + 22 
    + 23 #include "utils.h"
    + 24 
    + 25 using namespace cvc5;
    + 26 
    + 27 int main()
    + 28 {
    + 29   Solver slv;
    + 30 
    + 31   // required options
    + 32   slv.setOption("sygus", "true");
    + 33   slv.setOption("incremental", "false");
    + 34 
    + 35   // set the logic
    + 36   slv.setLogic("LIA");
    + 37 
    + 38   Sort integer = slv.getIntegerSort();
    + 39 
    + 40   // declare input variable for the function-to-synthesize
    + 41   Term x = slv.mkVar(integer, "x");
    + 42 
    + 43   // declare the grammar non-terminal
    + 44   Term start = slv.mkVar(integer, "Start");
    + 45 
    + 46   // define the rules
    + 47   Term zero = slv.mkInteger(0);
    + 48   Term neg_x = slv.mkTerm(NEG, {x});
    + 49   Term plus = slv.mkTerm(ADD, {x, start});
    + 50 
    + 51   // create the grammar object
    + 52   Grammar g1 = slv.mkGrammar({x}, {start});
    + 53 
    + 54   // bind each non-terminal to its rules
    + 55   g1.addRules(start, {neg_x, plus});
    + 56 
    + 57   // copy the first grammar with all of its non-termainals and their rules
    + 58   Grammar g2 = g1;
    + 59   Grammar g3 = g1;
    + 60 
    + 61   // add parameters as rules for the start symbol. Similar to "(Variable Int)"
    + 62   g2.addAnyVariable(start);
    + 63 
    + 64   // declare the functions-to-synthesize
    + 65   Term id1 = slv.synthFun("id1", {x}, integer, g1);
    + 66   Term id2 = slv.synthFun("id2", {x}, integer, g2);
    + 67 
    + 68   g3.addRule(start, zero);
    + 69 
    + 70   Term id3 = slv.synthFun("id3", {x}, integer, g3);
    + 71 
    + 72   // g1 is reusable as long as it remains unmodified after first use
    + 73   Term id4 = slv.synthFun("id4", {x}, integer, g1);
    + 74 
    + 75   // declare universal variables.
    + 76   Term varX = slv.declareSygusVar("x", integer);
    + 77 
    + 78   Term id1_x = slv.mkTerm(APPLY_UF, {id1, varX});
    + 79   Term id2_x = slv.mkTerm(APPLY_UF, {id2, varX});
    + 80   Term id3_x = slv.mkTerm(APPLY_UF, {id3, varX});
    + 81   Term id4_x = slv.mkTerm(APPLY_UF, {id4, varX});
    + 82 
    + 83   // add semantic constraints
    + 84   // (constraint (= (id1 x) (id2 x) (id3 x) (id4 x) x))
    + 85   slv.addSygusConstraint(
    + 86       slv.mkTerm(EQUAL, {{id1_x, id2_x, id3_x, id4_x, varX}}));
    + 87 
    + 88   // print solutions if available
    + 89   if (slv.checkSynth().hasSolution())
    + 90   {
    + 91     // Output should be equivalent to:
    + 92     // (
    + 93     //   (define-fun id1 ((x Int)) Int (+ x (+ x (- x))))
    + 94     //   (define-fun id2 ((x Int)) Int x)
    + 95     //   (define-fun id3 ((x Int)) Int (+ x 0))
    + 96     //   (define-fun id4 ((x Int)) Int (+ x (+ x (- x))))
    + 97     // )
    + 98     std::vector<Term> terms = {id1, id2, id3, id4};
    + 99     utils::printSynthSolutions(terms, slv.getSynthSolutions(terms));
    +100   }
    +101 
    +102   return 0;
    +103 }
    +
    +
    +
    +
    + + + +
    +

    + The utility method used for printing the synthesis solutions in the examples +above is defined separately in the + + + utils + + + module: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/utils.h + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Abdalrhman Mohamed, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * Utility methods.
    +14  */
    +15 
    +16 #ifndef CVC5__UTILS_H
    +17 #define CVC5__UTILS_H
    +18 
    +19 #include <cvc5/cvc5.h>
    +20 
    +21 namespace utils {
    +22 
    +23 /**
    +24  * Print solutions for synthesis conjecture to the standard output stream.
    +25  * @param terms the terms for which the synthesis solutions were retrieved
    +26  * @param sols the synthesis solutions of the given terms
    +27  */
    +28 void printSynthSolutions(const std::vector<cvc5::Term>& terms,
    +29                          const std::vector<cvc5::Term>& sols);
    +30 
    +31 }  // namespace utils
    +32 
    +33 #endif  // CVC5__UTILS_H
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/examples/sygus-inv.html b/cvc5-1.0.2/examples/sygus-inv.html new file mode 100644 index 0000000..d29221f --- /dev/null +++ b/cvc5-1.0.2/examples/sygus-inv.html @@ -0,0 +1,943 @@ + + + + + + + + SyGuS: Invariants — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + SyGuS: Invariants + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/sygus-inv.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Abdalrhman Mohamed, Mathias Preiner, Mudathir Mohamed
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of the Sygus API.
    +14  *
    +15  * A simple demonstration of how to use the Sygus API to synthesize a simple
    +16  * invariant.
    +17  */
    +18 
    +19 #include <cvc5/cvc5.h>
    +20 
    +21 #include <iostream>
    +22 
    +23 #include "utils.h"
    +24 
    +25 using namespace cvc5;
    +26 
    +27 int main()
    +28 {
    +29   Solver slv;
    +30 
    +31   // required options
    +32   slv.setOption("sygus", "true");
    +33   slv.setOption("incremental", "false");
    +34 
    +35   // set the logic
    +36   slv.setLogic("LIA");
    +37 
    +38   Sort integer = slv.getIntegerSort();
    +39   Sort boolean = slv.getBooleanSort();
    +40 
    +41   Term zero = slv.mkInteger(0);
    +42   Term one = slv.mkInteger(1);
    +43   Term ten = slv.mkInteger(10);
    +44 
    +45   // declare input variables for functions
    +46   Term x = slv.mkVar(integer, "x");
    +47   Term xp = slv.mkVar(integer, "xp");
    +48 
    +49   // (ite (< x 10) (= xp (+ x 1)) (= xp x))
    +50   Term ite = slv.mkTerm(ITE,
    +51                         {slv.mkTerm(LT, {x, ten}),
    +52                          slv.mkTerm(EQUAL, {xp, slv.mkTerm(ADD, {x, one})}),
    +53                          slv.mkTerm(EQUAL, {xp, x})});
    +54 
    +55   // define the pre-conditions, transition relations, and post-conditions
    +56   Term pre_f =
    +57       slv.defineFun("pre-f", {x}, boolean, slv.mkTerm(EQUAL, {x, zero}));
    +58   Term trans_f = slv.defineFun("trans-f", {x, xp}, boolean, ite);
    +59   Term post_f =
    +60       slv.defineFun("post-f", {x}, boolean, slv.mkTerm(LEQ, {x, ten}));
    +61 
    +62   // declare the invariant-to-synthesize
    +63   Term inv_f = slv.synthInv("inv-f", {x});
    +64 
    +65   slv.addSygusInvConstraint(inv_f, pre_f, trans_f, post_f);
    +66 
    +67   // print solutions if available
    +68   if (slv.checkSynth().hasSolution())
    +69   {
    +70     // Output should be equivalent to:
    +71     // (
    +72     //   (define-fun inv-f ((x Int)) Bool (not (>= x 11)))
    +73     // )
    +74     std::vector<Term> terms = {inv_f};
    +75     utils::printSynthSolutions(terms, slv.getSynthSolutions(terms));
    +76   }
    +77 
    +78   return 0;
    +79 }
    +
    +
    +
    +
    + + + +
    +

    + The utility method used for printing the synthesis solutions in the examples +above is defined separately in the + + + utils + + + module: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/utils.h + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Abdalrhman Mohamed, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * Utility methods.
    +14  */
    +15 
    +16 #ifndef CVC5__UTILS_H
    +17 #define CVC5__UTILS_H
    +18 
    +19 #include <cvc5/cvc5.h>
    +20 
    +21 namespace utils {
    +22 
    +23 /**
    +24  * Print solutions for synthesis conjecture to the standard output stream.
    +25  * @param terms the terms for which the synthesis solutions were retrieved
    +26  * @param sols the synthesis solutions of the given terms
    +27  */
    +28 void printSynthSolutions(const std::vector<cvc5::Term>& terms,
    +29                          const std::vector<cvc5::Term>& sols);
    +30 
    +31 }  // namespace utils
    +32 
    +33 #endif  // CVC5__UTILS_H
    +
    +
    +
    +
    + + + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/genindex.html b/cvc5-1.0.2/genindex.html new file mode 100644 index 0000000..d190957 --- /dev/null +++ b/cvc5-1.0.2/genindex.html @@ -0,0 +1,11251 @@ + + + + + + + Index — cvc5 documentation + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Index +
    • +
    • +
    • +
    +
    +
    +
    +
    +

    + Index +

    + +

    + _ +

    + + + + + +
    + + + +
    +

    + A +

    + + + + + +
    + + + +
    +

    + B +

    + + + + + +
    + + + +
    +

    + C +

    + + + + + +
    + + + +
    +

    + D +

    + + + + + +
    + + + +
    +

    + E +

    + + + + + +
    + + + +
    +

    + F +

    + + + + + +
    + + + +
    +

    + G +

    + + + + + +
    + + + +
    +

    + H +

    + + + + + +
    + + + +
    +

    + I +

    + + + + + +
    + + + +
    +

    + K +

    + + + + + +
    + + + +
    +

    + L +

    + + + + + +
    + + + +
    +

    + M +

    + + + + + +
    + + + +
    +

    + N +

    + + + + + +
    + + + +
    +

    + O +

    + + + + + +
    + + + +
    +

    + P +

    + + + + + +
    + + + +
    +

    + Q +

    + + + + + +
    + + + +
    +

    + R +

    + + + + + +
    + + + +
    +

    + S +

    + + + + + +
    + + + +
    +

    + T +

    + + + + + +
    + + + +
    +

    + U +

    + + + + + +
    + + + +
    +

    + V +

    + + + + + +
    + + + +
    +

    + W +

    + + + + +
    + +
    +

    + X +

    + + + + + +
    + + + +
    +

    + Z +

    + + + + +
    + +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/index.html b/cvc5-1.0.2/index.html new file mode 100644 index 0000000..01da9c1 --- /dev/null +++ b/cvc5-1.0.2/index.html @@ -0,0 +1,311 @@ + + + + + + + + cvc5 Documentation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + cvc5 Documentation +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + cvc5 Documentation + + ¶ + +

    +

    + + cvc5 + + is an open-source automatic theorem prover for Satisfiability Modulo +Theories (SMT) problems that supports a large number of theories and their +combination. +It is the successor of + + CVC4 + + and is +intended to be an open and extensible SMT engine. +

    +

    + This space provides all documentation related to using cvc5. +

    +
    +

    + Table of Contents + + ¶ + +

    + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/installation/installation.html b/cvc5-1.0.2/installation/installation.html new file mode 100644 index 0000000..3910328 --- /dev/null +++ b/cvc5-1.0.2/installation/installation.html @@ -0,0 +1,1695 @@ + + + + + + + + Installation — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Installation +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Installation + + ¶ + +

    +
    +

    + Building cvc5 + + ¶ + +

    +
    +
    +
    ./configure.sh
    +    # use --prefix to specify an install prefix (default: /usr/local)
    +    # use --name=<PATH> for custom build directory
    +    # use --auto-download to download and build missing, required or
    +    #   enabled, dependencies
    +cd <build_dir>   # default is ./build
    +make             # use -jN for parallel build with N threads
    +make check       # to run default set of tests
    +make install     # to install into the prefix specified above
    +
    +
    +
    +

    + All binaries are built into + + + <build_dir>/bin + + + , the cvc5 library is built into + + + <build_dir>/lib + + + . +

    +
    +
    +

    + Supported Operating Systems + + ¶ + +

    +

    + cvc5 can be built natively on Linux and macOS, cross-compilation is possible for +Windows using Mingw-w64. cvc5 also supports cross-compilation for ARM64 systems. +We generally recommend a 64-bit operating system. +

    +
    +

    + Compilation on macOS + + ¶ + +

    +

    + On macOS, we recommend using + + Homebrew + + to install the +dependencies. We also have a Homebrew Tap available at + + https://github.com/CVC4/homebrew-cvc4 + + . +Note that linking system libraries statically is + + strongly discouraged + + on macOS. Using + + + ./configure.sh + + + --static + + + will thus produce a binary +that uses static versions of all our dependencies, but is still a dynamically +linked binary. +

    +
    +
    +

    + Cross-compiling for Windows + + ¶ + +

    +

    + Cross-compiling cvc5 with Mingw-w64 can be done as follows: +

    +
    +
    +
    ./configure.sh --win64 --static <configure options...>
    +
    +cd <build_dir>   # default is ./build
    +make             # use -jN for parallel build with N threads
    +
    +
    +
    +

    + The built binary + + + cvc5.exe + + + is located in + + + <build_dir>/bin + + + and the cvc5 +library can be found in + + + <build_dir>/lib + + + . +

    +
    +
    +
    +

    + Build dependencies + + ¶ + +

    +

    + cvc5 makes uses of a number of tools and libraries. Some of these are required +while others are only used with certain configuration options. If + + + --auto-download + + + is given, cvc5 can automatically download and build most +libraries that are not already installed on your system. If your libraries are +installed in a non-standard location, you can use + + + --dep-path + + + to define an +additional search path for all dependencies. Versions given are minimum +versions; more recent versions should be compatible. +

    + +
    +

    + ANTLR 3.4 parser generator + + ¶ + +

    +

    + For most systems, the package manager no longer contains pre-packaged versions +of ANTLR 3.4. With + + + --auto-download + + + , cvc5 will automatically download and +build ANTLR 3.4. +

    +
    +
    +

    + CaDiCaL (SAT solver) + + ¶ + +

    +

    + + CaDiCaL + + is a SAT solver that can be +used for the bit-vector solver. It can be downloaded and built automatically. +

    +
    +
    +

    + GMP (GNU Multi-Precision arithmetic library) + + ¶ + +

    +

    + GMP is usually available on your distribution and should be used from there. If +it is not, or you want to cross-compile, or you want to build cvc5 statically +but the distribution does not ship static libraries, cvc5 builds GMP +automatically when + + + --auto-download + + + is given. +

    +
    +
    +

    + SymFPU (Support for the Theory of Floating Point Numbers) + + ¶ + +

    +

    + + SymFPU + + is an implementation +of SMT-LIB/IEEE-754 floating-point operations in terms of bit-vector operations. +It is required for supporting the theory of floating-point numbers and can be +downloaded and built automatically. +

    +
    +
    +
    +

    + Optional Dependencies + + ¶ + +

    +
    +

    + CryptoMiniSat (Optional SAT solver) + + ¶ + +

    +

    + + CryptoMinisat + + is a SAT solver that +can be used for solving bit-vector problems with eager bit-blasting. This +dependency may improve performance. It can be downloaded and built +automatically. Configure cvc5 with + + + configure.sh + + + --cryptominisat + + + to build +with this dependency. +

    +
    +
    +

    + Kissat (Optional SAT solver) + + ¶ + +

    +

    + + Kissat + + is a SAT solver that can be +used for solving bit-vector problems with eager bit-blasting. This dependency +may improve performance. It can be downloaded and built automatically. Configure +cvc5 with + + + configure.sh + + + --kissat + + + to build with this dependency. +

    +
    +
    +

    + LibPoly (Optional polynomial library) + + ¶ + +

    +

    + + LibPoly + + is required for CAD-based +nonlinear reasoning. It can be downloaded and built automatically. Configure +cvc5 with + + + configure.sh + + + --poly + + + to build with this dependency. +

    +
    +
    +

    + CLN >= v1.3 (Class Library for Numbers) + + ¶ + +

    +

    + + CLN + + is an alternative multiprecision arithmetic +package that may offer better performance and memory footprint than GMP. +Configure cvc5 with + + + configure.sh + + + --cln + + + to build with this dependency. +

    +

    + Note that CLN is covered by the + + GNU General Public License, version 3 + + . If you choose to use cvc5 with +CLN support, you are licensing cvc5 under that same license. (Usually cvc5’s +license is more permissive than GPL, see the file + + COPYING + + in the cvc5 source +distribution for details.) +

    +
    +
    +

    + glpk-cut-log (A fork of the GNU Linear Programming Kit) + + ¶ + +

    +

    + + glpk-cut-log + + is a fork of + + GLPK + + (the GNU Linear Programming Kit). +This can be used to speed up certain classes of problems for the arithmetic +implementation in cvc5. (This is not recommended for most users.) +

    +

    + glpk-cut-log can be installed using the + + + contrib/get-glpk-cut-log + + + script. +Note that the only installation option is manual installation via this script. +cvc5 is no longer compatible with the main GLPK library. Configure cvc5 with + + + configure.sh + + + --glpk + + + to build with this dependency. +

    +

    + Note that GLPK and glpk-cut-log are covered by the + + GNU General Public License, +version 3 + + . If you choose to use +cvc5 with GLPK support, you are licensing cvc5 under that same license. (Usually +cvc5’s license is more permissive; see above discussion.) +

    +
    +
    +

    + Editline library (Improved Interactive Experience) + + ¶ + +

    +

    + The + + Editline Library + + library is optionally +used to provide command editing, tab completion, and history functionality at +the cvc5 prompt (when running in interactive mode). Check your distribution for +a package named “libedit-dev” or “libedit-devel” or similar. +

    +
    +
    +

    + Google Test Unit Testing Framework (Unit Tests) + + ¶ + +

    +

    + + Google Test + + is required to optionally +run cvc5’s unit tests (included with the distribution). +See + + Testing cvc5 + + below for more details. +

    +
    +
    +
    +

    + Language bindings + + ¶ + +

    +

    + cvc5 provides a complete and flexible C++ API (see + + + examples/api + + + for +examples). It further provides Java (see + + + examples/SimpleVC.java + + + and + + + examples/api/java + + + ) and Python (see + + + examples/api/python + + + ) API bindings. +

    +

    + Configure cvc5 with + + + configure.sh + + + --<lang>-bindings + + + to build with language +bindings for + + + <lang> + + + . +

    +
    +

    + Dependencies for Language Bindings + + ¶ + +

    + +

    + If you’re interested in helping to develop, maintain, and test a language +binding, please contact the cvc5 team via + + our issue tracker + + . +

    +
    +
    +
    +

    + Building the API Documentation + + ¶ + +

    +

    + Building the API documentation of cvc5 requires the following dependencies: +

    + +

    + To build the documentation, configure cvc5 with + + + ./configure.sh + + + --docs + + + and +run + + + make + + + docs + + + from within the build directory. +

    +

    + The API documentation can then be found at + + + <build_dir>/docs/sphinx/index.html + + + . +

    +

    + To build the documentation for GitHub pages, change to the build directory and +call + + + make + + + docs-gh + + + . The content of directory + + + <build_dir>/docs/sphinx-gh + + + can then be copied over to GitHub pages. +

    +
    +
    +

    + Building the Examples + + ¶ + +

    +

    + See + + + examples/README.md + + + for instructions on how to build and run the +examples. +

    +
    +
    + + +

    + Testing cvc5 + + ¶ + +

    +

    + We use + + + ctest + + + as test infrastructure. For all command-line options of ctest, +see + + + ctest + + + -h + + + . Some useful options are: +

    +
    +
    +
    ctest -R <regex>           # run all tests with names matching <regex>
    +ctest -E <regex>           # exclude tests with names matching <regex>
    +ctest -L <regex>           # run all tests with labels matching <regex>
    +ctest -LE <regex>          # exclude tests with labels matching <regex>
    +ctest                      # run all tests
    +ctest -jN                  # run all tests in parallel with N threads
    +ctest --output-on-failure  # run all tests and print output of failed tests
    +
    +
    +
    +

    + We have 4 categories of tests: +

    +
      +
    • +

      + + examples + + in directory + + + examples + + + (label: + + example + + ) +

      +
    • +
    • +

      + + regression tests + + (5 levels) in directory + + + test/regress + + + (label: + + regressN + + with N the regression level) +

      +
    • +
    • +

      + + api tests + + in directory + + + test/api + + + (label: + + api + + ) +

      +
    • +
    • +

      + + unit tests + + in directory + + + test/unit + + + (label: + + unit + + ) +

      +
    • +
    +
    +

    + Testing System Tests + + ¶ + +

    +

    + The system tests are not built by default. +

    +
    +
    +
    make apitests                         # build and run all system tests
    +make <api_test>                       # build test/system/<system_test>.<ext>
    +ctest api/<api_test>                  # run test/system/<system_test>.<ext>
    +
    +
    +
    +

    + All system test binaries are built into + + + <build_dir>/bin/test/system + + + . +

    +

    + We use prefix + + + api/ + + + + + + + <api_test> + + + (for + + + <api_test> + + + in + + + test/api + + + ) +as test target name. +

    +
    +
    +
    make ouroborous                       # build test/api/ouroborous.cpp
    +ctest -R ouroborous                   # run all tests that match '*ouroborous*'
    +                                      # > runs api/ouroborous
    +ctest -R ouroborous$                  # run all tests that match '*ouroborous'
    +                                      # > runs api/ouroborous
    +ctest -R api/ouroborous$              # run all tests that match '*api/ouroborous'
    +                                      # > runs api/ouroborous
    +
    +
    +
    +
    +
    +

    + Testing Unit Tests + + ¶ + +

    +

    + The unit tests are not built by default. +

    +

    + Note that cvc5 can only be configured with unit tests in non-static builds with +assertions enabled. +

    +
    +
    +
    make units                            # build and run all unit tests
    +make <unit_test>                      # build test/unit/<subdir>/<unit_test>.<ext>
    +ctest unit/<subdir>/<unit_test>       # run test/unit/<subdir>/<unit_test>.<ext>
    +
    +
    +
    +

    + All unit test binaries are built into + + + <build_dir>/bin/test/unit + + + . +

    +

    + We use prefix + + + unit/ + + + + + + + <subdir>/ + + + + + + + <unit_test> + + + (for + + + <unit_test> + + + in + + + test/unit/<subdir> + + + ) as test target name. +

    +
    +
    +
    make map_util_black                   # build test/unit/base/map_util_black.cpp
    +ctest -R map_util_black               # run all tests that match '*map_util_black*'
    +                                      # > runs unit/base/map_util_black
    +ctest -R base/map_util_black$         # run all tests that match '*base/map_util_black'
    +                                      # > runs unit/base/map_util_black
    +ctest -R unit/base/map_util_black$    # run all tests that match '*unit/base/map_util_black'
    +                                      # > runs unit/base/map_util_black
    +
    +
    +
    +
    +
    +

    + Testing Regression Tests + + ¶ + +

    +

    + We use prefix + + + regressN/ + + + + + + + <subdir>/ + + + + + + + <regress_test> + + + (for + + + <regress_test> + + + in level + + + N + + + in + + + test/regress/regressN/<subdir> + + + ) as test +target name. +

    +
    +
    +
    ctest -L regress                      # run all regression tests
    +ctest -L regress0                     # run all regression tests in level 0
    +ctest -L regress[0-1]                 # run all regression tests in level 0 and 1
    +ctest -R regress                      # run all regression tests
    +ctest -R regress0                     # run all regression tests in level 0
    +ctest -R regress[0-1]                 # run all regression tests in level 0 and 1
    +ctest -R regress0/bug288b             # run all tests that match '*regress0/bug288b*'
    +                                      # > runs regress0/bug288b
    +
    +
    +
    +
    +
    +

    + Custom Targets + + ¶ + +

    +

    + All custom test targets build and run a preconfigured set of tests. +

    +
      +
    • +

      + + + make + + + check + + + [-jN] + + + [ARGS=-jN] + + + The default build-and-test target for cvc5, builds and runs all examples, +all system and unit tests, and regression tests from levels 0 to 2. +

      +
    • +
    • +

      + + + make + + + systemtests + + + [-jN] + + + [ARGS=-jN] + + + Build and run all system tests. +

      +
    • +
    • +

      + + + make + + + units + + + [-jN] + + + [ARGS=-jN] + + + Build and run all unit tests. +

      +
    • +
    • +

      + + + make + + + regress + + + [-jN] + + + [ARGS=-jN] + + + Build and run regression tests from levels 0 to 2. +

      +
    • +
    • +

      + + + make + + + runexamples + + + [-jN] + + + [ARGS=-jN] + + + Build and run all examples. +

      +
    • +
    • +

      + + + make + + + coverage-test + + + [-jN] + + + [ARGS=-jN] + + + Build and run all tests (system and unit tests, regression tests level 0-4) +with gcov to determine code coverage. +

      +
    • +
    +

    + We use + + + ctest + + + as test infrastructure, and by default all test targets +are configured to + + run + + in parallel with the maximum number of threads +available on the system. Override with + + + ARGS=-jN + + + . +

    +

    + Use + + + -jN + + + for parallel + + building + + with + + + N + + + threads. +

    +
    +
    +
    +

    + Recompiling a specific cvc5 version with different LGPL library versions + + ¶ + +

    +

    + To recompile a specific static binary of cvc5 with different versions of the +linked LGPL libraries perform the following steps: +

    +
      +
    1. +

      + Make sure that you have installed the desired LGPL library versions. +You can check the versions found by cvc5’s build system during the configure +phase. +

      +
    2. +
    3. +

      + Determine the commit sha and configuration of the cvc5 binary +

      +
    4. +
    +
    +
    +
    cvc5 --show-config
    +
    +
    +
    +
      +
    1. +

      + Download the specific source code version: +

      +
    2. +
    +
    +
    +
    wget https://github.com/cvc5/cvc5/archive/<commit-sha>.tar.gz
    +
    +
    +
    +
      +
    1. +

      + Extract the source code +

      +
    2. +
    +
    +
    +
    tar xf <commit-sha>.tar.gz
    +
    +
    +
    +
      +
    1. +

      + Change into source code directory +

      +
    2. +
    +
    +
    +
    cd cvc5-<commit-sha>
    +
    +
    +
    +
      +
    1. +

      + Configure cvc5 with options listed by + + + cvc5 + + + --show-config + + +

      +
    2. +
    +
    +
    +
    ./configure.sh --static <options>
    +
    +
    +
    +
      +
    1. +

      + Follow remaining steps from + + build instructions + +

      +
    2. +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/options.html b/cvc5-1.0.2/options.html new file mode 100644 index 0000000..19a18e2 --- /dev/null +++ b/cvc5-1.0.2/options.html @@ -0,0 +1,21144 @@ + + + + + + + + Options — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Options +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Options + + ¶ + +

    +

    + cvc5 can be configured at runtime using a wide range of options. +When cvc5 is used as a binary, options can be set on the command line. +Also, options can be set and inspected using the respective commands of the input language and the corresponding API functions: +

    + +

    + Generally, all options are identified by a name + + + <name> + + + , and (optionally) +by a short name + + + <short> + + + (a single letter). +Additionally, they can have one or more aliases, which can be used instead of + + + <name> + + + . +

    +

    + + Internally + + , options are strongly typed and must be either Boolean, (signed +or unsigned) integers, floating-point numbers, strings, or an enumeration type. +Values for options with a numeric type may be restricted to an interval. +

    +

    + Some options have + + custom types + + (e.g., + + + err + + + ) which +require special treatment internally. +The usage of such options is documented as part of the documentation for the corresponding options. +

    +

    + On the command line, a + + Boolean + + option can be set to + + + true + + + via + + + --<name> + + + or + + + -<short> + + + . +Most Boolean options can also be set to + + + false + + + via + + + --no-<name> + + + . +In cvc5’s APIs, this is done via + + + setOption("<name>", + + + "true" + + + | + + + "false") + + + . +

    +

    + For + + all other types + + , values are given on the command line using + + + --<name>=<value> + + + or + + + --<name> + + + <value> + + + , +and + + + setOption("<name>", + + + "<value>") + + + in the APIs. +The given value must be convertible to the appropriate type, in particular for +numeric and enumeration types. +

    +

    + Below is an exhaustive list of options supported by cvc5. +

    +
    +

    + Most Commonly-Used cvc5 Options + + ¶ + +

    +
    +
    + + + i + + + | + + + incremental + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable incremental solving +

    +
    +
    +
    +
    + + + L + + + | + + + lang + + + | + + + input-language + + + [custom + + + Language + + + , default + + + Language::LANG_AUTO + + + ] +
    +
    +

    + force input language (default is “auto”; see –lang help) +

    +
    +
    +
    +
    + + + o + + + | + + + output + + + [ + + + none + + + | + + + inst + + + | + + + sygus + + + | + + + sygus-grammar + + + | + + + trigger + + + | + + + raw-benchmark + + + | + + + learned-lits + + + | + + + subs + + + | + + + post-asserts + + + | + + + pre-asserts + + + | + + + deep-restart + + + | + + + incomplete + + + , default + + + none + + + ] +
    +
    +

    + Enable output tag. +

    +

    + Output tags. +

    +
    +
    + + + inst + + + + : + +
    +
    +

    + print instantiations during solving +

    +
    +
    + + + sygus + + + + : + +
    +
    +

    + print enumerated terms and candidates generated by the sygus solver +

    +
    +
    + + + sygus-grammar + + + + : + +
    +
    +

    + print grammars automatically generated by the sygus solver +

    +
    +
    + + + trigger + + + + : + +
    +
    +

    + print selected triggers for quantified formulas +

    +
    +
    + + + raw-benchmark + + + + : + +
    +
    +

    + print the benchmark back on the output verbatim as it is processed +

    +
    +
    + + + learned-lits + + + + : + +
    +
    +

    + print input literals that hold globally +

    +
    +
    + + + subs + + + + : + +
    +
    +

    + print top-level substitutions learned during preprocessing +

    +
    +
    + + + post-asserts + + + + : + +
    +
    +

    + print a benchmark corresponding to the assertions of the input problem after preprocessing +

    +
    +
    + + + pre-asserts + + + + : + +
    +
    +

    + print a benchmark corresponding to the assertions of the input problem before preprocessing +

    +
    +
    + + + deep-restart + + + + : + +
    +
    +

    + print when cvc5 performs a deep restart along with the literals it has learned +

    +
    +
    + + + incomplete + + + + : + +
    +
    +

    + print reason why cvc5 answers unknown for any given check-sat query +

    +
    +
    +
    +
    +
    +
    + + + parse-only + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + exit after parsing input +

    +
    +
    +
    +
    + + + preprocess-only + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + exit after preprocessing input +

    +
    +
    +
    +
    + + + q + + + | + + + quiet + + + [type + + + bool + + + ] +
    +
    +

    + decrease verbosity (may be repeated) +

    +
    +
    +
    +
    + + + rlimit + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + set resource limit +

    +
    +
    +
    +
    + + + rlimit-per + + + | + + + reproducible-resource-limit + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + set resource limit per query +

    +
    +
    +
    +
    + + + stats + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + give statistics on exit +

    +
    +
    +
    +
    + + + tlimit + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + set time limit in milliseconds of wall clock time +

    +
    +
    +
    +
    + + + tlimit-per + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + set time limit per query in milliseconds +

    +
    +
    +
    +
    + + + v + + + | + + + verbose + + + [type + + + bool + + + ] +
    +
    +

    + increase verbosity (may be repeated) +

    +
    +
    +
    +
    + + + verbosity + + + [type + + + int64_t + + + , default + + + 0 + + + ] +
    +
    +

    + the verbosity level of cvc5 +

    +
    +
    + +
    +
    + + + h + + + | + + + help + + + [type + + + bool + + + , default + + + false + + + ] +
    +
    +

    + full command line reference +

    +
    +
    +
    +
    + + + interactive + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + force interactive shell/non-interactive mode +

    +
    +
    +
    +
    + + + print-success + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + print the “success” output required of SMT-LIBv2 +

    +
    +
    +
    +
    + + + s + + + | + + + seed + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + seed for random number generator +

    +
    +
    +
    +
    + + + show-config + + + [type + + + bool + + + , default + + + false + + + ] +
    +
    +

    + show cvc5 static configuration +

    +
    +
    +
    +
    + + + V + + + | + + + version + + + [type + + + bool + + + , default + + + false + + + ] +
    +
    +

    + identify this cvc5 binary +

    +
    +
    +
    +
    + + + force-logic + + + [type + + + string + + + , default + + + "" + + + ] +
    +
    +

    + set the logic, and override all further user attempts to change it +

    +
    +
    +
    +
    + + + strict-parsing + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + be less tolerant of non-conforming inputs +

    +
    +
    +
    +
    + + + dag-thresh + + + [type + + + int64_t + + + , + + + 0 + + + <= + + + N + + + , default + + + 1 + + + ] +
    +
    +

    + dagify common subexprs appearing > N times (1 == default, 0 == don’t dagify) +

    +
    +
    +
    +
    + + + output-lang + + + | + + + output-language + + + [custom + + + Language + + + , default + + + Language::LANG_AUTO + + + ] +
    +
    +

    + force output language (default is “auto”; see –output-lang help) +

    +
    +
    +
    +
    + + + print-inst + + + [ + + + list + + + | + + + num + + + , default + + + list + + + ] +
    +
    +

    + print format for printing instantiations +

    +

    + Print format for printing instantiations. +

    +
    +
    + + + list + + + + : + +
    +
    +

    + Print the list of instantiations per quantified formula, when non-empty. +

    +
    +
    + + + num + + + + : + +
    +
    +

    + Print the total number of instantiations per quantified formula, when non-zero. +

    +
    +
    +
    +
    +
    +
    + + + check-models + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + after SAT/INVALID/UNKNOWN, check that the generated model satisfies user assertions +

    +
    +
    +
    +
    + + + m + + + | + + + produce-models + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + support the get-value and get-model commands +

    +
    +
    +
    +
    +

    + Additional cvc5 Options + + ¶ + +

    +
    +

    + Arithmetic Theory Module + + ¶ + +

    +
    +
    + + + approx-branch-depth + + + [type + + + int64_t + + + , default + + + 200 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum branch depth the approximate solver is allowed to take +

    +
    +
    +
    +
    + + + arith-brab + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + whether to use simple rounding, similar to a unit-cube test, for integers +

    +
    +
    +
    +
    + + + arith-eq-solver + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to use the equality solver in the theory of arithmetic +

    +
    +
    +
    +
    + + + arith-no-partial-fun + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do not use partial function semantics for arithmetic (not SMT LIB compliant) +

    +
    +
    +
    +
    + + + arith-prop + + + [ + + + none + + + | + + + unate + + + | + + + bi + + + | + + + both + + + , default + + + both + + + ] +
    +
    +

    + + [experts only] + +

    +

    + turns on arithmetic propagation (default is ‘old’, see –arith-prop=help) +

    +

    + This decides on kind of propagation arithmetic attempts to do during the search. +

    +
    +
    + + + unate + + + + : + +
    +
    +

    + Use constraints to do unate propagation. +

    +
    +
    + + + bi + + + + : + +
    +
    +

    + (Bounds Inference) infers bounds on basic variables using the upper and lower bounds of the non-basic variables in the tableau. +

    +
    +
    + + + both + + + + : + +
    +
    +

    + Use bounds inference and unate. +

    +
    +
    +
    +
    +
    +
    + + + arith-prop-clauses + + + [type + + + uint64_t + + + , default + + + 8 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + rows shorter than this are propagated as clauses +

    +
    +
    +
    +
    + + + arith-rewrite-equalities + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turns on the preprocessing rewrite turning equalities into a conjunction of inequalities +

    +
    +
    +
    +
    + + + arith-static-learning + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + do arithmetic static learning for ite terms based on bounds when static learning is enabled +

    +
    +
    +
    +
    + + + collect-pivot-stats + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + collect the pivot history +

    +
    +
    +
    +
    + + + cut-all-bounded + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turns on the integer solving step of periodically cutting all integer variables that have both upper and lower bounds +

    +
    +
    +
    +
    + + + dio-decomps + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + let skolem variables for integer divisibility constraints leak from the dio solver +

    +
    +
    +
    +
    + + + dio-solver + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turns on Linear Diophantine Equation solver (Griggio, JSAT 2012) +

    +
    +
    +
    +
    + + + dio-turns + + + [type + + + int64_t + + + , default + + + 10 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + turns in a row dio solver cutting gets +

    +
    +
    +
    +
    + + + error-selection-rule + + + [ + + + min + + + | + + + varord + + + | + + + max + + + | + + + sum + + + , default + + + min + + + ] +
    +
    +

    + + [experts only] + +

    +

    + change the pivot rule for the basic variable (default is ‘min’, see –pivot-rule help) +

    +

    + This decides on the rule used by simplex during heuristic rounds for deciding the next basic variable to select. +

    +
    +
    + + + min + + + + : + +
    +
    +

    + The minimum abs() value of the variable’s violation of its bound. +

    +
    +
    + + + varord + + + + : + +
    +
    +

    + The variable order. +

    +
    +
    + + + max + + + + : + +
    +
    +

    + The maximum violation the bound. +

    +
    +
    +
    +
    +
    +
    + + + fc-penalties + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turns on degenerate pivot penalties +

    +
    +
    +
    +
    + + + heuristic-pivots + + + [type + + + int64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the number of times to apply the heuristic pivot rule; if N < 0, this defaults to the number of variables; if this is unset, this is tuned by the logic selection +

    +
    +
    +
    +
    + + + lemmas-on-replay-failure + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + attempt to use external lemmas if approximate solve integer failed +

    +
    +
    +
    +
    + + + maxCutsInContext + + + [type + + + uint64_t + + + , default + + + 65535 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum cuts in a given context before signalling a restart +

    +
    +
    +
    +
    + + + miplib-trick + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turns on the preprocessing step of attempting to infer bounds on miplib problems +

    +
    +
    +
    +
    + + + miplib-trick-subs + + + [type + + + uint64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + do substitution for miplib ‘tmp’ vars if defined in <= N eliminated vars +

    +
    +
    +
    +
    + + + new-prop + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use the new row propagation system +

    +
    +
    +
    +
    + + + nl-cov + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + whether to use the cylindrical algebraic coverings solver for non-linear arithmetic +

    +
    +
    +
    +
    + + + nl-cov-force + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + forces using the cylindrical algebraic coverings solver, even in cases where it is possibly not safe to do so +

    +
    +
    +
    +
    + + + nl-cov-lift + + + [ + + + regular + + + | + + + lazard + + + , default + + + regular + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose the Coverings lifting mode +

    +

    + Modes for the Coverings lifting in non-linear arithmetic. +

    +
    +
    + + + regular + + + + : + +
    +
    +

    + Regular lifting. +

    +
    +
    + + + lazard + + + + : + +
    +
    +

    + Lazard’s lifting scheme. +

    +
    +
    +
    +
    +
    +
    + + + nl-cov-linear-model + + + [ + + + none + + + | + + + initial + + + | + + + persistent + + + , default + + + none + + + ] +
    +
    +

    + whether to use the linear model as initial guess for the cylindrical algebraic coverings solver +

    +

    + Modes for the usage of the linear model in non-linear arithmetic. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use linear model to seed nonlinear model +

    +
    +
    + + + initial + + + + : + +
    +
    +

    + Use linear model to seed nonlinear model initially, discard it when it does not work +

    +
    +
    + + + persistent + + + + : + +
    +
    +

    + Use linear model to seed nonlinear model whenever possible +

    +
    +
    +
    +
    +
    +
    + + + nl-cov-proj + + + [ + + + mccallum + + + | + + + lazard + + + | + + + lazard-mod + + + , default + + + mccallum + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose the Coverings projection operator +

    +

    + Modes for the Coverings projection operator in non-linear arithmetic. +

    +
    +
    + + + mccallum + + + + : + +
    +
    +

    + McCallum’s projection operator. +

    +
    +
    + + + lazard + + + + : + +
    +
    +

    + Lazard’s projection operator. +

    +
    +
    + + + lazard-mod + + + + : + +
    +
    +

    + A modification of Lazard’s projection operator. +

    +
    +
    +
    +
    +
    +
    + + + nl-cov-prune + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to prune intervals more agressively +

    +
    +
    +
    +
    + + + nl-cov-var-elim + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to eliminate variables using equalities before going into the cylindrical algebraic coverings solver. It can not be used when producing proofs right now. +

    +
    +
    +
    +
    + + + nl-ext + + + [ + + + none + + + | + + + light + + + | + + + full + + + , default + + + full + + + ] +
    +
    +

    + incremental linearization approach to non-linear +

    +

    + Modes for the non-linear linearization +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Disable linearization approach +

    +
    +
    + + + light + + + + : + +
    +
    +

    + Only use a few light-weight lemma schemes +

    +
    +
    + + + full + + + + : + +
    +
    +

    + Use all lemma schemes +

    +
    +
    +
    +
    +
    +
    + + + nl-ext-ent-conf + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + check for entailed conflicts in non-linear solver +

    +
    +
    +
    +
    + + + nl-ext-factor + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use factoring inference in non-linear incremental linearization solver +

    +
    +
    +
    +
    + + + nl-ext-inc-prec + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to increment the precision for irrational function constraints +

    +
    +
    +
    +
    + + + nl-ext-purify + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + purify non-linear terms at preprocess +

    +
    +
    +
    +
    + + + nl-ext-rbound + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use resolution-style inference for inferring new bounds in non-linear incremental linearization solver +

    +
    +
    +
    +
    + + + nl-ext-rewrite + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + do context-dependent simplification based on rewrites in non-linear solver +

    +
    +
    +
    +
    + + + nl-ext-split-zero + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + initial splits on zero for all variables +

    +
    +
    +
    +
    + + + nl-ext-tf-taylor-deg + + + [type + + + int64_t + + + , default + + + 4 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + initial degree of polynomials for Taylor approximation +

    +
    +
    +
    +
    + + + nl-ext-tf-tplanes + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use non-terminating tangent plane strategy for transcendental functions for non-linear incremental linearization solver +

    +
    +
    +
    +
    + + + nl-ext-tplanes + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use non-terminating tangent plane strategy for non-linear incremental linearization solver +

    +
    +
    +
    +
    + + + nl-ext-tplanes-interleave + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + interleave tangent plane strategy for non-linear incremental linearization solver +

    +
    +
    +
    +
    + + + nl-icp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to use ICP-style propagations for non-linear arithmetic +

    +
    +
    +
    +
    + + + nl-rlv + + + [ + + + none + + + | + + + interleave + + + | + + + always + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose mode for using relevance of assertions in non-linear arithmetic +

    +

    + Modes for using relevance of assertions in non-linear arithmetic. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use relevance. +

    +
    +
    + + + interleave + + + + : + +
    +
    +

    + Alternate rounds using relevance. +

    +
    +
    + + + always + + + + : + +
    +
    +

    + Always use relevance. +

    +
    +
    +
    +
    +
    +
    + + + nl-rlv-assert-bounds + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use bound inference utility to prune when an assertion is entailed by another +

    +
    +
    +
    +
    + + + pb-rewrites + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply pseudo boolean rewrites +

    +
    +
    +
    +
    + + + pivot-threshold + + + [type + + + uint64_t + + + , default + + + 2 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the number of pivots using –pivot-rule per basic variable per simplex instance before using variable order +

    +
    +
    +
    +
    + + + pp-assert-max-sub-size + + + [type + + + uint64_t + + + , default + + + 2 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + threshold for substituting an equality in ppAssert +

    +
    +
    +
    +
    + + + prop-row-length + + + [type + + + uint64_t + + + , default + + + 16 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the maximum row length to be used in propagation +

    +
    +
    +
    +
    + + + replay-early-close-depth + + + [type + + + int64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + multiples of the depths to try to close the approx log eagerly +

    +
    +
    +
    +
    + + + replay-lemma-reject-cut + + + [type + + + uint64_t + + + , default + + + 25500 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum complexity of any coefficient while outputting replaying cut lemmas +

    +
    +
    +
    +
    + + + replay-num-err-penalty + + + [type + + + int64_t + + + , default + + + 4194304 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of solve integer attempts to skips after a numeric failure +

    +
    +
    +
    +
    + + + replay-reject-cut + + + [type + + + uint64_t + + + , default + + + 25500 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum complexity of any coefficient while replaying cuts +

    +
    +
    +
    +
    + + + restrict-pivots + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + have a pivot cap for simplex at effort levels below fullEffort +

    +
    +
    +
    +
    + + + revert-arith-models-on-unsat + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + revert the arithmetic model to a known safe model on unsat if one is cached +

    +
    +
    +
    +
    + + + rr-turns + + + [type + + + int64_t + + + , default + + + 3 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + round robin turn +

    +
    +
    +
    +
    + + + se-solve-int + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + attempt to use the approximate solve integer method on standard effort +

    +
    +
    +
    +
    + + + simplex-check-period + + + [type + + + uint64_t + + + , default + + + 200 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the number of pivots to do in simplex before rechecking for a conflict on all variables +

    +
    +
    +
    +
    + + + soi-qe + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use quick explain to minimize the sum of infeasibility conflicts +

    +
    +
    +
    +
    + + + standard-effort-variable-order-pivots + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + limits the number of pivots in a single invocation of check() at a non-full effort level using Bland’s pivot rule +

    +
    +
    +
    +
    + + + unate-lemmas + + + [ + + + all + + + | + + + eqs + + + | + + + ineqs + + + | + + + none + + + , default + + + all + + + ] +
    +
    +

    + + [experts only] + +

    +

    + determines which lemmas to add before solving (default is ‘all’, see –unate-lemmas=help) +

    +

    + Unate lemmas are generated before SAT search begins using the relationship of constant terms and polynomials. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + A combination of inequalities and equalities. +

    +
    +
    + + + eqs + + + + : + +
    +
    +

    + Outputs lemmas of the general forms (= p c) implies (<= p d) for c < d, or (= p c) implies (not (= p d)) for c != d. +

    +
    +
    + + + ineqs + + + + : + +
    +
    +

    + Outputs lemmas of the general form (<= p c) implies (<= p d) for c < d. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not add unate lemmas. +

    +
    +
    +
    +
    +
    +
    + + + use-approx + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + attempt to use an approximate solver +

    +
    +
    +
    +
    + + + use-fcsimplex + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use focusing and converging simplex (FMCAD 2013 submission) +

    +
    +
    +
    +
    + + + use-soi + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use sum of infeasibility simplex (FMCAD 2013 submission) +

    +
    +
    +
    +
    +

    + Arrays Theory Module + + ¶ + +

    +
    +
    + + + arrays-eager-index + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turn on eager index splitting for generated array lemmas +

    +
    +
    +
    +
    + + + arrays-eager-lemmas + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turn on eager lemma generation for arrays +

    +
    +
    +
    +
    + + + arrays-exp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable experimental features in the theory of arrays +

    +
    +
    +
    +
    + + + arrays-optimize-linear + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turn on optimization for linear array terms (see de Moura FMCAD 09 arrays paper) +

    +
    +
    +
    +
    + + + arrays-prop + + + [type + + + int64_t + + + , default + + + 2 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + propagation effort for arrays: 0 is none, 1 is some, 2 is full +

    +
    +
    +
    +
    + + + arrays-reduce-sharing + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use model information to reduce size of care graph for arrays +

    +
    +
    +
    +
    + + + arrays-weak-equiv + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use algorithm from Christ/Hoenicke (SMT 2014) +

    +
    +
    +
    +
    +

    + Base Module + + ¶ + +

    +
    +
    + + + d + + + | + + + debug + + + [type + + + string + + + ] +
    +
    +

    + debug something (e.g. -d arith), can repeat +

    +
    +
    +
    +
    + + + err + + + | + + + diagnostic-output-channel + + + [custom + + + ManagedErr + + + , default + + + {} + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Set the error (or diagnostic) output channel. Writes to stderr for “stderr” or “–”, stdout for “stdout” or the given filename otherwise. +

    +
    +
    +
    +
    + + + in + + + [custom + + + ManagedIn + + + , default + + + {} + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Set the error (or diagnostic) output channel. Reads from stdin for “stdin” or “–” and the given filename otherwise. +

    +
    +
    +
    +
    + + + out + + + | + + + regular-output-channel + + + [custom + + + ManagedOut + + + , default + + + {} + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Set the error (or diagnostic) output channel. Writes to stdout for “stdout” or “–”, stderr for “stderr” or the given filename otherwise. +

    +
    +
    +
    +
    + + + rweight + + + [type + + + string + + + ] +
    +
    +

    + + [experts only] + +

    +

    + set a single resource weight +

    +
    +
    +
    +
    + + + stats-all + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + print unchanged (defaulted) statistics as well +

    +
    +
    +
    +
    + + + stats-every-query + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + in incremental mode, print stats after every satisfiability or validity query +

    +
    +
    +
    +
    + + + stats-internal + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + print internal (non-public) statistics as well +

    +
    +
    +
    +
    + + + t + + + | + + + trace + + + [type + + + string + + + ] +
    +
    +

    + trace something (e.g. -t pushpop), can repeat and may contain wildcards like (e.g. -t theory::*) +

    +
    +
    +
    +
    +

    + Bitvector Theory Module + + ¶ + +

    +
    +
    + + + bitblast + + + [ + + + lazy + + + | + + + eager + + + , default + + + lazy + + + ] +
    +
    +

    + choose bitblasting mode, see –bitblast=help +

    +

    + Bit-blasting modes. +

    +
    +
    + + + lazy + + + + : + +
    +
    +

    + Separate Boolean structure and term reasoning between the core SAT solver and the bit-vector SAT solver. +

    +
    +
    + + + eager + + + + : + +
    +
    +

    + Bitblast eagerly to bit-vector SAT solver. +

    +
    +
    +
    +
    +
    +
    + + + bitwise-eq + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + lift equivalence with one-bit bit-vectors to be boolean operations +

    +
    +
    +
    +
    + + + bool-to-bv + + + [ + + + off + + + | + + + ite + + + | + + + all + + + , default + + + off + + + ] +
    +
    +

    + convert booleans to bit-vectors of size 1 at various levels of aggressiveness, see –bool-to-bv=help +

    +

    + BoolToBV preprocessing pass modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Don’t push any booleans to width one bit-vectors. +

    +
    +
    + + + ite + + + + : + +
    +
    +

    + Try to turn ITEs into BITVECTOR_ITE when possible. It can fail per-formula if not all sub-formulas can be turned to bit-vectors. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Force all booleans to be bit-vectors of width one except at the top level. Most aggressive mode. +

    +
    +
    +
    +
    +
    +
    + + + bv-assert-input + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + assert input assertions on user-level 0 instead of assuming them in the bit-vector SAT solver +

    +
    +
    +
    +
    + + + bv-gauss-elim + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + simplify formula via Gaussian Elimination if applicable +

    +
    +
    +
    +
    + + + bv-intro-pow2 + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + introduce bitvector powers of two as a preprocessing pass +

    +
    +
    +
    +
    + + + bv-propagate + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use bit-vector propagation in the bit-blaster +

    +
    +
    +
    +
    + + + bv-rw-extend-eq + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable additional rewrites over zero/sign extend over equalities with constants (useful on BV/2017-Preiner-scholl-smt08) +

    +
    +
    +
    +
    + + + bv-sat-solver + + + [ + + + minisat + + + | + + + cryptominisat + + + | + + + cadical + + + | + + + kissat + + + , default + + + cadical + + + ] +
    +
    +

    + choose which sat solver to use, see –bv-sat-solver=help +

    +

    + SAT solver for bit-blasting backend. +

    +
    +
    +
    +
    + + + bv-solver + + + [ + + + bitblast + + + | + + + bitblast-internal + + + , default + + + bitblast + + + ] +
    +
    +

    + choose bit-vector solver, see –bv-solver=help +

    +

    + Bit-vector solvers. +

    +
    +
    + + + bitblast + + + + : + +
    +
    +

    + Enables bitblasting solver. +

    +
    +
    + + + bitblast-internal + + + + : + +
    +
    +

    + Enables bitblasting to internal SAT solver with proof support. +

    +
    +
    +
    +
    +
    +
    + + + bv-to-bool + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + lift bit-vectors of size 1 to booleans when possible +

    +
    +
    +
    +
    +

    + Datatypes Theory Module + + ¶ + +

    +
    +
    + + + cdt-bisimilar + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do bisimilarity check for co-datatypes +

    +
    +
    +
    +
    + + + dt-binary-split + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do binary splits for datatype constructor types +

    +
    +
    +
    +
    + + + dt-blast-splits + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + when applicable, blast splitting lemmas for all variables at once +

    +
    +
    +
    +
    + + + dt-cyclic + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do cyclicity check for datatypes +

    +
    +
    +
    +
    + + + dt-infer-as-lemmas + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + always send lemmas out instead of making internal inferences +

    +
    +
    +
    +
    + + + dt-nested-rec + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + allow nested recursion in datatype definitions +

    +
    +
    +
    +
    + + + dt-polite-optimize + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turn on optimization for polite combination +

    +
    +
    +
    +
    + + + dt-share-sel + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + internally use shared selectors across multiple constructors +

    +
    +
    +
    +
    + + + sygus-abort-size + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + tells enumerative sygus to only consider solutions up to term size N (-1 == no limit, default) +

    +
    +
    +
    +
    + + + sygus-fair + + + [ + + + direct + + + | + + + dt-size + + + | + + + dt-height-bound + + + | + + + dt-size-bound + + + | + + + none + + + , default + + + dt-size + + + ] +
    +
    +

    + if and how to apply fairness for sygus +

    +

    + Modes for enforcing fairness for counterexample guided quantifier instantion. +

    +
    +
    + + + direct + + + + : + +
    +
    +

    + Enforce fairness using direct conflict lemmas. +

    +
    +
    + + + dt-size + + + + : + +
    +
    +

    + Enforce fairness using size operator. +

    +
    +
    + + + dt-height-bound + + + + : + +
    +
    +

    + Enforce fairness by height bound predicate. +

    +
    +
    + + + dt-size-bound + + + + : + +
    +
    +

    + Enforce fairness by size bound predicate. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not enforce fairness. +

    +
    +
    +
    +
    +
    +
    + + + sygus-fair-max + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use max instead of sum for multi-function sygus conjectures +

    +
    +
    +
    +
    + + + sygus-rewriter + + + [ + + + none + + + | + + + basic + + + | + + + extended + + + , default + + + extended + + + ] +
    +
    +

    + if and how to apply rewriting for sygus symmetry breaking +

    +

    + Modes for applying rewriting for sygus symmetry breaking. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use the rewriter. +

    +
    +
    + + + basic + + + + : + +
    +
    +

    + Use the basic rewriter. +

    +
    +
    + + + extended + + + + : + +
    +
    +

    + Use the extended rewriter. +

    +
    +
    +
    +
    +
    +
    + + + sygus-simple-sym-break + + + [ + + + none + + + | + + + basic + + + | + + + agg + + + , default + + + agg + + + ] +
    +
    +

    + if and how to apply simple symmetry breaking based on the grammar for smart enumeration +

    +

    + Modes for applying simple symmetry breaking based on the grammar for smart enumeration. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not apply simple symmetry breaking. +

    +
    +
    + + + basic + + + + : + +
    +
    +

    + Apply basic simple symmetry breaking. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Apply aggressive simple symmetry breaking. +

    +
    +
    +
    +
    +
    +
    + + + sygus-sym-break-lazy + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + lazily add symmetry breaking lemmas for terms +

    +
    +
    +
    +
    + + + sygus-sym-break-pbe + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + sygus symmetry breaking lemmas based on pbe conjectures +

    +
    +
    +
    +
    + + + sygus-sym-break-rlv + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + add relevancy conditions to symmetry breaking lemmas +

    +
    +
    +
    +
    +

    + Decision Heuristics Module + + ¶ + +

    +
    +
    + + + decision + + + | + + + decision-mode + + + [ + + + internal + + + | + + + justification + + + | + + + stoponly + + + , default + + + internal + + + ] +
    +
    +

    + choose decision mode, see –decision=help +

    +

    + Decision modes. +

    +
    +
    + + + internal + + + + : + +
    +
    +

    + Use the internal decision heuristics of the SAT solver. +

    +
    +
    + + + justification + + + + : + +
    +
    +

    + An ATGP-inspired justification heuristic. +

    +
    +
    + + + stoponly + + + + : + +
    +
    +

    + Use the justification heuristic only to stop early, not for decisions. +

    +
    +
    +
    +
    +
    +
    + + + jh-rlv-order + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + maintain activity-based ordering for decision justification heuristic +

    +
    +
    +
    +
    + + + jh-skolem + + + [ + + + first + + + | + + + last + + + , default + + + first + + + ] +
    +
    +

    + + [experts only] + +

    +

    + policy for when to satisfy skolem definitions in justification heuristic +

    +

    + Policy for when to satisfy skolem definitions in justification heuristic +

    +
    +
    + + + first + + + + : + +
    +
    +

    + satisfy pending relevant skolem definitions before input assertions +

    +
    +
    + + + last + + + + : + +
    +
    +

    + satisfy pending relevant skolem definitions after input assertions +

    +
    +
    +
    +
    +
    +
    + + + jh-skolem-rlv + + + [ + + + assert + + + | + + + always + + + , default + + + assert + + + ] +
    +
    +

    + + [experts only] + +

    +

    + policy for when to consider skolem definitions relevant in justification heuristic +

    +

    + Policy for when to consider skolem definitions relevant in justification heuristic +

    +
    +
    + + + assert + + + + : + +
    +
    +

    + skolems are relevant when they occur in an asserted literal +

    +
    +
    + + + always + + + + : + +
    +
    +

    + skolems are always relevant +

    +
    +
    +
    +
    +
    +
    +

    + Expression Module + + ¶ + +

    +
    +
    + + + type-checking + + + [type + + + bool + + + , default + + + DO_SEMANTIC_CHECKS_BY_DEFAULT + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + type check expressions +

    +
    +
    +
    +
    + + + wf-checking + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + check that terms passed to API methods are well formed (default false for text interface) +

    +
    +
    +
    +
    +

    + Floating-Point Module + + ¶ + +

    +
    +
    + + + fp-exp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Allow floating-point sorts of all sizes, rather than only Float32 (8/24) or Float64 (11/53) (experimental) +

    +
    +
    +
    +
    + + + fp-lazy-wb + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Enable lazier word-blasting (on preNotifyFact instead of registerTerm) +

    +
    +
    +
    +
    +

    + Driver Module + + ¶ + +

    +
    +
    + + + dump-difficulty + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + dump the difficulty measure after every response to check-sat +

    +
    +
    +
    +
    + + + dump-instantiations + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + output instantiations of quantified formulas after every UNSAT/VALID response +

    +
    +
    +
    +
    + + + dump-instantiations-debug + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + output instantiations of quantified formulas after every UNSAT/VALID response, with debug information +

    +
    +
    +
    +
    + + + dump-models + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + output models after every SAT/INVALID/UNKNOWN response +

    +
    +
    +
    +
    + + + dump-proofs + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + output proofs after every UNSAT/VALID response +

    +
    +
    +
    +
    + + + dump-unsat-cores + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + output unsat cores after every UNSAT/VALID response +

    +
    +
    +
    +
    + + + early-exit + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do not run destructors at exit; default on except in debug builds +

    +
    +
    +
    +
    + + + force-no-limit-cpu-while-dump + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Force no CPU limit when dumping models and proofs +

    +
    +
    +
    +
    + + + portfolio-jobs + + + [type + + + uint64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Number of parallel jobs the portfolio engine can run +

    +
    +
    +
    +
    + + + segv-spin + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + spin on segfault/other crash waiting for gdb +

    +
    +
    +
    +
    + + + show-debug-tags + + + [type + + + bool + + + , default + + + false + + + ] +
    +
    +

    + + [experts only] + +

    +

    + show all available tags for debugging +

    +
    +
    +
    +
    + + + show-trace-tags + + + [type + + + bool + + + , default + + + false + + + ] +
    +
    +

    + + [experts only] + +

    +

    + show all available tags for tracing +

    +
    +
    +
    +
    + + + use-portfolio + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Use internal portfolio mode based on the logic +

    +
    +
    +
    +
    +

    + Parallel Module + + ¶ + +

    +
    +
    + + + append-learned-literals-to-cubes + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + emit learned literals with the cubes +

    +
    +
    +
    +
    + + + checks-before-partition + + + [type + + + uint64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of standard or full effort checks until partitioning +

    +
    +
    +
    +
    + + + checks-between-partitions + + + [type + + + uint64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of checks between partitions +

    +
    +
    +
    +
    + + + compute-partitions + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + make n partitions. n <2 disables computing partitions entirely +

    +
    +
    +
    +
    + + + partition-check + + + | + + + check + + + [ + + + standard + + + | + + + full + + + , default + + + standard + + + ] +
    +
    +

    + + [experts only] + +

    +

    + select whether partitioning happens at full or standard check +

    +

    + Partition check modes. +

    +
    +
    + + + standard + + + + : + +
    +
    +

    + create partitions at standard checks +

    +
    +
    + + + full + + + + : + +
    +
    +

    + create partitions at full checks +

    +
    +
    +
    +
    +
    +
    + + + partition-conflict-size + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of literals in a cube; if no partition size is set, then the partition conflict size is chosen to be log2(number of requested partitions) +

    +
    +
    +
    +
    + + + partition-strategy + + + | + + + partition + + + [ + + + revised + + + | + + + strict-cube + + + | + + + decision-trail + + + | + + + heap-trail + + + , default + + + revised + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose partition strategy mode +

    +

    + Partition strategy modes. +

    +
    +
    + + + revised + + + + : + +
    +
    +

    + For 4 partitions, creates cubes C1, C2, C3, !C1 & !C2 & !C3 +

    +
    +
    + + + strict-cube + + + + : + +
    +
    +

    + For 4 partitions, creates cubes C1, !C1 & C2, !C1 & !C2 & C3, !C1 & !C2 & !C3 +

    +
    +
    + + + decision-trail + + + + : + +
    +
    +

    + Creates mutually exclusive cubes from the decisions in the SAT solver. +

    +
    +
    + + + heap-trail + + + + : + +
    +
    +

    + Creates mutually exclusive cubes from the order heap in the SAT solver. +

    +
    +
    +
    +
    +
    +
    + + + write-partitions-to + + + | + + + partitions-out + + + [custom + + + ManagedOut + + + , default + + + ManagedOut() + + + ] +
    +
    +

    + + [experts only] + +

    +

    + set the output channel for writing partitions +

    +
    +
    +
    +
    +

    + Parser Module + + ¶ + +

    +
    +
    + + + filesystem-access + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + limits the file system access if set to false +

    +
    +
    +
    +
    + + + global-declarations + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + force all declarations and definitions to be global +

    +
    +
    +
    +
    + + + semantic-checks + + + [type + + + bool + + + , default + + + DO_SEMANTIC_CHECKS_BY_DEFAULT + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable semantic checks, including type checks +

    +
    +
    +
    +
    +

    + Printing Module + + ¶ + +

    +
    +
    + + + bv-print-consts-as-indexed-symbols + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + print bit-vector constants in decimal (e.g. (_ bv1 4)) instead of binary (e.g. #b0001), applies to SMT-LIB 2.x +

    +
    +
    +
    +
    + + + expr-depth + + + [type + + + int64_t + + + , + + + -1 + + + <= + + + N + + + , default + + + -1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + print exprs to depth N (0 == default, -1 == no limit) +

    +
    +
    +
    +
    + + + flatten-ho-chains + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + print (binary) application chains in a flattened way, e.g. (a b c) rather than ((a b) c) +

    +
    +
    +
    +
    + + + model-u-print + + + [ + + + decl-sort-and-fun + + + | + + + decl-fun + + + | + + + none + + + , default + + + none + + + ] +
    +
    +

    + determines how to print uninterpreted elements in models +

    +

    + uninterpreted elements in models printing modes. +

    +
    +
    + + + decl-sort-and-fun + + + + : + +
    +
    +

    + print uninterpreted elements declare-fun, and also include a declare-sort for the sort +

    +
    +
    + + + decl-fun + + + + : + +
    +
    +

    + print uninterpreted elements declare-fun, but don’t include a declare-sort for the sort +

    +
    +
    + + + none + + + + : + +
    +
    +

    + (default) do not print declarations of uninterpreted elements in models. +

    +
    +
    +
    +
    +
    +
    +

    + Proof Module + + ¶ + +

    +
    +
    + + + check-proof-steps + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Check proof steps for satisfiability, for refutation soundness testing. Note this checks only steps for non-core proof rules +

    +
    +
    +
    +
    + + + print-dot-clusters + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + Whether the proof node clusters (e.g. SAT, CNF, INPUT) will be printed when using the dot format or not. +

    +
    +
    +
    +
    + + + proof-alethe-res-pivots + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Add pivots to Alethe resolution steps +

    +
    +
    +
    +
    + + + proof-annotate + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + add optional annotations to proofs, which enables statistics for inference ids for lemmas and conflicts appearing in final proof +

    +
    +
    +
    +
    + + + proof-check + + + [ + + + eager + + + | + + + eager-simple + + + | + + + lazy + + + | + + + none + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + select internal proof checking mode +

    +

    + Internal proof checking modes. +

    +
    +
    + + + eager + + + + : + +
    +
    +

    + check rule applications and proofs from generators eagerly for local debugging +

    +
    +
    + + + eager-simple + + + + : + +
    +
    +

    + check rule applications during construction +

    +
    +
    + + + lazy + + + + : + +
    +
    +

    + check rule applications only during final proof construction +

    +
    +
    + + + none + + + + : + +
    +
    +

    + do not check rule applications +

    +
    +
    +
    +
    +
    +
    + + + proof-dot-dag + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Indicates if the dot proof will be printed as a DAG or as a tree +

    +
    +
    +
    +
    + + + proof-format-mode + + + [ + + + none + + + | + + + dot + + + | + + + lfsc + + + | + + + alethe + + + | + + + tptp + + + , default + + + none + + + ] +
    +
    +

    + select language of proof output +

    +

    + Proof format modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not translate proof output +

    +
    +
    + + + dot + + + + : + +
    +
    +

    + Output DOT proof +

    +
    +
    + + + lfsc + + + + : + +
    +
    +

    + Output LFSC proof +

    +
    +
    + + + alethe + + + + : + +
    +
    +

    + Output Alethe proof +

    +
    +
    + + + tptp + + + + : + +
    +
    +

    + Output TPTP proof (work in progress) +

    +
    +
    +
    +
    +
    +
    + + + proof-granularity + + + [ + + + macro + + + | + + + rewrite + + + | + + + theory-rewrite + + + | + + + dsl-rewrite + + + , default + + + macro + + + ] +
    +
    +

    + modes for proof granularity +

    +

    + Modes for proof granularity. +

    +
    +
    + + + macro + + + + : + +
    +
    +

    + Allow macros. Do not improve the granularity of proofs. +

    +
    +
    + + + rewrite + + + + : + +
    +
    +

    + Allow rewrite or substitution steps, expand macros. +

    +
    +
    + + + theory-rewrite + + + + : + +
    +
    +

    + Allow theory rewrite steps, expand macros, rewrite and substitution steps. +

    +
    +
    + + + dsl-rewrite + + + + : + +
    +
    +

    + Allow DSL rewrites and evaluation steps, expand macros, rewrite, substitution, and theory rewrite steps. +

    +
    +
    +
    +
    +
    +
    + + + proof-pedantic + + + [type + + + uint64_t + + + , + + + N + + + <= + + + 100 + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + assertion failure for any incorrect rule application or untrusted lemma having pedantic level <=N with proof +

    +
    +
    +
    +
    + + + proof-pp-merge + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + merge subproofs in final proof post-processor +

    +
    +
    +
    +
    + + + proof-print-conclusion + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Print conclusion of proof steps when printing AST +

    +
    +
    +
    +
    + + + proof-prune-input + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Prune unused input assumptions from final scope +

    +
    +
    +
    +
    +

    + SAT Layer Module + + ¶ + +

    +
    +
    + + + minisat-dump-dimacs + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + instead of solving minisat dumps the asserted clauses in Dimacs format +

    +
    +
    +
    +
    + + + minisat-simplification + + + [ + + + all + + + | + + + clause-elim + + + | + + + none + + + , default + + + all + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Simplifications to be performed by Minisat. +

    +

    + Modes for Minisat simplifications. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Variable and clause elimination, plus other simplifications. +

    +
    +
    + + + clause-elim + + + + : + +
    +
    +

    + Caluse elimination and other simplifications, except variable elimination. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + No simplifications. +

    +
    +
    +
    +
    +
    +
    + + + random-freq + + + | + + + random-frequency + + + [type + + + double + + + , + + + 0.0 + + + <= + + + P + + + <= + + + 1.0 + + + , default + + + 0.0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the frequency of random decisions in the sat solver (P=0.0 by default) +

    +
    +
    +
    +
    + + + restart-int-base + + + [type + + + uint64_t + + + , default + + + 25 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the base restart interval for the sat solver (N=25 by default) +

    +
    +
    +
    +
    + + + restart-int-inc + + + [type + + + double + + + , + + + 0.0 + + + <= + + + F + + + , default + + + 3.0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the restart interval increase factor for the sat solver (F=3.0 by default) +

    +
    +
    +
    +
    + + + sat-random-seed + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + sets the random seed for the sat solver +

    +
    +
    +
    +
    +

    + Quantifiers Module + + ¶ + +

    +
    +
    + + + cbqi + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable conflict-based quantifier instantiation +

    +
    +
    +
    +
    + + + cbqi-all-conflict + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + add all available conflicting instances during conflict-based instantiation +

    +
    +
    +
    +
    + + + cbqi-eager-check-rd + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + optimization, eagerly check relevant domain of matched position +

    +
    +
    +
    +
    + + + cbqi-eager-test + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + optimization, test cbqi instances eagerly +

    +
    +
    +
    +
    + + + cbqi-mode + + + [ + + + conflict + + + | + + + prop-eq + + + , default + + + prop-eq + + + ] +
    +
    +

    + what effort to apply conflict find mechanism +

    +

    + Quantifier conflict find modes. +

    +
    +
    + + + conflict + + + + : + +
    +
    +

    + Apply QCF algorithm to find conflicts only. +

    +
    +
    + + + prop-eq + + + + : + +
    +
    +

    + Apply QCF algorithm to propagate equalities as well as conflicts. +

    +
    +
    +
    +
    +
    +
    + + + cbqi-skip-rd + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + optimization, skip instances based on possibly irrelevant portions of quantified formulas +

    +
    +
    +
    +
    + + + cbqi-tconstraint + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable entailment checks for t-constraints in cbqi algorithm +

    +
    +
    +
    +
    + + + cbqi-vo-exp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + cbqi experimental variable ordering +

    +
    +
    +
    +
    + + + cegis-sample + + + [ + + + none + + + | + + + use + + + | + + + trust + + + , default + + + none + + + ] +
    +
    +

    + mode for using samples in the counterexample-guided inductive synthesis loop +

    +

    + Modes for sampling with counterexample-guided inductive synthesis (CEGIS). +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use sampling with CEGIS. +

    +
    +
    + + + use + + + + : + +
    +
    +

    + Use sampling to accelerate CEGIS. This will rule out solutions for a conjecture when they are not satisfied by a sample point. +

    +
    +
    + + + trust + + + + : + +
    +
    +

    + Trust that when a solution for a conjecture is always true under sampling, then it is indeed a solution. Note this option may print out spurious solutions for synthesis conjectures. +

    +
    +
    +
    +
    +
    +
    + + + cegqi + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turns on counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-all + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply counterexample-based instantiation to all quantified formulas +

    +
    +
    +
    +
    + + + cegqi-bv + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use word-level inversion approach for counterexample-guided quantifier instantiation for bit-vectors +

    +
    +
    +
    +
    + + + cegqi-bv-concat-inv + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + compute inverse for concat over equalities rather than producing an invertibility condition +

    +
    +
    +
    +
    + + + cegqi-bv-ineq + + + [ + + + eq-slack + + + | + + + eq-boundary + + + | + + + keep + + + , default + + + eq-boundary + + + ] +
    +
    +

    + choose mode for handling bit-vector inequalities with counterexample-guided instantiation +

    +

    + Modes for handling bit-vector inequalities in counterexample-guided instantiation. +

    +
    +
    + + + eq-slack + + + + : + +
    +
    +

    + Solve for the inequality using the slack value in the model, e.g., t > s becomes t = s + ( t-s )^M. +

    +
    +
    + + + eq-boundary + + + + : + +
    +
    +

    + Solve for the boundary point of the inequality, e.g., t > s becomes t = s+1. +

    +
    +
    + + + keep + + + + : + +
    +
    +

    + Solve for the inequality directly using side conditions for invertibility. +

    +
    +
    +
    +
    +
    +
    + + + cegqi-bv-interleave-value + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + interleave model value instantiation with word-level inversion approach +

    +
    +
    +
    +
    + + + cegqi-bv-linear + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + linearize adder chains for variables +

    +
    +
    +
    +
    + + + cegqi-bv-rm-extract + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + replaces extract terms with variables for counterexample-guided instantiation for bit-vectors +

    +
    +
    +
    +
    + + + cegqi-bv-solve-nl + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + try to solve non-linear bv literals using model value projections +

    +
    +
    +
    +
    + + + cegqi-full + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turns on full effort counterexample-based quantifier instantiation, which may resort to model-value instantiation +

    +
    +
    +
    +
    + + + cegqi-inf-int + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use integer infinity for vts in counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-inf-real + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use real infinity for vts in counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-innermost + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + only process innermost quantified formulas in counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-midpoint + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + choose substitutions based on midpoints of lower and upper bounds for counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-min-bounds + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use minimally constrained lower/upper bound for counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-multi-inst + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + when applicable, do multi instantiations per quantifier per round in counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-nested-qe + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + process nested quantified formulas with quantifier elimination in counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-nopt + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + non-optimal bounds for counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cegqi-round-up-lia + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + round up integer lower bounds in substitutions for counterexample-based quantifier instantiation +

    +
    +
    +
    +
    + + + cond-var-split-quant + + + [ + + + off + + + | + + + on + + + | + + + agg + + + , default + + + on + + + ] +
    +
    +

    + + [experts only] + +

    +

    + split quantified formulas that lead to variable eliminations +

    +

    + Modes for splitting quantified formulas that lead to variable eliminations. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not split quantified formulas. +

    +
    +
    + + + on + + + + : + +
    +
    +

    + Split quantified formulas that lead to variable eliminations. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Aggressively split quantified formulas that lead to variable eliminations. +

    +
    +
    +
    +
    +
    +
    + + + conjecture-gen + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + generate candidate conjectures for inductive proofs +

    +
    +
    +
    +
    + + + conjecture-gen-gt-enum + + + [type + + + int64_t + + + , default + + + 50 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of ground terms to generate for model filtering +

    +
    +
    +
    +
    + + + conjecture-gen-max-depth + + + [type + + + int64_t + + + , default + + + 3 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum depth of terms to consider for conjectures +

    +
    +
    +
    +
    + + + conjecture-gen-per-round + + + [type + + + int64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of conjectures to generate per instantiation round +

    +
    +
    +
    +
    + + + cons-exp-triggers + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use constructor expansion for single constructor datatypes triggers +

    +
    +
    +
    +
    + + + dt-stc-ind + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply strengthening for existential quantification over datatypes based on structural induction +

    +
    +
    +
    +
    + + + dt-var-exp-quant + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + expand datatype variables bound to one constructor in quantifiers +

    +
    +
    +
    +
    + + + e-matching + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + whether to do heuristic E-matching +

    +
    +
    +
    +
    + + + elim-taut-quant + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + eliminate tautological disjuncts of quantified formulas +

    +
    +
    +
    +
    + + + enum-inst + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enumerative instantiation: instantiate with ground terms from relevant domain, then arbitrary ground terms before answering unknown +

    +
    +
    +
    +
    + + + enum-inst-interleave + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + interleave enumerative instantiation with other techniques +

    +
    +
    +
    +
    + + + enum-inst-limit + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum number of rounds of enumerative instantiation to apply (-1 means no limit) +

    +
    +
    +
    +
    + + + enum-inst-rd + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + whether to use relevant domain first for enumerative instantiation strategy +

    +
    +
    +
    +
    + + + enum-inst-stratify + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + stratify effort levels in enumerative instantiation, which favors speed over fairness +

    +
    +
    +
    +
    + + + enum-inst-sum + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enumerating tuples of quantifiers by increasing the sum of indices, rather than the maximum +

    +
    +
    +
    +
    + + + ext-rewrite-quant + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + apply extended rewriting to bodies of quantified formulas +

    +
    +
    +
    +
    + + + finite-model-find + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use finite model finding heuristic for quantifier instantiation +

    +
    +
    +
    +
    + + + fmf-bound + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + finite model finding on bounded quantification +

    +
    +
    +
    +
    + + + fmf-bound-blast + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + send all instantiations for bounded ranges in a single round +

    +
    +
    +
    +
    + + + fmf-bound-lazy + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enforce bounds for bounded quantification lazily via use of proxy variables +

    +
    +
    +
    +
    + + + fmf-fun + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + find models for recursively defined functions, assumes functions are admissible +

    +
    +
    +
    +
    + + + fmf-fun-rlv + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + find models for recursively defined functions, assumes functions are admissible, allows empty type when function is irrelevant +

    +
    +
    +
    +
    + + + fmf-mbqi + + + [ + + + none + + + | + + + fmc + + + | + + + trust + + + , default + + + fmc + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose mode for model-based quantifier instantiation +

    +

    + Model-based quantifier instantiation modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Disable model-based quantifier instantiation. +

    +
    +
    + + + fmc + + + + : + +
    +
    +

    + Use algorithm from Section 5.4.2 of thesis Finite Model Finding in Satisfiability Modulo Theories. +

    +
    +
    + + + trust + + + + : + +
    +
    +

    + Do not instantiate quantified formulas (incomplete technique). +

    +
    +
    +
    +
    +
    +
    + + + fmf-type-completion-thresh + + + [type + + + int64_t + + + , default + + + 1000 + + + ] +
    +
    +

    + the maximum cardinality of an interpreted type for which exhaustive enumeration in finite model finding is attempted +

    +
    +
    +
    +
    + + + full-saturate-quant + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + resort to full effort techniques instead of answering unknown due to limited quantifier reasoning. Currently enables enumerative instantiation +

    +
    +
    +
    +
    + + + global-negate + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do global negation of input formula +

    +
    +
    +
    +
    + + + ho-elim + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + eagerly eliminate higher-order constraints +

    +
    +
    +
    +
    + + + ho-elim-store-ax + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use store axiom during ho-elim +

    +
    +
    +
    +
    + + + ho-matching + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do higher-order matching algorithm for triggers with variable operators +

    +
    +
    +
    +
    + + + ho-merge-term-db + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + merge term indices modulo equality +

    +
    +
    +
    +
    + + + increment-triggers + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + generate additional triggers as needed during search +

    +
    +
    +
    +
    + + + inst-max-level + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum inst level of terms used to instantiate quantified formulas with (-1 == no limit, default) +

    +
    +
    +
    +
    + + + inst-max-rounds + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + maximum number of instantiation rounds (-1 == no limit, default) +

    +
    +
    +
    +
    + + + inst-no-entail + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + do not consider instances of quantified formulas that are currently entailed +

    +
    +
    +
    +
    + + + inst-when + + + [ + + + full + + + | + + + full-delay + + + | + + + full-last-call + + + | + + + full-delay-last-call + + + | + + + last-call + + + , default + + + full-last-call + + + ] +
    +
    +

    + when to apply instantiation +

    +

    + Instantiation modes. +

    +
    +
    + + + full + + + + : + +
    +
    +

    + Run instantiation round at full effort, before theory combination. +

    +
    +
    + + + full-delay + + + + : + +
    +
    +

    + Run instantiation round at full effort, before theory combination, after all other theories have finished. +

    +
    +
    + + + full-last-call + + + + : + +
    +
    +

    + Alternate running instantiation rounds at full effort and last call. In other words, interleave instantiation and theory combination. +

    +
    +
    + + + full-delay-last-call + + + + : + +
    +
    +

    + Alternate running instantiation rounds at full effort after all other theories have finished, and last call. +

    +
    +
    + + + last-call + + + + : + +
    +
    +

    + Run instantiation at last call effort, after theory combination and and theories report sat. +

    +
    +
    +
    +
    +
    +
    + + + inst-when-phase + + + [type + + + int64_t + + + , default + + + 2 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + instantiation rounds quantifiers takes (>=1) before allowing theory combination to happen +

    +
    +
    +
    +
    + + + int-wf-ind + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply strengthening for integers based on well-founded induction +

    +
    +
    +
    +
    + + + ite-dtt-split-quant + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + split ites with dt testers as conditions +

    +
    +
    +
    +
    + + + ite-lift-quant + + + [ + + + none + + + | + + + simple + + + | + + + all + + + , default + + + simple + + + ] +
    +
    +

    + ite lifting mode for quantified formulas +

    +

    + ITE lifting modes for quantified formulas. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not lift if-then-else in quantified formulas. +

    +
    +
    + + + simple + + + + : + +
    +
    +

    + Lift if-then-else in quantified formulas if results in smaller term size. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Lift if-then-else in quantified formulas. +

    +
    +
    +
    +
    +
    +
    + + + literal-matching + + + [ + + + none + + + | + + + use + + + | + + + agg-predicate + + + | + + + agg + + + , default + + + use + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose literal matching mode +

    +

    + Literal match modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use literal matching. +

    +
    +
    + + + use + + + + : + +
    +
    +

    + Consider phase requirements of triggers conservatively. For example, the trigger P( x ) in forall( x ). ( P( x ) V ~Q( x ) ) will not be matched with terms in the equivalence class of true, and likewise Q( x ) will not be matched terms in the equivalence class of false. Extends to equality. +

    +
    +
    + + + agg-predicate + + + + : + +
    +
    +

    + Consider phase requirements aggressively for predicates. In the above example, only match P( x ) with terms that are in the equivalence class of false. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Consider the phase requirements aggressively for all triggers. +

    +
    +
    +
    +
    +
    +
    + + + macros-quant + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + perform quantifiers macro expansion +

    +
    +
    +
    +
    + + + macros-quant-mode + + + [ + + + all + + + | + + + ground + + + | + + + ground-uf + + + , default + + + ground-uf + + + ] +
    +
    +

    + mode for quantifiers macro expansion +

    +

    + Modes for quantifiers macro expansion. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Infer definitions for functions, including those containing quantified formulas. +

    +
    +
    + + + ground + + + + : + +
    +
    +

    + Only infer ground definitions for functions. +

    +
    +
    + + + ground-uf + + + + : + +
    +
    +

    + Only infer ground definitions for functions that result in triggers for all free variables. +

    +
    +
    +
    +
    +
    +
    + + + mbqi + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use model-based quantifier instantiation +

    +
    +
    +
    +
    + + + mbqi-interleave + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + interleave model-based quantifier instantiation with other techniques +

    +
    +
    +
    +
    + + + mbqi-one-inst-per-round + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + only add one instantiation per quantifier per round for mbqi +

    +
    +
    +
    +
    + + + miniscope-quant + + + [ + + + off + + + | + + + conj + + + | + + + fv + + + | + + + conj-and-fv + + + | + + + agg + + + , default + + + conj-and-fv + + + ] +
    +
    +

    + miniscope mode for quantified formulas +

    +

    + Miniscope quantifiers modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not miniscope quantifiers. +

    +
    +
    + + + conj + + + + : + +
    +
    +

    + Use miniscoping of conjunctions only. +

    +
    +
    + + + fv + + + + : + +
    +
    +

    + Use free variable miniscoping only. +

    +
    +
    + + + conj-and-fv + + + + : + +
    +
    +

    + Enable both conjunction and free variable miniscoping. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Enable aggressive miniscope, which further may rewrite quantified formulas into a form where miniscoping is possible. +

    +
    +
    +
    +
    +
    +
    + + + multi-trigger-cache + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + caching version of multi triggers +

    +
    +
    +
    +
    + + + multi-trigger-linear + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + implementation of multi triggers where maximum number of instantiations is linear wrt number of ground terms +

    +
    +
    +
    +
    + + + multi-trigger-priority + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + only try multi triggers if single triggers give no instantiations +

    +
    +
    +
    +
    + + + multi-trigger-when-single + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + select multi triggers when single triggers exist +

    +
    +
    +
    +
    + + + oracles + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Enable interface to external oracles +

    +
    +
    +
    +
    + + + partial-triggers + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use triggers that do not contain all free variables +

    +
    +
    +
    +
    + + + pool-inst + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + pool-based instantiation: instantiate with ground terms occurring in user-specified pools +

    +
    +
    +
    +
    + + + pre-skolem-quant + + + [ + + + off + + + | + + + on + + + | + + + agg + + + , default + + + off + + + ] +
    +
    +

    + modes to apply skolemization eagerly to bodies of quantified formulas +

    +

    + Modes to apply skolemization eagerly to bodies of quantified formulas. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not apply Skolemization eagerly. +

    +
    +
    + + + on + + + + : + +
    +
    +

    + Apply Skolemization eagerly to top-level (negatively asserted) quantified formulas. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Apply Skolemization eagerly and aggressively during preprocessing. +

    +
    +
    +
    +
    +
    +
    + + + pre-skolem-quant-nested + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply skolemization to nested quantified formulas +

    +
    +
    +
    +
    + + + prenex-quant + + + [ + + + none + + + | + + + simple + + + | + + + norm + + + , default + + + simple + + + ] +
    +
    +

    + prenex mode for quantified formulas +

    +

    + Prenex quantifiers modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not prenex nested quantifiers. +

    +
    +
    + + + simple + + + + : + +
    +
    +

    + Do simple prenexing of same sign quantifiers. +

    +
    +
    + + + norm + + + + : + +
    +
    +

    + Prenex to prenex normal form. +

    +
    +
    +
    +
    +
    +
    + + + prenex-quant-user + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + prenex quantified formulas with user patterns +

    +
    +
    +
    +
    + + + print-inst-full + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + print instantiations for formulas that do not have given identifiers +

    +
    +
    +
    +
    + + + purify-triggers + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + purify triggers, e.g. f( x+1 ) becomes f( y ), x mapsto y-1 +

    +
    +
    +
    +
    + + + quant-alpha-equiv + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + infer alpha equivalence between quantified formulas +

    +
    +
    +
    +
    + + + quant-dsplit + + + [ + + + none + + + | + + + default + + + | + + + agg + + + , default + + + default + + + ] +
    +
    +

    + mode for dynamic quantifiers splitting +

    +

    + Modes for quantifiers splitting. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Never split quantified formulas. +

    +
    +
    + + + default + + + + : + +
    +
    +

    + Split quantified formulas over some finite datatypes when finite model finding is enabled. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Aggressively split quantified formulas. +

    +
    +
    +
    +
    +
    +
    + + + quant-fun-wd + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + assume that function defined by quantifiers are well defined +

    +
    +
    +
    +
    + + + quant-ind + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use all available techniques for inductive reasoning +

    +
    +
    +
    +
    + + + quant-rep-mode + + + [ + + + ee + + + | + + + first + + + | + + + depth + + + , default + + + first + + + ] +
    +
    +

    + + [experts only] + +

    +

    + selection mode for representatives in quantifiers engine +

    +

    + Modes for quantifiers representative selection. +

    +
    +
    + + + ee + + + + : + +
    +
    +

    + Let equality engine choose representatives. +

    +
    +
    + + + first + + + + : + +
    +
    +

    + Choose terms that appear first. +

    +
    +
    + + + depth + + + + : + +
    +
    +

    + Choose terms that are of minimal depth. +

    +
    +
    +
    +
    +
    +
    + + + register-quant-body-terms + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + consider ground terms within bodies of quantified formulas for matching +

    +
    +
    +
    +
    + + + relational-triggers + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + choose relational triggers such as x = f(y), x >= f(y) +

    +
    +
    +
    +
    + + + relevant-triggers + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + prefer triggers that are more relevant based on SInE style analysis +

    +
    +
    +
    +
    + + + sygus + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + support SyGuS commands +

    +
    +
    +
    +
    + + + sygus-add-const-grammar + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + statically add constants appearing in conjecture to grammars +

    +
    +
    +
    +
    + + + sygus-arg-relevant + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + static inference techniques for computing whether arguments of functions-to-synthesize are relevant +

    +
    +
    +
    +
    + + + sygus-auto-unfold + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable approach which automatically unfolds transition systems for directly solving invariant synthesis problems +

    +
    +
    +
    +
    + + + sygus-bool-ite-return-const + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Only use Boolean constants for return values in unification-based function synthesis +

    +
    +
    +
    +
    + + + sygus-core-connective + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use unsat core analysis to construct Boolean connective to sygus conjectures +

    +
    +
    +
    +
    + + + sygus-crepair-abort + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + abort if constant repair techniques are not applicable +

    +
    +
    +
    +
    + + + sygus-enum + + + [ + + + smart + + + | + + + fast + + + | + + + random + + + | + + + var-agnostic + + + | + + + auto + + + , default + + + auto + + + ] +
    +
    +

    + mode for sygus enumeration +

    +

    + Modes for sygus enumeration. +

    +
    +
    + + + smart + + + + : + +
    +
    +

    + Use smart enumeration based on datatype constraints. +

    +
    +
    + + + fast + + + + : + +
    +
    +

    + Use optimized enumerator for sygus enumeration. +

    +
    +
    + + + random + + + + : + +
    +
    +

    + Use basic random enumerator for sygus enumeration. +

    +
    +
    + + + var-agnostic + + + + : + +
    +
    +

    + Use sygus solver to enumerate terms that are agnostic to variables. +

    +
    +
    + + + auto + + + + : + +
    +
    +

    + Internally decide the best policy for each enumerator. +

    +
    +
    +
    +
    +
    +
    + + + sygus-enum-fast-num-consts + + + [type + + + uint64_t + + + , default + + + 5 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the branching factor for the number of interpreted constants to consider for each size when using –sygus-enum=fast +

    +
    +
    +
    +
    + + + sygus-enum-random-p + + + [type + + + double + + + , + + + 0.0 + + + <= + + + P + + + <= + + + 1.0 + + + , default + + + 0.5 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the parameter of the geometric distribution used to determine the size of terms generated by –sygus-enum=random +

    +
    +
    +
    +
    + + + sygus-eval-unfold + + + [ + + + none + + + | + + + single + + + | + + + single-bool + + + | + + + multi + + + , default + + + single-bool + + + ] +
    +
    +

    + modes for sygus evaluation unfolding +

    +

    + Modes for sygus evaluation unfolding. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use sygus evaluation unfolding. +

    +
    +
    + + + single + + + + : + +
    +
    +

    + Do single-step unfolding for all evaluation functions. +

    +
    +
    + + + single-bool + + + + : + +
    +
    +

    + Do single-step unfolding for Boolean functions and ITEs, and multi-step unfolding for all others. +

    +
    +
    + + + multi + + + + : + +
    +
    +

    + Do multi-step unfolding for all evaluation functions. +

    +
    +
    +
    +
    +
    +
    + + + sygus-expr-miner-check-timeout + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + timeout (in milliseconds) for satisfiability checks in expression miners +

    +
    +
    +
    +
    + + + sygus-filter-sol + + + [ + + + none + + + | + + + strong + + + | + + + weak + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for filtering sygus solutions +

    +

    + Modes for filtering sygus solutions. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not filter sygus solutions. +

    +
    +
    + + + strong + + + + : + +
    +
    +

    + Filter solutions that are logically stronger than others. +

    +
    +
    + + + weak + + + + : + +
    +
    +

    + Filter solutions that are logically weaker than others. +

    +
    +
    +
    +
    +
    +
    + + + sygus-filter-sol-rev + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + compute backwards filtering to compute whether previous solutions are filtered based on later ones +

    +
    +
    +
    +
    + + + sygus-grammar-cons + + + [ + + + simple + + + | + + + any-const + + + | + + + any-term + + + | + + + any-term-concise + + + , default + + + simple + + + ] +
    +
    +

    + mode for SyGuS grammar construction +

    +

    + Modes for default SyGuS grammars. +

    +
    +
    + + + simple + + + + : + +
    +
    +

    + Use simple grammar construction (no symbolic terms or constants). +

    +
    +
    + + + any-const + + + + : + +
    +
    +

    + Use symoblic constant constructors. +

    +
    +
    + + + any-term + + + + : + +
    +
    +

    + When applicable, use constructors corresponding to any symbolic term. This option enables a sum-of-monomials grammar for arithmetic. For all other types, it enables symbolic constant constructors. +

    +
    +
    + + + any-term-concise + + + + : + +
    +
    +

    + When applicable, use constructors corresponding to any symbolic term, favoring conciseness over generality. This option is equivalent to any-term but enables a polynomial grammar for arithmetic when not in a combined theory. +

    +
    +
    +
    +
    +
    +
    + + + sygus-grammar-norm + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + statically normalize sygus grammars based on flattening (linearization) +

    +
    +
    +
    +
    + + + sygus-inference + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + attempt to preprocess arbitrary inputs to sygus conjectures +

    +
    +
    +
    +
    + + + sygus-inst + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + Enable SyGuS instantiation quantifiers module +

    +
    +
    +
    +
    + + + sygus-inst-mode + + + [ + + + priority-inst + + + | + + + priority-eval + + + | + + + interleave + + + , default + + + priority-inst + + + ] +
    +
    +

    + + [experts only] + +

    +

    + select instantiation lemma mode +

    +

    + SyGuS instantiation lemma modes. +

    +
    +
    + + + priority-inst + + + + : + +
    +
    +

    + add instantiation lemmas first, add evaluation unfolding if instantiation fails. +

    +
    +
    + + + priority-eval + + + + : + +
    +
    +

    + add evaluation unfolding lemma first, add instantiation lemma if unfolding lemmas already added. +

    +
    +
    + + + interleave + + + + : + +
    +
    +

    + add instantiation and evaluation unfolding lemmas in the same step. +

    +
    +
    +
    +
    +
    +
    + + + sygus-inst-scope + + + [ + + + in + + + | + + + out + + + | + + + both + + + , default + + + in + + + ] +
    +
    +

    + + [experts only] + +

    +

    + select scope of ground terms +

    +

    + scope for collecting ground terms for the grammar. +

    +
    +
    + + + in + + + + : + +
    +
    +

    + use ground terms inside given quantified formula only. +

    +
    +
    + + + out + + + + : + +
    +
    +

    + use ground terms outside of quantified formulas only. +

    +
    +
    + + + both + + + + : + +
    +
    +

    + combines inside and outside. +

    +
    +
    +
    +
    +
    +
    + + + sygus-inst-term-sel + + + [ + + + min + + + | + + + max + + + | + + + both + + + , default + + + min + + + ] +
    +
    +

    + + [experts only] + +

    +

    + granularity for ground terms +

    +

    + Ground term selection modes. +

    +
    +
    + + + min + + + + : + +
    +
    +

    + collect minimal ground terms only. +

    +
    +
    + + + max + + + + : + +
    +
    +

    + collect maximal ground terms only. +

    +
    +
    + + + both + + + + : + +
    +
    +

    + combines minimal and maximal . +

    +
    +
    +
    +
    +
    +
    + + + sygus-inv-templ + + + [ + + + none + + + | + + + pre + + + | + + + post + + + , default + + + post + + + ] +
    +
    +

    + template mode for sygus invariant synthesis (weaken pre-condition, strengthen post-condition, or none) +

    +

    + Template modes for sygus invariant synthesis. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Synthesize invariant directly. +

    +
    +
    + + + pre + + + + : + +
    +
    +

    + Synthesize invariant based on weakening of precondition. +

    +
    +
    + + + post + + + + : + +
    +
    +

    + Synthesize invariant based on strengthening of postcondition. +

    +
    +
    +
    +
    +
    +
    + + + sygus-inv-templ-when-sg + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use invariant templates (with solution reconstruction) for syntax guided problems +

    +
    +
    +
    +
    + + + sygus-min-grammar + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + statically minimize sygus grammars +

    +
    +
    +
    +
    + + + sygus-out + + + [ + + + status + + + | + + + status-and-def + + + | + + + sygus-standard + + + , default + + + sygus-standard + + + ] +
    +
    +

    + output mode for sygus +

    +

    + Modes for sygus solution output. +

    +
    +
    + + + status + + + + : + +
    +
    +

    + Print only status for check-synth calls. +

    +
    +
    + + + status-and-def + + + + : + +
    +
    +

    + Print status followed by definition corresponding to solution. +

    +
    +
    + + + sygus-standard + + + + : + +
    +
    +

    + Print based on SyGuS standard. +

    +
    +
    +
    +
    +
    +
    + + + sygus-pbe + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable approach which unifies conditional solutions, specialized for programming-by-examples (pbe) conjectures +

    +
    +
    +
    +
    + + + sygus-pbe-multi-fair + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + when using multiple enumerators, ensure that we only register value of minimial term size +

    +
    +
    +
    +
    + + + sygus-pbe-multi-fair-diff + + + [type + + + int64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + when using multiple enumerators, ensure that we only register values of minimial term size plus this value (default 0) +

    +
    +
    +
    +
    + + + sygus-qe-preproc + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use quantifier elimination as a preprocessing step for sygus +

    +
    +
    +
    +
    + + + sygus-query-gen + + + [ + + + none + + + | + + + basic + + + | + + + sample-sat + + + | + + + unsat + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for generating interesting satisfiability queries using SyGuS, for internal fuzzing +

    +

    + Modes for generating interesting satisfiability queries using SyGuS. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not generate queries with SyGuS. +

    +
    +
    + + + basic + + + + : + +
    +
    +

    + Generate all queries using SyGuS enumeration of the given grammar +

    +
    +
    + + + sample-sat + + + + : + +
    +
    +

    + Generate interesting SAT queries based on sampling, for e.g. soundness testing. +

    +
    +
    + + + unsat + + + + : + +
    +
    +

    + Generate interesting UNSAT queries, for e.g. proof testing. +

    +
    +
    +
    +
    +
    +
    + + + sygus-query-gen-dump-files + + + [ + + + none + + + | + + + all + + + | + + + unsolved + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for dumping external files corresponding to interesting satisfiability queries with sygus-query-gen +

    +

    + Query file options. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not dump query files when using –sygus-query-gen. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Dump all query files. +

    +
    +
    + + + unsolved + + + + : + +
    +
    +

    + Dump query files that the subsolver did not solve. +

    +
    +
    +
    +
    +
    +
    + + + sygus-query-gen-thresh + + + [type + + + uint64_t + + + , default + + + 5 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of points that we allow to be equal for enumerating satisfiable queries with sygus-query-gen +

    +
    +
    +
    +
    + + + sygus-rec-fun + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable efficient support for recursive functions in sygus grammars +

    +
    +
    +
    +
    + + + sygus-rec-fun-eval-limit + + + [type + + + uint64_t + + + , default + + + 1000 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + use a hard limit for how many times in a given evaluator call a recursive function can be evaluated (so infinite loops can be avoided) +

    +
    +
    +
    +
    + + + sygus-repair-const + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use approach to repair constants in sygus candidate solutions +

    +
    +
    +
    +
    + + + sygus-repair-const-timeout + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + timeout (in milliseconds) for the satisfiability check to repair constants in sygus candidate solutions +

    +
    +
    +
    +
    + + + sygus-rr-synth + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use sygus to enumerate candidate rewrite rules +

    +
    +
    +
    +
    + + + sygus-rr-synth-accel + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + add dynamic symmetry breaking clauses based on candidate rewrites +

    +
    +
    +
    +
    + + + sygus-rr-synth-check + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use satisfiability check to verify correctness of candidate rewrites +

    +
    +
    +
    +
    + + + sygus-rr-synth-filter-cong + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + filter candidate rewrites based on congruence +

    +
    +
    +
    +
    + + + sygus-rr-synth-filter-match + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + filter candidate rewrites based on matching +

    +
    +
    +
    +
    + + + sygus-rr-synth-filter-nl + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + filter non-linear candidate rewrites +

    +
    +
    +
    +
    + + + sygus-rr-synth-filter-order + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + filter candidate rewrites based on variable ordering +

    +
    +
    +
    +
    + + + sygus-rr-synth-input + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + synthesize rewrite rules based on the input formula +

    +
    +
    +
    +
    + + + sygus-rr-synth-input-nvars + + + [type + + + int64_t + + + , default + + + 3 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the maximum number of variables per type that appear in rewrites from sygus-rr-synth-input +

    +
    +
    +
    +
    + + + sygus-rr-synth-input-use-bool + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + synthesize Boolean rewrite rules based on the input formula +

    +
    +
    +
    +
    + + + sygus-rr-synth-rec + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + synthesize rewrite rules over all sygus grammar types recursively +

    +
    +
    +
    +
    + + + sygus-rr-verify + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use sygus to verify the correctness of rewrite rules via sampling +

    +
    +
    +
    +
    + + + sygus-sample-fp-uniform + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + sample floating-point values uniformly instead of in a biased fashion +

    +
    +
    +
    +
    + + + sygus-sample-grammar + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + when applicable, use grammar for choosing sample points +

    +
    +
    +
    +
    + + + sygus-samples + + + [type + + + int64_t + + + , default + + + 1000 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of points to consider when doing sygus rewriter sample testing +

    +
    +
    +
    +
    + + + sygus-si + + + [ + + + none + + + | + + + use + + + | + + + all + + + , default + + + none + + + ] +
    +
    +

    + mode for processing single invocation synthesis conjectures +

    +

    + Modes for single invocation techniques. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use single invocation techniques. +

    +
    +
    + + + use + + + + : + +
    +
    +

    + Use single invocation techniques only if grammar is not restrictive. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Always use single invocation techniques. +

    +
    +
    +
    +
    +
    +
    + + + sygus-si-abort + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + abort if synthesis conjecture is not single invocation +

    +
    +
    +
    +
    + + + sygus-si-rcons + + + [ + + + none + + + | + + + try + + + | + + + all-limit + + + | + + + all + + + , default + + + all + + + ] +
    +
    +

    + policy for reconstructing solutions for single invocation conjectures +

    +

    + Modes for reconstruction solutions while using single invocation techniques. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not try to reconstruct solutions in the original (user-provided) grammar when using single invocation techniques. In this mode, solutions produced by cvc5 may violate grammar restrictions. +

    +
    +
    + + + try + + + + : + +
    +
    +

    + Try to reconstruct solutions in the original grammar when using single invocation techniques in an incomplete (fail-fast) manner. +

    +
    +
    + + + all-limit + + + + : + +
    +
    +

    + Try to reconstruct solutions in the original grammar, but terminate if a maximum number of rounds for reconstruction is exceeded. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Try to reconstruct solutions in the original grammar. In this mode, we do not terminate until a solution is successfully reconstructed. +

    +
    +
    +
    +
    +
    +
    + + + sygus-si-rcons-limit + + + [type + + + int64_t + + + , default + + + 10000 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + number of rounds of enumeration to use during solution reconstruction (negative means unlimited) +

    +
    +
    +
    +
    + + + sygus-stream + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enumerate a stream of solutions instead of terminating after the first one +

    +
    +
    +
    +
    + + + sygus-unif-cond-independent-no-repeat-sol + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Do not try repeated solutions when using independent synthesis of conditions in unification-based function synthesis +

    +
    +
    +
    +
    + + + sygus-unif-pi + + + [ + + + none + + + | + + + complete + + + | + + + cond-enum + + + | + + + cond-enum-igain + + + , default + + + none + + + ] +
    +
    +

    + mode for synthesis via piecewise-indepedent unification +

    +

    + Modes for piecewise-independent unification. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use piecewise-independent unification. +

    +
    +
    + + + complete + + + + : + +
    +
    +

    + Use complete approach for piecewise-independent unification (see Section 3 of Barbosa et al FMCAD 2019) +

    +
    +
    + + + cond-enum + + + + : + +
    +
    +

    + Use unconstrained condition enumeration for piecewise-independent unification (see Section 4 of Barbosa et al FMCAD 2019). +

    +
    +
    + + + cond-enum-igain + + + + : + +
    +
    +

    + Same as cond-enum, but additionally uses an information gain heuristic when doing decision tree learning. +

    +
    +
    +
    +
    +
    +
    + + + sygus-unif-shuffle-cond + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Shuffle condition pool when building solutions (may change solutions sizes) +

    +
    +
    +
    +
    + + + sygus-verify-inst-max-rounds + + + [type + + + int64_t + + + , default + + + 3 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + maximum number of instantiation rounds for sygus verification calls (-1 == no limit, default is 3) +

    +
    +
    +
    +
    + + + sygus-verify-timeout + + + [type + + + uint64_t + + + , default + + + 0 + + + ] +
    +
    +

    + timeout (in milliseconds) for verifying satisfiability of synthesized terms +

    +
    +
    +
    +
    + + + term-db-cd + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + register terms in term database based on the SAT context +

    +
    +
    +
    +
    + + + term-db-mode + + + [ + + + all + + + | + + + relevant + + + , default + + + all + + + ] +
    +
    +

    + which ground terms to consider for instantiation +

    +

    + Modes for terms included in the quantifiers term database. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Quantifiers module considers all ground terms. +

    +
    +
    + + + relevant + + + + : + +
    +
    +

    + Quantifiers module considers only ground terms connected to current assertions. +

    +
    +
    +
    +
    +
    +
    + + + trigger-active-sel + + + [ + + + all + + + | + + + min + + + | + + + max + + + , default + + + all + + + ] +
    +
    +

    + + [experts only] + +

    +

    + selection mode to activate triggers +

    +

    + Trigger active selection modes. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Make all triggers active. +

    +
    +
    + + + min + + + + : + +
    +
    +

    + Activate triggers with minimal ground terms. +

    +
    +
    + + + max + + + + : + +
    +
    +

    + Activate triggers with maximal ground terms. +

    +
    +
    +
    +
    +
    +
    + + + trigger-sel + + + [ + + + min + + + | + + + max + + + | + + + min-s-max + + + | + + + min-s-all + + + | + + + all + + + , default + + + min + + + ] +
    +
    +

    + selection mode for triggers +

    +

    + Trigger selection modes. +

    +
    +
    + + + min + + + + : + +
    +
    +

    + Consider only minimal subterms that meet criteria for triggers. +

    +
    +
    + + + max + + + + : + +
    +
    +

    + Consider only maximal subterms that meet criteria for triggers. +

    +
    +
    + + + min-s-max + + + + : + +
    +
    +

    + Consider only minimal subterms that meet criteria for single triggers, maximal otherwise. +

    +
    +
    + + + min-s-all + + + + : + +
    +
    +

    + Consider only minimal subterms that meet criteria for single triggers, all otherwise. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Consider all subterms that meet criteria for triggers. +

    +
    +
    +
    +
    +
    +
    + + + user-pat + + + [ + + + use + + + | + + + trust + + + | + + + strict + + + | + + + resort + + + | + + + ignore + + + | + + + interleave + + + , default + + + trust + + + ] +
    +
    +

    + policy for handling user-provided patterns for quantifier instantiation +

    +

    + These modes determine how user provided patterns (triggers) are used during E-matching. The modes vary on when instantiation based on user-provided triggers is combined with instantiation based on automatically selected triggers. +

    +
    +
    + + + use + + + + : + +
    +
    +

    + Use both user-provided and auto-generated patterns when patterns are provided for a quantified formula. +

    +
    +
    + + + trust + + + + : + +
    +
    +

    + When provided, use only user-provided patterns for a quantified formula. +

    +
    +
    + + + strict + + + + : + +
    +
    +

    + When provided, use only user-provided patterns for a quantified formula, and do not use any other instantiation techniques. +

    +
    +
    + + + resort + + + + : + +
    +
    +

    + Use user-provided patterns only after auto-generated patterns saturate. +

    +
    +
    + + + ignore + + + + : + +
    +
    +

    + Ignore user-provided patterns. +

    +
    +
    + + + interleave + + + + : + +
    +
    +

    + Alternate between use/resort. +

    +
    +
    +
    +
    +
    +
    + + + var-elim-quant + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable simple variable elimination for quantified formulas +

    +
    +
    +
    +
    + + + var-ineq-elim-quant + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable variable elimination based on infinite projection of unbound arithmetic variables +

    +
    +
    +
    +
    +

    + Separation Logic Theory Module + + ¶ + +

    +
    +
    + + + sep-min-refine + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + only add refinement lemmas for minimal (innermost) assertions +

    +
    +
    +
    +
    + + + sep-pre-skolem-emp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + eliminate emp constraint at preprocess time +

    +
    +
    +
    +
    +

    + Sets Theory Module + + ¶ + +

    +
    +
    + + + sets-ext + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable extended symbols such as complement and universe in theory of sets +

    +
    +
    +
    +
    + + + sets-infer-as-lemmas + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + send inferences as lemmas +

    +
    +
    +
    +
    + + + sets-proxy-lemmas + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + introduce proxy variables eagerly to shorten lemmas +

    +
    +
    +
    +
    +

    + SMT Layer Module + + ¶ + +

    +
    +
    + + + abstract-values + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + in models, output arrays (and in future, maybe others) using abstract values, as required by the SMT-LIB standard +

    +
    +
    +
    +
    + + + ackermann + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + eliminate functions by ackermannization +

    +
    +
    +
    +
    + + + bvand-integer-granularity + + + [type + + + uint64_t + + + , default + + + 1 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + granularity to use in –solve-bv-as-int mode and for iand operator (experimental) +

    +
    +
    +
    +
    + + + check-abducts + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + checks whether produced solutions to get-abduct are correct +

    +
    +
    +
    +
    + + + check-interpolants + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + checks whether produced solutions to get-interpolant are correct +

    +
    +
    +
    +
    + + + check-proofs + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + after UNSAT/VALID, check the generated proof (with proof) +

    +
    +
    +
    +
    + + + check-synth-sol + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + checks whether produced solutions to functions-to-synthesize satisfy the conjecture +

    +
    +
    +
    +
    + + + check-unsat-cores + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + after UNSAT/VALID, produce and check an unsat core (expensive) +

    +
    +
    +
    +
    + + + debug-check-models + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + after SAT/INVALID/UNKNOWN, check that the generated model satisfies user and internal assertions +

    +
    +
    +
    +
    + + + deep-restart + + + [ + + + none + + + | + + + input + + + | + + + input-and-solvable + + + | + + + input-and-prop + + + | + + + all + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for deep restarts +

    +

    + Mode for deep restarts +

    +
    +
    + + + none + + + + : + +
    +
    +

    + do not use deep restart +

    +
    +
    + + + input + + + + : + +
    +
    +

    + learn literals that appear in the input +

    +
    +
    + + + input-and-solvable + + + + : + +
    +
    +

    + learn literals that appear in the input and those that can be solved for variables that appear in the input +

    +
    +
    + + + input-and-prop + + + + : + +
    +
    +

    + learn literals that appear in the input and those that can be solved for variables, or correspond to constant propagations for terms that appear in the input +

    +
    +
    + + + all + + + + : + +
    +
    +

    + learn all literals +

    +
    +
    +
    +
    +
    +
    + + + deep-restart-factor + + + [type + + + double + + + , + + + 0.0 + + + <= + + + F + + + <= + + + 1000.0 + + + , default + + + 3.0 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + sets the threshold for average assertions per literal before a deep restart +

    +
    +
    +
    +
    + + + difficulty-mode + + + [ + + + lemma-literal + + + | + + + lemma-literal-all + + + | + + + model-check + + + , default + + + lemma-literal + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose output mode for get-difficulty, see –difficulty-mode=help +

    +

    + difficulty output modes. +

    +
    +
    + + + lemma-literal + + + + : + +
    +
    +

    + Difficulty of an assertion is how many lemmas (at full effort) use a literal that the assertion depends on to be satisfied. +

    +
    +
    + + + lemma-literal-all + + + + : + +
    +
    +

    + Difficulty of an assertion is how many lemmas use a literal that the assertion depends on to be satisfied. +

    +
    +
    + + + model-check + + + + : + +
    +
    +

    + Difficulty of an assertion is how many times it was not satisfied in a candidate model. +

    +
    +
    +
    +
    +
    +
    + + + early-ite-removal + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + remove ITEs early in preprocessing +

    +
    +
    +
    +
    + + + ext-rew-prep + + + [ + + + off + + + | + + + use + + + | + + + agg + + + , default + + + off + + + ] +
    +
    +

    + mode for using extended rewriter as a preprocessing pass, see –ext-rew-prep=help +

    +

    + extended rewriter preprocessing pass modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + do not use extended rewriter as a preprocessing pass. +

    +
    +
    + + + use + + + + : + +
    +
    +

    + use extended rewriter as a preprocessing pass. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + use aggressive extended rewriter as a preprocessing pass. +

    +
    +
    +
    +
    +
    +
    + + + foreign-theory-rewrite + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + Cross-theory rewrites +

    +
    +
    +
    +
    + + + iand-mode + + + [ + + + value + + + | + + + sum + + + | + + + bitwise + + + , default + + + value + + + ] +
    +
    +

    + + [experts only] + +

    +

    + Set the refinement scheme for integer AND +

    +

    + Refinement modes for integer AND +

    +
    +
    + + + value + + + + : + +
    +
    +

    + value-based refinement +

    +
    +
    + + + sum + + + + : + +
    +
    +

    + use sum to represent integer AND in refinement +

    +
    +
    + + + bitwise + + + + : + +
    +
    +

    + use bitwise comparisons on binary representation of integer for refinement (experimental) +

    +
    +
    +
    +
    +
    +
    + + + interpolants-mode + + + [ + + + default + + + | + + + assumptions + + + | + + + conjecture + + + | + + + shared + + + | + + + all + + + , default + + + default + + + ] +
    +
    +

    + choose interpolants production mode, see –interpolants-mode=help +

    +

    + Interpolants grammar mode +

    +
    +
    + + + default + + + + : + +
    +
    +

    + use the default grammar for the theory or the user-defined grammar if given +

    +
    +
    + + + assumptions + + + + : + +
    +
    +

    + use only operators that occur in the assumptions +

    +
    +
    + + + conjecture + + + + : + +
    +
    +

    + use only operators that occur in the conjecture +

    +
    +
    + + + shared + + + + : + +
    +
    +

    + use only operators that occur both in the assumptions and the conjecture +

    +
    +
    + + + all + + + + : + +
    +
    +

    + use only operators that occur either in the assumptions or the conjecture +

    +
    +
    +
    +
    +
    +
    + + + ite-simp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + turn on ite simplification (Kim (and Somenzi) et al., SAT 2009) +

    +
    +
    +
    +
    + + + learned-rewrite + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + rewrite the input based on learned literals +

    +
    +
    +
    +
    + + + minimal-unsat-cores + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + if an unsat core is produced, it is reduced to a minimal unsat core +

    +
    +
    +
    +
    + + + model-cores + + + [ + + + none + + + | + + + simple + + + | + + + non-implied + + + , default + + + none + + + ] +
    +
    +

    + mode for producing model cores +

    +

    + Model cores modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not compute model cores. +

    +
    +
    + + + simple + + + + : + +
    +
    +

    + Only include a subset of variables whose values are sufficient to show the input formula is satisfied by the given model. +

    +
    +
    + + + non-implied + + + + : + +
    +
    +

    + Only include a subset of variables whose values, in addition to the values of variables whose values are implied, are sufficient to show the input formula is satisfied by the given model. +

    +
    +
    +
    +
    +
    +
    + + + model-var-elim-uneval + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + allow variable elimination based on unevaluatable terms to variables +

    +
    +
    +
    +
    + + + on-repeat-ite-simp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do the ite simplification pass again if repeating simplification +

    +
    +
    +
    +
    + + + print-unsat-cores-full + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + when printing unsat cores, include unlabeled assertions +

    +
    +
    +
    +
    + + + produce-abducts + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + support the get-abduct command +

    +
    +
    +
    +
    + + + produce-assertions + + + | + + + interactive-mode + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + keep an assertions list. Note this option is always enabled. +

    +
    +
    +
    +
    + + + produce-assignments + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + support the get-assignment command +

    +
    +
    +
    +
    + + + produce-difficulty + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + enable tracking of difficulty. +

    +
    +
    +
    +
    + + + produce-interpolants + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turn on interpolation generation. +

    +
    +
    +
    +
    + + + produce-learned-literals + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + produce learned literals, support get-learned-literals +

    +
    +
    +
    +
    + + + produce-proofs + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + produce proofs, support check-proofs and get-proof +

    +
    +
    +
    +
    + + + produce-unsat-assumptions + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turn on unsat assumptions generation +

    +
    +
    +
    +
    + + + produce-unsat-cores + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turn on unsat core generation. Unless otherwise specified, cores will be produced using SAT soving under assumptions and preprocessing proofs. +

    +
    +
    +
    +
    + + + proof-mode + + + [ + + + off + + + | + + + pp-only + + + | + + + sat-proof + + + | + + + full-proof + + + , default + + + off + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose proof mode, see –proof-mode=help +

    +

    + proof modes. +

    +
    +
    +
    +
    + + + repeat-simp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + make multiple passes with nonclausal simplifier +

    +
    +
    +
    +
    + + + simp-ite-compress + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enables compressing ites after ite simplification +

    +
    +
    +
    +
    + + + simp-with-care + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enables simplifyWithCare in ite simplificiation +

    +
    +
    +
    +
    + + + simplification + + + | + + + simplification-mode + + + [ + + + none + + + | + + + batch + + + , default + + + batch + + + ] +
    +
    +

    + choose simplification mode, see –simplification=help +

    +

    + Simplification modes. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not perform nonclausal simplification. +

    +
    +
    + + + batch + + + + : + +
    +
    +

    + Save up all ASSERTions; run nonclausal simplification and clausal (MiniSat) propagation for all of them only after reaching a querying command (CHECKSAT or QUERY or predicate SUBTYPE declaration). +

    +
    +
    +
    +
    +
    +
    + + + simplification-bcp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply Boolean constant propagation as a substituion during simplification +

    +
    +
    +
    +
    + + + solve-bv-as-int + + + [ + + + off + + + | + + + sum + + + | + + + iand + + + | + + + bv + + + | + + + bitwise + + + , default + + + off + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for translating BVAnd to integer +

    +

    + solve-bv-as-int modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not translate bit-vectors to integers +

    +
    +
    + + + sum + + + + : + +
    +
    +

    + Generate a sum expression for each bvand instance, based on the value in –solve-bv-as-int-granularity +

    +
    +
    + + + iand + + + + : + +
    +
    +

    + Translate bvand to the iand operator (experimental) +

    +
    +
    + + + bv + + + + : + +
    +
    +

    + Translate bvand back to bit-vectors +

    +
    +
    + + + bitwise + + + + : + +
    +
    +

    + Introduce a UF operator for bvand, and eagerly add bitwise lemmas +

    +
    +
    +
    +
    +
    +
    + + + solve-int-as-bv + + + [type + + + uint64_t + + + , + + + N + + + <= + + + 4294967295 + + + , default + + + 0 + + + ] +
    +
    +

    + attempt to solve a pure integer satisfiable problem by bitblasting in sufficient bitwidth (experimental) +

    +
    +
    +
    +
    + + + solve-real-as-int + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + attempt to solve a pure real satisfiable problem as an integer problem (for non-linear) +

    +
    +
    +
    +
    + + + sort-inference + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + calculate sort inference of input problem, convert the input based on monotonic sorts +

    +
    +
    +
    +
    + + + static-learning + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use static learning (on by default) +

    +
    +
    +
    +
    + + + unconstrained-simp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + turn on unconstrained simplification (see Bruttomesso/Brummayer PhD thesis). Fully supported only in (subsets of) the logic QF_ABV. +

    +
    +
    +
    +
    + + + unsat-cores-mode + + + [ + + + off + + + | + + + sat-proof + + + | + + + assumptions + + + , default + + + off + + + ] +
    +
    +

    + + [experts only] + +

    +

    + choose unsat core mode, see –unsat-cores-mode=help +

    +

    + unsat cores modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not produce unsat cores. +

    +
    +
    + + + sat-proof + + + + : + +
    +
    +

    + Produce unsat cores from the SAT proof and prepocessing proofs. +

    +
    +
    + + + assumptions + + + + : + +
    +
    +

    + Produce unsat cores using solving under assumptions and preprocessing proofs. +

    +
    +
    +
    +
    +
    +
    +

    + Strings Theory Module + + ¶ + +

    +
    +
    + + + re-elim + + + [ + + + off + + + | + + + on + + + | + + + agg + + + , default + + + off + + + ] +
    +
    +

    + regular expression elimination mode +

    +

    + Regular expression elimination modes. +

    +
    +
    + + + off + + + + : + +
    +
    +

    + Do not use regular expression elimination. +

    +
    +
    + + + on + + + + : + +
    +
    +

    + Use regular expression elimination. +

    +
    +
    + + + agg + + + + : + +
    +
    +

    + Use aggressive regular expression elimination. +

    +
    +
    +
    +
    +
    +
    + + + re-inter-mode + + + [ + + + all + + + | + + + constant + + + | + + + one-constant + + + | + + + none + + + , default + + + constant + + + ] +
    +
    +

    + determines which regular expressions intersections to compute +

    +

    + Regular expression intersection modes. +

    +
    +
    + + + all + + + + : + +
    +
    +

    + Compute intersections for all regular expressions. +

    +
    +
    + + + constant + + + + : + +
    +
    +

    + Compute intersections only between regular expressions that do not contain re.allchar or re.range. +

    +
    +
    + + + one-constant + + + + : + +
    +
    +

    + Compute intersections only between regular expressions such that at least one side does not contain re.allchar or re.range. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not compute intersections for regular expressions. +

    +
    +
    +
    +
    +
    +
    + + + seq-array + + + [ + + + lazy + + + | + + + eager + + + | + + + none + + + , default + + + none + + + ] +
    +
    +

    + + [experts only] + +

    +

    + use array-inspired solver for sequence updates in eager or lazy mode +

    +

    + use array-inspired solver for sequence updates in eager or lazy mode +

    +
    +
    + + + lazy + + + + : + +
    +
    +

    + use array-inspired solver for sequence updates in lazy mode +

    +
    +
    + + + eager + + + + : + +
    +
    +

    + use array-inspired solver for sequence updates in eager mode +

    +
    +
    + + + none + + + + : + +
    +
    +

    + do not use array-inspired solver for sequence updates +

    +
    +
    +
    +
    +
    +
    + + + strings-alpha-card + + + [type + + + uint64_t + + + , + + + N + + + <= + + + 196608 + + + , default + + + 196608 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + the assumed cardinality of the alphabet of characters for strings, which is a prefix of the interval of unicode code points in the SMT-LIB standard +

    +
    +
    +
    +
    + + + strings-check-entail-len + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + check entailment between length terms to reduce splitting +

    +
    +
    +
    +
    + + + strings-code-elim + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + eliminate code points during preprocessing +

    +
    +
    +
    +
    + + + strings-deq-ext + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use extensionality for string disequalities +

    +
    +
    +
    +
    + + + strings-eager + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + strings eager check +

    +
    +
    +
    +
    + + + strings-eager-eval + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + perform eager context-dependent evaluation for applications of string kinds +

    +
    +
    +
    +
    + + + strings-eager-len + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + strings eager length lemmas +

    +
    +
    +
    +
    + + + strings-eager-len-re + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use regular expressions for eager length conflicts +

    +
    +
    +
    +
    + + + strings-eager-solver + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use the eager solver +

    +
    +
    +
    +
    + + + strings-exp + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + experimental features in the theory of strings +

    +
    +
    +
    +
    + + + strings-ff + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + do flat form inferences +

    +
    +
    +
    +
    + + + strings-fmf + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + the finite model finding used by the theory of strings +

    +
    +
    +
    +
    + + + strings-infer-as-lemmas + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + always send lemmas out instead of making internal inferences +

    +
    +
    +
    +
    + + + strings-infer-sym + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + generalized inferences in strings based on proxy symbols +

    +
    +
    +
    +
    + + + strings-lazy-pp + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + perform string preprocessing lazily +

    +
    +
    +
    +
    + + + strings-len-norm + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + strings length normalization lemma +

    +
    +
    +
    +
    + + + strings-mbr + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use models to avoid reductions for extended functions that introduce quantified formulas +

    +
    +
    +
    +
    + + + strings-model-max-len + + + [type + + + uint64_t + + + , default + + + 65536 + + + ] +
    +
    +

    + + [experts only] + +

    +

    + The maximum size of string values in models +

    +
    +
    +
    +
    + + + strings-process-loop-mode + + + [ + + + full + + + | + + + simple + + + | + + + simple-abort + + + | + + + none + + + | + + + abort + + + , default + + + full + + + ] +
    +
    +

    + determines how to process looping string equations +

    +

    + Loop processing modes. +

    +
    +
    + + + full + + + + : + +
    +
    +

    + Perform full processing of looping word equations. +

    +
    +
    + + + simple + + + + : + +
    +
    +

    + Omit normal loop breaking (default with –strings-fmf). +

    +
    +
    + + + simple-abort + + + + : + +
    +
    +

    + Abort when normal loop breaking is required. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Omit loop processing. +

    +
    +
    + + + abort + + + + : + +
    +
    +

    + Abort if looping word equations are encountered. +

    +
    +
    +
    +
    +
    +
    + + + strings-regexp-inclusion + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use regular expression inclusion for finding conflicts and avoiding regular expression unfolding +

    +
    +
    +
    +
    + + + strings-rexplain-lemmas + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + regression explanations for string lemmas +

    +
    +
    +
    +
    +

    + Theory Layer Module + + ¶ + +

    +
    +
    + + + assign-function-values + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + assign values for uninterpreted functions in models +

    +
    +
    +
    +
    + + + condense-function-values + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + condense values for functions in models rather than explicitly representing them +

    +
    +
    +
    +
    + + + ee-mode + + + [ + + + distributed + + + | + + + central + + + , default + + + distributed + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for managing equalities across theory solvers +

    +

    + Defines mode for managing equalities across theory solvers. +

    +
    +
    + + + distributed + + + + : + +
    +
    +

    + Each theory maintains its own equality engine. +

    +
    +
    + + + central + + + + : + +
    +
    +

    + All applicable theories use the central equality engine. +

    +
    +
    +
    +
    +
    +
    + + + relevance-filter + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + enable analysis of relevance of asserted literals with respect to the input formula +

    +
    +
    +
    +
    + + + tc-mode + + + [ + + + care-graph + + + , default + + + care-graph + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for theory combination +

    +

    + Defines mode for theory combination. +

    +
    +
    + + + care-graph + + + + : + +
    +
    +

    + Use care graphs for theory combination. +

    +
    +
    +
    +
    +
    +
    + + + theoryof-mode + + + [ + + + type + + + | + + + term + + + , default + + + type + + + ] +
    +
    +

    + + [experts only] + +

    +

    + mode for Theory::theoryof() +

    +

    + Defines how we associate theories with terms. +

    +
    +
    + + + type + + + + : + +
    +
    +

    + Type variables, constants and equalities by type. +

    +
    +
    + + + term + + + + : + +
    +
    +

    + Type variables as uninterpreted, type constants by theory, equalities by the parametric theory. +

    +
    +
    +
    +
    +
    +
    +

    + Uninterpreted Functions Theory Module + + ¶ + +

    +
    +
    + + + symmetry-breaker + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + use UF symmetry breaker (Deharbe et al., CADE 2011) +

    +
    +
    +
    +
    + + + uf-ho-ext + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + apply extensionality on function symbols +

    +
    +
    +
    +
    + + + uf-lazy-ll + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + do lambda lifting lazily +

    +
    +
    +
    +
    + + + uf-ss + + + [ + + + full + + + | + + + no-minimal + + + | + + + none + + + , default + + + full + + + ] +
    +
    +

    + mode of operation for uf with cardinality solver. +

    +

    + UF with cardinality options currently supported by the –uf-ss option when combined with finite model finding. +

    +
    +
    + + + full + + + + : + +
    +
    +

    + Default, use UF with cardinality to find minimal models for uninterpreted sorts. +

    +
    +
    + + + no-minimal + + + + : + +
    +
    +

    + Use UF with cardinality to shrink models, but do no enforce minimality. +

    +
    +
    + + + none + + + + : + +
    +
    +

    + Do not use UF with cardinality to shrink model sizes. +

    +
    +
    +
    +
    +
    +
    + + + uf-ss-abort-card + + + [type + + + int64_t + + + , default + + + -1 + + + ] +
    +
    +

    + tells the uf with cardinality to only consider models that interpret uninterpreted sorts of cardinality at most N (-1 == no limit, default) +

    +
    +
    +
    +
    + + + uf-ss-fair + + + [type + + + bool + + + , default + + + true + + + ] (also + + + --no-* + + + ) +
    +
    +

    + use fair strategy for finite model finding multiple sorts +

    +
    +
    +
    +
    + + + uf-ss-fair-monotone + + + [type + + + bool + + + , default + + + false + + + ] (also + + + --no-* + + + ) +
    +
    +

    + + [experts only] + +

    +

    + group monotone sorts when enforcing fairness for finite model finding +

    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/output-tags.html b/cvc5-1.0.2/output-tags.html new file mode 100644 index 0000000..351e295 --- /dev/null +++ b/cvc5-1.0.2/output-tags.html @@ -0,0 +1,622 @@ + + + + + + + + Output tags — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Output tags +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Output tags + + ¶ + +

    +

    + cvc5 supports printing information about certain aspects of the solving process +that is intended for regular users. This feature can be enabled using the + + + output + + + option. +

    +

    + The following output tags are currently supported: +

    +
    +

    + inst + + ¶ + +

    +

    + With + + + -o + + + inst + + + , cvc5 prints information about quantifier instantions for individual quantifers. +

    +
    +
    +
    $ bin/cvc5 -o inst ../test/regress/cli/regress1/quantifiers/qid-debug-inst.smt2
    +(num-instantiations myQuant1 1)
    +(num-instantiations myQuant2 1)
    +unsat
    +
    +
    +
    +
    +
    +

    + sygus + + ¶ + +

    +

    + With + + + -o + + + sygus + + + , cvc5 prints information about the internal SyGuS solver including enumerated terms and generated candidates. +

    +
    +
    +
    $ bin/cvc5 -o sygus ../test/regress/cli/regress0/sygus/print-debug.sy
    +(sygus-enum 0)
    +(sygus-candidate (f 0))
    +(sygus-enum 1)
    +(sygus-candidate (f 1))
    +(
    +(define-fun f () Int 1)
    +)
    +
    +
    +
    +
    +
    +

    + sygus-grammar + + ¶ + +

    +

    + With + + + -o + + + sygus-grammar + + + , cvc5 prints the grammar it generates for a function-to-synthesize when no grammar was provided. +

    +
    +
    +
    $ bin/cvc5 -o sygus-grammar ../test/regress/cli/regress0/sygus/print-grammar.sy
    +(sygus-grammar f
    +((f_Int Int) (f_Bool Bool) )
    +((f_Int Int ((Constant Int) x y 0 1 (+ f_Int f_Int) (- f_Int f_Int) (ite f_Bool f_Int f_Int) ))
    +(f_Bool Bool ((Constant Bool) true false (= f_Int f_Int) (<= f_Int f_Int) (not f_Bool) (and f_Bool f_Bool) (or f_Bool f_Bool) ))
    +))
    +(
    +(define-fun f ((x Int) (y Int)) Int 0)
    +)
    +
    +
    +
    +
    +
    +

    + trigger + + ¶ + +

    +

    + With + + + -o + + + trigger + + + , cvc5 prints the selected triggers when solving a quantified formula. +

    +
    +
    +
    $ bin/cvc5 -o trigger ../test/regress/cli/regress1/quantifiers/qid-debug-inst.smt2
    +(trigger myQuant1 ((not (= (R x) false))))
    +(trigger myQuant1 ((not (= (P x) true))))
    +(trigger myQuant2 ((not (= (P x) false))))
    +(trigger myQuant2 ((not (= (Q x) true))))
    +unsat
    +
    +
    +
    +
    +
    +

    + raw-benchmark + + ¶ + +

    +

    + With + + + -o + + + raw-benchmark + + + , cvc5 prints the benchmark back just as it has been parsed. +

    +
    +
    +
    $ bin/cvc5 -o raw-benchmark ../test/regress/cli/regress0/datatypes/datatype-dump.cvc.smt2
    +(set-logic ALL)
    +(declare-datatypes ((nat 0)) (((succ (pred nat)) (zero))))
    +(declare-fun x () nat)
    +(check-sat-assuming ( (not (and (not ((_ is succ) x)) (not ((_ is zero) x)))) ))
    +sat
    +
    +
    +
    +
    +
    +

    + learned-lits + + ¶ + +

    +

    + With + + + -o + + + learned-lits + + + , cvc5 prints input literals that it has learned to hold globally. +

    +
    +
    +
    $ bin/cvc5 -o learned-lits ../test/regress/cli/regress0/printer/learned-lit-output.smt2
    +(learned-lit (>= x 11) :preprocess)
    +(learned-lit (>= x 5))
    +(learned-lit (>= y 1))
    +sat
    +
    +
    +
    +
    +
    +

    + subs + + ¶ + +

    +

    + With + + + -o + + + subs + + + , cvc5 prints top-level substitutions learned during preprocessing. +

    +
    +
    +
    $ bin/cvc5 -o subs ../test/regress/cli/regress0/printer/print_subs.smt2
    +(substitution (= a 3))
    +sat
    +
    +
    +
    +
    +
    +

    + post-asserts + + ¶ + +

    +

    + With + + + -o + + + post-asserts + + + , cvc5 prints a benchmark corresponding to the assertions of the input problem after preprocessing. +

    +
    +
    +
    $ bin/cvc5 -o post-asserts ../test/regress/cli/regress0/printer/post-asserts-output.smt2
    +;; post-asserts start
    +(set-logic ALL)
    +(assert true)
    +(assert true)
    +(check-sat)
    +;; post-asserts end
    +sat
    +
    +
    +
    +
    +
    +

    + pre-asserts + + ¶ + +

    +

    + With + + + -o + + + pre-asserts + + + , cvc5 prints a benchmark corresponding to the assertions of the input problem before preprocessing. +

    +
    +
    +

    + deep-restart + + ¶ + +

    +

    + With + + + -o + + + deep-restart + + + , cvc5 prints when it performs a deep restart along with the literals it has learned. +

    +
    +
    +
    $ bin/cvc5 -o deep-restart ../test/regress/cli/regress0/printer/deep-restart-output.smt2
    +sat
    +
    +
    +
    +
    +
    +

    + incomplete + + ¶ + +

    +

    + With + + + -o + + + incomplete + + + , cvc5 prints reason for why it answers unknown for any given check-sat query. +

    +
    +
    +
    $ bin/cvc5 -o incomplete ../test/regress/cli/regress0/printer/incomplete.smt2
    +(incomplete INCOMPLETE QUANTIFIERS)
    +unknown
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/proofs/output_alethe.html b/cvc5-1.0.2/proofs/output_alethe.html new file mode 100644 index 0000000..c33f68b --- /dev/null +++ b/cvc5-1.0.2/proofs/output_alethe.html @@ -0,0 +1,380 @@ + + + + + + + + Proof format: Alethe — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Proof format: Alethe + + ¶ + +

    +

    + Using the flag + + + proof-format-mode=alethe + + + , +cvc5 outputs proofs in the + + Alethe proof format + + . Additonally, the +following additional flags are currently required: + + + simplification=none + + + , + + + dag-thresh=0 + + + , + + + proof-granularity=theory-rewrite + + + . These requirements are due to not yet +supporting printing proofs with term sharing and proofs with non-detailed steps. +

    +

    + The Alethe proof format is a flexible proof format for SMT solvers based on +SMT-LIB. It includes both coarse- and fine-grained steps and was first +implemented in the veriT solver + + [ + + BdODeharbeF09 + + ] + + . Alethe proofs can be +checked via reconstruction within Isabelle/HOL + + [ + + BBFF20 + + , + + SFD21 + + ] + + as well as within Coq, the latter via the SMTCoq plugin + + [ + + AFGregoire+11 + + , + + EMT+17 + + ] + + . There is also a high performance Rust proof checker for Alethe, +available + + here + + . +

    +

    + Currently, only the theory of equality with uninterpreted functions, parts of +the theory of arithmetic and parts of the theory of quantifiers are supported in +cvc5’s Alethe proofs. +

    +

    + A simple example of cvc5 producing a proof in the Alethe proof format: +

    +
    +
    +
    $ bin/cvc5 --dump-proofs --proof-format-mode=alethe --simplification=none --dag-thresh=0 --proof-granularity=theory-rewrite ../test/regress/cli/regress0/proofs/qgu-fuzz-1-bool-sat.smt2
    +unsat
    +(assume a0 (and (or d b) (= c d) (not (ite d c false)) (= (or b d) (= b d))))
    +(step t1 (cl (not (= (and (or d b) (= c d) (not (ite d c false)) (= (or b d) (= b d))) (and (or d b) (= c d) (not (and d c)) (= (or b d) (= b d))))) (not (and (or d b) (= c d) (not (ite d c false)) (= (or b d) (= b d)))) (and (or d b) (= c d) (not (and d c)) (= (or b d) (= b d)))) :rule equiv_pos2)
    +(step t2 (cl (= (or d b) (or d b))) :rule refl)
    +(step t3 (cl (= (= c d) (= c d))) :rule refl)
    +(step t4 (cl (= (ite d c false) (and d c))) :rule all_simplify)
    +(step t5 (cl (= (not (ite d c false)) (not (and d c)))) :rule cong :premises (t4))
    +(step t6 (cl (= (= (or b d) (= b d)) (= (or b d) (= b d)))) :rule refl)
    +(step t7 (cl (= (and (or d b) (= c d) (not (ite d c false)) (= (or b d) (= b d))) (and (or d b) (= c d) (not (and d c)) (= (or b d) (= b d))))) :rule cong :premises (t2 t3 t5 t6))
    +(step t8 (cl (and (or d b) (= c d) (not (and d c)) (= (or b d) (= b d)))) :rule resolution :premises (t1 t7 a0))
    +(step t9 (cl (not (and d c))) :rule and :premises (t8))
    +(step t10 (cl (not d) (not c)) :rule not_and :premises (t9))
    +(step t11 (cl (= c d)) :rule and :premises (t8))
    +(step t12 (cl c (not d)) :rule equiv2 :premises (t11))
    +(step t13 (cl (= (or b d) (= b d))) :rule and :premises (t8))
    +(step t14 (cl (not (or b d)) (= b d)) :rule equiv1 :premises (t13))
    +(step t15 (cl (= b d) (not (or b d))) :rule reordering :premises (t14))
    +(step t16 (cl (not (= b d)) (not b) d) :rule equiv_pos2)
    +(step t17 (cl d (not b) (not (= b d))) :rule reordering :premises (t16))
    +(step t18 (cl (or b d) (not b)) :rule or_neg)
    +(step t19 (cl d (not b) (not b)) :rule resolution :premises (t15 t17 t18))
    +(step t20 (cl d (not b)) :rule contraction :premises (t19))
    +(step t21 (cl (or d b)) :rule and :premises (t8))
    +(step t22 (cl d b) :rule or :premises (t21))
    +(step t23 (cl b d) :rule reordering :premises (t22))
    +(step t24 (cl d d) :rule resolution :premises (t20 t23))
    +(step t25 (cl d) :rule contraction :premises (t24))
    +(step t26 (cl c) :rule resolution :premises (t12 t25))
    +(step t27 (cl d (not b) (not b)) :rule resolution :premises (t15 t17 t18))
    +(step t28 (cl d (not b)) :rule contraction :premises (t27))
    +(step t29 (cl d d) :rule resolution :premises (t28 t23))
    +(step t30 (cl d) :rule contraction :premises (t29))
    +(step t31 (cl) :rule resolution :premises (t10 t26 t30))
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/proofs/output_dot.html b/cvc5-1.0.2/proofs/output_dot.html new file mode 100644 index 0000000..340ebd8 --- /dev/null +++ b/cvc5-1.0.2/proofs/output_dot.html @@ -0,0 +1,279 @@ + + + + + + + + Proof format: DOT — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Proof format: DOT + + ¶ + +

    +

    + Using the flag + + + proof-format-mode=dot + + + , cvc5 outputs proofs in the DOT format. +

    +

    + The DOT format is a graph description language (see e.g. + + this description + + ). It can be used, among other things, for visualization. +

    +

    + We leverage this format for visualizing cvc5 proofs, in the internal calculus, as a graph. One can use a default dot visualizer or the dedicated proof visualizer + + available here + + . It suffices to upload the DOT proof outputted by cvc5, saved into a file. The visualizer offers several custom features, such as fold/unfold subproofs, coloring nodes, and stepwise expansion of let terms. +

    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/proofs/output_lfsc.html b/cvc5-1.0.2/proofs/output_lfsc.html new file mode 100644 index 0000000..3557829 --- /dev/null +++ b/cvc5-1.0.2/proofs/output_lfsc.html @@ -0,0 +1,461 @@ + + + + + + + + Proof format: LFSC — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Proof format: LFSC + + ¶ + +

    +

    + Using the flag + + + proof-format-mode=lfsc + + + , cvc5 outputs proofs in the LFSC proof format. +

    +

    + The LFSC proof format is based on the LF logical framework extended with computational side conditions, as described in + + [ + + SOR+13 + + ] + + . A high performance C++ proof checker for LFSC is available + + here + + . +

    +

    + For a quick start, the cvc5 repository contains a + + script + + which will download and install the LFSC proof checker, and create scripts for generating proofs with cvc5 and checking them with the LFSC proof checker. +

    +

    + LFSC is a meta-framework, meaning that the proof rules used by cvc5 are defined in signature files, also contained within the cvc5 repository in this + + directory + + . Based on these signatures, cvc5 provides basic support for LFSC proofs over all theories that it supports. +

    +

    + Note that several proof rules in the internal calculus are not yet supported in LFSC signatures, and are instead printed as + + trust + + steps in the LFSC proof. A trust step proves an arbitrary formula with no provided justification. The LFSC proof contains warnings for which proof rules from the internal calculus were recorded as trust steps in the LFSC proof. +

    +

    + For more fine-grained proofs, the additional option + + + proof-granularity=theory-rewrite + + + should be passed to cvc5. This often will result in LFSC proofs with more detail, and whose trust steps correspond only to equalities corresponding to theory rewrites. +

    +

    + A simple example of cvc5 producing a proof in LFSC proof format: +

    +
    +
    +
    $ bin/cvc5 --dump-proofs --proof-format-mode=lfsc --proof-granularity=theory-rewrite ../test/regress/cli/regress0/proofs/qgu-fuzz-1-bool-sat.smt2
    +unsat
    +; WARNING: adding trust step for THEORY_REWRITE
    +(define cvc.c (var 0 Bool))
    +(define cvc.b (var 1 Bool))
    +(define cvc.d (var 2 Bool))
    +(check
    +(@ __t1 (= cvc.b cvc.d)
    +(@ __t2 (or cvc.b (or cvc.d false))
    +(@ __t3 (= __t2 __t1)
    +(@ __t4 (and __t3 true)
    +(@ __t5 (ite cvc.d cvc.c false)
    +(@ __t6 (= cvc.c cvc.d)
    +(@ __t7 (or cvc.d (or cvc.b false))
    +(@ __t8 (and (not cvc.d) __t4)
    +(% __a0 (holds (and __t7 (and __t6 (and (not __t5) __t4))))
    +(: (holds false)
    +
    +(plet _  _ 
    +
    +(refl __t3)
    +(\ __p1
    +
    +(plet _  _ 
    +
    +(refl f_and)
    +(\ __p2
    +
    +(plet _  _ 
    +
    +(refl __t7)
    +(\ __p3
    +
    +(plet _  _ 
    +
    +(refl f_and)
    +(\ __p4
    +
    +(plet _  _ 
    +
    +(refl f_and)
    +(\ __p5
    +
    +(plet _  _ 
    +
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p5 __p3)
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p5
    +(refl __t6))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p5
    +(cong _  _  _  _ 
    +(refl f_not)
    +(trust (= __t5 (and cvc.d (and cvc.c true)))) ; from THEORY_REWRITE
    +))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p5 __p1)
    +(refl true)))))
    +(\ __p6
    +
    +(plet _  _ 
    +
    +(and_elim _  _  1
    +(eq_resolve _  _  __a0 __p6))
    +(\ __p7
    +
    +(plet _  _ 
    +
    +(refl f_and)
    +(\ __p8
    +
    +(plet _  _ 
    +
    +(refl cvc.d)
    +(\ __p9
    +
    +(plet _  _ 
    +
    +(eq_resolve _  _  __a0
    +(trans _  _  _  __p6
    +(trans _  _  _ 
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p4
    +(refl __t7))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p4
    +(cong _  _  _  _ 
    +(cong _  _  _  _ 
    +(refl f_=) __p7) __p9))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p4
    +(cong _  _  _  _ 
    +(refl f_not)
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p8 __p9)
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p8 __p7)
    +(refl true)))))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p4
    +(refl __t3))
    +(refl true)))))
    +(trans _  _  _ 
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p2 __p3)
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p2
    +(trust (= (= cvc.d cvc.d) true)) ; from THEORY_REWRITE
    +)
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p2
    +(cong _  _  _  _ 
    +(refl f_not)
    +(trust (= (and cvc.d (and cvc.d true)) cvc.d)) ; from THEORY_REWRITE
    +))
    +(cong _  _  _  _ 
    +(cong _  _  _  _  __p2 __p1)
    +(refl true)))))
    +(trust (= (and __t7 (and true __t8)) (and __t7 __t8))) ; from THEORY_REWRITE
    +))))
    +(\ __p10
    +
    +(plet _  _ 
    +
    +(and_elim _  _  0 __p10)
    +(\ __p11
    +
    +
    +(resolution _  _  _ 
    +(resolution _  _  _ 
    +(reordering _  (or __t1 (or (not __t2) false))
    +(equiv_elim1 _  _ 
    +(and_elim _  _  2 __p10)))
    +(resolution _  _  _ 
    +(resolution _  _  _ 
    +(reordering _  (or cvc.d (or (not cvc.b) (or (not __t1) false)))
    +(cnf_equiv_pos1 cvc.b cvc.d))
    +(and_elim _  _  1 __p10) tt cvc.d)
    +(resolution _  _  _ 
    +(reordering _  __t2 __p11)
    +(and_elim _  _  1 __p10) tt cvc.d) ff cvc.b) tt __t1)
    +(reordering _  __t2 __p11) ff __t2))))))))))))))))))))))))))))))))))
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/proofs/proof_rules.html b/cvc5-1.0.2/proofs/proof_rules.html new file mode 100644 index 0000000..3cf92e8 --- /dev/null +++ b/cvc5-1.0.2/proofs/proof_rules.html @@ -0,0 +1,9728 @@ + + + + + + + + Proof rules — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Proof rules + + ¶ + +

    +
    +
    + + + + + + + + + enum + + + + + + + class + + + + + + + + cvc5 + + + + + :: + + + + + internal + + + + + :: + + + + + + + PfRule + + + + + + + + : + + + + + + + uint32_t + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + An enumeration for proof rules. This enumeration is analogous to Kind for +Node objects. +

    +

    + All proof rules are given as inference rules, presented in the following +form: +

    +
    + \[\texttt{RULENAME}: +\inferruleSC{\varphi_1 \dots \varphi_n \mid t_1 \dots t_m}{\psi}{if $C$}\] +
    +

    + where we call + + \(\varphi_i\) + + its premises or children, + + \(t_i\) + + its +arguments, + + \(\psi\) + + its conclusion, and + + \(C\) + + its side condition. +Alternatively, we can write the application of a proof rule as + + + (RULENAME + + + F1 + + + ... + + + Fn + + + :args + + + t1 + + + ... + + + tm) + + + , omitting the conclusion (since it can be uniquely determined from premises and arguments). +Note that premises are sometimes given as proofs, i.e., application of +proof rules, instead of formulas. This abuses the notation to see proof rule applications and their conclusions interchangeably. +

    +

    + Conceptually, the following proof rules form a calculus whose target +user is the Node-level theory solvers. This means that the rules below +are designed to reason about, among other things, common operations on Node +objects like Rewriter::rewrite or Node::substitute. It is intended to be +translated or printed in other formats. +

    +

    + The following PfRule values include core rules and those categorized by +theory, including the theory of equality. +

    +

    + The “core rules” include two distinguished rules which have special status: +(1) + + + + ASSUME + + + + , which represents an open +leaf in a proof; and (2) + + + + SCOPE + + + + , which +encloses a scope (a subproof) with a set of scoped assumptions. The core rules additionally correspond to +generic operations that are done internally on nodes, e.g. calling +Rewriter::rewrite. +

    +

    + Rules with prefix + + + MACRO_ + + + are those that can be defined in terms of other +rules. These exist for convenience and can be replaced by their definition in post-processing. +

    +

    + + Values: + +

    +
    +
    + + + + + + + + + enumerator + + + + + + + + ASSUME + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Assumption (a leaf) + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + This rule has special status, in that an application of assume is an +open leaf in a proof that is not (yet) justified. An assume leaf is +analogous to a free variable in a term, where we say “F is a free +assumption in proof P” if it contains an application of F that is not +bound by + + + + SCOPE + + + + (see below). +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SCOPE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Scope (a binder for assumptions) + +

    +
    + \[\inferruleSC{F \mid F_1 \dots F_n}{(F_1 \land \dots \land F_n) +\Rightarrow F}{if $F\neq\bot$} \textrm{ or } \inferruleSC{F \mid F_1 +\dots F_n}{\neg (F_1 \land \dots \land F_n)}{if $F=\bot$}\] +
    +

    + This rule has a dual purpose with + + + + ASSUME + + + + . It is a way to close assumptions in a proof. We +require that + + \(F_1 \dots F_n\) + + are free assumptions in P and say that + + \(F_1 \dots F_n\) + + are not free in + + + (SCOPE + + + P) + + + . In other words, they +are bound by this application. For example, the proof node: + + + (SCOPE + + + (ASSUME + + + F) + + + :args + + + F) + + + has the conclusion + + \(F \Rightarrow F\) + + and has no free assumptions. +More generally, a proof with no free assumptions always concludes a valid +formula. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SUBS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Substitution + +

    +
    + \[\inferrule{F_1 \dots F_n \mid t, ids?}{t = t \circ \sigma_{ids}(F_n) +\circ \cdots \circ \sigma_{ids}(F_1)}\] +
    +

    + where + + \(\sigma_{ids}(F_i)\) + + are substitutions, which notice are applied +in reverse order. Notice that + + \(ids\) + + is a MethodId identifier, which +determines how to convert the formulas + + \(F_1 \dots F_n\) + + into +substitutions. It is an optional argument, where by default the premises +are equalities of the form + + (= x y) + + and converted into substitutions + + \(x\mapsto y\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + REWRITE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Rewrite + +

    +
    + \[\inferrule{- \mid t, idr}{t = \texttt{Rewriter}_{idr}(t)}\] +
    +

    + where + + \(idr\) + + is a MethodId identifier, which determines the kind of +rewriter to apply, e.g. Rewriter::rewrite. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + EVALUATE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Evaluate + +

    +
    + \[\inferrule{- \mid t}{t = \texttt{Evaluator::evaluate}(t)}\] +
    +

    + Note this is equivalent to: + + + (REWRITE + + + t + + + MethodId::RW_EVALUATE) + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_SR_EQ_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Substitution + Rewriting equality introduction + +

    +

    + In this rule, we provide a term + + \(t\) + + and conclude that it is equal to +its rewritten form under a (proven) substitution. +

    +
    + \[\inferrule{F_1 \dots F_n \mid t, (ids (ida (idr)?)?)?}{t = +\texttt{Rewriter}_{idr}(t \circ \sigma_{ids, ida}(F_n) \circ \cdots \circ +\sigma_{ids, ida}(F_1))}\] +
    +

    + In other words, from the point of view of Skolem forms, this rule +transforms + + \(t\) + + to + + \(t'\) + + by standard substitution + rewriting. +

    +

    + The arguments + + \(ids\) + + , + + \(ida\) + + and + + \(idr\) + + are optional and +specify the identifier of the substitution, the substitution application +and rewriter respectively to be used. For details, see + + theory/builtin/proof_checker.h + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_SR_PRED_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Substitution + Rewriting predicate introduction + +

    +

    + In this rule, we provide a formula + + \(F\) + + and conclude it, under the +condition that it rewrites to true under a proven substitution. +

    +
    + \[\inferrule{F_1 \dots F_n \mid F, (ids (ida (idr)?)?)?}{F}\] +
    +

    + where + + \(\texttt{Rewriter}_{idr}(F \circ \sigma_{ids, ida}(F_n) \circ +\cdots \circ \sigma_{ids, ida}(F_1)) = \top\) + + and + + \(ids\) + + and + + \(idr\) + + are method identifiers. +

    +

    + More generally, this rule also holds when + + \(\texttt{Rewriter::rewrite}(\texttt{toOriginal}(F')) = \top\) + + where + + \(F'\) + + is the result of the left hand side of the equality above. +Here, notice that we apply rewriting on the original form of + + \(F'\) + + , +meaning that this rule may conclude an + + \(F\) + + whose Skolem form is +justified by the definition of its (fresh) Skolem variables. For example, +this rule may justify the conclusion + + \(k = t\) + + where + + \(k\) + + is the +purification Skolem for + + \(t\) + + , e.g. where the original form of + + \(k\) + + is + + \(t\) + + . +

    +

    + Furthermore, notice that the rewriting and substitution is applied only +within the side condition, meaning the rewritten form of the original form +of + + \(F\) + + does not escape this rule. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_SR_PRED_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Substitution + Rewriting predicate elimination + +

    +
    + \[\inferrule{F, F_1 \dots F_n \mid (ids (ida +(idr)?)?)?}{\texttt{Rewriter}_{idr}(F \circ \sigma_{ids, ida}(F_n) \circ +\cdots \circ \sigma_{ids, ida}(F_1))}\] +
    +

    + where + + \(ids\) + + and + + \(idr\) + + are method identifiers. +

    +

    + We rewrite only on the Skolem form of + + \(F\) + + , similar to + + + + MACRO_SR_EQ_INTRO + + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_SR_PRED_TRANSFORM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Substitution + Rewriting predicate elimination + +

    +
    + \[\inferrule{F, F_1 \dots F_n \mid G, (ids (ida (idr)?)?)?}{G}\] +
    +

    + where + + \(\texttt{Rewriter}_{idr}(F \circ \sigma_{ids, ida}(F_n) \circ +\cdots \circ \sigma_{ids, ida}(F_1)) = \texttt{Rewriter}_{idr}(G \circ +\sigma_{ids, ida}(F_n) \circ \cdots \circ \sigma_{ids, ida}(F_1))\) + + . +

    +

    + More generally, this rule also holds when: + + \(\texttt{Rewriter::rewrite}(\texttt{toOriginal}(F')) = +\texttt{Rewriter::rewrite}(\texttt{toOriginal}(G'))\) + + where + + \(F'\) + + and + + \(G'\) + + are the result of each side of the equation above. Here, +original forms are used in a similar manner to + + + + MACRO_SR_PRED_INTRO + + + + above. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ANNOTATION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Builtin theory – Annotation + +

    +
    + \[\inferrule{F \mid a_1 \dots a_n}{F}\] +
    +

    + The terms + + \(a_1 \dots a_n\) + + can be anything used to annotate the proof +node, one example is where + + \(a_1\) + + is a theory::InferenceId. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + REMOVE_TERM_FORMULA_AXIOM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Processing rules – Remove Term Formulas Axiom + +

    +
    + \[\inferrule{- \mid t}{\texttt{RemoveTermFormulas::getAxiomFor}(t)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_LEMMA + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Theory lemma + +

    +
    + \[\inferrule{- \mid F, tid}{F}\] +
    +

    + where + + \(F\) + + is a (T-valid) theory lemma generated by theory with +TheoryId + + \(tid\) + + . This is a “coarse-grained” rule that is used as a +placeholder if a theory did not provide a proof for a lemma or conflict. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_REWRITE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Theory rewrite + +

    +
    + \[\inferrule{- \mid F, tid, rid}{F}\] +
    +

    + where + + \(F\) + + is an equality of the form + + \(t = t'\) + + where + + \(t'\) + + is obtained by applying the kind of rewriting given by the method +identifier + + \(rid\) + + , which is one of: + + + RW_REWRITE_THEORY_PRE + + + , + + + RW_REWRITE_THEORY_POST + + + , + + + RW_REWRITE_EQ_EXT + + + . Notice that the checker for this rule does not +replay the rewrite to ensure correctness, since theory rewriter methods are +not static. For example, the quantifiers rewriter involves constructing new +bound variables that are not guaranteed to be consistent on each call. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_PREPROCESS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Theory preprocessing + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality of the form + + \(t = +\texttt{Theory::ppRewrite}(t)\) + + for some theory. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_PREPROCESS_LEMMA + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Theory preprocessing + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + was added as a new assertion by theory preprocessing from +the theory with identifier tid. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + PREPROCESS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Preprocessing + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality of the form + + \(t = t'\) + + where + + \(t\) + + was replaced by + + \(t'\) + + based on some preprocessing pass, or otherwise + + \(F\) + + was added as a new assertion by some preprocessing pass. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + PREPROCESS_LEMMA + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Preprocessing new assertion + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + was added as a new assertion by some preprocessing pass. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_EXPAND_DEF + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Theory expand definitions + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality of the form + + \(t = t'\) + + where + + \(t\) + + was replaced by + + \(t'\) + + based on theory expand definitions. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + WITNESS_AXIOM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Witness term axiom + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an existential + + + (exists + + + ((x + + + T)) + + + (P + + + x)) + + + used for +introducing a witness term + + + (witness + + + ((x + + + T)) + + + (P + + + x)) + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUST_REWRITE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Non-replayable rewriting + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality + + t = t’ + + that holds by a form of rewriting +that could not be replayed during proof postprocessing. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUST_SUBS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Non-replayable substitution + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality + + \(t = t'\) + + that holds by a form of +substitution that could not be replayed during proof postprocessing. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUST_SUBS_MAP + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Non-replayable substitution map + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality + + \(t = t'\) + + that holds by a form of +substitution that could not be determined by the TrustSubstitutionMap. This +inference may contain possibly multiple children corresponding to the +formulas used to derive the substitution. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUST_SUBS_EQ + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Trusted rules – Solved equality + +

    +
    + \[\inferrule{F' \mid F}{F}\] +
    +

    + where + + \(F\) + + is a solved equality of the form + + \(x = t\) + + derived as +the solved form of + + \(F'\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + THEORY_INFERENCE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Theory-specific inference + +

    +
    + \[\inferrule{- \mid F}{F}\] +
    +

    + where + + \(F\) + + is a fact derived by a theory-specific inference. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SAT_REFUTATION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + SAT Refutation for assumption-based unsat cores + +

    +
    + \[\inferrule{F_1 \dots F_n \mid -}{\bot}\] +
    +

    + where + + \(F_1 \dots F_n\) + + correspond to the unsat core determined by the +SAT solver. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RESOLUTION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Resolution + +

    +
    + \[\inferrule{C_1, C_2 \mid pol, L}{C}\] +
    +

    + where +

    +
      +
    • +

      + + \(C_1\) + + and + + \(C_2\) + + are nodes viewed as clauses, i.e., either an + + + OR + + + node with each children viewed as a literal or a node viewed as a +literal. Note that an + + + OR + + + node could also be a literal. +

      +
    • +
    • +

      + + \(pol\) + + is either true or false, representing the polarity of the +pivot on the first clause +

      +
    • +
    • +

      + + \(L\) + + is the pivot of the resolution, which occurs as is (resp. under +a + + + NOT + + + ) in + + \(C_1\) + + and negatively (as is) in + + \(C_2\) + + if + + \(pol = \top\) + + ( + + \(pol = \bot\) + + ). +

      +
    • +
    +

    + + \(C\) + + is a clause resulting from collecting all the literals in + + \(C_1\) + + , minus the first occurrence of the pivot or its negation, and + + \(C_2\) + + , minus the first occurrence of the pivot or its negation, +according to the policy above. If the resulting clause has a single +literal, that literal itself is the result; if it has no literals, then the +result is false; otherwise it’s an + + + OR + + + node of the resulting literals. +

    +

    + Note that it may be the case that the pivot does not occur in the +clauses. In this case the rule is not unsound, but it does not correspond +to resolution but rather to a weakening of the clause that did not have a +literal eliminated. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CHAIN_RESOLUTION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – N-ary Resolution + +

    +
    + \[\inferrule{C_1 \dots C_n \mid pol_1,L_1 \dots pol_{n-1},L_{n-1}}{C}\] +
    +

    + where +

    +
      +
    • +

      + let + + \(C_1 \dots C_n\) + + be nodes viewed as clauses, as defined above +

      +
    • +
    • +

      + let + + \(C_1 \diamond_{L,\mathit{pol}} C_2\) + + represent the resolution of + + \(C_1\) + + with + + \(C_2\) + + with pivot + + \(L\) + + and polarity + + \(pol\) + + , as defined above +

      +
    • +
    • +

      + let + + \(C_1' = C_1\) + + , +

      +
    • +
    • +

      + for each + + \(i > 1\) + + , let + + \(C_i' = C_{i-1} \diamond{L_{i-1}, +\mathit{pol}_{i-1}} C_i'\) + +

      +
    • +
    +

    + The result of the chain resolution is + + \(C = C_n'\) + +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + FACTORING + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Factoring + +

    +
    + \[\inferrule{C_1 \mid -}{C_2}\] +
    +

    + where the set representations of + + \(C_1\) + + and + + \(C_2\) + + are the same +and the number of literals in + + \(C_2\) + + is smaller than that of + + \(C_1\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + REORDERING + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Reordering + +

    +
    + \[\inferrule{C_1 \mid C_2}{C_2}\] +
    +

    + where +the set representations of + + \(C_1\) + + and + + \(C_2\) + + are the same and the +number of literals in + + \(C_2\) + + is the same of that of + + \(C_1\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_RESOLUTION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – N-ary Resolution + Factoring + Reordering + +

    +
    + \[\inferrule{C_1 \dots C_n \mid C, pol_1,L_1 \dots pol_{n-1},L_{n-1}}{C}\] +
    +

    + where +

    +
      +
    • +

      + let + + \(C_1 \dots C_n\) + + be nodes viewed as clauses, as defined in + + + + RESOLUTION + + + +

      +
    • +
    • +

      + let + + \(C_1 \diamond{L,\mathit{pol}} C_2\) + + represent the resolution of + + \(C_1\) + + with + + \(C_2\) + + with pivot + + \(L\) + + and polarity + + \(pol\) + + , as defined in + + + + RESOLUTION + + + +

      +
    • +
    • +

      + let + + \(C_1'\) + + be equal, in its set representation, to + + \(C_1\) + + , +

      +
    • +
    • +

      + for each + + \(i > 1\) + + , let + + \(C_i'\) + + be equal, it its set +representation, to + + \(C_{i-1} \diamond{L_{i-1},\mathit{pol}_{i-1}} +C_i'\) + +

      +
    • +
    +

    + The result of the chain resolution is + + \(C\) + + , which is equal, in its set +representation, to + + \(C_n'\) + +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_RESOLUTION_TRUST + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – N-ary Resolution + Factoring + Reordering unchecked + +

    +

    + Same as + + + + MACRO_RESOLUTION + + + + , but not checked by the internal proof +checker. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SPLIT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Split + +

    +
    + \[\inferrule{- \mid F}{F \lor \neg F}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + EQ_RESOLVE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Equality resolution + +

    +
    + \[\inferrule{F_1, (F_1 = F_2) \mid -}{F_2}\] +
    +

    + Note this can optionally be seen as a macro for + + + + EQUIV_ELIM1 + + + + + + + + + RESOLUTION + + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MODUS_PONENS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Modus Ponens + +

    +
    + \[\inferrule{F_1, (F_1 \rightarrow F_2) \mid -}{F_2}\] +
    +

    + Note this can optionally be seen as a macro for + + + + IMPLIES_ELIM + + + + + + + + + RESOLUTION + + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_NOT_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Double negation elimination + +

    +
    + \[\inferrule{\neg (\neg F) \mid -}{F}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONTRA + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Contradiction + +

    +
    + \[\inferrule{F, \neg F \mid -}{\bot}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + AND_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – And elimination + +

    +
    + \[\inferrule{(F_1 \land \dots \land F_n) \mid i}{F_i}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + AND_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – And introduction + +

    +
    + \[\inferrule{F_1 \dots F_n \mid -}{(F_1 \land \dots \land F_n)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_OR_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not Or elimination + +

    +
    + \[\inferrule{\neg(F_1 \lor \dots \lor F_n) \mid i}{\neg F_i}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + IMPLIES_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Implication elimination + +

    +
    + \[\inferrule{F_1 \rightarrow F_2 \mid -}{\neg F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_IMPLIES_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not Implication elimination version 1 + +

    +
    + \[\inferrule{\neg(F_1 \rightarrow F_2) \mid -}{F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_IMPLIES_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not Implication elimination version 2 + +

    +
    + \[\inferrule{\neg(F_1 \rightarrow F_2) \mid -}{\neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + EQUIV_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Equivalence elimination version 1 + +

    +
    + \[\inferrule{F_1 = F_2 \mid -}{\neg F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + EQUIV_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Equivalence elimination version 2 + +

    +
    + \[\inferrule{F_1 = F_2 \mid -}{F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_EQUIV_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not Equivalence elimination version 1 + +

    +
    + \[\inferrule{F_1 \neq F_2 \mid -}{F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_EQUIV_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not Equivalence elimination version 2 + +

    +
    + \[\inferrule{F_1 \neq F_2 \mid -}{\neg F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + XOR_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – XOR elimination version 1 + +

    +
    + \[\inferrule{F_1 \xor F_2 \mid -}{F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + XOR_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – XOR elimination version 2 + +

    +
    + \[\inferrule{F_1 \xor F_2 \mid -}{\neg F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_XOR_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not XOR elimination version 1 + +

    +
    + \[\inferrule{\neg(F_1 \xor F_2) \mid -}{F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_XOR_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not XOR elimination version 2 + +

    +
    + \[\inferrule{\neg(F_1 \xor F_2) \mid -}{\neg F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ITE_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – ITE elimination version 1 + +

    +
    + \[\inferrule{(\ite{C}{F_1}{F_2}) \mid -}{\neg C \lor F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ITE_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – ITE elimination version 2 + +

    +
    + \[\inferrule{(\ite{C}{F_1}{F_2}) \mid -}{C \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_ITE_ELIM1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not ITE elimination version 1 + +

    +
    + \[\inferrule{\neg(\ite{C}{F_1}{F_2}) \mid -}{\neg C \lor \neg F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_ITE_ELIM2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – Not ITE elimination version 2 + +

    +
    + \[\inferrule{\neg(\ite{C}{F_1}{F_2}) \mid -}{C \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + NOT_AND + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – De Morgan – Not And + +

    +
    + \[\inferrule{\neg(F_1 \land \dots \land F_n) \mid -}{\neg F_1 \lor \dots +\lor \neg F_n}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_AND_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – And Positive + +

    +
    + \[\inferrule{- \mid (F_1 \land \dots \land F_n), i}{\neg (F_1 \land \dots +\land F_n) \lor F_i}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_AND_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – And Negative + +

    +
    + \[\inferrule{- \mid (F_1 \land \dots \land F_n)}{(F_1 \land \dots \land +F_n) \lor \neg F_1 \lor \dots \lor \neg F_n}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_OR_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Or Positive + +

    +
    + \[\inferrule{- \mid (F_1 \lor \dots \lor F_n)}{\neg(F_1 \lor \dots \lor +F_n) \lor F_1 \lor \dots \lor F_n}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_OR_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Or Negative + +

    +
    + \[\inferrule{- \mid (F_1 \lor \dots \lor F_n), i}{(F_1 \lor \dots \lor F_n) +\lor \neg F_i}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_IMPLIES_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Implies Positive + +

    +
    + \[\inferrule{- \mid F_1 \rightarrow F_2}{\neg(F_1 \rightarrow F_2) \lor \neg F_1 +\lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_IMPLIES_NEG1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Implies Negative 1 + +

    +
    + \[\inferrule{- \mid F_1 \rightarrow F_2}{(F_1 \rightarrow F_2) \lor F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_IMPLIES_NEG2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Implies Negative 2 + +

    +
    + \[\inferrule{- \mid F_1 \rightarrow F_2}{(F_1 \rightarrow F_2) \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_EQUIV_POS1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Equiv Positive 1 + +

    +
    + \[\inferrule{- \mid F_1 = F_2}{F_1 \neq F_2 \lor \neg F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_EQUIV_POS2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Equiv Positive 2 + +

    +
    + \[\inferrule{- \mid F_1 = F_2}{F_1 \neq F_2 \lor F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_EQUIV_NEG1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Equiv Negative 1 + +

    +
    + \[\inferrule{- \mid F_1 = F_2}{(F_1 = F_2) \lor F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_EQUIV_NEG2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – Equiv Negative 2 + +

    +
    + \[\inferrule{- \mid F_1 = F_2}{(F_1 = F_2) \lor \neg F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_XOR_POS1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – XOR Positive 1 + +

    +
    + \[\inferrule{- \mid F_1 \xor F_2}{\neg(F_1 \xor F_2) \lor F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_XOR_POS2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – XOR Positive 2 + +

    +
    + \[\inferrule{- \mid F_1 \xor F_2}{\neg(F_1 \xor F_2) \lor \neg F_1 \lor +\neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_XOR_NEG1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – XOR Negative 1 + +

    +
    + \[\inferrule{- \mid F_1 \xor F_2}{(F_1 \xor F_2) \lor \neg F_1 \lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_XOR_NEG2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – XOR Negative 2 + +

    +
    + \[\inferrule{- \mid F_1 \xor F_2}{(F_1 \xor F_2) \lor F_1 \lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_POS1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Positive 1 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{\neg(\ite{C}{F_1}{F_2}) \lor \neg +C \lor F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_POS2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Positive 2 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{\neg(\ite{C}{F_1}{F_2}) \lor C +\lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_POS3 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Positive 3 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{\neg(\ite{C}{F_1}{F_2}) \lor F_1 +\lor F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_NEG1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Negative 1 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{(\ite{C}{F_1}{F_2}) \lor \neg C +\lor \not F_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_NEG2 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Negative 2 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{(\ite{C}{F_1}{F_2}) \lor C \lor +\neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CNF_ITE_NEG3 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Boolean – CNF – ITE Negative 3 + +

    +
    + \[\inferrule{- \mid (\ite{C}{F_1}{F_2})}{(\ite{C}{F_1}{F_2}) \lor \neg F_1 +\lor \neg F_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + REFL + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Reflexivity + +

    +
    + \[\inferrule{-\mid t}{t = t)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SYMM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Symmetry + +

    +
    + \[\inferrule{t_1 = t_2\mid -}{t_2 = t_1}\] +
    +

    + or +

    +
    + \[\inferrule{t_1 \neq t_2\mid -}{t_2 \neq t_1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRANS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Transitivity + +

    +
    + \[\inferrule{t_1=t_2,\dots,t_{n-1}=t_n\mid -}{t_1 = t_n}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Congruence + +

    +
    + \[\inferrule{t_1=s_1,\dots,t_n=s_n\mid k, f?}{k(f?)(t_1,\dots, t_n) = +k(f?)(s_1,\dots, s_n)}\] +
    +

    + where + + \(k\) + + is the application kind. Notice that + + \(f\) + + must be +provided iff + + \(k\) + + is a parameterized kind, e.g. + + + APPLY_UF + + + . The +actual node for + + \(k\) + + is constructible via + + + ProofRuleChecker::mkKindNode + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUE_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – True intro + +

    +
    + \[\inferrule{F\mid -}{F = \top}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + TRUE_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – True elim + +

    +
    + \[\inferrule{F=\top\mid -}{F}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + FALSE_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – False intro + +

    +
    + \[\inferrule{\neg F\mid -}{F = \bot}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + FALSE_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – False elim + +

    +
    + \[\inferrule{F=\bot\mid -}{\neg F}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + HO_APP_ENCODE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Higher-order application encoding + +

    +
    + \[\inferrule{-\mid t}{t= \texttt{TheoryUfRewriter::getHoApplyForApplyUf}(t)}\] +
    +

    + For example, this rule concludes + + \(f(x,y) = @(@(f,x),y)\) + + , where + + \(@\) + + isthe + + + HO_APPLY + + + kind. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + HO_CONG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Equality – Higher-order congruence + +

    +
    + \[\inferrule{f=g, t_1=s_1,\dots,t_n=s_n\mid -}{f(t_1,\dots, t_n) = +g(s_1,\dots, s_n)}\] +
    +

    + Notice that this rule is only used when the application kinds are + + + APPLY_UF + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARRAYS_READ_OVER_WRITE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arrays – Read over write + +

    +
    + \[\inferrule{i_1 \neq i_2\mid \mathit{select}(\mathit{store}(a,i_1,e),i_2)} +{\mathit{select}(\mathit{store}(a,i_1,e),i_2) = \mathit{select}(a,i_2)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARRAYS_READ_OVER_WRITE_CONTRA + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arrays – Read over write, contrapositive + +

    +
    + \[\inferrule{\mathit{select}(\mathit{store}(a,i_2,e),i_1) \neq +\mathit{select}(a,i_1)\mid -}{i_1=i_2}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARRAYS_READ_OVER_WRITE_1 + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arrays – Read over write 1 + +

    +
    + \[\inferrule{-\mid \mathit{select}(\mathit{store}(a,i,e),i)} +{\mathit{select}(\mathit{store}(a,i,e),i)=e}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARRAYS_EXT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arrays – Arrays extensionality + +

    +
    + \[\inferrule{a \neq b\mid -} +{\mathit{select}(a,k)\neq\mathit{select}(b,k)}\] +
    +

    + where + + \(k\) + + is + + \(\texttt{arrays::SkolemCache::getExtIndexSkolem}(a\neq b)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARRAYS_EQ_RANGE_EXPAND + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arrays – Expansion of array range equality + +

    +
    + \[\inferrule{-\mid \mathit{eqrange}(a,b,i,j)} +{\mathit{eqrange}(a,b,i,j)= +\forall x.\> i \leq x \leq j \rightarrow +\mathit{select}(a,x)=\mathit{select}(b,x)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + BV_BITBLAST + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Bit-vectors – Bitblast + +

    +
    + \[\inferrule{-\mid t}{t = \texttt{bitblast}(t)}\] +
    +

    + where + + + bitblast() + + + represents the result of the bit-blasted term as a +bit-vector consisting of the output bits of the bit-blasted circuit +representation of the term. Terms are bit-blasted according to the +strategies defined in + + + theory/bv/bitblast/bitblast_strategies_template.h + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + BV_BITBLAST_STEP + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Bit-vectors – Bitblast bit-vector constant, variable, and terms + +

    +

    + For constant and variables: +

    +
    + \[\inferrule{-\mid t}{t = \texttt{bitblast}(t)}\] +
    +

    + For terms: +

    +
    + \[\inferrule{-\mid k(\texttt{bitblast}(t_1),\dots,\texttt{bitblast}(t_n))} +{k(\texttt{bitblast}(t_1),\dots,\texttt{bitblast}(t_n)) = +\texttt{bitblast}(t)}\] +
    +

    + where + + \(t\) + + is + + \(k(t_1,\dots,t_n)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + BV_EAGER_ATOM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Bit-vectors – Bit-vector eager atom + +

    +
    + \[\inferrule{-\mid F}{F = F[0]}\] +
    +

    + where + + \(F\) + + is of kind + + + BITVECTOR_EAGER_ATOM + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + DT_UNIF + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Datatypes – Unification + +

    +
    + \[\inferrule{C(t_1,\dots,t_n)= C(s_1,\dots,s_n)\mid i}{t_1 = s_i}\] +
    +

    + where + + \(C\) + + is a constructor. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + DT_INST + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Datatypes – Instantiation + +

    +
    + \[\inferrule{-\mid t,n}{\mathit{is}_C(t) = +(t = C(\mathit{sel}_1(t),\dots,\mathit{sel}_n(t)))}\] +
    +

    + where + + \(C\) + + is the + + \(n^{\mathit{th}}\) + + constructor of the type of +t, and + + \(\mathit{is}_C\) + + is the discriminator (tester) for + + \(C\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + DT_COLLAPSE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Datatypes – Collapse + +

    +
    + \[\inferrule{-\mid \mathit{sel}_i(C_j(t_1,\dots,t_n))}{ +\mathit{sel}_i(C_j(t_1,\dots,t_n)) = r}\] +
    +

    + where + + \(C_j\) + + is a constructor, + + \(r\) + + is + + \(t_i\) + + if + + \(\mathit{sel}_i\) + + is a correctly applied selector, or + + + TypeNode::mkGroundTerm() + + + of the proper type otherwise. Notice that the +use of + + + mkGroundTerm + + + differs from the rewriter which uses + + + mkGroundValue + + + in this case. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + DT_SPLIT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Datatypes – Split + +

    +
    + \[\inferrule{-\mid t}{\mathit{is}_{C_1}(t)\vee\cdots\vee\mathit{is}_{C_n}(t)}\] +
    +

    + where + + \(C_1,\dots,C_n\) + + are all the constructors of the type of + + \(t\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + DT_CLASH + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Datatypes – Clash + +

    +
    + \[\inferruleSC{\mathit{is}_{C_i}(t), \mathit{is}_{C_j}(t)\mid -}{\bot} +{if $i\neq j$}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SKOLEM_INTRO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Quantifiers – Skolem introduction + +

    +
    + \[\inferrule{-\mid k}{k = t}\] +
    +

    + where + + \(t\) + + is the unpurified form of skolem + + \(k\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + SKOLEMIZE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Quantifiers – Skolemization + +

    +
    + \[\inferrule{\exists x_1\dots x_n.\> F\mid -}{F\sigma}\] +
    +

    + or +

    +
    + \[\inferrule{\neg (\forall x_1\dots x_n.\> F)\mid -}{\neg F\sigma}\] +
    +

    + where + + \(\sigma\) + + maps + + \(x_1,\dots,x_n\) + + to their representative +skolems obtained by + + + SkolemManager::mkSkolemize + + + , returned in the skolems +argument of that method. The witness terms for the returned skolems can be +obtained by + + + SkolemManager::getWitnessForm + + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + INSTANTIATE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Quantifiers – Instantiation + +

    +
    + \[\inferrule{\forall x_1\dots x_n.\> F\mid t_1,\dots,t_n, (id\, (t)?)?} +{F\{x_1\mapsto t_1,\dots,x_n\mapsto t_n\}}\] +
    +

    + The optional argument + + \(id\) + + indicates the inference id that caused the +instantiation. The term + + \(t\) + + indicates an additional term (e.g. the trigger) +associated with the instantiation, which depends on the id. If the id +has prefix + + + QUANTIFIERS_INST_E_MATCHING + + + , then + + \(t\) + + is the trigger that +generated the instantiation. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ALPHA_EQUIV + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Quantifiers – Alpha equivalence + +

    +
    + \[\inferruleSC{-\mid F, y_1=z_1,\dots, y_n=z_n} +{F = F\{y_1\mapsto z_1,\dots,y_n\mapsto z_n\}} +{if $y_1,\dots,y_n, z_1,\dots,z_n$ are unique bound variables}\] +
    +

    + Notice that this rule is correct only when + + \(z_1,\dots,z_n\) + + are not +contained in + + \(FV(F) \setminus \{ y_1,\dots, y_n \}\) + + , where + + \(FV(\varphi)\) + + are the free variables of + + \(\varphi\) + + . The internal +quantifiers proof checker does not currently check that this is the case. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + QUANTIFIERS_PREPROCESS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Quantifiers – (Trusted) quantifiers preprocessing + +

    +
    + \[\inferrule{?\mid F}{F}\] +
    +

    + where + + \(F\) + + is an equality of the form + + \(t = +\texttt{QuantifiersPreprocess::preprocess(t)}\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_EQ + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation equality + +

    +
    + \[\inferrule{(t_1\cdot\ldots \cdot t_n \cdot t) = (t_1 \cdot\ldots +\cdot t_n\cdot s)\mid b}{t = s}\] +
    +

    + where + + \(\cdot\) + + stands for string concatenation and + + \(b\) + + indicates +if the direction is reversed. +

    +

    + Notice that + + \(t\) + + or + + \(s\) + + may be empty, in which case they are +implicit in the concatenation above. For example, if the premise is + + \(x\cdot z = x\) + + , then this rule, with argument + + \(\bot\) + + , concludes + + \(z = ''\) + + . +

    +

    + Also note that constants are split, such that for + + \((\mathsf{'abc'} +\cdot x) = (\mathsf{'a'} \cdot y)\) + + , this rule, with argument + + \(\bot\) + + , +concludes + + \((\mathsf{'bc'} \cdot x) = y\) + + . This splitting is done only +for constants such that + + + Word::splitConstant + + + returns non-null. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_UNIFY + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation unification + +

    +
    + \[\inferrule{(t_1\cdot t_2) = (s_1 \cdot s_2),\, \mathit{len}(t_1) = +\mathit{len}(s_1)\mid b}{t_1 = s_1}\] +
    +

    + where + + \(b\) + + indicates if the direction is reversed. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_CONFLICT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation conflict + +

    +
    + \[\inferrule{(c_1\cdot t) = (c_2 \cdot s)\mid b}{\bot}\] +
    +

    + where + + \(b\) + + indicates if the direction is reversed, + + \(c_1,\,c_2\) + + are constants such that + + \(\texttt{Word::splitConstant}(c_1,c_2, +\mathit{index},b)\) + + is null, in other words, neither is a prefix of the +other. Note it may be the case that one side of the equality denotes the +empty string. +

    +

    + Alternatively, if the equality is between sequences, this rule has the +form: +

    +
    + \[\inferrule{(t_1\cdot t) = (s_1 \cdot s), t_1 \deq s_1 \mid b}{\bot}\] +
    +

    + where t_1 and s_1 are constants of length one, or otherwise one side +of the equality is the empty sequence and t_1 or s_1 corresponding to +that side is the empty sequence. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_SPLIT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation split + +

    +
    + \[\inferruleSC{(t_1\cdot t_2) = (s_1 \cdot s_2),\, +\mathit{len}(t_1) \neq \mathit{len}(s_1)\mid b}{(t_1 = s_1\cdot r_t) +\vee (s_1 = t_1\cdot r_s)}{if $b=\bot$}\] +
    +

    + where + + \(r_t\) + + is + + \(\mathit{skolem}(\mathit{suf}(t_1,\mathit{len}(s_1)))\) + + and + + \(r_s\) + + is + + \(\mathit{skolem}(\mathit{suf}(s_1,\mathit{len}(t_1)))\) + + . +

    +
    + \[\inferruleSC{(t_1\cdot t_2) = (s_1 \cdot s_2),\, +\mathit{len}(t_1) \neq \mathit{len}(s_1)\mid b}{(t_1 = s_1\cdot r_t) +\vee (s_1 = t_1\cdot r_s)}{if $b=\top$}\] +
    +

    + where + + \(r_t\) + + is + + \(\mathit{skolem}(\mathit{pre}(t_2,\mathit{len}(t_2) - +\mathit{len}(s_2)))\) + + and + + \(r_s\) + + is + + \(\mathit{skolem}(\mathit{pre}(s_2,\mathit{len}(s_2) - +\mathit{len}(t_2)))\) + + . +

    +

    + Above, + + \(\mathit{suf}(x,n)\) + + is shorthand for + + \(\mathit{substr}(x,n, \mathit{len}(x) - n)\) + + and + + \(\mathit{pre}(x,n)\) + + is shorthand for + + \(\mathit{substr}(x,0,n)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_CSPLIT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation split for constants + +

    +
    + \[\inferrule{(t_1\cdot t_2) = (c \cdot s_2),\, +\mathit{len}(t_1) \neq 0\mid \bot}{(t_1 = c\cdot r)}\] +
    +

    + where + + \(r\) + + is + + \(\mathit{skolem}(\mathit{suf}(t_1,1))\) + + . +

    +

    + Alternatively for the reverse: +

    +
    + \[\inferrule{(t_1\cdot t_2) = (s_1 \cdot c),\, +\mathit{len}(t_2) \neq 0\mid \top}{(t_2 = r\cdot c)}\] +
    +

    + where + + \(r\) + + is + + \(\mathit{skolem}(\mathit{pre}(t_2,\mathit{len}(t_2) - 1))\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_LPROP + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation length propagation + +

    +
    + \[\inferrule{(t_1\cdot t_2) = (s_1 \cdot s_2),\, +\mathit{len}(t_1) > \mathit{len}(s_1)\mid \bot}{(t_1 = s_1\cdot r_t)}\] +
    +

    + where + + \(r_t\) + + is + + \(\mathit{skolem}(\mathit{suf}(t_1,\mathit{len}(s_1)))\) + + . +

    +

    + Alternatively for the reverse: +

    +
    + \[\inferrule{(t_1\cdot t_2) = (s_1 \cdot s_2),\, +\mathit{len}(t_2) > \mathit{len}(s_2)\mid \top}{(t_2 = r_t\cdot s_2)}\] +
    +

    + where + + \(r_t\) + + is + + \(\mathit{skolem}(\mathit{pre}(t_2,\mathit{len}(t_2) - +\mathit{len}(s_2)))\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + CONCAT_CPROP + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Concatenation constant propagation + +

    +
    + \[\inferrule{(t_1\cdot w_1\cdot t_2) = (w_2 \cdot s),\, +\mathit{len}(t_1) \neq 0\mid \bot}{(t_1 = w_3\cdot r)}\] +
    +

    + where + + \(w_1,\,w_2,\,w_3\) + + are words, + + \(w_3\) + + is + + \(\mathit{pre}(w_2,p)\) + + , + + \(p\) + + is + + \(\texttt{Word::overlap}(\mathit{suf}(w_2,1), w_1)\) + + , and + + \(r\) + + is + + \(\mathit{skolem}(\mathit{suf}(t_1,\mathit{len}(w_3)))\) + + . Note that + + \(\mathit{suf}(w_2,p)\) + + is the largest suffix of + + \(\mathit{suf}(w_2,1)\) + + that can contain a prefix of + + \(w_1\) + + ; since + + \(t_1\) + + is non-empty, + + \(w_3\) + + must therefore be contained in + + \(t_1\) + + . +

    +

    + Alternatively for the reverse: +

    +
    + \[\inferrule{(t_1\cdot w_1\cdot t_2) = (s \cdot w_2),\, +\mathit{len}(t_2) \neq 0\mid \top}{(t_2 = r\cdot w_3)}\] +
    +

    + where + + \(w_1,\,w_2,\,w_3\) + + are words, + + \(w_3\) + + is + + \(\mathit{suf}(w_2, \mathit{len}(w_2) - p)\) + + , + + \(p\) + + is + + \(\texttt{Word::roverlap}(\mathit{pre}(w_2, \mathit{len}(w_2) - 1), +w_1)\) + + , and + + \(r\) + + is + + \(\mathit{skolem}(\mathit{pre}(t_2, +\mathit{len}(t_2) - \mathit{len}(w_3)))\) + + . Note that + + \(\mathit{pre}(w_2, \mathit{len}(w_2) - p)\) + + is the largest prefix of + + \(\mathit{pre}(w_2, \mathit{len}(w_2) - 1)\) + + that can contain a suffix +of + + \(w_1\) + + ; since + + \(t_2\) + + is non-empty, + + \(w_3\) + + must therefore +be contained in + + \(t_2\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_DECOMPOSE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – String decomposition + +

    +
    + \[\inferrule{\mathit{len}(t) \geq n\mid \bot}{t = w_1\cdot w_2 \wedge +\mathit{len}(w_1) = n}\] +
    +

    + or alternatively for the reverse: +

    +
    + \[\inferrule{\mathit{len}(t) \geq n\mid \top}{t = w_1\cdot w_2 \wedge +\mathit{len}(w_2) = n}\] +
    +

    + where + + \(w_1\) + + is + + \(\mathit{skolem}(\mathit{pre}(t,n)\) + + and + + \(w_2\) + + is + + \(\mathit{skolem}(\mathit{suf}(t,n)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_LENGTH_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Length positive + +

    +
    + \[\inferrule{-\mid t}{(\mathit{len}(t) = 0\wedge t= '')\vee \mathit{len}(t) +> 0}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_LENGTH_NON_EMPTY + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Core rules – Length non-empty + +

    +
    + \[\inferrule{t\neq ''\mid -}{\mathit{len}(t) \neq 0}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_REDUCTION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Extended functions – Reduction + +

    +
    + \[\inferrule{-\mid t}{R\wedge t = w}\] +
    +

    + where + + \(w\) + + is + + \(\texttt{strings::StringsPreprocess::reduce}(t, R, +\dots)\) + + . In other words, + + \(R\) + + is the reduction predicate for extended +term + + \(t\) + + , and + + \(w\) + + is + + \(skolem(t)\) + + . +

    +

    + Notice that the free variables of + + \(R\) + + are + + \(w\) + + and the free +variables of + + \(t\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_EAGER_REDUCTION + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Extended functions – Eager reduction + +

    +
    + \[\inferrule{-\mid t}{R}\] +
    +

    + where + + \(R\) + + is + + \(\texttt{strings::TermRegistry::eagerReduce}(t)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RE_INTER + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Regular expressions – Intersection + +

    +
    + \[\inferrule{t\in R_1,\,t\in R_2\mid -}{t\in \mathit{inter}(R_1,R_2)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RE_UNFOLD_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Regular expressions – Positive Unfold + +

    +
    + \[\inferrule{t\in R\mid -}{\texttt{RegExpOpr::reduceRegExpPos}(t\in R)}\] +
    +

    + corresponding to the one-step unfolding of the premise. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RE_UNFOLD_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Regular expressions – Negative Unfold + +

    +
    + \[\inferrule{t\not\in R\mid -}{\texttt{RegExpOpr::reduceRegExpNeg}(t\not\in R)}\] +
    +

    + corresponding to the one-step unfolding of the premise. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RE_UNFOLD_NEG_CONCAT_FIXED + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Regular expressions – Unfold negative concatenation, fixed + +

    +
    + \[\inferrule{t\not\in R\mid +-}{\texttt{RegExpOpr::reduceRegExpNegConcatFixed}(t\not\in R,L,i)}\] +
    +

    + where + + \(\texttt{RegExpOpr::getRegExpConcatFixed}(t\not\in R, i) = L\) + + , +corresponding to the one-step unfolding of the premise, optimized for fixed +length of component + + \(i\) + + of the regular expression concatenation + + \(R\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + RE_ELIM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Regular expressions – Elimination + +

    +
    + \[\inferrule{-\mid F,b}{F = +\texttt{strings::RegExpElimination::eliminate}(F, b)}\] +
    +

    + where + + \(b\) + + is a Boolean indicating whether we are using aggressive +eliminations. Notice this rule concludes + + \(F = F\) + + if no eliminations +are performed for + + \(F\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_CODE_INJ + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Code points + +

    +
    + \[\inferrule{-\mid t,s}{\mathit{to\_code}(t) = -1 \vee \mathit{to\_code}(t) \neq +\mathit{to\_code}(s) \vee t\neq s}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_SEQ_UNIT_INJ + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – Sequence unit + +

    +
    + \[\inferrule{\mathit{unit}(x) = \mathit{unit}(y)\mid -}{x = y}\] +
    +

    + Also applies to the case where + + \(\mathit{unit}(y)\) + + is a constant +sequence of length one. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + STRING_INFERENCE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Strings – (Trusted) String inference + +

    +
    + \[\inferrule{?\mid F,\mathit{id},\mathit{isRev},\mathit{exp}}{F}\] +
    +

    + used to bookkeep an inference that has not yet been converted via + + \(\texttt{strings::InferProofCons::convert}\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + MACRO_ARITH_SCALE_SUM_UB + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Adding inequalities + +

    +

    + An arithmetic literal is a term of the form + + \(p \diamond c\) + + where + + \(\diamond \in \{ <, \leq, =, \geq, > \}\) + + , + + \(p\) + + a +polynomial and + + \(c\) + + a rational constant. +

    +
    + \[\inferrule{l_1 \dots l_n \mid k_1 \dots k_n}{t_1 \diamond t_2}\] +
    +

    + where + + \(k_i \in \mathbb{R}, k_i \neq 0\) + + , + + \(\diamond\) + + is the +fusion of the + + \(\diamond_i\) + + (flipping each if its + + \(k_i\) + + is +negative) such that + + \(\diamond_i \in \{ <, \leq \}\) + + (this implies that +lower bounds have negative + + \(k_i\) + + and upper bounds have positive + + \(k_i\) + + ), + + \(t_1\) + + is the sum of the scaled polynomials and + + \(t_2\) + + is the sum of the scaled constants: +

    +
    + \[ \begin{align}\begin{aligned}t_1 \colon= k_1 \cdot p_1 + \cdots + k_n \cdot p_n\\t_2 \colon= k_1 \cdot c_1 + \cdots + k_n \cdot c_n\end{aligned}\end{align} \] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_SUM_UB + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Sum upper bounds + +

    +
    + \[\inferrule{P_1 \dots P_n \mid -}{L \diamond R}\] +
    +

    + where + + \(P_i\) + + has the form + + \(L_i \diamond_i R_i\) + + and + + \(\diamond_i \in \{<, \leq, =\}\) + + . Furthermore + + \(\diamond = <\) + + if + + \(\diamond_i = <\) + + for any + + \(i\) + + and + + \(\diamond = \leq\) + + otherwise, + + \(L = L_1 + \cdots + L_n\) + + and + + \(R = R_1 + \cdots + R_n\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + INT_TIGHT_UB + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Tighten strict integer upper bounds + +

    +
    + \[\inferrule{i < c \mid -}{i \leq \lfloor c \rfloor}\] +
    +

    + where + + \(i\) + + has integer type. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + INT_TIGHT_LB + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Tighten strict integer lower bounds + +

    +
    + \[\inferrule{i > c \mid -}{i \geq \lceil c \rceil}\] +
    +

    + where + + \(i\) + + has integer type. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRICHOTOMY + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Trichotomy of the reals + +

    +
    + \[\inferrule{A, B \mid C}{C}\] +
    +

    + where + + \(\neg A, \neg B, C\) + + are + + \(x < c, x = c, x > c\) + + in some order. +Note that + + \(\neg\) + + here denotes arithmetic negation, i.e., flipping + + \(\geq\) + + to + + \(<\) + + etc. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_OP_ELIM_AXIOM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Operator elimination + +

    +
    + \[\inferrule{- \mid t}{\texttt{arith::OperatorElim::getAxiomFor(t)}}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_POLY_NORM + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Polynomial normalization + +

    +
    + \[\inferrule{- \mid t = s}{t = s}\] +
    +

    + where + + \(\texttt{arith::PolyNorm::isArithPolyNorm(t, s)} = \top\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_MULT_SIGN + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Sign inference + +

    +
    + \[\inferrule{- \mid f_1 \dots f_k, m}{(f_1 \land \dots \land f_k) \rightarrow m \diamond 0}\] +
    +

    + where + + \(f_1 \dots f_k\) + + are variables compared to zero (less, greater +or not equal), + + \(m\) + + is a monomial from these variables and + + \(\diamond\) + + is the comparison (less or equal) that results from the +signs of the variables. All variables with even exponent in + + \(m\) + + should be given as not equal to zero while all variables with odd exponent +in + + \(m\) + + should be given as less or greater than zero. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_MULT_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Multiplication with positive factor + +

    +
    + \[\inferrule{- \mid m, l \diamond r}{(m > 0 \land l \diamond r) \rightarrow m \cdot l \diamond m \cdot r}\] +
    +

    + where + + \(\diamond\) + + is a relation symbol. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_MULT_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Multiplication with negative factor + +

    +
    + \[\inferrule{- \mid m, l \diamond r}{(m < 0 \land l \diamond r) \rightarrow m \cdot l \diamond_{inv} m \cdot r}\] +
    +

    + where + + \(\diamond\) + + is a relation symbol and + + \(\diamond_{inv}\) + + the +inverted relation symbol. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_MULT_TANGENT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Multiplication tangent plane + +

    +
    + \[ \begin{align}\begin{aligned}\inferruleSC{- \mid t, x, y, a, b, \sigma}{(t \leq tplane) \leftrightarrow ((x \leq a \land y \geq b) \lor (x \geq a \land y \leq b))}{if $\sigma = -1$}\\\inferruleSC{- \mid t, x, y, a, b, \sigma}{(t \geq tplane) \leftrightarrow ((x \leq a \land y \leq b) \lor (x \geq a \land y \geq b))}{if $\sigma = 1$}\end{aligned}\end{align} \] +
    +

    + where + + \(x,y\) + + are real terms (variables or extended terms), + + \(t = x \cdot y\) + + (possibly under rewriting), + + \(a,b\) + + are real +constants, + + \(\sigma \in \{ 1, -1\}\) + + and + + \(tplane := b \cdot x + a \cdot y - a \cdot b\) + + is the tangent plane of + + \(x \cdot y\) + + at + + \((a,b)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_PI + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Assert bounds on Pi + +

    +
    + \[\inferrule{- \mid l, u}{\texttt{real.pi} \geq l \land \texttt{real.pi} +\leq u}\] +
    +

    + where + + \(l,u\) + + are valid lower and upper bounds on + + \(\pi\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp at negative values + +

    +
    + \[\inferrule{- \mid t}{(t < 0) \leftrightarrow (\exp(t) < 1)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_POSITIVITY + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp is always positive + +

    +
    + \[\inferrule{- \mid t}{\exp(t) > 0}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_SUPER_LIN + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp grows super-linearly for positive +values + +

    +
    + \[\inferrule{- \mid t}{t \leq 0 \lor \exp(t) > t+1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_ZERO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp at zero + +

    +
    + \[\inferrule{- \mid t}{(t=0) \leftrightarrow (\exp(t) = 1)}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_APPROX_ABOVE_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp is approximated from above for +negative values + +

    +
    + \[\inferrule{- \mid d,t,l,u}{(t \geq l \land t \leq u) \rightarrow exp(t) +\leq \texttt{secant}(\exp, l, u, t)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term +and + + \(l,u\) + + are lower and upper bounds on + + \(t\) + + . Let + + \(p\) + + be +the + + \(d\) + + ’th taylor polynomial at zero (also called the Maclaurin +series) of the exponential function. + + \(\texttt{secant}(\exp, l, u, t)\) + + denotes the secant of + + \(p\) + + from + + \((l, \exp(l))\) + + to + + \((u, +\exp(u))\) + + evaluated at + + \(t\) + + , calculated as follows: +

    +
    + \[\frac{p(l) - p(u)}{l - u} \cdot (t - l) + p(l)\] +
    +

    + The lemma states that if + + \(t\) + + is between + + \(l\) + + and + + \(u\) + + , then + + \(\exp(t\) + + is below the secant of + + \(p\) + + from + + \(l\) + + to + + \(u\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_APPROX_ABOVE_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp is approximated from above for +positive values + +

    +
    + \[\inferrule{- \mid d,t,l,u}{(t \geq l \land t \leq u) \rightarrow exp(t) +\leq \texttt{secant-pos}(\exp, l, u, t)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term +and + + \(l,u\) + + are lower and upper bounds on + + \(t\) + + . Let + + \(p^*\) + + be +a modification of the + + \(d\) + + ’th taylor polynomial at zero (also called +the Maclaurin series) of the exponential function as follows where + + \(p(d-1)\) + + is the regular Maclaurin series of degree + + \(d-1\) + + : +

    +
    + \[p^* := p(d-1) \cdot \frac{1 + t^n}{n!}\] +
    +

    + + \(\texttt{secant-pos}(\exp, l, u, t)\) + + denotes the secant of + + \(p\) + + from + + \((l, \exp(l))\) + + to + + \((u, \exp(u))\) + + evaluated at + + \(t\) + + , +calculated as follows: +

    +
    + \[\frac{p(l) - p(u)}{l - u} \cdot (t - l) + p(l)\] +
    +

    + The lemma states that if + + \(t\) + + is between + + \(l\) + + and + + \(u\) + + , then + + \(\exp(t\) + + is below the secant of + + \(p\) + + from + + \(l\) + + to + + \(u\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_EXP_APPROX_BELOW + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Exp is approximated from below + +

    +
    + \[\inferrule{- \mid d,c,t}{t \geq c \rightarrow exp(t) \geq \texttt{maclaurin}(\exp, d, c)}\] +
    +

    + where + + \(d\) + + is an odd positive number, + + \(t\) + + an arithmetic term and + + \(\texttt{maclaurin}(\exp, d, c)\) + + is the + + \(d\) + + ’th taylor +polynomial at zero (also called the Maclaurin series) of the exponential +function evaluated at + + \(c\) + + . The Maclaurin series for the exponential +function is the following: +

    +
    + \[\exp(x) = \sum_{n=0}^{\infty} \frac{x^n}{n!}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_BOUNDS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is always between -1 and 1 + +

    +
    + \[\inferrule{- \mid t}{\sin(t) \leq 1 \land \sin(t) \geq -1}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_SHIFT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is shifted to -pi…pi + +

    +
    + \[\inferrule{- \mid x, y, s}{-\pi \leq y \leq \pi \land \sin(y) = \sin(x) +\land (\ite{-\pi \leq x \leq \pi}{x = y}{x = y + 2 \pi s})}\] +
    +

    + where + + \(x\) + + is the argument to sine, + + \(y\) + + is a new real skolem +that is + + \(x\) + + shifted into + + \(-\pi \dots \pi\) + + and + + \(s\) + + is a +new integer slolem that is the number of phases + + \(y\) + + is shifted. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_SYMMETRY + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is symmetric with respect to +negation of the argument + +

    +
    + \[\inferrule{- \mid t}{\sin(t) - \sin(-t) = 0}\] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_TANGENT_ZERO + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is bounded by the tangent at zero + +

    +
    + \[\inferrule{- \mid t}{(t > 0 \rightarrow \sin(t) < t) \land (t < 0 +\rightarrow \sin(t) > t)} \] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_TANGENT_PI + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is bounded by the tangents at -pi +and pi + +

    +
    + \[\inferrule{- \mid t}{(t > -\pi \rightarrow \sin(t) > -\pi - t) \land (t < +\pi \rightarrow \sin(t) < \pi - t)} \] +
    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_APPROX_ABOVE_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is approximated from above for +negative values + +

    +
    + \[\inferrule{- \mid d,t,lb,ub,l,u}{(t \geq lb land t \leq ub) \rightarrow +\sin(t) \leq \texttt{secant}(\sin, l, u, t)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term, + + \(lb,ub\) + + are symbolic lower and upper bounds on + + \(t\) + + (possibly +containing + + \(\pi\) + + ) and + + \(l,u\) + + the evaluated lower and upper +bounds on + + \(t\) + + . Let + + \(p\) + + be the + + \(d\) + + ’th taylor polynomial at +zero (also called the Maclaurin series) of the sine function. + + \(\texttt{secant}(\sin, l, u, t)\) + + denotes the secant of + + \(p\) + + from + + \((l, \sin(l))\) + + to + + \((u, \sin(u))\) + + evaluated at + + \(t\) + + , +calculated as follows: +

    +
    + \[\frac{p(l) - p(u)}{l - u} \cdot (t - l) + p(l)\] +
    +

    + The lemma states that if + + \(t\) + + is between + + \(l\) + + and + + \(u\) + + , then + + \(\sin(t)\) + + is below the secant of + + \(p\) + + from + + \(l\) + + to + + \(u\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_APPROX_ABOVE_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is approximated from above for +positive values + +

    +
    + \[\inferrule{- \mid d,t,c,lb,ub}{(t \geq lb land t \leq ub) \rightarrow +\sin(t) \leq \texttt{upper}(\sin, c)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term, + + \(c\) + + an arithmetic constant and + + \(lb,ub\) + + are symbolic lower and +upper bounds on + + \(t\) + + (possibly containing + + \(\pi\) + + ). Let + + \(p\) + + be the + + \(d\) + + ’th taylor polynomial at zero (also called the Maclaurin +series) of the sine function. + + \(\texttt{upper}(\sin, c)\) + + denotes the +upper bound on + + \(\sin(c)\) + + given by + + \(p\) + + and + + \(lb,up\) + + such +that + + \(\sin(t)\) + + is the maximum of the sine function on + + \((lb,ub)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_APPROX_BELOW_NEG + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is approximated from below for +negative values + +

    +
    + \[\inferrule{- \mid d,t,c,lb,ub}{(t \geq lb land t \leq ub) \rightarrow +\sin(t) \geq \texttt{lower}(\sin, c)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term, + + \(c\) + + an arithmetic constant and + + \(lb,ub\) + + are symbolic lower and +upper bounds on + + \(t\) + + (possibly containing + + \(\pi\) + + ). Let + + \(p\) + + be the + + \(d\) + + ’th taylor polynomial at zero (also called the Maclaurin +series) of the sine function. + + \(\texttt{lower}(\sin, c)\) + + denotes the +lower bound on + + \(\sin(c)\) + + given by + + \(p\) + + and + + \(lb,up\) + + such +that + + \(\sin(t)\) + + is the minimum of the sine function on + + \((lb,ub)\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_TRANS_SINE_APPROX_BELOW_POS + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Transcendentals – Sine is approximated from below for +positive values + +

    +
    + \[\inferrule{- \mid d,t,lb,ub,l,u}{(t \geq lb land t \leq ub) \rightarrow +\sin(t) \geq \texttt{secant}(\sin, l, u, t)}\] +
    +

    + where + + \(d\) + + is an even positive number, + + \(t\) + + an arithmetic term, + + \(lb,ub\) + + are symbolic lower and upper bounds on + + \(t\) + + (possibly +containing + + \(\pi\) + + ) and + + \(l,u\) + + the evaluated lower and upper +bounds on + + \(t\) + + . Let + + \(p\) + + be the + + \(d\) + + ’th taylor polynomial at +zero (also called the Maclaurin series) of the sine function. + + \(\texttt{secant}(\sin, l, u, t)\) + + denotes the secant of + + \(p\) + + from + + \((l, \sin(l))\) + + to + + \((u, \sin(u))\) + + evaluated at + + \(t\) + + , +calculated as follows: +

    +
    + \[\frac{p(l) - p(u)}{l - u} \cdot (t - l) + p(l)\] +
    +

    + The lemma states that if + + \(t\) + + is between + + \(l\) + + and + + \(u\) + + , then + + \(\sin(t)\) + + is above the secant of + + \(p\) + + from + + \(l\) + + to + + \(u\) + + . +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_NL_COVERING_DIRECT + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Coverings – Direct conflict + +

    +

    + We use + + \(\texttt{IRP}_k(poly)\) + + for an IndexedRootPredicate that is +defined as the + + \(k\) + + ’th root of the polynomial + + \(poly\) + + . Note that + + \(poly\) + + may not be univariate; in this case, the value of + + \(\texttt{IRP}_k(poly)\) + + can only be calculated with respect to a +(partial) model for all but one variable of + + \(poly\) + + . +

    +

    + A formula + + \(\texttt{Interval}(x_i)\) + + describes that a variable + + \(x_i\) + + is within a particular interval whose bounds are given as IRPs. +It is either an open interval or a point interval: +

    +
    + \[ \begin{align}\begin{aligned}\texttt{IRP}_k(poly) < x_i < \texttt{IRP}_k(poly)\\x_i = \texttt{IRP}_k(poly)\end{aligned}\end{align} \] +
    +

    + A formula + + \(\texttt{Cell}(x_1 \dots x_i)\) + + describes a portion +of the real space in the following form: +

    +
    + \[\texttt{Interval}(x_1) \land \dots \land \texttt{Interval}(x_i)\] +
    +

    + A cell can also be empty (for + + \(i = 0\) + + ). +

    +

    + A formula + + \(\texttt{Covering}(x_i)\) + + is a set of intervals, implying +that + + \(x_i\) + + can be in neither of these intervals. To be a covering (of +the real line), the union of these intervals should be the real numbers. +

    +
    + \[\inferrule{\texttt{Cell}, A \mid -}{\bot}\] +
    +

    + A direct interval is generated from an assumption + + \(A\) + + (in variables + + \(x_1 \dots x_i\) + + ) over a + + \(\texttt{Cell}(x_1 \dots x_i)\) + + . It +derives that + + \(A\) + + evaluates to false over the cell. In the actual +algorithm, it means that + + \(x_i\) + + can not be in the topmost interval of +the cell. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ARITH_NL_COVERING_RECURSIVE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + Arithmetic – Coverings – Recursive interval + +

    +

    + See + + + + ARITH_NL_COVERING_DIRECT + + + + for the necessary definitions. +

    +
    + \[\inferrule{\texttt{Cell}, \texttt{Covering} \mid -}{\bot}\] +
    +

    + A recursive interval is generated from + + \(\texttt{Covering}(x_i)\) + + over + + \(\texttt{Cell}(x_1 \dots x_{i-1})\) + + . It generates the conclusion that +no + + \(x_i\) + + exists that extends the cell and satisfies all assumptions. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + LFSC_RULE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + External – LFSC + +

    +

    + Place holder for LFSC rules. +

    +
    + \[\inferrule{P_1, \dots, P_n\mid \texttt{id}, Q, A_1,\dots, A_m}{Q}\] +
    +

    + Note that the premises and arguments are arbitrary. It’s expected that + + \(\texttt{id}\) + + refer to a proof rule in the external LFSC calculus. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + ALETHE_RULE + + + + + ¶ + +
    +
    +
    +

    +

    +

    +

    +

    + + External – Alethe + +

    +

    + Place holder for Alethe rules. +

    +
    + \[\inferrule{P_1, \dots, P_n\mid \texttt{id}, Q, Q', A_1,\dots, A_m}{Q}\] +
    +

    + Note that the premises and arguments are arbitrary. It’s expected that + + \(\texttt{id}\) + + refer to a proof rule in the external Alethe calculus, +and that + + \(Q'\) + + be the representation of Q to be printed by the Alethe +printer. +

    +
    +
    +
    +
    + + + + + + + + + enumerator + + + + + + + + UNKNOWN + + + + + ¶ + +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/proofs/proofs.html b/cvc5-1.0.2/proofs/proofs.html new file mode 100644 index 0000000..1f2f6d5 --- /dev/null +++ b/cvc5-1.0.2/proofs/proofs.html @@ -0,0 +1,288 @@ + + + + + + + + Proof production — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Proof production +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Proof production + + ¶ + +

    +

    + cvc5 produces proofs in an internal proof calculus that faithfully reflects its +reasoning. Here is a comprehensive description of the + + + proof rules + + + . +

    +
    +
    +

    + Optionally cvc5 can convert and output its internal proofs into the following +external formats: +

    +
    + +
    +

    + where note that the DOT format is only meant for visualization. +

    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/references.html b/cvc5-1.0.2/references.html new file mode 100644 index 0000000..5b251e0 --- /dev/null +++ b/cvc5-1.0.2/references.html @@ -0,0 +1,550 @@ + + + + + + + + References — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + References +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + References + + ¶ + +

    +
    +
    + + + [ + + AFGregoire+11 + + ] + + +

    + Michaël Armand, Germain Faure, Benjamin Grégoire, Chantal Keller, Laurent Théry, and Benjamin Werner. A modular integration of SAT\slash SMT solvers to Coq through proof witnesses. In Jean-Pierre Jouannaud and Zhong Shao, editors, + + Certified Programs and Proofs (CPP) + + , volume 7086 of Lecture Notes in Computer Science, 135–150. Springer, 2011. + + doi:10.1007/978-3-642-25379-9_12 + + . +

    +
    +
    + + + [ + + BBRT17 + + ] + + +

    + Kshitij Bansal, Clark W. Barrett, Andrew Reynolds, and Cesare Tinelli. A new decision procedure for finite sets and cardinality constraints in SMT. + + CoRR + + , 2017. + + arXiv:1702.06259 + + . +

    +
    +
    + + + [ + + BBFF20 + + ] + + +

    + Haniel Barbosa, Jasmin Christian Blanchette, Mathias Fleury, and Pascal Fontaine. Scalable fine-grained proofs for formula processing. + + Journal of Automated Reasoning + + , 64(3):485–510, 2020. URL: + + https://doi.org/10.1007/s10817-018-09502-y + + , + + doi:10.1007/s10817-018-09502-y + + . +

    +
    +
    + + + [ + + BFT17 + + ] + + +

    + Clark Barrett, Pascal Fontaine, and Cesare Tinelli. The SMT-LIB Standard: Version 2.6. Technical Report, Department of Computer Science, The University of Iowa, 2017. Available at \tt www.SMT-LIB.org. +

    +
    +
    + + + [ + + BST07 + + ] + + +

    + Clark W. Barrett, Igor Shikanian, and Cesare Tinelli. An abstract decision procedure for a theory of inductive data types. + + J. Satisf. Boolean Model. Comput. + + , 3(1-2):21–46, 2007. + + doi:10.3233/sat190028 + + . +

    +
    +
    + + + [ + + BdODeharbeF09 + + ] + + +

    + Thomas Bouton, Diego Caminha B. de Oliveira, David Déharbe, and Pascal Fontaine. veriT: An Open, Trustable and Efficient SMT-Solver. In Renate A. Schmidt, editor, + + Conference on Automated Deduction (CADE) + + , volume 5663 of Lecture Notes in Computer Science, 151–156. Springer, 2009. URL: + + http://dx.doi.org/10.1007/978-3-642-02959-2_12 + + , + + doi:10.1007/978-3-642-02959-2_12 + + . +

    +
    +
    + + + [ + + CGI+18 + + ] + + +

    + Alessandro Cimatti, Alberto Griggio, Ahmed Irfan, Marco Roveri, and Roberto Sebastiani. Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions. + + ACM Trans. Comput. Log. + + , 19(3):19:1–19:52, 2018. + + doi:10.1145/3230639 + + . +

    +
    +
    + + + [ + + EMT+17 + + ] + + +

    + Burak Ekici, Alain Mebsout, Cesare Tinelli, Chantal Keller, Guy Katz, Andrew Reynolds, and Clark W. Barrett. Smtcoq: A plug-in for integrating SMT solvers into coq. In Rupak Majumdar and Viktor Kuncak, editors, + + Computer Aided Verification (CAV) + + , volume 10427 of Lecture Notes in Computer Science, 126–133. Springer, 2017. URL: + + https://doi.org/10.1007/978-3-319-63390-9_7 + + , + + doi:10.1007/978-3-319-63390-9_7 + + . +

    +
    +
    + + + [ + + IEE19 + + ] + + +

    + IEEE. IEEE Standard for Floating-Point Arithmetic. + + IEEE Std 754-2019 (Revision of IEEE 754-2008) + + , pages 1–84, 2019. + + doi:10.1109/IEEESTD.2019.8766229 + + . +

    +
    +
    + + + [ + + MRTB17 + + ] + + +

    + Baoluo Meng, Andrew Reynolds, Cesare Tinelli, and Clark W. Barrett. Relational constraint solving in SMT. In Leonardo de Moura, editor, + + Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings + + , volume 10395 of Lecture Notes in Computer Science, 148–165. Springer, 2017. + + doi:10.1007/978-3-319-63046-5_10 + + . +

    +
    +
    + + + [ + + RB15 + + ] + + +

    + Andrew Reynolds and Jasmin Christian Blanchette. A decision procedure for (co)datatypes in SMT solvers. In Amy P. Felty and Aart Middeldorp, editors, + + Automated Deduction - CADE-25 - 25th International Conference on Automated Deduction, Berlin, Germany, August 1-7, 2015, Proceedings + + , volume 9195 of Lecture Notes in Computer Science, 197–213. Springer, 2015. + + doi:10.1007/978-3-319-21401-6_13 + + . +

    +
    +
    + + + [ + + RISK16 + + ] + + +

    + Andrew Reynolds, Radu Iosif, Cristina Serban, and Tim King. A decision procedure for separation logic in SMT. In Cyrille Artho, Axel Legay, and Doron Peled, editors, + + Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Chiba, Japan, October 17-20, 2016, Proceedings + + , volume 9938 of Lecture Notes in Computer Science, 244–261. 2016. + + doi:10.1007/978-3-319-46520-3_16 + + . +

    +
    +
    + + + [ + + SFD21 + + ] + + +

    + Hans-Jörg Schurr, Mathias Fleury, and Martin Desharnais. Reliable reconstruction of fine-grained proofs in a proof assistant. In André Platzer and Geoff Sutcliffe, editors, + + Conference on Automated Deduction (CADE) + + , volume 12699 of Lecture Notes in Computer Science, 450–467. Springer, 2021. URL: + + https://doi.org/10.1007/978-3-030-79876-5_26 + + , + + doi:10.1007/978-3-030-79876-5_26 + + . +

    +
    +
    + + + [ + + SOR+13 + + ] + + +

    + Aaron Stump, Duckki Oe, Andrew Reynolds, Liana Hadarean, and Cesare Tinelli. SMT proof checking using a logical framework. + + Formal Methods Syst. Des. + + , 42(1):91–118, 2013. URL: + + https://doi.org/10.1007/s10703-012-0163-3 + + , + + doi:10.1007/s10703-012-0163-3 + + . +

    +
    +
    +
    +
    +
    +
    + +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/resource-limits.html b/cvc5-1.0.2/resource-limits.html new file mode 100644 index 0000000..ad7eb53 --- /dev/null +++ b/cvc5-1.0.2/resource-limits.html @@ -0,0 +1,437 @@ + + + + + + + + Resource limits — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Resource limits +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Resource limits + + ¶ + +

    +

    + cvc5 supports limiting the time or + + resources + + it uses during solving via the options + + + tlimit + + + , + + + tlimit-per + + + , + + + rlimit + + + , and + + + rlimit-per + + + . +All these options take a single non-negative number as an argument where giving zero explicitly disables the respective limit. For time limits the number is interpreted as the number of milliseconds, and for resource limits it indicates the amount of + + resources + + . +

    +

    + The limits configured using + + + tlimit + + + and + + + rlimit + + + restrict time and resource usage over the whole lifetime of the + + + + solver + + + + object, respectively. +In contrast to that, + + + tlimit-per + + + and + + + rlimit-per + + + apply to every check individually ( + + + + checkSat + + + + , + + + + checkSatAssuming + + + + , etc). +

    +

    + Except for the overall time limit (see below), the limits are checked by cvc5 itself. This means that the solver remains in a safe state after a limit has been reached. +Due to the way cvc5 checks these limits (see below), cvc5 may not precisely honor per-call time limits: if a subroutine requires a long time to finish without spending resources itself, cvc5 only realizes afterwards that the timeout has (long) passed. +

    +
    +

    + Overall time limit ( + + + tlimit + + + option) + + ¶ + +

    +

    + The + + + tlimit + + + option limits the overall running time of the cvc5 solver binary. +It is implemented using an asynchronous interrupt that is usually managed by the operating system (using + + + setitimer + + + ). +When this interrupt occurs, cvc5 outputs a corresponding message, prints the current statistics and immediately terminates its process. The same is done when an external resource limiting mechanism is in place, for example + + + ulimit + + + . +

    +

    + This mechanism is inherently unsuited when cvc5 is used within another application process via one of its APIs: therefore, it is only honored when running as a standalone binary. +Setting + + + tlimit + + + via the API or the + + + (set-option) + + + SMT-LIB command has thus no effect. +

    +
    +
    +

    + Resource manager and resource spending + + ¶ + +

    +

    + All other limits are enforced centrally by the resource manager as follows. +Whenever certain parts of the solver execute, they instruct the resource manager to + + spend + + a resource. +As soon as the resource manager realizes that some limit is exhausted (either the resource limit or the per-check time limit is reached), it asynchronously instructs the core solver to interrupt the check. +To not invalidate the internal state of the solver, and allow to use it again after an interrupt, the solver continues its work until it reaches a safe point in one of the core solving components. +Then, it returns + + unknown + + (with an + + + + explanation + + + + ). +

    +

    + The intention of a resource limit is to be a deterministic measure that grows (linearly, if possible) with actual running time. +Resources are spent when lemmas are generated and during a few select events like preprocessing, rewriting, decisions and restarts in the SAT solver, or theory checks. +In case the resource spending does not properly reflect the running time, the weights of the individual resources can be modified using the + + + rweight + + + option, for example with + + + --rweight=RestartStep=5 + + + . +

    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/search.html b/cvc5-1.0.2/search.html new file mode 100644 index 0000000..fa46792 --- /dev/null +++ b/cvc5-1.0.2/search.html @@ -0,0 +1,225 @@ + + + + + + + Search — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Search +
    • +
    • +
    • +
    +
    +
    +
    +
    + +
    +
    +
    +
    + +
    +
    +
    +
    + + + + + \ No newline at end of file diff --git a/cvc5-1.0.2/searchindex.js b/cvc5-1.0.2/searchindex.js new file mode 100644 index 0000000..0e31617 --- /dev/null +++ b/cvc5-1.0.2/searchindex.js @@ -0,0 +1 @@ +Search.setIndex({"docnames": ["api/api", "api/cpp/cpp", "api/cpp/datatype", "api/cpp/datatypeconstructor", "api/cpp/datatypeconstructordecl", "api/cpp/datatypedecl", "api/cpp/datatypeselector", "api/cpp/driveroptions", "api/cpp/exceptions", "api/cpp/grammar", "api/cpp/kind", "api/cpp/modes", "api/cpp/op", "api/cpp/optioninfo", "api/cpp/quickstart", "api/cpp/result", "api/cpp/roundingmode", "api/cpp/solver", "api/cpp/sort", "api/cpp/statistics", "api/cpp/synthresult", "api/cpp/term", "api/cpp/unknownexplanation", "api/java/index", "api/java/java", "api/java/quickstart", "api/python/base/datatype", "api/python/base/datatypeconstructor", "api/python/base/datatypeconstructordecl", "api/python/base/datatypedecl", "api/python/base/datatypeselector", "api/python/base/grammar", "api/python/base/kind", "api/python/base/op", "api/python/base/python", "api/python/base/quickstart", "api/python/base/result", "api/python/base/roundingmode", "api/python/base/solver", "api/python/base/sort", "api/python/base/statistics", "api/python/base/synthresult", "api/python/base/term", "api/python/base/unknownexplanation", "api/python/python", "api/python/pythonic/arith", "api/python/pythonic/array", "api/python/pythonic/bitvec", "api/python/pythonic/boolean", "api/python/pythonic/dt", "api/python/pythonic/fp", "api/python/pythonic/internals", "api/python/pythonic/pythonic", "api/python/pythonic/quant", "api/python/pythonic/quickstart", "api/python/pythonic/set", "api/python/pythonic/solver", "binary/binary", "binary/quickstart", "examples/bags", "examples/bitvectors", "examples/bitvectors_and_arrays", "examples/combination", "examples/datatypes", "examples/examples", "examples/exceptions", "examples/extract", "examples/floatingpoint", "examples/helloworld", "examples/lineararith", "examples/quickstart", "examples/relations", "examples/sequences", "examples/sets", "examples/strings", "examples/sygus-fun", "examples/sygus-grammar", "examples/sygus-inv", "genindex", "index", "installation/installation", "options", "output-tags", "proofs/output_alethe", "proofs/output_dot", "proofs/output_lfsc", "proofs/proof_rules", "proofs/proofs", "references", "resource-limits", "statistics", "theories/bags", "theories/datatypes", "theories/separation-logic", "theories/sequences", "theories/sets-and-relations", "theories/strings", "theories/theories", "theories/transcendentals"], "filenames": ["api/api.rst", "api/cpp/cpp.rst", "api/cpp/datatype.rst", "api/cpp/datatypeconstructor.rst", "api/cpp/datatypeconstructordecl.rst", "api/cpp/datatypedecl.rst", "api/cpp/datatypeselector.rst", "api/cpp/driveroptions.rst", "api/cpp/exceptions.rst", "api/cpp/grammar.rst", "api/cpp/kind.rst", "api/cpp/modes.rst", "api/cpp/op.rst", "api/cpp/optioninfo.rst", "api/cpp/quickstart.rst", "api/cpp/result.rst", "api/cpp/roundingmode.rst", "api/cpp/solver.rst", "api/cpp/sort.rst", "api/cpp/statistics.rst", "api/cpp/synthresult.rst", "api/cpp/term.rst", "api/cpp/unknownexplanation.rst", "api/java/index.rst", "api/java/java.rst", "api/java/quickstart.rst", "api/python/base/datatype.rst", "api/python/base/datatypeconstructor.rst", "api/python/base/datatypeconstructordecl.rst", "api/python/base/datatypedecl.rst", "api/python/base/datatypeselector.rst", "api/python/base/grammar.rst", "api/python/base/kind.rst", "api/python/base/op.rst", "api/python/base/python.rst", "api/python/base/quickstart.rst", "api/python/base/result.rst", "api/python/base/roundingmode.rst", "api/python/base/solver.rst", "api/python/base/sort.rst", "api/python/base/statistics.rst", "api/python/base/synthresult.rst", "api/python/base/term.rst", "api/python/base/unknownexplanation.rst", "api/python/python.rst", "api/python/pythonic/arith.rst", "api/python/pythonic/array.rst", "api/python/pythonic/bitvec.rst", "api/python/pythonic/boolean.rst", "api/python/pythonic/dt.rst", "api/python/pythonic/fp.rst", "api/python/pythonic/internals.rst", "api/python/pythonic/pythonic.rst", "api/python/pythonic/quant.rst", "api/python/pythonic/quickstart.rst", "api/python/pythonic/set.rst", "api/python/pythonic/solver.rst", "binary/binary.rst", "binary/quickstart.rst", "examples/bags.rst", "examples/bitvectors.rst", "examples/bitvectors_and_arrays.rst", "examples/combination.rst", "examples/datatypes.rst", "examples/examples.rst", "examples/exceptions.rst", "examples/extract.rst", "examples/floatingpoint.rst", "examples/helloworld.rst", "examples/lineararith.rst", "examples/quickstart.rst", "examples/relations.rst", "examples/sequences.rst", "examples/sets.rst", "examples/strings.rst", "examples/sygus-fun.rst", "examples/sygus-grammar.rst", "examples/sygus-inv.rst", "genindex.rst", "index.rst", "installation/installation.rst", "options.rst", "output-tags.rst", "proofs/output_alethe.rst", "proofs/output_dot.rst", "proofs/output_lfsc.rst", "proofs/proof_rules.rst", "proofs/proofs.rst", "references.rst", "resource-limits.rst", "statistics.rst", "theories/bags.rst", "theories/datatypes.rst", "theories/separation-logic.rst", "theories/sequences.rst", "theories/sets-and-relations.rst", "theories/strings.rst", "theories/theories.rst", "theories/transcendentals.rst"], "titles": ["API Documentation", "C++ API", "Datatype", "DatatypeConstructor", "DatatypeConstructorDecl", "DatatypeDecl", "DatatypeSelector", "DriverOptions", "Exceptions", "Grammar", "Kind", "Modes", "Op", "OptionInfo", "Quickstart Guide", "Result", "RoundingMode", "Solver", "Sort", "Statistics", "SynthResult", "Term", "UnknownExplanation", "Java API", "Java API", "Quickstart Guide", "Datatype", "DatatypeConstructor", "DatatypeConstructorDecl", "DatatypeDecl", "DatatypeSelector", "Grammar", "Kind", "Op", "Base Python API", "Quickstart Guide", "Result", "RoundingMode", "Solver", "Sort", "Statistics", "SynthResult", "Term", "UnknownExplanation", "Python API", "Arithmetic", "Arrays", "Bit-Vectors", "Core & Booleans", "Datatypes", "Floating Point", "Internals", "Pythonic API", "Quantifiers", "Quickstart Guide", "Sets", "Solvers & Results", "Binary Documentation", "Quickstart Guide", "Theory of Bags", "Theory of Bit-Vectors", "Theory of Bit-Vectors and Arrays", "Theory Combination", "Theory of Datatypes", "Examples", "Exception Handling", "Theory of Bit-Vectors: extract", "Theory of Floating-Points", "Hello World", "Theory of Linear Arithmetic", "Quickstart Example", "Theory of Relations", "Theory of Sequences", "Theory of Sets", "Theory of Strings", "SyGuS: Functions", "SyGuS: Grammars", "SyGuS: Invariants", "Index", "cvc5 Documentation", "Installation", "Options", "Output tags", "Proof format: Alethe", "Proof format: DOT", "Proof format: LFSC", "Proof rules", "Proof production", "References", "Resource limits", "Statistics", "Theory Reference: Bags", "Theory Reference: Datatypes", "Theory Reference: Separation Logic", "Theory Reference: Sequences", "Theory Reference: Sets and Relations", "Theory Reference: Strings", "Theory References", "Theory Reference: Transcendentals"], "terms": {"In": [0, 3, 10, 11, 14, 17, 18, 20, 21, 25, 26, 27, 32, 35, 38, 39, 41, 42, 49, 54, 58, 70, 81, 86, 88, 89, 92, 95], "addit": [0, 10, 32, 45, 47, 50, 67, 80, 83, 85, 86, 92], "us": [0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 17, 18, 19, 21, 24, 25, 27, 28, 29, 30, 31, 32, 35, 38, 39, 40, 42, 45, 47, 48, 49, 50, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 82, 83, 84, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95, 98], "cvc5": [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 15, 16, 17, 18, 19, 21, 22, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98], "binari": [0, 17, 45, 71, 79, 80, 81, 89], "featur": [0, 22, 43, 44, 52, 57, 63, 81, 82, 84], "sever": [0, 48, 57, 84, 85, 97], "differ": [0, 10, 12, 17, 19, 21, 22, 24, 32, 38, 47, 48, 49, 50, 55, 57, 64, 67, 69, 86, 90, 91, 95], "program": [0, 34, 57, 81, 88], "languag": [0, 19, 57, 58, 61, 62, 64, 72, 73, 74, 81, 84, 91, 92, 93, 94, 95], "while": [0, 1, 14, 19, 23, 25, 35, 44, 54, 58, 62, 70, 80, 81, 86, 98], "c": [0, 8, 10, 11, 14, 17, 18, 21, 24, 25, 26, 32, 34, 35, 38, 39, 44, 45, 48, 50, 54, 56, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 83, 85, 86, 90, 91, 92, 93, 94, 95, 98], "i": [0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 41, 42, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 98], "consid": [0, 10, 21, 32, 42, 49, 61, 66, 81, 90], "primari": [0, 1, 58], "interfac": [0, 1, 5, 9, 17, 29, 31, 57, 81], "both": [0, 12, 19, 21, 81, 83, 94, 98], "java": [0, 14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 91, 95, 98], "base": [0, 8, 10, 11, 14, 16, 17, 21, 25, 32, 35, 38, 40, 42, 44, 46, 49, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 83, 85, 86, 91, 93, 95, 98], "python": [0, 14, 25, 35, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 91, 95, 98], "implement": [0, 17, 19, 56, 75, 76, 77, 80, 81, 83, 89, 92, 93, 95, 97], "thin": 0, "wrapper": [0, 7, 26, 27, 28, 29, 30, 31, 33, 36, 38, 39, 40, 42], "around": 0, "addition": [0, 13, 17, 18, 21, 38, 81, 86, 96, 97], "more": [0, 1, 10, 13, 14, 17, 24, 25, 32, 35, 40, 44, 49, 50, 54, 58, 60, 70, 80, 81, 85, 86, 90, 91, 95], "avail": [0, 14, 16, 17, 25, 35, 38, 40, 54, 56, 58, 70, 75, 76, 77, 80, 81, 83, 84, 85, 88, 90, 92], "http": [0, 10, 24, 32, 49, 50, 56, 80, 88], "github": [0, 14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 91, 95, 98], "com": [0, 24, 80], "cvc5_pythonic_api": [0, 14, 25, 35, 58, 65], "here": [0, 24, 25, 49, 58, 63, 83, 84, 85, 86, 87, 95], "The": [1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 37, 38, 39, 40, 42, 43, 44, 47, 48, 49, 50, 52, 54, 55, 57, 58, 60, 61, 62, 64, 67, 69, 70, 71, 72, 74, 75, 76, 77, 80, 81, 82, 83, 84, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95, 98], "expos": [1, 10, 32], "full": [1, 14, 22, 25, 35, 43, 54, 55, 58, 70, 81], "function": [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 18, 19, 20, 21, 27, 30, 32, 35, 38, 39, 44, 45, 47, 48, 49, 51, 53, 56, 62, 63, 64, 76, 77, 80, 82, 83, 86, 88, 90, 91, 95, 97, 98], "quickstart": [1, 24, 34, 52, 57, 64], "guid": [1, 24, 34, 52, 57, 81], "give": [1, 24, 49, 57, 58, 63, 69, 81, 89, 90], "short": [1, 24, 57, 58, 81], "introduct": [1, 24, 57, 86], "follow": [1, 10, 13, 14, 16, 17, 18, 25, 32, 35, 38, 44, 45, 46, 47, 49, 50, 52, 54, 55, 57, 58, 60, 61, 62, 63, 64, 71, 80, 81, 82, 83, 86, 87, 89, 90, 91, 92, 93, 95, 98], "namespac": [1, 11, 14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "provid": [1, 3, 7, 10, 13, 17, 18, 21, 24, 27, 32, 38, 56, 75, 79, 80, 81, 82, 85, 86], "detail": [1, 10, 13, 17, 24, 32, 38, 50, 80, 83, 85, 86, 95], "individu": [1, 24, 82, 89, 90], "For": [1, 3, 10, 14, 16, 17, 18, 21, 24, 25, 27, 32, 35, 39, 42, 48, 49, 56, 58, 64, 67, 73, 80, 81, 85, 86, 89, 91, 92, 93, 94, 95], "most": [1, 11, 17, 24, 38, 45, 47, 56, 80, 94, 95, 98], "applic": [1, 3, 10, 24, 27, 32, 44, 46, 48, 51, 63, 81, 86, 89, 95], "solver": [1, 3, 5, 7, 8, 10, 11, 13, 14, 15, 18, 19, 20, 21, 22, 24, 25, 27, 29, 32, 34, 35, 36, 39, 41, 42, 43, 49, 50, 52, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 83, 86, 88, 89, 90, 91, 92, 93, 94, 95, 98], "main": [1, 11, 14, 17, 24, 25, 35, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 91, 95, 98], "entri": [1, 19, 24], "point": [1, 2, 3, 10, 16, 17, 18, 21, 24, 32, 37, 38, 39, 42, 52, 56, 63, 64, 86, 88, 89, 90, 93, 97], "exampl": [1, 3, 10, 18, 21, 24, 27, 32, 34, 39, 42, 44, 48, 49, 52, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77, 79, 81, 83, 85, 86, 89, 91, 95], "except": [1, 10, 17, 19, 21, 24, 26, 32, 42, 45, 46, 48, 52, 56, 64, 81, 89, 92], "datatyp": [1, 3, 4, 5, 6, 10, 17, 18, 24, 27, 28, 29, 30, 32, 34, 38, 39, 52, 64, 82, 86, 88, 93, 95, 97], "datatypeconstructor": [1, 2, 10, 24, 32, 34, 63], "datatypeconstructordecl": [1, 5, 17, 24, 29, 34, 63], "datatypedecl": [1, 17, 24, 34, 38, 63], "datatypeselector": [1, 2, 3, 10, 24, 32, 34, 63], "driveropt": [1, 17], "grammar": [1, 17, 24, 34, 38, 64, 75, 81, 93], "kind": [1, 3, 6, 12, 14, 17, 18, 21, 24, 25, 27, 30, 33, 34, 35, 38, 39, 42, 46, 47, 48, 51, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 86, 91, 92, 93, 94, 95, 98], "mode": [1, 13, 16, 17, 18, 21, 38, 39, 42, 52, 67, 80, 81, 83, 84, 85, 93], "op": [1, 10, 17, 21, 24, 32, 34, 38, 42, 60, 66, 67, 93], "optioninfo": [1, 17, 24, 38], "result": [1, 10, 14, 16, 17, 20, 21, 22, 24, 25, 32, 34, 35, 37, 38, 41, 42, 52, 54, 58, 59, 65, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 85, 86, 91, 95, 98], "roundingmod": [1, 10, 17, 18, 21, 24, 32, 34, 38, 39, 67], "sort": [1, 2, 3, 4, 5, 6, 9, 10, 14, 17, 21, 24, 25, 27, 28, 29, 30, 31, 32, 34, 35, 38, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 58, 59, 60, 61, 62, 63, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 92, 93, 94, 95, 98], "statist": [1, 17, 24, 34, 38, 56, 79, 81, 89], "synthresult": [1, 17, 24, 34], "term": [1, 3, 6, 9, 10, 11, 12, 14, 17, 18, 24, 25, 27, 30, 31, 32, 33, 34, 35, 38, 39, 49, 52, 53, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 83, 84, 86, 90, 91, 92, 93, 94, 95, 98], "unknownexplan": [1, 15, 24, 34], "cvc5apiexcept": [1, 8, 14, 24, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "cvc5apirecoverableexcept": [1, 8, 19, 24], "const_iter": [1, 2, 3, 21, 62, 63], "stat": [1, 19, 24, 40, 56, 81, 90], "enum": [1, 10, 11, 16, 21, 22, 24, 32, 37, 43, 81, 82, 86], "class": [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 51, 52, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 86, 91, 95, 98], "A": [2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 17, 18, 19, 20, 21, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 38, 39, 40, 42, 46, 48, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 83, 85, 86, 88, 90, 91, 92, 93, 94, 95, 98], "public": [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 90, 91, 95, 98], "constructor": [2, 3, 4, 5, 6, 9, 10, 12, 15, 17, 18, 19, 20, 21, 26, 27, 28, 29, 32, 38, 39, 49, 63, 81, 86, 92, 95], "destructor": [2, 3, 4, 5, 6, 12, 17, 18, 19, 21, 81, 92], "oper": [2, 3, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 24, 25, 32, 33, 35, 38, 42, 47, 52, 54, 58, 70, 71, 81, 86, 89, 91, 93, 95, 96], "size_t": [2, 3, 5, 10, 12, 17, 18, 21, 38, 75, 76, 77], "idx": [2, 46, 48, 49, 53, 56], "const": [2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 25, 35, 38, 45, 47, 48, 49, 50, 54, 55, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 72, 73, 74, 75, 76, 77, 81, 91, 92, 93, 94, 95], "get": [2, 3, 5, 6, 12, 13, 14, 17, 18, 19, 21, 25, 26, 27, 30, 33, 35, 38, 39, 40, 42, 46, 54, 56, 58, 59, 61, 62, 63, 70, 71, 72, 73, 75, 76, 77, 80, 81, 91, 95], "given": [2, 3, 4, 10, 11, 17, 18, 19, 21, 22, 26, 27, 28, 32, 38, 42, 43, 45, 46, 47, 48, 49, 50, 51, 56, 60, 62, 69, 75, 76, 77, 80, 81, 82, 86, 90, 91, 92, 93], "index": [2, 3, 10, 12, 17, 18, 21, 26, 27, 32, 33, 38, 39, 42, 61, 79, 80, 81, 86, 92, 94], "paramet": [2, 3, 4, 5, 8, 9, 10, 12, 15, 17, 18, 19, 21, 26, 27, 28, 29, 31, 32, 33, 38, 39, 40, 42, 56, 61, 63, 75, 76, 77, 81, 92], "return": [2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 25, 26, 27, 28, 29, 30, 32, 33, 35, 36, 38, 39, 40, 41, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 60, 61, 62, 63, 65, 66, 68, 69, 70, 75, 76, 77, 81, 86, 89, 94, 98], "std": [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 88, 90, 91, 92, 95, 98], "string": [2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 25, 32, 35, 38, 39, 42, 45, 47, 48, 49, 50, 52, 53, 54, 56, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 86, 90, 91, 92, 93, 94, 95, 97, 98], "name": [2, 3, 4, 5, 6, 13, 14, 17, 18, 19, 21, 25, 26, 27, 28, 29, 30, 35, 38, 40, 45, 46, 47, 48, 49, 50, 53, 54, 55, 56, 58, 63, 70, 73, 80, 81, 90, 92], "thi": [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 38, 39, 41, 42, 45, 46, 48, 49, 50, 52, 53, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 84, 85, 86, 89, 90, 91, 93, 95, 96, 98], "linear": [2, 3, 10, 26, 27, 32, 64, 81, 88, 98], "search": [2, 3, 11, 26, 27, 80, 81], "through": [2, 3, 26, 27, 60, 61, 62, 63, 66, 67, 69, 71, 72, 73, 74, 75, 76, 77, 88, 95], "so": [2, 3, 5, 17, 24, 26, 27, 29, 38, 54, 58, 61, 63, 81], "case": [2, 3, 10, 11, 14, 17, 18, 20, 21, 25, 26, 27, 32, 35, 38, 39, 41, 42, 54, 58, 70, 81, 86, 89, 90, 94, 96], "multipl": [2, 3, 10, 11, 26, 27, 32, 45, 47, 50, 59, 61, 81, 86, 91], "similarli": [2, 3, 17, 26, 27, 38], "first": [2, 3, 6, 10, 11, 14, 17, 21, 25, 26, 27, 30, 32, 35, 38, 49, 54, 58, 60, 61, 63, 70, 76, 81, 83, 86, 94], "getconstructor": [2, 26, 63], "getselector": [2, 3, 26, 27, 63, 92, 95], "selector": [2, 3, 4, 6, 10, 18, 26, 27, 28, 30, 32, 39, 49, 63, 81, 86, 92, 95], "getnam": [2, 3, 5, 6, 26, 27, 29, 30], "getnumconstructor": [2, 5, 26, 29], "number": [2, 3, 5, 10, 12, 16, 17, 18, 21, 24, 26, 27, 29, 32, 33, 37, 38, 42, 45, 47, 48, 49, 50, 53, 56, 61, 67, 79, 81, 86, 89, 91, 92, 97, 98], "vector": [2, 9, 10, 13, 14, 17, 18, 21, 25, 32, 35, 38, 39, 42, 50, 52, 54, 56, 58, 63, 64, 67, 70, 75, 76, 77, 80, 81, 86, 92, 94, 95, 97], "getparamet": [2, 26], "parametr": [2, 3, 5, 17, 18, 26, 27, 29, 39, 81], "assert": [2, 10, 13, 14, 17, 18, 19, 21, 25, 32, 35, 38, 39, 42, 50, 54, 56, 58, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 74, 80, 81, 86, 92, 93, 94, 95, 98], "method": [2, 3, 5, 7, 8, 10, 11, 17, 18, 19, 20, 21, 26, 27, 29, 32, 38, 39, 41, 42, 48, 49, 56, 60, 75, 76, 77, 81, 86, 88], "experiment": [2, 3, 5, 10, 17, 18, 26, 27, 29, 32, 38, 39, 42, 81], "mai": [2, 3, 5, 8, 10, 11, 16, 17, 18, 21, 26, 27, 29, 32, 38, 39, 42, 45, 47, 80, 81, 86, 89, 95], "chang": [2, 3, 5, 10, 17, 18, 19, 26, 27, 29, 32, 38, 39, 42, 80, 81, 90], "futur": [2, 3, 5, 10, 17, 18, 26, 27, 29, 32, 38, 39, 42, 81], "version": [2, 3, 5, 10, 14, 17, 18, 25, 26, 27, 29, 32, 35, 38, 39, 42, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 86, 88, 90, 91, 92, 95, 98], "bool": [2, 3, 4, 5, 6, 10, 12, 13, 15, 17, 18, 19, 20, 21, 32, 38, 39, 40, 42, 45, 46, 48, 49, 55, 56, 61, 62, 68, 75, 77, 81, 82, 83, 85, 94], "isparametr": [2, 5, 26, 29], "true": [2, 3, 4, 5, 6, 10, 12, 14, 15, 17, 18, 19, 20, 21, 25, 26, 27, 28, 29, 30, 32, 33, 35, 36, 38, 39, 41, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 56, 58, 59, 60, 61, 62, 65, 67, 68, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 85, 86, 90, 91, 92, 94, 95], "iscodatatyp": [2, 17, 26, 38, 49], "correspond": [2, 3, 9, 10, 11, 14, 17, 21, 25, 26, 27, 31, 32, 35, 38, 54, 58, 70, 81, 82, 85, 86, 89], "co": [2, 26, 81, 88, 92, 98], "istupl": [2, 18, 26, 39], "tupl": [2, 10, 17, 18, 21, 26, 32, 38, 39, 42, 45, 47, 48, 49, 71, 81, 95], "isrecord": [2, 18, 26, 39], "record": [2, 17, 18, 26, 38, 39, 85, 92], "isfinit": [2, 26], "finit": [2, 10, 17, 26, 32, 38, 52, 71, 81, 88, 94], "iswellfound": [2, 26], "determin": [2, 3, 5, 10, 15, 17, 18, 19, 20, 21, 26, 27, 32, 36, 38, 39, 41, 56, 80, 81, 86], "well": [2, 13, 19, 26, 81, 83, 90, 97], "found": [2, 17, 24, 26, 38, 80, 81, 95], "If": [2, 8, 10, 13, 14, 16, 17, 19, 21, 25, 26, 32, 35, 37, 38, 42, 44, 45, 47, 48, 49, 50, 53, 54, 56, 58, 60, 61, 66, 70, 80, 86, 94], "codatatyp": [2, 17, 26, 38], "fals": [2, 10, 11, 17, 19, 26, 32, 38, 40, 45, 46, 47, 48, 49, 50, 51, 53, 55, 56, 65, 75, 76, 77, 81, 82, 83, 85, 86, 94], "ar": [2, 3, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 24, 25, 26, 27, 30, 31, 32, 35, 37, 38, 39, 40, 42, 44, 48, 49, 51, 54, 56, 58, 60, 62, 63, 67, 69, 70, 71, 80, 81, 82, 83, 85, 86, 89, 90, 92, 93, 94, 95, 96, 97, 98], "valu": [2, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 24, 25, 26, 32, 35, 36, 37, 38, 40, 41, 42, 43, 45, 47, 48, 50, 51, 54, 56, 58, 59, 60, 61, 62, 63, 67, 69, 70, 72, 73, 81, 86, 90, 91, 92, 94, 95], "size": [2, 10, 14, 17, 24, 25, 26, 32, 35, 38, 45, 47, 48, 50, 54, 58, 61, 70, 75, 76, 77, 81], "isnul": [2, 3, 4, 5, 6, 12, 15, 18, 20, 21, 26, 27, 28, 29, 30, 33, 36, 39, 41, 42], "null": [2, 3, 4, 5, 6, 10, 12, 17, 18, 20, 21, 26, 27, 28, 29, 30, 32, 33, 38, 39, 41, 42, 86], "object": [2, 3, 5, 6, 7, 8, 17, 18, 19, 24, 26, 27, 28, 29, 30, 38, 42, 45, 48, 49, 51, 53, 56, 63, 75, 76, 86, 89, 90, 91, 92, 93, 94, 95], "tostr": [2, 3, 4, 5, 6, 9, 12, 15, 18, 20, 21, 65, 75, 76, 77], "represent": [2, 3, 4, 5, 6, 9, 10, 12, 14, 15, 16, 17, 18, 19, 20, 21, 25, 32, 35, 38, 42, 48, 50, 54, 58, 70, 81, 86, 90], "begin": [2, 3, 19, 21, 40, 62, 63, 75, 76, 77, 81], "an": [2, 3, 4, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 25, 26, 28, 31, 32, 33, 34, 35, 36, 37, 38, 39, 42, 44, 45, 46, 47, 48, 49, 50, 51, 53, 54, 56, 58, 59, 63, 65, 67, 69, 70, 73, 79, 80, 81, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95], "iter": [2, 3, 19, 21, 24, 26, 27, 42, 62, 63, 90], "end": [2, 3, 14, 19, 21, 25, 35, 54, 58, 62, 63, 70, 75, 76, 77, 82], "one": [2, 3, 10, 14, 16, 19, 21, 25, 27, 32, 35, 37, 38, 42, 48, 49, 54, 58, 59, 60, 62, 63, 70, 73, 75, 77, 81, 86, 89, 91, 92, 93, 95], "off": [2, 3, 21, 81], "last": [2, 3, 17, 21, 38, 56, 81], "type": [2, 3, 4, 7, 8, 10, 11, 13, 14, 17, 18, 19, 21, 25, 27, 32, 35, 38, 45, 48, 54, 56, 58, 60, 63, 65, 67, 70, 74, 81, 86, 88, 90, 92, 93], "iterator_categori": [2, 3, 21], "forward_iterator_tag": [2, 3, 21], "tag": [2, 3, 17, 21, 49, 79, 81], "value_typ": [2, 3, 21], "item": [2, 3, 21], "pointer": [2, 3, 21, 48, 53], "refer": [2, 3, 17, 21, 48, 49, 51, 56, 63, 79, 81, 86], "difference_typ": [2, 3, 21], "ptrdiff_t": [2, 3, 21], "when": [2, 3, 10, 11, 17, 18, 19, 21, 32, 38, 42, 53, 80, 81, 82, 86, 89, 90, 93, 95], "two": [2, 3, 8, 10, 14, 15, 16, 21, 25, 32, 35, 37, 44, 47, 49, 54, 58, 59, 60, 61, 63, 69, 73, 81, 86, 90, 91, 95, 98], "subtract": [2, 3, 10, 14, 21, 25, 32, 35, 45, 47, 50, 54, 58, 70, 91], "nullari": [2, 3, 9, 10, 15, 27, 32, 36], "requir": [2, 3, 10, 12, 14, 17, 22, 25, 27, 32, 33, 35, 38, 43, 67, 75, 76, 77, 80, 81, 83, 86, 89, 93], "cython": [2, 3, 9, 80], "assign": [2, 3, 14, 17, 19, 21, 25, 35, 48, 54, 58, 60, 63, 70, 81], "after": [2, 3, 7, 10, 11, 17, 21, 32, 38, 49, 58, 60, 63, 65, 76, 81, 82, 89, 90, 94], "equal": [2, 3, 10, 11, 12, 14, 15, 16, 18, 21, 25, 32, 35, 37, 42, 45, 47, 49, 54, 58, 59, 60, 62, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 83, 85, 86, 90, 91, 95], "compar": [2, 3, 12, 15, 18, 21, 44, 86], "disequ": [2, 3, 10, 12, 15, 18, 21, 32, 48, 81], "increment": [2, 3, 14, 17, 21, 25, 35, 38, 54, 56, 58, 59, 60, 62, 70, 73, 75, 76, 77, 81, 88, 90, 91, 95, 98], "prefix": [2, 3, 10, 21, 24, 32, 45, 48, 58, 80, 81, 86, 94], "int": [2, 3, 10, 14, 17, 18, 21, 25, 27, 32, 35, 38, 39, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 91, 92, 93, 94, 95, 96, 98], "postfix": [2, 3, 21], "derefer": [2, 3, 21], "getterm": [3, 6, 10, 27, 30, 32, 63, 92], "special": [3, 10, 11, 13, 27, 32, 52, 67, 81, 86, 92], "like": [3, 6, 7, 10, 17, 21, 27, 30, 32, 38, 44, 56, 76, 81, 86, 89, 90, 98], "whose": [3, 4, 10, 11, 17, 21, 27, 28, 32, 38, 42, 81, 85, 86, 92, 93], "isdatatypeconstructor": [3, 18, 27, 39], "all": [3, 8, 10, 14, 17, 18, 19, 21, 25, 26, 27, 32, 35, 38, 39, 40, 42, 48, 49, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 82, 85, 86, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98], "includ": [3, 7, 10, 11, 13, 14, 17, 19, 21, 25, 27, 32, 35, 38, 40, 48, 53, 54, 55, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 83, 86, 90, 91, 92, 95, 98], "ones": [3, 10, 14, 17, 25, 27, 32, 35, 38, 54, 58, 70, 81, 95], "should": [3, 6, 8, 10, 14, 17, 25, 27, 30, 32, 35, 38, 54, 56, 58, 61, 69, 70, 75, 76, 77, 80, 85, 86, 90, 98], "argument": [3, 6, 10, 17, 18, 27, 30, 32, 38, 39, 46, 47, 48, 49, 51, 56, 63, 81, 86, 89, 92], "apply_constructor": [3, 10, 27, 32, 63, 92], "nil": [3, 10, 17, 27, 32, 38, 49, 63, 92, 93], "list": [3, 10, 11, 13, 14, 17, 18, 21, 25, 27, 32, 35, 38, 39, 42, 45, 48, 49, 51, 53, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 91, 92, 95, 98], "can": [3, 5, 7, 8, 9, 10, 11, 13, 14, 17, 18, 19, 21, 24, 25, 26, 27, 29, 31, 32, 35, 38, 44, 45, 47, 48, 49, 50, 54, 56, 58, 60, 62, 63, 64, 70, 80, 81, 82, 83, 84, 86, 87, 89, 90, 91, 92, 93, 95], "construct": [3, 5, 8, 10, 14, 17, 18, 21, 25, 27, 29, 32, 35, 38, 39, 42, 54, 58, 62, 63, 64, 70, 81, 86], "mkterm": [3, 10, 14, 17, 21, 25, 27, 32, 35, 38, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 92, 93, 94, 95, 98], "t": [3, 10, 11, 12, 13, 14, 17, 18, 21, 25, 27, 32, 35, 38, 42, 48, 54, 56, 58, 62, 63, 70, 75, 76, 77, 81, 86, 88, 91, 92, 93, 94, 95, 98], "where": [3, 10, 11, 17, 19, 21, 26, 27, 32, 38, 42, 49, 61, 81, 86, 87, 89, 91, 92, 93, 94, 96], "instead": [3, 14, 18, 21, 25, 27, 35, 54, 58, 70, 81, 85, 86, 95], "getinstantiatedterm": [3, 27], "below": [3, 27, 32, 45, 47, 80, 81, 86, 89, 91, 92, 94, 95, 96], "retsort": [3, 27], "intend": [3, 17, 19, 27, 38, 79, 82, 86], "seen": [3, 27, 86, 92], "ha": [3, 5, 7, 10, 13, 17, 18, 19, 20, 21, 27, 32, 38, 39, 41, 42, 48, 49, 60, 63, 68, 81, 82, 86, 89, 90, 92, 94], "been": [3, 5, 7, 14, 17, 18, 19, 25, 27, 35, 38, 39, 54, 58, 60, 63, 68, 70, 82, 86, 89], "explicitli": [3, 10, 13, 14, 25, 27, 32, 35, 54, 58, 70, 81, 89], "cast": [3, 27, 45, 47, 48, 50, 92], "cannot": [3, 17, 21, 27, 48], "infer": [3, 27, 81, 86], "declar": [3, 4, 5, 10, 14, 17, 25, 27, 28, 29, 32, 35, 38, 48, 52, 54, 56, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 91, 93, 94, 95, 98], "par": [3, 27, 63, 92], "con": [3, 10, 27, 32, 49, 63, 81, 92], "head": [3, 27, 63, 92], "tail": [3, 27, 49, 63, 92], "must": [3, 10, 12, 17, 21, 27, 32, 38, 42, 48, 49, 60, 73, 81, 86, 92, 93], "user": [3, 10, 13, 27, 32, 44, 52, 80, 81, 82, 86, 93], "smt": [3, 5, 10, 14, 16, 17, 18, 25, 27, 29, 32, 35, 37, 38, 39, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 79, 80, 83, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98], "2": [3, 5, 9, 10, 14, 16, 17, 21, 25, 27, 29, 31, 32, 35, 42, 45, 47, 48, 49, 50, 53, 54, 56, 58, 59, 60, 61, 67, 69, 70, 73, 80, 81, 85, 86, 88, 90, 91, 92, 93, 95, 98], "6": [3, 5, 14, 24, 25, 27, 29, 35, 45, 47, 54, 58, 70, 80, 88, 92, 93], "done": [3, 27, 80, 81, 86, 89], "via": [3, 7, 10, 13, 14, 17, 18, 19, 21, 25, 27, 32, 35, 38, 44, 56, 57, 65, 71, 72, 74, 80, 81, 83, 86, 89, 90, 93, 95], "syntax": [3, 5, 10, 27, 29, 32, 52, 56, 76, 81, 95], "qualifi": [3, 27], "identifi": [3, 11, 19, 27, 48, 81, 86], "equival": [3, 10, 17, 21, 27, 32, 38, 42, 60, 63, 75, 76, 77, 81, 86, 92], "appli": [3, 10, 18, 21, 27, 32, 39, 42, 48, 49, 56, 63, 81, 86, 89, 92], "abov": [3, 10, 11, 13, 14, 17, 21, 25, 27, 32, 35, 38, 54, 58, 60, 70, 75, 76, 77, 80, 81, 86, 92, 95], "desir": [3, 27, 80], "gettesterterm": [3, 10, 27, 32, 63, 92], "tester": [3, 10, 18, 27, 32, 39, 49, 52, 63, 81, 86, 92], "similar": [3, 6, 10, 27, 30, 32, 56, 76, 80, 81, 86, 95], "which": [3, 8, 9, 10, 16, 17, 18, 20, 21, 31, 32, 38, 39, 40, 41, 42, 45, 63, 75, 76, 77, 81, 85, 86, 90, 92, 95], "apply_test": [3, 10, 27, 32, 63, 92], "getnumselector": [3, 27], "far": [3, 5, 27, 29], "th": [3, 86, 88, 94, 96], "specif": [4, 5, 14, 22, 24, 25, 28, 29, 35, 43, 49, 54, 58, 63, 70, 86, 90], "creat": [4, 5, 10, 14, 17, 18, 19, 21, 25, 28, 29, 32, 35, 38, 39, 42, 45, 47, 48, 49, 50, 53, 54, 55, 56, 58, 60, 63, 65, 67, 68, 70, 72, 75, 76, 81, 85, 91, 92, 93, 94, 95], "void": [4, 5, 9, 14, 17, 18, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "addselector": [4, 28, 63], "add": [4, 5, 9, 10, 14, 17, 25, 28, 29, 31, 32, 35, 38, 45, 50, 51, 54, 55, 56, 58, 61, 62, 70, 75, 76, 77, 81], "codomain": [4, 6, 10, 17, 18, 28, 30, 32, 38, 39], "addselectorself": [4, 28, 63], "itself": [4, 5, 7, 28, 29, 49, 63, 86, 89, 92], "addselectorunresolv": [4, 28], "unresdataypenam": [4, 28], "unresolv": [4, 17, 28, 38], "resolv": [4, 5, 28, 63], "see": [5, 10, 14, 17, 18, 19, 21, 25, 29, 32, 34, 35, 38, 39, 40, 45, 46, 47, 48, 49, 50, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 84, 86, 89, 91, 93, 95, 98], "coincid": [5, 9, 29, 31], "lib": [5, 16, 17, 18, 24, 29, 37, 38, 39, 56, 57, 58, 62, 80, 81, 83, 88, 89, 92, 93, 94, 96, 97], "command": [5, 9, 14, 17, 18, 21, 25, 29, 35, 54, 56, 57, 58, 63, 70, 75, 76, 77, 80, 81, 89, 90, 92, 93], "singl": [5, 10, 19, 29, 32, 40, 48, 50, 53, 55, 67, 81, 86, 89, 94], "within": [5, 10, 18, 21, 29, 32, 39, 56, 80, 81, 83, 85, 86, 89], "from": [5, 8, 10, 11, 14, 15, 16, 17, 18, 19, 20, 21, 24, 25, 29, 32, 35, 36, 37, 38, 39, 41, 42, 50, 52, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 85, 86, 90, 91, 93, 94, 95, 98], "mkdatatypesort": [5, 17, 29, 38, 63, 92], "addconstructor": [5, 29, 63], "ctor": [5, 17, 29, 38, 63], "isresolv": 5, "e": [5, 7, 10, 11, 12, 13, 14, 15, 17, 18, 20, 21, 22, 25, 32, 33, 35, 36, 38, 41, 42, 43, 45, 46, 48, 49, 53, 54, 55, 56, 58, 59, 60, 65, 67, 70, 71, 73, 74, 80, 81, 84, 86, 88, 91, 94, 95, 96, 98], "alreadi": [5, 14, 17, 25, 35, 44, 48, 54, 58, 70, 80, 81], "isdatatypeselector": [6, 18, 30, 39], "apply_selector": [6, 10, 30, 32, 63, 92, 95], "getupdaterterm": [6, 10, 30, 32, 63, 92], "updat": [6, 10, 18, 30, 32, 39, 46, 63, 81, 94, 96], "isdatatypeupdat": [6, 18, 30, 39], "apply_updat": [6, 10, 30, 32, 63, 92], "getcodomainsort": [6, 30], "safe": [7, 8, 13, 21, 42, 56, 81, 89], "access": [7, 13, 17, 18, 19, 21, 49, 81, 94], "few": [7, 24, 67, 81, 89], "option": [7, 10, 13, 14, 17, 25, 32, 35, 38, 54, 56, 58, 59, 60, 61, 62, 65, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 82, 85, 86, 87, 90, 91, 95], "frontend": [7, 13], "commun": [7, 8, 17], "appropri": [7, 19, 48, 81], "regular": [7, 10, 17, 18, 32, 38, 39, 74, 81, 82, 86], "getopt": [7, 13, 17, 38, 56, 81], "getoptioninfo": [7, 13, 17, 38, 56, 81], "g": [7, 10, 12, 13, 14, 17, 18, 21, 22, 25, 32, 33, 35, 38, 42, 43, 49, 54, 56, 58, 70, 74, 75, 80, 81, 84, 86, 94, 95, 96, 98], "input": [7, 9, 11, 13, 17, 31, 38, 57, 58, 64, 75, 76, 77, 81, 82, 90, 92, 93, 95], "output": [7, 13, 17, 18, 21, 38, 54, 58, 61, 62, 71, 72, 73, 74, 75, 76, 77, 79, 80, 81, 83, 84, 85, 86, 87, 89, 95], "stream": [7, 8, 11, 13, 17, 18, 21, 49, 75, 76, 77, 81, 92], "configur": [7, 24, 56, 80, 81, 89], "err": [7, 81], "out": [7, 10, 11, 14, 18, 25, 32, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 94, 95, 98], "doe": [7, 10, 11, 17, 18, 19, 21, 32, 38, 44, 52, 59, 61, 63, 67, 80, 81, 86, 89, 91, 92, 93], "store": [7, 10, 17, 19, 21, 32, 38, 42, 46, 61, 81, 86, 90], "onli": [7, 10, 11, 14, 17, 18, 19, 21, 22, 25, 32, 35, 38, 39, 42, 43, 54, 58, 60, 70, 80, 81, 83, 85, 86, 87, 89, 90, 93, 94, 95, 96], "act": 7, "It": [7, 10, 13, 14, 17, 18, 19, 25, 32, 34, 35, 38, 39, 42, 47, 48, 49, 52, 54, 56, 58, 70, 79, 80, 81, 83, 84, 86, 89, 92, 94, 96], "thu": [7, 16, 38, 69, 80, 89, 98], "longer": [7, 8, 80], "destroi": [7, 19, 56], "istream": 7, "": [7, 10, 14, 16, 17, 18, 19, 21, 25, 32, 35, 37, 38, 42, 44, 45, 46, 47, 48, 49, 50, 51, 54, 55, 56, 58, 60, 62, 63, 65, 67, 70, 74, 80, 81, 83, 86, 88, 91, 92, 93, 94, 95, 98], "ostream": [7, 11, 17, 18, 19], "error": [7, 8, 65, 81], "api": [8, 9, 10, 14, 17, 19, 20, 21, 25, 32, 35, 38, 41, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 81, 89, 90, 91, 93, 94, 95, 98], "certain": [8, 12, 16, 33, 80, 82, 89], "we": [8, 10, 11, 14, 17, 18, 20, 21, 25, 32, 35, 38, 41, 49, 54, 56, 58, 60, 61, 63, 66, 68, 70, 71, 73, 80, 81, 84, 86, 91, 92, 93, 94, 95], "broadli": 8, "distinguish": [8, 10, 17, 38, 86, 93], "deriv": [8, 86], "ani": [8, 9, 10, 11, 13, 17, 21, 31, 32, 38, 59, 73, 81, 82, 86, 90, 91, 93, 95], "fail": [8, 17, 38, 45, 46, 48, 80, 81], "behav": [8, 10, 32], "wa": [8, 11, 13, 15, 17, 18, 20, 21, 22, 23, 36, 38, 41, 43, 81, 82, 83, 86, 90], "call": [8, 10, 14, 17, 20, 21, 25, 32, 35, 38, 40, 41, 42, 54, 58, 62, 70, 80, 81, 86, 89], "still": [8, 80, 90], "howev": [8, 10, 14, 25, 32, 35, 54, 58, 70], "associ": [8, 10, 17, 18, 21, 32, 38, 39, 48, 49, 67, 81, 86, 92], "unsaf": 8, "state": [8, 17, 38, 86, 89], "thrown": [8, 21, 26, 42], "subclass": [8, 48], "inlin": [8, 14, 25, 35, 54, 58, 70], "str": [8, 14, 25, 35, 38, 48, 50, 51, 54, 56, 58, 70, 74, 75, 76, 77, 96], "messag": [8, 89], "stringstream": [8, 75, 76, 77], "getmessag": 8, "retriev": [8, 14, 19, 21, 35, 50, 56, 75, 76, 77], "char": 8, "what": [8, 10, 81], "noexcept": 8, "overrid": [8, 48, 80, 81], "style": [8, 81], "arrai": [8, 10, 14, 17, 18, 21, 25, 32, 35, 38, 39, 42, 48, 50, 52, 53, 54, 55, 58, 64, 70, 86, 90, 97], "recover": 8, "cvc5apioptionexcept": [8, 24], "cvc5apiunsupportedexcept": 8, "sygu": [9, 17, 31, 38, 52, 57, 64, 81], "defin": [9, 14, 17, 18, 25, 31, 35, 38, 48, 49, 51, 52, 54, 56, 58, 61, 63, 66, 70, 71, 74, 75, 76, 77, 80, 81, 82, 85, 86, 91, 93, 95, 97, 98], "context": [9, 10, 17, 31, 32, 38, 45, 47, 48, 50, 56, 60, 81, 93], "free": [9, 10, 11, 17, 21, 31, 32, 38, 56, 81, 86, 93, 95], "Its": [9, 31], "definit": [9, 17, 31, 38, 81, 86], "grammardef": [9, 31], "IF": [9, 31, 57], "1": [9, 10, 14, 16, 17, 21, 24, 25, 31, 32, 35, 38, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 69, 70, 71, 72, 73, 75, 76, 77, 80, 81, 82, 83, 85, 86, 88, 90, 91, 92, 93, 94, 95, 96], "standard": [9, 16, 18, 21, 31, 50, 58, 67, 75, 76, 77, 80, 81, 86, 88, 92, 93, 96], "addrul": [9, 31, 75, 76], "ntsymbol": [9, 17, 31, 38], "rule": [9, 31, 75, 76, 81, 83, 85, 87], "set": [9, 10, 11, 13, 14, 17, 18, 19, 21, 25, 31, 32, 35, 38, 39, 42, 48, 49, 50, 52, 54, 56, 58, 59, 60, 61, 62, 63, 64, 65, 66, 68, 69, 70, 71, 72, 74, 75, 76, 77, 80, 82, 86, 88, 89, 90, 91, 92, 93, 94, 97, 98], "non": [9, 10, 17, 18, 31, 32, 38, 48, 65, 75, 76, 80, 81, 83, 86, 89, 90, 92, 93, 94, 96], "termin": [9, 17, 31, 38, 75, 76, 81, 89], "ad": [9, 10, 11, 14, 25, 31, 32, 35, 44, 54, 56, 58, 70, 81, 85, 86], "addanyconst": [9, 31], "allow": [9, 10, 13, 17, 31, 32, 38, 44, 81, 89, 92, 95], "arbitrari": [9, 10, 11, 17, 21, 24, 31, 32, 81, 85, 86], "constant": [9, 10, 11, 14, 17, 21, 25, 31, 32, 35, 38, 42, 45, 46, 47, 48, 49, 50, 51, 54, 56, 58, 61, 62, 67, 69, 70, 72, 74, 81, 82, 86, 90, 91, 94, 95, 98], "addanyvari": [9, 31, 76], "variabl": [9, 10, 11, 14, 17, 21, 25, 31, 32, 35, 38, 48, 53, 54, 58, 60, 61, 62, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 81, 86, 93, 95, 98], "synth": [9, 17, 20, 31, 38, 41, 75, 76, 77, 81], "fun": [9, 17, 31, 38, 62, 71, 75, 76, 77, 81, 82, 94, 95, 98], "inv": [9, 17, 31, 38, 77, 81, 86], "same": [9, 10, 12, 14, 17, 21, 25, 31, 32, 35, 38, 48, 49, 54, 58, 64, 70, 80, 81, 86, 89, 92, 94, 95], "need": [9, 18, 63, 71, 72, 73, 74, 81, 95], "friend": [9, 15, 17, 18, 19, 21, 36], "everi": [10, 17, 32, 38, 48, 56, 64, 81, 89, 90], "each": [10, 14, 17, 25, 35, 38, 47, 48, 49, 54, 58, 62, 63, 70, 75, 76, 81, 86, 90, 92], "bit": [10, 16, 17, 18, 21, 32, 38, 39, 42, 50, 52, 64, 67, 80, 81, 86, 90, 94, 97], "const_bitvector": [10, 32], "symbol": [10, 14, 17, 18, 21, 25, 32, 35, 38, 39, 42, 48, 54, 55, 56, 58, 63, 76, 81, 86, 92, 93, 98], "over": [10, 14, 17, 19, 21, 25, 26, 27, 32, 35, 42, 54, 55, 58, 59, 62, 63, 66, 69, 70, 71, 73, 80, 81, 85, 86, 89, 90, 91, 95], "univers": [10, 17, 21, 32, 38, 42, 53, 71, 75, 76, 81, 88, 95], "quantifi": [10, 14, 17, 25, 32, 35, 38, 48, 52, 54, 58, 70, 71, 82, 83, 86, 93, 95, 97], "formula": [10, 11, 14, 17, 25, 32, 35, 38, 48, 53, 54, 58, 61, 69, 70, 71, 81, 82, 85, 86, 88, 93, 95, 98], "foral": [10, 17, 32, 38, 53, 71, 81, 86, 91, 95], "enumer": [10, 11, 16, 19, 22, 32, 81, 82, 86, 90, 92], "internal_kind": [10, 32], "intern": [10, 11, 19, 21, 32, 40, 52, 56, 81, 82, 84, 85, 86, 87, 88, 89, 90, 98], "serv": [10, 32], "abstract": [10, 21, 32, 56, 81, 88], "appear": [10, 14, 25, 32, 35, 54, 58, 70, 81], "queri": [10, 14, 15, 17, 19, 20, 25, 32, 35, 36, 38, 41, 54, 56, 58, 60, 61, 62, 70, 72, 74, 81, 82, 90], "simplifi": [10, 17, 21, 32, 38, 42, 46, 47, 49, 50, 56, 63, 81], "form": [10, 11, 14, 17, 25, 32, 35, 38, 45, 54, 56, 58, 70, 81, 86, 92], "never": [10, 32, 81], "undefined_kind": [10, 32], "undefin": [10, 32], "null_term": [10, 32], "other": [10, 14, 18, 19, 21, 22, 25, 32, 35, 38, 43, 46, 47, 48, 50, 52, 54, 55, 56, 58, 60, 63, 70, 80, 81, 84, 86, 89, 95], "than": [10, 13, 14, 16, 18, 21, 25, 32, 35, 37, 38, 45, 47, 54, 58, 60, 70, 80, 81, 86, 94], "uninterpreted_sort_valu": [10, 32], "uninterpret": [10, 17, 18, 21, 32, 38, 39, 42, 48, 62, 83, 94, 97], "chainabl": [10, 32], "ariti": [10, 17, 18, 32, 38, 39, 48, 49, 63, 71], "n": [10, 17, 21, 32, 38, 42, 45, 47, 49, 51, 61, 62, 63, 69, 75, 76, 77, 80, 81, 86, 88, 91, 92, 93, 94], "mkop": [10, 17, 32, 38, 60, 66, 67, 92], "uint32_t": [10, 17, 18, 21, 38, 86], "distinct": [10, 17, 32, 38, 48, 50, 59, 62, 63, 73, 91, 94, 95], "mkconst": [10, 14, 17, 21, 25, 32, 35, 38, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 91, 92, 94, 95, 98], "Not": [10, 32, 48, 50, 56, 62, 63, 67, 75, 86], "permit": [10, 32], "bind": [10, 19, 23, 24, 32, 75, 76], "exist": [10, 14, 17, 19, 25, 32, 35, 38, 53, 58, 65, 81, 86, 93], "bound": [10, 17, 21, 32, 38, 42, 48, 53, 69, 81, 86, 94], "mkvar": [10, 17, 21, 32, 38, 65, 71, 75, 76, 77, 95], "lambda": [10, 17, 32, 38, 53, 75, 76, 77, 81], "bodi": [10, 17, 32, 38, 53, 61, 75, 76, 77, 81], "sexpr": [10, 32, 45, 46, 47, 48, 50, 56], "express": [10, 17, 18, 21, 32, 38, 39, 45, 46, 47, 48, 49, 50, 51, 53, 55, 56, 67, 74, 86], "0": [10, 14, 17, 18, 21, 24, 25, 32, 35, 38, 39, 42, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 60, 61, 62, 63, 65, 66, 68, 69, 70, 71, 74, 75, 76, 77, 80, 81, 82, 83, 85, 86, 91, 92, 93, 94, 95, 96, 98], "remov": [10, 17, 32, 38, 55, 56, 81, 86, 91], "cpp": [10, 14, 25, 35, 44, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 88, 91, 95, 98], "variable_list": [10, 32, 71, 95], "wit": [10, 17, 32, 38, 86, 88], "x": [10, 11, 14, 17, 21, 24, 25, 32, 35, 38, 42, 45, 47, 48, 50, 51, 53, 54, 56, 58, 59, 60, 62, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 86, 91, 92, 93, 94, 95, 98], "f": [10, 21, 32, 42, 48, 53, 56, 62, 73, 74, 75, 76, 77, 81, 82, 86, 92, 93, 95], "element": [10, 17, 18, 21, 32, 38, 39, 42, 46, 48, 49, 53, 55, 56, 59, 61, 73, 81, 91, 93, 94, 95], "descript": [10, 13, 17, 32, 84, 87], "planetmath": 10, "org": [10, 49, 50, 88], "hilbertsvarepsilonoper": 10, "satisfi": [10, 14, 15, 17, 22, 25, 32, 35, 36, 38, 43, 54, 56, 58, 60, 61, 62, 69, 70, 72, 79, 81, 86, 88, 93], "But": [10, 32], "enforc": [10, 32, 81, 89], "axiom": [10, 32, 81, 86], "ensur": [10, 32, 81, 86, 95], "uniqu": [10, 32, 48, 86], "up": [10, 32, 61, 80, 81, 86], "logic": [10, 14, 17, 25, 32, 35, 38, 47, 54, 56, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 82, 85, 88, 91, 94, 95, 97], "equiv": [10, 32, 81, 86], "rightarrow": [10, 17, 32, 86, 91], "3": [10, 14, 16, 24, 25, 32, 35, 45, 47, 48, 50, 54, 56, 58, 59, 61, 67, 69, 70, 73, 81, 82, 86, 88, 90, 91, 92, 95], "inst_pattern_list": [10, 32], "primarili": [10, 32], "model": [10, 11, 14, 17, 25, 32, 35, 38, 50, 52, 54, 58, 59, 61, 62, 65, 67, 70, 71, 72, 73, 74, 81, 86, 88, 91, 93, 95], "arithmet": [10, 14, 16, 25, 32, 35, 47, 52, 54, 58, 62, 64, 67, 70, 83, 86, 88, 97, 98], "support": [10, 17, 21, 24, 32, 38, 42, 44, 48, 49, 52, 57, 63, 71, 79, 81, 82, 83, 85, 89, 91, 92, 93, 94, 95, 96, 97, 98], "parser": [10, 32], "moreov": [10, 32], "cautiou": [10, 32], "gener": [10, 19, 21, 32, 52, 56, 63, 81, 82, 85, 86, 89, 90], "valid": [10, 11, 13, 17, 32, 81, 86], "semant": [10, 17, 21, 32, 75, 76, 81], "unintuit": [10, 32], "unsatisfi": [10, 14, 15, 17, 25, 32, 35, 38, 52, 54, 56, 58, 66, 70, 93], "wherea": [10, 32], "notic": [10, 14, 25, 32, 35, 54, 58, 86, 93, 95], "z": [10, 21, 32, 42, 45, 47, 48, 50, 67, 74, 86, 93, 94, 95], "const_boolean": [10, 32], "boolean": [10, 14, 17, 18, 19, 21, 25, 32, 35, 38, 39, 42, 52, 53, 54, 56, 58, 62, 68, 70, 75, 77, 81, 86, 88, 93], "mktrue": [10, 17, 32, 38, 61], "mkfals": [10, 17, 32, 38], "mkboolean": [10, 17, 32, 38, 65], "NOT": [10, 32, 61, 67, 71, 75, 86, 90, 95], "negat": [10, 21, 32, 42, 45, 47, 48, 56, 60, 62, 69, 81, 86], "AND": [10, 32, 60, 61, 62, 65, 67, 69, 72, 74, 75, 76, 81, 90], "conjunct": [10, 21, 32, 42, 47, 81], "impli": [10, 17, 32, 38, 46, 48, 60, 61, 62, 66, 67, 81, 86], "implic": [10, 21, 32, 42, 48, 86], "OR": [10, 32, 60, 67, 75, 86], "disjunct": [10, 17, 21, 32, 38, 42, 47, 81], "xor": [10, 32, 47, 48, 60, 86], "exclus": [10, 21, 32, 42, 47, 81], "left": [10, 32, 47, 86, 93, 94], "ITE": [10, 32, 60, 75, 77, 81, 86], "els": [10, 14, 21, 25, 32, 35, 42, 48, 54, 58, 60, 70, 81, 92], "second": [10, 14, 25, 32, 35, 38, 47, 49, 54, 58, 63, 70, 93], "apply_uf": [10, 21, 32, 48, 62, 75, 76, 86, 90], "instanti": [10, 12, 17, 18, 32, 33, 38, 39, 52, 63, 81, 82, 86, 92], "cardinality_constraint": [10, 32], "cardin": [10, 17, 21, 32, 38, 42, 81, 88, 94, 95], "constraint": [10, 14, 17, 21, 25, 32, 35, 38, 42, 48, 52, 54, 56, 58, 69, 70, 71, 75, 76, 77, 81, 88, 93], "interpret": [10, 17, 32, 38, 56, 81, 89, 93, 95], "predic": [10, 17, 18, 32, 38, 39, 45, 49, 73, 81, 86, 91, 92, 93, 95], "uinterpret": [10, 32], "less": [10, 16, 18, 21, 32, 37, 45, 47, 81, 86], "upper": [10, 17, 21, 32, 38, 42, 69, 81, 86], "mkcardinalityconstraint": [10, 17, 32, 38], "ho_appli": [10, 32, 86], "higher": [10, 32, 34, 81, 86], "order": [10, 17, 18, 21, 32, 38, 39, 42, 49, 63, 81, 86, 94], "encod": [10, 17, 32, 38, 50, 60, 86], "domain": [10, 17, 18, 32, 38, 39, 46, 48, 49, 52, 55, 63, 81, 91, 93, 94], "real": [10, 14, 17, 18, 21, 25, 32, 35, 38, 39, 42, 45, 48, 50, 53, 54, 58, 69, 70, 81, 86, 97, 98], "match": [10, 17, 26, 27, 32, 38, 48, 49, 80, 81, 93], "mult": [10, 32, 45, 51, 69, 98], "iand": [10, 32, 81], "integ": [10, 14, 17, 18, 19, 21, 24, 25, 32, 35, 38, 39, 42, 45, 47, 48, 49, 50, 54, 56, 58, 62, 63, 65, 67, 69, 70, 71, 72, 73, 75, 76, 77, 81, 86, 90, 94, 95, 97], "wise": [10, 32, 47], "parameter": [10, 18, 32, 39, 63, 86], "posit": [10, 12, 16, 17, 21, 32, 33, 37, 38, 42, 50, 56, 67, 81, 86, 94], "width": [10, 17, 18, 21, 32, 38, 39, 42, 47, 60, 81], "k": [10, 24, 32, 38, 46, 49, 51, 61, 86], "_": [10, 18, 32, 39, 60, 61, 63, 66, 67, 81, 82, 85, 86, 92, 93, 95], "i_1": [10, 32, 86], "i_2": [10, 32, 86], "bv2int": [10, 32, 47], "bvand": [10, 32, 47, 81], "int2bv": [10, 32, 47], "indic": [10, 12, 17, 20, 21, 32, 33, 41, 42, 50, 81, 86, 89, 90], "pow2": [10, 32, 81], "power": [10, 32, 45, 61, 81], "rais": [10, 17, 32, 56], "neg": [10, 16, 17, 21, 32, 37, 38, 42, 45, 50, 76, 81, 86, 89, 94], "sub": [10, 14, 21, 25, 32, 35, 45, 54, 58, 69, 70, 75, 81, 86, 94], "divis": [10, 17, 32, 45, 47, 50, 81], "ints_divis": [10, 32], "ints_modulu": [10, 32], "modulu": [10, 32, 45, 47], "ab": [10, 32, 74, 81], "absolut": [10, 32, 50], "pow": [10, 32, 45], "exponenti": [10, 32, 45, 86, 98], "sine": [10, 32, 45, 81, 86, 98], "cosin": [10, 32, 45, 98], "tangent": [10, 32, 45, 81, 86, 98], "cosec": [10, 32, 45, 98], "secant": [10, 32, 45, 86, 98], "cotang": [10, 32, 45, 98], "arcsin": [10, 32, 45, 98], "arc": [10, 32], "arccosin": [10, 32, 45, 98], "arctang": [10, 32, 45, 98], "arccosec": [10, 32, 45, 98], "arcsec": [10, 32, 45, 98], "arccotang": [10, 32, 45, 98], "sqrt": [10, 32, 45, 98], "squar": [10, 32, 45, 50, 98], "root": [10, 32, 45, 50, 86, 98], "divid": [10, 14, 25, 32, 35, 54, 58, 70], "const_rat": [10, 32], "precis": [10, 16, 17, 24, 32, 37, 50, 67, 81, 89, 98], "ration": [10, 14, 17, 21, 24, 25, 32, 35, 42, 45, 54, 58, 67, 70, 86, 98], "mkreal": [10, 14, 17, 25, 32, 35, 38, 54, 58, 69, 70, 98], "int64_t": [10, 13, 14, 17, 19, 21, 25, 35, 54, 58, 70, 81, 90], "const_integ": [10, 32], "mkinteg": [10, 14, 17, 25, 32, 35, 38, 54, 58, 59, 62, 63, 69, 70, 72, 73, 74, 75, 76, 77, 91, 94, 95], "lt": [10, 14, 25, 32, 35, 45, 50, 54, 58, 69, 70, 77, 98], "leq": [10, 14, 25, 32, 35, 45, 50, 54, 58, 62, 69, 70, 75, 77, 86, 91], "gt": [10, 32, 45, 50, 63, 72, 81, 98], "greater": [10, 16, 18, 21, 32, 37, 45, 47, 86], "geq": [10, 32, 45, 50, 69, 71, 74, 75, 86, 91], "is_integ": [10, 32], "to_integ": [10, 32], "convert": [10, 14, 17, 25, 32, 35, 38, 42, 48, 49, 54, 56, 58, 67, 70, 81, 86, 87], "floor": [10, 32], "to_real": [10, 32, 45], "pi": [10, 17, 21, 32, 38, 42, 45, 67, 81, 86, 98], "mkpi": [10, 17, 32, 38, 98], "isrealvalu": [10, 21, 32, 42], "fix": [10, 18, 21, 32, 39, 42, 86, 94], "mkbitvector": [10, 17, 32, 38, 60, 61, 67], "uint64_t": [10, 13, 14, 17, 19, 21, 25, 35, 54, 58, 70, 81, 90], "bitvector_concat": [10, 32], "concaten": [10, 21, 32, 42, 47, 72, 74, 86, 94], "bitvector_and": [10, 32], "bitvector_or": [10, 32], "bitvector_xor": [10, 32, 60], "bitvector_not": [10, 32], "bitvector_nand": [10, 32], "nand": [10, 32], "bitvector_nor": [10, 32], "nor": [10, 32], "bitvector_xnor": [10, 32], "xnor": [10, 32], "bitvector_comp": [10, 32], "comparison": [10, 18, 21, 32, 47, 81, 86], "bitvector_mult": [10, 32, 61], "bitvector_add": [10, 32, 60], "bitvector_sub": [10, 32, 60], "bitvector_neg": [10, 32], "complement": [10, 32, 47, 55, 81, 95], "bitvector_udiv": [10, 32], "unsign": [10, 32, 42, 47, 50, 61, 81], "truncat": [10, 32], "toward": [10, 16, 32, 37, 50], "divisor": [10, 32], "zero": [10, 14, 16, 17, 21, 25, 26, 27, 32, 35, 37, 38, 42, 47, 50, 54, 58, 61, 62, 67, 70, 75, 76, 77, 81, 82, 86, 89], "bitvector_urem": [10, 32], "remaind": [10, 32, 47, 50], "dividend": [10, 32], "bitvector_sdiv": [10, 32], "sign": [10, 21, 32, 42, 47, 50, 81, 86, 90], "bitvector_srem": [10, 32], "bitvector_smod": [10, 32], "bitvector_shl": [10, 32], "shift": [10, 32, 47, 86], "bitvector_lshr": [10, 32], "right": [10, 14, 25, 32, 35, 47, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 93, 94, 95, 98], "bitvector_ashr": [10, 32], "bitvector_ult": [10, 32], "bitvector_ul": [10, 32], "bitvector_ugt": [10, 32], "bitvector_ug": [10, 32], "bitvector_slt": [10, 32, 61], "bitvector_sl": [10, 32], "bitvector_sgt": [10, 32, 61], "bitvector_sg": [10, 32], "bitvector_ultbv": [10, 32], "bitvector_sltbv": [10, 32], "bitvector_it": [10, 32, 81], "condit": [10, 17, 21, 32, 38, 42, 77, 81, 85, 86], "bitvector_redor": [10, 32], "redor": [10, 32], "bitvector_redand": [10, 32], "redand": [10, 32], "bitvector_extract": [10, 12, 17, 32, 33, 60, 66], "extract": [10, 32, 47, 49, 60, 62, 64, 80, 81, 94], "lower": [10, 32, 81, 86], "bitvector_repeat": [10, 17, 32], "repeat": [10, 32, 81], "time": [10, 14, 22, 25, 32, 35, 43, 47, 54, 58, 70, 81], "bitvector_zero_extend": [10, 17, 32], "extens": [10, 32, 71, 79, 91, 92, 93, 95, 98], "extend": [10, 32, 81, 85, 86, 98], "bitvector_sign_extend": [10, 17, 32], "bitvector_rotate_left": [10, 17, 32], "rotat": [10, 32, 47], "bitvector_rotate_right": [10, 17, 32], "int_to_bitvector": [10, 17, 32], "convers": [10, 32, 50, 96], "bitvector_to_nat": [10, 32], "const_floatingpoint": [10, 32], "float": [10, 14, 16, 17, 18, 21, 25, 32, 35, 37, 38, 39, 42, 45, 48, 52, 54, 58, 64, 70, 88, 90, 97], "ieee": [10, 16, 32, 50, 67, 80, 88], "754": [10, 16, 32, 67, 80, 88], "mkfloatingpoint": [10, 17, 32, 38, 67], "const_roundingmod": [10, 32], "mkroundingmod": [10, 17, 32, 38, 67], "floatingpoint_fp": [10, 32], "liter": [10, 11, 17, 32, 38, 48, 81, 82, 86, 93], "tripl": [10, 32], "expon": [10, 17, 18, 21, 32, 38, 39, 42, 50, 86], "significand": [10, 17, 18, 21, 32, 38, 39, 42, 50], "without": [10, 14, 17, 25, 32, 35, 38, 54, 58, 67, 70, 89], "hidden": [10, 32], "floatingpoint_eq": [10, 32, 67], "floatingpoint_ab": [10, 32], "floatingpoint_neg": [10, 32], "floatingpoint_add": [10, 32, 67], "floatingpoint_sub": [10, 32], "sutract": [10, 32], "floatingpoint_mult": [10, 32], "multipli": [10, 14, 25, 32, 35, 50, 54, 58, 70], "floatingpoint_div": [10, 32], "floatingpoint_fma": [10, 32], "fuse": [10, 32, 50], "4": [10, 14, 16, 25, 32, 35, 45, 47, 50, 54, 58, 59, 61, 70, 81, 90, 91, 92, 95], "floatingpoint_sqrt": [10, 32], "floatingpoint_rem": [10, 32], "floatingpoint_rti": [10, 32], "round": [10, 16, 17, 18, 21, 32, 37, 38, 39, 42, 52, 61, 67, 81], "integr": [10, 21, 32, 52, 88, 90], "floatingpoint_min": [10, 32], "minimum": [10, 13, 32, 50, 80, 81, 86], "floatingpoint_max": [10, 32], "maximum": [10, 13, 32, 50, 69, 80, 81, 86], "floatingpoint_leq": [10, 32, 67], "floatingpoint_lt": [10, 32, 67], "floatingpoint_geq": [10, 32], "floatingpoint_gt": [10, 32], "floatingpoint_is_norm": [10, 32, 67], "normal": [10, 17, 32, 38, 50, 67, 81, 86], "floatingpoint_is_subnorm": [10, 32], "floatingpoint_is_zero": [10, 32], "floatingpoint_is_inf": [10, 32, 67], "infinit": [10, 16, 32, 37, 49, 81, 94, 95], "floatingpoint_is_nan": [10, 32, 67], "nan": [10, 17, 32, 38, 50, 67], "floatingpoint_is_neg": [10, 32], "floatingpoint_is_po": [10, 32], "floatingpoint_to_fp_from_ieee_bv": [10, 17, 32], "floatingpoint_to_fp_from_fp": [10, 17, 32], "floatingpoint_to_fp_from_r": [10, 17, 32], "floatingpoint_to_fp_from_sbv": [10, 17, 32], "floatingpoint_to_fp_from_ubv": [10, 17, 32], "floatingpoint_to_ubv": [10, 17, 32], "floatingpoint_to_sbv": [10, 17, 32, 67], "floatingpoint_to_r": [10, 32, 67], "select": [10, 16, 27, 32, 37, 46, 61, 81, 82, 86, 89, 92], "const_arrai": [10, 32], "eq_rang": [10, 32], "b": [10, 14, 17, 18, 24, 25, 32, 35, 39, 45, 46, 47, 48, 49, 50, 54, 55, 56, 58, 59, 60, 67, 70, 71, 73, 81, 83, 85, 86, 88, 91, 92, 93, 94, 95], "rang": [10, 32, 46, 48, 49, 55, 61, 63, 67, 74, 75, 76, 77, 81, 86], "j": [10, 17, 32, 38, 46, 49, 63, 86, 88, 92, 94], "inclus": [10, 32, 81], "current": [10, 13, 14, 17, 25, 32, 35, 38, 42, 52, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 83, 86, 89, 90, 91, 94, 95, 97, 98], "creation": [10, 32], "enabl": [10, 14, 17, 23, 25, 32, 35, 38, 54, 56, 58, 70, 80, 81, 82, 92, 98], "exp": [10, 17, 32, 38, 50, 72, 74, 81, 86, 98], "misappli": [10, 32], "belong": [10, 11, 12, 21, 32, 93], "field": [10, 17, 32, 38, 49, 92], "libv2": [10, 14, 25, 32, 35, 54, 57, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 81, 91, 95, 98], "l": [10, 24, 32, 49, 80, 81, 86, 88, 93, 96], "h": [10, 14, 25, 32, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 86, 91, 93, 95, 98], "repres": [10, 12, 17, 18, 19, 21, 24, 32, 33, 38, 45, 47, 48, 50, 53, 56, 61, 81, 86, 91], "ast": [10, 21, 32, 42, 45, 46, 47, 48, 49, 50, 53, 55, 56, 81], "match_bind_cas": [10, 32], "match_cas": [10, 32], "pattern": [10, 32, 52, 81], "cover": [10, 13, 32, 80, 81, 86], "least": [10, 16, 17, 32, 37, 38, 48, 73, 81, 95], "catch": [10, 32, 65], "against": [10, 32], "evalu": [10, 14, 25, 32, 35, 47, 54, 56, 58, 63, 70, 81, 86, 92], "binder": [10, 17, 32, 38, 86], "contain": [10, 11, 17, 18, 21, 32, 38, 39, 42, 48, 49, 53, 56, 80, 81, 85, 86, 94, 95], "tuple_project": [10, 17, 32, 92], "project": [10, 14, 25, 32, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 92, 95, 98], "take": [10, 17, 18, 21, 32, 38, 39, 42, 50, 55, 81, 89], "obtain": [10, 13, 14, 17, 19, 25, 32, 35, 38, 40, 54, 58, 70, 86, 90, 94, 96], "compon": [10, 11, 14, 17, 25, 32, 35, 38, 54, 58, 70, 86, 89], "its": [10, 11, 12, 13, 17, 19, 21, 32, 33, 42, 48, 49, 63, 75, 76, 81, 86, 87, 89, 90, 91, 93], "10": [10, 14, 17, 21, 25, 32, 35, 42, 45, 46, 47, 49, 50, 54, 56, 58, 70, 77, 81, 88], "20": [10, 32, 49, 50, 88], "30": [10, 32, 56, 66], "40": [10, 32], "yield": [10, 32], "sep_nil": [10, 32], "separ": [10, 17, 32, 38, 44, 48, 69, 75, 76, 77, 88, 97], "mksepnil": [10, 17, 32, 38, 93], "sep_emp": [10, 32], "empti": [10, 15, 17, 19, 23, 32, 36, 38, 49, 55, 59, 71, 72, 73, 81, 86, 91, 93, 94, 95], "heap": [10, 17, 32, 38, 81, 93], "mksepemp": [10, 17, 32, 38, 93], "sep_pto": [10, 32, 93], "relat": [10, 17, 18, 32, 38, 52, 64, 77, 79, 81, 86, 88, 93, 97], "denot": [10, 14, 25, 32, 35, 54, 58, 70, 71, 86, 92, 93, 94], "locat": [10, 17, 32, 38, 80, 93], "data": [10, 17, 21, 32, 38, 42, 88, 92, 93], "sep_star": [10, 32, 93], "star": [10, 32, 93], "child": [10, 21, 32, 42, 62], "hold": [10, 13, 19, 21, 32, 42, 48, 61, 67, 73, 81, 82, 85, 86, 95], "disjoint": [10, 32, 59, 71, 91, 93], "sep_wand": [10, 32, 93], "magic": [10, 32, 93], "wand": [10, 32, 93], "antecend": [10, 32], "conclus": [10, 32, 81, 86], "anteced": [10, 32], "set_empti": [10, 32], "mkemptyset": [10, 17, 32, 38, 71, 73, 95], "set_union": [10, 32, 71, 73, 95], "union": [10, 21, 32, 42, 49, 55, 59, 71, 73, 74, 86, 91, 93, 95], "set_int": [10, 32, 71, 73, 95], "intersect": [10, 32, 55, 59, 71, 73, 81, 86, 91, 95], "set_minu": [10, 32, 95], "set_subset": [10, 32, 71, 73, 95], "subset": [10, 11, 14, 17, 25, 32, 35, 38, 54, 55, 58, 70, 71, 73, 81, 95], "set_memb": [10, 32, 71, 73, 95], "membership": [10, 32, 91, 95], "member": [10, 13, 32, 55, 71, 73, 91, 95], "set_singleton": [10, 32, 73, 95], "singleton": [10, 21, 32, 42, 55, 73, 95], "set_insert": [10, 32, 95], "insert": [10, 32, 56, 75, 76, 77, 95], "set_card": [10, 32, 95], "set_compl": [10, 32, 95], "respect": [10, 13, 17, 19, 21, 32, 81, 86, 89, 93, 97], "set_univers": [10, 21, 32, 42], "mkuniverseset": [10, 17, 32, 38, 71, 95], "theori": [10, 11, 16, 17, 18, 21, 22, 32, 38, 43, 52, 64, 79, 83, 85, 86, 88, 89, 90], "issetvalu": [10, 21, 32, 42], "set_comprehens": [10, 32], "comprehens": [10, 32, 87], "specifi": [10, 11, 16, 17, 32, 38, 48, 63, 80, 81, 86, 98], "x_1": [10, 17, 32, 38, 86], "x_n": [10, 32, 38, 86], "p": [10, 17, 21, 32, 38, 48, 49, 53, 56, 62, 81, 82, 86, 88], "y": [10, 14, 21, 24, 25, 32, 35, 42, 45, 47, 48, 50, 53, 54, 56, 58, 62, 67, 69, 70, 72, 74, 75, 81, 82, 86, 88, 91, 93, 94, 95, 98], "wedg": [10, 14, 17, 25, 32, 35, 38, 54, 58, 86], "leftrightarrow": [10, 32, 86], "set_choos": [10, 32], "choos": [10, 14, 25, 32, 35, 54, 58, 70, 80, 81], "determinist": [10, 32, 89], "set_is_singleton": [10, 32], "set_map": [10, 32], "map": [10, 17, 18, 19, 21, 32, 38, 39, 42, 48, 86, 90], "s_1": [10, 32, 86], "s_2": [10, 32, 86], "set_filt": [10, 32], "filter": [10, 32, 81], "bag": [10, 17, 18, 32, 38, 39, 52, 64, 97], "set_fold": [10, 32], "fold": [10, 32, 84], "combin": [10, 32, 64, 71, 79, 81, 97], "start": [10, 14, 17, 25, 26, 27, 32, 35, 38, 54, 58, 70, 75, 76, 82, 85, 93, 94], "initi": [10, 17, 32, 38, 49, 81], "relation_join": [10, 32, 71, 95], "join": [10, 32, 71, 95], "relation_product": [10, 32, 95], "cartesian": [10, 32], "product": [10, 24, 32, 47, 56, 79, 81, 95], "relation_transpos": [10, 32, 71, 95], "transpos": [10, 32, 71, 95], "relation_tclosur": [10, 32, 71, 95], "transit": [10, 17, 32, 38, 71, 77, 81, 86, 95], "closur": [10, 32, 71, 95], "relation_join_imag": [10, 32], "imag": [10, 32], "relation_iden": [10, 32], "ident": [10, 12, 21, 32, 48, 76, 92], "relation_group": [10, 32], "group": [10, 32, 81], "rel": [10, 32, 71, 95], "n_1": [10, 32], "dot": [10, 32, 38, 42, 81, 86, 87], "n_k": [10, 32], "partit": [10, 32, 81], "have": [10, 14, 17, 18, 19, 21, 25, 32, 35, 38, 44, 48, 49, 54, 56, 58, 60, 70, 71, 80, 81, 86, 91, 92, 93, 94, 95], "part": [10, 14, 17, 23, 25, 32, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 83, 89, 90, 91, 94, 95, 98], "relation_aggreg": [10, 32], "aggreg": [10, 32], "aggr": [10, 32], "natur": [10, 32, 91, 98], "t_1": [10, 32, 86], "t_j": [10, 32], "relation_project": [10, 32], "bag_empti": [10, 32], "mkemptybag": [10, 17, 32, 38, 59, 91], "bag_union_max": [10, 32, 59, 91], "max": [10, 32, 48, 59, 75, 81, 91], "bag_union_disjoint": [10, 32, 59, 91], "sum": [10, 32, 45, 47, 49, 56, 62, 81, 86], "bag_inter_min": [10, 32, 59, 91], "min": [10, 32, 75, 81, 91, 96], "bag_difference_subtract": [10, 32, 91], "bag_difference_remov": [10, 32], "share": [10, 21, 24, 32, 81, 83], "bag_subbag": [10, 32, 59, 91], "bag_count": [10, 32, 59, 91], "bag_memb": [10, 32, 91], "bag_duplicate_remov": [10, 32, 91], "duplic": [10, 18, 21, 32, 39, 42, 91], "elimin": [10, 17, 32, 38, 81, 86, 91], "exactli": [10, 17, 32, 38], "bag_mak": [10, 32, 59, 91], "make": [10, 19, 24, 32, 61, 66, 67, 72, 74, 80, 81, 91, 95], "bag_card": [10, 32], "bag_choos": [10, 32], "bag_is_singleton": [10, 32], "bag_from_set": [10, 32], "bag_to_set": [10, 32], "bag_map": [10, 32], "bag_filt": [10, 32], "subbag": [10, 32, 59, 91], "bag_fold": [10, 32], "bag_partit": [10, 32], "r": [10, 15, 32, 48, 49, 56, 67, 74, 80, 82, 86, 92], "table_product": [10, 32], "tabl": [10, 18, 32, 48, 91, 92, 93, 94, 95], "cross": [10, 32, 81], "table_project": [10, 32], "table_aggreg": [10, 32], "table_join": [10, 32], "m_1": [10, 32, 91], "m_k": [10, 32], "table_group": [10, 32], "string_concat": [10, 32, 74], "concat": [10, 32, 47, 50, 72, 81], "string_in_regexp": [10, 32, 74], "reglan": [10, 18, 32, 39, 74, 96], "string_length": [10, 32, 74], "length": [10, 18, 32, 39, 72, 74, 75, 76, 77, 81, 86, 94], "string_substr": [10, 32], "substr": [10, 32, 86, 96], "string_upd": [10, 32], "replac": [10, 18, 21, 32, 38, 39, 42, 56, 81, 86, 92, 94], "otherwis": [10, 17, 18, 21, 32, 38, 42, 81, 86, 94, 96], "origin": [10, 14, 25, 32, 35, 54, 58, 70, 81, 86], "preserv": [10, 32], "strong": [10, 32, 81], "string_charat": [10, 32], "charact": [10, 17, 32, 38, 81, 90, 96], "string_contain": [10, 32], "whether": [10, 13, 14, 17, 19, 20, 25, 32, 35, 38, 41, 48, 50, 54, 56, 58, 61, 68, 70, 81, 86, 90, 92], "anoth": [10, 14, 25, 32, 35, 54, 58, 60, 70, 81, 89], "alwai": [10, 32, 49, 55, 81, 86, 90, 95], "string_indexof": [10, 32], "string_indexof_r": [10, 32], "string_replac": [10, 32], "s_3": [10, 32], "unmodifi": [10, 32, 76], "string_replace_al": [10, 32], "occurr": [10, 32, 56, 86, 92, 94], "string_replace_r": [10, 32], "string_replace_re_al": [10, 32], "string_to_low": [10, 32], "string_to_upp": [10, 32], "string_rev": [10, 32], "revers": [10, 32, 86, 94, 96], "string_to_cod": [10, 32], "code": [10, 25, 32, 48, 60, 61, 80, 81, 86, 96], "string_from_cod": [10, 32], "string_lt": [10, 32], "strictli": [10, 32], "lexiograph": [10, 32], "string_leq": [10, 32], "string_prefix": [10, 32], "s1": [10, 32, 74, 94], "string_suffix": [10, 32], "suffix": [10, 32, 86, 94], "string_is_digit": [10, 32], "digit": [10, 16, 32, 37], "9": [10, 14, 24, 25, 32, 35, 54, 58, 70, 80], "string_from_int": [10, 32], "string_to_int": [10, 32], "total": [10, 32, 81], "const_str": [10, 32], "mkstring": [10, 17, 32, 38, 59, 74, 91], "wstring": [10, 17, 21], "string_to_regexp": [10, 32, 74], "regexp": [10, 17, 32, 39, 81], "regexp_concat": [10, 32, 74], "regexp_union": [10, 32, 74], "regexp_int": [10, 32], "regexp_diff": [10, 32], "regexp_star": [10, 32, 74], "regexp_plu": [10, 32], "regexp_opt": [10, 32], "regexp_rang": [10, 32, 74], "regexp_repeat": [10, 32], "repetit": [10, 32], "regexp_loop": [10, 32], "loop": [10, 32, 61, 62, 63, 81], "regexp_non": [10, 32], "none": [10, 17, 32, 38, 45, 46, 47, 48, 49, 50, 53, 55, 56, 81, 83], "mkregexpnon": [10, 17, 32, 38], "regexp_al": [10, 32], "mkregexpal": [10, 17, 32, 38], "regexp_allchar": [10, 32], "mkregexpallchar": [10, 17, 32, 38], "regexp_compl": [10, 32], "seq_concat": [10, 21, 32, 72, 94], "sequenc": [10, 17, 18, 21, 32, 38, 39, 42, 52, 64, 81, 86, 90, 97], "seq_length": [10, 32, 72, 94], "seq_extract": [10, 32, 94], "subsequ": [10, 32], "seq_upd": [10, 32, 94], "seq_at": [10, 32, 94], "seq_contain": [10, 32, 94], "check": [10, 14, 17, 22, 25, 32, 35, 38, 43, 49, 50, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 83, 85, 86, 88, 89, 90, 91, 92, 93, 94, 95, 98], "seq_indexof": [10, 32, 94], "seq_replac": [10, 32, 94], "seq_replace_al": [10, 32, 94], "seq_rev": [10, 32, 94], "seq_prefix": [10, 32, 94], "seq_suffix": [10, 32, 94], "const_sequ": [10, 21, 32], "seq": [10, 21, 32, 72, 81, 94], "unit": [10, 11, 21, 32, 42, 72, 81, 86, 94], "c1": [10, 21, 32, 42, 81, 92, 93], "cn": [10, 32, 93], "c_1": [10, 21, 32, 42, 86], "c_n": [10, 21, 32, 42, 86], "some": [10, 13, 14, 17, 21, 25, 32, 35, 38, 42, 52, 54, 58, 61, 62, 69, 70, 80, 81, 86, 89, 90, 92, 94, 96], "getsequencevalu": [10, 21, 32, 42], "mkemptysequ": [10, 17, 32, 38, 72, 94], "seq_unit": [10, 21, 32, 72, 94], "seq_nth": [10, 32, 94], "nth": [10, 32, 94], "inst_pattern": [10, 32], "existenti": [10, 32, 53, 81, 86], "under": [10, 14, 25, 32, 35, 54, 58, 70, 80, 81, 86], "inst_no_pattern": [10, 32], "inst_pool": [10, 17, 32], "pool": [10, 17, 32, 38, 81], "annot": [10, 32, 81, 86], "declarepool": [10, 17, 32, 38], "q": [10, 17, 32, 38, 45, 48, 53, 56, 72, 74, 81, 82, 86], "occur": [10, 11, 32, 81, 86, 89], "compris": [10, 32], "inst_add_to_pool": [10, 32], "instantanti": [10, 32], "assum": [10, 17, 32, 38, 47, 48, 49, 56, 59, 60, 62, 66, 67, 73, 81, 82, 83, 86, 91, 92, 93, 94, 95], "skolem_add_to_pool": [10, 32], "skolem": [10, 32, 81, 86], "inst_attribut": [10, 32], "attribut": [10, 17, 32, 38], "custom": [10, 32, 56, 81, 84], "properti": [10, 32, 67, 90], "ascrib": [10, 32], "keyword": [10, 17, 32, 38, 56], "last_kind": [10, 32], "mark": [10, 32], "templat": [10, 12, 13, 18, 21, 81], "struct": [10, 12, 13, 18, 21], "hash": [10, 12, 18, 21, 48], "blockmodelsmod": [11, 17], "block": [11, 17, 38, 92], "how": [11, 17, 19, 38, 57, 62, 64, 67, 75, 76, 77, 80, 81, 86, 90, 91, 95], "blockmodel": [11, 17, 38], "blockmodelvalu": [11, 17, 38], "sat": [11, 14, 17, 24, 25, 35, 38, 49, 50, 54, 56, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 82, 83, 85, 86, 88, 89, 91, 92, 93, 94, 95, 98], "skeleton": 11, "concret": [11, 48, 92], "learnedlittyp": [11, 17, 38], "learn": [11, 17, 38, 81], "categori": [11, 80], "getlearnedliter": [11, 17, 38], "note": [11, 18, 21, 39, 42, 45, 48, 50, 51, 63, 80, 81, 85, 86, 87, 88, 92, 96], "conceptu": [11, 86], "classifi": 11, "criteria": [11, 81], "thei": [11, 13, 14, 21, 25, 35, 54, 58, 70, 81, 86, 89], "meet": [11, 81], "learned_lit_preprocess_solv": 11, "turn": [11, 14, 16, 25, 35, 42, 54, 58, 70, 81], "substitut": [11, 18, 21, 39, 42, 56, 81, 82, 86], "dure": [11, 18, 21, 39, 42, 80, 81, 82, 86, 89], "preprocess": [11, 22, 43, 81, 82, 86, 89], "particular": [11, 13, 17, 19, 81, 86, 90, 92, 95], "learned_lit_preprocess": 11, "top": [11, 14, 17, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 86, 91, 92, 95, 98], "level": [11, 14, 17, 25, 34, 35, 38, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 86, 91, 95, 98], "claus": [11, 81, 86], "learned_lit_input": [11, 17, 38], "typic": 11, "interest": [11, 62, 80, 81], "learned_lit_solv": 11, "solvabl": [11, 81], "learned_lit_constant_prop": 11, "made": [11, 17, 38], "propag": [11, 52, 81, 86], "learned_lit_intern": 11, "fall": 11, "learned_lit_unknown": 11, "produc": [11, 14, 17, 25, 35, 38, 48, 54, 58, 59, 61, 62, 65, 67, 70, 71, 72, 73, 74, 80, 81, 83, 85, 87, 91, 95], "proofcompon": [11, 17, 38], "proof": [11, 17, 38, 67, 79, 88], "proof_component_raw_preprocess": 11, "g1": [11, 76], "gn": 11, "assumpt": [11, 17, 38, 56, 60, 62, 81, 86], "f1": [11, 86, 93], "fm": 11, "necessarili": 11, "proof_component_preprocess": 11, "gu1": 11, "gun": 11, "fu1": 11, "fum": 11, "unsat": [11, 14, 17, 24, 25, 35, 38, 49, 50, 54, 56, 58, 59, 60, 62, 65, 66, 67, 69, 70, 81, 82, 83, 85, 86, 90, 91, 93, 94, 95, 98], "core": [11, 14, 17, 24, 25, 35, 38, 52, 54, 58, 70, 81, 86, 89, 90], "befor": [11, 17, 38, 81, 82], "immedi": [11, 17, 38, 89], "respons": [11, 17, 21, 38, 81], "proof_component_sat": 11, "l1": [11, 49], "lk": 11, "lemma": [11, 81, 86, 89, 90], "proof_component_theory_lemma": 11, "contrast": [11, 17, 21, 38, 89], "proof_component_ful": [11, 17, 38], "ltype": 11, "write": [11, 25, 58, 81, 86], "pc": 11, "syntact": [12, 17, 21, 38], "node": [12, 21, 48, 49, 81, 84, 86, 92, 93], "manag": [12, 21, 80, 81], "getkind": [12, 21, 33, 42, 75, 76, 77], "isindex": [12, 33], "iff": [12, 21, 33, 38, 39, 42, 86, 92, 93], "getnumindic": [12, 33], "about": [13, 17, 38, 49, 59, 71, 72, 73, 74, 82, 86, 90, 91, 95], "alias": [13, 56, 81], "inform": [13, 14, 17, 19, 25, 35, 38, 40, 49, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 82, 90, 91, 95, 98], "concern": 13, "inspect": [13, 19, 21, 81, 90], "valueinfo": 13, "altern": [13, 14, 21, 25, 35, 44, 54, 57, 58, 62, 63, 70, 80, 81, 86, 92, 98], "voidinfo": 13, "nativ": [13, 21, 42, 80], "default": [13, 18, 19, 21, 38, 40, 42, 46, 50, 55, 56, 80, 81, 84, 86, 90], "numberinfo": 13, "doubl": [13, 19, 50, 81, 86, 90], "modeinfo": 13, "conveni": [13, 86], "manner": [13, 81, 86], "boolvalu": 13, "stringvalu": 13, "intvalu": 13, "uintvalu": 13, "doublevalu": 13, "expect": [13, 14, 24, 25, 35, 45, 48, 49, 54, 58, 60, 61, 63, 66, 67, 70, 86, 93], "also": [13, 14, 17, 18, 19, 21, 25, 35, 38, 39, 45, 47, 49, 54, 58, 62, 63, 67, 69, 70, 80, 81, 83, 85, 86, 90, 92, 95, 97], "getdriveropt": [13, 17], "optioninfovari": 13, "variant": [13, 49], "possibl": [13, 14, 19, 25, 35, 54, 58, 70, 80, 81, 89, 95], "setbyus": [13, 56], "defaultvalu": 13, "currentvalu": 13, "typenam": 13, "numer": [13, 14, 17, 21, 25, 26, 27, 35, 38, 45, 47, 50, 54, 58, 70, 81], "basic": [13, 52, 68, 81, 85], "instanc": [14, 19, 25, 35, 48, 49, 73, 81, 92, 95], "ask": [14, 25, 35, 54, 58, 65, 70], "setopt": [14, 17, 25, 35, 38, 54, 56, 58, 59, 61, 62, 65, 67, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 95], "next": [14, 17, 25, 35, 38, 54, 58, 62, 63, 70, 81], "simplest": [14, 25, 35, 54, 58, 70], "wai": [14, 16, 25, 35, 54, 57, 58, 70, 81, 86, 89], "qf_all": [14, 25, 35, 54, 58, 70, 93, 95], "To": [14, 25, 35, 49, 54, 58, 63, 70, 80, 86, 89, 92, 93, 98], "optim": [14, 25, 35, 54, 58, 70, 81, 86], "behavior": [14, 25, 35, 54, 58, 70], "qf_bv": [14, 25, 35, 54, 58, 60, 66, 70], "qf_aufbv": [14, 25, 35, 54, 58, 61, 70], "setlog": [14, 17, 25, 35, 38, 54, 58, 59, 60, 61, 62, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 92, 93, 94, 95, 98], "realsort": [14, 25, 35, 45, 47, 48, 53, 54, 58, 70], "getrealsort": [14, 17, 25, 35, 38, 54, 58, 69, 70, 98], "intsort": [14, 25, 35, 45, 46, 47, 48, 49, 50, 51, 53, 54, 55, 56, 58, 62, 63, 70, 73, 94], "getintegersort": [14, 17, 25, 35, 38, 54, 58, 62, 63, 65, 69, 70, 71, 72, 73, 75, 76, 77, 92, 94, 95], "now": [14, 25, 35, 49, 54, 58, 63, 67, 70, 81], "actual": [14, 15, 19, 25, 35, 36, 49, 54, 56, 58, 63, 86, 89], "regard": [14, 25, 35, 54, 58, 70], "them": [14, 25, 35, 54, 56, 58, 63, 70, 81, 85], "formal": [14, 25, 35, 54, 58, 70, 88], "Their": [14, 25, 35, 54, 58, 70], "gradual": [14, 25, 35, 54, 58, 70], "xplusi": [14, 25, 35, 54, 58, 70], "src": [14, 25, 35, 54, 58, 70, 94], "cvc5_kind": [14, 25, 35, 54, 58, 70], "constraint1": [14, 25, 35, 54, 58, 70], "constraint2": [14, 25, 35, 54, 58, 70], "constraint3": [14, 25, 35, 54, 58, 70], "constraint4": [14, 25, 35, 54, 58, 70], "assertformula": [14, 17, 25, 35, 38, 54, 58, 60, 61, 62, 63, 66, 67, 69, 70, 71, 95, 98], "r1": [14, 25, 35, 54, 58, 70], "checksat": [14, 15, 17, 25, 35, 36, 38, 54, 58, 60, 62, 63, 65, 67, 69, 70, 71, 81, 89, 95, 98], "either": [14, 17, 25, 26, 27, 35, 38, 54, 56, 58, 67, 70, 81, 86, 89, 90, 94], "unknown": [14, 15, 17, 20, 22, 25, 35, 36, 38, 41, 54, 56, 58, 70, 81, 82, 86, 89], "statu": [14, 25, 35, 81, 86, 93, 94], "issat": [14, 15, 25, 35, 36, 59, 67, 72, 73, 74, 91, 95], "isunsat": [14, 15, 25, 35, 36], "issatunknown": [14, 25, 35], "print": [14, 17, 19, 25, 35, 38, 45, 46, 47, 48, 50, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 82, 83, 85, 86, 89, 90, 91, 95, 98], "cout": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "endl": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "xval": [14, 25, 35, 54, 58, 70], "getvalu": [14, 17, 21, 25, 35, 38, 54, 58, 59, 61, 62, 67, 70, 71, 72, 73, 74, 91, 95], "yval": [14, 25, 35, 54, 58, 70], "do": [14, 17, 19, 25, 35, 38, 44, 48, 54, 56, 58, 60, 61, 70, 81], "xminusi": [14, 25, 35, 54, 58, 70], "xminusyv": [14, 25, 35, 54, 58, 70], "xstr": [14, 25, 35, 54, 58, 70], "getrealvalu": [14, 21, 25, 35, 42, 54, 58, 70], "ystr": [14, 25, 35, 54, 58, 70], "xminusystr": [14, 25, 35, 54, 58, 70], "further": [14, 25, 35, 54, 58, 70, 80, 81], "pair": [14, 17, 21, 24, 25, 35, 42, 49, 54, 56, 58, 70, 92], "xpair": [14, 25, 35, 54, 58, 70], "getreal64valu": [14, 21, 25, 35, 54, 58, 70], "ypair": [14, 25, 35, 54, 58, 70], "xminusypair": [14, 25, 35, 54, 58, 70], "independ": [14, 19, 25, 35, 54, 58, 70, 81], "comput": [14, 17, 25, 35, 38, 54, 58, 70, 81, 85, 88], "would": [14, 25, 35, 44, 54, 58, 70], "perform": [14, 22, 25, 35, 43, 54, 58, 70, 80, 81, 82, 83, 85, 86, 96], "manual": [14, 25, 35, 54, 56, 58, 70, 80], "complex": [14, 25, 35, 54, 58, 70, 81], "easier": [14, 19, 25, 35, 54, 58, 70], "let": [14, 17, 25, 35, 38, 49, 54, 58, 67, 70, 81, 84, 86, 96], "xminusycomput": [14, 25, 35, 54, 58, 70], "gcd": [14, 25, 35, 54, 58, 70], "correctli": [14, 25, 35, 54, 58, 70, 86], "incorrectli": [14, 25, 35, 54, 58, 70], "reset": [14, 17, 25, 35, 38, 54, 56, 58, 70, 93], "resetassert": [14, 17, 25, 35, 38, 54, 56, 58, 70], "revis": [14, 25, 35, 54, 58, 70, 81, 88], "r2": [14, 25, 35, 54, 58, 70], "unsatcor": [14, 25, 35, 54, 58, 70], "getunsatcor": [14, 17, 25, 35, 38, 54, 58, 70], "contributor": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "yoni": [14, 25, 35, 54, 58, 70, 75, 76, 77], "zohar": [14, 25, 35, 54, 58, 70, 75, 76, 77], "gereon": [14, 25, 35, 54, 58, 70, 98], "kremer": [14, 25, 35, 54, 58, 70, 98], "mathia": [14, 25, 35, 54, 58, 60, 61, 62, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 88, 95, 98], "preiner": [14, 25, 35, 54, 58, 60, 61, 62, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 95, 98], "file": [14, 17, 24, 25, 35, 52, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 84, 85, 90, 91, 92, 95, 98], "copyright": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 95, 98], "2009": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 88, 91, 95, 98], "2022": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "author": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "sourc": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 79, 80, 91, 95, 98], "directori": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 85, 91, 95, 98], "institut": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "affili": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "reserv": [14, 25, 35, 50, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "copi": [14, 17, 19, 21, 25, 34, 35, 44, 47, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 91, 95, 98], "licens": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 91, 95, 98], "simpl": [14, 25, 35, 52, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 83, 85, 91, 95, 98], "demonstr": [14, 25, 35, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "capabl": [14, 25, 35, 54, 58, 60, 61, 62, 63, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 95], "iostream": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "doc": [14, 25, 35, 54, 58, 70, 80], "henc": [14, 25, 35, 54, 58, 70], "jargon": [14, 25, 35, 54, 58, 70], "5": [14, 24, 25, 35, 45, 47, 48, 49, 50, 54, 56, 58, 65, 70, 80, 81, 82, 89, 92], "our": [14, 25, 35, 54, 58, 63, 67, 70, 80, 95], "7": [14, 25, 35, 47, 50, 54, 58, 66, 70, 80, 88, 92], "8": [14, 25, 35, 45, 47, 50, 54, 58, 66, 67, 70, 81], "compound": [14, 25, 35, 54, 58, 70], "even": [14, 16, 25, 35, 37, 50, 54, 58, 63, 70, 81, 86, 95], "those": [14, 17, 25, 35, 38, 49, 54, 58, 63, 70, 81, 86], "did": [14, 25, 35, 54, 58, 70, 81, 86], "11": [14, 25, 35, 50, 54, 58, 70, 77, 81, 82, 83, 88], "12": [14, 17, 25, 35, 54, 58, 70], "13": [14, 25, 35, 54, 58, 70, 85, 88], "14": [14, 25, 35, 54, 58, 67, 70], "15": [14, 25, 35, 54, 58, 70], "16": [14, 17, 21, 25, 35, 42, 47, 50, 54, 58, 67, 70, 81], "17": [14, 25, 35, 54, 58, 70, 83, 88], "18": [14, 25, 35, 54, 58, 70, 88, 98], "mudathir": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "moham": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "aina": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "niemetz": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "andr": [14, 25, 35, 54, 58, 59, 62, 65, 66, 67, 70, 71, 72, 73, 74, 75, 76, 77, 88, 91, 95, 98], "noetzli": [14, 25, 35, 54, 58, 59, 62, 65, 66, 67, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "import": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "io": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "math": [14, 25, 35, 54, 58, 61, 70], "biginteg": [14, 24, 25, 35, 54, 58, 70], "util": [14, 24, 25, 35, 52, 54, 58, 60, 61, 62, 63, 70, 75, 76, 77, 81], "arraylist": [14, 25, 35, 54, 58, 61, 70, 75, 76, 77], "static": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 86, 91, 95, 98], "arg": [14, 17, 25, 35, 38, 45, 46, 47, 48, 49, 54, 55, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 86, 91, 95, 98], "throw": [14, 19, 25, 35, 54, 58, 59, 60, 61, 62, 63, 66, 67, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "try": [14, 17, 25, 35, 38, 45, 46, 47, 48, 50, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 91, 95, 98], "new": [14, 25, 35, 44, 48, 49, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 86, 88, 91, 95, 98], "system": [14, 25, 35, 54, 56, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 81, 89, 91, 95, 98], "println": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "aslist": [14, 25, 35, 54, 58, 70], "test": [14, 25, 35, 48, 58, 61, 63, 65, 81, 82, 83, 85, 90], "pgm": [14, 25, 35, 58, 65], "example_quickstart": [14, 25, 35, 58], "py": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "__name__": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "__main__": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "introduc": [14, 18, 25, 35, 54, 58, 60, 70, 81, 86], "confirm": [14, 25, 35, 54, 58, 70], "solv": [14, 17, 25, 35, 45, 47, 48, 49, 52, 54, 58, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 86, 88, 89, 90, 95], "m": [14, 25, 35, 50, 54, 56, 58, 62, 70, 81, 86, 90, 91], "decim": [14, 21, 25, 35, 38, 42, 45, 54, 58, 70, 81], "as_decim": [14, 25, 35, 45, 54, 58, 70], "fraction": [14, 25, 35, 38, 42, 45, 54, 58, 70], "as_fract": [14, 25, 35, 45, 54, 58, 70], "report": [14, 25, 35, 54, 58, 59, 69, 70, 72, 73, 74, 81, 88, 91, 95, 98], "solut": [14, 17, 20, 25, 35, 38, 41, 45, 47, 48, 49, 54, 56, 58, 70, 75, 76, 77, 81], "usr": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 91, 95, 98], "bin": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 80, 82, 83, 85, 90, 91, 95, 98], "env": [14, 25, 35, 54, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 95, 98], "alex": [14, 25, 35, 54, 58, 61, 62, 65, 68, 70, 71, 74, 75, 76, 77, 95, 98], "ozdemir": [14, 25, 35, 54, 58, 61, 62, 65, 68, 70, 71, 74, 75, 76, 77, 95, 98], "adapt": [14, 25, 35, 54, 58, 60, 68, 70], "plu": [14, 25, 35, 54, 56, 58, 70, 75, 76, 81], "xpy": [14, 25, 35, 54, 58, 70], "ypy": [14, 25, 35, 54, 58, 70], "xminusypi": [14, 25, 35, 54, 58, 70], "minu": [14, 25, 35, 54, 58, 70, 75, 86, 95], "len": [14, 25, 35, 54, 56, 58, 70, 72, 74, 75, 76, 77, 81, 86, 94], "smtlib": [14, 25, 35, 54, 56, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 91, 92, 93, 95, 98], "smt2": [14, 25, 35, 52, 54, 58, 59, 60, 61, 62, 63, 66, 68, 69, 70, 71, 72, 73, 74, 82, 83, 85, 90, 91, 92, 95, 98], "dump": [14, 25, 35, 54, 58, 70, 81, 82, 83, 85], "echo": [14, 25, 35, 54, 58, 60, 62, 66, 69, 70, 73, 95], "built": [14, 23, 25, 35, 45, 47, 54, 58, 70, 80, 93], "rather": [14, 25, 35, 54, 58, 70, 81, 86], "encapsul": [15, 20, 36, 41], "three": [15, 21, 36, 49, 50, 59, 60, 69, 73, 91, 95], "explan": [15, 36, 58, 81, 89], "checksatassum": [15, 17, 36, 38, 59, 60, 61, 62, 65, 66, 68, 69, 72, 73, 74, 89, 91, 95], "isunknown": [15, 20, 36, 41], "abl": [15, 36, 95], "un": [15, 36], "overload": [15, 24, 52], "getunknownexplan": [15, 36], "mani": [16, 81], "These": [16, 45, 48, 81, 83, 86], "directli": [16, 17, 21, 32, 81], "iee19": [16, 88], "section": [16, 50, 81], "round_nearest_ties_to_even": [16, 37, 67], "nearest": [16, 37, 50], "bracket": [16, 37], "unrepresent": [16, 37], "signific": [16, 37, 47], "deliv": [16, 37], "round_toward_posit": [16, 37, 67], "infin": [16, 17, 21, 37, 38, 42, 67, 81], "oo": [16, 17, 37, 50, 67], "shall": [16, 37], "format": [16, 17, 37, 38, 56, 58, 59, 60, 61, 62, 63, 71, 72, 73, 81, 86, 87, 91, 92, 95], "possibli": [16, 37, 49, 81, 86], "closest": [16, 37], "round_toward_neg": [16, 37, 67], "round_toward_zero": [16, 37], "magnitud": [16, 37], "round_nearest_ties_to_awai": [16, 37], "awai": [16, 37, 50, 63], "larger": [16, 37], "delet": 17, "disallow": [17, 67], "getnullsort": [17, 38], "getbooleansort": [17, 18, 38, 62, 68, 75, 77], "getregexpsort": [17, 38], "getroundingmodesort": [17, 38], "getstringsort": [17, 38, 59, 74, 91], "mkarraysort": [17, 38, 61], "indexsort": [17, 38, 61], "elemsort": [17, 38], "mkbitvectorsort": [17, 18, 38, 60, 61, 66], "mkfloatingpointsort": [17, 38, 67], "sig": [17, 38, 46, 48, 50], "dtypedecl": [17, 38], "mkfunctionsort": [17, 38, 62], "mkparamsort": [17, 18, 38, 39, 63], "nullopt": 17, "mkpredicatesort": [17, 38], "mkrecordsort": [17, 38, 92], "mksetsort": [17, 18, 38, 71, 73, 95], "mkbagsort": [17, 18, 38, 59, 91], "mksequencesort": [17, 38, 72, 94], "mkuninterpretedsort": [17, 18, 38, 62, 71, 95], "mkunresolveddatatypesort": [17, 38], "yet": [17, 38, 44, 60, 83, 85, 86, 97], "placehold": [17, 38, 86], "mutual": [17, 38, 49, 81, 92], "recurs": [17, 38, 49, 81, 86, 92], "mkuninterpretedsortconstructorsort": [17, 18, 38], "mktuplesort": [17, 38, 71, 92, 95], "Of": [17, 38], "children": [17, 21, 42, 48, 49, 53, 62, 86, 92], "ari": [17, 38, 86], "mktupl": [17, 38, 71, 95], "simpli": [17, 48], "wrap": [17, 56], "val": [17, 38, 45, 47, 48, 49, 50, 67], "123": 17, "34": 17, "num": [17, 56, 81, 82], "den": 17, "denomin": [17, 21, 38, 45], "re": [17, 21, 38, 74, 80, 81], "allchar": [17, 38, 81], "useescsequ": [17, 38], "compat": [17, 38, 44, 55, 80], "escap": [17, 38, 86], "u1234": [17, 38], "unicod": [17, 26, 27, 28, 38, 42, 81, 96], "fit": [17, 21], "mkconstarrai": [17, 38, 61], "mkfloatingpointposinf": [17, 38, 67], "mkfloatingpointneginf": [17, 38], "mkfloatingpointnan": [17, 38, 67], "mkfloatingpointposzero": [17, 38, 67], "mkfloatingpointnegzero": [17, 38], "rm": [17, 38, 50, 67, 81], "upperbound": 17, "mkdatatypeconstructordecl": [17, 38, 63], "mkdatatypedecl": [17, 38, 63], "param": [17, 18, 39, 75, 76, 77], "much": [17, 19, 38], "work": [17, 38, 81, 89], "involv": [17, 38, 86], "engin": [17, 38, 79, 81], "simplif": [17, 38, 81, 83], "prop_liter": [17, 38], "declaredatatyp": [17, 38, 63], "datatype_decl": [17, 38], "declarefun": [17, 38], "declaresort": [17, 38, 62], "definefun": [17, 38, 77], "bound_var": [17, 38], "global": [17, 38, 45, 47, 48, 50, 81, 82, 90], "function_def": [17, 38], "persist": [17, 38, 81], "pop": [17, 38, 56, 60, 67, 69], "definefunrec": [17, 38], "rec": [17, 38, 81, 92], "definefunsrec": [17, 38], "function_decl": [17, 38], "_1": [17, 86], "_n": [17, 38, 86], "getassert": [17, 38], "getinfo": [17, 38], "flag": [17, 19, 38, 83, 84, 85], "info": [17, 38, 93, 94], "info_flag": [17, 38], "getoptionnam": [17, 38, 56, 81], "driver": [17, 90], "properli": [17, 56, 89], "getunsatassumpt": [17, 38], "between": [17, 38, 67, 81, 86], "unnam": [17, 38], "getdifficulti": [17, 38], "difficulti": [17, 38, 81], "estim": [17, 38], "difficult": [17, 38], "unment": [17, 38], "getproof": [17, 38], "recent": [17, 38, 80], "depend": [17, 81, 86], "account": [17, 38], "ref": 17, "lbl": 17, "entail": [17, 38, 60, 62, 66, 68, 69, 81], "were": [17, 23, 49, 75, 76, 77, 85, 95], "getmodeldomainel": [17, 38], "question": [17, 38], "ismodelcoresymbol": [17, 38], "v": [17, 24, 38, 45, 46, 47, 50, 53, 60, 81], "essenti": [17, 19, 38, 48], "show": [17, 19, 38, 56, 62, 64, 67, 68, 69, 80, 81], "getmodel": [17, 38, 65], "var": [17, 38, 56, 68, 75, 76, 81, 85], "getquantifierelimin": [17, 38], "qe": [17, 38, 81], "complet": [17, 38, 44, 63, 67, 80, 81], "lra": [17, 38], "lia": [17, 38, 73, 75, 76, 77, 81, 95], "bv": [17, 42, 47, 81, 86], "bar": [17, 38, 56], "x_i": [17, 38, 86], "y_1": [17, 38, 86], "y_j": [17, 38], "x_k": [17, 38], "phi": [17, 38, 71], "y_n": [17, 38, 86], "getquantifiereliminationdisjunct": [17, 38], "partial": [17, 38, 81, 86], "q_n": [17, 38], "q_1": [17, 38], "q_i": [17, 38], "q_": [17, 38], "q_j": [17, 38], "eventu": [17, 38], "declaresepheap": [17, 38], "locsort": [17, 38], "datasort": [17, 38], "invok": [17, 38, 56, 57], "onc": [17, 18, 19, 21, 38, 39, 42, 81, 93], "getvaluesepheap": [17, 38], "getvaluesepnil": [17, 38], "initvalu": [17, 38], "instruct": [17, 80, 89], "document": [17, 23, 81], "declareoraclefun": 17, "fn": [17, 86, 93], "oracl": [17, 81], "ordinari": 17, "implicitli": 17, "sym": [17, 81], "text": [17, 81, 93], "nscope": [17, 38], "stack": [17, 38], "getinterpol": [17, 38], "conj": [17, 38, 81], "interpol": [17, 38, 81], "conjectur": [17, 38, 75, 76, 77, 81], "getinterpolantnext": [17, 38], "success": [17, 38, 81], "guarante": [17, 38, 86, 90], "wrt": [17, 38, 81], "getabduct": [17, 38], "abduct": [17, 38, 81], "getabductnext": [17, 38], "preced": [17, 38], "invalid": [17, 19, 38, 56, 65, 81, 89], "not_entail": [17, 38], "getinstanti": [17, 38], "modul": [17, 38, 75, 76, 77, 80], "push": [17, 38, 56, 60, 67, 69, 81], "setinfo": [17, 38], "declaresygusvar": [17, 38, 75, 76], "append": [17, 38, 56, 61, 75, 76, 77, 81, 95, 98], "v2": [17, 38, 57, 58, 62], "mkgrammar": [17, 38, 75, 76], "boundvar": [17, 38], "treat": [17, 21, 38, 42], "matter": [17, 38], "pre": [17, 18, 21, 38, 39, 42, 77, 80, 81, 86, 94], "synthfun": [17, 38, 75, 76], "synthes": [17, 38, 75, 76, 77, 81, 82], "synthinv": [17, 38, 77], "invari": [17, 38, 64, 81], "addsygusconstraint": [17, 38, 75, 76], "forumla": 17, "addsygusassum": [17, 38], "addsygusinvconstraint": [17, 38, 77], "tran": [17, 38, 77, 85, 86, 88], "post": [17, 38, 77, 81, 86], "synthesi": [17, 20, 38, 41, 52, 75, 76, 77, 81], "problem": [17, 38, 56, 60, 61, 64, 67, 71, 79, 80, 81, 82, 95], "checksynth": [17, 20, 38, 41, 75, 76, 77], "find": [17, 38, 59, 67, 71, 73, 81, 91, 95], "getsynthsolut": [17, 38, 75, 76, 77], "checksynthnext": [17, 20, 38, 41], "answer": [17, 38, 71, 81, 82, 95], "getstatist": [17, 19, 38, 90], "snapshot": [17, 19, 38, 90], "decoupl": [17, 38, 90], "again": [17, 23, 38, 81, 89, 90], "printstatisticssaf": 17, "fd": 17, "descriptor": 17, "suitabl": 17, "usag": [17, 68, 81, 89], "signal": [17, 81], "handler": 17, "isoutputon": 17, "determion": 17, "o": [17, 19, 81, 82, 88], "line": [17, 57, 80, 81, 86, 90, 98], "getoutput": 17, "commandexecutor": 17, "serial": 18, "offer": [18, 21, 44, 80, 84], "factori": [18, 21], "multiset": [18, 91], "structur": [18, 48, 81], "hassymbol": [18, 21, 39, 42], "getsymbol": [18, 21, 39, 42], "mkunresolvedsort": 18, "raw": [18, 21, 39, 42, 81], "isboolean": [18, 39], "isinteg": [18, 39], "isreal": [18, 39], "isstr": [18, 19, 39], "isregexp": [18, 39], "isroundingmod": [18, 39], "isbitvector": [18, 39], "bitvec": [18, 39, 47, 60, 61, 65, 66], "isfloatingpoint": [18, 39], "floatingpoint": [18, 39, 50], "eb": [18, 39], "sb": [18, 39], "isdatatyp": [18, 39], "isdatatypetest": [18, 27, 39], "isfunct": [18, 39, 75, 76, 77], "ispred": [18, 39], "isarrai": [18, 39], "isset": [18, 39], "isbag": [18, 39], "issequ": [18, 39], "isuninterpretedsort": [18, 39], "isuninterpretedsortconstructor": [18, 39], "isinstanti": [18, 39], "getuninterpretedsortconstructor": [18, 39], "getdatatyp": [18, 39, 63, 92, 95], "underli": [18, 39, 48, 49, 53], "getinstantiatedparamet": [18, 39], "travers": [18, 21, 39, 42], "run": [18, 21, 24, 39, 42, 80, 81, 89], "until": [18, 21, 39, 42, 81, 89], "d": [18, 24, 39, 49, 67, 81, 83, 85, 86, 88, 91], "subsort": [18, 39, 45, 47, 48], "simultan": [18, 21, 42], "earliest": [18, 21, 39, 42], "prioriti": [18, 21, 39, 42, 81], "tostream": 18, "getdatatypeconstructorar": [18, 39], "getdatatypeconstructordomainsort": [18, 39], "getdatatypeconstructorcodomainsort": [18, 39], "getdatatypeselectordomainsort": [18, 39], "getdatatypeselectorcodomainsort": [18, 39], "getdatatypetesterdomainsort": [18, 39], "getdatatypetestercodomainsort": [18, 39], "mainli": 18, "doesn": 18, "getfunctionar": [18, 39], "getfunctiondomainsort": [18, 39], "getfunctioncodomainsort": [18, 39, 75, 76, 77], "getarrayindexsort": [18, 39], "getarrayelementsort": [18, 39], "getsetelementsort": [18, 39], "getbagelementsort": [18, 39], "getsequenceelementsort": [18, 39], "getuninterpretedsortconstructorar": [18, 39], "getbitvectors": [18, 39], "getfloatingpointexponents": [18, 39], "getfloatingpointsignificands": [18, 39], "getdatatypear": [18, 39], "gettuplelength": [18, 39], "gettuplesort": [18, 39], "histogram": [19, 90], "isint": [19, 45], "isdoubl": 19, "etc": [19, 56, 63, 86, 89], "getint": 19, "getdoubl": 19, "kei": [19, 58], "frequenc": [19, 81], "By": 19, "def": [19, 62, 63, 65, 75, 76, 77, 81], "pass": [19, 49, 56, 65, 81, 85, 86, 89], "visibl": [19, 40], "skip": [19, 81], "shown": 19, "isintern": [19, 90], "isdefault": [19, 90], "histogramdata": 19, "On": [19, 80, 81], "isx": 19, "getx": 19, "sole": 19, "becaus": 19, "getstr": 19, "ishistogram": 19, "gethistogram": 19, "sv": 19, "hassolut": [20, 41, 75, 76, 77], "hasnosolut": [20, 41], "could": [20, 41, 56, 86], "best": [21, 81], "mk": 21, "id": [21, 26, 27, 42, 81, 86, 92], "getnumchildren": [21, 42], "getid": [21, 42], "getsort": [21, 42, 60, 63, 75, 76, 77], "w": [21, 42, 86, 88, 96], "hasop": [21, 42], "getop": [21, 42], "notterm": [21, 42, 59, 60, 62, 66, 69, 73, 91, 95], "andterm": [21, 42], "orterm": [21, 42], "xorterm": [21, 42], "eqterm": [21, 42], "impterm": [21, 42], "iteterm": [21, 42], "then_t": [21, 42], "else_t": [21, 42], "int32_t": 21, "getrealorintegervaluesign": [21, 42], "isint32valu": 21, "getint32valu": 21, "isuint32valu": 21, "getuint32valu": 21, "isint64valu": 21, "getint64valu": 21, "isuint64valu": 21, "getuint64valu": 21, "isintegervalu": [21, 42], "getintegervalu": [21, 42], "isstringvalu": [21, 42], "getstringvalu": [21, 42], "confus": [21, 42], "whatev": [21, 42], "isreal32valu": 21, "getreal32valu": 21, "isreal64valu": 21, "isconstarrai": [21, 42], "getconstarraybas": [21, 42], "isbooleanvalu": [21, 42], "getbooleanvalu": [21, 42], "isbitvectorvalu": [21, 42], "getbitvectorvalu": [21, 42], "hexadecim": 21, "isuninterpretedsortvalu": [21, 42], "getuninterpretedsortvalu": [21, 42], "istuplevalu": [21, 42], "gettuplevalu": [21, 42], "isroundingmodevalu": [21, 42], "getroundingmodevalu": [21, 42], "held": [21, 42], "isfloatingpointposzero": [21, 42], "isfloatingpointnegzero": [21, 42], "isfloatingpointposinf": [21, 42], "isfloatingpointneginf": [21, 42], "isfloatingpointnan": [21, 42], "isfloatingpointvalu": [21, 42], "getfloatingpointvalu": [21, 42], "canon": [21, 42], "c_": [21, 42, 86], "getsetvalu": [21, 42], "issequencevalu": [21, 42], "describ": [21, 56, 85, 86, 92, 96, 98], "themselv": 21, "One": [21, 84], "const_sequence_": 21, "latter": [21, 26, 27, 83], "former": 21, "iscardinalityconstraint": [21, 42], "getcardinalityconstraint": [21, 42], "just": [21, 55, 82], "nodemanag": 21, "nm": 21, "shared_ptr": 21, "reason": [22, 43, 59, 71, 72, 73, 74, 80, 81, 82, 86, 87, 88, 91, 95], "requires_full_check": [22, 43], "incomplet": [22, 43, 81], "timeout": [22, 43, 81, 89], "limit": [22, 43, 48, 49, 79, 81, 98], "reach": [22, 43, 81, 89], "resourceout": [22, 43], "resourc": [22, 25, 43, 79, 81], "memout": [22, 43], "memori": [22, 43, 80], "interrupt": [22, 43, 89], "unsupport": [22, 43], "encount": [22, 43, 81], "unknown_reason": [22, 43], "No": [22, 43, 71, 81], "disabl": [23, 62, 81, 89], "pleas": [23, 80], "build_bindings_java": 23, "cmake": [23, 24, 80, 90], "build": [23, 45, 46, 47, 48, 49, 50, 61, 63, 67, 81, 90], "mostli": 24, "mirror": 24, "There": [24, 83, 90], "hierarchi": 24, "git": 24, "clone": 24, "cd": [24, 80, 81], "sh": [24, 80], "auto": [24, 63, 80, 81], "download": [24, 80, 85], "instal": [24, 79, 85], "libcvc5jni": 24, "libcvc5pars": 24, "libcvc5": 24, "libpicpoli": 24, "libpicpolyxx": 24, "libpoli": 24, "libpolyxx": 24, "dev": [24, 80], "jar": 24, "compil": 24, "javac": 24, "cp": 24, "librari": 24, "djava": 24, "path": [24, 80], "triplet": 24, "your": [25, 80], "__getitem__": [26, 27, 33, 40, 42, 46, 55, 56], "__iter__": [26, 27, 42], "self": [26, 27, 28, 29, 30, 31, 33, 36, 38, 39, 40, 41, 42, 45, 46, 47, 48, 49, 50, 51, 53, 55, 56, 71, 95], "unresdatatypenam": 28, "And": [32, 48, 53, 56, 61, 62, 67, 69, 75, 86], "addtion": 32, "bvadd": [32, 47, 60], "almost": [34, 44], "exact": [34, 44], "experi": 34, "usatisfi": 36, "formuula": 38, "inv_f": [38, 77], "pre_f": [38, 77], "trans_f": [38, 77], "post_f": [38, 77], "loctyp": 38, "glbl": 38, "sym_or_fun": 38, "sort_or_term": 38, "glb": 38, "succes": 38, "inteprol": 38, "dictionari": [38, 40], "term_or_list": 38, "sorts_or_bool": 38, "arg0": 38, "symbolnam": 38, "temporari": 38, "forward": 38, "kind_or_op": 38, "comma": 38, "automat": [38, 48, 49, 56, 79, 80, 81, 98], "sort_or_list_1": 39, "sort_or_list_2": 39, "hexdecim": 42, "indici": 42, "usual": [42, 57, 80, 89], "necessari": [42, 86], "__str__": [42, 48, 51], "cdot": [42, 86], "term_or_list_1": 42, "term_or_list_2": 42, "topythonobj": 42, "dict": 42, "aim": 44, "fulli": [44, 56, 63, 81], "z3": [44, 45], "you": [44, 62, 63, 80], "verbos": [44, 81], "abil": 44, "everyth": 44, "visit": 44, "page": [44, 49, 80, 88, 93], "pip": 44, "ctx": [45, 46, 47, 48, 49, 50, 53, 55, 56], "is_int": [45, 48], "is_real": [45, 50], "intval": [45, 48, 51, 55, 56, 73], "100": [45, 81], "realval": [45, 50, 67], "long": [45, 47, 48, 50, 76, 89], "notat": [45, 48, 58, 86], "ratval": 45, "boolsort": [45, 46, 47, 48, 49, 53, 62], "freshint": 45, "fresh": [45, 48, 58, 86], "eq": [45, 46, 47, 48, 50, 66, 81], "intvector": [45, 56], "sz": [45, 47, 48], "x__0": 45, "x__1": 45, "x__2": 45, "freshreal": 45, "realvector": 45, "arithref": 45, "__add__": [45, 47, 50], "__sub__": [45, 47, 50], "__mul__": [45, 47, 48, 50], "__div__": [45, 47, 50], "__pow__": 45, "__neg__": [45, 47, 50], "__gt__": [45, 47, 50], "__lt__": [45, 47, 50], "__ge__": [45, 47, 50], "__le__": [45, 47, 50], "exprref": [45, 47, 48], "__eq__": [45, 47, 48, 56], "__ne__": [45, 47, 48, 56], "main_ctx": [45, 48, 56], "uminu": 45, "unari": [45, 47, 50, 71, 92, 98], "deprec": 45, "kept": 45, "compatibl": 45, "div": 45, "intsmodulu": 45, "__mod__": [45, 47, 50], "toreal": [45, 48], "toint": 45, "builtin": [45, 86, 90], "arithemt": 45, "cbrt": 45, "cubic": 45, "prove": [45, 46, 56, 60, 61, 62, 63, 66, 69, 73, 85], "is_arith": 45, "is_int_valu": 45, "is_rational_valu": 45, "is_arith_sort": 45, "is_add": 45, "is_mul": 45, "is_sub": 45, "is_div": 45, "is_idiv": 45, "is_mod": 45, "is_l": 45, "is_lt": 45, "is_g": 45, "is_gt": 45, "is_is_int": 45, "is_to_r": 45, "is_to_int": 45, "arithsortref": 45, "smtexcept": [45, 46, 48, 51], "ex": [45, 48, 80], "reverse_children": [45, 46, 47, 48, 49, 50, 53, 55], "boolval": [45, 48, 65], "__pos__": [45, 47, 50], "__radd__": [45, 47, 50], "__rdiv__": [45, 47, 50], "__rmod__": [45, 47, 50], "__rmul__": [45, 47, 48, 50], "__rpow__": 45, "__rsub__": [45, 47, 50], "__rtruediv__": [45, 47, 50], "__truediv__": [45, 47, 50], "intnumref": 45, "as_binary_str": 45, "1010": 45, "as_long": [45, 47], "bignum": [45, 47], "as_str": [45, 50], "ratnumref": 45, "prec": [45, 81], "place": [45, 86, 89], "333": 45, "denominator_as_long": 45, "numerator_as_long": 45, "10000000000": 45, "10000000001": 45, "dom": 46, "rng": 46, "constarrai": 46, "alia": [46, 56], "arraysort": [46, 48, 61], "aa": 46, "unimpl": 46, "multi": [46, 81], "arrayref": 46, "is_array_sort": 46, "is_arrai": 46, "is_const_arrai": 46, "is_k": 46, "is_select": 46, "is_stor": 46, "is_upd": 46, "arraysortref": 46, "shorthand": [46, 55, 86], "is_bv": [47, 50], "word": [47, 50, 81, 86, 95, 96], "bitvecsort": [47, 48, 50, 61], "x2": [47, 50], "bitvecv": [47, 50], "32": [47, 50, 60, 61, 66, 67, 96], "0x": [47, 50], "8x": [47, 50], "0x0000000a": 47, "u": [47, 62, 81, 86, 92, 93], "byte": 47, "bitvecref": 47, "__or__": [47, 55], "__and__": [47, 55], "__xor__": 47, "__invert__": 47, "__lshift__": 47, "__rshift__": 47, "is_sign": 47, "num_bit": 47, "modulo": [47, 79, 81, 88], "bv_x": 47, "bv_x_plus_4": 47, "289": 47, "3x": 47, "121": 47, "high": [47, 83, 85], "low": 47, "ul": 47, "bvsle": 47, "bvule": 47, "ult": 47, "bvslt": [47, 61], "bvult": 47, "ug": 47, "bvsge": 47, "bvuge": 47, "ugt": 47, "bvsgt": [47, 61], "bvugt": 47, "sle": 47, "slt": 47, "sge": 47, "sgt": 47, "udiv": 47, "bvsdiv": 47, "bvudiv": 47, "urem": 47, "srem": 47, "bvsmod": 47, "bvurem": 47, "sdiv": 47, "smod": 47, "bvsrem": 47, "lshr": 47, "bvashr": 47, "bvlshr": 47, "as_signed_long": 47, "rotateleft": 47, "rotateright": 47, "signext": 47, "extra": 47, "24": [47, 50, 67, 81], "v0": 47, "254": 47, "fe": 47, "zeroext": 47, "repeatbitvec": 47, "aaaa": 47, "bvredand": 47, "reduct": [47, 81, 86], "bvredor": 47, "bvmult": 47, "bvsub": [47, 60], "bvor": 47, "bvxor": [47, 60], "bvneg": 47, "bvnot": 47, "bitwis": [47, 81], "is_bv_sort": 47, "is_bv_valu": 47, "bitvecsortref": 47, "b00000000000000000000000000001010": 47, "setsort": [47, 48, 55], "bvshl": 47, "mod": [47, 50, 81], "__rand__": 47, "__rlshift__": 47, "__ror__": 47, "__rrshift__": 47, "__rxor__": 47, "64": [47, 50, 80, 88, 90], "bitvecnumref": 47, "0xbadc0d": 47, "195936478": 47, "0x0badc0d": 47, "is_tru": 48, "is_fals": 48, "is_bool": 48, "freshbool": 48, "b1": 48, "b2": 48, "blank": 48, "space": [48, 79, 86], "Or": [48, 56, 60, 67, 86], "boolvector": 48, "p__0": 48, "p__1": 48, "p__2": 48, "freshconst": 48, "freshfunct": 48, "probe": [48, 52], "p__3": 48, "p__4": 48, "mk_not": 48, "strip": 48, "present": [48, 86, 95], "is_bool_valu": 48, "is_and": 48, "is_or": 48, "is_impli": 48, "is_not": 48, "is_eq": 48, "is_distinct": 48, "is_const": [48, 53], "is_func_decl": 48, "__bool__": 48, "__hash__": [48, 56], "__init__": [48, 49, 51, 56], "__nonzero__": 48, "__repr__": [48, 49, 56], "repr": [48, 49, 56], "__weakref__": [48, 49, 51, 56], "weak": [48, 49, 51, 56, 81], "as_ast": [48, 53], "decl": [48, 56, 63, 81], "n1": [48, 49, 92], "n2": [48, 49], "get_id": 48, "hashcod": 48, "num_arg": 48, "sortref": 48, "pretti": 48, "boolref": 48, "boolsortref": 48, "is_expr": [48, 51], "funcdeclref": 48, "__call__": [48, 49], "coercion": [48, 49], "isinst": [48, 56], "manipul": 49, "happen": [49, 81], "phase": [49, 80, 81, 86], "intlist": 49, "third": 49, "finish": [49, 81, 89], "tool": [49, 80], "interact": [49, 81], "is_nil": [49, 63], "is_con": [49, 63], "testor": 49, "recogn": 49, "accessor": [49, 63], "ambigu": [49, 92], "datatypesortref": 49, "unambigu": 49, "createdatatyp": 49, "codatayp": 49, "intstream": 49, "helper": [49, 98], "tree": [49, 71, 81, 92], "treelist": 49, "leaf": [49, 86], "car": 49, "cdr": 49, "tuplesort": [49, 95], "mk_pair": 49, "disjointsum": 49, "en": [49, 50], "wikipedia": [49, 50], "wiki": [49, 50], "tagged_union": 49, "injector": 49, "extractor": 49, "inject0": 49, "extract0": 49, "inject1": 49, "extract1": 49, "being": [49, 53, 98], "cell": [49, 86], "num_constructor": [49, 63], "num_acc": 49, "is_nam": 49, "datatypeconstructorref": 49, "datatypeselectorref": 49, "datatyperecognizerref": 49, "datatyperef": 49, "fpsort": 50, "is_fp": 50, "ebit": 50, "sbit": 50, "fpmul": 50, "rne": 50, "fpadd": 50, "fpval": [50, 67], "25": [50, 81, 88], "exponent_as_long": 50, "0x00000004": 50, "125": 50, "fpnan": 50, "set_fpa_pretti": 50, "pb": [50, 81], "get_fpa_pretti": 50, "fpplusinfin": 50, "fpminusinfin": 50, "fpinfin": 50, "fppluszero": 50, "fpminuszero": 50, "fpzero": 50, "53": [50, 81], "float16": 50, "half": 50, "floathalf": 50, "float32": [50, 67, 81], "floatsingl": 50, "float64": [50, 81], "floatdoubl": 50, "float128": 50, "128": 50, "quadrupl": 50, "floatquadrupl": 50, "fpref": 50, "fpab": 50, "fpneg": 50, "rtz": 50, "fpsub": 50, "fpdiv": 50, "fprem": 50, "fpmin": 50, "fpmax": 50, "fpfma": 50, "fpsqrt": 50, "fproundtointegr": 50, "roundtointegr": 50, "fpisnan": [50, 67], "isnan": 50, "fpisinf": [50, 67], "isinfinit": 50, "fpiszero": 50, "iszero": 50, "fpisnorm": 50, "isnorm": 50, "fpissubnorm": 50, "issubnorm": 50, "fpisneg": 50, "isneg": 50, "fpisposit": 50, "isposit": 50, "fplt": 50, "fpleq": 50, "fpgt": 50, "fpgeq": 50, "fpeq": [50, 67], "fpneq": 50, "fpfp": 50, "sgn": 50, "22": 50, "23": 50, "fptofp": 50, "127": 50, "4194304": [50, 81], "xv": 50, "slvr": 50, "a1": 50, "a2": 50, "a3": 50, "x_db": 50, "x_r": 50, "x_sign": 50, "fpbvtofp": 50, "x_bv": 50, "0x3f800000": 50, "x_fp": 50, "1065353216": 50, "fpfptofp": 50, "x_sgl": 50, "x_dbl": 50, "fprealtofp": 50, "fpsignedtofp": 50, "4294967291": 50, "fpunsignedtofp": 50, "fptofpunsign": 50, "fptosbv": 50, "fptoubv": 50, "fptoreal": 50, "is_fp_sort": 50, "is_fp_valu": 50, "is_fprm_sort": 50, "is_fprm": 50, "is_fprm_valu": 50, "roundnearesttiestoeven": [50, 67], "ti": [50, 92], "broken": 50, "doi": [50, 88], "1109": [50, 88], "ieeestd": [50, 88], "2019": [50, 81, 88], "8766229": [50, 88], "point_arithmet": 50, "rounding_mod": 50, "roundnearesttiestoawai": 50, "rna": 50, "roundtowardposit": 50, "rtp": [50, 67], "roundtowardneg": 50, "rtn": [50, 67], "roundtowardzero": 50, "get_default_rounding_mod": 50, "set_default_rounding_mod": [50, 67], "sum1": 50, "sum2": 50, "solverfor": [50, 56, 69], "qf_fp": [50, 67], "explicit": [50, 54], "get_default_fp_sort": 50, "set_default_fp_sort": 50, "fpsortref": 50, "b0": 50, "b01111111": 50, "b00000000000000000000000": 50, "fpnumref": 50, "bias": [50, 81], "isinf": 50, "subnorm": 50, "significand_as_long": 50, "miss": [50, 52, 80], "2097152": 50, "fprmref": 50, "is_sort": 51, "is_app": 51, "is_app_of": 51, "z3py": 52, "pseudo": [52, 81], "count": [52, 59, 90, 91], "atmost": 52, "atleast": 52, "partialord": 52, "linearord": 52, "html": [52, 80], "hook": 52, "fixedpoint": 52, "pars": [52, 81, 82], "builder": 52, "transcendent": [52, 81, 86, 88, 97], "overview": 52, "fp": [52, 67, 81], "mem0": 53, "lo": 53, "hi": 53, "mem1": 53, "is_var": 53, "is_quantifi": 53, "quantifierref": 53, "is_exist": 53, "is_foral": 53, "is_lambda": 53, "num_var": 53, "var_nam": 53, "displai": [53, 62], "var_sort": 53, "With": [54, 80, 82], "elem_sort": 55, "emptyset": [55, 73, 93, 95], "fullset": 55, "setunion": 55, "setintersect": 55, "setadd": 55, "setdel": 55, "setdiffer": 55, "setcompl": 55, "setminu": [55, 86, 91], "ismemb": [55, 73], "issubset": [55, 73], "setref": 55, "setsortref": 55, "kwarg": 56, "solve_us": 56, "claim": 56, "tri": 56, "counterexampl": [56, 67, 81], "logfil": 56, "uiowa": 56, "edu": 56, "simplesolv": 56, "purpos": [56, 86], "__iadd__": 56, "fml": 56, "assert_expr": 56, "consist": [56, 63, 69, 86, 98], "eval": [56, 81], "ackermann": [56, 81], "approx": [56, 81], "branch": [56, 81], "depth": [56, 81], "num_scop": 56, "backtrack": 56, "reason_unknown": 56, "why": [56, 81, 82], "recreat": 56, "crash": [56, 81], "foo": 56, "lisp": 56, "sai": [56, 86, 95], "checksatresult": 56, "modelref": 56, "aka": 56, "__len__": 56, "model_complet": 56, "a__0": 56, "a__1": 56, "a__2": 56, "a__3": 56, "a__4": 56, "easiest": 57, "tptp": [57, 81], "furthermor": [58, 86, 97], "later": [58, 81], "written": 58, "slv": [59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 72, 73, 74, 75, 76, 77, 91, 95, 98], "intersectionac": [59, 73, 91, 95], "intersectionbc": [59, 73, 91, 95], "distribut": [59, 71, 73, 80, 81, 91, 95], "uniondisjointab": [59, 91], "lh": [59, 67, 73, 74, 91, 95], "rh": [59, 67, 73, 74, 91, 95], "guess": [59, 81, 91], "unionmaxab": [59, 91], "theorem": [59, 73, 79, 91, 95], "verifi": [59, 71, 73, 81, 91, 95], "emptbag": [59, 91], "emptybag": [59, 91], "four": [59, 91], "bag_a_2": [59, 91], "bag_b_3": [59, 91], "bag_b_1": [59, 91], "bag_c_2": [59, 91], "bag_a_2_b_3": [59, 91], "bag_b_1_c_2": [59, 91], "union_disjoint": [59, 91], "count_x": [59, 91], "uniondisjoint": [59, 91], "inter_min": [59, 91], "union_max": [59, 91], "bitvector": 60, "liana": [60, 61, 88], "hadarean": [60, 61, 88], "book": 60, "hacker": 60, "delight": 60, "henri": 60, "warren": 60, "want": [60, 61, 80], "straightforward": [60, 95], "effici": [60, 81], "piec": 60, "bitvector32": [60, 66], "x_eq_a": 60, "x_eq_b": 60, "new_x": 60, "execut": [60, 89, 93], "new_x_": 60, "ite": [60, 75, 77, 81, 82, 83, 85, 86, 91, 96], "assignment0": 60, "a_xor_b_xor_x": 60, "assignment1": 60, "new_x_eq_new_x_": 60, "a_plus_b": 60, "a_plus_b_minus_x": 60, "assignment2": 60, "x_neq_x": 60, "odd": [60, 86], "extract_op": 60, "lsb_of_a": 60, "a_odd": 60, "1u": 60, "morgan": [60, 61, 62, 63, 68, 69, 86], "deter": [60, 61, 62, 63, 68, 69], "x_is_a_or_b": 60, "new_x0": 60, "per": [60, 81, 89], "new_x1": 60, "new_x2": 60, "makai": [60, 61, 62, 63, 66, 67, 68, 69, 72, 73, 74, 95], "mann": [60, 61, 62, 63, 66, 67, 68, 69, 72, 73, 74, 95], "andrew": [60, 63, 66, 68, 75, 76, 77, 88], "reynold": [60, 63, 66, 68, 75, 76, 77, 88], "direct": [60, 61, 62, 63, 66, 69, 71, 72, 73, 74, 75, 76, 77, 81, 86, 95], "translat": [60, 61, 62, 63, 66, 69, 71, 72, 73, 74, 75, 76, 77, 81, 86, 95], "satisifi": 60, "lsb": 60, "bv1": [60, 61, 81], "bitvectors_and_arrai": 61, "cmath": 61, "previous": [61, 92], "current_arrai": 61, "throughout": 61, "unrol": 61, "index_s": 61, "log2": [61, 81], "elementsort": [61, 91, 95], "0u": 61, "current_array0": 61, "current_array0_gt_0": 61, "old_curr": 61, "2u": 61, "new_curr": 61, "current_slt_new_curr": 61, "push_back": [61, 92], "bitvectorsandarrai": 61, "privat": [61, 62, 63, 75, 76, 77], "log": [61, 81, 88], "toarrai": [61, 75, 76, 77], "idx_bit": 61, "ceil": 61, "init_arrai": 61, "init_arr": 61, "larg": [61, 79], "enough": 61, "overflow": 61, "constarr0": 61, "zeroi": 61, "bv0": 61, "onei": 61, "twoi": 61, "bv2": 61, "threei": 61, "bv3": 61, "twoe": 61, "unroll1": 61, "bvmul": 61, "current_array_": 61, "unroll2": 61, "current_array__": 61, "unroll3": 61, "current_array___": 61, "tim": [62, 68, 69, 88], "king": [62, 68, 69, 88], "prefixprintgetvalu": 62, "dag": [62, 81, 83], "thresh": [62, 81, 83], "dagifi": [62, 81], "qf_uflira": 62, "utoint": 62, "intpr": 62, "f_x": 62, "f_y": 62, "p_0": 62, "p_f_y": 62, "nest": [62, 81], "it2": 62, "it1": 62, "hasnext": [62, 63], "print_val": 62, "print_all_subterm": 62, "sum_": [62, 86], "ncvc5": 62, "induct": [63, 66, 81, 88, 92, 93], "conslistsort": 63, "old": [63, 81], "conslistspec": 63, "useless": 63, "relev": [63, 81], "spec": 63, "datatypesort": 63, "fill": 63, "conslist": 63, "too": 63, "though": [63, 95], "t2": [63, 83, 93], "cours": 63, "t_is_con": 63, "t_updat": 63, "paramconslistspec": 63, "paramlist": 63, "paramcon": 63, "paramnil": 63, "paramconslistsort": 63, "paramconsintlistsort": 63, "paramconslist": 63, "stor": 63, "head_a": 63, "50": [63, 81], "step": [63, 80, 81, 83, 85, 86], "keep": [63, 81], "mind": 63, "selfsort": 63, "cons2": 63, "nil2": 63, "conslistsort2": 63, "list2": 63, "nsort": 63, "nsimplifi": 63, "qf_ufdtlia": 63, "sinc": [63, 86, 93], "singular": 63, "macro": [63, 81, 86], "parlist": 63, "parhead": 63, "partail": 63, "parlistint": 63, "ahead": 63, "mechan": [64, 81, 89], "hello": 64, "world": 64, "handl": [64, 81], "execpt": 65, "exit": [65, 81], "invalidterm": 65, "legaci": 65, "sy": [65, 75, 76, 77, 82], "em": 65, "example_except": 65, "clark": [66, 88], "barrett": [66, 88], "ext_31_1": 66, "31": 66, "x_31_1": 66, "ext_30_0": 66, "x_30_0": 66, "ext_31_31": 66, "x_31_31": 66, "ext_0_0": 66, "x_0_0": 66, "eq2": 66, "01234567": 66, "visual": [66, 84, 87], "1234567": 66, "0123456": 66, "a_31_1": 66, "a_30_0": 66, "a_31_31": 66, "a_0_0": 66, "floating_point_arith": 67, "toi": 67, "2008": [67, 88], "cassert": 67, "fpt32": 67, "restrict": [67, 81, 89], "inf": [67, 81], "someth": [67, 81], "to_sbv": 67, "final": [67, 81], "trick": [67, 81], "smallest": 67, "0b001": 67, "floatingpointarith": 67, "floating_point": 67, "commut": 67, "is_tautologi": 67, "succe": 67, "contribut": 67, "eva": 67, "darulova": 67, "symfpu": 67, "fp32": 67, "constrain": [67, 81], "11000000010010001111010111000011": 67, "01000000010010001111010111000011": 67, "bounds_x": 67, "bounds_i": 67, "bounds_z": 67, "veri": 68, "noth": 68, "helloworld": 68, "tutori": 68, "qf_uf": 68, "firstli": 69, "secondli": 69, "tight": 69, "linear_arith": 69, "qf_lira": 69, "neg2": 69, "two_third": 69, "three_i": 69, "diff": [69, 81], "x_geq_3i": 69, "x_leq_i": 69, "neg2_lt_x": 69, "diff_leq_two_third": 69, "diff_is_two_third": 69, "lineararith": 69, "famili": 71, "peopl": [71, 95], "male": [71, 95], "femal": [71, 95], "father": [71, 95], "mother": [71, 95], "parent": [71, 95], "ancestor": [71, 95], "descend": [71, 95], "nonempti": 71, "cap": [71, 81, 91], "bowti": 71, "subseteq": [71, 91], "cup": [71, 91], "person": [71, 95], "langl": 71, "rangl": 71, "mrtb17": [71, 88, 95], "ext": [71, 80, 81, 95], "personsort": [71, 95], "tuplearity1": [71, 95], "relationarity1": [71, 95], "tuplearity2": [71, 95], "relationarity2": [71, 95], "emptysetterm": [71, 95], "emptyrelationterm": [71, 95], "universeset": [71, 95], "isempty1": [71, 95], "isempty2": [71, 95], "peoplearetheunivers": [71, 95], "malesetisnotempti": [71, 95], "femalesetisnotempti": [71, 95], "inter": [71, 73, 81, 86, 95], "malesfemalesintersect": [71, 95], "malesandfemalesaredisjoint": [71, 95], "isempty3": [71, 95], "isempty4": [71, 95], "fatherisnotempti": [71, 95], "motherisnotempti": [71, 95], "fathersaremal": [71, 95], "mothersarefemal": [71, 95], "unionfathermoth": [71, 95], "parentisfatherormoth": [71, 95], "tclosur": [71, 95], "transitiveclosur": [71, 95], "ancestorformula": [71, 95], "descendantformula": [71, 95], "xxtupl": [71, 95], "notmemb": [71, 95], "quantifiedvari": [71, 95], "noselfancestor": [71, 95], "set_": [71, 73, 95], "qf_slia": [72, 74, 94], "smtlib2": [72, 74], "intseq": 72, "concat_len": 72, "formula1": [72, 74], "formula2": [72, 74], "int_seq": 72, "kshitij": [73, 88, 95], "bansal": [73, 88, 95], "uf": [73, 81, 95], "qf_ufliaf": [73, 95], "unionab": [73, 95], "emptset": [73, 95], "me": [73, 95], "singleton_on": [73, 95], "singleton_two": [73, 95], "singleton_thre": [73, 95], "one_two": [73, 95], "two_thre": [73, 95], "abc": [73, 74, 86, 96], "tianyi": 74, "liang": 74, "str_ab": 74, "leni": 74, "s2": [74, 94], "formula3": 74, "to_r": 74, "in_r": 74, "abdalrhman": [75, 76, 77], "start_bool": 75, "startbool": 75, "varx": [75, 76], "vari": [75, 81], "max_x_i": 75, "min_x_i": 75, "printsynthsolut": [75, 76, 77], "sygusfun": 75, "print_synth_solut": [75, 76, 77], "header": [75, 76, 77], "ifndef": [75, 76, 77], "cvc5__utils_h": [75, 76, 77], "sol": [75, 76, 77, 81], "endif": [75, 76, 77], "definefuntostr": [75, 76, 77], "ss": [75, 76, 77, 81], "stringbuild": [75, 76, 77], "getchild": [75, 76, 77], "define_fun_to_str": [75, 76, 77], "neg_x": 76, "termain": 76, "g2": 76, "g3": 76, "id1": 76, "id2": 76, "id3": 76, "reusabl": 76, "remain": [76, 80, 89, 90, 94], "id4": 76, "id1_x": 76, "id2_x": 76, "id3_x": 76, "id4_x": 76, "sygusgrammar": 76, "look": [76, 90], "ten": 77, "xp": 77, "sygusinv": 77, "open": [79, 86], "prover": 79, "successor": 79, "cvc4": [79, 80], "local": [80, 81], "build_dir": 80, "jn": 80, "parallel": 80, "thread": 80, "linux": 80, "mingw": 80, "w64": 80, "arm64": 80, "recommend": 80, "homebrew": 80, "tap": 80, "link": 80, "strongli": [80, 81], "discourag": 80, "dynam": [80, 81], "win64": 80, "dep": 80, "gcc": 80, "clang": 80, "toml": 80, "v6": 80, "packag": 80, "ship": 80, "eager": [80, 81, 86], "blast": [80, 81, 86], "cad": 80, "nonlinear": [80, 81, 88, 98], "poli": [80, 86], "multiprecis": 80, "better": 80, "footprint": 80, "permiss": 80, "gpl": 80, "speed": [80, 81], "contrib": 80, "script": [80, 85], "discuss": 80, "edit": 80, "tab": 80, "histori": [80, 81], "prompt": 80, "libedit": 80, "devel": 80, "flexibl": [80, 83], "simplevc": 80, "lang": [80, 81], "scikit": 80, "pytest": 80, "help": [80, 81], "develop": 80, "maintain": [80, 81], "contact": 80, "team": 80, "issu": 80, "tracker": 80, "doxygen": 80, "sphinx": 80, "rtd": 80, "theme": 80, "sphinxcontrib": 80, "bibtex": 80, "programoutput": 80, "breath": 80, "gh": 80, "content": 80, "readm": 80, "md": 80, "ctest": 80, "infrastructur": 80, "regex": 80, "exclud": 80, "label": 80, "le": 80, "failur": [80, 81], "regressn": 80, "apitest": 80, "api_test": 80, "system_test": 80, "ourobor": 80, "unit_test": 80, "subdir": 80, "map_util_black": 80, "regress_test": 80, "regress0": [80, 82, 83, 85, 90], "bug288b": 80, "preconfigur": 80, "systemtest": 80, "runexampl": 80, "coverag": 80, "gcov": 80, "sure": 80, "commit": 80, "sha": 80, "config": [80, 81], "wget": 80, "archiv": 80, "tar": 80, "gz": 80, "xf": 80, "runtim": [81, 90], "wide": [81, 90], "letter": 81, "interv": [81, 86, 98], "treatment": 81, "exhaust": [81, 89], "lang_auto": 81, "forc": 81, "inst": 81, "trigger": [81, 86], "benchmark": 81, "lit": 81, "deep": 81, "restart": [81, 89], "candid": [81, 82], "back": [81, 82], "verbatim": 81, "process": [81, 82, 86, 88, 89], "along": [81, 82], "quiet": 81, "decreas": 81, "rlimit": [81, 89], "reproduc": 81, "tlimit": 81, "millisecond": [81, 89], "wall": 81, "clock": 81, "increas": 81, "shell": 81, "seed": 81, "random": 81, "attempt": 81, "strict": [81, 86], "toler": 81, "conform": 81, "common": [81, 86, 98], "subexpr": 81, "don": 81, "200": 81, "expert": 81, "approxim": [81, 86, 98], "arith": [81, 86, 90], "brab": 81, "cube": 81, "compliant": 81, "prop": 81, "unat": 81, "bi": 81, "decid": [81, 93], "tableau": 81, "row": 81, "shorter": 81, "rewrit": [81, 83, 85, 86, 89], "inequ": [81, 86], "collect": [81, 86, 90], "pivot": [81, 86], "cut": 81, "period": 81, "dio": 81, "decomp": 81, "leak": 81, "diophantin": 81, "equat": [81, 86], "griggio": [81, 88], "jsat": 81, "2012": 81, "varord": 81, "simplex": 81, "violat": 81, "fc": 81, "penalti": 81, "degener": 81, "unset": 81, "tune": 81, "replai": [81, 86], "extern": [81, 86, 87, 89], "maxcutsincontext": 81, "65535": 81, "miplib": 81, "tmp": 81, "nl": 81, "cov": 81, "cylindr": 81, "algebra": 81, "lift": 81, "lazard": 81, "scheme": 81, "discard": 81, "whenev": [81, 89], "proj": [81, 92], "mccallum": 81, "modif": [81, 86], "prune": 81, "agress": 81, "elim": [81, 86], "go": 81, "light": 81, "approach": 81, "weight": [81, 89], "ent": 81, "conf": 81, "conflict": [81, 86], "factor": [81, 86], "inc": 81, "irrat": 81, "purifi": 81, "rbound": 81, "resolut": [81, 83, 85, 86], "split": [81, 86], "tf": 81, "taylor": [81, 86], "deg": 81, "degre": [81, 86], "polynomi": [81, 86], "tplane": [81, 86], "plane": [81, 86, 98], "strategi": [81, 86], "interleav": 81, "icp": 81, "rlv": 81, "threshold": 81, "pp": 81, "ppassert": 81, "earli": 81, "close": [81, 86], "eagerli": 81, "reject": 81, "25500": 81, "coeffici": 81, "effort": 81, "fulleffort": 81, "revert": 81, "known": 81, "cach": 81, "rr": 81, "robin": 81, "se": 81, "recheck": 81, "soi": 81, "quick": [81, 85], "explain": [81, 95], "minim": 81, "infeas": 81, "invoc": 81, "bland": 81, "ineq": 81, "relationship": 81, "fcsimplex": 81, "focus": 81, "converg": 81, "fmcad": 81, "2013": [81, 88], "submiss": 81, "de": [81, 86, 88], "moura": [81, 88], "09": 81, "paper": 81, "reduc": [81, 86], "care": 81, "graph": [81, 84], "algorithm": [81, 86], "christ": 81, "hoenick": 81, "2014": 81, "debug": [81, 82], "diagnost": 81, "channel": 81, "managederr": 81, "stderr": 81, "stdout": 81, "filenam": [81, 90], "managedin": 81, "read": [81, 86], "stdin": 81, "managedout": 81, "rweight": [81, 89], "unchang": 81, "trace": 81, "pushpop": 81, "wildcard": 81, "bitblast": [81, 86], "lazi": 81, "variou": 81, "aggress": [81, 86], "booltobv": 81, "ITEs": 81, "gauss": 81, "gaussian": 81, "intro": [81, 86], "blaster": 81, "rw": 81, "2017": [81, 88], "scholl": 81, "smt08": 81, "minisat": 81, "cryptominisat": 81, "cadic": 81, "kissat": 81, "backend": 81, "cdt": 81, "bisimilar": 81, "dt": [81, 92, 95], "cyclic": 81, "send": 81, "polit": 81, "sel": [81, 86, 92], "across": [81, 90], "abort": 81, "tell": 81, "fair": 81, "height": 81, "instant": [81, 82], "symmetri": [81, 86], "break": 81, "agg": 81, "smart": 81, "lazili": 81, "pbe": 81, "justif": [81, 85], "stoponli": 81, "atgp": 81, "inspir": 81, "stop": 81, "jh": 81, "activ": 81, "polici": [81, 86], "pend": 81, "do_semantic_checks_by_default": 81, "wf": 81, "wb": 81, "lazier": 81, "prenotifyfact": 81, "registerterm": 81, "measur": [81, 89], "cpu": 81, "portfolio": 81, "job": 81, "segv": 81, "spin": 81, "segfault": 81, "wait": 81, "gdb": 81, "emit": 81, "entir": 81, "chosen": 81, "request": 81, "trail": 81, "c2": [81, 93], "c3": 81, "filesystem": 81, "b0001": 81, "expr": 81, "flatten": 81, "ho": 81, "chain": [81, 86], "refut": [81, 86], "sound": 81, "cluster": 81, "cnf": [81, 86], "aleth": [81, 86, 87], "lfsc": [81, 86, 87], "progress": 81, "granular": [81, 83, 85], "dsl": 81, "improv": 81, "expand": [81, 86], "pedant": 81, "incorrect": 81, "untrust": 81, "merg": 81, "subproof": [81, 84, 86], "processor": 81, "unus": 81, "scope": [81, 86], "dimac": 81, "calus": 81, "freq": 81, "cbqi": 81, "rd": 81, "qcf": 81, "irrelev": 81, "portion": [81, 86, 96], "tconstraint": 81, "vo": 81, "cegi": 81, "sampl": 81, "trust": [81, 85, 86], "acceler": 81, "inde": 81, "spuriou": 81, "cegqi": 81, "invers": 81, "invert": [81, 86], "slack": 81, "boundari": 81, "becom": 81, "side": [81, 85, 86], "adder": 81, "resort": 81, "vt": 81, "innermost": 81, "midpoint": 81, "nopt": 81, "cond": 81, "quant": 81, "lead": 81, "gen": 81, "ground": 81, "expans": [81, 84, 86], "stc": 81, "ind": 81, "strengthen": 81, "quantif": [81, 82], "taut": 81, "tautolog": 81, "techniqu": [81, 98], "mean": [81, 85, 86, 89], "stratifi": 81, "favor": 81, "fmf": 81, "proxi": 81, "admiss": 81, "mbqi": 81, "fmc": 81, "thesi": 81, "1000": 81, "satur": 81, "due": [81, 83, 89], "ax": 81, "db": 81, "delai": 81, "dtt": 81, "ites": 81, "smaller": [81, 86, 94], "conserv": 81, "likewis": 81, "miniscop": 81, "fv": [81, 86], "prenex": 81, "norm": 81, "mapsto": [81, 86], "alpha": [81, 86], "dsplit": 81, "wd": 81, "rep": 81, "ee": 81, "regist": 81, "prefer": 81, "analysi": [81, 88], "unfold": [81, 84, 86], "unif": [81, 86], "connect": [81, 93], "crepair": 81, "repair": 81, "fast": 81, "agnost": 81, "geometr": 81, "miner": 81, "stronger": 81, "weaker": 81, "rev": [81, 94, 96], "backward": 81, "previou": 81, "concis": 81, "symobl": 81, "monomi": [81, 86], "insid": 81, "outsid": 81, "maxim": [81, 94], "templ": 81, "weaken": [81, 86], "precondit": 81, "postcondit": 81, "sg": 81, "reconstruct": [81, 83, 88], "unifi": 81, "minimi": 81, "preproc": 81, "fuzz": [81, 83, 85], "unsolv": 81, "subsolv": 81, "hard": 81, "avoid": 81, "accel": 81, "correct": [81, 86], "cong": [81, 83, 85, 86], "congruenc": [81, 86], "nvar": 81, "uniform": 81, "uniformli": 81, "fashion": 81, "si": [81, 96], "rcon": 81, "exceed": 81, "successfulli": 81, "10000": 81, "unlimit": 81, "igain": 81, "piecewis": 81, "indeped": 81, "barbosa": [81, 88], "et": 81, "al": 81, "unconstrain": 81, "gain": 81, "shuffl": 81, "verif": [81, 88], "databas": 81, "subterm": 81, "pat": 81, "ignor": [81, 94], "unbound": 81, "sep": [81, 93], "refin": [81, 98], "emp": [81, 93], "shorten": 81, "mayb": 81, "expens": 81, "averag": 81, "rew": 81, "prep": 81, "foreign": 81, "simp": 81, "kim": 81, "somenzi": 81, "suffici": 81, "unev": 81, "unevaluat": 81, "unlabel": 81, "track": 81, "unless": 81, "sove": 81, "nonclaus": 81, "compress": 81, "simplifywithcar": 81, "simplifici": 81, "batch": 81, "save": [81, 84], "clausal": 81, "subtyp": 81, "bcp": 81, "substituion": 81, "4294967295": 81, "pure": 81, "bitwidth": 81, "calcul": [81, 86], "monoton": 81, "bruttomesso": 81, "brummay": 81, "phd": 81, "qf_abv": 81, "prepocess": 81, "card": [81, 95], "196608": 81, "alphabet": 81, "deq": [81, 86], "extension": [81, 86], "ff": [81, 85], "flat": 81, "mbr": 81, "65536": 81, "omit": [81, 86], "rexplain": 81, "regress": [81, 82, 83, 85, 90], "condens": 81, "central": [81, 89], "own": 81, "tc": 81, "theoryof": 81, "breaker": 81, "deharb": 81, "cade": [81, 88], "2011": [81, 88], "ll": 81, "shrink": 81, "aspect": 82, "cli": [82, 83, 85, 90], "regress1": 82, "qid": 82, "myquant1": 82, "myquant2": 82, "f_int": 82, "f_bool": 82, "cvc": [82, 85], "nat": 82, "succ": 82, "pred": 82, "printer": [82, 86], "print_sub": 82, "additon": 83, "coars": [83, 86], "fine": [83, 85, 88], "grain": [83, 85, 86, 88], "verit": [83, 88], "bdodeharbef09": [83, 88], "isabel": 83, "hol": 83, "bbff20": [83, 88], "sfd21": [83, 88], "coq": [83, 88], "smtcoq": [83, 88], "plugin": 83, "afgregoir": [83, 88], "emt": [83, 88], "rust": 83, "checker": [83, 85, 86], "qgu": [83, 85], "a0": 83, "t1": [83, 86, 92, 93], "cl": 83, "equiv_pos2": 83, "refl": [83, 85, 86], "t3": 83, "t4": 83, "all_simplifi": 83, "t5": 83, "premis": [83, 86], "t6": 83, "t7": 83, "t8": 83, "t9": 83, "t10": 83, "not_and": [83, 86], "t11": 83, "t12": 83, "equiv2": 83, "t13": 83, "t14": 83, "equiv1": 83, "t15": 83, "reorder": [83, 85, 86], "t16": 83, "t17": 83, "t18": 83, "or_neg": 83, "t19": 83, "t20": 83, "contract": 83, "t21": 83, "t22": 83, "t23": 83, "t24": 83, "t25": 83, "t26": 83, "t27": 83, "t28": 83, "t29": 83, "t30": 83, "t31": 83, "among": [84, 86], "thing": [84, 86], "leverag": 84, "calculu": [84, 85, 86, 87], "dedic": 84, "suffic": 84, "upload": 84, "color": [84, 92], "stepwis": 84, "lf": 85, "framework": [85, 88], "sor": [85, 88], "repositori": 85, "meta": 85, "signatur": 85, "warn": 85, "often": 85, "theory_rewrit": [85, 86], "__t1": 85, "__t2": 85, "__t3": 85, "__t4": 85, "__t5": 85, "__t6": 85, "__t7": 85, "__t8": 85, "__a0": 85, "plet": 85, "__p1": 85, "f_and": 85, "__p2": 85, "__p3": 85, "__p4": 85, "__p5": 85, "f_not": 85, "__p6": 85, "and_elim": [85, 86], "eq_resolv": [85, 86], "__p7": 85, "__p8": 85, "__p9": 85, "f_": 85, "__p10": 85, "__p11": 85, "equiv_elim1": [85, 86], "cnf_equiv_pos1": [85, 86], "tt": [85, 88], "pfrule": 86, "analog": 86, "texttt": 86, "rulenam": 86, "inferrulesc": 86, "varphi_1": 86, "varphi_n": 86, "mid": 86, "t_m": 86, "psi": 86, "varphi_i": 86, "t_i": 86, "tm": 86, "sometim": 86, "abus": 86, "interchang": 86, "target": 86, "design": 86, "categor": 86, "enclos": [86, 98], "macro_": 86, "inferrul": 86, "justifi": 86, "f_1": 86, "f_n": 86, "land": 86, "neq": 86, "bot": 86, "textrm": 86, "dual": 86, "conclud": 86, "circ": 86, "sigma_": 86, "f_i": 86, "methodid": 86, "idr": 86, "rw_evalu": 86, "macro_sr_eq_intro": 86, "rewritten": 86, "proven": 86, "ida": 86, "view": 86, "transform": 86, "proof_check": 86, "macro_sr_pred_intro": 86, "toorigin": 86, "hand": 86, "purif": 86, "macro_sr_pred_elim": 86, "macro_sr_pred_transform": 86, "a_1": 86, "a_n": 86, "anyth": 86, "inferenceid": 86, "remove_term_formula_axiom": 86, "removetermformula": 86, "getaxiomfor": 86, "theory_lemma": 86, "tid": 86, "theoryid": 86, "rid": 86, "rw_rewrite_theory_pr": 86, "rw_rewrite_theory_post": 86, "rw_rewrite_eq_ext": 86, "theory_preprocess": 86, "pprewrit": 86, "theory_preprocess_lemma": 86, "preprocess_lemma": 86, "theory_expand_def": 86, "witness_axiom": 86, "trust_rewrit": 86, "replay": 86, "postprocess": 86, "trust_sub": 86, "trust_subs_map": 86, "trustsubstitutionmap": 86, "trust_subs_eq": 86, "theory_infer": 86, "fact": 86, "sat_refut": 86, "c_2": 86, "pol": 86, "polar": 86, "resp": 86, "accord": 86, "unsound": 86, "chain_resolut": 86, "pol_1": 86, "l_1": 86, "pol_": 86, "l_": 86, "diamond_": 86, "mathit": 86, "c_i": 86, "diamond": 86, "macro_resolut": 86, "macro_resolution_trust": 86, "uncheck": 86, "lor": 86, "f_2": 86, "modus_ponen": 86, "modu": 86, "ponen": 86, "implies_elim": 86, "not_not_elim": 86, "contra": 86, "contradict": 86, "and_intro": 86, "not_or_elim": 86, "not_implies_elim1": 86, "not_implies_elim2": 86, "equiv_elim2": 86, "not_equiv_elim1": 86, "not_equiv_elim2": 86, "xor_elim1": 86, "xor_elim2": 86, "not_xor_elim1": 86, "not_xor_elim2": 86, "ite_elim1": 86, "ite_elim2": 86, "not_ite_elim1": 86, "not_ite_elim2": 86, "cnf_and_po": 86, "cnf_and_neg": 86, "cnf_or_po": 86, "cnf_or_neg": 86, "cnf_implies_po": 86, "cnf_implies_neg1": 86, "cnf_implies_neg2": 86, "cnf_equiv_pos2": 86, "cnf_equiv_neg1": 86, "cnf_equiv_neg2": 86, "cnf_xor_pos1": 86, "cnf_xor_pos2": 86, "cnf_xor_neg1": 86, "cnf_xor_neg2": 86, "cnf_ite_pos1": 86, "cnf_ite_pos2": 86, "cnf_ite_pos3": 86, "cnf_ite_neg1": 86, "cnf_ite_neg2": 86, "cnf_ite_neg3": 86, "reflex": 86, "symm": 86, "t_2": 86, "t_": 86, "t_n": 86, "s_n": 86, "proofrulecheck": 86, "mkkindnod": 86, "true_intro": 86, "true_elim": 86, "false_intro": 86, "false_elim": 86, "ho_app_encod": 86, "theoryufrewrit": 86, "gethoapplyforapplyuf": 86, "isth": 86, "ho_cong": 86, "arrays_read_over_writ": [86, 90], "arrays_read_over_write_contra": 86, "contraposit": 86, "arrays_read_over_write_1": [86, 90], "arrays_ext": [86, 90], "skolemcach": 86, "getextindexskolem": 86, "arrays_eq_range_expand": 86, "eqrang": 86, "bv_bitblast": 86, "circuit": 86, "bitblast_strategies_templ": 86, "bv_bitblast_step": 86, "bv_eager_atom": 86, "atom": 86, "bitvector_eager_atom": 86, "dt_unif": 86, "s_i": 86, "dt_inst": 86, "_c": 86, "discrimin": [86, 92], "dt_collaps": 86, "collaps": 86, "_i": 86, "c_j": 86, "typenod": 86, "mkgroundterm": 86, "proper": 86, "mkgroundvalu": 86, "dt_split": 86, "vee": 86, "dt_clash": 86, "clash": 86, "skolem_intro": 86, "unpurifi": 86, "sigma": 86, "skolemmanag": 86, "mkskolem": 86, "getwitnessform": 86, "caus": 86, "quantifiers_inst_e_match": 86, "alpha_equiv": 86, "z_1": 86, "z_n": 86, "varphi": [86, 93], "quantifiers_preprocess": 86, "quantifierspreprocess": 86, "concat_eq": 86, "ldot": [86, 93], "stand": 86, "implicit": 86, "mathsf": 86, "bc": 86, "splitconst": 86, "concat_unifi": 86, "concat_conflict": 86, "neither": 86, "concat_split": 86, "r_t": 86, "r_": 86, "suf": [86, 94], "concat_csplit": 86, "concat_lprop": 86, "concat_cprop": 86, "w_1": 86, "w_2": 86, "w_3": 86, "overlap": 86, "largest": 86, "therefor": [86, 89, 90], "roverlap": 86, "string_decompos": 86, "decomposit": 86, "string_length_po": 86, "string_length_non_empti": 86, "string_reduct": 86, "stringspreprocess": 86, "string_eager_reduct": 86, "termregistri": 86, "eagerreduc": 86, "re_int": 86, "r_1": 86, "r_2": 86, "re_unfold_po": 86, "regexpopr": 86, "reduceregexppo": 86, "re_unfold_neg": 86, "reduceregexpneg": 86, "re_unfold_neg_concat_fix": 86, "reduceregexpnegconcatfix": 86, "getregexpconcatfix": 86, "re_elim": 86, "regexpelimin": 86, "string_code_inj": 86, "_code": 86, "string_seq_unit_inj": 86, "string_infer": 86, "isrev": 86, "bookkeep": 86, "inferproofcon": 86, "macro_arith_scale_sum_ub": 86, "l_n": 86, "k_1": 86, "k_n": 86, "k_i": 86, "mathbb": [86, 91], "fusion": 86, "diamond_i": 86, "flip": 86, "scale": 86, "colon": 86, "p_1": 86, "p_n": 86, "arith_sum_ub": 86, "p_i": 86, "l_i": 86, "r_i": 86, "r_n": 86, "int_tight_ub": 86, "tighten": 86, "lfloor": 86, "rfloor": 86, "int_tight_lb": 86, "lceil": 86, "rceil": 86, "arith_trichotomi": 86, "trichotomi": 86, "arith_op_elim_axiom": 86, "operatorelim": 86, "arith_poly_norm": 86, "polynorm": 86, "isarithpolynorm": 86, "arith_mult_sign": 86, "f_k": 86, "arith_mult_po": 86, "arith_mult_neg": 86, "arith_mult_tang": 86, "arith_trans_pi": 86, "arith_trans_exp_neg": 86, "arith_trans_exp_posit": 86, "arith_trans_exp_super_lin": 86, "grow": [86, 89], "super": 86, "linearli": [86, 89], "arith_trans_exp_zero": 86, "arith_trans_exp_approx_above_neg": 86, "maclaurin": 86, "seri": 86, "frac": 86, "arith_trans_exp_approx_above_po": 86, "po": 86, "arith_trans_exp_approx_below": 86, "infti": 86, "arith_trans_sine_bound": 86, "sin": [86, 98], "arith_trans_sine_shift": 86, "slolem": 86, "arith_trans_sine_symmetri": 86, "symmetr": 86, "arith_trans_sine_tangent_zero": 86, "arith_trans_sine_tangent_pi": 86, "arith_trans_sine_approx_above_neg": 86, "lb": 86, "ub": 86, "arith_trans_sine_approx_above_po": 86, "arith_trans_sine_approx_below_neg": 86, "arith_trans_sine_approx_below_po": 86, "arith_nl_covering_direct": 86, "irp": 86, "_k": 86, "indexedrootpred": 86, "univari": 86, "topmost": 86, "arith_nl_covering_recurs": 86, "x_": 86, "lfsc_rule": 86, "holder": 86, "a_m": 86, "alethe_rul": 86, "faithfulli": 87, "reflect": [87, 89], "meant": 87, "micha": 88, "\u00eb": 88, "armand": 88, "germain": 88, "faur": 88, "benjamin": 88, "gr": 88, "\u00e9": 88, "goir": 88, "chantal": 88, "keller": 88, "laurent": 88, "ry": 88, "werner": 88, "modular": 88, "slash": 88, "jean": 88, "pierr": 88, "jouannaud": 88, "zhong": 88, "shao": 88, "editor": 88, "certifi": 88, "volum": 88, "7086": 88, "lectur": 88, "scienc": 88, "135": 88, "150": 88, "springer": 88, "1007": 88, "978": 88, "642": 88, "25379": 88, "9_12": 88, "bbrt17": [88, 95], "cesar": 88, "tinelli": 88, "decis": [88, 89, 92, 93, 98], "procedur": [88, 92, 93, 98], "corr": 88, "arxiv": 88, "1702": 88, "06259": 88, "haniel": 88, "jasmin": 88, "christian": 88, "blanchett": 88, "fleuri": 88, "pascal": 88, "fontain": 88, "scalabl": 88, "journal": 88, "autom": 88, "485": 88, "510": 88, "2020": 88, "url": 88, "s10817": 88, "018": 88, "09502": 88, "bft17": [88, 93], "technic": 88, "depart": 88, "iowa": 88, "www": 88, "bst07": [88, 92], "igor": 88, "shikanian": 88, "satisf": 88, "21": 88, "46": 88, "2007": 88, "3233": 88, "sat190028": 88, "thoma": 88, "bouton": 88, "diego": 88, "caminha": 88, "oliveira": 88, "david": 88, "harb": 88, "pen": 88, "rustabl": 88, "fficient": 88, "olver": 88, "renat": 88, "schmidt": 88, "confer": 88, "deduct": 88, "5663": 88, "151": 88, "156": 88, "dx": 88, "02959": 88, "2_12": 88, "cgi": [88, 98], "alessandro": 88, "cimatti": 88, "alberto": 88, "ahm": 88, "irfan": 88, "marco": 88, "roveri": 88, "roberto": 88, "sebastiani": 88, "acm": 88, "19": 88, "52": [88, 93], "2018": 88, "1145": 88, "3230639": 88, "burak": 88, "ekici": 88, "alain": 88, "mebsout": 88, "gui": 88, "katz": 88, "plug": 88, "rupak": 88, "majumdar": 88, "viktor": 88, "kuncak": 88, "aid": 88, "cav": 88, "10427": 88, "126": 88, "133": 88, "319": 88, "63390": 88, "9_7": 88, "84": 88, "baoluo": 88, "meng": 88, "leonardo": 88, "26": 88, "26th": 88, "gothenburg": 88, "sweden": 88, "august": 88, "proceed": 88, "10395": 88, "148": 88, "165": 88, "63046": 88, "5_10": 88, "rb15": [88, 92], "ami": 88, "felti": 88, "aart": 88, "middeldorp": 88, "25th": 88, "berlin": 88, "germani": 88, "2015": 88, "9195": 88, "197": 88, "213": 88, "21401": 88, "6_13": 88, "risk16": [88, 93], "radu": 88, "iosif": 88, "cristina": 88, "serban": 88, "cyril": 88, "artho": 88, "axel": 88, "legai": 88, "doron": 88, "pele": 88, "technologi": 88, "14th": 88, "symposium": 88, "atva": 88, "2016": 88, "chiba": 88, "japan": 88, "octob": 88, "9938": 88, "244": 88, "261": 88, "46520": 88, "3_16": 88, "han": 88, "\u00f6": 88, "rg": 88, "schurr": 88, "martin": 88, "desharnai": 88, "reliabl": 88, "assist": 88, "platzer": 88, "geoff": 88, "sutcliff": 88, "12699": 88, "450": 88, "467": 88, "2021": 88, "030": 88, "79876": 88, "5_26": 88, "aaron": 88, "stump": 88, "duckki": 88, "oe": 88, "syst": 88, "42": 88, "91": 88, "118": 88, "s10703": 88, "012": 88, "0163": 88, "amount": 89, "whole": 89, "lifetim": 89, "honor": 89, "subroutin": 89, "realiz": 89, "afterward": 89, "asynchron": 89, "setitim": 89, "ulimit": 89, "inher": 89, "unsuit": 89, "standalon": 89, "effect": 89, "As": 89, "soon": 89, "continu": [89, 94], "Then": 89, "intent": 89, "spent": 89, "event": 89, "modifi": 89, "restartstep": 89, "varieti": 90, "insight": 90, "enable_statist": 90, "competit": 90, "dealloc": 90, "stabl": 90, "minor": 90, "timer": 90, "export": 90, "auflia": 90, "bug336": 90, "unknown_type_const": 90, "totaltim": 90, "5m": 90, "inferenceslemma": 90, "arith_split_deq": 90, "inferencesfact": 90, "combination_split": 90, "overal": 90, "sent": 90, "difference_subtract": 91, "duplicate_remov": 91, "uplu": [91, 93], "m_2": 91, "difference_remov": 91, "delta": 91, "qf_dt": 92, "d1": 92, "dk": 92, "nk": 92, "s11": 92, "s1i": 92, "cj": 92, "sij": 92, "red": 92, "black": 92, "fname": 92, "lname": 92, "john": 92, "smith": 92, "sugar": [92, 95], "coinduct": 92, "ci": 92, "term_1": [92, 95], "term_n": [92, 95], "upd": 92, "sort_1": [92, 93, 95], "sort_n": [92, 95], "s_int": [92, 95], "i1": 92, "fst": 92, "snd": 92, "getselectorterm": 92, "sl": 93, "loc": 93, "pto": 93, "f2": 93, "classic": 93, "variad": 93, "models_": 93, "phi_1": 93, "phi_n": 93, "h_1": 93, "h_n": 93, "h_i": 93, "phi_i": 93, "phi_2": 93, "summar": 93, "sort_2": 93, "accept": 93, "indexof": 94, "dst": 94, "replace_al": 94, "prefixof": 94, "suffixof": 94, "sgl": 95, "subtl": 95, "That": [95, 98], "motiv": 95, "presenc": 95, "counter": 95, "intuit": 95, "tuple_select": 95, "indexof_r": 96, "w\u2082": 96, "u\u2081": 96, "w\u2081": 96, "shortest": 96, "u\u2081w\u2081u\u2082": 96, "u\u2081u\u2082u\u2083": 96, "u\u2081w\u2083u\u2083": 96, "w\u2083": 96, "u\u2082": 96, "u\u2082u\u2084": 96, "cba": 96, "to_low": 96, "ri": 96, "65": 96, "90": 96, "ascii": 96, "to_upp": 96, "97": 96, "122": 96, "beyond": 97, "mix": 97, "nra": 98, "nira": 98, "tan": 98, "qf_nrat": 98, "csc": 98, "sec": 98, "cot": 98, "arcco": 98, "arctan": 98, "arccsc": 98, "arccot": 98, "subject": 98, "said": 98, "inexact": 98, "demand": 98, "twopi": 98, "ysq": 98, "sinx": 98, "x_gt_pi": 98, "x_lt_tpi": 98, "ysq_lt_sinx": 98}, "objects": {"": [[10, 0, 1, "_CPPv4N4cvc54Kind3ABSE", "cvc5::ABS"], [10, 0, 1, "_CPPv4N4cvc54Kind3ADDE", "cvc5::ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind3ANDE", "cvc5::AND"], [10, 0, 1, "_CPPv4N4cvc54Kind17APPLY_CONSTRUCTORE", "cvc5::APPLY_CONSTRUCTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind14APPLY_SELECTORE", "cvc5::APPLY_SELECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind12APPLY_TESTERE", "cvc5::APPLY_TESTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8APPLY_UFE", "cvc5::APPLY_UF"], [10, 0, 1, "_CPPv4N4cvc54Kind13APPLY_UPDATERE", "cvc5::APPLY_UPDATER"], [10, 0, 1, "_CPPv4N4cvc54Kind11ARCCOSECANTE", "cvc5::ARCCOSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind9ARCCOSINEE", "cvc5::ARCCOSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind12ARCCOTANGENTE", "cvc5::ARCCOTANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind9ARCSECANTE", "cvc5::ARCSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind7ARCSINEE", "cvc5::ARCSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind10ARCTANGENTE", "cvc5::ARCTANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_CARDE", "cvc5::BAG_CARD"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_CHOOSEE", "cvc5::BAG_CHOOSE"], [10, 0, 1, "_CPPv4N4cvc54Kind9BAG_COUNTE", "cvc5::BAG_COUNT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BAG_DIFFERENCE_REMOVEE", "cvc5::BAG_DIFFERENCE_REMOVE"], [10, 0, 1, "_CPPv4N4cvc54Kind23BAG_DIFFERENCE_SUBTRACTE", "cvc5::BAG_DIFFERENCE_SUBTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BAG_DUPLICATE_REMOVALE", "cvc5::BAG_DUPLICATE_REMOVAL"], [10, 0, 1, "_CPPv4N4cvc54Kind9BAG_EMPTYE", "cvc5::BAG_EMPTY"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_FILTERE", "cvc5::BAG_FILTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_FOLDE", "cvc5::BAG_FOLD"], [10, 0, 1, "_CPPv4N4cvc54Kind12BAG_FROM_SETE", "cvc5::BAG_FROM_SET"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_INTER_MINE", "cvc5::BAG_INTER_MIN"], [10, 0, 1, "_CPPv4N4cvc54Kind16BAG_IS_SINGLETONE", "cvc5::BAG_IS_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_MAKEE", "cvc5::BAG_MAKE"], [10, 0, 1, "_CPPv4N4cvc54Kind7BAG_MAPE", "cvc5::BAG_MAP"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_MEMBERE", "cvc5::BAG_MEMBER"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_PARTITIONE", "cvc5::BAG_PARTITION"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_SUBBAGE", "cvc5::BAG_SUBBAG"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_TO_SETE", "cvc5::BAG_TO_SET"], [10, 0, 1, "_CPPv4N4cvc54Kind18BAG_UNION_DISJOINTE", "cvc5::BAG_UNION_DISJOINT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_UNION_MAXE", "cvc5::BAG_UNION_MAX"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ADDE", "cvc5::BITVECTOR_ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ANDE", "cvc5::BITVECTOR_AND"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_ASHRE", "cvc5::BITVECTOR_ASHR"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_COMPE", "cvc5::BITVECTOR_COMP"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_CONCATE", "cvc5::BITVECTOR_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind17BITVECTOR_EXTRACTE", "cvc5::BITVECTOR_EXTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ITEE", "cvc5::BITVECTOR_ITE"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_LSHRE", "cvc5::BITVECTOR_LSHR"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_MULTE", "cvc5::BITVECTOR_MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_NANDE", "cvc5::BITVECTOR_NAND"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NEGE", "cvc5::BITVECTOR_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NORE", "cvc5::BITVECTOR_NOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NOTE", "cvc5::BITVECTOR_NOT"], [10, 0, 1, "_CPPv4N4cvc54Kind12BITVECTOR_ORE", "cvc5::BITVECTOR_OR"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_REDANDE", "cvc5::BITVECTOR_REDAND"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_REDORE", "cvc5::BITVECTOR_REDOR"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_REPEATE", "cvc5::BITVECTOR_REPEAT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_ROTATE_LEFTE", "cvc5::BITVECTOR_ROTATE_LEFT"], [10, 0, 1, "_CPPv4N4cvc54Kind22BITVECTOR_ROTATE_RIGHTE", "cvc5::BITVECTOR_ROTATE_RIGHT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SDIVE", "cvc5::BITVECTOR_SDIV"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SGEE", "cvc5::BITVECTOR_SGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SGTE", "cvc5::BITVECTOR_SGT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SHLE", "cvc5::BITVECTOR_SHL"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_SIGN_EXTENDE", "cvc5::BITVECTOR_SIGN_EXTEND"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SLEE", "cvc5::BITVECTOR_SLE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SLTE", "cvc5::BITVECTOR_SLT"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_SLTBVE", "cvc5::BITVECTOR_SLTBV"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SMODE", "cvc5::BITVECTOR_SMOD"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SREME", "cvc5::BITVECTOR_SREM"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SUBE", "cvc5::BITVECTOR_SUB"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_TO_NATE", "cvc5::BITVECTOR_TO_NAT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_UDIVE", "cvc5::BITVECTOR_UDIV"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_UGEE", "cvc5::BITVECTOR_UGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_UGTE", "cvc5::BITVECTOR_UGT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ULEE", "cvc5::BITVECTOR_ULE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ULTE", "cvc5::BITVECTOR_ULT"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_ULTBVE", "cvc5::BITVECTOR_ULTBV"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_UREME", "cvc5::BITVECTOR_UREM"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_XNORE", "cvc5::BITVECTOR_XNOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_XORE", "cvc5::BITVECTOR_XOR"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_ZERO_EXTENDE", "cvc5::BITVECTOR_ZERO_EXTEND"], [10, 0, 1, "_CPPv4N4cvc54Kind22CARDINALITY_CONSTRAINTE", "cvc5::CARDINALITY_CONSTRAINT"], [10, 0, 1, "_CPPv4N4cvc54Kind8CONSTANTE", "cvc5::CONSTANT"], [10, 0, 1, "_CPPv4N4cvc54Kind11CONST_ARRAYE", "cvc5::CONST_ARRAY"], [10, 0, 1, "_CPPv4N4cvc54Kind15CONST_BITVECTORE", "cvc5::CONST_BITVECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13CONST_BOOLEANE", "cvc5::CONST_BOOLEAN"], [10, 0, 1, "_CPPv4N4cvc54Kind19CONST_FLOATINGPOINTE", "cvc5::CONST_FLOATINGPOINT"], [10, 0, 1, "_CPPv4N4cvc54Kind13CONST_INTEGERE", "cvc5::CONST_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind14CONST_RATIONALE", "cvc5::CONST_RATIONAL"], [10, 0, 1, "_CPPv4N4cvc54Kind18CONST_ROUNDINGMODEE", "cvc5::CONST_ROUNDINGMODE"], [10, 0, 1, "_CPPv4N4cvc54Kind14CONST_SEQUENCEE", "cvc5::CONST_SEQUENCE"], [10, 0, 1, "_CPPv4N4cvc54Kind12CONST_STRINGE", "cvc5::CONST_STRING"], [10, 0, 1, "_CPPv4N4cvc54Kind8COSECANTE", "cvc5::COSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind6COSINEE", "cvc5::COSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind9COTANGENTE", "cvc5::COTANGENT"], [8, 1, 1, "_CPPv4N4cvc516CVC5ApiExceptionE", "cvc5::CVC5ApiException"], [8, 2, 1, "_CPPv4N4cvc516CVC5ApiException16CVC5ApiExceptionERKNSt12stringstreamE", "cvc5::CVC5ApiException::CVC5ApiException"], [8, 2, 1, "_CPPv4N4cvc516CVC5ApiException16CVC5ApiExceptionERKNSt6stringE", "cvc5::CVC5ApiException::CVC5ApiException"], [8, 3, 1, "_CPPv4N4cvc516CVC5ApiException16CVC5ApiExceptionERKNSt6stringE", "cvc5::CVC5ApiException::CVC5ApiException::str"], [8, 3, 1, "_CPPv4N4cvc516CVC5ApiException16CVC5ApiExceptionERKNSt12stringstreamE", "cvc5::CVC5ApiException::CVC5ApiException::stream"], [8, 2, 1, "_CPPv4NK4cvc516CVC5ApiException10getMessageEv", "cvc5::CVC5ApiException::getMessage"], [8, 2, 1, "_CPPv4NK4cvc516CVC5ApiException4whatEv", "cvc5::CVC5ApiException::what"], [8, 1, 1, "_CPPv4N4cvc527CVC5ApiRecoverableExceptionE", "cvc5::CVC5ApiRecoverableException"], [8, 2, 1, "_CPPv4N4cvc527CVC5ApiRecoverableException27CVC5ApiRecoverableExceptionERKNSt12stringstreamE", "cvc5::CVC5ApiRecoverableException::CVC5ApiRecoverableException"], [8, 2, 1, "_CPPv4N4cvc527CVC5ApiRecoverableException27CVC5ApiRecoverableExceptionERKNSt6stringE", "cvc5::CVC5ApiRecoverableException::CVC5ApiRecoverableException"], [8, 3, 1, "_CPPv4N4cvc527CVC5ApiRecoverableException27CVC5ApiRecoverableExceptionERKNSt6stringE", "cvc5::CVC5ApiRecoverableException::CVC5ApiRecoverableException::str"], [8, 3, 1, "_CPPv4N4cvc527CVC5ApiRecoverableException27CVC5ApiRecoverableExceptionERKNSt12stringstreamE", "cvc5::CVC5ApiRecoverableException::CVC5ApiRecoverableException::stream"], [10, 0, 1, "_CPPv4N4cvc54Kind8DISTINCTE", "cvc5::DISTINCT"], [10, 0, 1, "_CPPv4N4cvc54Kind9DIVISIBLEE", "cvc5::DIVISIBLE"], [10, 0, 1, "_CPPv4N4cvc54Kind8DIVISIONE", "cvc5::DIVISION"], [2, 1, 1, "_CPPv4N4cvc58DatatypeE", "cvc5::Datatype"], [2, 2, 1, "_CPPv4N4cvc58Datatype8DatatypeEv", "cvc5::Datatype::Datatype"], [2, 2, 1, "_CPPv4NK4cvc58Datatype5beginEv", "cvc5::Datatype::begin"], [2, 1, 1, "_CPPv4N4cvc58Datatype14const_iteratorE", "cvc5::Datatype::const_iterator"], [2, 2, 1, "_CPPv4N4cvc58Datatype14const_iterator14const_iteratorEv", "cvc5::Datatype::const_iterator::const_iterator"], [2, 4, 1, "_CPPv4N4cvc58Datatype14const_iterator15difference_typeE", "cvc5::Datatype::const_iterator::difference_type"], [2, 4, 1, "_CPPv4N4cvc58Datatype14const_iterator17iterator_categoryE", "cvc5::Datatype::const_iterator::iterator_category"], [2, 2, 1, "_CPPv4NK4cvc58Datatype14const_iteratorneERK14const_iterator", "cvc5::Datatype::const_iterator::operator!="], [2, 3, 1, "_CPPv4NK4cvc58Datatype14const_iteratorneERK14const_iterator", "cvc5::Datatype::const_iterator::operator!=::it"], [2, 2, 1, "_CPPv4NK4cvc58Datatype14const_iteratormlEv", "cvc5::Datatype::const_iterator::operator*"], [2, 2, 1, "_CPPv4N4cvc58Datatype14const_iteratorppEi", "cvc5::Datatype::const_iterator::operator++"], [2, 2, 1, "_CPPv4N4cvc58Datatype14const_iteratorppEv", "cvc5::Datatype::const_iterator::operator++"], [2, 2, 1, "_CPPv4NK4cvc58Datatype14const_iteratorptEv", "cvc5::Datatype::const_iterator::operator->"], [2, 2, 1, "_CPPv4N4cvc58Datatype14const_iteratoraSERK14const_iterator", "cvc5::Datatype::const_iterator::operator="], [2, 3, 1, "_CPPv4N4cvc58Datatype14const_iteratoraSERK14const_iterator", "cvc5::Datatype::const_iterator::operator=::it"], [2, 2, 1, "_CPPv4NK4cvc58Datatype14const_iteratoreqERK14const_iterator", "cvc5::Datatype::const_iterator::operator=="], [2, 3, 1, "_CPPv4NK4cvc58Datatype14const_iteratoreqERK14const_iterator", "cvc5::Datatype::const_iterator::operator==::it"], [2, 4, 1, "_CPPv4N4cvc58Datatype14const_iterator7pointerE", "cvc5::Datatype::const_iterator::pointer"], [2, 4, 1, "_CPPv4N4cvc58Datatype14const_iterator9referenceE", "cvc5::Datatype::const_iterator::reference"], [2, 4, 1, "_CPPv4N4cvc58Datatype14const_iterator10value_typeE", "cvc5::Datatype::const_iterator::value_type"], [2, 2, 1, "_CPPv4NK4cvc58Datatype3endEv", "cvc5::Datatype::end"], [2, 2, 1, "_CPPv4NK4cvc58Datatype14getConstructorERKNSt6stringE", "cvc5::Datatype::getConstructor"], [2, 3, 1, "_CPPv4NK4cvc58Datatype14getConstructorERKNSt6stringE", "cvc5::Datatype::getConstructor::name"], [2, 2, 1, "_CPPv4NK4cvc58Datatype7getNameEv", "cvc5::Datatype::getName"], [2, 2, 1, "_CPPv4NK4cvc58Datatype18getNumConstructorsEv", "cvc5::Datatype::getNumConstructors"], [2, 2, 1, "_CPPv4NK4cvc58Datatype13getParametersEv", "cvc5::Datatype::getParameters"], [2, 2, 1, "_CPPv4NK4cvc58Datatype11getSelectorERKNSt6stringE", "cvc5::Datatype::getSelector"], [2, 3, 1, "_CPPv4NK4cvc58Datatype11getSelectorERKNSt6stringE", "cvc5::Datatype::getSelector::name"], [2, 2, 1, "_CPPv4NK4cvc58Datatype12isCodatatypeEv", "cvc5::Datatype::isCodatatype"], [2, 2, 1, "_CPPv4NK4cvc58Datatype8isFiniteEv", "cvc5::Datatype::isFinite"], [2, 2, 1, "_CPPv4NK4cvc58Datatype6isNullEv", "cvc5::Datatype::isNull"], [2, 2, 1, "_CPPv4NK4cvc58Datatype12isParametricEv", "cvc5::Datatype::isParametric"], [2, 2, 1, "_CPPv4NK4cvc58Datatype8isRecordEv", "cvc5::Datatype::isRecord"], [2, 2, 1, "_CPPv4NK4cvc58Datatype7isTupleEv", "cvc5::Datatype::isTuple"], [2, 2, 1, "_CPPv4NK4cvc58Datatype13isWellFoundedEv", "cvc5::Datatype::isWellFounded"], [2, 2, 1, "_CPPv4NK4cvc58DatatypeixE6size_t", "cvc5::Datatype::operator[]"], [2, 2, 1, "_CPPv4NK4cvc58DatatypeixERKNSt6stringE", "cvc5::Datatype::operator[]"], [2, 3, 1, "_CPPv4NK4cvc58DatatypeixE6size_t", "cvc5::Datatype::operator[]::idx"], [2, 3, 1, "_CPPv4NK4cvc58DatatypeixERKNSt6stringE", "cvc5::Datatype::operator[]::name"], [2, 2, 1, "_CPPv4NK4cvc58Datatype8toStringEv", "cvc5::Datatype::toString"], [2, 2, 1, "_CPPv4N4cvc58DatatypeD0Ev", "cvc5::Datatype::~Datatype"], [3, 1, 1, "_CPPv4N4cvc519DatatypeConstructorE", "cvc5::DatatypeConstructor"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructor19DatatypeConstructorEv", "cvc5::DatatypeConstructor::DatatypeConstructor"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor5beginEv", "cvc5::DatatypeConstructor::begin"], [3, 1, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iteratorE", "cvc5::DatatypeConstructor::const_iterator"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator14const_iteratorEv", "cvc5::DatatypeConstructor::const_iterator::const_iterator"], [3, 4, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator15difference_typeE", "cvc5::DatatypeConstructor::const_iterator::difference_type"], [3, 4, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator17iterator_categoryE", "cvc5::DatatypeConstructor::const_iterator::iterator_category"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratorneERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator!="], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratorneERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator!=::it"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratormlEv", "cvc5::DatatypeConstructor::const_iterator::operator*"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iteratorppEi", "cvc5::DatatypeConstructor::const_iterator::operator++"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iteratorppEv", "cvc5::DatatypeConstructor::const_iterator::operator++"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratorptEv", "cvc5::DatatypeConstructor::const_iterator::operator->"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iteratoraSERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator="], [3, 3, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iteratoraSERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator=::it"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratoreqERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator=="], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructor14const_iteratoreqERK14const_iterator", "cvc5::DatatypeConstructor::const_iterator::operator==::it"], [3, 4, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator7pointerE", "cvc5::DatatypeConstructor::const_iterator::pointer"], [3, 4, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator9referenceE", "cvc5::DatatypeConstructor::const_iterator::reference"], [3, 4, 1, "_CPPv4N4cvc519DatatypeConstructor14const_iterator10value_typeE", "cvc5::DatatypeConstructor::const_iterator::value_type"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor3endEv", "cvc5::DatatypeConstructor::end"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor19getInstantiatedTermERK4Sort", "cvc5::DatatypeConstructor::getInstantiatedTerm"], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructor19getInstantiatedTermERK4Sort", "cvc5::DatatypeConstructor::getInstantiatedTerm::retSort"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor7getNameEv", "cvc5::DatatypeConstructor::getName"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor15getNumSelectorsEv", "cvc5::DatatypeConstructor::getNumSelectors"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor11getSelectorERKNSt6stringE", "cvc5::DatatypeConstructor::getSelector"], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructor11getSelectorERKNSt6stringE", "cvc5::DatatypeConstructor::getSelector::name"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor7getTermEv", "cvc5::DatatypeConstructor::getTerm"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor13getTesterTermEv", "cvc5::DatatypeConstructor::getTesterTerm"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor6isNullEv", "cvc5::DatatypeConstructor::isNull"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructorixE6size_t", "cvc5::DatatypeConstructor::operator[]"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructorixERKNSt6stringE", "cvc5::DatatypeConstructor::operator[]"], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructorixE6size_t", "cvc5::DatatypeConstructor::operator[]::index"], [3, 3, 1, "_CPPv4NK4cvc519DatatypeConstructorixERKNSt6stringE", "cvc5::DatatypeConstructor::operator[]::name"], [3, 2, 1, "_CPPv4NK4cvc519DatatypeConstructor8toStringEv", "cvc5::DatatypeConstructor::toString"], [3, 2, 1, "_CPPv4N4cvc519DatatypeConstructorD0Ev", "cvc5::DatatypeConstructor::~DatatypeConstructor"], [4, 1, 1, "_CPPv4N4cvc523DatatypeConstructorDeclE", "cvc5::DatatypeConstructorDecl"], [4, 2, 1, "_CPPv4N4cvc523DatatypeConstructorDecl23DatatypeConstructorDeclEv", "cvc5::DatatypeConstructorDecl::DatatypeConstructorDecl"], [4, 2, 1, "_CPPv4N4cvc523DatatypeConstructorDecl11addSelectorERKNSt6stringERK4Sort", "cvc5::DatatypeConstructorDecl::addSelector"], [4, 3, 1, "_CPPv4N4cvc523DatatypeConstructorDecl11addSelectorERKNSt6stringERK4Sort", "cvc5::DatatypeConstructorDecl::addSelector::name"], [4, 3, 1, "_CPPv4N4cvc523DatatypeConstructorDecl11addSelectorERKNSt6stringERK4Sort", "cvc5::DatatypeConstructorDecl::addSelector::sort"], [4, 2, 1, "_CPPv4N4cvc523DatatypeConstructorDecl15addSelectorSelfERKNSt6stringE", "cvc5::DatatypeConstructorDecl::addSelectorSelf"], [4, 3, 1, "_CPPv4N4cvc523DatatypeConstructorDecl15addSelectorSelfERKNSt6stringE", "cvc5::DatatypeConstructorDecl::addSelectorSelf::name"], [4, 2, 1, "_CPPv4N4cvc523DatatypeConstructorDecl21addSelectorUnresolvedERKNSt6stringERKNSt6stringE", "cvc5::DatatypeConstructorDecl::addSelectorUnresolved"], [4, 3, 1, "_CPPv4N4cvc523DatatypeConstructorDecl21addSelectorUnresolvedERKNSt6stringERKNSt6stringE", "cvc5::DatatypeConstructorDecl::addSelectorUnresolved::name"], [4, 3, 1, "_CPPv4N4cvc523DatatypeConstructorDecl21addSelectorUnresolvedERKNSt6stringERKNSt6stringE", "cvc5::DatatypeConstructorDecl::addSelectorUnresolved::unresDataypeName"], [4, 2, 1, "_CPPv4NK4cvc523DatatypeConstructorDecl6isNullEv", "cvc5::DatatypeConstructorDecl::isNull"], [4, 2, 1, "_CPPv4NK4cvc523DatatypeConstructorDecl8toStringEv", "cvc5::DatatypeConstructorDecl::toString"], [4, 2, 1, "_CPPv4N4cvc523DatatypeConstructorDeclD0Ev", "cvc5::DatatypeConstructorDecl::~DatatypeConstructorDecl"], [5, 1, 1, "_CPPv4N4cvc512DatatypeDeclE", "cvc5::DatatypeDecl"], [5, 2, 1, "_CPPv4N4cvc512DatatypeDecl12DatatypeDeclEv", "cvc5::DatatypeDecl::DatatypeDecl"], [5, 2, 1, "_CPPv4N4cvc512DatatypeDecl14addConstructorERK23DatatypeConstructorDecl", "cvc5::DatatypeDecl::addConstructor"], [5, 3, 1, "_CPPv4N4cvc512DatatypeDecl14addConstructorERK23DatatypeConstructorDecl", "cvc5::DatatypeDecl::addConstructor::ctor"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl7getNameEv", "cvc5::DatatypeDecl::getName"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl18getNumConstructorsEv", "cvc5::DatatypeDecl::getNumConstructors"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl6isNullEv", "cvc5::DatatypeDecl::isNull"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl12isParametricEv", "cvc5::DatatypeDecl::isParametric"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl10isResolvedEv", "cvc5::DatatypeDecl::isResolved"], [5, 2, 1, "_CPPv4NK4cvc512DatatypeDecl8toStringEv", "cvc5::DatatypeDecl::toString"], [5, 2, 1, "_CPPv4N4cvc512DatatypeDeclD0Ev", "cvc5::DatatypeDecl::~DatatypeDecl"], [6, 1, 1, "_CPPv4N4cvc516DatatypeSelectorE", "cvc5::DatatypeSelector"], [6, 2, 1, "_CPPv4N4cvc516DatatypeSelector16DatatypeSelectorEv", "cvc5::DatatypeSelector::DatatypeSelector"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector15getCodomainSortEv", "cvc5::DatatypeSelector::getCodomainSort"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector7getNameEv", "cvc5::DatatypeSelector::getName"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector7getTermEv", "cvc5::DatatypeSelector::getTerm"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector14getUpdaterTermEv", "cvc5::DatatypeSelector::getUpdaterTerm"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector6isNullEv", "cvc5::DatatypeSelector::isNull"], [6, 2, 1, "_CPPv4NK4cvc516DatatypeSelector8toStringEv", "cvc5::DatatypeSelector::toString"], [6, 2, 1, "_CPPv4N4cvc516DatatypeSelectorD0Ev", "cvc5::DatatypeSelector::~DatatypeSelector"], [7, 1, 1, "_CPPv4N4cvc513DriverOptionsE", "cvc5::DriverOptions"], [7, 2, 1, "_CPPv4NK4cvc513DriverOptions3errEv", "cvc5::DriverOptions::err"], [7, 2, 1, "_CPPv4NK4cvc513DriverOptions2inEv", "cvc5::DriverOptions::in"], [7, 2, 1, "_CPPv4NK4cvc513DriverOptions3outEv", "cvc5::DriverOptions::out"], [10, 0, 1, "_CPPv4N4cvc54Kind5EQUALE", "cvc5::EQUAL"], [10, 0, 1, "_CPPv4N4cvc54Kind8EQ_RANGEE", "cvc5::EQ_RANGE"], [10, 0, 1, "_CPPv4N4cvc54Kind6EXISTSE", "cvc5::EXISTS"], [10, 0, 1, "_CPPv4N4cvc54Kind11EXPONENTIALE", "cvc5::EXPONENTIAL"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_ABSE", "cvc5::FLOATINGPOINT_ABS"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_ADDE", "cvc5::FLOATINGPOINT_ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_DIVE", "cvc5::FLOATINGPOINT_DIV"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_EQE", "cvc5::FLOATINGPOINT_EQ"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_FMAE", "cvc5::FLOATINGPOINT_FMA"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_FPE", "cvc5::FLOATINGPOINT_FP"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_GEQE", "cvc5::FLOATINGPOINT_GEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_GTE", "cvc5::FLOATINGPOINT_GT"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_INFE", "cvc5::FLOATINGPOINT_IS_INF"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_NANE", "cvc5::FLOATINGPOINT_IS_NAN"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_NEGE", "cvc5::FLOATINGPOINT_IS_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind23FLOATINGPOINT_IS_NORMALE", "cvc5::FLOATINGPOINT_IS_NORMAL"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_POSE", "cvc5::FLOATINGPOINT_IS_POS"], [10, 0, 1, "_CPPv4N4cvc54Kind26FLOATINGPOINT_IS_SUBNORMALE", "cvc5::FLOATINGPOINT_IS_SUBNORMAL"], [10, 0, 1, "_CPPv4N4cvc54Kind21FLOATINGPOINT_IS_ZEROE", "cvc5::FLOATINGPOINT_IS_ZERO"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_LEQE", "cvc5::FLOATINGPOINT_LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_LTE", "cvc5::FLOATINGPOINT_LT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_MAXE", "cvc5::FLOATINGPOINT_MAX"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_MINE", "cvc5::FLOATINGPOINT_MIN"], [10, 0, 1, "_CPPv4N4cvc54Kind18FLOATINGPOINT_MULTE", "cvc5::FLOATINGPOINT_MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_NEGE", "cvc5::FLOATINGPOINT_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_REME", "cvc5::FLOATINGPOINT_REM"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_RTIE", "cvc5::FLOATINGPOINT_RTI"], [10, 0, 1, "_CPPv4N4cvc54Kind18FLOATINGPOINT_SQRTE", "cvc5::FLOATINGPOINT_SQRT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_SUBE", "cvc5::FLOATINGPOINT_SUB"], [10, 0, 1, "_CPPv4N4cvc54Kind27FLOATINGPOINT_TO_FP_FROM_FPE", "cvc5::FLOATINGPOINT_TO_FP_FROM_FP"], [10, 0, 1, "_CPPv4N4cvc54Kind32FLOATINGPOINT_TO_FP_FROM_IEEE_BVE", "cvc5::FLOATINGPOINT_TO_FP_FROM_IEEE_BV"], [10, 0, 1, "_CPPv4N4cvc54Kind29FLOATINGPOINT_TO_FP_FROM_REALE", "cvc5::FLOATINGPOINT_TO_FP_FROM_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind28FLOATINGPOINT_TO_FP_FROM_SBVE", "cvc5::FLOATINGPOINT_TO_FP_FROM_SBV"], [10, 0, 1, "_CPPv4N4cvc54Kind28FLOATINGPOINT_TO_FP_FROM_UBVE", "cvc5::FLOATINGPOINT_TO_FP_FROM_UBV"], [10, 0, 1, "_CPPv4N4cvc54Kind21FLOATINGPOINT_TO_REALE", "cvc5::FLOATINGPOINT_TO_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_TO_SBVE", "cvc5::FLOATINGPOINT_TO_SBV"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_TO_UBVE", "cvc5::FLOATINGPOINT_TO_UBV"], [10, 0, 1, "_CPPv4N4cvc54Kind6FORALLE", "cvc5::FORALL"], [10, 0, 1, "_CPPv4N4cvc54Kind3GEQE", "cvc5::GEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind2GTE", "cvc5::GT"], [9, 1, 1, "_CPPv4N4cvc57GrammarE", "cvc5::Grammar"], [9, 2, 1, "_CPPv4N4cvc57Grammar7GrammarEv", "cvc5::Grammar::Grammar"], [9, 2, 1, "_CPPv4N4cvc57Grammar14addAnyConstantERK4Term", "cvc5::Grammar::addAnyConstant"], [9, 3, 1, "_CPPv4N4cvc57Grammar14addAnyConstantERK4Term", "cvc5::Grammar::addAnyConstant::ntSymbol"], [9, 2, 1, "_CPPv4N4cvc57Grammar14addAnyVariableERK4Term", "cvc5::Grammar::addAnyVariable"], [9, 3, 1, "_CPPv4N4cvc57Grammar14addAnyVariableERK4Term", "cvc5::Grammar::addAnyVariable::ntSymbol"], [9, 2, 1, "_CPPv4N4cvc57Grammar7addRuleERK4TermRK4Term", "cvc5::Grammar::addRule"], [9, 3, 1, "_CPPv4N4cvc57Grammar7addRuleERK4TermRK4Term", "cvc5::Grammar::addRule::ntSymbol"], [9, 3, 1, "_CPPv4N4cvc57Grammar7addRuleERK4TermRK4Term", "cvc5::Grammar::addRule::rule"], [9, 2, 1, "_CPPv4N4cvc57Grammar8addRulesERK4TermRKNSt6vectorI4TermEE", "cvc5::Grammar::addRules"], [9, 3, 1, "_CPPv4N4cvc57Grammar8addRulesERK4TermRKNSt6vectorI4TermEE", "cvc5::Grammar::addRules::ntSymbol"], [9, 3, 1, "_CPPv4N4cvc57Grammar8addRulesERK4TermRKNSt6vectorI4TermEE", "cvc5::Grammar::addRules::rules"], [9, 2, 1, "_CPPv4NK4cvc57Grammar8toStringEv", "cvc5::Grammar::toString"], [10, 0, 1, "_CPPv4N4cvc54Kind8HO_APPLYE", "cvc5::HO_APPLY"], [10, 0, 1, "_CPPv4N4cvc54Kind4IANDE", "cvc5::IAND"], [10, 0, 1, "_CPPv4N4cvc54Kind7IMPLIESE", "cvc5::IMPLIES"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation10INCOMPLETEE", "cvc5::INCOMPLETE"], [10, 0, 1, "_CPPv4N4cvc54Kind16INST_ADD_TO_POOLE", "cvc5::INST_ADD_TO_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind14INST_ATTRIBUTEE", "cvc5::INST_ATTRIBUTE"], [10, 0, 1, "_CPPv4N4cvc54Kind15INST_NO_PATTERNE", "cvc5::INST_NO_PATTERN"], [10, 0, 1, "_CPPv4N4cvc54Kind12INST_PATTERNE", "cvc5::INST_PATTERN"], [10, 0, 1, "_CPPv4N4cvc54Kind17INST_PATTERN_LISTE", "cvc5::INST_PATTERN_LIST"], [10, 0, 1, "_CPPv4N4cvc54Kind9INST_POOLE", "cvc5::INST_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind13INTERNAL_KINDE", "cvc5::INTERNAL_KIND"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11INTERRUPTEDE", "cvc5::INTERRUPTED"], [10, 0, 1, "_CPPv4N4cvc54Kind13INTS_DIVISIONE", "cvc5::INTS_DIVISION"], [10, 0, 1, "_CPPv4N4cvc54Kind12INTS_MODULUSE", "cvc5::INTS_MODULUS"], [10, 0, 1, "_CPPv4N4cvc54Kind16INT_TO_BITVECTORE", "cvc5::INT_TO_BITVECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind10IS_INTEGERE", "cvc5::IS_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind3ITEE", "cvc5::ITE"], [10, 5, 1, "_CPPv4N4cvc54KindE", "cvc5::Kind"], [10, 0, 1, "_CPPv4N4cvc54Kind3ABSE", "cvc5::Kind::ABS"], [10, 0, 1, "_CPPv4N4cvc54Kind3ADDE", "cvc5::Kind::ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind3ANDE", "cvc5::Kind::AND"], [10, 0, 1, "_CPPv4N4cvc54Kind17APPLY_CONSTRUCTORE", "cvc5::Kind::APPLY_CONSTRUCTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind14APPLY_SELECTORE", "cvc5::Kind::APPLY_SELECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind12APPLY_TESTERE", "cvc5::Kind::APPLY_TESTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8APPLY_UFE", "cvc5::Kind::APPLY_UF"], [10, 0, 1, "_CPPv4N4cvc54Kind13APPLY_UPDATERE", "cvc5::Kind::APPLY_UPDATER"], [10, 0, 1, "_CPPv4N4cvc54Kind11ARCCOSECANTE", "cvc5::Kind::ARCCOSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind9ARCCOSINEE", "cvc5::Kind::ARCCOSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind12ARCCOTANGENTE", "cvc5::Kind::ARCCOTANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind9ARCSECANTE", "cvc5::Kind::ARCSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind7ARCSINEE", "cvc5::Kind::ARCSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind10ARCTANGENTE", "cvc5::Kind::ARCTANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_CARDE", "cvc5::Kind::BAG_CARD"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_CHOOSEE", "cvc5::Kind::BAG_CHOOSE"], [10, 0, 1, "_CPPv4N4cvc54Kind9BAG_COUNTE", "cvc5::Kind::BAG_COUNT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BAG_DIFFERENCE_REMOVEE", "cvc5::Kind::BAG_DIFFERENCE_REMOVE"], [10, 0, 1, "_CPPv4N4cvc54Kind23BAG_DIFFERENCE_SUBTRACTE", "cvc5::Kind::BAG_DIFFERENCE_SUBTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BAG_DUPLICATE_REMOVALE", "cvc5::Kind::BAG_DUPLICATE_REMOVAL"], [10, 0, 1, "_CPPv4N4cvc54Kind9BAG_EMPTYE", "cvc5::Kind::BAG_EMPTY"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_FILTERE", "cvc5::Kind::BAG_FILTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_FOLDE", "cvc5::Kind::BAG_FOLD"], [10, 0, 1, "_CPPv4N4cvc54Kind12BAG_FROM_SETE", "cvc5::Kind::BAG_FROM_SET"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_INTER_MINE", "cvc5::Kind::BAG_INTER_MIN"], [10, 0, 1, "_CPPv4N4cvc54Kind16BAG_IS_SINGLETONE", "cvc5::Kind::BAG_IS_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind8BAG_MAKEE", "cvc5::Kind::BAG_MAKE"], [10, 0, 1, "_CPPv4N4cvc54Kind7BAG_MAPE", "cvc5::Kind::BAG_MAP"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_MEMBERE", "cvc5::Kind::BAG_MEMBER"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_PARTITIONE", "cvc5::Kind::BAG_PARTITION"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_SUBBAGE", "cvc5::Kind::BAG_SUBBAG"], [10, 0, 1, "_CPPv4N4cvc54Kind10BAG_TO_SETE", "cvc5::Kind::BAG_TO_SET"], [10, 0, 1, "_CPPv4N4cvc54Kind18BAG_UNION_DISJOINTE", "cvc5::Kind::BAG_UNION_DISJOINT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BAG_UNION_MAXE", "cvc5::Kind::BAG_UNION_MAX"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ADDE", "cvc5::Kind::BITVECTOR_ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ANDE", "cvc5::Kind::BITVECTOR_AND"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_ASHRE", "cvc5::Kind::BITVECTOR_ASHR"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_COMPE", "cvc5::Kind::BITVECTOR_COMP"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_CONCATE", "cvc5::Kind::BITVECTOR_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind17BITVECTOR_EXTRACTE", "cvc5::Kind::BITVECTOR_EXTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ITEE", "cvc5::Kind::BITVECTOR_ITE"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_LSHRE", "cvc5::Kind::BITVECTOR_LSHR"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_MULTE", "cvc5::Kind::BITVECTOR_MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_NANDE", "cvc5::Kind::BITVECTOR_NAND"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NEGE", "cvc5::Kind::BITVECTOR_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NORE", "cvc5::Kind::BITVECTOR_NOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_NOTE", "cvc5::Kind::BITVECTOR_NOT"], [10, 0, 1, "_CPPv4N4cvc54Kind12BITVECTOR_ORE", "cvc5::Kind::BITVECTOR_OR"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_REDANDE", "cvc5::Kind::BITVECTOR_REDAND"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_REDORE", "cvc5::Kind::BITVECTOR_REDOR"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_REPEATE", "cvc5::Kind::BITVECTOR_REPEAT"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_ROTATE_LEFTE", "cvc5::Kind::BITVECTOR_ROTATE_LEFT"], [10, 0, 1, "_CPPv4N4cvc54Kind22BITVECTOR_ROTATE_RIGHTE", "cvc5::Kind::BITVECTOR_ROTATE_RIGHT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SDIVE", "cvc5::Kind::BITVECTOR_SDIV"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SGEE", "cvc5::Kind::BITVECTOR_SGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SGTE", "cvc5::Kind::BITVECTOR_SGT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SHLE", "cvc5::Kind::BITVECTOR_SHL"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_SIGN_EXTENDE", "cvc5::Kind::BITVECTOR_SIGN_EXTEND"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SLEE", "cvc5::Kind::BITVECTOR_SLE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SLTE", "cvc5::Kind::BITVECTOR_SLT"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_SLTBVE", "cvc5::Kind::BITVECTOR_SLTBV"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SMODE", "cvc5::Kind::BITVECTOR_SMOD"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_SREME", "cvc5::Kind::BITVECTOR_SREM"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_SUBE", "cvc5::Kind::BITVECTOR_SUB"], [10, 0, 1, "_CPPv4N4cvc54Kind16BITVECTOR_TO_NATE", "cvc5::Kind::BITVECTOR_TO_NAT"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_UDIVE", "cvc5::Kind::BITVECTOR_UDIV"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_UGEE", "cvc5::Kind::BITVECTOR_UGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_UGTE", "cvc5::Kind::BITVECTOR_UGT"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ULEE", "cvc5::Kind::BITVECTOR_ULE"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_ULTE", "cvc5::Kind::BITVECTOR_ULT"], [10, 0, 1, "_CPPv4N4cvc54Kind15BITVECTOR_ULTBVE", "cvc5::Kind::BITVECTOR_ULTBV"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_UREME", "cvc5::Kind::BITVECTOR_UREM"], [10, 0, 1, "_CPPv4N4cvc54Kind14BITVECTOR_XNORE", "cvc5::Kind::BITVECTOR_XNOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13BITVECTOR_XORE", "cvc5::Kind::BITVECTOR_XOR"], [10, 0, 1, "_CPPv4N4cvc54Kind21BITVECTOR_ZERO_EXTENDE", "cvc5::Kind::BITVECTOR_ZERO_EXTEND"], [10, 0, 1, "_CPPv4N4cvc54Kind22CARDINALITY_CONSTRAINTE", "cvc5::Kind::CARDINALITY_CONSTRAINT"], [10, 0, 1, "_CPPv4N4cvc54Kind8CONSTANTE", "cvc5::Kind::CONSTANT"], [10, 0, 1, "_CPPv4N4cvc54Kind11CONST_ARRAYE", "cvc5::Kind::CONST_ARRAY"], [10, 0, 1, "_CPPv4N4cvc54Kind15CONST_BITVECTORE", "cvc5::Kind::CONST_BITVECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind13CONST_BOOLEANE", "cvc5::Kind::CONST_BOOLEAN"], [10, 0, 1, "_CPPv4N4cvc54Kind19CONST_FLOATINGPOINTE", "cvc5::Kind::CONST_FLOATINGPOINT"], [10, 0, 1, "_CPPv4N4cvc54Kind13CONST_INTEGERE", "cvc5::Kind::CONST_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind14CONST_RATIONALE", "cvc5::Kind::CONST_RATIONAL"], [10, 0, 1, "_CPPv4N4cvc54Kind18CONST_ROUNDINGMODEE", "cvc5::Kind::CONST_ROUNDINGMODE"], [10, 0, 1, "_CPPv4N4cvc54Kind14CONST_SEQUENCEE", "cvc5::Kind::CONST_SEQUENCE"], [10, 0, 1, "_CPPv4N4cvc54Kind12CONST_STRINGE", "cvc5::Kind::CONST_STRING"], [10, 0, 1, "_CPPv4N4cvc54Kind8COSECANTE", "cvc5::Kind::COSECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind6COSINEE", "cvc5::Kind::COSINE"], [10, 0, 1, "_CPPv4N4cvc54Kind9COTANGENTE", "cvc5::Kind::COTANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind8DISTINCTE", "cvc5::Kind::DISTINCT"], [10, 0, 1, "_CPPv4N4cvc54Kind9DIVISIBLEE", "cvc5::Kind::DIVISIBLE"], [10, 0, 1, "_CPPv4N4cvc54Kind8DIVISIONE", "cvc5::Kind::DIVISION"], [10, 0, 1, "_CPPv4N4cvc54Kind5EQUALE", "cvc5::Kind::EQUAL"], [10, 0, 1, "_CPPv4N4cvc54Kind8EQ_RANGEE", "cvc5::Kind::EQ_RANGE"], [10, 0, 1, "_CPPv4N4cvc54Kind6EXISTSE", "cvc5::Kind::EXISTS"], [10, 0, 1, "_CPPv4N4cvc54Kind11EXPONENTIALE", "cvc5::Kind::EXPONENTIAL"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_ABSE", "cvc5::Kind::FLOATINGPOINT_ABS"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_ADDE", "cvc5::Kind::FLOATINGPOINT_ADD"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_DIVE", "cvc5::Kind::FLOATINGPOINT_DIV"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_EQE", "cvc5::Kind::FLOATINGPOINT_EQ"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_FMAE", "cvc5::Kind::FLOATINGPOINT_FMA"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_FPE", "cvc5::Kind::FLOATINGPOINT_FP"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_GEQE", "cvc5::Kind::FLOATINGPOINT_GEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_GTE", "cvc5::Kind::FLOATINGPOINT_GT"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_INFE", "cvc5::Kind::FLOATINGPOINT_IS_INF"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_NANE", "cvc5::Kind::FLOATINGPOINT_IS_NAN"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_NEGE", "cvc5::Kind::FLOATINGPOINT_IS_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind23FLOATINGPOINT_IS_NORMALE", "cvc5::Kind::FLOATINGPOINT_IS_NORMAL"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_IS_POSE", "cvc5::Kind::FLOATINGPOINT_IS_POS"], [10, 0, 1, "_CPPv4N4cvc54Kind26FLOATINGPOINT_IS_SUBNORMALE", "cvc5::Kind::FLOATINGPOINT_IS_SUBNORMAL"], [10, 0, 1, "_CPPv4N4cvc54Kind21FLOATINGPOINT_IS_ZEROE", "cvc5::Kind::FLOATINGPOINT_IS_ZERO"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_LEQE", "cvc5::Kind::FLOATINGPOINT_LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind16FLOATINGPOINT_LTE", "cvc5::Kind::FLOATINGPOINT_LT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_MAXE", "cvc5::Kind::FLOATINGPOINT_MAX"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_MINE", "cvc5::Kind::FLOATINGPOINT_MIN"], [10, 0, 1, "_CPPv4N4cvc54Kind18FLOATINGPOINT_MULTE", "cvc5::Kind::FLOATINGPOINT_MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_NEGE", "cvc5::Kind::FLOATINGPOINT_NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_REME", "cvc5::Kind::FLOATINGPOINT_REM"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_RTIE", "cvc5::Kind::FLOATINGPOINT_RTI"], [10, 0, 1, "_CPPv4N4cvc54Kind18FLOATINGPOINT_SQRTE", "cvc5::Kind::FLOATINGPOINT_SQRT"], [10, 0, 1, "_CPPv4N4cvc54Kind17FLOATINGPOINT_SUBE", "cvc5::Kind::FLOATINGPOINT_SUB"], [10, 0, 1, "_CPPv4N4cvc54Kind27FLOATINGPOINT_TO_FP_FROM_FPE", "cvc5::Kind::FLOATINGPOINT_TO_FP_FROM_FP"], [10, 0, 1, "_CPPv4N4cvc54Kind32FLOATINGPOINT_TO_FP_FROM_IEEE_BVE", "cvc5::Kind::FLOATINGPOINT_TO_FP_FROM_IEEE_BV"], [10, 0, 1, "_CPPv4N4cvc54Kind29FLOATINGPOINT_TO_FP_FROM_REALE", "cvc5::Kind::FLOATINGPOINT_TO_FP_FROM_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind28FLOATINGPOINT_TO_FP_FROM_SBVE", "cvc5::Kind::FLOATINGPOINT_TO_FP_FROM_SBV"], [10, 0, 1, "_CPPv4N4cvc54Kind28FLOATINGPOINT_TO_FP_FROM_UBVE", "cvc5::Kind::FLOATINGPOINT_TO_FP_FROM_UBV"], [10, 0, 1, "_CPPv4N4cvc54Kind21FLOATINGPOINT_TO_REALE", "cvc5::Kind::FLOATINGPOINT_TO_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_TO_SBVE", "cvc5::Kind::FLOATINGPOINT_TO_SBV"], [10, 0, 1, "_CPPv4N4cvc54Kind20FLOATINGPOINT_TO_UBVE", "cvc5::Kind::FLOATINGPOINT_TO_UBV"], [10, 0, 1, "_CPPv4N4cvc54Kind6FORALLE", "cvc5::Kind::FORALL"], [10, 0, 1, "_CPPv4N4cvc54Kind3GEQE", "cvc5::Kind::GEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind2GTE", "cvc5::Kind::GT"], [10, 0, 1, "_CPPv4N4cvc54Kind8HO_APPLYE", "cvc5::Kind::HO_APPLY"], [10, 0, 1, "_CPPv4N4cvc54Kind4IANDE", "cvc5::Kind::IAND"], [10, 0, 1, "_CPPv4N4cvc54Kind7IMPLIESE", "cvc5::Kind::IMPLIES"], [10, 0, 1, "_CPPv4N4cvc54Kind16INST_ADD_TO_POOLE", "cvc5::Kind::INST_ADD_TO_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind14INST_ATTRIBUTEE", "cvc5::Kind::INST_ATTRIBUTE"], [10, 0, 1, "_CPPv4N4cvc54Kind15INST_NO_PATTERNE", "cvc5::Kind::INST_NO_PATTERN"], [10, 0, 1, "_CPPv4N4cvc54Kind12INST_PATTERNE", "cvc5::Kind::INST_PATTERN"], [10, 0, 1, "_CPPv4N4cvc54Kind17INST_PATTERN_LISTE", "cvc5::Kind::INST_PATTERN_LIST"], [10, 0, 1, "_CPPv4N4cvc54Kind9INST_POOLE", "cvc5::Kind::INST_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind13INTERNAL_KINDE", "cvc5::Kind::INTERNAL_KIND"], [10, 0, 1, "_CPPv4N4cvc54Kind13INTS_DIVISIONE", "cvc5::Kind::INTS_DIVISION"], [10, 0, 1, "_CPPv4N4cvc54Kind12INTS_MODULUSE", "cvc5::Kind::INTS_MODULUS"], [10, 0, 1, "_CPPv4N4cvc54Kind16INT_TO_BITVECTORE", "cvc5::Kind::INT_TO_BITVECTOR"], [10, 0, 1, "_CPPv4N4cvc54Kind10IS_INTEGERE", "cvc5::Kind::IS_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind3ITEE", "cvc5::Kind::ITE"], [10, 0, 1, "_CPPv4N4cvc54Kind6LAMBDAE", "cvc5::Kind::LAMBDA"], [10, 0, 1, "_CPPv4N4cvc54Kind9LAST_KINDE", "cvc5::Kind::LAST_KIND"], [10, 0, 1, "_CPPv4N4cvc54Kind3LEQE", "cvc5::Kind::LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind2LTE", "cvc5::Kind::LT"], [10, 0, 1, "_CPPv4N4cvc54Kind5MATCHE", "cvc5::Kind::MATCH"], [10, 0, 1, "_CPPv4N4cvc54Kind15MATCH_BIND_CASEE", "cvc5::Kind::MATCH_BIND_CASE"], [10, 0, 1, "_CPPv4N4cvc54Kind10MATCH_CASEE", "cvc5::Kind::MATCH_CASE"], [10, 0, 1, "_CPPv4N4cvc54Kind4MULTE", "cvc5::Kind::MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind3NEGE", "cvc5::Kind::NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind3NOTE", "cvc5::Kind::NOT"], [10, 0, 1, "_CPPv4N4cvc54Kind9NULL_TERME", "cvc5::Kind::NULL_TERM"], [10, 0, 1, "_CPPv4N4cvc54Kind2ORE", "cvc5::Kind::OR"], [10, 0, 1, "_CPPv4N4cvc54Kind2PIE", "cvc5::Kind::PI"], [10, 0, 1, "_CPPv4N4cvc54Kind3POWE", "cvc5::Kind::POW"], [10, 0, 1, "_CPPv4N4cvc54Kind4POW2E", "cvc5::Kind::POW2"], [10, 0, 1, "_CPPv4N4cvc54Kind10REGEXP_ALLE", "cvc5::Kind::REGEXP_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind14REGEXP_ALLCHARE", "cvc5::Kind::REGEXP_ALLCHAR"], [10, 0, 1, "_CPPv4N4cvc54Kind17REGEXP_COMPLEMENTE", "cvc5::Kind::REGEXP_COMPLEMENT"], [10, 0, 1, "_CPPv4N4cvc54Kind13REGEXP_CONCATE", "cvc5::Kind::REGEXP_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_DIFFE", "cvc5::Kind::REGEXP_DIFF"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_INTERE", "cvc5::Kind::REGEXP_INTER"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_LOOPE", "cvc5::Kind::REGEXP_LOOP"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_NONEE", "cvc5::Kind::REGEXP_NONE"], [10, 0, 1, "_CPPv4N4cvc54Kind10REGEXP_OPTE", "cvc5::Kind::REGEXP_OPT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_PLUSE", "cvc5::Kind::REGEXP_PLUS"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_RANGEE", "cvc5::Kind::REGEXP_RANGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13REGEXP_REPEATE", "cvc5::Kind::REGEXP_REPEAT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_STARE", "cvc5::Kind::REGEXP_STAR"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_UNIONE", "cvc5::Kind::REGEXP_UNION"], [10, 0, 1, "_CPPv4N4cvc54Kind18RELATION_AGGREGATEE", "cvc5::Kind::RELATION_AGGREGATE"], [10, 0, 1, "_CPPv4N4cvc54Kind14RELATION_GROUPE", "cvc5::Kind::RELATION_GROUP"], [10, 0, 1, "_CPPv4N4cvc54Kind13RELATION_IDENE", "cvc5::Kind::RELATION_IDEN"], [10, 0, 1, "_CPPv4N4cvc54Kind13RELATION_JOINE", "cvc5::Kind::RELATION_JOIN"], [10, 0, 1, "_CPPv4N4cvc54Kind19RELATION_JOIN_IMAGEE", "cvc5::Kind::RELATION_JOIN_IMAGE"], [10, 0, 1, "_CPPv4N4cvc54Kind16RELATION_PRODUCTE", "cvc5::Kind::RELATION_PRODUCT"], [10, 0, 1, "_CPPv4N4cvc54Kind16RELATION_PROJECTE", "cvc5::Kind::RELATION_PROJECT"], [10, 0, 1, "_CPPv4N4cvc54Kind17RELATION_TCLOSUREE", "cvc5::Kind::RELATION_TCLOSURE"], [10, 0, 1, "_CPPv4N4cvc54Kind18RELATION_TRANSPOSEE", "cvc5::Kind::RELATION_TRANSPOSE"], [10, 0, 1, "_CPPv4N4cvc54Kind6SECANTE", "cvc5::Kind::SECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind6SELECTE", "cvc5::Kind::SELECT"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_EMPE", "cvc5::Kind::SEP_EMP"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_NILE", "cvc5::Kind::SEP_NIL"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_PTOE", "cvc5::Kind::SEP_PTO"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEP_STARE", "cvc5::Kind::SEP_STAR"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEP_WANDE", "cvc5::Kind::SEP_WAND"], [10, 0, 1, "_CPPv4N4cvc54Kind6SEQ_ATE", "cvc5::Kind::SEQ_AT"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_CONCATE", "cvc5::Kind::SEQ_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind12SEQ_CONTAINSE", "cvc5::Kind::SEQ_CONTAINS"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_EXTRACTE", "cvc5::Kind::SEQ_EXTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_INDEXOFE", "cvc5::Kind::SEQ_INDEXOF"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_LENGTHE", "cvc5::Kind::SEQ_LENGTH"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEQ_NTHE", "cvc5::Kind::SEQ_NTH"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_PREFIXE", "cvc5::Kind::SEQ_PREFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_REPLACEE", "cvc5::Kind::SEQ_REPLACE"], [10, 0, 1, "_CPPv4N4cvc54Kind15SEQ_REPLACE_ALLE", "cvc5::Kind::SEQ_REPLACE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEQ_REVE", "cvc5::Kind::SEQ_REV"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_SUFFIXE", "cvc5::Kind::SEQ_SUFFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEQ_UNITE", "cvc5::Kind::SEQ_UNIT"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_UPDATEE", "cvc5::Kind::SEQ_UPDATE"], [10, 0, 1, "_CPPv4N4cvc54Kind8SET_CARDE", "cvc5::Kind::SET_CARD"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_CHOOSEE", "cvc5::Kind::SET_CHOOSE"], [10, 0, 1, "_CPPv4N4cvc54Kind14SET_COMPLEMENTE", "cvc5::Kind::SET_COMPLEMENT"], [10, 0, 1, "_CPPv4N4cvc54Kind17SET_COMPREHENSIONE", "cvc5::Kind::SET_COMPREHENSION"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_EMPTYE", "cvc5::Kind::SET_EMPTY"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_FILTERE", "cvc5::Kind::SET_FILTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8SET_FOLDE", "cvc5::Kind::SET_FOLD"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_INSERTE", "cvc5::Kind::SET_INSERT"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_INTERE", "cvc5::Kind::SET_INTER"], [10, 0, 1, "_CPPv4N4cvc54Kind16SET_IS_SINGLETONE", "cvc5::Kind::SET_IS_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind7SET_MAPE", "cvc5::Kind::SET_MAP"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_MEMBERE", "cvc5::Kind::SET_MEMBER"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_MINUSE", "cvc5::Kind::SET_MINUS"], [10, 0, 1, "_CPPv4N4cvc54Kind13SET_SINGLETONE", "cvc5::Kind::SET_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_SUBSETE", "cvc5::Kind::SET_SUBSET"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_UNIONE", "cvc5::Kind::SET_UNION"], [10, 0, 1, "_CPPv4N4cvc54Kind12SET_UNIVERSEE", "cvc5::Kind::SET_UNIVERSE"], [10, 0, 1, "_CPPv4N4cvc54Kind5SEXPRE", "cvc5::Kind::SEXPR"], [10, 0, 1, "_CPPv4N4cvc54Kind4SINEE", "cvc5::Kind::SINE"], [10, 0, 1, "_CPPv4N4cvc54Kind18SKOLEM_ADD_TO_POOLE", "cvc5::Kind::SKOLEM_ADD_TO_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind4SQRTE", "cvc5::Kind::SQRT"], [10, 0, 1, "_CPPv4N4cvc54Kind5STOREE", "cvc5::Kind::STORE"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_CHARATE", "cvc5::Kind::STRING_CHARAT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_CONCATE", "cvc5::Kind::STRING_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_CONTAINSE", "cvc5::Kind::STRING_CONTAINS"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_FROM_CODEE", "cvc5::Kind::STRING_FROM_CODE"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_FROM_INTE", "cvc5::Kind::STRING_FROM_INT"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_INDEXOFE", "cvc5::Kind::STRING_INDEXOF"], [10, 0, 1, "_CPPv4N4cvc54Kind17STRING_INDEXOF_REE", "cvc5::Kind::STRING_INDEXOF_RE"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_IN_REGEXPE", "cvc5::Kind::STRING_IN_REGEXP"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_IS_DIGITE", "cvc5::Kind::STRING_IS_DIGIT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_LENGTHE", "cvc5::Kind::STRING_LENGTH"], [10, 0, 1, "_CPPv4N4cvc54Kind10STRING_LEQE", "cvc5::Kind::STRING_LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind9STRING_LTE", "cvc5::Kind::STRING_LT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_PREFIXE", "cvc5::Kind::STRING_PREFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_REPLACEE", "cvc5::Kind::STRING_REPLACE"], [10, 0, 1, "_CPPv4N4cvc54Kind18STRING_REPLACE_ALLE", "cvc5::Kind::STRING_REPLACE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind17STRING_REPLACE_REE", "cvc5::Kind::STRING_REPLACE_RE"], [10, 0, 1, "_CPPv4N4cvc54Kind21STRING_REPLACE_RE_ALLE", "cvc5::Kind::STRING_REPLACE_RE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind10STRING_REVE", "cvc5::Kind::STRING_REV"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_SUBSTRE", "cvc5::Kind::STRING_SUBSTR"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_SUFFIXE", "cvc5::Kind::STRING_SUFFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_TO_CODEE", "cvc5::Kind::STRING_TO_CODE"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_TO_INTE", "cvc5::Kind::STRING_TO_INT"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_TO_LOWERE", "cvc5::Kind::STRING_TO_LOWER"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_TO_REGEXPE", "cvc5::Kind::STRING_TO_REGEXP"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_TO_UPPERE", "cvc5::Kind::STRING_TO_UPPER"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_UPDATEE", "cvc5::Kind::STRING_UPDATE"], [10, 0, 1, "_CPPv4N4cvc54Kind3SUBE", "cvc5::Kind::SUB"], [10, 0, 1, "_CPPv4N4cvc54Kind15TABLE_AGGREGATEE", "cvc5::Kind::TABLE_AGGREGATE"], [10, 0, 1, "_CPPv4N4cvc54Kind11TABLE_GROUPE", "cvc5::Kind::TABLE_GROUP"], [10, 0, 1, "_CPPv4N4cvc54Kind10TABLE_JOINE", "cvc5::Kind::TABLE_JOIN"], [10, 0, 1, "_CPPv4N4cvc54Kind13TABLE_PRODUCTE", "cvc5::Kind::TABLE_PRODUCT"], [10, 0, 1, "_CPPv4N4cvc54Kind13TABLE_PROJECTE", "cvc5::Kind::TABLE_PROJECT"], [10, 0, 1, "_CPPv4N4cvc54Kind7TANGENTE", "cvc5::Kind::TANGENT"], [10, 0, 1, "_CPPv4N4cvc54Kind10TO_INTEGERE", "cvc5::Kind::TO_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind7TO_REALE", "cvc5::Kind::TO_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind13TUPLE_PROJECTE", "cvc5::Kind::TUPLE_PROJECT"], [10, 0, 1, "_CPPv4N4cvc54Kind14UNDEFINED_KINDE", "cvc5::Kind::UNDEFINED_KIND"], [10, 0, 1, "_CPPv4N4cvc54Kind24UNINTERPRETED_SORT_VALUEE", "cvc5::Kind::UNINTERPRETED_SORT_VALUE"], [10, 0, 1, "_CPPv4N4cvc54Kind8VARIABLEE", "cvc5::Kind::VARIABLE"], [10, 0, 1, "_CPPv4N4cvc54Kind13VARIABLE_LISTE", "cvc5::Kind::VARIABLE_LIST"], [10, 0, 1, "_CPPv4N4cvc54Kind7WITNESSE", "cvc5::Kind::WITNESS"], [10, 0, 1, "_CPPv4N4cvc54Kind3XORE", "cvc5::Kind::XOR"], [10, 0, 1, "_CPPv4N4cvc54Kind6LAMBDAE", "cvc5::LAMBDA"], [10, 0, 1, "_CPPv4N4cvc54Kind9LAST_KINDE", "cvc5::LAST_KIND"], [10, 0, 1, "_CPPv4N4cvc54Kind3LEQE", "cvc5::LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind2LTE", "cvc5::LT"], [10, 0, 1, "_CPPv4N4cvc54Kind5MATCHE", "cvc5::MATCH"], [10, 0, 1, "_CPPv4N4cvc54Kind15MATCH_BIND_CASEE", "cvc5::MATCH_BIND_CASE"], [10, 0, 1, "_CPPv4N4cvc54Kind10MATCH_CASEE", "cvc5::MATCH_CASE"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation6MEMOUTE", "cvc5::MEMOUT"], [10, 0, 1, "_CPPv4N4cvc54Kind4MULTE", "cvc5::MULT"], [10, 0, 1, "_CPPv4N4cvc54Kind3NEGE", "cvc5::NEG"], [10, 0, 1, "_CPPv4N4cvc54Kind3NOTE", "cvc5::NOT"], [10, 0, 1, "_CPPv4N4cvc54Kind9NULL_TERME", "cvc5::NULL_TERM"], [10, 0, 1, "_CPPv4N4cvc54Kind2ORE", "cvc5::OR"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation5OTHERE", "cvc5::OTHER"], [12, 1, 1, "_CPPv4N4cvc52OpE", "cvc5::Op"], [12, 2, 1, "_CPPv4N4cvc52Op2OpEv", "cvc5::Op::Op"], [12, 2, 1, "_CPPv4NK4cvc52Op7getKindEv", "cvc5::Op::getKind"], [12, 2, 1, "_CPPv4NK4cvc52Op13getNumIndicesEv", "cvc5::Op::getNumIndices"], [12, 2, 1, "_CPPv4NK4cvc52Op9isIndexedEv", "cvc5::Op::isIndexed"], [12, 2, 1, "_CPPv4NK4cvc52Op6isNullEv", "cvc5::Op::isNull"], [12, 2, 1, "_CPPv4NK4cvc52OpneERK2Op", "cvc5::Op::operator!="], [12, 3, 1, "_CPPv4NK4cvc52OpneERK2Op", "cvc5::Op::operator!=::t"], [12, 2, 1, "_CPPv4NK4cvc52OpeqERK2Op", "cvc5::Op::operator=="], [12, 3, 1, "_CPPv4NK4cvc52OpeqERK2Op", "cvc5::Op::operator==::t"], [12, 2, 1, "_CPPv4NK4cvc52OpixE6size_t", "cvc5::Op::operator[]"], [12, 3, 1, "_CPPv4NK4cvc52OpixE6size_t", "cvc5::Op::operator[]::i"], [12, 2, 1, "_CPPv4NK4cvc52Op8toStringEv", "cvc5::Op::toString"], [12, 2, 1, "_CPPv4N4cvc52OpD0Ev", "cvc5::Op::~Op"], [13, 1, 1, "_CPPv4N4cvc510OptionInfoE", "cvc5::OptionInfo"], [13, 1, 1, "_CPPv4N4cvc510OptionInfo8ModeInfoE", "cvc5::OptionInfo::ModeInfo"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo8ModeInfo12currentValueE", "cvc5::OptionInfo::ModeInfo::currentValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo8ModeInfo12defaultValueE", "cvc5::OptionInfo::ModeInfo::defaultValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo8ModeInfo5modesE", "cvc5::OptionInfo::ModeInfo::modes"], [13, 1, 1, "_CPPv4I0EN4cvc510OptionInfo10NumberInfoE", "cvc5::OptionInfo::NumberInfo"], [13, 7, 1, "_CPPv4I0EN4cvc510OptionInfo10NumberInfoE", "cvc5::OptionInfo::NumberInfo::T"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo10NumberInfo12currentValueE", "cvc5::OptionInfo::NumberInfo::currentValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo10NumberInfo12defaultValueE", "cvc5::OptionInfo::NumberInfo::defaultValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo10NumberInfo7maximumE", "cvc5::OptionInfo::NumberInfo::maximum"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo10NumberInfo7minimumE", "cvc5::OptionInfo::NumberInfo::minimum"], [13, 4, 1, "_CPPv4N4cvc510OptionInfo17OptionInfoVariantE", "cvc5::OptionInfo::OptionInfoVariant"], [13, 1, 1, "_CPPv4I0EN4cvc510OptionInfo9ValueInfoE", "cvc5::OptionInfo::ValueInfo"], [13, 7, 1, "_CPPv4I0EN4cvc510OptionInfo9ValueInfoE", "cvc5::OptionInfo::ValueInfo::T"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo9ValueInfo12currentValueE", "cvc5::OptionInfo::ValueInfo::currentValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo9ValueInfo12defaultValueE", "cvc5::OptionInfo::ValueInfo::defaultValue"], [13, 1, 1, "_CPPv4N4cvc510OptionInfo8VoidInfoE", "cvc5::OptionInfo::VoidInfo"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo7aliasesE", "cvc5::OptionInfo::aliases"], [13, 2, 1, "_CPPv4NK4cvc510OptionInfo9boolValueEv", "cvc5::OptionInfo::boolValue"], [13, 2, 1, "_CPPv4NK4cvc510OptionInfo11doubleValueEv", "cvc5::OptionInfo::doubleValue"], [13, 2, 1, "_CPPv4NK4cvc510OptionInfo8intValueEv", "cvc5::OptionInfo::intValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo4nameE", "cvc5::OptionInfo::name"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo9setByUserE", "cvc5::OptionInfo::setByUser"], [13, 2, 1, "_CPPv4NK4cvc510OptionInfo11stringValueEv", "cvc5::OptionInfo::stringValue"], [13, 2, 1, "_CPPv4NK4cvc510OptionInfo9uintValueEv", "cvc5::OptionInfo::uintValue"], [13, 6, 1, "_CPPv4N4cvc510OptionInfo9valueInfoE", "cvc5::OptionInfo::valueInfo"], [10, 0, 1, "_CPPv4N4cvc54Kind2PIE", "cvc5::PI"], [10, 0, 1, "_CPPv4N4cvc54Kind3POWE", "cvc5::POW"], [10, 0, 1, "_CPPv4N4cvc54Kind4POW2E", "cvc5::POW2"], [10, 0, 1, "_CPPv4N4cvc54Kind10REGEXP_ALLE", "cvc5::REGEXP_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind14REGEXP_ALLCHARE", "cvc5::REGEXP_ALLCHAR"], [10, 0, 1, "_CPPv4N4cvc54Kind17REGEXP_COMPLEMENTE", "cvc5::REGEXP_COMPLEMENT"], [10, 0, 1, "_CPPv4N4cvc54Kind13REGEXP_CONCATE", "cvc5::REGEXP_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_DIFFE", "cvc5::REGEXP_DIFF"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_INTERE", "cvc5::REGEXP_INTER"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_LOOPE", "cvc5::REGEXP_LOOP"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_NONEE", "cvc5::REGEXP_NONE"], [10, 0, 1, "_CPPv4N4cvc54Kind10REGEXP_OPTE", "cvc5::REGEXP_OPT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_PLUSE", "cvc5::REGEXP_PLUS"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_RANGEE", "cvc5::REGEXP_RANGE"], [10, 0, 1, "_CPPv4N4cvc54Kind13REGEXP_REPEATE", "cvc5::REGEXP_REPEAT"], [10, 0, 1, "_CPPv4N4cvc54Kind11REGEXP_STARE", "cvc5::REGEXP_STAR"], [10, 0, 1, "_CPPv4N4cvc54Kind12REGEXP_UNIONE", "cvc5::REGEXP_UNION"], [10, 0, 1, "_CPPv4N4cvc54Kind18RELATION_AGGREGATEE", "cvc5::RELATION_AGGREGATE"], [10, 0, 1, "_CPPv4N4cvc54Kind14RELATION_GROUPE", "cvc5::RELATION_GROUP"], [10, 0, 1, "_CPPv4N4cvc54Kind13RELATION_IDENE", "cvc5::RELATION_IDEN"], [10, 0, 1, "_CPPv4N4cvc54Kind13RELATION_JOINE", "cvc5::RELATION_JOIN"], [10, 0, 1, "_CPPv4N4cvc54Kind19RELATION_JOIN_IMAGEE", "cvc5::RELATION_JOIN_IMAGE"], [10, 0, 1, "_CPPv4N4cvc54Kind16RELATION_PRODUCTE", "cvc5::RELATION_PRODUCT"], [10, 0, 1, "_CPPv4N4cvc54Kind16RELATION_PROJECTE", "cvc5::RELATION_PROJECT"], [10, 0, 1, "_CPPv4N4cvc54Kind17RELATION_TCLOSUREE", "cvc5::RELATION_TCLOSURE"], [10, 0, 1, "_CPPv4N4cvc54Kind18RELATION_TRANSPOSEE", "cvc5::RELATION_TRANSPOSE"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation19REQUIRES_FULL_CHECKE", "cvc5::REQUIRES_FULL_CHECK"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11RESOURCEOUTE", "cvc5::RESOURCEOUT"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode26ROUND_NEAREST_TIES_TO_AWAYE", "cvc5::ROUND_NEAREST_TIES_TO_AWAY"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode26ROUND_NEAREST_TIES_TO_EVENE", "cvc5::ROUND_NEAREST_TIES_TO_EVEN"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode21ROUND_TOWARD_NEGATIVEE", "cvc5::ROUND_TOWARD_NEGATIVE"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode21ROUND_TOWARD_POSITIVEE", "cvc5::ROUND_TOWARD_POSITIVE"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode17ROUND_TOWARD_ZEROE", "cvc5::ROUND_TOWARD_ZERO"], [15, 1, 1, "_CPPv4N4cvc56ResultE", "cvc5::Result"], [15, 2, 1, "_CPPv4N4cvc56Result6ResultEv", "cvc5::Result::Result"], [15, 2, 1, "_CPPv4NK4cvc56Result21getUnknownExplanationEv", "cvc5::Result::getUnknownExplanation"], [15, 2, 1, "_CPPv4NK4cvc56Result6isNullEv", "cvc5::Result::isNull"], [15, 2, 1, "_CPPv4NK4cvc56Result5isSatEv", "cvc5::Result::isSat"], [15, 2, 1, "_CPPv4NK4cvc56Result9isUnknownEv", "cvc5::Result::isUnknown"], [15, 2, 1, "_CPPv4NK4cvc56Result7isUnsatEv", "cvc5::Result::isUnsat"], [15, 2, 1, "_CPPv4NK4cvc56ResultneERK6Result", "cvc5::Result::operator!="], [15, 3, 1, "_CPPv4NK4cvc56ResultneERK6Result", "cvc5::Result::operator!=::r"], [15, 2, 1, "_CPPv4NK4cvc56ResulteqERK6Result", "cvc5::Result::operator=="], [15, 3, 1, "_CPPv4NK4cvc56ResulteqERK6Result", "cvc5::Result::operator==::r"], [15, 2, 1, "_CPPv4NK4cvc56Result8toStringEv", "cvc5::Result::toString"], [16, 5, 1, "_CPPv4N4cvc512RoundingModeE", "cvc5::RoundingMode"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode26ROUND_NEAREST_TIES_TO_AWAYE", "cvc5::RoundingMode::ROUND_NEAREST_TIES_TO_AWAY"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode26ROUND_NEAREST_TIES_TO_EVENE", "cvc5::RoundingMode::ROUND_NEAREST_TIES_TO_EVEN"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode21ROUND_TOWARD_NEGATIVEE", "cvc5::RoundingMode::ROUND_TOWARD_NEGATIVE"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode21ROUND_TOWARD_POSITIVEE", "cvc5::RoundingMode::ROUND_TOWARD_POSITIVE"], [16, 0, 1, "_CPPv4N4cvc512RoundingMode17ROUND_TOWARD_ZEROE", "cvc5::RoundingMode::ROUND_TOWARD_ZERO"], [10, 0, 1, "_CPPv4N4cvc54Kind6SECANTE", "cvc5::SECANT"], [10, 0, 1, "_CPPv4N4cvc54Kind6SELECTE", "cvc5::SELECT"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_EMPE", "cvc5::SEP_EMP"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_NILE", "cvc5::SEP_NIL"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEP_PTOE", "cvc5::SEP_PTO"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEP_STARE", "cvc5::SEP_STAR"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEP_WANDE", "cvc5::SEP_WAND"], [10, 0, 1, "_CPPv4N4cvc54Kind6SEQ_ATE", "cvc5::SEQ_AT"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_CONCATE", "cvc5::SEQ_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind12SEQ_CONTAINSE", "cvc5::SEQ_CONTAINS"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_EXTRACTE", "cvc5::SEQ_EXTRACT"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_INDEXOFE", "cvc5::SEQ_INDEXOF"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_LENGTHE", "cvc5::SEQ_LENGTH"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEQ_NTHE", "cvc5::SEQ_NTH"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_PREFIXE", "cvc5::SEQ_PREFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind11SEQ_REPLACEE", "cvc5::SEQ_REPLACE"], [10, 0, 1, "_CPPv4N4cvc54Kind15SEQ_REPLACE_ALLE", "cvc5::SEQ_REPLACE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind7SEQ_REVE", "cvc5::SEQ_REV"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_SUFFIXE", "cvc5::SEQ_SUFFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind8SEQ_UNITE", "cvc5::SEQ_UNIT"], [10, 0, 1, "_CPPv4N4cvc54Kind10SEQ_UPDATEE", "cvc5::SEQ_UPDATE"], [10, 0, 1, "_CPPv4N4cvc54Kind8SET_CARDE", "cvc5::SET_CARD"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_CHOOSEE", "cvc5::SET_CHOOSE"], [10, 0, 1, "_CPPv4N4cvc54Kind14SET_COMPLEMENTE", "cvc5::SET_COMPLEMENT"], [10, 0, 1, "_CPPv4N4cvc54Kind17SET_COMPREHENSIONE", "cvc5::SET_COMPREHENSION"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_EMPTYE", "cvc5::SET_EMPTY"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_FILTERE", "cvc5::SET_FILTER"], [10, 0, 1, "_CPPv4N4cvc54Kind8SET_FOLDE", "cvc5::SET_FOLD"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_INSERTE", "cvc5::SET_INSERT"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_INTERE", "cvc5::SET_INTER"], [10, 0, 1, "_CPPv4N4cvc54Kind16SET_IS_SINGLETONE", "cvc5::SET_IS_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind7SET_MAPE", "cvc5::SET_MAP"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_MEMBERE", "cvc5::SET_MEMBER"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_MINUSE", "cvc5::SET_MINUS"], [10, 0, 1, "_CPPv4N4cvc54Kind13SET_SINGLETONE", "cvc5::SET_SINGLETON"], [10, 0, 1, "_CPPv4N4cvc54Kind10SET_SUBSETE", "cvc5::SET_SUBSET"], [10, 0, 1, "_CPPv4N4cvc54Kind9SET_UNIONE", "cvc5::SET_UNION"], [10, 0, 1, "_CPPv4N4cvc54Kind12SET_UNIVERSEE", "cvc5::SET_UNIVERSE"], [10, 0, 1, "_CPPv4N4cvc54Kind5SEXPRE", "cvc5::SEXPR"], [10, 0, 1, "_CPPv4N4cvc54Kind4SINEE", "cvc5::SINE"], [10, 0, 1, "_CPPv4N4cvc54Kind18SKOLEM_ADD_TO_POOLE", "cvc5::SKOLEM_ADD_TO_POOL"], [10, 0, 1, "_CPPv4N4cvc54Kind4SQRTE", "cvc5::SQRT"], [10, 0, 1, "_CPPv4N4cvc54Kind5STOREE", "cvc5::STORE"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_CHARATE", "cvc5::STRING_CHARAT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_CONCATE", "cvc5::STRING_CONCAT"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_CONTAINSE", "cvc5::STRING_CONTAINS"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_FROM_CODEE", "cvc5::STRING_FROM_CODE"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_FROM_INTE", "cvc5::STRING_FROM_INT"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_INDEXOFE", "cvc5::STRING_INDEXOF"], [10, 0, 1, "_CPPv4N4cvc54Kind17STRING_INDEXOF_REE", "cvc5::STRING_INDEXOF_RE"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_IN_REGEXPE", "cvc5::STRING_IN_REGEXP"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_IS_DIGITE", "cvc5::STRING_IS_DIGIT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_LENGTHE", "cvc5::STRING_LENGTH"], [10, 0, 1, "_CPPv4N4cvc54Kind10STRING_LEQE", "cvc5::STRING_LEQ"], [10, 0, 1, "_CPPv4N4cvc54Kind9STRING_LTE", "cvc5::STRING_LT"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_PREFIXE", "cvc5::STRING_PREFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_REPLACEE", "cvc5::STRING_REPLACE"], [10, 0, 1, "_CPPv4N4cvc54Kind18STRING_REPLACE_ALLE", "cvc5::STRING_REPLACE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind17STRING_REPLACE_REE", "cvc5::STRING_REPLACE_RE"], [10, 0, 1, "_CPPv4N4cvc54Kind21STRING_REPLACE_RE_ALLE", "cvc5::STRING_REPLACE_RE_ALL"], [10, 0, 1, "_CPPv4N4cvc54Kind10STRING_REVE", "cvc5::STRING_REV"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_SUBSTRE", "cvc5::STRING_SUBSTR"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_SUFFIXE", "cvc5::STRING_SUFFIX"], [10, 0, 1, "_CPPv4N4cvc54Kind14STRING_TO_CODEE", "cvc5::STRING_TO_CODE"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_TO_INTE", "cvc5::STRING_TO_INT"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_TO_LOWERE", "cvc5::STRING_TO_LOWER"], [10, 0, 1, "_CPPv4N4cvc54Kind16STRING_TO_REGEXPE", "cvc5::STRING_TO_REGEXP"], [10, 0, 1, "_CPPv4N4cvc54Kind15STRING_TO_UPPERE", "cvc5::STRING_TO_UPPER"], [10, 0, 1, "_CPPv4N4cvc54Kind13STRING_UPDATEE", "cvc5::STRING_UPDATE"], [10, 0, 1, "_CPPv4N4cvc54Kind3SUBE", "cvc5::SUB"], [17, 1, 1, "_CPPv4N4cvc56SolverE", "cvc5::Solver"], [17, 2, 1, "_CPPv4N4cvc56Solver6SolverERK6Solver", "cvc5::Solver::Solver"], [17, 2, 1, "_CPPv4N4cvc56Solver6SolverEv", "cvc5::Solver::Solver"], [17, 2, 1, "_CPPv4NK4cvc56Solver14addSygusAssumeERK4Term", "cvc5::Solver::addSygusAssume"], [17, 3, 1, "_CPPv4NK4cvc56Solver14addSygusAssumeERK4Term", "cvc5::Solver::addSygusAssume::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver18addSygusConstraintERK4Term", "cvc5::Solver::addSygusConstraint"], [17, 3, 1, "_CPPv4NK4cvc56Solver18addSygusConstraintERK4Term", "cvc5::Solver::addSygusConstraint::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver21addSygusInvConstraintE4Term4Term4Term4Term", "cvc5::Solver::addSygusInvConstraint"], [17, 3, 1, "_CPPv4NK4cvc56Solver21addSygusInvConstraintE4Term4Term4Term4Term", "cvc5::Solver::addSygusInvConstraint::inv"], [17, 3, 1, "_CPPv4NK4cvc56Solver21addSygusInvConstraintE4Term4Term4Term4Term", "cvc5::Solver::addSygusInvConstraint::post"], [17, 3, 1, "_CPPv4NK4cvc56Solver21addSygusInvConstraintE4Term4Term4Term4Term", "cvc5::Solver::addSygusInvConstraint::pre"], [17, 3, 1, "_CPPv4NK4cvc56Solver21addSygusInvConstraintE4Term4Term4Term4Term", "cvc5::Solver::addSygusInvConstraint::trans"], [17, 2, 1, "_CPPv4NK4cvc56Solver13assertFormulaERK4Term", "cvc5::Solver::assertFormula"], [17, 3, 1, "_CPPv4NK4cvc56Solver13assertFormulaERK4Term", "cvc5::Solver::assertFormula::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver10blockModelEN5modes15BlockModelsModeE", "cvc5::Solver::blockModel"], [17, 3, 1, "_CPPv4NK4cvc56Solver10blockModelEN5modes15BlockModelsModeE", "cvc5::Solver::blockModel::mode"], [17, 2, 1, "_CPPv4NK4cvc56Solver16blockModelValuesERKNSt6vectorI4TermEE", "cvc5::Solver::blockModelValues"], [17, 3, 1, "_CPPv4NK4cvc56Solver16blockModelValuesERKNSt6vectorI4TermEE", "cvc5::Solver::blockModelValues::terms"], [17, 2, 1, "_CPPv4NK4cvc56Solver8checkSatEv", "cvc5::Solver::checkSat"], [17, 2, 1, "_CPPv4NK4cvc56Solver16checkSatAssumingERK4Term", "cvc5::Solver::checkSatAssuming"], [17, 2, 1, "_CPPv4NK4cvc56Solver16checkSatAssumingERKNSt6vectorI4TermEE", "cvc5::Solver::checkSatAssuming"], [17, 3, 1, "_CPPv4NK4cvc56Solver16checkSatAssumingERK4Term", "cvc5::Solver::checkSatAssuming::assumption"], [17, 3, 1, "_CPPv4NK4cvc56Solver16checkSatAssumingERKNSt6vectorI4TermEE", "cvc5::Solver::checkSatAssuming::assumptions"], [17, 2, 1, "_CPPv4NK4cvc56Solver10checkSynthEv", "cvc5::Solver::checkSynth"], [17, 2, 1, "_CPPv4NK4cvc56Solver14checkSynthNextEv", "cvc5::Solver::checkSynthNext"], [17, 2, 1, "_CPPv4NK4cvc56Solver15declareDatatypeERKNSt6stringERKNSt6vectorI23DatatypeConstructorDeclEE", "cvc5::Solver::declareDatatype"], [17, 3, 1, "_CPPv4NK4cvc56Solver15declareDatatypeERKNSt6stringERKNSt6vectorI23DatatypeConstructorDeclEE", "cvc5::Solver::declareDatatype::ctors"], [17, 3, 1, "_CPPv4NK4cvc56Solver15declareDatatypeERKNSt6stringERKNSt6vectorI23DatatypeConstructorDeclEE", "cvc5::Solver::declareDatatype::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver10declareFunERKNSt6stringERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::declareFun"], [17, 3, 1, "_CPPv4NK4cvc56Solver10declareFunERKNSt6stringERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::declareFun::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver10declareFunERKNSt6stringERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::declareFun::sorts"], [17, 3, 1, "_CPPv4NK4cvc56Solver10declareFunERKNSt6stringERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::declareFun::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver16declareOracleFunERKNSt6stringERKNSt6vectorI4SortEERK4SortNSt8functionIF4TermRKNSt6vectorI4TermEEEEE", "cvc5::Solver::declareOracleFun"], [17, 3, 1, "_CPPv4NK4cvc56Solver16declareOracleFunERKNSt6stringERKNSt6vectorI4SortEERK4SortNSt8functionIF4TermRKNSt6vectorI4TermEEEEE", "cvc5::Solver::declareOracleFun::fn"], [17, 3, 1, "_CPPv4NK4cvc56Solver16declareOracleFunERKNSt6stringERKNSt6vectorI4SortEERK4SortNSt8functionIF4TermRKNSt6vectorI4TermEEEEE", "cvc5::Solver::declareOracleFun::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver16declareOracleFunERKNSt6stringERKNSt6vectorI4SortEERK4SortNSt8functionIF4TermRKNSt6vectorI4TermEEEEE", "cvc5::Solver::declareOracleFun::sorts"], [17, 3, 1, "_CPPv4NK4cvc56Solver16declareOracleFunERKNSt6stringERKNSt6vectorI4SortEERK4SortNSt8functionIF4TermRKNSt6vectorI4TermEEEEE", "cvc5::Solver::declareOracleFun::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver11declarePoolERKNSt6stringERK4SortRKNSt6vectorI4TermEE", "cvc5::Solver::declarePool"], [17, 3, 1, "_CPPv4NK4cvc56Solver11declarePoolERKNSt6stringERK4SortRKNSt6vectorI4TermEE", "cvc5::Solver::declarePool::initValue"], [17, 3, 1, "_CPPv4NK4cvc56Solver11declarePoolERKNSt6stringERK4SortRKNSt6vectorI4TermEE", "cvc5::Solver::declarePool::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11declarePoolERKNSt6stringERK4SortRKNSt6vectorI4TermEE", "cvc5::Solver::declarePool::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver14declareSepHeapERK4SortRK4Sort", "cvc5::Solver::declareSepHeap"], [17, 3, 1, "_CPPv4NK4cvc56Solver14declareSepHeapERK4SortRK4Sort", "cvc5::Solver::declareSepHeap::dataSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver14declareSepHeapERK4SortRK4Sort", "cvc5::Solver::declareSepHeap::locSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver11declareSortERKNSt6stringE8uint32_t", "cvc5::Solver::declareSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11declareSortERKNSt6stringE8uint32_t", "cvc5::Solver::declareSort::arity"], [17, 3, 1, "_CPPv4NK4cvc56Solver11declareSortERKNSt6stringE8uint32_t", "cvc5::Solver::declareSort::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver15declareSygusVarERKNSt6stringERK4Sort", "cvc5::Solver::declareSygusVar"], [17, 3, 1, "_CPPv4NK4cvc56Solver15declareSygusVarERKNSt6stringERK4Sort", "cvc5::Solver::declareSygusVar::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver15declareSygusVarERKNSt6stringERK4Sort", "cvc5::Solver::declareSygusVar::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun"], [17, 3, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun::bound_vars"], [17, 3, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun::global"], [17, 3, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun::symbol"], [17, 3, 1, "_CPPv4NK4cvc56Solver9defineFunERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFun::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver12defineFunRecERK4TermRKNSt6vectorI4TermEERK4Termb", "cvc5::Solver::defineFunRec"], [17, 2, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERK4TermRKNSt6vectorI4TermEERK4Termb", "cvc5::Solver::defineFunRec::bound_vars"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec::bound_vars"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERK4TermRKNSt6vectorI4TermEERK4Termb", "cvc5::Solver::defineFunRec::fun"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERK4TermRKNSt6vectorI4TermEERK4Termb", "cvc5::Solver::defineFunRec::global"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec::global"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec::symbol"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERK4TermRKNSt6vectorI4TermEERK4Termb", "cvc5::Solver::defineFunRec::term"], [17, 3, 1, "_CPPv4NK4cvc56Solver12defineFunRecERKNSt6stringERKNSt6vectorI4TermEERK4SortRK4Termb", "cvc5::Solver::defineFunRec::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver13defineFunsRecERKNSt6vectorI4TermEERKNSt6vectorINSt6vectorI4TermEEEERKNSt6vectorI4TermEEb", "cvc5::Solver::defineFunsRec"], [17, 3, 1, "_CPPv4NK4cvc56Solver13defineFunsRecERKNSt6vectorI4TermEERKNSt6vectorINSt6vectorI4TermEEEERKNSt6vectorI4TermEEb", "cvc5::Solver::defineFunsRec::bound_vars"], [17, 3, 1, "_CPPv4NK4cvc56Solver13defineFunsRecERKNSt6vectorI4TermEERKNSt6vectorINSt6vectorI4TermEEEERKNSt6vectorI4TermEEb", "cvc5::Solver::defineFunsRec::funs"], [17, 3, 1, "_CPPv4NK4cvc56Solver13defineFunsRecERKNSt6vectorI4TermEERKNSt6vectorINSt6vectorI4TermEEEERKNSt6vectorI4TermEEb", "cvc5::Solver::defineFunsRec::global"], [17, 3, 1, "_CPPv4NK4cvc56Solver13defineFunsRecERKNSt6vectorI4TermEERKNSt6vectorINSt6vectorI4TermEEEERKNSt6vectorI4TermEEb", "cvc5::Solver::defineFunsRec::terms"], [17, 2, 1, "_CPPv4NK4cvc56Solver9getAbductERK4Term", "cvc5::Solver::getAbduct"], [17, 2, 1, "_CPPv4NK4cvc56Solver9getAbductERK4TermR7Grammar", "cvc5::Solver::getAbduct"], [17, 3, 1, "_CPPv4NK4cvc56Solver9getAbductERK4Term", "cvc5::Solver::getAbduct::conj"], [17, 3, 1, "_CPPv4NK4cvc56Solver9getAbductERK4TermR7Grammar", "cvc5::Solver::getAbduct::conj"], [17, 3, 1, "_CPPv4NK4cvc56Solver9getAbductERK4TermR7Grammar", "cvc5::Solver::getAbduct::grammar"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getAbductNextEv", "cvc5::Solver::getAbductNext"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getAssertionsEv", "cvc5::Solver::getAssertions"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getBooleanSortEv", "cvc5::Solver::getBooleanSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getDifficultyEv", "cvc5::Solver::getDifficulty"], [17, 2, 1, "_CPPv4NK4cvc56Solver16getDriverOptionsEv", "cvc5::Solver::getDriverOptions"], [17, 2, 1, "_CPPv4NK4cvc56Solver7getInfoERKNSt6stringE", "cvc5::Solver::getInfo"], [17, 3, 1, "_CPPv4NK4cvc56Solver7getInfoERKNSt6stringE", "cvc5::Solver::getInfo::flag"], [17, 2, 1, "_CPPv4NK4cvc56Solver17getInstantiationsEv", "cvc5::Solver::getInstantiations"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getIntegerSortEv", "cvc5::Solver::getIntegerSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getInterpolantERK4Term", "cvc5::Solver::getInterpolant"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getInterpolantERK4TermR7Grammar", "cvc5::Solver::getInterpolant"], [17, 3, 1, "_CPPv4NK4cvc56Solver14getInterpolantERK4Term", "cvc5::Solver::getInterpolant::conj"], [17, 3, 1, "_CPPv4NK4cvc56Solver14getInterpolantERK4TermR7Grammar", "cvc5::Solver::getInterpolant::conj"], [17, 3, 1, "_CPPv4NK4cvc56Solver14getInterpolantERK4TermR7Grammar", "cvc5::Solver::getInterpolant::grammar"], [17, 2, 1, "_CPPv4NK4cvc56Solver18getInterpolantNextEv", "cvc5::Solver::getInterpolantNext"], [17, 2, 1, "_CPPv4NK4cvc56Solver18getLearnedLiteralsEN5modes14LearnedLitTypeE", "cvc5::Solver::getLearnedLiterals"], [17, 3, 1, "_CPPv4NK4cvc56Solver18getLearnedLiteralsEN5modes14LearnedLitTypeE", "cvc5::Solver::getLearnedLiterals::t"], [17, 2, 1, "_CPPv4NK4cvc56Solver8getModelERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::getModel"], [17, 3, 1, "_CPPv4NK4cvc56Solver8getModelERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::getModel::sorts"], [17, 3, 1, "_CPPv4NK4cvc56Solver8getModelERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::getModel::vars"], [17, 2, 1, "_CPPv4NK4cvc56Solver22getModelDomainElementsERK4Sort", "cvc5::Solver::getModelDomainElements"], [17, 3, 1, "_CPPv4NK4cvc56Solver22getModelDomainElementsERK4Sort", "cvc5::Solver::getModelDomainElements::s"], [17, 2, 1, "_CPPv4NK4cvc56Solver11getNullSortEv", "cvc5::Solver::getNullSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver9getOptionERKNSt6stringE", "cvc5::Solver::getOption"], [17, 3, 1, "_CPPv4NK4cvc56Solver9getOptionERKNSt6stringE", "cvc5::Solver::getOption::option"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getOptionInfoERKNSt6stringE", "cvc5::Solver::getOptionInfo"], [17, 3, 1, "_CPPv4NK4cvc56Solver13getOptionInfoERKNSt6stringE", "cvc5::Solver::getOptionInfo::option"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getOptionNamesEv", "cvc5::Solver::getOptionNames"], [17, 2, 1, "_CPPv4NK4cvc56Solver9getOutputERKNSt6stringE", "cvc5::Solver::getOutput"], [17, 3, 1, "_CPPv4NK4cvc56Solver9getOutputERKNSt6stringE", "cvc5::Solver::getOutput::tag"], [17, 2, 1, "_CPPv4NK4cvc56Solver8getProofEN5modes14ProofComponentE", "cvc5::Solver::getProof"], [17, 3, 1, "_CPPv4NK4cvc56Solver8getProofEN5modes14ProofComponentE", "cvc5::Solver::getProof::c"], [17, 2, 1, "_CPPv4NK4cvc56Solver24getQuantifierEliminationERK4Term", "cvc5::Solver::getQuantifierElimination"], [17, 3, 1, "_CPPv4NK4cvc56Solver24getQuantifierEliminationERK4Term", "cvc5::Solver::getQuantifierElimination::q"], [17, 2, 1, "_CPPv4NK4cvc56Solver32getQuantifierEliminationDisjunctERK4Term", "cvc5::Solver::getQuantifierEliminationDisjunct"], [17, 3, 1, "_CPPv4NK4cvc56Solver32getQuantifierEliminationDisjunctERK4Term", "cvc5::Solver::getQuantifierEliminationDisjunct::q"], [17, 2, 1, "_CPPv4NK4cvc56Solver11getRealSortEv", "cvc5::Solver::getRealSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getRegExpSortEv", "cvc5::Solver::getRegExpSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver19getRoundingModeSortEv", "cvc5::Solver::getRoundingModeSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getStatisticsEv", "cvc5::Solver::getStatistics"], [17, 2, 1, "_CPPv4NK4cvc56Solver13getStringSortEv", "cvc5::Solver::getStringSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver16getSynthSolutionE4Term", "cvc5::Solver::getSynthSolution"], [17, 3, 1, "_CPPv4NK4cvc56Solver16getSynthSolutionE4Term", "cvc5::Solver::getSynthSolution::term"], [17, 2, 1, "_CPPv4NK4cvc56Solver17getSynthSolutionsERKNSt6vectorI4TermEE", "cvc5::Solver::getSynthSolutions"], [17, 3, 1, "_CPPv4NK4cvc56Solver17getSynthSolutionsERKNSt6vectorI4TermEE", "cvc5::Solver::getSynthSolutions::terms"], [17, 2, 1, "_CPPv4NK4cvc56Solver19getUnsatAssumptionsEv", "cvc5::Solver::getUnsatAssumptions"], [17, 2, 1, "_CPPv4NK4cvc56Solver12getUnsatCoreEv", "cvc5::Solver::getUnsatCore"], [17, 2, 1, "_CPPv4NK4cvc56Solver8getValueERK4Term", "cvc5::Solver::getValue"], [17, 2, 1, "_CPPv4NK4cvc56Solver8getValueERKNSt6vectorI4TermEE", "cvc5::Solver::getValue"], [17, 3, 1, "_CPPv4NK4cvc56Solver8getValueERK4Term", "cvc5::Solver::getValue::term"], [17, 3, 1, "_CPPv4NK4cvc56Solver8getValueERKNSt6vectorI4TermEE", "cvc5::Solver::getValue::terms"], [17, 2, 1, "_CPPv4NK4cvc56Solver15getValueSepHeapEv", "cvc5::Solver::getValueSepHeap"], [17, 2, 1, "_CPPv4NK4cvc56Solver14getValueSepNilEv", "cvc5::Solver::getValueSepNil"], [17, 2, 1, "_CPPv4NK4cvc56Solver17isModelCoreSymbolERK4Term", "cvc5::Solver::isModelCoreSymbol"], [17, 3, 1, "_CPPv4NK4cvc56Solver17isModelCoreSymbolERK4Term", "cvc5::Solver::isModelCoreSymbol::v"], [17, 2, 1, "_CPPv4NK4cvc56Solver10isOutputOnERKNSt6stringE", "cvc5::Solver::isOutputOn"], [17, 3, 1, "_CPPv4NK4cvc56Solver10isOutputOnERKNSt6stringE", "cvc5::Solver::isOutputOn::tag"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkArraySortERK4SortRK4Sort", "cvc5::Solver::mkArraySort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkArraySortERK4SortRK4Sort", "cvc5::Solver::mkArraySort::elemSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkArraySortERK4SortRK4Sort", "cvc5::Solver::mkArraySort::indexSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkBagSortERK4Sort", "cvc5::Solver::mkBagSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkBagSortERK4Sort", "cvc5::Solver::mkBagSort::elemSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_t8uint64_t", "cvc5::Solver::mkBitVector"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_tRKNSt6stringE8uint32_t", "cvc5::Solver::mkBitVector"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_tRKNSt6stringE8uint32_t", "cvc5::Solver::mkBitVector::base"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_tRKNSt6stringE8uint32_t", "cvc5::Solver::mkBitVector::s"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_t8uint64_t", "cvc5::Solver::mkBitVector::size"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_tRKNSt6stringE8uint32_t", "cvc5::Solver::mkBitVector::size"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkBitVectorE8uint32_t8uint64_t", "cvc5::Solver::mkBitVector::val"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkBitVectorSortE8uint32_t", "cvc5::Solver::mkBitVectorSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkBitVectorSortE8uint32_t", "cvc5::Solver::mkBitVectorSort::size"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkBooleanEb", "cvc5::Solver::mkBoolean"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkBooleanEb", "cvc5::Solver::mkBoolean::val"], [17, 2, 1, "_CPPv4NK4cvc56Solver23mkCardinalityConstraintERK4Sort8uint32_t", "cvc5::Solver::mkCardinalityConstraint"], [17, 3, 1, "_CPPv4NK4cvc56Solver23mkCardinalityConstraintERK4Sort8uint32_t", "cvc5::Solver::mkCardinalityConstraint::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver23mkCardinalityConstraintERK4Sort8uint32_t", "cvc5::Solver::mkCardinalityConstraint::upperBound"], [17, 2, 1, "_CPPv4NK4cvc56Solver7mkConstERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkConst"], [17, 3, 1, "_CPPv4NK4cvc56Solver7mkConstERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkConst::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver7mkConstERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkConst::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver12mkConstArrayERK4SortRK4Term", "cvc5::Solver::mkConstArray"], [17, 3, 1, "_CPPv4NK4cvc56Solver12mkConstArrayERK4SortRK4Term", "cvc5::Solver::mkConstArray::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver12mkConstArrayERK4SortRK4Term", "cvc5::Solver::mkConstArray::val"], [17, 2, 1, "_CPPv4N4cvc56Solver25mkDatatypeConstructorDeclERKNSt6stringE", "cvc5::Solver::mkDatatypeConstructorDecl"], [17, 3, 1, "_CPPv4N4cvc56Solver25mkDatatypeConstructorDeclERKNSt6stringE", "cvc5::Solver::mkDatatypeConstructorDecl::name"], [17, 2, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringERKNSt6vectorI4SortEEb", "cvc5::Solver::mkDatatypeDecl"], [17, 2, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringEb", "cvc5::Solver::mkDatatypeDecl"], [17, 3, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringERKNSt6vectorI4SortEEb", "cvc5::Solver::mkDatatypeDecl::isCoDatatype"], [17, 3, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringEb", "cvc5::Solver::mkDatatypeDecl::isCoDatatype"], [17, 3, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringERKNSt6vectorI4SortEEb", "cvc5::Solver::mkDatatypeDecl::name"], [17, 3, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringEb", "cvc5::Solver::mkDatatypeDecl::name"], [17, 3, 1, "_CPPv4N4cvc56Solver14mkDatatypeDeclERKNSt6stringERKNSt6vectorI4SortEEb", "cvc5::Solver::mkDatatypeDecl::params"], [17, 2, 1, "_CPPv4NK4cvc56Solver14mkDatatypeSortERK12DatatypeDecl", "cvc5::Solver::mkDatatypeSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver14mkDatatypeSortERK12DatatypeDecl", "cvc5::Solver::mkDatatypeSort::dtypedecl"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkDatatypeSortsERKNSt6vectorI12DatatypeDeclEE", "cvc5::Solver::mkDatatypeSorts"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkDatatypeSortsERKNSt6vectorI12DatatypeDeclEE", "cvc5::Solver::mkDatatypeSorts::dtypedecls"], [17, 2, 1, "_CPPv4NK4cvc56Solver10mkEmptyBagERK4Sort", "cvc5::Solver::mkEmptyBag"], [17, 3, 1, "_CPPv4NK4cvc56Solver10mkEmptyBagERK4Sort", "cvc5::Solver::mkEmptyBag::sort"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkEmptySequenceERK4Sort", "cvc5::Solver::mkEmptySequence"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkEmptySequenceERK4Sort", "cvc5::Solver::mkEmptySequence::sort"], [17, 2, 1, "_CPPv4NK4cvc56Solver10mkEmptySetERK4Sort", "cvc5::Solver::mkEmptySet"], [17, 3, 1, "_CPPv4NK4cvc56Solver10mkEmptySetERK4Sort", "cvc5::Solver::mkEmptySet::sort"], [17, 2, 1, "_CPPv4NK4cvc56Solver7mkFalseEv", "cvc5::Solver::mkFalse"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkFloatingPointE8uint32_t8uint32_t4Term", "cvc5::Solver::mkFloatingPoint"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkFloatingPointE8uint32_t8uint32_t4Term", "cvc5::Solver::mkFloatingPoint::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkFloatingPointE8uint32_t8uint32_t4Term", "cvc5::Solver::mkFloatingPoint::sig"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkFloatingPointE8uint32_t8uint32_t4Term", "cvc5::Solver::mkFloatingPoint::val"], [17, 2, 1, "_CPPv4NK4cvc56Solver18mkFloatingPointNaNE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNaN"], [17, 3, 1, "_CPPv4NK4cvc56Solver18mkFloatingPointNaNE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNaN::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver18mkFloatingPointNaNE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNaN::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointNegInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegInf"], [17, 3, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointNegInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegInf::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointNegInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegInf::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointNegZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegZero"], [17, 3, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointNegZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegZero::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointNegZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointNegZero::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointPosInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosInf"], [17, 3, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointPosInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosInf::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver21mkFloatingPointPosInfE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosInf::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointPosZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosZero"], [17, 3, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointPosZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosZero::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver22mkFloatingPointPosZeroE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointPosZero::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver19mkFloatingPointSortE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver19mkFloatingPointSortE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointSort::exp"], [17, 3, 1, "_CPPv4NK4cvc56Solver19mkFloatingPointSortE8uint32_t8uint32_t", "cvc5::Solver::mkFloatingPointSort::sig"], [17, 2, 1, "_CPPv4NK4cvc56Solver14mkFunctionSortERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::mkFunctionSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver14mkFunctionSortERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::mkFunctionSort::codomain"], [17, 3, 1, "_CPPv4NK4cvc56Solver14mkFunctionSortERKNSt6vectorI4SortEERK4Sort", "cvc5::Solver::mkFunctionSort::sorts"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkGrammarERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Solver::mkGrammar"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkGrammarERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Solver::mkGrammar::boundVars"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkGrammarERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Solver::mkGrammar::ntSymbols"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkIntegerE7int64_t", "cvc5::Solver::mkInteger"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkIntegerERKNSt6stringE", "cvc5::Solver::mkInteger"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkIntegerERKNSt6stringE", "cvc5::Solver::mkInteger::s"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkIntegerE7int64_t", "cvc5::Solver::mkInteger::val"], [17, 2, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6stringE", "cvc5::Solver::mkOp"], [17, 2, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6vectorI8uint32_tEE", "cvc5::Solver::mkOp"], [17, 3, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6stringE", "cvc5::Solver::mkOp::arg"], [17, 3, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6vectorI8uint32_tEE", "cvc5::Solver::mkOp::args"], [17, 3, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6stringE", "cvc5::Solver::mkOp::kind"], [17, 3, 1, "_CPPv4NK4cvc56Solver4mkOpE4KindRKNSt6vectorI8uint32_tEE", "cvc5::Solver::mkOp::kind"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkParamSortERKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkParamSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkParamSortERKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkParamSort::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver4mkPiEv", "cvc5::Solver::mkPi"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkPredicateSortERKNSt6vectorI4SortEE", "cvc5::Solver::mkPredicateSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver15mkPredicateSortERKNSt6vectorI4SortEE", "cvc5::Solver::mkPredicateSort::sorts"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkRealE7int64_t", "cvc5::Solver::mkReal"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkRealE7int64_t7int64_t", "cvc5::Solver::mkReal"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkRealERKNSt6stringE", "cvc5::Solver::mkReal"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkRealE7int64_t7int64_t", "cvc5::Solver::mkReal::den"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkRealE7int64_t7int64_t", "cvc5::Solver::mkReal::num"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkRealERKNSt6stringE", "cvc5::Solver::mkReal::s"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkRealE7int64_t", "cvc5::Solver::mkReal::val"], [17, 2, 1, "_CPPv4NK4cvc56Solver12mkRecordSortERKNSt6vectorINSt4pairINSt6stringE4SortEEEE", "cvc5::Solver::mkRecordSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver12mkRecordSortERKNSt6vectorINSt4pairINSt6stringE4SortEEEE", "cvc5::Solver::mkRecordSort::fields"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkRegexpAllEv", "cvc5::Solver::mkRegexpAll"], [17, 2, 1, "_CPPv4NK4cvc56Solver15mkRegexpAllcharEv", "cvc5::Solver::mkRegexpAllchar"], [17, 2, 1, "_CPPv4NK4cvc56Solver12mkRegexpNoneEv", "cvc5::Solver::mkRegexpNone"], [17, 2, 1, "_CPPv4NK4cvc56Solver14mkRoundingModeE12RoundingMode", "cvc5::Solver::mkRoundingMode"], [17, 3, 1, "_CPPv4NK4cvc56Solver14mkRoundingModeE12RoundingMode", "cvc5::Solver::mkRoundingMode::rm"], [17, 2, 1, "_CPPv4NK4cvc56Solver8mkSepEmpEv", "cvc5::Solver::mkSepEmp"], [17, 2, 1, "_CPPv4NK4cvc56Solver8mkSepNilERK4Sort", "cvc5::Solver::mkSepNil"], [17, 3, 1, "_CPPv4NK4cvc56Solver8mkSepNilERK4Sort", "cvc5::Solver::mkSepNil::sort"], [17, 2, 1, "_CPPv4NK4cvc56Solver14mkSequenceSortERK4Sort", "cvc5::Solver::mkSequenceSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver14mkSequenceSortERK4Sort", "cvc5::Solver::mkSequenceSort::elemSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver9mkSetSortERK4Sort", "cvc5::Solver::mkSetSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver9mkSetSortERK4Sort", "cvc5::Solver::mkSetSort::elemSort"], [17, 2, 1, "_CPPv4NK4cvc56Solver8mkStringERKNSt6stringEb", "cvc5::Solver::mkString"], [17, 2, 1, "_CPPv4NK4cvc56Solver8mkStringERKNSt7wstringE", "cvc5::Solver::mkString"], [17, 3, 1, "_CPPv4NK4cvc56Solver8mkStringERKNSt6stringEb", "cvc5::Solver::mkString::s"], [17, 3, 1, "_CPPv4NK4cvc56Solver8mkStringERKNSt7wstringE", "cvc5::Solver::mkString::s"], [17, 3, 1, "_CPPv4NK4cvc56Solver8mkStringERKNSt6stringEb", "cvc5::Solver::mkString::useEscSequences"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkTermE4KindRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkTermERK2OpRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkTermE4KindRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm::children"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkTermERK2OpRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm::children"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkTermE4KindRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm::kind"], [17, 3, 1, "_CPPv4NK4cvc56Solver6mkTermERK2OpRKNSt6vectorI4TermEE", "cvc5::Solver::mkTerm::op"], [17, 2, 1, "_CPPv4NK4cvc56Solver6mkTrueEv", "cvc5::Solver::mkTrue"], [17, 2, 1, "_CPPv4NK4cvc56Solver7mkTupleERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::mkTuple"], [17, 3, 1, "_CPPv4NK4cvc56Solver7mkTupleERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::mkTuple::sorts"], [17, 3, 1, "_CPPv4NK4cvc56Solver7mkTupleERKNSt6vectorI4SortEERKNSt6vectorI4TermEE", "cvc5::Solver::mkTuple::terms"], [17, 2, 1, "_CPPv4NK4cvc56Solver11mkTupleSortERKNSt6vectorI4SortEE", "cvc5::Solver::mkTupleSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver11mkTupleSortERKNSt6vectorI4SortEE", "cvc5::Solver::mkTupleSort::sorts"], [17, 2, 1, "_CPPv4NK4cvc56Solver19mkUninterpretedSortERKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkUninterpretedSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver19mkUninterpretedSortERKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkUninterpretedSort::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver34mkUninterpretedSortConstructorSortE6size_tRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkUninterpretedSortConstructorSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver34mkUninterpretedSortConstructorSortE6size_tRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkUninterpretedSortConstructorSort::arity"], [17, 3, 1, "_CPPv4NK4cvc56Solver34mkUninterpretedSortConstructorSortE6size_tRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkUninterpretedSortConstructorSort::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver13mkUniverseSetERK4Sort", "cvc5::Solver::mkUniverseSet"], [17, 3, 1, "_CPPv4NK4cvc56Solver13mkUniverseSetERK4Sort", "cvc5::Solver::mkUniverseSet::sort"], [17, 2, 1, "_CPPv4NK4cvc56Solver24mkUnresolvedDatatypeSortERKNSt6stringE6size_t", "cvc5::Solver::mkUnresolvedDatatypeSort"], [17, 3, 1, "_CPPv4NK4cvc56Solver24mkUnresolvedDatatypeSortERKNSt6stringE6size_t", "cvc5::Solver::mkUnresolvedDatatypeSort::arity"], [17, 3, 1, "_CPPv4NK4cvc56Solver24mkUnresolvedDatatypeSortERKNSt6stringE6size_t", "cvc5::Solver::mkUnresolvedDatatypeSort::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver5mkVarERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkVar"], [17, 3, 1, "_CPPv4NK4cvc56Solver5mkVarERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkVar::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver5mkVarERK4SortRKNSt8optionalINSt6stringEEE", "cvc5::Solver::mkVar::symbol"], [17, 2, 1, "_CPPv4N4cvc56SolveraSERK6Solver", "cvc5::Solver::operator="], [17, 2, 1, "_CPPv4NK4cvc56Solver3popE8uint32_t", "cvc5::Solver::pop"], [17, 3, 1, "_CPPv4NK4cvc56Solver3popE8uint32_t", "cvc5::Solver::pop::nscopes"], [17, 2, 1, "_CPPv4NK4cvc56Solver19printStatisticsSafeEi", "cvc5::Solver::printStatisticsSafe"], [17, 3, 1, "_CPPv4NK4cvc56Solver19printStatisticsSafeEi", "cvc5::Solver::printStatisticsSafe::fd"], [17, 2, 1, "_CPPv4NK4cvc56Solver4pushE8uint32_t", "cvc5::Solver::push"], [17, 3, 1, "_CPPv4NK4cvc56Solver4pushE8uint32_t", "cvc5::Solver::push::nscopes"], [17, 2, 1, "_CPPv4NK4cvc56Solver15resetAssertionsEv", "cvc5::Solver::resetAssertions"], [17, 2, 1, "_CPPv4NK4cvc56Solver7setInfoERKNSt6stringERKNSt6stringE", "cvc5::Solver::setInfo"], [17, 3, 1, "_CPPv4NK4cvc56Solver7setInfoERKNSt6stringERKNSt6stringE", "cvc5::Solver::setInfo::keyword"], [17, 3, 1, "_CPPv4NK4cvc56Solver7setInfoERKNSt6stringERKNSt6stringE", "cvc5::Solver::setInfo::value"], [17, 2, 1, "_CPPv4NK4cvc56Solver8setLogicERKNSt6stringE", "cvc5::Solver::setLogic"], [17, 3, 1, "_CPPv4NK4cvc56Solver8setLogicERKNSt6stringE", "cvc5::Solver::setLogic::logic"], [17, 2, 1, "_CPPv4NK4cvc56Solver9setOptionERKNSt6stringERKNSt6stringE", "cvc5::Solver::setOption"], [17, 3, 1, "_CPPv4NK4cvc56Solver9setOptionERKNSt6stringERKNSt6stringE", "cvc5::Solver::setOption::option"], [17, 3, 1, "_CPPv4NK4cvc56Solver9setOptionERKNSt6stringERKNSt6stringE", "cvc5::Solver::setOption::value"], [17, 2, 1, "_CPPv4N4cvc56Solver8simplifyERK4Term", "cvc5::Solver::simplify"], [17, 3, 1, "_CPPv4N4cvc56Solver8simplifyERK4Term", "cvc5::Solver::simplify::t"], [17, 2, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEE4SortR7Grammar", "cvc5::Solver::synthFun"], [17, 2, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEERK4Sort", "cvc5::Solver::synthFun"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEE4SortR7Grammar", "cvc5::Solver::synthFun::boundVars"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEERK4Sort", "cvc5::Solver::synthFun::boundVars"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEE4SortR7Grammar", "cvc5::Solver::synthFun::grammar"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEE4SortR7Grammar", "cvc5::Solver::synthFun::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEERK4Sort", "cvc5::Solver::synthFun::sort"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEE4SortR7Grammar", "cvc5::Solver::synthFun::symbol"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthFunERKNSt6stringERKNSt6vectorI4TermEERK4Sort", "cvc5::Solver::synthFun::symbol"], [17, 2, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEE", "cvc5::Solver::synthInv"], [17, 2, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEER7Grammar", "cvc5::Solver::synthInv"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEE", "cvc5::Solver::synthInv::boundVars"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEER7Grammar", "cvc5::Solver::synthInv::boundVars"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEER7Grammar", "cvc5::Solver::synthInv::grammar"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEE", "cvc5::Solver::synthInv::symbol"], [17, 3, 1, "_CPPv4NK4cvc56Solver8synthInvERKNSt6stringERKNSt6vectorI4TermEER7Grammar", "cvc5::Solver::synthInv::symbol"], [17, 2, 1, "_CPPv4N4cvc56SolverD0Ev", "cvc5::Solver::~Solver"], [18, 1, 1, "_CPPv4N4cvc54SortE", "cvc5::Sort"], [18, 2, 1, "_CPPv4N4cvc54Sort4SortEv", "cvc5::Sort::Sort"], [18, 2, 1, "_CPPv4NK4cvc54Sort19getArrayElementSortEv", "cvc5::Sort::getArrayElementSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort17getArrayIndexSortEv", "cvc5::Sort::getArrayIndexSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort17getBagElementSortEv", "cvc5::Sort::getBagElementSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort16getBitVectorSizeEv", "cvc5::Sort::getBitVectorSize"], [18, 2, 1, "_CPPv4NK4cvc54Sort11getDatatypeEv", "cvc5::Sort::getDatatype"], [18, 2, 1, "_CPPv4NK4cvc54Sort16getDatatypeArityEv", "cvc5::Sort::getDatatypeArity"], [18, 2, 1, "_CPPv4NK4cvc54Sort27getDatatypeConstructorArityEv", "cvc5::Sort::getDatatypeConstructorArity"], [18, 2, 1, "_CPPv4NK4cvc54Sort34getDatatypeConstructorCodomainSortEv", "cvc5::Sort::getDatatypeConstructorCodomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort33getDatatypeConstructorDomainSortsEv", "cvc5::Sort::getDatatypeConstructorDomainSorts"], [18, 2, 1, "_CPPv4NK4cvc54Sort31getDatatypeSelectorCodomainSortEv", "cvc5::Sort::getDatatypeSelectorCodomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort29getDatatypeSelectorDomainSortEv", "cvc5::Sort::getDatatypeSelectorDomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort29getDatatypeTesterCodomainSortEv", "cvc5::Sort::getDatatypeTesterCodomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort27getDatatypeTesterDomainSortEv", "cvc5::Sort::getDatatypeTesterDomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort28getFloatingPointExponentSizeEv", "cvc5::Sort::getFloatingPointExponentSize"], [18, 2, 1, "_CPPv4NK4cvc54Sort31getFloatingPointSignificandSizeEv", "cvc5::Sort::getFloatingPointSignificandSize"], [18, 2, 1, "_CPPv4NK4cvc54Sort16getFunctionArityEv", "cvc5::Sort::getFunctionArity"], [18, 2, 1, "_CPPv4NK4cvc54Sort23getFunctionCodomainSortEv", "cvc5::Sort::getFunctionCodomainSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort22getFunctionDomainSortsEv", "cvc5::Sort::getFunctionDomainSorts"], [18, 2, 1, "_CPPv4NK4cvc54Sort25getInstantiatedParametersEv", "cvc5::Sort::getInstantiatedParameters"], [18, 2, 1, "_CPPv4NK4cvc54Sort22getSequenceElementSortEv", "cvc5::Sort::getSequenceElementSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort17getSetElementSortEv", "cvc5::Sort::getSetElementSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort9getSymbolEv", "cvc5::Sort::getSymbol"], [18, 2, 1, "_CPPv4NK4cvc54Sort14getTupleLengthEv", "cvc5::Sort::getTupleLength"], [18, 2, 1, "_CPPv4NK4cvc54Sort13getTupleSortsEv", "cvc5::Sort::getTupleSorts"], [18, 2, 1, "_CPPv4NK4cvc54Sort31getUninterpretedSortConstructorEv", "cvc5::Sort::getUninterpretedSortConstructor"], [18, 2, 1, "_CPPv4NK4cvc54Sort36getUninterpretedSortConstructorArityEv", "cvc5::Sort::getUninterpretedSortConstructorArity"], [18, 2, 1, "_CPPv4NK4cvc54Sort9hasSymbolEv", "cvc5::Sort::hasSymbol"], [18, 2, 1, "_CPPv4NK4cvc54Sort11instantiateERKNSt6vectorI4SortEE", "cvc5::Sort::instantiate"], [18, 3, 1, "_CPPv4NK4cvc54Sort11instantiateERKNSt6vectorI4SortEE", "cvc5::Sort::instantiate::params"], [18, 2, 1, "_CPPv4NK4cvc54Sort7isArrayEv", "cvc5::Sort::isArray"], [18, 2, 1, "_CPPv4NK4cvc54Sort5isBagEv", "cvc5::Sort::isBag"], [18, 2, 1, "_CPPv4NK4cvc54Sort11isBitVectorEv", "cvc5::Sort::isBitVector"], [18, 2, 1, "_CPPv4NK4cvc54Sort9isBooleanEv", "cvc5::Sort::isBoolean"], [18, 2, 1, "_CPPv4NK4cvc54Sort10isDatatypeEv", "cvc5::Sort::isDatatype"], [18, 2, 1, "_CPPv4NK4cvc54Sort21isDatatypeConstructorEv", "cvc5::Sort::isDatatypeConstructor"], [18, 2, 1, "_CPPv4NK4cvc54Sort18isDatatypeSelectorEv", "cvc5::Sort::isDatatypeSelector"], [18, 2, 1, "_CPPv4NK4cvc54Sort16isDatatypeTesterEv", "cvc5::Sort::isDatatypeTester"], [18, 2, 1, "_CPPv4NK4cvc54Sort17isDatatypeUpdaterEv", "cvc5::Sort::isDatatypeUpdater"], [18, 2, 1, "_CPPv4NK4cvc54Sort15isFloatingPointEv", "cvc5::Sort::isFloatingPoint"], [18, 2, 1, "_CPPv4NK4cvc54Sort10isFunctionEv", "cvc5::Sort::isFunction"], [18, 2, 1, "_CPPv4NK4cvc54Sort14isInstantiatedEv", "cvc5::Sort::isInstantiated"], [18, 2, 1, "_CPPv4NK4cvc54Sort9isIntegerEv", "cvc5::Sort::isInteger"], [18, 2, 1, "_CPPv4NK4cvc54Sort6isNullEv", "cvc5::Sort::isNull"], [18, 2, 1, "_CPPv4NK4cvc54Sort11isPredicateEv", "cvc5::Sort::isPredicate"], [18, 2, 1, "_CPPv4NK4cvc54Sort6isRealEv", "cvc5::Sort::isReal"], [18, 2, 1, "_CPPv4NK4cvc54Sort8isRecordEv", "cvc5::Sort::isRecord"], [18, 2, 1, "_CPPv4NK4cvc54Sort8isRegExpEv", "cvc5::Sort::isRegExp"], [18, 2, 1, "_CPPv4NK4cvc54Sort14isRoundingModeEv", "cvc5::Sort::isRoundingMode"], [18, 2, 1, "_CPPv4NK4cvc54Sort10isSequenceEv", "cvc5::Sort::isSequence"], [18, 2, 1, "_CPPv4NK4cvc54Sort5isSetEv", "cvc5::Sort::isSet"], [18, 2, 1, "_CPPv4NK4cvc54Sort8isStringEv", "cvc5::Sort::isString"], [18, 2, 1, "_CPPv4NK4cvc54Sort7isTupleEv", "cvc5::Sort::isTuple"], [18, 2, 1, "_CPPv4NK4cvc54Sort19isUninterpretedSortEv", "cvc5::Sort::isUninterpretedSort"], [18, 2, 1, "_CPPv4NK4cvc54Sort30isUninterpretedSortConstructorEv", "cvc5::Sort::isUninterpretedSortConstructor"], [18, 2, 1, "_CPPv4NK4cvc54SortneERK4Sort", "cvc5::Sort::operator!="], [18, 3, 1, "_CPPv4NK4cvc54SortneERK4Sort", "cvc5::Sort::operator!=::s"], [18, 2, 1, "_CPPv4NK4cvc54SortltERK4Sort", "cvc5::Sort::operator<"], [18, 3, 1, "_CPPv4NK4cvc54SortltERK4Sort", "cvc5::Sort::operator<::s"], [18, 2, 1, "_CPPv4NK4cvc54SortleERK4Sort", "cvc5::Sort::operator<="], [18, 3, 1, "_CPPv4NK4cvc54SortleERK4Sort", "cvc5::Sort::operator<=::s"], [18, 2, 1, "_CPPv4NK4cvc54SorteqERK4Sort", "cvc5::Sort::operator=="], [18, 3, 1, "_CPPv4NK4cvc54SorteqERK4Sort", "cvc5::Sort::operator==::s"], [18, 2, 1, "_CPPv4NK4cvc54SortgtERK4Sort", "cvc5::Sort::operator>"], [18, 3, 1, "_CPPv4NK4cvc54SortgtERK4Sort", "cvc5::Sort::operator>::s"], [18, 2, 1, "_CPPv4NK4cvc54SortgeERK4Sort", "cvc5::Sort::operator>="], [18, 3, 1, "_CPPv4NK4cvc54SortgeERK4Sort", "cvc5::Sort::operator>=::s"], [18, 2, 1, "_CPPv4NK4cvc54Sort10substituteERK4SortRK4Sort", "cvc5::Sort::substitute"], [18, 2, 1, "_CPPv4NK4cvc54Sort10substituteERKNSt6vectorI4SortEERKNSt6vectorI4SortEE", "cvc5::Sort::substitute"], [18, 3, 1, "_CPPv4NK4cvc54Sort10substituteERK4SortRK4Sort", "cvc5::Sort::substitute::replacement"], [18, 3, 1, "_CPPv4NK4cvc54Sort10substituteERKNSt6vectorI4SortEERKNSt6vectorI4SortEE", "cvc5::Sort::substitute::replacements"], [18, 3, 1, "_CPPv4NK4cvc54Sort10substituteERK4SortRK4Sort", "cvc5::Sort::substitute::sort"], [18, 3, 1, "_CPPv4NK4cvc54Sort10substituteERKNSt6vectorI4SortEERKNSt6vectorI4SortEE", "cvc5::Sort::substitute::sorts"], [18, 2, 1, "_CPPv4NK4cvc54Sort8toStreamERNSt7ostreamE", "cvc5::Sort::toStream"], [18, 3, 1, "_CPPv4NK4cvc54Sort8toStreamERNSt7ostreamE", "cvc5::Sort::toStream::out"], [18, 2, 1, "_CPPv4NK4cvc54Sort8toStringEv", "cvc5::Sort::toString"], [18, 2, 1, "_CPPv4N4cvc54SortD0Ev", "cvc5::Sort::~Sort"], [19, 1, 1, "_CPPv4N4cvc54StatE", "cvc5::Stat"], [19, 4, 1, "_CPPv4N4cvc54Stat13HistogramDataE", "cvc5::Stat::HistogramData"], [19, 2, 1, "_CPPv4N4cvc54Stat4StatERK4Stat", "cvc5::Stat::Stat"], [19, 2, 1, "_CPPv4N4cvc54Stat4StatEv", "cvc5::Stat::Stat"], [19, 3, 1, "_CPPv4N4cvc54Stat4StatERK4Stat", "cvc5::Stat::Stat::s"], [19, 2, 1, "_CPPv4NK4cvc54Stat9getDoubleEv", "cvc5::Stat::getDouble"], [19, 2, 1, "_CPPv4NK4cvc54Stat12getHistogramEv", "cvc5::Stat::getHistogram"], [19, 2, 1, "_CPPv4NK4cvc54Stat6getIntEv", "cvc5::Stat::getInt"], [19, 2, 1, "_CPPv4NK4cvc54Stat9getStringEv", "cvc5::Stat::getString"], [19, 2, 1, "_CPPv4NK4cvc54Stat9isDefaultEv", "cvc5::Stat::isDefault"], [19, 2, 1, "_CPPv4NK4cvc54Stat8isDoubleEv", "cvc5::Stat::isDouble"], [19, 2, 1, "_CPPv4NK4cvc54Stat11isHistogramEv", "cvc5::Stat::isHistogram"], [19, 2, 1, "_CPPv4NK4cvc54Stat5isIntEv", "cvc5::Stat::isInt"], [19, 2, 1, "_CPPv4NK4cvc54Stat10isInternalEv", "cvc5::Stat::isInternal"], [19, 2, 1, "_CPPv4NK4cvc54Stat8isStringEv", "cvc5::Stat::isString"], [19, 2, 1, "_CPPv4N4cvc54StatlsERNSt7ostreamERK4Stat", "cvc5::Stat::operator<<"], [19, 3, 1, "_CPPv4N4cvc54StatlsERNSt7ostreamERK4Stat", "cvc5::Stat::operator<<::os"], [19, 3, 1, "_CPPv4N4cvc54StatlsERNSt7ostreamERK4Stat", "cvc5::Stat::operator<<::sv"], [19, 2, 1, "_CPPv4N4cvc54StataSERK4Stat", "cvc5::Stat::operator="], [19, 3, 1, "_CPPv4N4cvc54StataSERK4Stat", "cvc5::Stat::operator=::s"], [19, 2, 1, "_CPPv4N4cvc54StatD0Ev", "cvc5::Stat::~Stat"], [19, 1, 1, "_CPPv4N4cvc510StatisticsE", "cvc5::Statistics"], [19, 2, 1, "_CPPv4NK4cvc510Statistics5beginEbb", "cvc5::Statistics::begin"], [19, 3, 1, "_CPPv4NK4cvc510Statistics5beginEbb", "cvc5::Statistics::begin::defaulted"], [19, 3, 1, "_CPPv4NK4cvc510Statistics5beginEbb", "cvc5::Statistics::begin::internal"], [19, 2, 1, "_CPPv4NK4cvc510Statistics3endEv", "cvc5::Statistics::end"], [19, 2, 1, "_CPPv4N4cvc510Statistics3getERKNSt6stringE", "cvc5::Statistics::get"], [19, 3, 1, "_CPPv4N4cvc510Statistics3getERKNSt6stringE", "cvc5::Statistics::get::name"], [20, 1, 1, "_CPPv4N4cvc511SynthResultE", "cvc5::SynthResult"], [20, 2, 1, "_CPPv4N4cvc511SynthResult11SynthResultEv", "cvc5::SynthResult::SynthResult"], [20, 2, 1, "_CPPv4NK4cvc511SynthResult13hasNoSolutionEv", "cvc5::SynthResult::hasNoSolution"], [20, 2, 1, "_CPPv4NK4cvc511SynthResult11hasSolutionEv", "cvc5::SynthResult::hasSolution"], [20, 2, 1, "_CPPv4NK4cvc511SynthResult6isNullEv", "cvc5::SynthResult::isNull"], [20, 2, 1, "_CPPv4NK4cvc511SynthResult9isUnknownEv", "cvc5::SynthResult::isUnknown"], [20, 2, 1, "_CPPv4NK4cvc511SynthResult8toStringEv", "cvc5::SynthResult::toString"], [10, 0, 1, "_CPPv4N4cvc54Kind15TABLE_AGGREGATEE", "cvc5::TABLE_AGGREGATE"], [10, 0, 1, "_CPPv4N4cvc54Kind11TABLE_GROUPE", "cvc5::TABLE_GROUP"], [10, 0, 1, "_CPPv4N4cvc54Kind10TABLE_JOINE", "cvc5::TABLE_JOIN"], [10, 0, 1, "_CPPv4N4cvc54Kind13TABLE_PRODUCTE", "cvc5::TABLE_PRODUCT"], [10, 0, 1, "_CPPv4N4cvc54Kind13TABLE_PROJECTE", "cvc5::TABLE_PROJECT"], [10, 0, 1, "_CPPv4N4cvc54Kind7TANGENTE", "cvc5::TANGENT"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation7TIMEOUTE", "cvc5::TIMEOUT"], [10, 0, 1, "_CPPv4N4cvc54Kind10TO_INTEGERE", "cvc5::TO_INTEGER"], [10, 0, 1, "_CPPv4N4cvc54Kind7TO_REALE", "cvc5::TO_REAL"], [10, 0, 1, "_CPPv4N4cvc54Kind13TUPLE_PROJECTE", "cvc5::TUPLE_PROJECT"], [21, 1, 1, "_CPPv4N4cvc54TermE", "cvc5::Term"], [21, 2, 1, "_CPPv4N4cvc54Term4TermEv", "cvc5::Term::Term"], [21, 2, 1, "_CPPv4NK4cvc54Term7andTermERK4Term", "cvc5::Term::andTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term7andTermERK4Term", "cvc5::Term::andTerm::t"], [21, 2, 1, "_CPPv4NK4cvc54Term5beginEv", "cvc5::Term::begin"], [21, 1, 1, "_CPPv4N4cvc54Term14const_iteratorE", "cvc5::Term::const_iterator"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorEPN8internal11NodeManagerERKNSt10shared_ptrIN8internal4NodeEEE8uint32_t", "cvc5::Term::const_iterator::const_iterator"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorERK14const_iterator", "cvc5::Term::const_iterator::const_iterator"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorEv", "cvc5::Term::const_iterator::const_iterator"], [21, 3, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorEPN8internal11NodeManagerERKNSt10shared_ptrIN8internal4NodeEEE8uint32_t", "cvc5::Term::const_iterator::const_iterator::e"], [21, 3, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorERK14const_iterator", "cvc5::Term::const_iterator::const_iterator::it"], [21, 3, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorEPN8internal11NodeManagerERKNSt10shared_ptrIN8internal4NodeEEE8uint32_t", "cvc5::Term::const_iterator::const_iterator::nm"], [21, 3, 1, "_CPPv4N4cvc54Term14const_iterator14const_iteratorEPN8internal11NodeManagerERKNSt10shared_ptrIN8internal4NodeEEE8uint32_t", "cvc5::Term::const_iterator::const_iterator::p"], [21, 4, 1, "_CPPv4N4cvc54Term14const_iterator15difference_typeE", "cvc5::Term::const_iterator::difference_type"], [21, 4, 1, "_CPPv4N4cvc54Term14const_iterator17iterator_categoryE", "cvc5::Term::const_iterator::iterator_category"], [21, 2, 1, "_CPPv4NK4cvc54Term14const_iteratorneERK14const_iterator", "cvc5::Term::const_iterator::operator!="], [21, 3, 1, "_CPPv4NK4cvc54Term14const_iteratorneERK14const_iterator", "cvc5::Term::const_iterator::operator!=::it"], [21, 2, 1, "_CPPv4NK4cvc54Term14const_iteratormlEv", "cvc5::Term::const_iterator::operator*"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iteratorppEi", "cvc5::Term::const_iterator::operator++"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iteratorppEv", "cvc5::Term::const_iterator::operator++"], [21, 2, 1, "_CPPv4N4cvc54Term14const_iteratoraSERK14const_iterator", "cvc5::Term::const_iterator::operator="], [21, 3, 1, "_CPPv4N4cvc54Term14const_iteratoraSERK14const_iterator", "cvc5::Term::const_iterator::operator=::it"], [21, 2, 1, "_CPPv4NK4cvc54Term14const_iteratoreqERK14const_iterator", "cvc5::Term::const_iterator::operator=="], [21, 3, 1, "_CPPv4NK4cvc54Term14const_iteratoreqERK14const_iterator", "cvc5::Term::const_iterator::operator==::it"], [21, 4, 1, "_CPPv4N4cvc54Term14const_iterator7pointerE", "cvc5::Term::const_iterator::pointer"], [21, 4, 1, "_CPPv4N4cvc54Term14const_iterator9referenceE", "cvc5::Term::const_iterator::reference"], [21, 4, 1, "_CPPv4N4cvc54Term14const_iterator10value_typeE", "cvc5::Term::const_iterator::value_type"], [21, 2, 1, "_CPPv4NK4cvc54Term3endEv", "cvc5::Term::end"], [21, 2, 1, "_CPPv4NK4cvc54Term6eqTermERK4Term", "cvc5::Term::eqTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term6eqTermERK4Term", "cvc5::Term::eqTerm::t"], [21, 2, 1, "_CPPv4NK4cvc54Term17getBitVectorValueE8uint32_t", "cvc5::Term::getBitVectorValue"], [21, 3, 1, "_CPPv4NK4cvc54Term17getBitVectorValueE8uint32_t", "cvc5::Term::getBitVectorValue::base"], [21, 2, 1, "_CPPv4NK4cvc54Term15getBooleanValueEv", "cvc5::Term::getBooleanValue"], [21, 2, 1, "_CPPv4NK4cvc54Term24getCardinalityConstraintEv", "cvc5::Term::getCardinalityConstraint"], [21, 2, 1, "_CPPv4NK4cvc54Term17getConstArrayBaseEv", "cvc5::Term::getConstArrayBase"], [21, 2, 1, "_CPPv4NK4cvc54Term21getFloatingPointValueEv", "cvc5::Term::getFloatingPointValue"], [21, 2, 1, "_CPPv4NK4cvc54Term5getIdEv", "cvc5::Term::getId"], [21, 2, 1, "_CPPv4NK4cvc54Term13getInt32ValueEv", "cvc5::Term::getInt32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term13getInt64ValueEv", "cvc5::Term::getInt64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term15getIntegerValueEv", "cvc5::Term::getIntegerValue"], [21, 2, 1, "_CPPv4NK4cvc54Term7getKindEv", "cvc5::Term::getKind"], [21, 2, 1, "_CPPv4NK4cvc54Term14getNumChildrenEv", "cvc5::Term::getNumChildren"], [21, 2, 1, "_CPPv4NK4cvc54Term5getOpEv", "cvc5::Term::getOp"], [21, 2, 1, "_CPPv4NK4cvc54Term14getReal32ValueEv", "cvc5::Term::getReal32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term14getReal64ValueEv", "cvc5::Term::getReal64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term25getRealOrIntegerValueSignEv", "cvc5::Term::getRealOrIntegerValueSign"], [21, 2, 1, "_CPPv4NK4cvc54Term12getRealValueEv", "cvc5::Term::getRealValue"], [21, 2, 1, "_CPPv4NK4cvc54Term20getRoundingModeValueEv", "cvc5::Term::getRoundingModeValue"], [21, 2, 1, "_CPPv4NK4cvc54Term16getSequenceValueEv", "cvc5::Term::getSequenceValue"], [21, 2, 1, "_CPPv4NK4cvc54Term11getSetValueEv", "cvc5::Term::getSetValue"], [21, 2, 1, "_CPPv4NK4cvc54Term7getSortEv", "cvc5::Term::getSort"], [21, 2, 1, "_CPPv4NK4cvc54Term14getStringValueEv", "cvc5::Term::getStringValue"], [21, 2, 1, "_CPPv4NK4cvc54Term9getSymbolEv", "cvc5::Term::getSymbol"], [21, 2, 1, "_CPPv4NK4cvc54Term13getTupleValueEv", "cvc5::Term::getTupleValue"], [21, 2, 1, "_CPPv4NK4cvc54Term14getUInt32ValueEv", "cvc5::Term::getUInt32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term14getUInt64ValueEv", "cvc5::Term::getUInt64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term25getUninterpretedSortValueEv", "cvc5::Term::getUninterpretedSortValue"], [21, 2, 1, "_CPPv4NK4cvc54Term5hasOpEv", "cvc5::Term::hasOp"], [21, 2, 1, "_CPPv4NK4cvc54Term9hasSymbolEv", "cvc5::Term::hasSymbol"], [21, 2, 1, "_CPPv4NK4cvc54Term7impTermERK4Term", "cvc5::Term::impTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term7impTermERK4Term", "cvc5::Term::impTerm::t"], [21, 2, 1, "_CPPv4NK4cvc54Term16isBitVectorValueEv", "cvc5::Term::isBitVectorValue"], [21, 2, 1, "_CPPv4NK4cvc54Term14isBooleanValueEv", "cvc5::Term::isBooleanValue"], [21, 2, 1, "_CPPv4NK4cvc54Term23isCardinalityConstraintEv", "cvc5::Term::isCardinalityConstraint"], [21, 2, 1, "_CPPv4NK4cvc54Term12isConstArrayEv", "cvc5::Term::isConstArray"], [21, 2, 1, "_CPPv4NK4cvc54Term18isFloatingPointNaNEv", "cvc5::Term::isFloatingPointNaN"], [21, 2, 1, "_CPPv4NK4cvc54Term21isFloatingPointNegInfEv", "cvc5::Term::isFloatingPointNegInf"], [21, 2, 1, "_CPPv4NK4cvc54Term22isFloatingPointNegZeroEv", "cvc5::Term::isFloatingPointNegZero"], [21, 2, 1, "_CPPv4NK4cvc54Term21isFloatingPointPosInfEv", "cvc5::Term::isFloatingPointPosInf"], [21, 2, 1, "_CPPv4NK4cvc54Term22isFloatingPointPosZeroEv", "cvc5::Term::isFloatingPointPosZero"], [21, 2, 1, "_CPPv4NK4cvc54Term20isFloatingPointValueEv", "cvc5::Term::isFloatingPointValue"], [21, 2, 1, "_CPPv4NK4cvc54Term12isInt32ValueEv", "cvc5::Term::isInt32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term12isInt64ValueEv", "cvc5::Term::isInt64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term14isIntegerValueEv", "cvc5::Term::isIntegerValue"], [21, 2, 1, "_CPPv4NK4cvc54Term6isNullEv", "cvc5::Term::isNull"], [21, 2, 1, "_CPPv4NK4cvc54Term13isReal32ValueEv", "cvc5::Term::isReal32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term13isReal64ValueEv", "cvc5::Term::isReal64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term11isRealValueEv", "cvc5::Term::isRealValue"], [21, 2, 1, "_CPPv4NK4cvc54Term19isRoundingModeValueEv", "cvc5::Term::isRoundingModeValue"], [21, 2, 1, "_CPPv4NK4cvc54Term15isSequenceValueEv", "cvc5::Term::isSequenceValue"], [21, 2, 1, "_CPPv4NK4cvc54Term10isSetValueEv", "cvc5::Term::isSetValue"], [21, 2, 1, "_CPPv4NK4cvc54Term13isStringValueEv", "cvc5::Term::isStringValue"], [21, 2, 1, "_CPPv4NK4cvc54Term12isTupleValueEv", "cvc5::Term::isTupleValue"], [21, 2, 1, "_CPPv4NK4cvc54Term13isUInt32ValueEv", "cvc5::Term::isUInt32Value"], [21, 2, 1, "_CPPv4NK4cvc54Term13isUInt64ValueEv", "cvc5::Term::isUInt64Value"], [21, 2, 1, "_CPPv4NK4cvc54Term24isUninterpretedSortValueEv", "cvc5::Term::isUninterpretedSortValue"], [21, 2, 1, "_CPPv4NK4cvc54Term7iteTermERK4TermRK4Term", "cvc5::Term::iteTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term7iteTermERK4TermRK4Term", "cvc5::Term::iteTerm::else_t"], [21, 3, 1, "_CPPv4NK4cvc54Term7iteTermERK4TermRK4Term", "cvc5::Term::iteTerm::then_t"], [21, 2, 1, "_CPPv4NK4cvc54Term7notTermEv", "cvc5::Term::notTerm"], [21, 2, 1, "_CPPv4NK4cvc54TermneERK4Term", "cvc5::Term::operator!="], [21, 3, 1, "_CPPv4NK4cvc54TermneERK4Term", "cvc5::Term::operator!=::t"], [21, 2, 1, "_CPPv4NK4cvc54TermltERK4Term", "cvc5::Term::operator<"], [21, 3, 1, "_CPPv4NK4cvc54TermltERK4Term", "cvc5::Term::operator<::t"], [21, 2, 1, "_CPPv4NK4cvc54TermleERK4Term", "cvc5::Term::operator<="], [21, 3, 1, "_CPPv4NK4cvc54TermleERK4Term", "cvc5::Term::operator<=::t"], [21, 2, 1, "_CPPv4NK4cvc54TermeqERK4Term", "cvc5::Term::operator=="], [21, 3, 1, "_CPPv4NK4cvc54TermeqERK4Term", "cvc5::Term::operator==::t"], [21, 2, 1, "_CPPv4NK4cvc54TermgtERK4Term", "cvc5::Term::operator>"], [21, 3, 1, "_CPPv4NK4cvc54TermgtERK4Term", "cvc5::Term::operator>::t"], [21, 2, 1, "_CPPv4NK4cvc54TermgeERK4Term", "cvc5::Term::operator>="], [21, 3, 1, "_CPPv4NK4cvc54TermgeERK4Term", "cvc5::Term::operator>=::t"], [21, 2, 1, "_CPPv4NK4cvc54TermixE6size_t", "cvc5::Term::operator[]"], [21, 3, 1, "_CPPv4NK4cvc54TermixE6size_t", "cvc5::Term::operator[]::index"], [21, 2, 1, "_CPPv4NK4cvc54Term6orTermERK4Term", "cvc5::Term::orTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term6orTermERK4Term", "cvc5::Term::orTerm::t"], [21, 2, 1, "_CPPv4NK4cvc54Term10substituteERK4TermRK4Term", "cvc5::Term::substitute"], [21, 2, 1, "_CPPv4NK4cvc54Term10substituteERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Term::substitute"], [21, 3, 1, "_CPPv4NK4cvc54Term10substituteERK4TermRK4Term", "cvc5::Term::substitute::replacement"], [21, 3, 1, "_CPPv4NK4cvc54Term10substituteERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Term::substitute::replacements"], [21, 3, 1, "_CPPv4NK4cvc54Term10substituteERK4TermRK4Term", "cvc5::Term::substitute::term"], [21, 3, 1, "_CPPv4NK4cvc54Term10substituteERKNSt6vectorI4TermEERKNSt6vectorI4TermEE", "cvc5::Term::substitute::terms"], [21, 2, 1, "_CPPv4NK4cvc54Term8toStringEv", "cvc5::Term::toString"], [21, 2, 1, "_CPPv4NK4cvc54Term7xorTermERK4Term", "cvc5::Term::xorTerm"], [21, 3, 1, "_CPPv4NK4cvc54Term7xorTermERK4Term", "cvc5::Term::xorTerm::t"], [21, 2, 1, "_CPPv4N4cvc54TermD0Ev", "cvc5::Term::~Term"], [10, 0, 1, "_CPPv4N4cvc54Kind14UNDEFINED_KINDE", "cvc5::UNDEFINED_KIND"], [10, 0, 1, "_CPPv4N4cvc54Kind24UNINTERPRETED_SORT_VALUEE", "cvc5::UNINTERPRETED_SORT_VALUE"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation14UNKNOWN_REASONE", "cvc5::UNKNOWN_REASON"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11UNSUPPORTEDE", "cvc5::UNSUPPORTED"], [22, 5, 1, "_CPPv4N4cvc518UnknownExplanationE", "cvc5::UnknownExplanation"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation10INCOMPLETEE", "cvc5::UnknownExplanation::INCOMPLETE"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11INTERRUPTEDE", "cvc5::UnknownExplanation::INTERRUPTED"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation6MEMOUTE", "cvc5::UnknownExplanation::MEMOUT"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation5OTHERE", "cvc5::UnknownExplanation::OTHER"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation19REQUIRES_FULL_CHECKE", "cvc5::UnknownExplanation::REQUIRES_FULL_CHECK"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11RESOURCEOUTE", "cvc5::UnknownExplanation::RESOURCEOUT"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation7TIMEOUTE", "cvc5::UnknownExplanation::TIMEOUT"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation14UNKNOWN_REASONE", "cvc5::UnknownExplanation::UNKNOWN_REASON"], [22, 0, 1, "_CPPv4N4cvc518UnknownExplanation11UNSUPPORTEDE", "cvc5::UnknownExplanation::UNSUPPORTED"], [10, 0, 1, "_CPPv4N4cvc54Kind8VARIABLEE", "cvc5::VARIABLE"], [10, 0, 1, "_CPPv4N4cvc54Kind13VARIABLE_LISTE", "cvc5::VARIABLE_LIST"], [10, 0, 1, "_CPPv4N4cvc54Kind7WITNESSE", "cvc5::WITNESS"], [10, 0, 1, "_CPPv4N4cvc54Kind3XORE", "cvc5::XOR"], [86, 5, 1, "_CPPv4N4cvc58internal6PfRuleE", "cvc5::internal::PfRule"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11ALETHE_RULEE", "cvc5::internal::PfRule::ALETHE_RULE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11ALPHA_EQUIVE", "cvc5::internal::PfRule::ALPHA_EQUIV"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule8AND_ELIME", "cvc5::internal::PfRule::AND_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9AND_INTROE", "cvc5::internal::PfRule::AND_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10ANNOTATIONE", "cvc5::internal::PfRule::ANNOTATION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14ARITH_MULT_NEGE", "cvc5::internal::PfRule::ARITH_MULT_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14ARITH_MULT_POSE", "cvc5::internal::PfRule::ARITH_MULT_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15ARITH_MULT_SIGNE", "cvc5::internal::PfRule::ARITH_MULT_SIGN"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule18ARITH_MULT_TANGENTE", "cvc5::internal::PfRule::ARITH_MULT_TANGENT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule24ARITH_NL_COVERING_DIRECTE", "cvc5::internal::PfRule::ARITH_NL_COVERING_DIRECT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule27ARITH_NL_COVERING_RECURSIVEE", "cvc5::internal::PfRule::ARITH_NL_COVERING_RECURSIVE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule19ARITH_OP_ELIM_AXIOME", "cvc5::internal::PfRule::ARITH_OP_ELIM_AXIOM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15ARITH_POLY_NORME", "cvc5::internal::PfRule::ARITH_POLY_NORM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12ARITH_SUM_UBE", "cvc5::internal::PfRule::ARITH_SUM_UB"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule32ARITH_TRANS_EXP_APPROX_ABOVE_NEGE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_APPROX_ABOVE_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule32ARITH_TRANS_EXP_APPROX_ABOVE_POSE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_APPROX_ABOVE_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule28ARITH_TRANS_EXP_APPROX_BELOWE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_APPROX_BELOW"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule19ARITH_TRANS_EXP_NEGE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule26ARITH_TRANS_EXP_POSITIVITYE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_POSITIVITY"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule25ARITH_TRANS_EXP_SUPER_LINE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_SUPER_LIN"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule20ARITH_TRANS_EXP_ZEROE", "cvc5::internal::PfRule::ARITH_TRANS_EXP_ZERO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14ARITH_TRANS_PIE", "cvc5::internal::PfRule::ARITH_TRANS_PI"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule33ARITH_TRANS_SINE_APPROX_ABOVE_NEGE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_APPROX_ABOVE_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule33ARITH_TRANS_SINE_APPROX_ABOVE_POSE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_APPROX_ABOVE_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule33ARITH_TRANS_SINE_APPROX_BELOW_NEGE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_APPROX_BELOW_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule33ARITH_TRANS_SINE_APPROX_BELOW_POSE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_APPROX_BELOW_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule23ARITH_TRANS_SINE_BOUNDSE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_BOUNDS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22ARITH_TRANS_SINE_SHIFTE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_SHIFT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule25ARITH_TRANS_SINE_SYMMETRYE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_SYMMETRY"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule27ARITH_TRANS_SINE_TANGENT_PIE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_TANGENT_PI"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule29ARITH_TRANS_SINE_TANGENT_ZEROE", "cvc5::internal::PfRule::ARITH_TRANS_SINE_TANGENT_ZERO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16ARITH_TRICHOTOMYE", "cvc5::internal::PfRule::ARITH_TRICHOTOMY"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22ARRAYS_EQ_RANGE_EXPANDE", "cvc5::internal::PfRule::ARRAYS_EQ_RANGE_EXPAND"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10ARRAYS_EXTE", "cvc5::internal::PfRule::ARRAYS_EXT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22ARRAYS_READ_OVER_WRITEE", "cvc5::internal::PfRule::ARRAYS_READ_OVER_WRITE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule24ARRAYS_READ_OVER_WRITE_1E", "cvc5::internal::PfRule::ARRAYS_READ_OVER_WRITE_1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule29ARRAYS_READ_OVER_WRITE_CONTRAE", "cvc5::internal::PfRule::ARRAYS_READ_OVER_WRITE_CONTRA"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule6ASSUMEE", "cvc5::internal::PfRule::ASSUME"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11BV_BITBLASTE", "cvc5::internal::PfRule::BV_BITBLAST"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16BV_BITBLAST_STEPE", "cvc5::internal::PfRule::BV_BITBLAST_STEP"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13BV_EAGER_ATOME", "cvc5::internal::PfRule::BV_EAGER_ATOM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16CHAIN_RESOLUTIONE", "cvc5::internal::PfRule::CHAIN_RESOLUTION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11CNF_AND_NEGE", "cvc5::internal::PfRule::CNF_AND_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11CNF_AND_POSE", "cvc5::internal::PfRule::CNF_AND_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14CNF_EQUIV_NEG1E", "cvc5::internal::PfRule::CNF_EQUIV_NEG1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14CNF_EQUIV_NEG2E", "cvc5::internal::PfRule::CNF_EQUIV_NEG2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14CNF_EQUIV_POS1E", "cvc5::internal::PfRule::CNF_EQUIV_POS1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14CNF_EQUIV_POS2E", "cvc5::internal::PfRule::CNF_EQUIV_POS2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16CNF_IMPLIES_NEG1E", "cvc5::internal::PfRule::CNF_IMPLIES_NEG1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16CNF_IMPLIES_NEG2E", "cvc5::internal::PfRule::CNF_IMPLIES_NEG2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15CNF_IMPLIES_POSE", "cvc5::internal::PfRule::CNF_IMPLIES_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_NEG1E", "cvc5::internal::PfRule::CNF_ITE_NEG1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_NEG2E", "cvc5::internal::PfRule::CNF_ITE_NEG2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_NEG3E", "cvc5::internal::PfRule::CNF_ITE_NEG3"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_POS1E", "cvc5::internal::PfRule::CNF_ITE_POS1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_POS2E", "cvc5::internal::PfRule::CNF_ITE_POS2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_ITE_POS3E", "cvc5::internal::PfRule::CNF_ITE_POS3"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10CNF_OR_NEGE", "cvc5::internal::PfRule::CNF_OR_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10CNF_OR_POSE", "cvc5::internal::PfRule::CNF_OR_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_XOR_NEG1E", "cvc5::internal::PfRule::CNF_XOR_NEG1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_XOR_NEG2E", "cvc5::internal::PfRule::CNF_XOR_NEG2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_XOR_POS1E", "cvc5::internal::PfRule::CNF_XOR_POS1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CNF_XOR_POS2E", "cvc5::internal::PfRule::CNF_XOR_POS2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15CONCAT_CONFLICTE", "cvc5::internal::PfRule::CONCAT_CONFLICT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CONCAT_CPROPE", "cvc5::internal::PfRule::CONCAT_CPROP"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13CONCAT_CSPLITE", "cvc5::internal::PfRule::CONCAT_CSPLIT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9CONCAT_EQE", "cvc5::internal::PfRule::CONCAT_EQ"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CONCAT_LPROPE", "cvc5::internal::PfRule::CONCAT_LPROP"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CONCAT_SPLITE", "cvc5::internal::PfRule::CONCAT_SPLIT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12CONCAT_UNIFYE", "cvc5::internal::PfRule::CONCAT_UNIFY"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule4CONGE", "cvc5::internal::PfRule::CONG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule6CONTRAE", "cvc5::internal::PfRule::CONTRA"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule8DT_CLASHE", "cvc5::internal::PfRule::DT_CLASH"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11DT_COLLAPSEE", "cvc5::internal::PfRule::DT_COLLAPSE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7DT_INSTE", "cvc5::internal::PfRule::DT_INST"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule8DT_SPLITE", "cvc5::internal::PfRule::DT_SPLIT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7DT_UNIFE", "cvc5::internal::PfRule::DT_UNIF"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11EQUIV_ELIM1E", "cvc5::internal::PfRule::EQUIV_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11EQUIV_ELIM2E", "cvc5::internal::PfRule::EQUIV_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10EQ_RESOLVEE", "cvc5::internal::PfRule::EQ_RESOLVE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule8EVALUATEE", "cvc5::internal::PfRule::EVALUATE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9FACTORINGE", "cvc5::internal::PfRule::FACTORING"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10FALSE_ELIME", "cvc5::internal::PfRule::FALSE_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11FALSE_INTROE", "cvc5::internal::PfRule::FALSE_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13HO_APP_ENCODEE", "cvc5::internal::PfRule::HO_APP_ENCODE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7HO_CONGE", "cvc5::internal::PfRule::HO_CONG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12IMPLIES_ELIME", "cvc5::internal::PfRule::IMPLIES_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11INSTANTIATEE", "cvc5::internal::PfRule::INSTANTIATE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12INT_TIGHT_LBE", "cvc5::internal::PfRule::INT_TIGHT_LB"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12INT_TIGHT_UBE", "cvc5::internal::PfRule::INT_TIGHT_UB"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9ITE_ELIM1E", "cvc5::internal::PfRule::ITE_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9ITE_ELIM2E", "cvc5::internal::PfRule::ITE_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9LFSC_RULEE", "cvc5::internal::PfRule::LFSC_RULE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule24MACRO_ARITH_SCALE_SUM_UBE", "cvc5::internal::PfRule::MACRO_ARITH_SCALE_SUM_UB"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16MACRO_RESOLUTIONE", "cvc5::internal::PfRule::MACRO_RESOLUTION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22MACRO_RESOLUTION_TRUSTE", "cvc5::internal::PfRule::MACRO_RESOLUTION_TRUST"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17MACRO_SR_EQ_INTROE", "cvc5::internal::PfRule::MACRO_SR_EQ_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule18MACRO_SR_PRED_ELIME", "cvc5::internal::PfRule::MACRO_SR_PRED_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule19MACRO_SR_PRED_INTROE", "cvc5::internal::PfRule::MACRO_SR_PRED_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule23MACRO_SR_PRED_TRANSFORME", "cvc5::internal::PfRule::MACRO_SR_PRED_TRANSFORM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12MODUS_PONENSE", "cvc5::internal::PfRule::MODUS_PONENS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7NOT_ANDE", "cvc5::internal::PfRule::NOT_AND"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15NOT_EQUIV_ELIM1E", "cvc5::internal::PfRule::NOT_EQUIV_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15NOT_EQUIV_ELIM2E", "cvc5::internal::PfRule::NOT_EQUIV_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17NOT_IMPLIES_ELIM1E", "cvc5::internal::PfRule::NOT_IMPLIES_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17NOT_IMPLIES_ELIM2E", "cvc5::internal::PfRule::NOT_IMPLIES_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13NOT_ITE_ELIM1E", "cvc5::internal::PfRule::NOT_ITE_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13NOT_ITE_ELIM2E", "cvc5::internal::PfRule::NOT_ITE_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12NOT_NOT_ELIME", "cvc5::internal::PfRule::NOT_NOT_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule11NOT_OR_ELIME", "cvc5::internal::PfRule::NOT_OR_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13NOT_XOR_ELIM1E", "cvc5::internal::PfRule::NOT_XOR_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13NOT_XOR_ELIM2E", "cvc5::internal::PfRule::NOT_XOR_ELIM2"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10PREPROCESSE", "cvc5::internal::PfRule::PREPROCESS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16PREPROCESS_LEMMAE", "cvc5::internal::PfRule::PREPROCESS_LEMMA"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22QUANTIFIERS_PREPROCESSE", "cvc5::internal::PfRule::QUANTIFIERS_PREPROCESS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule4REFLE", "cvc5::internal::PfRule::REFL"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule25REMOVE_TERM_FORMULA_AXIOME", "cvc5::internal::PfRule::REMOVE_TERM_FORMULA_AXIOM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10REORDERINGE", "cvc5::internal::PfRule::REORDERING"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10RESOLUTIONE", "cvc5::internal::PfRule::RESOLUTION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7REWRITEE", "cvc5::internal::PfRule::REWRITE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7RE_ELIME", "cvc5::internal::PfRule::RE_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule8RE_INTERE", "cvc5::internal::PfRule::RE_INTER"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13RE_UNFOLD_NEGE", "cvc5::internal::PfRule::RE_UNFOLD_NEG"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule26RE_UNFOLD_NEG_CONCAT_FIXEDE", "cvc5::internal::PfRule::RE_UNFOLD_NEG_CONCAT_FIXED"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13RE_UNFOLD_POSE", "cvc5::internal::PfRule::RE_UNFOLD_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14SAT_REFUTATIONE", "cvc5::internal::PfRule::SAT_REFUTATION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule5SCOPEE", "cvc5::internal::PfRule::SCOPE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9SKOLEMIZEE", "cvc5::internal::PfRule::SKOLEMIZE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12SKOLEM_INTROE", "cvc5::internal::PfRule::SKOLEM_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule5SPLITE", "cvc5::internal::PfRule::SPLIT"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule15STRING_CODE_INJE", "cvc5::internal::PfRule::STRING_CODE_INJ"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16STRING_DECOMPOSEE", "cvc5::internal::PfRule::STRING_DECOMPOSE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule22STRING_EAGER_REDUCTIONE", "cvc5::internal::PfRule::STRING_EAGER_REDUCTION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16STRING_INFERENCEE", "cvc5::internal::PfRule::STRING_INFERENCE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule23STRING_LENGTH_NON_EMPTYE", "cvc5::internal::PfRule::STRING_LENGTH_NON_EMPTY"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17STRING_LENGTH_POSE", "cvc5::internal::PfRule::STRING_LENGTH_POS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16STRING_REDUCTIONE", "cvc5::internal::PfRule::STRING_REDUCTION"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule19STRING_SEQ_UNIT_INJE", "cvc5::internal::PfRule::STRING_SEQ_UNIT_INJ"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule4SUBSE", "cvc5::internal::PfRule::SUBS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule4SYMME", "cvc5::internal::PfRule::SYMM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17THEORY_EXPAND_DEFE", "cvc5::internal::PfRule::THEORY_EXPAND_DEF"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule16THEORY_INFERENCEE", "cvc5::internal::PfRule::THEORY_INFERENCE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule12THEORY_LEMMAE", "cvc5::internal::PfRule::THEORY_LEMMA"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule17THEORY_PREPROCESSE", "cvc5::internal::PfRule::THEORY_PREPROCESS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule23THEORY_PREPROCESS_LEMMAE", "cvc5::internal::PfRule::THEORY_PREPROCESS_LEMMA"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14THEORY_REWRITEE", "cvc5::internal::PfRule::THEORY_REWRITE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule5TRANSE", "cvc5::internal::PfRule::TRANS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9TRUE_ELIME", "cvc5::internal::PfRule::TRUE_ELIM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10TRUE_INTROE", "cvc5::internal::PfRule::TRUE_INTRO"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13TRUST_REWRITEE", "cvc5::internal::PfRule::TRUST_REWRITE"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule10TRUST_SUBSE", "cvc5::internal::PfRule::TRUST_SUBS"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13TRUST_SUBS_EQE", "cvc5::internal::PfRule::TRUST_SUBS_EQ"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule14TRUST_SUBS_MAPE", "cvc5::internal::PfRule::TRUST_SUBS_MAP"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule7UNKNOWNE", "cvc5::internal::PfRule::UNKNOWN"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule13WITNESS_AXIOME", "cvc5::internal::PfRule::WITNESS_AXIOM"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9XOR_ELIM1E", "cvc5::internal::PfRule::XOR_ELIM1"], [86, 0, 1, "_CPPv4N4cvc58internal6PfRule9XOR_ELIM2E", "cvc5::internal::PfRule::XOR_ELIM2"], [11, 4, 1, "_CPPv4N4cvc55modesE", "cvc5::modes"], [11, 5, 1, "_CPPv4N4cvc55modes15BlockModelsModeE", "cvc5::modes::BlockModelsMode"], [11, 0, 1, "_CPPv4N4cvc55modes15BlockModelsMode8LITERALSE", "cvc5::modes::BlockModelsMode::LITERALS"], [11, 0, 1, "_CPPv4N4cvc55modes15BlockModelsMode6VALUESE", "cvc5::modes::BlockModelsMode::VALUES"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType25LEARNED_LIT_CONSTANT_PROPE", "cvc5::modes::LEARNED_LIT_CONSTANT_PROP"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType17LEARNED_LIT_INPUTE", "cvc5::modes::LEARNED_LIT_INPUT"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType20LEARNED_LIT_INTERNALE", "cvc5::modes::LEARNED_LIT_INTERNAL"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType22LEARNED_LIT_PREPROCESSE", "cvc5::modes::LEARNED_LIT_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType29LEARNED_LIT_PREPROCESS_SOLVEDE", "cvc5::modes::LEARNED_LIT_PREPROCESS_SOLVED"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType20LEARNED_LIT_SOLVABLEE", "cvc5::modes::LEARNED_LIT_SOLVABLE"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType19LEARNED_LIT_UNKNOWNE", "cvc5::modes::LEARNED_LIT_UNKNOWN"], [11, 0, 1, "_CPPv4N4cvc55modes15BlockModelsMode8LITERALSE", "cvc5::modes::LITERALS"], [11, 5, 1, "_CPPv4N4cvc55modes14LearnedLitTypeE", "cvc5::modes::LearnedLitType"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType25LEARNED_LIT_CONSTANT_PROPE", "cvc5::modes::LearnedLitType::LEARNED_LIT_CONSTANT_PROP"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType17LEARNED_LIT_INPUTE", "cvc5::modes::LearnedLitType::LEARNED_LIT_INPUT"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType20LEARNED_LIT_INTERNALE", "cvc5::modes::LearnedLitType::LEARNED_LIT_INTERNAL"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType22LEARNED_LIT_PREPROCESSE", "cvc5::modes::LearnedLitType::LEARNED_LIT_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType29LEARNED_LIT_PREPROCESS_SOLVEDE", "cvc5::modes::LearnedLitType::LEARNED_LIT_PREPROCESS_SOLVED"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType20LEARNED_LIT_SOLVABLEE", "cvc5::modes::LearnedLitType::LEARNED_LIT_SOLVABLE"], [11, 0, 1, "_CPPv4N4cvc55modes14LearnedLitType19LEARNED_LIT_UNKNOWNE", "cvc5::modes::LearnedLitType::LEARNED_LIT_UNKNOWN"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent20PROOF_COMPONENT_FULLE", "cvc5::modes::PROOF_COMPONENT_FULL"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent26PROOF_COMPONENT_PREPROCESSE", "cvc5::modes::PROOF_COMPONENT_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent30PROOF_COMPONENT_RAW_PREPROCESSE", "cvc5::modes::PROOF_COMPONENT_RAW_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent19PROOF_COMPONENT_SATE", "cvc5::modes::PROOF_COMPONENT_SAT"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent29PROOF_COMPONENT_THEORY_LEMMASE", "cvc5::modes::PROOF_COMPONENT_THEORY_LEMMAS"], [11, 5, 1, "_CPPv4N4cvc55modes14ProofComponentE", "cvc5::modes::ProofComponent"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent20PROOF_COMPONENT_FULLE", "cvc5::modes::ProofComponent::PROOF_COMPONENT_FULL"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent26PROOF_COMPONENT_PREPROCESSE", "cvc5::modes::ProofComponent::PROOF_COMPONENT_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent30PROOF_COMPONENT_RAW_PREPROCESSE", "cvc5::modes::ProofComponent::PROOF_COMPONENT_RAW_PREPROCESS"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent19PROOF_COMPONENT_SATE", "cvc5::modes::ProofComponent::PROOF_COMPONENT_SAT"], [11, 0, 1, "_CPPv4N4cvc55modes14ProofComponent29PROOF_COMPONENT_THEORY_LEMMASE", "cvc5::modes::ProofComponent::PROOF_COMPONENT_THEORY_LEMMAS"], [11, 0, 1, "_CPPv4N4cvc55modes15BlockModelsMode6VALUESE", "cvc5::modes::VALUES"], [11, 2, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14LearnedLitType", "cvc5::modes::operator<<"], [11, 2, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14ProofComponent", "cvc5::modes::operator<<"], [11, 3, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14LearnedLitType", "cvc5::modes::operator<<::ltype"], [11, 3, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14LearnedLitType", "cvc5::modes::operator<<::out"], [11, 3, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14ProofComponent", "cvc5::modes::operator<<::out"], [11, 3, 1, "_CPPv4N4cvc55modeslsERNSt7ostreamE14ProofComponent", "cvc5::modes::operator<<::pc"], [18, 2, 1, "_CPPv4N4cvc5lsERNSt7ostreamERK4Sort", "cvc5::operator<<"], [18, 3, 1, "_CPPv4N4cvc5lsERNSt7ostreamERK4Sort", "cvc5::operator<<::out"], [18, 3, 1, "_CPPv4N4cvc5lsERNSt7ostreamERK4Sort", "cvc5::operator<<::s"], [10, 1, 1, "_CPPv4IENSt4hashIN4cvc54KindEEE", "std::hash<cvc5::Kind>"], [10, 2, 1, "_CPPv4NKSt4hashIN4cvc54KindEEclEN4cvc54KindE", "std::hash<cvc5::Kind>::operator()"], [10, 3, 1, "_CPPv4NKSt4hashIN4cvc54KindEEclEN4cvc54KindE", "std::hash<cvc5::Kind>::operator()::k"], [12, 1, 1, "_CPPv4IENSt4hashIN4cvc52OpEEE", "std::hash<cvc5::Op>"], [12, 2, 1, "_CPPv4NKSt4hashIN4cvc52OpEEclERKN4cvc52OpE", "std::hash<cvc5::Op>::operator()"], [12, 3, 1, "_CPPv4NKSt4hashIN4cvc52OpEEclERKN4cvc52OpE", "std::hash<cvc5::Op>::operator()::t"], [18, 1, 1, "_CPPv4IENSt4hashIN4cvc54SortEEE", "std::hash<cvc5::Sort>"], [18, 2, 1, "_CPPv4NKSt4hashIN4cvc54SortEEclERKN4cvc54SortE", "std::hash<cvc5::Sort>::operator()"], [18, 3, 1, "_CPPv4NKSt4hashIN4cvc54SortEEclERKN4cvc54SortE", "std::hash<cvc5::Sort>::operator()::s"], [21, 1, 1, "_CPPv4IENSt4hashIN4cvc54TermEEE", "std::hash<cvc5::Term>"], [21, 2, 1, "_CPPv4NKSt4hashIN4cvc54TermEEclERKN4cvc54TermE", "std::hash<cvc5::Term>::operator()"], [21, 3, 1, "_CPPv4NKSt4hashIN4cvc54TermEEclERKN4cvc54TermE", "std::hash<cvc5::Term>::operator()::t"]], "cvc5": [[26, 8, 1, "", "Datatype"], [27, 8, 1, "", "DatatypeConstructor"], [28, 8, 1, "", "DatatypeConstructorDecl"], [29, 8, 1, "", "DatatypeDecl"], [30, 8, 1, "", "DatatypeSelector"], [31, 8, 1, "", "Grammar"], [32, 8, 1, "", "Kind"], [33, 8, 1, "", "Op"], [36, 8, 1, "", "Result"], [37, 8, 1, "", "RoundingMode"], [38, 8, 1, "", "Solver"], [39, 8, 1, "", "Sort"], [40, 8, 1, "", "Statistics"], [41, 8, 1, "", "SynthResult"], [42, 8, 1, "", "Term"], [43, 8, 1, "", "UnknownExplanation"]], "cvc5.Datatype": [[26, 9, 1, "", "__getitem__"], [26, 9, 1, "", "__iter__"], [26, 9, 1, "", "getConstructor"], [26, 9, 1, "", "getName"], [26, 9, 1, "", "getNumConstructors"], [26, 9, 1, "", "getParameters"], [26, 9, 1, "", "getSelector"], [26, 9, 1, "", "isCodatatype"], [26, 9, 1, "", "isFinite"], [26, 9, 1, "", "isNull"], [26, 9, 1, "", "isParametric"], [26, 9, 1, "", "isRecord"], [26, 9, 1, "", "isTuple"], [26, 9, 1, "", "isWellFounded"]], "cvc5.DatatypeConstructor": [[27, 9, 1, "", "__getitem__"], [27, 9, 1, "", "__iter__"], [27, 9, 1, "", "getInstantiatedTerm"], [27, 9, 1, "", "getName"], [27, 9, 1, "", "getNumSelectors"], [27, 9, 1, "", "getSelector"], [27, 9, 1, "", "getTerm"], [27, 9, 1, "", "getTesterTerm"], [27, 9, 1, "", "isNull"]], "cvc5.DatatypeConstructorDecl": [[28, 9, 1, "", "addSelector"], [28, 9, 1, "", "addSelectorSelf"], [28, 9, 1, "", "addSelectorUnresolved"], [28, 9, 1, "", "isNull"]], "cvc5.DatatypeDecl": [[29, 9, 1, "", "addConstructor"], [29, 9, 1, "", "getName"], [29, 9, 1, "", "getNumConstructors"], [29, 9, 1, "", "isNull"], [29, 9, 1, "", "isParametric"]], "cvc5.DatatypeSelector": [[30, 9, 1, "", "getCodomainSort"], [30, 9, 1, "", "getName"], [30, 9, 1, "", "getTerm"], [30, 9, 1, "", "getUpdaterTerm"], [30, 9, 1, "", "isNull"]], "cvc5.Grammar": [[31, 9, 1, "", "addAnyConstant"], [31, 9, 1, "", "addAnyVariable"], [31, 9, 1, "", "addRule"], [31, 9, 1, "", "addRules"]], "cvc5.Kind": [[32, 10, 1, "", "ABS"], [32, 10, 1, "", "ADD"], [32, 10, 1, "", "AND"], [32, 10, 1, "", "APPLY_CONSTRUCTOR"], [32, 10, 1, "", "APPLY_SELECTOR"], [32, 10, 1, "", "APPLY_TESTER"], [32, 10, 1, "", "APPLY_UF"], [32, 10, 1, "", "APPLY_UPDATER"], [32, 10, 1, "", "ARCCOSECANT"], [32, 10, 1, "", "ARCCOSINE"], [32, 10, 1, "", "ARCCOTANGENT"], [32, 10, 1, "", "ARCSECANT"], [32, 10, 1, "", "ARCSINE"], [32, 10, 1, "", "ARCTANGENT"], [32, 10, 1, "", "BAG_CARD"], [32, 10, 1, "", "BAG_CHOOSE"], [32, 10, 1, "", "BAG_COUNT"], [32, 10, 1, "", "BAG_DIFFERENCE_REMOVE"], [32, 10, 1, "", "BAG_DIFFERENCE_SUBTRACT"], [32, 10, 1, "", "BAG_DUPLICATE_REMOVAL"], [32, 10, 1, "", "BAG_EMPTY"], [32, 10, 1, "", "BAG_FILTER"], [32, 10, 1, "", "BAG_FOLD"], [32, 10, 1, "", "BAG_FROM_SET"], [32, 10, 1, "", "BAG_INTER_MIN"], [32, 10, 1, "", "BAG_IS_SINGLETON"], [32, 10, 1, "", "BAG_MAKE"], [32, 10, 1, "", "BAG_MAP"], [32, 10, 1, "", "BAG_MEMBER"], [32, 10, 1, "", "BAG_PARTITION"], [32, 10, 1, "", "BAG_SUBBAG"], [32, 10, 1, "", "BAG_TO_SET"], [32, 10, 1, "", "BAG_UNION_DISJOINT"], [32, 10, 1, "", "BAG_UNION_MAX"], [32, 10, 1, "", "BITVECTOR_ADD"], [32, 10, 1, "", "BITVECTOR_AND"], [32, 10, 1, "", "BITVECTOR_ASHR"], [32, 10, 1, "", "BITVECTOR_COMP"], [32, 10, 1, "", "BITVECTOR_CONCAT"], [32, 10, 1, "", "BITVECTOR_EXTRACT"], [32, 10, 1, "", "BITVECTOR_ITE"], [32, 10, 1, "", "BITVECTOR_LSHR"], [32, 10, 1, "", "BITVECTOR_MULT"], [32, 10, 1, "", "BITVECTOR_NAND"], [32, 10, 1, "", "BITVECTOR_NEG"], [32, 10, 1, "", "BITVECTOR_NOR"], [32, 10, 1, "", "BITVECTOR_NOT"], [32, 10, 1, "", "BITVECTOR_OR"], [32, 10, 1, "", "BITVECTOR_REDAND"], [32, 10, 1, "", "BITVECTOR_REDOR"], [32, 10, 1, "", "BITVECTOR_REPEAT"], [32, 10, 1, "", "BITVECTOR_ROTATE_LEFT"], [32, 10, 1, "", "BITVECTOR_ROTATE_RIGHT"], [32, 10, 1, "", "BITVECTOR_SDIV"], [32, 10, 1, "", "BITVECTOR_SGE"], [32, 10, 1, "", "BITVECTOR_SGT"], [32, 10, 1, "", "BITVECTOR_SHL"], [32, 10, 1, "", "BITVECTOR_SIGN_EXTEND"], [32, 10, 1, "", "BITVECTOR_SLE"], [32, 10, 1, "", "BITVECTOR_SLT"], [32, 10, 1, "", "BITVECTOR_SLTBV"], [32, 10, 1, "", "BITVECTOR_SMOD"], [32, 10, 1, "", "BITVECTOR_SREM"], [32, 10, 1, "", "BITVECTOR_SUB"], [32, 10, 1, "", "BITVECTOR_TO_NAT"], [32, 10, 1, "", "BITVECTOR_UDIV"], [32, 10, 1, "", "BITVECTOR_UGE"], [32, 10, 1, "", "BITVECTOR_UGT"], [32, 10, 1, "", "BITVECTOR_ULE"], [32, 10, 1, "", "BITVECTOR_ULT"], [32, 10, 1, "", "BITVECTOR_ULTBV"], [32, 10, 1, "", "BITVECTOR_UREM"], [32, 10, 1, "", "BITVECTOR_XNOR"], [32, 10, 1, "", "BITVECTOR_XOR"], [32, 10, 1, "", "BITVECTOR_ZERO_EXTEND"], [32, 10, 1, "", "CARDINALITY_CONSTRAINT"], [32, 10, 1, "", "CONSTANT"], [32, 10, 1, "", "CONST_ARRAY"], [32, 10, 1, "", "CONST_BITVECTOR"], [32, 10, 1, "", "CONST_BOOLEAN"], [32, 10, 1, "", "CONST_FLOATINGPOINT"], [32, 10, 1, "", "CONST_INTEGER"], [32, 10, 1, "", "CONST_RATIONAL"], [32, 10, 1, "", "CONST_ROUNDINGMODE"], [32, 10, 1, "", "CONST_SEQUENCE"], [32, 10, 1, "", "CONST_STRING"], [32, 10, 1, "", "COSECANT"], [32, 10, 1, "", "COSINE"], [32, 10, 1, "", "COTANGENT"], [32, 10, 1, "", "DISTINCT"], [32, 10, 1, "", "DIVISIBLE"], [32, 10, 1, "", "DIVISION"], [32, 10, 1, "", "EQUAL"], [32, 10, 1, "", "EQ_RANGE"], [32, 10, 1, "", "EXISTS"], [32, 10, 1, "", "EXPONENTIAL"], [32, 10, 1, "", "FLOATINGPOINT_ABS"], [32, 10, 1, "", "FLOATINGPOINT_ADD"], [32, 10, 1, "", "FLOATINGPOINT_DIV"], [32, 10, 1, "", "FLOATINGPOINT_EQ"], [32, 10, 1, "", "FLOATINGPOINT_FMA"], [32, 10, 1, "", "FLOATINGPOINT_FP"], [32, 10, 1, "", "FLOATINGPOINT_GEQ"], [32, 10, 1, "", "FLOATINGPOINT_GT"], [32, 10, 1, "", "FLOATINGPOINT_IS_INF"], [32, 10, 1, "", "FLOATINGPOINT_IS_NAN"], [32, 10, 1, "", "FLOATINGPOINT_IS_NEG"], [32, 10, 1, "", "FLOATINGPOINT_IS_NORMAL"], [32, 10, 1, "", "FLOATINGPOINT_IS_POS"], [32, 10, 1, "", "FLOATINGPOINT_IS_SUBNORMAL"], [32, 10, 1, "", "FLOATINGPOINT_IS_ZERO"], [32, 10, 1, "", "FLOATINGPOINT_LEQ"], [32, 10, 1, "", "FLOATINGPOINT_LT"], [32, 10, 1, "", "FLOATINGPOINT_MAX"], [32, 10, 1, "", "FLOATINGPOINT_MIN"], [32, 10, 1, "", "FLOATINGPOINT_MULT"], [32, 10, 1, "", "FLOATINGPOINT_NEG"], [32, 10, 1, "", "FLOATINGPOINT_REM"], [32, 10, 1, "", "FLOATINGPOINT_RTI"], [32, 10, 1, "", "FLOATINGPOINT_SQRT"], [32, 10, 1, "", "FLOATINGPOINT_SUB"], [32, 10, 1, "", "FLOATINGPOINT_TO_FP_FROM_FP"], [32, 10, 1, "", "FLOATINGPOINT_TO_FP_FROM_IEEE_BV"], [32, 10, 1, "", "FLOATINGPOINT_TO_FP_FROM_REAL"], [32, 10, 1, "", "FLOATINGPOINT_TO_FP_FROM_SBV"], [32, 10, 1, "", "FLOATINGPOINT_TO_FP_FROM_UBV"], [32, 10, 1, "", "FLOATINGPOINT_TO_REAL"], [32, 10, 1, "", "FLOATINGPOINT_TO_SBV"], [32, 10, 1, "", "FLOATINGPOINT_TO_UBV"], [32, 10, 1, "", "FORALL"], [32, 10, 1, "", "GEQ"], [32, 10, 1, "", "GT"], [32, 10, 1, "", "HO_APPLY"], [32, 10, 1, "", "IAND"], [32, 10, 1, "", "IMPLIES"], [32, 10, 1, "", "INST_ADD_TO_POOL"], [32, 10, 1, "", "INST_ATTRIBUTE"], [32, 10, 1, "", "INST_NO_PATTERN"], [32, 10, 1, "", "INST_PATTERN"], [32, 10, 1, "", "INST_PATTERN_LIST"], [32, 10, 1, "", "INST_POOL"], [32, 10, 1, "", "INTERNAL_KIND"], [32, 10, 1, "", "INTS_DIVISION"], [32, 10, 1, "", "INTS_MODULUS"], [32, 10, 1, "", "INT_TO_BITVECTOR"], [32, 10, 1, "", "IS_INTEGER"], [32, 10, 1, "", "ITE"], [32, 10, 1, "", "LAMBDA"], [32, 10, 1, "", "LAST_KIND"], [32, 10, 1, "", "LEQ"], [32, 10, 1, "", "LT"], [32, 10, 1, "", "MATCH"], [32, 10, 1, "", "MATCH_BIND_CASE"], [32, 10, 1, "", "MATCH_CASE"], [32, 10, 1, "", "MULT"], [32, 10, 1, "", "NEG"], [32, 10, 1, "", "NOT"], [32, 10, 1, "", "NULL_TERM"], [32, 10, 1, "", "OR"], [32, 10, 1, "", "PI"], [32, 10, 1, "", "POW"], [32, 10, 1, "", "POW2"], [32, 10, 1, "", "REGEXP_ALL"], [32, 10, 1, "", "REGEXP_ALLCHAR"], [32, 10, 1, "", "REGEXP_COMPLEMENT"], [32, 10, 1, "", "REGEXP_CONCAT"], [32, 10, 1, "", "REGEXP_DIFF"], [32, 10, 1, "", "REGEXP_INTER"], [32, 10, 1, "", "REGEXP_LOOP"], [32, 10, 1, "", "REGEXP_NONE"], [32, 10, 1, "", "REGEXP_OPT"], [32, 10, 1, "", "REGEXP_PLUS"], [32, 10, 1, "", "REGEXP_RANGE"], [32, 10, 1, "", "REGEXP_REPEAT"], [32, 10, 1, "", "REGEXP_STAR"], [32, 10, 1, "", "REGEXP_UNION"], [32, 10, 1, "", "RELATION_AGGREGATE"], [32, 10, 1, "", "RELATION_GROUP"], [32, 10, 1, "", "RELATION_IDEN"], [32, 10, 1, "", "RELATION_JOIN"], [32, 10, 1, "", "RELATION_JOIN_IMAGE"], [32, 10, 1, "", "RELATION_PRODUCT"], [32, 10, 1, "", "RELATION_PROJECT"], [32, 10, 1, "", "RELATION_TCLOSURE"], [32, 10, 1, "", "RELATION_TRANSPOSE"], [32, 10, 1, "", "SECANT"], [32, 10, 1, "", "SELECT"], [32, 10, 1, "", "SEP_EMP"], [32, 10, 1, "", "SEP_NIL"], [32, 10, 1, "", "SEP_PTO"], [32, 10, 1, "", "SEP_STAR"], [32, 10, 1, "", "SEP_WAND"], [32, 10, 1, "", "SEQ_AT"], [32, 10, 1, "", "SEQ_CONCAT"], [32, 10, 1, "", "SEQ_CONTAINS"], [32, 10, 1, "", "SEQ_EXTRACT"], [32, 10, 1, "", "SEQ_INDEXOF"], [32, 10, 1, "", "SEQ_LENGTH"], [32, 10, 1, "", "SEQ_NTH"], [32, 10, 1, "", "SEQ_PREFIX"], [32, 10, 1, "", "SEQ_REPLACE"], [32, 10, 1, "", "SEQ_REPLACE_ALL"], [32, 10, 1, "", "SEQ_REV"], [32, 10, 1, "", "SEQ_SUFFIX"], [32, 10, 1, "", "SEQ_UNIT"], [32, 10, 1, "", "SEQ_UPDATE"], [32, 10, 1, "", "SET_CARD"], [32, 10, 1, "", "SET_CHOOSE"], [32, 10, 1, "", "SET_COMPLEMENT"], [32, 10, 1, "", "SET_COMPREHENSION"], [32, 10, 1, "", "SET_EMPTY"], [32, 10, 1, "", "SET_FILTER"], [32, 10, 1, "", "SET_FOLD"], [32, 10, 1, "", "SET_INSERT"], [32, 10, 1, "", "SET_INTER"], [32, 10, 1, "", "SET_IS_SINGLETON"], [32, 10, 1, "", "SET_MAP"], [32, 10, 1, "", "SET_MEMBER"], [32, 10, 1, "", "SET_MINUS"], [32, 10, 1, "", "SET_SINGLETON"], [32, 10, 1, "", "SET_SUBSET"], [32, 10, 1, "", "SET_UNION"], [32, 10, 1, "", "SET_UNIVERSE"], [32, 10, 1, "", "SEXPR"], [32, 10, 1, "", "SINE"], [32, 10, 1, "", "SKOLEM_ADD_TO_POOL"], [32, 10, 1, "", "SQRT"], [32, 10, 1, "", "STORE"], [32, 10, 1, "", "STRING_CHARAT"], [32, 10, 1, "", "STRING_CONCAT"], [32, 10, 1, "", "STRING_CONTAINS"], [32, 10, 1, "", "STRING_FROM_CODE"], [32, 10, 1, "", "STRING_FROM_INT"], [32, 10, 1, "", "STRING_INDEXOF"], [32, 10, 1, "", "STRING_INDEXOF_RE"], [32, 10, 1, "", "STRING_IN_REGEXP"], [32, 10, 1, "", "STRING_IS_DIGIT"], [32, 10, 1, "", "STRING_LENGTH"], [32, 10, 1, "", "STRING_LEQ"], [32, 10, 1, "", "STRING_LT"], [32, 10, 1, "", "STRING_PREFIX"], [32, 10, 1, "", "STRING_REPLACE"], [32, 10, 1, "", "STRING_REPLACE_ALL"], [32, 10, 1, "", "STRING_REPLACE_RE"], [32, 10, 1, "", "STRING_REPLACE_RE_ALL"], [32, 10, 1, "", "STRING_REV"], [32, 10, 1, "", "STRING_SUBSTR"], [32, 10, 1, "", "STRING_SUFFIX"], [32, 10, 1, "", "STRING_TO_CODE"], [32, 10, 1, "", "STRING_TO_INT"], [32, 10, 1, "", "STRING_TO_LOWER"], [32, 10, 1, "", "STRING_TO_REGEXP"], [32, 10, 1, "", "STRING_TO_UPPER"], [32, 10, 1, "", "STRING_UPDATE"], [32, 10, 1, "", "SUB"], [32, 10, 1, "", "TABLE_AGGREGATE"], [32, 10, 1, "", "TABLE_GROUP"], [32, 10, 1, "", "TABLE_JOIN"], [32, 10, 1, "", "TABLE_PRODUCT"], [32, 10, 1, "", "TABLE_PROJECT"], [32, 10, 1, "", "TANGENT"], [32, 10, 1, "", "TO_INTEGER"], [32, 10, 1, "", "TO_REAL"], [32, 10, 1, "", "TUPLE_PROJECT"], [32, 10, 1, "", "UNDEFINED_KIND"], [32, 10, 1, "", "UNINTERPRETED_SORT_VALUE"], [32, 10, 1, "", "VARIABLE"], [32, 10, 1, "", "VARIABLE_LIST"], [32, 10, 1, "", "WITNESS"], [32, 10, 1, "", "XOR"]], "cvc5.Op": [[33, 9, 1, "", "__getitem__"], [33, 9, 1, "", "getKind"], [33, 9, 1, "", "getNumIndices"], [33, 9, 1, "", "isIndexed"], [33, 9, 1, "", "isNull"]], "cvc5.Result": [[36, 9, 1, "", "getUnknownExplanation"], [36, 9, 1, "", "isNull"], [36, 9, 1, "", "isSat"], [36, 9, 1, "", "isUnknown"], [36, 9, 1, "", "isUnsat"]], "cvc5.RoundingMode": [[37, 10, 1, "", "ROUND_NEAREST_TIES_TO_AWAY"], [37, 10, 1, "", "ROUND_NEAREST_TIES_TO_EVEN"], [37, 10, 1, "", "ROUND_TOWARD_NEGATIVE"], [37, 10, 1, "", "ROUND_TOWARD_POSITIVE"], [37, 10, 1, "", "ROUND_TOWARD_ZERO"]], "cvc5.Solver": [[38, 9, 1, "", "addSygusAssume"], [38, 9, 1, "", "addSygusConstraint"], [38, 9, 1, "", "addSygusInvConstraint"], [38, 9, 1, "", "assertFormula"], [38, 9, 1, "", "blockModel"], [38, 9, 1, "", "blockModelValues"], [38, 9, 1, "", "checkSat"], [38, 9, 1, "", "checkSatAssuming"], [38, 9, 1, "", "checkSynth"], [38, 9, 1, "", "checkSynthNext"], [38, 9, 1, "", "declareDatatype"], [38, 9, 1, "", "declareFun"], [38, 9, 1, "", "declarePool"], [38, 9, 1, "", "declareSepHeap"], [38, 9, 1, "", "declareSort"], [38, 9, 1, "", "declareSygusVar"], [38, 9, 1, "", "defineFun"], [38, 9, 1, "", "defineFunRec"], [38, 9, 1, "", "defineFunsRec"], [38, 9, 1, "", "getAbduct"], [38, 9, 1, "", "getAbductNext"], [38, 9, 1, "", "getAssertions"], [38, 9, 1, "", "getBooleanSort"], [38, 9, 1, "", "getDifficulty"], [38, 9, 1, "", "getInfo"], [38, 9, 1, "", "getInstantiations"], [38, 9, 1, "", "getIntegerSort"], [38, 9, 1, "", "getInterpolant"], [38, 9, 1, "", "getInterpolantNext"], [38, 9, 1, "", "getLearnedLiterals"], [38, 9, 1, "", "getModel"], [38, 9, 1, "", "getModelDomainElements"], [38, 9, 1, "", "getNullSort"], [38, 9, 1, "", "getOption"], [38, 9, 1, "", "getOptionInfo"], [38, 9, 1, "", "getOptionNames"], [38, 9, 1, "", "getProof"], [38, 9, 1, "", "getQuantifierElimination"], [38, 9, 1, "", "getQuantifierEliminationDisjunct"], [38, 9, 1, "", "getRealSort"], [38, 9, 1, "", "getRegExpSort"], [38, 9, 1, "", "getRoundingModeSort"], [38, 9, 1, "", "getStatistics"], [38, 9, 1, "", "getStringSort"], [38, 9, 1, "", "getSynthSolution"], [38, 9, 1, "", "getSynthSolutions"], [38, 9, 1, "", "getUnsatAssumptions"], [38, 9, 1, "", "getUnsatCore"], [38, 9, 1, "", "getValue"], [38, 9, 1, "", "getValueSepHeap"], [38, 9, 1, "", "getValueSepNil"], [38, 9, 1, "", "isModelCoreSymbol"], [38, 9, 1, "", "mkArraySort"], [38, 9, 1, "", "mkBagSort"], [38, 9, 1, "", "mkBitVector"], [38, 9, 1, "", "mkBitVectorSort"], [38, 9, 1, "", "mkBoolean"], [38, 9, 1, "", "mkCardinalityConstraint"], [38, 9, 1, "", "mkConst"], [38, 9, 1, "", "mkConstArray"], [38, 9, 1, "", "mkDatatypeConstructorDecl"], [38, 9, 1, "", "mkDatatypeDecl"], [38, 9, 1, "", "mkDatatypeSort"], [38, 9, 1, "", "mkDatatypeSorts"], [38, 9, 1, "", "mkEmptyBag"], [38, 9, 1, "", "mkEmptySequence"], [38, 9, 1, "", "mkEmptySet"], [38, 9, 1, "", "mkFalse"], [38, 9, 1, "", "mkFloatingPoint"], [38, 9, 1, "", "mkFloatingPointNaN"], [38, 9, 1, "", "mkFloatingPointNegInf"], [38, 9, 1, "", "mkFloatingPointNegZero"], [38, 9, 1, "", "mkFloatingPointPosInf"], [38, 9, 1, "", "mkFloatingPointPosZero"], [38, 9, 1, "", "mkFloatingPointSort"], [38, 9, 1, "", "mkFunctionSort"], [38, 9, 1, "", "mkGrammar"], [38, 9, 1, "", "mkInteger"], [38, 9, 1, "", "mkOp"], [38, 9, 1, "", "mkParamSort"], [38, 9, 1, "", "mkPi"], [38, 9, 1, "", "mkPredicateSort"], [38, 9, 1, "", "mkReal"], [38, 9, 1, "", "mkRecordSort"], [38, 9, 1, "", "mkRegexpAll"], [38, 9, 1, "", "mkRegexpAllchar"], [38, 9, 1, "", "mkRegexpNone"], [38, 9, 1, "", "mkRoundingMode"], [38, 9, 1, "", "mkSepEmp"], [38, 9, 1, "", "mkSepNil"], [38, 9, 1, "", "mkSequenceSort"], [38, 9, 1, "", "mkSetSort"], [38, 9, 1, "", "mkString"], [38, 9, 1, "", "mkTerm"], [38, 9, 1, "", "mkTrue"], [38, 9, 1, "", "mkTuple"], [38, 9, 1, "", "mkTupleSort"], [38, 9, 1, "", "mkUninterpretedSort"], [38, 9, 1, "", "mkUninterpretedSortConstructorSort"], [38, 9, 1, "", "mkUniverseSet"], [38, 9, 1, "", "mkUnresolvedDatatypeSort"], [38, 9, 1, "", "mkVar"], [38, 9, 1, "", "pop"], [38, 9, 1, "", "push"], [38, 9, 1, "", "resetAssertions"], [38, 9, 1, "", "setInfo"], [38, 9, 1, "", "setLogic"], [38, 9, 1, "", "setOption"], [38, 9, 1, "", "simplify"], [38, 9, 1, "", "synthFun"], [38, 9, 1, "", "synthInv"]], "cvc5.Sort": [[39, 9, 1, "", "getArrayElementSort"], [39, 9, 1, "", "getArrayIndexSort"], [39, 9, 1, "", "getBagElementSort"], [39, 9, 1, "", "getBitVectorSize"], [39, 9, 1, "", "getDatatype"], [39, 9, 1, "", "getDatatypeArity"], [39, 9, 1, "", "getDatatypeConstructorArity"], [39, 9, 1, "", "getDatatypeConstructorCodomainSort"], [39, 9, 1, "", "getDatatypeConstructorDomainSorts"], [39, 9, 1, "", "getDatatypeSelectorCodomainSort"], [39, 9, 1, "", "getDatatypeSelectorDomainSort"], [39, 9, 1, "", "getDatatypeTesterCodomainSort"], [39, 9, 1, "", "getDatatypeTesterDomainSort"], [39, 9, 1, "", "getFloatingPointExponentSize"], [39, 9, 1, "", "getFloatingPointSignificandSize"], [39, 9, 1, "", "getFunctionArity"], [39, 9, 1, "", "getFunctionCodomainSort"], [39, 9, 1, "", "getFunctionDomainSorts"], [39, 9, 1, "", "getInstantiatedParameters"], [39, 9, 1, "", "getSequenceElementSort"], [39, 9, 1, "", "getSetElementSort"], [39, 9, 1, "", "getSymbol"], [39, 9, 1, "", "getTupleLength"], [39, 9, 1, "", "getTupleSorts"], [39, 9, 1, "", "getUninterpretedSortConstructor"], [39, 9, 1, "", "getUninterpretedSortConstructorArity"], [39, 9, 1, "", "hasSymbol"], [39, 9, 1, "", "instantiate"], [39, 9, 1, "", "isArray"], [39, 9, 1, "", "isBag"], [39, 9, 1, "", "isBitVector"], [39, 9, 1, "", "isBoolean"], [39, 9, 1, "", "isDatatype"], [39, 9, 1, "", "isDatatypeConstructor"], [39, 9, 1, "", "isDatatypeSelector"], [39, 9, 1, "", "isDatatypeTester"], [39, 9, 1, "", "isDatatypeUpdater"], [39, 9, 1, "", "isFloatingPoint"], [39, 9, 1, "", "isFunction"], [39, 9, 1, "", "isInstantiated"], [39, 9, 1, "", "isInteger"], [39, 9, 1, "", "isNull"], [39, 9, 1, "", "isPredicate"], [39, 9, 1, "", "isReal"], [39, 9, 1, "", "isRecord"], [39, 9, 1, "", "isRegExp"], [39, 9, 1, "", "isRoundingMode"], [39, 9, 1, "", "isSequence"], [39, 9, 1, "", "isSet"], [39, 9, 1, "", "isString"], [39, 9, 1, "", "isTuple"], [39, 9, 1, "", "isUninterpretedSort"], [39, 9, 1, "", "isUninterpretedSortConstructor"], [39, 9, 1, "", "substitute"]], "cvc5.Statistics": [[40, 9, 1, "", "__getitem__"], [40, 9, 1, "", "get"]], "cvc5.SynthResult": [[41, 9, 1, "", "hasNoSolution"], [41, 9, 1, "", "hasSolution"], [41, 9, 1, "", "isNull"], [41, 9, 1, "", "isUnknown"]], "cvc5.Term": [[42, 9, 1, "", "__getitem__"], [42, 9, 1, "", "__iter__"], [42, 9, 1, "", "andTerm"], [42, 9, 1, "", "eqTerm"], [42, 9, 1, "", "getBitVectorValue"], [42, 9, 1, "", "getBooleanValue"], [42, 9, 1, "", "getCardinalityConstraint"], [42, 9, 1, "", "getConstArrayBase"], [42, 9, 1, "", "getFloatingPointValue"], [42, 9, 1, "", "getId"], [42, 9, 1, "", "getIntegerValue"], [42, 9, 1, "", "getKind"], [42, 9, 1, "", "getNumChildren"], [42, 9, 1, "", "getOp"], [42, 9, 1, "", "getRealOrIntegerValueSign"], [42, 9, 1, "", "getRealValue"], [42, 9, 1, "", "getRoundingModeValue"], [42, 9, 1, "", "getSequenceValue"], [42, 9, 1, "", "getSetValue"], [42, 9, 1, "", "getSort"], [42, 9, 1, "", "getStringValue"], [42, 9, 1, "", "getSymbol"], [42, 9, 1, "", "getTupleValue"], [42, 9, 1, "", "getUninterpretedSortValue"], [42, 9, 1, "", "hasOp"], [42, 9, 1, "", "hasSymbol"], [42, 9, 1, "", "impTerm"], [42, 9, 1, "", "isBitVectorValue"], [42, 9, 1, "", "isBooleanValue"], [42, 9, 1, "", "isCardinalityConstraint"], [42, 9, 1, "", "isConstArray"], [42, 9, 1, "", "isFloatingPointNaN"], [42, 9, 1, "", "isFloatingPointNegInf"], [42, 9, 1, "", "isFloatingPointNegZero"], [42, 9, 1, "", "isFloatingPointPosInf"], [42, 9, 1, "", "isFloatingPointPosZero"], [42, 9, 1, "", "isFloatingPointValue"], [42, 9, 1, "", "isIntegerValue"], [42, 9, 1, "", "isNull"], [42, 9, 1, "", "isRealValue"], [42, 9, 1, "", "isRoundingModeValue"], [42, 9, 1, "", "isSequenceValue"], [42, 9, 1, "", "isSetValue"], [42, 9, 1, "", "isStringValue"], [42, 9, 1, "", "isTupleValue"], [42, 9, 1, "", "isUninterpretedSortValue"], [42, 9, 1, "", "iteTerm"], [42, 9, 1, "", "notTerm"], [42, 9, 1, "", "orTerm"], [42, 9, 1, "", "substitute"], [42, 9, 1, "", "toPythonObj"], [42, 9, 1, "", "xorTerm"]], "cvc5.UnknownExplanation": [[43, 10, 1, "", "INCOMPLETE"], [43, 10, 1, "", "INTERRUPTED"], [43, 10, 1, "", "MEMOUT"], [43, 10, 1, "", "OTHER"], [43, 10, 1, "", "REQUIRES_FULL_CHECK"], [43, 10, 1, "", "RESOURCEOUT"], [43, 10, 1, "", "TIMEOUT"], [43, 10, 1, "", "UNKNOWN_REASON"], [43, 10, 1, "", "UNSUPPORTED"]], "cvc5.pythonic": [[45, 11, 1, "", "Add"], [48, 11, 1, "", "And"], [45, 11, 1, "", "Arccosecant"], [45, 11, 1, "", "Arccosine"], [45, 11, 1, "", "Arccotangent"], [45, 11, 1, "", "Arcsecant"], [45, 11, 1, "", "Arcsine"], [45, 11, 1, "", "Arctangent"], [45, 8, 1, "", "ArithRef"], [45, 8, 1, "", "ArithSortRef"], [46, 11, 1, "", "Array"], [46, 8, 1, "", "ArrayRef"], [46, 11, 1, "", "ArraySort"], [46, 8, 1, "", "ArraySortRef"], [47, 11, 1, "", "BV2Int"], [47, 11, 1, "", "BVAdd"], [47, 11, 1, "", "BVAnd"], [47, 11, 1, "", "BVMult"], [47, 11, 1, "", "BVNeg"], [47, 11, 1, "", "BVNot"], [47, 11, 1, "", "BVOr"], [47, 11, 1, "", "BVRedAnd"], [47, 11, 1, "", "BVRedOr"], [47, 11, 1, "", "BVSub"], [47, 11, 1, "", "BVXor"], [47, 11, 1, "", "BitVec"], [47, 8, 1, "", "BitVecNumRef"], [47, 8, 1, "", "BitVecRef"], [47, 11, 1, "", "BitVecSort"], [47, 8, 1, "", "BitVecSortRef"], [47, 11, 1, "", "BitVecVal"], [47, 11, 1, "", "BitVecs"], [48, 11, 1, "", "Bool"], [48, 8, 1, "", "BoolRef"], [48, 11, 1, "", "BoolSort"], [48, 8, 1, "", "BoolSortRef"], [48, 11, 1, "", "BoolVal"], [48, 11, 1, "", "BoolVector"], [48, 11, 1, "", "Bools"], [45, 11, 1, "", "Cbrt"], [56, 8, 1, "", "CheckSatResult"], [47, 11, 1, "", "Concat"], [48, 11, 1, "", "Const"], [46, 11, 1, "", "ConstArray"], [48, 11, 1, "", "Consts"], [45, 11, 1, "", "Cosecant"], [45, 11, 1, "", "Cosine"], [45, 11, 1, "", "Cotangent"], [49, 11, 1, "", "CreateDatatypes"], [49, 8, 1, "", "Datatype"], [49, 8, 1, "", "DatatypeConstructorRef"], [49, 8, 1, "", "DatatypeRecognizerRef"], [49, 8, 1, "", "DatatypeRef"], [49, 8, 1, "", "DatatypeSelectorRef"], [49, 8, 1, "", "DatatypeSortRef"], [49, 11, 1, "", "DisjointSum"], [48, 11, 1, "", "Distinct"], [45, 11, 1, "", "Div"], [55, 11, 1, "", "EmptySet"], [53, 11, 1, "", "Exists"], [45, 11, 1, "", "Exponential"], [48, 8, 1, "", "ExprRef"], [47, 11, 1, "", "Extract"], [50, 11, 1, "", "FP"], [50, 8, 1, "", "FPNumRef"], [50, 8, 1, "", "FPRMRef"], [50, 8, 1, "", "FPRef"], [50, 11, 1, "", "FPSort"], [50, 8, 1, "", "FPSortRef"], [50, 11, 1, "", "FPVal"], [50, 11, 1, "", "FPs"], [50, 11, 1, "", "Float128"], [50, 11, 1, "", "Float16"], [50, 11, 1, "", "Float32"], [50, 11, 1, "", "Float64"], [50, 11, 1, "", "FloatDouble"], [50, 11, 1, "", "FloatHalf"], [50, 11, 1, "", "FloatQuadruple"], [50, 11, 1, "", "FloatSingle"], [53, 11, 1, "", "ForAll"], [48, 11, 1, "", "FreshBool"], [48, 11, 1, "", "FreshConst"], [48, 11, 1, "", "FreshFunction"], [45, 11, 1, "", "FreshInt"], [45, 11, 1, "", "FreshReal"], [55, 11, 1, "", "FullSet"], [48, 8, 1, "", "FuncDeclRef"], [48, 11, 1, "", "Function"], [45, 11, 1, "", "Geq"], [45, 11, 1, "", "Gt"], [48, 11, 1, "", "If"], [48, 11, 1, "", "Implies"], [45, 11, 1, "", "Int"], [47, 11, 1, "", "Int2BV"], [45, 8, 1, "", "IntNumRef"], [45, 11, 1, "", "IntSort"], [45, 11, 1, "", "IntVal"], [45, 11, 1, "", "IntVector"], [45, 11, 1, "", "Ints"], [45, 11, 1, "", "IntsModulus"], [45, 11, 1, "", "IsInt"], [55, 11, 1, "", "IsMember"], [55, 11, 1, "", "IsSubset"], [46, 11, 1, "", "K"], [47, 11, 1, "", "LShR"], [53, 11, 1, "", "Lambda"], [45, 11, 1, "", "Leq"], [45, 11, 1, "", "Lt"], [56, 8, 1, "", "ModelRef"], [45, 11, 1, "", "Mult"], [48, 11, 1, "", "Not"], [48, 11, 1, "", "Or"], [45, 11, 1, "", "Pi"], [45, 11, 1, "", "Pow"], [56, 11, 1, "", "Product"], [45, 11, 1, "", "Q"], [53, 8, 1, "", "QuantifierRef"], [50, 11, 1, "", "RNA"], [50, 11, 1, "", "RNE"], [50, 11, 1, "", "RTN"], [50, 11, 1, "", "RTP"], [50, 11, 1, "", "RTZ"], [45, 8, 1, "", "RatNumRef"], [45, 11, 1, "", "RatVal"], [45, 11, 1, "", "Real"], [45, 11, 1, "", "RealSort"], [45, 11, 1, "", "RealVal"], [45, 11, 1, "", "RealVector"], [45, 11, 1, "", "Reals"], [47, 11, 1, "", "RepeatBitVec"], [47, 11, 1, "", "RotateLeft"], [47, 11, 1, "", "RotateRight"], [50, 11, 1, "", "RoundNearestTiesToAway"], [50, 11, 1, "", "RoundNearestTiesToEven"], [50, 11, 1, "", "RoundTowardNegative"], [50, 11, 1, "", "RoundTowardPositive"], [50, 11, 1, "", "RoundTowardZero"], [47, 11, 1, "", "SDiv"], [47, 11, 1, "", "SGE"], [47, 11, 1, "", "SGT"], [47, 11, 1, "", "SLE"], [47, 11, 1, "", "SLT"], [51, 8, 1, "", "SMTException"], [47, 11, 1, "", "SMod"], [47, 11, 1, "", "SRem"], [45, 11, 1, "", "Secant"], [46, 11, 1, "", "Select"], [55, 11, 1, "", "Set"], [55, 11, 1, "", "SetAdd"], [55, 11, 1, "", "SetComplement"], [55, 11, 1, "", "SetDel"], [55, 11, 1, "", "SetDifference"], [55, 11, 1, "", "SetIntersect"], [55, 11, 1, "", "SetMinus"], [55, 8, 1, "", "SetRef"], [55, 11, 1, "", "SetSort"], [55, 8, 1, "", "SetSortRef"], [55, 11, 1, "", "SetUnion"], [47, 11, 1, "", "SignExt"], [56, 11, 1, "", "SimpleSolver"], [45, 11, 1, "", "Sine"], [55, 11, 1, "", "Singleton"], [56, 8, 1, "", "Solver"], [56, 11, 1, "", "SolverFor"], [48, 8, 1, "", "SortRef"], [45, 11, 1, "", "Sqrt"], [46, 11, 1, "", "Store"], [45, 11, 1, "", "Sub"], [56, 11, 1, "", "Sum"], [45, 11, 1, "", "Tangent"], [45, 11, 1, "", "ToInt"], [45, 11, 1, "", "ToReal"], [49, 11, 1, "", "TupleSort"], [47, 11, 1, "", "UDiv"], [47, 11, 1, "", "UGE"], [47, 11, 1, "", "UGT"], [47, 11, 1, "", "ULE"], [47, 11, 1, "", "ULT"], [45, 11, 1, "", "UMinus"], [47, 11, 1, "", "URem"], [46, 11, 1, "", "Update"], [48, 11, 1, "", "Xor"], [47, 11, 1, "", "ZeroExt"], [56, 11, 1, "", "evaluate"], [50, 11, 1, "", "fpAbs"], [50, 11, 1, "", "fpAdd"], [50, 11, 1, "", "fpBVToFP"], [50, 11, 1, "", "fpDiv"], [50, 11, 1, "", "fpEQ"], [50, 11, 1, "", "fpFMA"], [50, 11, 1, "", "fpFP"], [50, 11, 1, "", "fpFPToFP"], [50, 11, 1, "", "fpGEQ"], [50, 11, 1, "", "fpGT"], [50, 11, 1, "", "fpInfinity"], [50, 11, 1, "", "fpIsInf"], [50, 11, 1, "", "fpIsNaN"], [50, 11, 1, "", "fpIsNegative"], [50, 11, 1, "", "fpIsNormal"], [50, 11, 1, "", "fpIsPositive"], [50, 11, 1, "", "fpIsSubnormal"], [50, 11, 1, "", "fpIsZero"], [50, 11, 1, "", "fpLEQ"], [50, 11, 1, "", "fpLT"], [50, 11, 1, "", "fpMax"], [50, 11, 1, "", "fpMin"], [50, 11, 1, "", "fpMinusInfinity"], [50, 11, 1, "", "fpMinusZero"], [50, 11, 1, "", "fpMul"], [50, 11, 1, "", "fpNEQ"], [50, 11, 1, "", "fpNaN"], [50, 11, 1, "", "fpNeg"], [50, 11, 1, "", "fpPlusInfinity"], [50, 11, 1, "", "fpPlusZero"], [50, 11, 1, "", "fpRealToFP"], [50, 11, 1, "", "fpRem"], [50, 11, 1, "", "fpRoundToIntegral"], [50, 11, 1, "", "fpSignedToFP"], [50, 11, 1, "", "fpSqrt"], [50, 11, 1, "", "fpSub"], [50, 11, 1, "", "fpToFP"], [50, 11, 1, "", "fpToFPUnsigned"], [50, 11, 1, "", "fpToReal"], [50, 11, 1, "", "fpToSBV"], [50, 11, 1, "", "fpToUBV"], [50, 11, 1, "", "fpUnsignedToFP"], [50, 11, 1, "", "fpZero"], [50, 11, 1, "", "get_default_fp_sort"], [50, 11, 1, "", "get_default_rounding_mode"], [46, 11, 1, "", "is_K"], [45, 11, 1, "", "is_add"], [48, 11, 1, "", "is_and"], [51, 11, 1, "", "is_app"], [51, 11, 1, "", "is_app_of"], [45, 11, 1, "", "is_arith"], [45, 11, 1, "", "is_arith_sort"], [46, 11, 1, "", "is_array"], [46, 11, 1, "", "is_array_sort"], [48, 11, 1, "", "is_bool"], [48, 11, 1, "", "is_bool_value"], [47, 11, 1, "", "is_bv"], [47, 11, 1, "", "is_bv_sort"], [47, 11, 1, "", "is_bv_value"], [48, 11, 1, "", "is_const"], [46, 11, 1, "", "is_const_array"], [48, 11, 1, "", "is_distinct"], [45, 11, 1, "", "is_div"], [48, 11, 1, "", "is_eq"], [51, 11, 1, "", "is_expr"], [48, 11, 1, "", "is_false"], [50, 11, 1, "", "is_fp"], [50, 11, 1, "", "is_fp_sort"], [50, 11, 1, "", "is_fp_value"], [50, 11, 1, "", "is_fprm"], [50, 11, 1, "", "is_fprm_sort"], [50, 11, 1, "", "is_fprm_value"], [48, 11, 1, "", "is_func_decl"], [45, 11, 1, "", "is_ge"], [45, 11, 1, "", "is_gt"], [45, 11, 1, "", "is_idiv"], [48, 11, 1, "", "is_implies"], [45, 11, 1, "", "is_int"], [45, 11, 1, "", "is_int_value"], [45, 11, 1, "", "is_is_int"], [45, 11, 1, "", "is_le"], [45, 11, 1, "", "is_lt"], [45, 11, 1, "", "is_mod"], [45, 11, 1, "", "is_mul"], [48, 11, 1, "", "is_not"], [48, 11, 1, "", "is_or"], [53, 11, 1, "", "is_quantifier"], [45, 11, 1, "", "is_rational_value"], [45, 11, 1, "", "is_real"], [46, 11, 1, "", "is_select"], [51, 11, 1, "", "is_sort"], [46, 11, 1, "", "is_store"], [45, 11, 1, "", "is_sub"], [45, 11, 1, "", "is_to_int"], [45, 11, 1, "", "is_to_real"], [48, 11, 1, "", "is_true"], [46, 11, 1, "", "is_update"], [53, 11, 1, "", "is_var"], [48, 11, 1, "", "mk_not"], [56, 11, 1, "", "prove"], [56, 12, 1, "", "sat"], [50, 11, 1, "", "set_default_fp_sort"], [50, 11, 1, "", "set_default_rounding_mode"], [56, 11, 1, "", "simplify"], [56, 11, 1, "", "solve"], [56, 11, 1, "", "solve_using"], [56, 11, 1, "", "substitute"], [56, 12, 1, "", "unknown"], [56, 12, 1, "", "unsat"]], "cvc5.pythonic.ArithRef": [[45, 9, 1, "", "__add__"], [45, 9, 1, "", "__div__"], [45, 9, 1, "", "__ge__"], [45, 9, 1, "", "__gt__"], [45, 9, 1, "", "__le__"], [45, 9, 1, "", "__lt__"], [45, 9, 1, "", "__mod__"], [45, 9, 1, "", "__mul__"], [45, 9, 1, "", "__neg__"], [45, 9, 1, "", "__pos__"], [45, 9, 1, "", "__pow__"], [45, 9, 1, "", "__radd__"], [45, 9, 1, "", "__rdiv__"], [45, 9, 1, "", "__rmod__"], [45, 9, 1, "", "__rmul__"], [45, 9, 1, "", "__rpow__"], [45, 9, 1, "", "__rsub__"], [45, 9, 1, "", "__rtruediv__"], [45, 9, 1, "", "__sub__"], [45, 9, 1, "", "__truediv__"], [45, 9, 1, "", "is_int"], [45, 9, 1, "", "is_real"], [45, 9, 1, "", "sort"]], "cvc5.pythonic.ArithSortRef": [[45, 9, 1, "", "cast"], [45, 9, 1, "", "is_int"], [45, 9, 1, "", "is_real"], [45, 9, 1, "", "subsort"]], "cvc5.pythonic.ArrayRef": [[46, 9, 1, "", "__getitem__"], [46, 9, 1, "", "arg"], [46, 9, 1, "", "default"], [46, 9, 1, "", "domain"], [46, 9, 1, "", "range"], [46, 9, 1, "", "sort"]], "cvc5.pythonic.ArraySortRef": [[46, 9, 1, "", "domain"], [46, 9, 1, "", "range"]], "cvc5.pythonic.BitVecNumRef": [[47, 9, 1, "", "as_long"], [47, 9, 1, "", "as_signed_long"]], "cvc5.pythonic.BitVecRef": [[47, 9, 1, "", "__add__"], [47, 9, 1, "", "__and__"], [47, 9, 1, "", "__div__"], [47, 9, 1, "", "__ge__"], [47, 9, 1, "", "__gt__"], [47, 9, 1, "", "__invert__"], [47, 9, 1, "", "__le__"], [47, 9, 1, "", "__lshift__"], [47, 9, 1, "", "__lt__"], [47, 9, 1, "", "__mod__"], [47, 9, 1, "", "__mul__"], [47, 9, 1, "", "__neg__"], [47, 9, 1, "", "__or__"], [47, 9, 1, "", "__pos__"], [47, 9, 1, "", "__radd__"], [47, 9, 1, "", "__rand__"], [47, 9, 1, "", "__rdiv__"], [47, 9, 1, "", "__rlshift__"], [47, 9, 1, "", "__rmod__"], [47, 9, 1, "", "__rmul__"], [47, 9, 1, "", "__ror__"], [47, 9, 1, "", "__rrshift__"], [47, 9, 1, "", "__rshift__"], [47, 9, 1, "", "__rsub__"], [47, 9, 1, "", "__rtruediv__"], [47, 9, 1, "", "__rxor__"], [47, 9, 1, "", "__sub__"], [47, 9, 1, "", "__truediv__"], [47, 9, 1, "", "__xor__"], [47, 9, 1, "", "size"], [47, 9, 1, "", "sort"]], "cvc5.pythonic.BitVecSortRef": [[47, 9, 1, "", "cast"], [47, 9, 1, "", "size"], [47, 9, 1, "", "subsort"]], "cvc5.pythonic.BoolRef": [[48, 9, 1, "", "__mul__"], [48, 9, 1, "", "__rmul__"], [48, 9, 1, "", "sort"]], "cvc5.pythonic.BoolSortRef": [[48, 9, 1, "", "cast"], [48, 9, 1, "", "is_bool"], [48, 9, 1, "", "is_int"], [48, 9, 1, "", "subsort"]], "cvc5.pythonic.CheckSatResult": [[56, 9, 1, "", "__eq__"], [56, 10, 1, "", "__hash__"], [56, 9, 1, "", "__init__"], [56, 9, 1, "", "__ne__"], [56, 9, 1, "", "__repr__"], [56, 10, 1, "", "__weakref__"]], "cvc5.pythonic.Datatype": [[49, 9, 1, "", "__init__"], [49, 9, 1, "", "__repr__"], [49, 10, 1, "", "__weakref__"], [49, 9, 1, "", "create"], [49, 9, 1, "", "declare"]], "cvc5.pythonic.DatatypeConstructorRef": [[49, 9, 1, "", "__call__"], [49, 9, 1, "", "__init__"], [49, 9, 1, "", "arity"], [49, 9, 1, "", "domain"], [49, 9, 1, "", "range"]], "cvc5.pythonic.DatatypeRecognizerRef": [[49, 9, 1, "", "__call__"], [49, 9, 1, "", "__init__"], [49, 9, 1, "", "arity"], [49, 9, 1, "", "domain"], [49, 9, 1, "", "range"]], "cvc5.pythonic.DatatypeRef": [[49, 9, 1, "", "sort"]], "cvc5.pythonic.DatatypeSelectorRef": [[49, 9, 1, "", "__call__"], [49, 9, 1, "", "__init__"], [49, 9, 1, "", "arity"], [49, 9, 1, "", "domain"], [49, 9, 1, "", "range"]], "cvc5.pythonic.DatatypeSortRef": [[49, 9, 1, "", "__init__"], [49, 9, 1, "", "accessor"], [49, 9, 1, "", "constructor"], [49, 9, 1, "", "num_constructors"], [49, 9, 1, "", "recognizer"]], "cvc5.pythonic.ExprRef": [[48, 9, 1, "", "__bool__"], [48, 9, 1, "", "__eq__"], [48, 9, 1, "", "__hash__"], [48, 9, 1, "", "__init__"], [48, 9, 1, "", "__ne__"], [48, 9, 1, "", "__nonzero__"], [48, 9, 1, "", "__repr__"], [48, 9, 1, "", "__str__"], [48, 10, 1, "", "__weakref__"], [48, 9, 1, "", "arg"], [48, 9, 1, "", "as_ast"], [48, 9, 1, "", "children"], [48, 9, 1, "", "decl"], [48, 9, 1, "", "eq"], [48, 9, 1, "", "get_id"], [48, 9, 1, "", "hash"], [48, 9, 1, "", "is_int"], [48, 9, 1, "", "kind"], [48, 9, 1, "", "num_args"], [48, 9, 1, "", "sexpr"], [48, 9, 1, "", "sort"]], "cvc5.pythonic.FPNumRef": [[50, 9, 1, "", "as_string"], [50, 9, 1, "", "exponent"], [50, 9, 1, "", "exponent_as_long"], [50, 9, 1, "", "isInf"], [50, 9, 1, "", "isNaN"], [50, 9, 1, "", "isNegative"], [50, 9, 1, "", "isNormal"], [50, 9, 1, "", "isPositive"], [50, 9, 1, "", "isSubnormal"], [50, 9, 1, "", "isZero"], [50, 9, 1, "", "sign"], [50, 9, 1, "", "significand"], [50, 9, 1, "", "significand_as_long"]], "cvc5.pythonic.FPRMRef": [[50, 9, 1, "", "as_string"]], "cvc5.pythonic.FPRef": [[50, 9, 1, "", "__add__"], [50, 9, 1, "", "__div__"], [50, 9, 1, "", "__ge__"], [50, 9, 1, "", "__gt__"], [50, 9, 1, "", "__le__"], [50, 9, 1, "", "__lt__"], [50, 9, 1, "", "__mod__"], [50, 9, 1, "", "__mul__"], [50, 9, 1, "", "__neg__"], [50, 9, 1, "", "__pos__"], [50, 9, 1, "", "__radd__"], [50, 9, 1, "", "__rdiv__"], [50, 9, 1, "", "__rmod__"], [50, 9, 1, "", "__rmul__"], [50, 9, 1, "", "__rsub__"], [50, 9, 1, "", "__rtruediv__"], [50, 9, 1, "", "__sub__"], [50, 9, 1, "", "__truediv__"], [50, 9, 1, "", "as_string"], [50, 9, 1, "", "ebits"], [50, 9, 1, "", "sbits"], [50, 9, 1, "", "sort"]], "cvc5.pythonic.FPSortRef": [[50, 9, 1, "", "cast"], [50, 9, 1, "", "ebits"], [50, 9, 1, "", "sbits"]], "cvc5.pythonic.FuncDeclRef": [[48, 9, 1, "", "__call__"], [48, 9, 1, "", "arity"], [48, 9, 1, "", "domain"], [48, 9, 1, "", "name"], [48, 9, 1, "", "range"]], "cvc5.pythonic.IntNumRef": [[45, 9, 1, "", "as_binary_string"], [45, 9, 1, "", "as_long"], [45, 9, 1, "", "as_string"]], "cvc5.pythonic.ModelRef": [[56, 9, 1, "", "__getitem__"], [56, 9, 1, "", "__init__"], [56, 9, 1, "", "__len__"], [56, 9, 1, "", "__repr__"], [56, 10, 1, "", "__weakref__"], [56, 9, 1, "", "decls"], [56, 9, 1, "", "eval"], [56, 9, 1, "", "evaluate"], [56, 9, 1, "", "vars"]], "cvc5.pythonic.QuantifierRef": [[53, 9, 1, "", "as_ast"], [53, 9, 1, "", "body"], [53, 9, 1, "", "children"], [53, 9, 1, "", "is_exists"], [53, 9, 1, "", "is_forall"], [53, 9, 1, "", "is_lambda"], [53, 9, 1, "", "num_vars"], [53, 9, 1, "", "sort"], [53, 9, 1, "", "var_name"], [53, 9, 1, "", "var_sort"]], "cvc5.pythonic.RatNumRef": [[45, 9, 1, "", "as_decimal"], [45, 9, 1, "", "as_fraction"], [45, 9, 1, "", "as_long"], [45, 9, 1, "", "as_string"], [45, 9, 1, "", "denominator"], [45, 9, 1, "", "denominator_as_long"], [45, 9, 1, "", "is_int"], [45, 9, 1, "", "is_int_value"], [45, 9, 1, "", "is_real"], [45, 9, 1, "", "numerator"], [45, 9, 1, "", "numerator_as_long"]], "cvc5.pythonic.SMTException": [[51, 9, 1, "", "__init__"], [51, 9, 1, "", "__str__"], [51, 10, 1, "", "__weakref__"]], "cvc5.pythonic.SetRef": [[55, 9, 1, "", "__and__"], [55, 9, 1, "", "__getitem__"], [55, 9, 1, "", "__or__"], [55, 9, 1, "", "default"], [55, 9, 1, "", "domain"], [55, 9, 1, "", "range"], [55, 9, 1, "", "sort"]], "cvc5.pythonic.SetSortRef": [[55, 9, 1, "", "domain"], [55, 9, 1, "", "range"]], "cvc5.pythonic.Solver": [[56, 9, 1, "", "__iadd__"], [56, 9, 1, "", "__init__"], [56, 9, 1, "", "__repr__"], [56, 10, 1, "", "__weakref__"], [56, 9, 1, "", "add"], [56, 9, 1, "", "append"], [56, 9, 1, "", "assert_exprs"], [56, 9, 1, "", "assertions"], [56, 9, 1, "", "check"], [56, 9, 1, "", "getOption"], [56, 9, 1, "", "getOptionInfo"], [56, 9, 1, "", "getOptionNames"], [56, 9, 1, "", "insert"], [56, 9, 1, "", "model"], [56, 9, 1, "", "num_scopes"], [56, 9, 1, "", "pop"], [56, 9, 1, "", "push"], [56, 9, 1, "", "reason_unknown"], [56, 9, 1, "", "reset"], [56, 9, 1, "", "resetAssertions"], [56, 9, 1, "", "set"], [56, 9, 1, "", "setOption"], [56, 9, 1, "", "sexpr"], [56, 9, 1, "", "statistics"]], "cvc5.pythonic.SortRef": [[48, 9, 1, "", "__eq__"], [48, 9, 1, "", "__hash__"], [48, 9, 1, "", "__init__"], [48, 9, 1, "", "__ne__"], [48, 9, 1, "", "__repr__"], [48, 9, 1, "", "__str__"], [48, 10, 1, "", "__weakref__"], [48, 9, 1, "", "as_ast"], [48, 9, 1, "", "cast"], [48, 9, 1, "", "eq"], [48, 9, 1, "", "hash"], [48, 9, 1, "", "is_int"], [48, 9, 1, "", "name"], [48, 9, 1, "", "sexpr"], [48, 9, 1, "", "subsort"]]}, "objtypes": {"0": "cpp:enumerator", "1": "cpp:class", "2": "cpp:function", "3": "cpp:functionParam", "4": "cpp:type", "5": "cpp:enum", "6": "cpp:member", "7": "cpp:templateParam", "8": "py:class", "9": "py:method", "10": "py:attribute", "11": "py:function", "12": "py:data"}, "objnames": {"0": ["cpp", "enumerator", "C++ enumerator"], "1": ["cpp", "class", "C++ class"], "2": ["cpp", "function", "C++ function"], "3": ["cpp", "functionParam", "C++ function parameter"], "4": ["cpp", "type", "C++ type"], "5": ["cpp", "enum", "C++ enum"], "6": ["cpp", "member", "C++ member"], "7": ["cpp", "templateParam", "C++ template parameter"], "8": ["py", "class", "Python class"], "9": ["py", "method", "Python method"], "10": ["py", "attribute", "Python attribute"], "11": ["py", "function", "Python function"], "12": ["py", "data", "Python data"]}, "titleterms": {"api": [0, 1, 23, 24, 34, 44, 52, 80, 92], "document": [0, 57, 79, 80], "c": 1, "class": [1, 45, 46, 47, 48, 49, 50, 53, 55, 56, 80], "hierarchi": 1, "datatyp": [2, 26, 49, 63, 81, 92], "datatypeconstructor": [3, 27], "datatypeconstructordecl": [4, 28], "datatypedecl": [5, 29], "datatypeselector": [6, 30], "driveropt": 7, "except": [8, 51, 65], "grammar": [9, 31, 76, 82], "kind": [10, 32], "mode": [11, 50], "op": [12, 33], "optioninfo": 13, "quickstart": [14, 25, 35, 54, 58, 70], "guid": [14, 25, 35, 54, 58], "exampl": [14, 25, 35, 54, 58, 64, 70, 80, 92, 93, 94, 98], "result": [15, 36, 56], "roundingmod": [16, 37], "solver": [17, 38, 56, 80], "sort": [18, 39], "statist": [19, 40, 90], "synthresult": [20, 41], "term": [21, 42, 45, 46, 47, 48, 50, 55], "unknownexplan": [22, 43], "java": [23, 24], "build": [24, 80], "cvc5": [24, 79, 80, 81], "packag": 24, "io": 24, "github": 24, "base": [34, 81], "python": [34, 44, 52], "which": 44, "should": 44, "i": 44, "us": [44, 81], "instal": [44, 80], "arithmet": [45, 69, 80, 81], "basic": [45, 46, 47, 48, 50, 55], "builder": [45, 46, 47, 48, 50, 53, 55], "overload": [45, 46, 47, 48, 50, 55], "other": 45, "oper": [45, 46, 48, 50, 55, 80], "transcendent": [45, 98], "tester": [45, 46, 47, 48, 50, 51, 53], "arrai": [46, 61, 81], "bit": [47, 60, 61, 66], "vector": [47, 60, 61, 66], "core": 48, "boolean": 48, "gener": [48, 80], "equal": 48, "overview": 49, "declar": [49, 92], "util": [49, 56], "float": [50, 67, 80, 81], "point": [50, 67, 80, 81], "fp": 50, "round": 50, "intern": 51, "quantifi": [53, 81], "set": [55, 73, 81, 95], "simpl": 56, "solv": 56, "The": 56, "model": 56, "binari": 57, "theori": [59, 60, 61, 62, 63, 66, 67, 69, 71, 72, 73, 74, 80, 81, 91, 92, 93, 94, 95, 96, 97, 98], "bag": [59, 91], "combin": 62, "handl": 65, "extract": 66, "hello": 68, "world": 68, "linear": [69, 80], "relat": [71, 95], "sequenc": [72, 94], "string": [74, 81, 96], "sygu": [75, 76, 77, 82], "function": [75, 81], "invari": 77, "index": 78, "tabl": 79, "content": 79, "support": 80, "system": 80, "compil": 80, "maco": 80, "cross": 80, "window": 80, "depend": 80, "antlr": 80, "3": 80, "4": 80, "parser": [80, 81], "cadic": 80, "sat": [80, 81], "gmp": 80, "gnu": 80, "multi": 80, "precis": 80, "librari": 80, "symfpu": 80, "number": 80, "option": [80, 81, 89], "cryptominisat": 80, "kissat": 80, "libpoli": 80, "polynomi": 80, "cln": 80, "v1": 80, "glpk": 80, "cut": 80, "log": 80, "A": 80, "fork": 80, "program": 80, "kit": 80, "editlin": 80, "improv": 80, "interact": 80, "experi": 80, "googl": 80, "test": 80, "unit": 80, "framework": 80, "languag": 80, "bind": 80, "regress": 80, "custom": 80, "target": 80, "recompil": 80, "specif": 80, "version": 80, "differ": 80, "lgpl": 80, "most": 81, "commonli": 81, "addit": 81, "modul": 81, "bitvector": 81, "decis": 81, "heurist": 81, "express": 81, "driver": 81, "parallel": 81, "print": 81, "proof": [81, 83, 84, 85, 86, 87], "layer": 81, "separ": [81, 93], "logic": [81, 92, 93, 98], "smt": 81, "uninterpret": 81, "output": 82, "tag": 82, "inst": 82, "trigger": 82, "raw": 82, "benchmark": 82, "learn": 82, "lit": 82, "sub": 82, "post": 82, "assert": 82, "pre": 82, "deep": 82, "restart": 82, "incomplet": 82, "format": [83, 84, 85], "aleth": 83, "dot": 84, "lfsc": 85, "rule": 86, "product": 87, "refer": [88, 91, 92, 93, 94, 95, 96, 97, 98], "resourc": 89, "limit": 89, "overal": 89, "time": 89, "tlimit": 89, "manag": 89, "spend": 89, "finit": [91, 95], "semant": [91, 92, 93, 94, 95, 96, 98], "syntax": [92, 93, 94, 98], "updat": 92, "parametr": 92, "tupl": 92, "codatatyp": 92, "signatur": 93, "standard": 97, "non": 97, "extend": 97}, "envversion": {"sphinx.domains.c": 2, "sphinx.domains.changeset": 1, "sphinx.domains.citation": 1, "sphinx.domains.cpp": 6, "sphinx.domains.index": 1, "sphinx.domains.javascript": 2, "sphinx.domains.math": 2, "sphinx.domains.python": 3, "sphinx.domains.rst": 2, "sphinx.domains.std": 2, "sphinxcontrib.bibtex": 9, "sphinx": 56}}) \ No newline at end of file diff --git a/cvc5-1.0.2/static/_sphinx_javascript_frameworks_compat.js b/cvc5-1.0.2/static/_sphinx_javascript_frameworks_compat.js new file mode 100644 index 0000000..8549469 --- /dev/null +++ b/cvc5-1.0.2/static/_sphinx_javascript_frameworks_compat.js @@ -0,0 +1,134 @@ +/* + * _sphinx_javascript_frameworks_compat.js + * ~~~~~~~~~~ + * + * Compatability shim for jQuery and underscores.js. + * + * WILL BE REMOVED IN Sphinx 6.0 + * xref RemovedInSphinx60Warning + * + */ + +/** + * select a different prefix for underscore + */ +$u = _.noConflict(); + + +/** + * small helper function to urldecode strings + * + * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/decodeURIComponent#Decoding_query_parameters_from_a_URL + */ +jQuery.urldecode = function(x) { + if (!x) { + return x + } + return decodeURIComponent(x.replace(/\+/g, ' ')); +}; + +/** + * small helper function to urlencode strings + */ +jQuery.urlencode = encodeURIComponent; + +/** + * This function returns the parsed url parameters of the + * current request. Multiple values per key are supported, + * it will always return arrays of strings for the value parts. + */ +jQuery.getQueryParameters = function(s) { + if (typeof s === 'undefined') + s = document.location.search; + var parts = s.substr(s.indexOf('?') + 1).split('&'); + var result = {}; + for (var i = 0; i < parts.length; i++) { + var tmp = parts[i].split('=', 2); + var key = jQuery.urldecode(tmp[0]); + var value = jQuery.urldecode(tmp[1]); + if (key in result) + result[key].push(value); + else + result[key] = [value]; + } + return result; +}; + +/** + * highlight a given string on a jquery object by wrapping it in + * span elements with the given class name. + */ +jQuery.fn.highlightText = function(text, className) { + function highlight(node, addItems) { + if (node.nodeType === 3) { + var val = node.nodeValue; + var pos = val.toLowerCase().indexOf(text); + if (pos >= 0 && + !jQuery(node.parentNode).hasClass(className) && + !jQuery(node.parentNode).hasClass("nohighlight")) { + var span; + var isInSVG = jQuery(node).closest("body, svg, foreignObject").is("svg"); + if (isInSVG) { + span = document.createElementNS("http://www.w3.org/2000/svg", "tspan"); + } else { + span = document.createElement("span"); + span.className = className; + } + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + node.parentNode.insertBefore(span, node.parentNode.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling)); + node.nodeValue = val.substr(0, pos); + if (isInSVG) { + var rect = document.createElementNS("http://www.w3.org/2000/svg", "rect"); + var bbox = node.parentElement.getBBox(); + rect.x.baseVal.value = bbox.x; + rect.y.baseVal.value = bbox.y; + rect.width.baseVal.value = bbox.width; + rect.height.baseVal.value = bbox.height; + rect.setAttribute('class', className); + addItems.push({ + "parent": node.parentNode, + "target": rect}); + } + } + } + else if (!jQuery(node).is("button, select, textarea")) { + jQuery.each(node.childNodes, function() { + highlight(this, addItems); + }); + } + } + var addItems = []; + var result = this.each(function() { + highlight(this, addItems); + }); + for (var i = 0; i < addItems.length; ++i) { + jQuery(addItems[i].parent).before(addItems[i].target); + } + return result; +}; + +/* + * backward compatibility for jQuery.browser + * This will be supported until firefox bug is fixed. + */ +if (!jQuery.browser) { + jQuery.uaMatch = function(ua) { + ua = ua.toLowerCase(); + + var match = /(chrome)[ \/]([\w.]+)/.exec(ua) || + /(webkit)[ \/]([\w.]+)/.exec(ua) || + /(opera)(?:.*version|)[ \/]([\w.]+)/.exec(ua) || + /(msie) ([\w.]+)/.exec(ua) || + ua.indexOf("compatible") < 0 && /(mozilla)(?:.*? rv:([\w.]+)|)/.exec(ua) || + []; + + return { + browser: match[ 1 ] || "", + version: match[ 2 ] || "0" + }; + }; + jQuery.browser = {}; + jQuery.browser[jQuery.uaMatch(navigator.userAgent).browser] = true; +} diff --git a/cvc5-1.0.2/static/basic.css b/cvc5-1.0.2/static/basic.css new file mode 100644 index 0000000..4e9a9f1 --- /dev/null +++ b/cvc5-1.0.2/static/basic.css @@ -0,0 +1,900 @@ +/* + * basic.css + * ~~~~~~~~~ + * + * Sphinx stylesheet -- basic theme. + * + * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ + +/* -- main layout ----------------------------------------------------------- */ + +div.clearer { + clear: both; +} + +div.section::after { + display: block; + content: ''; + clear: left; +} + +/* -- relbar ---------------------------------------------------------------- */ + +div.related { + width: 100%; + font-size: 90%; +} + +div.related h3 { + display: none; +} + +div.related ul { + margin: 0; + padding: 0 0 0 10px; + list-style: none; +} + +div.related li { + display: inline; +} + +div.related li.right { + float: right; + margin-right: 5px; +} + +/* -- sidebar --------------------------------------------------------------- */ + +div.sphinxsidebarwrapper { + padding: 10px 5px 0 10px; +} + +div.sphinxsidebar { + float: left; + width: 230px; + margin-left: -100%; + font-size: 90%; + word-wrap: break-word; + overflow-wrap : break-word; +} + +div.sphinxsidebar ul { + list-style: none; +} + +div.sphinxsidebar ul ul, +div.sphinxsidebar ul.want-points { + margin-left: 20px; + list-style: square; +} + +div.sphinxsidebar ul ul { + margin-top: 0; + margin-bottom: 0; +} + +div.sphinxsidebar form { + margin-top: 10px; +} + +div.sphinxsidebar input { + border: 1px solid #98dbcc; + font-family: sans-serif; + font-size: 1em; +} + +div.sphinxsidebar #searchbox form.search { + overflow: hidden; +} + +div.sphinxsidebar #searchbox input[type="text"] { + float: left; + width: 80%; + padding: 0.25em; + box-sizing: border-box; +} + +div.sphinxsidebar #searchbox input[type="submit"] { + float: left; + width: 20%; + border-left: none; + padding: 0.25em; + box-sizing: border-box; +} + + +img { + border: 0; + max-width: 100%; +} + +/* -- search page ----------------------------------------------------------- */ + +ul.search { + margin: 10px 0 0 20px; + padding: 0; +} + +ul.search li { + padding: 5px 0 5px 20px; + background-image: url(file.png); + background-repeat: no-repeat; + background-position: 0 7px; +} + +ul.search li a { + font-weight: bold; +} + +ul.search li p.context { + color: #888; + margin: 2px 0 0 30px; + text-align: left; +} + +ul.keywordmatches li.goodmatch a { + font-weight: bold; +} + +/* -- index page ------------------------------------------------------------ */ + +table.contentstable { + width: 90%; + margin-left: auto; + margin-right: auto; +} + +table.contentstable p.biglink { + line-height: 150%; +} + +a.biglink { + font-size: 1.3em; +} + +span.linkdescr { + font-style: italic; + padding-top: 5px; + font-size: 90%; +} + +/* -- general index --------------------------------------------------------- */ + +table.indextable { + width: 100%; +} + +table.indextable td { + text-align: left; + vertical-align: top; +} + +table.indextable ul { + margin-top: 0; + margin-bottom: 0; + list-style-type: none; +} + +table.indextable > tbody > tr > td > ul { + padding-left: 0em; +} + +table.indextable tr.pcap { + height: 10px; +} + +table.indextable tr.cap { + margin-top: 10px; + background-color: #f2f2f2; +} + +img.toggler { + margin-right: 3px; + margin-top: 3px; + cursor: pointer; +} + +div.modindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +div.genindex-jumpbox { + border-top: 1px solid #ddd; + border-bottom: 1px solid #ddd; + margin: 1em 0 1em 0; + padding: 0.4em; +} + +/* -- domain module index --------------------------------------------------- */ + +table.modindextable td { + padding: 2px; + border-collapse: collapse; +} + +/* -- general body styles --------------------------------------------------- */ + +div.body { + min-width: 360px; + max-width: 800px; +} + +div.body p, div.body dd, div.body li, div.body blockquote { + -moz-hyphens: auto; + -ms-hyphens: auto; + -webkit-hyphens: auto; + hyphens: auto; +} + +a.headerlink { + visibility: hidden; +} + +h1:hover > a.headerlink, +h2:hover > a.headerlink, +h3:hover > a.headerlink, +h4:hover > a.headerlink, +h5:hover > a.headerlink, +h6:hover > a.headerlink, +dt:hover > a.headerlink, +caption:hover > a.headerlink, +p.caption:hover > a.headerlink, +div.code-block-caption:hover > a.headerlink { + visibility: visible; +} + +div.body p.caption { + text-align: inherit; +} + +div.body td { + text-align: left; +} + +.first { + margin-top: 0 !important; +} + +p.rubric { + margin-top: 30px; + font-weight: bold; +} + +img.align-left, figure.align-left, .figure.align-left, object.align-left { + clear: left; + float: left; + margin-right: 1em; +} + +img.align-right, figure.align-right, .figure.align-right, object.align-right { + clear: right; + float: right; + margin-left: 1em; +} + +img.align-center, figure.align-center, .figure.align-center, object.align-center { + display: block; + margin-left: auto; + margin-right: auto; +} + +img.align-default, figure.align-default, .figure.align-default { + display: block; + margin-left: auto; + margin-right: auto; +} + +.align-left { + text-align: left; +} + +.align-center { + text-align: center; +} + +.align-default { + text-align: center; +} + +.align-right { + text-align: right; +} + +/* -- sidebars -------------------------------------------------------------- */ + +div.sidebar, +aside.sidebar { + margin: 0 0 0.5em 1em; + border: 1px solid #ddb; + padding: 7px; + background-color: #ffe; + width: 40%; + float: right; + clear: right; + overflow-x: auto; +} + +p.sidebar-title { + font-weight: bold; +} +nav.contents, +aside.topic, +div.admonition, div.topic, blockquote { + clear: left; +} + +/* -- topics ---------------------------------------------------------------- */ +nav.contents, +aside.topic, +div.topic { + border: 1px solid #ccc; + padding: 7px; + margin: 10px 0 10px 0; +} + +p.topic-title { + font-size: 1.1em; + font-weight: bold; + margin-top: 10px; +} + +/* -- admonitions ----------------------------------------------------------- */ + +div.admonition { + margin-top: 10px; + margin-bottom: 10px; + padding: 7px; +} + +div.admonition dt { + font-weight: bold; +} + +p.admonition-title { + margin: 0px 10px 5px 0px; + font-weight: bold; +} + +div.body p.centered { + text-align: center; + margin-top: 25px; +} + +/* -- content of sidebars/topics/admonitions -------------------------------- */ + +div.sidebar > :last-child, +aside.sidebar > :last-child, +nav.contents > :last-child, +aside.topic > :last-child, +div.topic > :last-child, +div.admonition > :last-child { + margin-bottom: 0; +} + +div.sidebar::after, +aside.sidebar::after, +nav.contents::after, +aside.topic::after, +div.topic::after, +div.admonition::after, +blockquote::after { + display: block; + content: ''; + clear: both; +} + +/* -- tables ---------------------------------------------------------------- */ + +table.docutils { + margin-top: 10px; + margin-bottom: 10px; + border: 0; + border-collapse: collapse; +} + +table.align-center { + margin-left: auto; + margin-right: auto; +} + +table.align-default { + margin-left: auto; + margin-right: auto; +} + +table caption span.caption-number { + font-style: italic; +} + +table caption span.caption-text { +} + +table.docutils td, table.docutils th { + padding: 1px 8px 1px 5px; + border-top: 0; + border-left: 0; + border-right: 0; + border-bottom: 1px solid #aaa; +} + +th { + text-align: left; + padding-right: 5px; +} + +table.citation { + border-left: solid 1px gray; + margin-left: 1px; +} + +table.citation td { + border-bottom: none; +} + +th > :first-child, +td > :first-child { + margin-top: 0px; +} + +th > :last-child, +td > :last-child { + margin-bottom: 0px; +} + +/* -- figures --------------------------------------------------------------- */ + +div.figure, figure { + margin: 0.5em; + padding: 0.5em; +} + +div.figure p.caption, figcaption { + padding: 0.3em; +} + +div.figure p.caption span.caption-number, +figcaption span.caption-number { + font-style: italic; +} + +div.figure p.caption span.caption-text, +figcaption span.caption-text { +} + +/* -- field list styles ----------------------------------------------------- */ + +table.field-list td, table.field-list th { + border: 0 !important; +} + +.field-list ul { + margin: 0; + padding-left: 1em; +} + +.field-list p { + margin: 0; +} + +.field-name { + -moz-hyphens: manual; + -ms-hyphens: manual; + -webkit-hyphens: manual; + hyphens: manual; +} + +/* -- hlist styles ---------------------------------------------------------- */ + +table.hlist { + margin: 1em 0; +} + +table.hlist td { + vertical-align: top; +} + +/* -- object description styles --------------------------------------------- */ + +.sig { + font-family: 'Consolas', 'Menlo', 'DejaVu Sans Mono', 'Bitstream Vera Sans Mono', monospace; +} + +.sig-name, code.descname { + background-color: transparent; + font-weight: bold; +} + +.sig-name { + font-size: 1.1em; +} + +code.descname { + font-size: 1.2em; +} + +.sig-prename, code.descclassname { + background-color: transparent; +} + +.optional { + font-size: 1.3em; +} + +.sig-paren { + font-size: larger; +} + +.sig-param.n { + font-style: italic; +} + +/* C++ specific styling */ + +.sig-inline.c-texpr, +.sig-inline.cpp-texpr { + font-family: unset; +} + +.sig.c .k, .sig.c .kt, +.sig.cpp .k, .sig.cpp .kt { + color: #0033B3; +} + +.sig.c .m, +.sig.cpp .m { + color: #1750EB; +} + +.sig.c .s, .sig.c .sc, +.sig.cpp .s, .sig.cpp .sc { + color: #067D17; +} + + +/* -- other body styles ----------------------------------------------------- */ + +ol.arabic { + list-style: decimal; +} + +ol.loweralpha { + list-style: lower-alpha; +} + +ol.upperalpha { + list-style: upper-alpha; +} + +ol.lowerroman { + list-style: lower-roman; +} + +ol.upperroman { + list-style: upper-roman; +} + +:not(li) > ol > li:first-child > :first-child, +:not(li) > ul > li:first-child > :first-child { + margin-top: 0px; +} + +:not(li) > ol > li:last-child > :last-child, +:not(li) > ul > li:last-child > :last-child { + margin-bottom: 0px; +} + +ol.simple ol p, +ol.simple ul p, +ul.simple ol p, +ul.simple ul p { + margin-top: 0; +} + +ol.simple > li:not(:first-child) > p, +ul.simple > li:not(:first-child) > p { + margin-top: 0; +} + +ol.simple p, +ul.simple p { + margin-bottom: 0; +} +aside.footnote > span, +div.citation > span { + float: left; +} +aside.footnote > span:last-of-type, +div.citation > span:last-of-type { + padding-right: 0.5em; +} +aside.footnote > p { + margin-left: 2em; +} +div.citation > p { + margin-left: 4em; +} +aside.footnote > p:last-of-type, +div.citation > p:last-of-type { + margin-bottom: 0em; +} +aside.footnote > p:last-of-type:after, +div.citation > p:last-of-type:after { + content: ""; + clear: both; +} + +dl.field-list { + display: grid; + grid-template-columns: fit-content(30%) auto; +} + +dl.field-list > dt { + font-weight: bold; + word-break: break-word; + padding-left: 0.5em; + padding-right: 5px; +} + +dl.field-list > dd { + padding-left: 0.5em; + margin-top: 0em; + margin-left: 0em; + margin-bottom: 0em; +} + +dl { + margin-bottom: 15px; +} + +dd > :first-child { + margin-top: 0px; +} + +dd ul, dd table { + margin-bottom: 10px; +} + +dd { + margin-top: 3px; + margin-bottom: 10px; + margin-left: 30px; +} + +dl > dd:last-child, +dl > dd:last-child > :last-child { + margin-bottom: 0; +} + +dt:target, span.highlighted { + background-color: #fbe54e; +} + +rect.highlighted { + fill: #fbe54e; +} + +dl.glossary dt { + font-weight: bold; + font-size: 1.1em; +} + +.versionmodified { + font-style: italic; +} + +.system-message { + background-color: #fda; + padding: 5px; + border: 3px solid red; +} + +.footnote:target { + background-color: #ffa; +} + +.line-block { + display: block; + margin-top: 1em; + margin-bottom: 1em; +} + +.line-block .line-block { + margin-top: 0; + margin-bottom: 0; + margin-left: 1.5em; +} + +.guilabel, .menuselection { + font-family: sans-serif; +} + +.accelerator { + text-decoration: underline; +} + +.classifier { + font-style: oblique; +} + +.classifier:before { + font-style: normal; + margin: 0 0.5em; + content: ":"; + display: inline-block; +} + +abbr, acronym { + border-bottom: dotted 1px; + cursor: help; +} + +/* -- code displays --------------------------------------------------------- */ + +pre { + overflow: auto; + overflow-y: hidden; /* fixes display issues on Chrome browsers */ +} + +pre, div[class*="highlight-"] { + clear: both; +} + +span.pre { + -moz-hyphens: none; + -ms-hyphens: none; + -webkit-hyphens: none; + hyphens: none; + white-space: nowrap; +} + +div[class*="highlight-"] { + margin: 1em 0; +} + +td.linenos pre { + border: 0; + background-color: transparent; + color: #aaa; +} + +table.highlighttable { + display: block; +} + +table.highlighttable tbody { + display: block; +} + +table.highlighttable tr { + display: flex; +} + +table.highlighttable td { + margin: 0; + padding: 0; +} + +table.highlighttable td.linenos { + padding-right: 0.5em; +} + +table.highlighttable td.code { + flex: 1; + overflow: hidden; +} + +.highlight .hll { + display: block; +} + +div.highlight pre, +table.highlighttable pre { + margin: 0; +} + +div.code-block-caption + div { + margin-top: 0; +} + +div.code-block-caption { + margin-top: 1em; + padding: 2px 5px; + font-size: small; +} + +div.code-block-caption code { + background-color: transparent; +} + +table.highlighttable td.linenos, +span.linenos, +div.highlight span.gp { /* gp: Generic.Prompt */ + user-select: none; + -webkit-user-select: text; /* Safari fallback only */ + -webkit-user-select: none; /* Chrome/Safari */ + -moz-user-select: none; /* Firefox */ + -ms-user-select: none; /* IE10+ */ +} + +div.code-block-caption span.caption-number { + padding: 0.1em 0.3em; + font-style: italic; +} + +div.code-block-caption span.caption-text { +} + +div.literal-block-wrapper { + margin: 1em 0; +} + +code.xref, a code { + background-color: transparent; + font-weight: bold; +} + +h1 code, h2 code, h3 code, h4 code, h5 code, h6 code { + background-color: transparent; +} + +.viewcode-link { + float: right; +} + +.viewcode-back { + float: right; + font-family: sans-serif; +} + +div.viewcode-block:target { + margin: -1px -10px; + padding: 0 10px; +} + +/* -- math display ---------------------------------------------------------- */ + +img.math { + vertical-align: middle; +} + +div.body div.math p { + text-align: center; +} + +span.eqno { + float: right; +} + +span.eqno a.headerlink { + position: absolute; + z-index: 1; +} + +div.math:hover a.headerlink { + visibility: visible; +} + +/* -- printout stylesheet --------------------------------------------------- */ + +@media print { + div.document, + div.documentwrapper, + div.bodywrapper { + margin: 0 !important; + width: 100%; + } + + div.sphinxsidebar, + div.related, + div.footer, + #top-link { + display: none; + } +} \ No newline at end of file diff --git a/cvc5-1.0.2/static/css/badge_only.css b/cvc5-1.0.2/static/css/badge_only.css new file mode 100644 index 0000000..e380325 --- /dev/null +++ b/cvc5-1.0.2/static/css/badge_only.css @@ -0,0 +1 @@ +.fa:before{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}@font-face{font-family:FontAwesome;font-style:normal;font-weight:400;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#FontAwesome) format("svg")}.fa:before{font-family:FontAwesome;font-style:normal;font-weight:400;line-height:1}.fa:before,a .fa{text-decoration:inherit}.fa:before,a .fa,li .fa{display:inline-block}li .fa-large:before{width:1.875em}ul.fas{list-style-type:none;margin-left:2em;text-indent:-.8em}ul.fas li .fa{width:.8em}ul.fas li .fa-large:before{vertical-align:baseline}.fa-book:before,.icon-book:before{content:"\f02d"}.fa-caret-down:before,.icon-caret-down:before{content:"\f0d7"}.fa-caret-up:before,.icon-caret-up:before{content:"\f0d8"}.fa-caret-left:before,.icon-caret-left:before{content:"\f0d9"}.fa-caret-right:before,.icon-caret-right:before{content:"\f0da"}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60}.rst-versions .rst-current-version:after{clear:both;content:"";display:block}.rst-versions .rst-current-version .fa{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}} \ No newline at end of file diff --git a/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff new file mode 100644 index 0000000..6cb6000 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff2 b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff2 new file mode 100644 index 0000000..7059e23 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Bold.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff new file mode 100644 index 0000000..f815f63 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff2 b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff2 new file mode 100644 index 0000000..f2c76e5 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/Roboto-Slab-Regular.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.eot b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.eot new file mode 100644 index 0000000..e9f60ca Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.eot differ diff --git a/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.svg b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.svg new file mode 100644 index 0000000..855c845 --- /dev/null +++ b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.svg @@ -0,0 +1,2671 @@ + + + + +Created by FontForge 20120731 at Mon Oct 24 17:37:40 2016 + By ,,, +Copyright Dave Gandy 2016. All rights reserved. + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.ttf b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.ttf new file mode 100644 index 0000000..35acda2 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.ttf differ diff --git a/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff new file mode 100644 index 0000000..400014a Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff2 b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff2 new file mode 100644 index 0000000..4d13fc6 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/fontawesome-webfont.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff b/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff new file mode 100644 index 0000000..88ad05b Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff2 b/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff2 new file mode 100644 index 0000000..c4e3d80 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-bold-italic.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-bold.woff b/cvc5-1.0.2/static/css/fonts/lato-bold.woff new file mode 100644 index 0000000..c6dff51 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-bold.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-bold.woff2 b/cvc5-1.0.2/static/css/fonts/lato-bold.woff2 new file mode 100644 index 0000000..bb19504 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-bold.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff b/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff new file mode 100644 index 0000000..76114bc Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff2 b/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff2 new file mode 100644 index 0000000..3404f37 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-normal-italic.woff2 differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-normal.woff b/cvc5-1.0.2/static/css/fonts/lato-normal.woff new file mode 100644 index 0000000..ae1307f Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-normal.woff differ diff --git a/cvc5-1.0.2/static/css/fonts/lato-normal.woff2 b/cvc5-1.0.2/static/css/fonts/lato-normal.woff2 new file mode 100644 index 0000000..3bf9843 Binary files /dev/null and b/cvc5-1.0.2/static/css/fonts/lato-normal.woff2 differ diff --git a/cvc5-1.0.2/static/css/theme.css b/cvc5-1.0.2/static/css/theme.css new file mode 100644 index 0000000..8cd4f10 --- /dev/null +++ b/cvc5-1.0.2/static/css/theme.css @@ -0,0 +1,4 @@ +html{box-sizing:border-box}*,:after,:before{box-sizing:inherit}article,aside,details,figcaption,figure,footer,header,hgroup,nav,section{display:block}audio,canvas,video{display:inline-block;*display:inline;*zoom:1}[hidden],audio:not([controls]){display:none}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:100%;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}blockquote{margin:0}dfn{font-style:italic}ins{background:#ff9;text-decoration:none}ins,mark{color:#000}mark{background:#ff0;font-style:italic;font-weight:700}.rst-content code,.rst-content tt,code,kbd,pre,samp{font-family:monospace,serif;_font-family:courier new,monospace;font-size:1em}pre{white-space:pre}q{quotes:none}q:after,q:before{content:"";content:none}small{font-size:85%}sub,sup{font-size:75%;line-height:0;position:relative;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}dl,ol,ul{margin:0;padding:0;list-style:none;list-style-image:none}li{list-style:none}dd{margin:0}img{border:0;-ms-interpolation-mode:bicubic;vertical-align:middle;max-width:100%}svg:not(:root){overflow:hidden}figure,form{margin:0}label{cursor:pointer}button,input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}button,input{line-height:normal}button,input[type=button],input[type=reset],input[type=submit]{cursor:pointer;-webkit-appearance:button;*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=search]{-webkit-appearance:textfield;-moz-box-sizing:content-box;-webkit-box-sizing:content-box;box-sizing:content-box}textarea{resize:vertical}table{border-collapse:collapse;border-spacing:0}td{vertical-align:top}.chromeframe{margin:.2em 0;background:#ccc;color:#000;padding:.2em 0}.ir{display:block;border:0;text-indent:-999em;overflow:hidden;background-color:transparent;background-repeat:no-repeat;text-align:left;direction:ltr;*line-height:0}.ir br{display:none}.hidden{display:none!important;visibility:hidden}.visuallyhidden{border:0;clip:rect(0 0 0 0);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}.visuallyhidden.focusable:active,.visuallyhidden.focusable:focus{clip:auto;height:auto;margin:0;overflow:visible;position:static;width:auto}.invisible{visibility:hidden}.relative{position:relative}big,small{font-size:100%}@media print{body,html,section{background:none!important}*{box-shadow:none!important;text-shadow:none!important;filter:none!important;-ms-filter:none!important}a,a:visited{text-decoration:underline}.ir a:after,a[href^="#"]:after,a[href^="javascript:"]:after{content:""}blockquote,pre{page-break-inside:avoid}thead{display:table-header-group}img,tr{page-break-inside:avoid}img{max-width:100%!important}@page{margin:.5cm}.rst-content .toctree-wrapper>p.caption,h2,h3,p{orphans:3;widows:3}.rst-content .toctree-wrapper>p.caption,h2,h3{page-break-after:avoid}}.btn,.fa:before,.icon:before,.rst-content .admonition,.rst-content .admonition-title:before,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .code-block-caption .headerlink:before,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-alert,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before,.wy-nav-top a,.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a,input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week],select,textarea{-webkit-font-smoothing:antialiased}.clearfix{*zoom:1}.clearfix:after,.clearfix:before{display:table;content:""}.clearfix:after{clear:both}/*! + * Font Awesome 4.7.0 by @davegandy - http://fontawesome.io - @fontawesome + * License - http://fontawesome.io/license (Font: SIL OFL 1.1, CSS: MIT License) + */@font-face{font-family:FontAwesome;src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713);src:url(fonts/fontawesome-webfont.eot?674f50d287a8c48dc19ba404d20fe713?#iefix&v=4.7.0) format("embedded-opentype"),url(fonts/fontawesome-webfont.woff2?af7ae505a9eed503f8b8e6982036873e) format("woff2"),url(fonts/fontawesome-webfont.woff?fee66e712a8a08eef5805a46892932ad) format("woff"),url(fonts/fontawesome-webfont.ttf?b06871f281fee6b241d60582ae9369b9) format("truetype"),url(fonts/fontawesome-webfont.svg?912ec66d7572ff821749319396470bde#fontawesomeregular) format("svg");font-weight:400;font-style:normal}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{display:inline-block;font:normal normal normal 14px/1 FontAwesome;font-size:inherit;text-rendering:auto;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.fa-lg{font-size:1.33333em;line-height:.75em;vertical-align:-15%}.fa-2x{font-size:2em}.fa-3x{font-size:3em}.fa-4x{font-size:4em}.fa-5x{font-size:5em}.fa-fw{width:1.28571em;text-align:center}.fa-ul{padding-left:0;margin-left:2.14286em;list-style-type:none}.fa-ul>li{position:relative}.fa-li{position:absolute;left:-2.14286em;width:2.14286em;top:.14286em;text-align:center}.fa-li.fa-lg{left:-1.85714em}.fa-border{padding:.2em .25em .15em;border:.08em solid #eee;border-radius:.1em}.fa-pull-left{float:left}.fa-pull-right{float:right}.fa-pull-left.icon,.fa.fa-pull-left,.rst-content .code-block-caption .fa-pull-left.headerlink,.rst-content .fa-pull-left.admonition-title,.rst-content code.download span.fa-pull-left:first-child,.rst-content dl dt .fa-pull-left.headerlink,.rst-content h1 .fa-pull-left.headerlink,.rst-content h2 .fa-pull-left.headerlink,.rst-content h3 .fa-pull-left.headerlink,.rst-content h4 .fa-pull-left.headerlink,.rst-content h5 .fa-pull-left.headerlink,.rst-content h6 .fa-pull-left.headerlink,.rst-content p.caption .fa-pull-left.headerlink,.rst-content table>caption .fa-pull-left.headerlink,.rst-content tt.download span.fa-pull-left:first-child,.wy-menu-vertical li.current>a span.fa-pull-left.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-left.toctree-expand,.wy-menu-vertical li span.fa-pull-left.toctree-expand{margin-right:.3em}.fa-pull-right.icon,.fa.fa-pull-right,.rst-content .code-block-caption .fa-pull-right.headerlink,.rst-content .fa-pull-right.admonition-title,.rst-content code.download span.fa-pull-right:first-child,.rst-content dl dt .fa-pull-right.headerlink,.rst-content h1 .fa-pull-right.headerlink,.rst-content h2 .fa-pull-right.headerlink,.rst-content h3 .fa-pull-right.headerlink,.rst-content h4 .fa-pull-right.headerlink,.rst-content h5 .fa-pull-right.headerlink,.rst-content h6 .fa-pull-right.headerlink,.rst-content p.caption .fa-pull-right.headerlink,.rst-content table>caption .fa-pull-right.headerlink,.rst-content tt.download span.fa-pull-right:first-child,.wy-menu-vertical li.current>a span.fa-pull-right.toctree-expand,.wy-menu-vertical li.on a span.fa-pull-right.toctree-expand,.wy-menu-vertical li span.fa-pull-right.toctree-expand{margin-left:.3em}.pull-right{float:right}.pull-left{float:left}.fa.pull-left,.pull-left.icon,.rst-content .code-block-caption .pull-left.headerlink,.rst-content .pull-left.admonition-title,.rst-content code.download span.pull-left:first-child,.rst-content dl dt .pull-left.headerlink,.rst-content h1 .pull-left.headerlink,.rst-content h2 .pull-left.headerlink,.rst-content h3 .pull-left.headerlink,.rst-content h4 .pull-left.headerlink,.rst-content h5 .pull-left.headerlink,.rst-content h6 .pull-left.headerlink,.rst-content p.caption .pull-left.headerlink,.rst-content table>caption .pull-left.headerlink,.rst-content tt.download span.pull-left:first-child,.wy-menu-vertical li.current>a span.pull-left.toctree-expand,.wy-menu-vertical li.on a span.pull-left.toctree-expand,.wy-menu-vertical li span.pull-left.toctree-expand{margin-right:.3em}.fa.pull-right,.pull-right.icon,.rst-content .code-block-caption .pull-right.headerlink,.rst-content .pull-right.admonition-title,.rst-content code.download span.pull-right:first-child,.rst-content dl dt .pull-right.headerlink,.rst-content h1 .pull-right.headerlink,.rst-content h2 .pull-right.headerlink,.rst-content h3 .pull-right.headerlink,.rst-content h4 .pull-right.headerlink,.rst-content h5 .pull-right.headerlink,.rst-content h6 .pull-right.headerlink,.rst-content p.caption .pull-right.headerlink,.rst-content table>caption .pull-right.headerlink,.rst-content tt.download span.pull-right:first-child,.wy-menu-vertical li.current>a span.pull-right.toctree-expand,.wy-menu-vertical li.on a span.pull-right.toctree-expand,.wy-menu-vertical li span.pull-right.toctree-expand{margin-left:.3em}.fa-spin{-webkit-animation:fa-spin 2s linear infinite;animation:fa-spin 2s linear infinite}.fa-pulse{-webkit-animation:fa-spin 1s steps(8) infinite;animation:fa-spin 1s steps(8) infinite}@-webkit-keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}@keyframes fa-spin{0%{-webkit-transform:rotate(0deg);transform:rotate(0deg)}to{-webkit-transform:rotate(359deg);transform:rotate(359deg)}}.fa-rotate-90{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)";-webkit-transform:rotate(90deg);-ms-transform:rotate(90deg);transform:rotate(90deg)}.fa-rotate-180{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)";-webkit-transform:rotate(180deg);-ms-transform:rotate(180deg);transform:rotate(180deg)}.fa-rotate-270{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)";-webkit-transform:rotate(270deg);-ms-transform:rotate(270deg);transform:rotate(270deg)}.fa-flip-horizontal{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)";-webkit-transform:scaleX(-1);-ms-transform:scaleX(-1);transform:scaleX(-1)}.fa-flip-vertical{-ms-filter:"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)";-webkit-transform:scaleY(-1);-ms-transform:scaleY(-1);transform:scaleY(-1)}:root .fa-flip-horizontal,:root .fa-flip-vertical,:root .fa-rotate-90,:root .fa-rotate-180,:root .fa-rotate-270{filter:none}.fa-stack{position:relative;display:inline-block;width:2em;height:2em;line-height:2em;vertical-align:middle}.fa-stack-1x,.fa-stack-2x{position:absolute;left:0;width:100%;text-align:center}.fa-stack-1x{line-height:inherit}.fa-stack-2x{font-size:2em}.fa-inverse{color:#fff}.fa-glass:before{content:""}.fa-music:before{content:""}.fa-search:before,.icon-search:before{content:""}.fa-envelope-o:before{content:""}.fa-heart:before{content:""}.fa-star:before{content:""}.fa-star-o:before{content:""}.fa-user:before{content:""}.fa-film:before{content:""}.fa-th-large:before{content:""}.fa-th:before{content:""}.fa-th-list:before{content:""}.fa-check:before{content:""}.fa-close:before,.fa-remove:before,.fa-times:before{content:""}.fa-search-plus:before{content:""}.fa-search-minus:before{content:""}.fa-power-off:before{content:""}.fa-signal:before{content:""}.fa-cog:before,.fa-gear:before{content:""}.fa-trash-o:before{content:""}.fa-home:before,.icon-home:before{content:""}.fa-file-o:before{content:""}.fa-clock-o:before{content:""}.fa-road:before{content:""}.fa-download:before,.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{content:""}.fa-arrow-circle-o-down:before{content:""}.fa-arrow-circle-o-up:before{content:""}.fa-inbox:before{content:""}.fa-play-circle-o:before{content:""}.fa-repeat:before,.fa-rotate-right:before{content:""}.fa-refresh:before{content:""}.fa-list-alt:before{content:""}.fa-lock:before{content:""}.fa-flag:before{content:""}.fa-headphones:before{content:""}.fa-volume-off:before{content:""}.fa-volume-down:before{content:""}.fa-volume-up:before{content:""}.fa-qrcode:before{content:""}.fa-barcode:before{content:""}.fa-tag:before{content:""}.fa-tags:before{content:""}.fa-book:before,.icon-book:before{content:""}.fa-bookmark:before{content:""}.fa-print:before{content:""}.fa-camera:before{content:""}.fa-font:before{content:""}.fa-bold:before{content:""}.fa-italic:before{content:""}.fa-text-height:before{content:""}.fa-text-width:before{content:""}.fa-align-left:before{content:""}.fa-align-center:before{content:""}.fa-align-right:before{content:""}.fa-align-justify:before{content:""}.fa-list:before{content:""}.fa-dedent:before,.fa-outdent:before{content:""}.fa-indent:before{content:""}.fa-video-camera:before{content:""}.fa-image:before,.fa-photo:before,.fa-picture-o:before{content:""}.fa-pencil:before{content:""}.fa-map-marker:before{content:""}.fa-adjust:before{content:""}.fa-tint:before{content:""}.fa-edit:before,.fa-pencil-square-o:before{content:""}.fa-share-square-o:before{content:""}.fa-check-square-o:before{content:""}.fa-arrows:before{content:""}.fa-step-backward:before{content:""}.fa-fast-backward:before{content:""}.fa-backward:before{content:""}.fa-play:before{content:""}.fa-pause:before{content:""}.fa-stop:before{content:""}.fa-forward:before{content:""}.fa-fast-forward:before{content:""}.fa-step-forward:before{content:""}.fa-eject:before{content:""}.fa-chevron-left:before{content:""}.fa-chevron-right:before{content:""}.fa-plus-circle:before{content:""}.fa-minus-circle:before{content:""}.fa-times-circle:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before{content:""}.fa-check-circle:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before{content:""}.fa-question-circle:before{content:""}.fa-info-circle:before{content:""}.fa-crosshairs:before{content:""}.fa-times-circle-o:before{content:""}.fa-check-circle-o:before{content:""}.fa-ban:before{content:""}.fa-arrow-left:before{content:""}.fa-arrow-right:before{content:""}.fa-arrow-up:before{content:""}.fa-arrow-down:before{content:""}.fa-mail-forward:before,.fa-share:before{content:""}.fa-expand:before{content:""}.fa-compress:before{content:""}.fa-plus:before{content:""}.fa-minus:before{content:""}.fa-asterisk:before{content:""}.fa-exclamation-circle:before,.rst-content .admonition-title:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before{content:""}.fa-gift:before{content:""}.fa-leaf:before{content:""}.fa-fire:before,.icon-fire:before{content:""}.fa-eye:before{content:""}.fa-eye-slash:before{content:""}.fa-exclamation-triangle:before,.fa-warning:before{content:""}.fa-plane:before{content:""}.fa-calendar:before{content:""}.fa-random:before{content:""}.fa-comment:before{content:""}.fa-magnet:before{content:""}.fa-chevron-up:before{content:""}.fa-chevron-down:before{content:""}.fa-retweet:before{content:""}.fa-shopping-cart:before{content:""}.fa-folder:before{content:""}.fa-folder-open:before{content:""}.fa-arrows-v:before{content:""}.fa-arrows-h:before{content:""}.fa-bar-chart-o:before,.fa-bar-chart:before{content:""}.fa-twitter-square:before{content:""}.fa-facebook-square:before{content:""}.fa-camera-retro:before{content:""}.fa-key:before{content:""}.fa-cogs:before,.fa-gears:before{content:""}.fa-comments:before{content:""}.fa-thumbs-o-up:before{content:""}.fa-thumbs-o-down:before{content:""}.fa-star-half:before{content:""}.fa-heart-o:before{content:""}.fa-sign-out:before{content:""}.fa-linkedin-square:before{content:""}.fa-thumb-tack:before{content:""}.fa-external-link:before{content:""}.fa-sign-in:before{content:""}.fa-trophy:before{content:""}.fa-github-square:before{content:""}.fa-upload:before{content:""}.fa-lemon-o:before{content:""}.fa-phone:before{content:""}.fa-square-o:before{content:""}.fa-bookmark-o:before{content:""}.fa-phone-square:before{content:""}.fa-twitter:before{content:""}.fa-facebook-f:before,.fa-facebook:before{content:""}.fa-github:before,.icon-github:before{content:""}.fa-unlock:before{content:""}.fa-credit-card:before{content:""}.fa-feed:before,.fa-rss:before{content:""}.fa-hdd-o:before{content:""}.fa-bullhorn:before{content:""}.fa-bell:before{content:""}.fa-certificate:before{content:""}.fa-hand-o-right:before{content:""}.fa-hand-o-left:before{content:""}.fa-hand-o-up:before{content:""}.fa-hand-o-down:before{content:""}.fa-arrow-circle-left:before,.icon-circle-arrow-left:before{content:""}.fa-arrow-circle-right:before,.icon-circle-arrow-right:before{content:""}.fa-arrow-circle-up:before{content:""}.fa-arrow-circle-down:before{content:""}.fa-globe:before{content:""}.fa-wrench:before{content:""}.fa-tasks:before{content:""}.fa-filter:before{content:""}.fa-briefcase:before{content:""}.fa-arrows-alt:before{content:""}.fa-group:before,.fa-users:before{content:""}.fa-chain:before,.fa-link:before,.icon-link:before{content:""}.fa-cloud:before{content:""}.fa-flask:before{content:""}.fa-cut:before,.fa-scissors:before{content:""}.fa-copy:before,.fa-files-o:before{content:""}.fa-paperclip:before{content:""}.fa-floppy-o:before,.fa-save:before{content:""}.fa-square:before{content:""}.fa-bars:before,.fa-navicon:before,.fa-reorder:before{content:""}.fa-list-ul:before{content:""}.fa-list-ol:before{content:""}.fa-strikethrough:before{content:""}.fa-underline:before{content:""}.fa-table:before{content:""}.fa-magic:before{content:""}.fa-truck:before{content:""}.fa-pinterest:before{content:""}.fa-pinterest-square:before{content:""}.fa-google-plus-square:before{content:""}.fa-google-plus:before{content:""}.fa-money:before{content:""}.fa-caret-down:before,.icon-caret-down:before,.wy-dropdown .caret:before{content:""}.fa-caret-up:before{content:""}.fa-caret-left:before{content:""}.fa-caret-right:before{content:""}.fa-columns:before{content:""}.fa-sort:before,.fa-unsorted:before{content:""}.fa-sort-desc:before,.fa-sort-down:before{content:""}.fa-sort-asc:before,.fa-sort-up:before{content:""}.fa-envelope:before{content:""}.fa-linkedin:before{content:""}.fa-rotate-left:before,.fa-undo:before{content:""}.fa-gavel:before,.fa-legal:before{content:""}.fa-dashboard:before,.fa-tachometer:before{content:""}.fa-comment-o:before{content:""}.fa-comments-o:before{content:""}.fa-bolt:before,.fa-flash:before{content:""}.fa-sitemap:before{content:""}.fa-umbrella:before{content:""}.fa-clipboard:before,.fa-paste:before{content:""}.fa-lightbulb-o:before{content:""}.fa-exchange:before{content:""}.fa-cloud-download:before{content:""}.fa-cloud-upload:before{content:""}.fa-user-md:before{content:""}.fa-stethoscope:before{content:""}.fa-suitcase:before{content:""}.fa-bell-o:before{content:""}.fa-coffee:before{content:""}.fa-cutlery:before{content:""}.fa-file-text-o:before{content:""}.fa-building-o:before{content:""}.fa-hospital-o:before{content:""}.fa-ambulance:before{content:""}.fa-medkit:before{content:""}.fa-fighter-jet:before{content:""}.fa-beer:before{content:""}.fa-h-square:before{content:""}.fa-plus-square:before{content:""}.fa-angle-double-left:before{content:""}.fa-angle-double-right:before{content:""}.fa-angle-double-up:before{content:""}.fa-angle-double-down:before{content:""}.fa-angle-left:before{content:""}.fa-angle-right:before{content:""}.fa-angle-up:before{content:""}.fa-angle-down:before{content:""}.fa-desktop:before{content:""}.fa-laptop:before{content:""}.fa-tablet:before{content:""}.fa-mobile-phone:before,.fa-mobile:before{content:""}.fa-circle-o:before{content:""}.fa-quote-left:before{content:""}.fa-quote-right:before{content:""}.fa-spinner:before{content:""}.fa-circle:before{content:""}.fa-mail-reply:before,.fa-reply:before{content:""}.fa-github-alt:before{content:""}.fa-folder-o:before{content:""}.fa-folder-open-o:before{content:""}.fa-smile-o:before{content:""}.fa-frown-o:before{content:""}.fa-meh-o:before{content:""}.fa-gamepad:before{content:""}.fa-keyboard-o:before{content:""}.fa-flag-o:before{content:""}.fa-flag-checkered:before{content:""}.fa-terminal:before{content:""}.fa-code:before{content:""}.fa-mail-reply-all:before,.fa-reply-all:before{content:""}.fa-star-half-empty:before,.fa-star-half-full:before,.fa-star-half-o:before{content:""}.fa-location-arrow:before{content:""}.fa-crop:before{content:""}.fa-code-fork:before{content:""}.fa-chain-broken:before,.fa-unlink:before{content:""}.fa-question:before{content:""}.fa-info:before{content:""}.fa-exclamation:before{content:""}.fa-superscript:before{content:""}.fa-subscript:before{content:""}.fa-eraser:before{content:""}.fa-puzzle-piece:before{content:""}.fa-microphone:before{content:""}.fa-microphone-slash:before{content:""}.fa-shield:before{content:""}.fa-calendar-o:before{content:""}.fa-fire-extinguisher:before{content:""}.fa-rocket:before{content:""}.fa-maxcdn:before{content:""}.fa-chevron-circle-left:before{content:""}.fa-chevron-circle-right:before{content:""}.fa-chevron-circle-up:before{content:""}.fa-chevron-circle-down:before{content:""}.fa-html5:before{content:""}.fa-css3:before{content:""}.fa-anchor:before{content:""}.fa-unlock-alt:before{content:""}.fa-bullseye:before{content:""}.fa-ellipsis-h:before{content:""}.fa-ellipsis-v:before{content:""}.fa-rss-square:before{content:""}.fa-play-circle:before{content:""}.fa-ticket:before{content:""}.fa-minus-square:before{content:""}.fa-minus-square-o:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before{content:""}.fa-level-up:before{content:""}.fa-level-down:before{content:""}.fa-check-square:before{content:""}.fa-pencil-square:before{content:""}.fa-external-link-square:before{content:""}.fa-share-square:before{content:""}.fa-compass:before{content:""}.fa-caret-square-o-down:before,.fa-toggle-down:before{content:""}.fa-caret-square-o-up:before,.fa-toggle-up:before{content:""}.fa-caret-square-o-right:before,.fa-toggle-right:before{content:""}.fa-eur:before,.fa-euro:before{content:""}.fa-gbp:before{content:""}.fa-dollar:before,.fa-usd:before{content:""}.fa-inr:before,.fa-rupee:before{content:""}.fa-cny:before,.fa-jpy:before,.fa-rmb:before,.fa-yen:before{content:""}.fa-rouble:before,.fa-rub:before,.fa-ruble:before{content:""}.fa-krw:before,.fa-won:before{content:""}.fa-bitcoin:before,.fa-btc:before{content:""}.fa-file:before{content:""}.fa-file-text:before{content:""}.fa-sort-alpha-asc:before{content:""}.fa-sort-alpha-desc:before{content:""}.fa-sort-amount-asc:before{content:""}.fa-sort-amount-desc:before{content:""}.fa-sort-numeric-asc:before{content:""}.fa-sort-numeric-desc:before{content:""}.fa-thumbs-up:before{content:""}.fa-thumbs-down:before{content:""}.fa-youtube-square:before{content:""}.fa-youtube:before{content:""}.fa-xing:before{content:""}.fa-xing-square:before{content:""}.fa-youtube-play:before{content:""}.fa-dropbox:before{content:""}.fa-stack-overflow:before{content:""}.fa-instagram:before{content:""}.fa-flickr:before{content:""}.fa-adn:before{content:""}.fa-bitbucket:before,.icon-bitbucket:before{content:""}.fa-bitbucket-square:before{content:""}.fa-tumblr:before{content:""}.fa-tumblr-square:before{content:""}.fa-long-arrow-down:before{content:""}.fa-long-arrow-up:before{content:""}.fa-long-arrow-left:before{content:""}.fa-long-arrow-right:before{content:""}.fa-apple:before{content:""}.fa-windows:before{content:""}.fa-android:before{content:""}.fa-linux:before{content:""}.fa-dribbble:before{content:""}.fa-skype:before{content:""}.fa-foursquare:before{content:""}.fa-trello:before{content:""}.fa-female:before{content:""}.fa-male:before{content:""}.fa-gittip:before,.fa-gratipay:before{content:""}.fa-sun-o:before{content:""}.fa-moon-o:before{content:""}.fa-archive:before{content:""}.fa-bug:before{content:""}.fa-vk:before{content:""}.fa-weibo:before{content:""}.fa-renren:before{content:""}.fa-pagelines:before{content:""}.fa-stack-exchange:before{content:""}.fa-arrow-circle-o-right:before{content:""}.fa-arrow-circle-o-left:before{content:""}.fa-caret-square-o-left:before,.fa-toggle-left:before{content:""}.fa-dot-circle-o:before{content:""}.fa-wheelchair:before{content:""}.fa-vimeo-square:before{content:""}.fa-try:before,.fa-turkish-lira:before{content:""}.fa-plus-square-o:before,.wy-menu-vertical li span.toctree-expand:before{content:""}.fa-space-shuttle:before{content:""}.fa-slack:before{content:""}.fa-envelope-square:before{content:""}.fa-wordpress:before{content:""}.fa-openid:before{content:""}.fa-bank:before,.fa-institution:before,.fa-university:before{content:""}.fa-graduation-cap:before,.fa-mortar-board:before{content:""}.fa-yahoo:before{content:""}.fa-google:before{content:""}.fa-reddit:before{content:""}.fa-reddit-square:before{content:""}.fa-stumbleupon-circle:before{content:""}.fa-stumbleupon:before{content:""}.fa-delicious:before{content:""}.fa-digg:before{content:""}.fa-pied-piper-pp:before{content:""}.fa-pied-piper-alt:before{content:""}.fa-drupal:before{content:""}.fa-joomla:before{content:""}.fa-language:before{content:""}.fa-fax:before{content:""}.fa-building:before{content:""}.fa-child:before{content:""}.fa-paw:before{content:""}.fa-spoon:before{content:""}.fa-cube:before{content:""}.fa-cubes:before{content:""}.fa-behance:before{content:""}.fa-behance-square:before{content:""}.fa-steam:before{content:""}.fa-steam-square:before{content:""}.fa-recycle:before{content:""}.fa-automobile:before,.fa-car:before{content:""}.fa-cab:before,.fa-taxi:before{content:""}.fa-tree:before{content:""}.fa-spotify:before{content:""}.fa-deviantart:before{content:""}.fa-soundcloud:before{content:""}.fa-database:before{content:""}.fa-file-pdf-o:before{content:""}.fa-file-word-o:before{content:""}.fa-file-excel-o:before{content:""}.fa-file-powerpoint-o:before{content:""}.fa-file-image-o:before,.fa-file-photo-o:before,.fa-file-picture-o:before{content:""}.fa-file-archive-o:before,.fa-file-zip-o:before{content:""}.fa-file-audio-o:before,.fa-file-sound-o:before{content:""}.fa-file-movie-o:before,.fa-file-video-o:before{content:""}.fa-file-code-o:before{content:""}.fa-vine:before{content:""}.fa-codepen:before{content:""}.fa-jsfiddle:before{content:""}.fa-life-bouy:before,.fa-life-buoy:before,.fa-life-ring:before,.fa-life-saver:before,.fa-support:before{content:""}.fa-circle-o-notch:before{content:""}.fa-ra:before,.fa-rebel:before,.fa-resistance:before{content:""}.fa-empire:before,.fa-ge:before{content:""}.fa-git-square:before{content:""}.fa-git:before{content:""}.fa-hacker-news:before,.fa-y-combinator-square:before,.fa-yc-square:before{content:""}.fa-tencent-weibo:before{content:""}.fa-qq:before{content:""}.fa-wechat:before,.fa-weixin:before{content:""}.fa-paper-plane:before,.fa-send:before{content:""}.fa-paper-plane-o:before,.fa-send-o:before{content:""}.fa-history:before{content:""}.fa-circle-thin:before{content:""}.fa-header:before{content:""}.fa-paragraph:before{content:""}.fa-sliders:before{content:""}.fa-share-alt:before{content:""}.fa-share-alt-square:before{content:""}.fa-bomb:before{content:""}.fa-futbol-o:before,.fa-soccer-ball-o:before{content:""}.fa-tty:before{content:""}.fa-binoculars:before{content:""}.fa-plug:before{content:""}.fa-slideshare:before{content:""}.fa-twitch:before{content:""}.fa-yelp:before{content:""}.fa-newspaper-o:before{content:""}.fa-wifi:before{content:""}.fa-calculator:before{content:""}.fa-paypal:before{content:""}.fa-google-wallet:before{content:""}.fa-cc-visa:before{content:""}.fa-cc-mastercard:before{content:""}.fa-cc-discover:before{content:""}.fa-cc-amex:before{content:""}.fa-cc-paypal:before{content:""}.fa-cc-stripe:before{content:""}.fa-bell-slash:before{content:""}.fa-bell-slash-o:before{content:""}.fa-trash:before{content:""}.fa-copyright:before{content:""}.fa-at:before{content:""}.fa-eyedropper:before{content:""}.fa-paint-brush:before{content:""}.fa-birthday-cake:before{content:""}.fa-area-chart:before{content:""}.fa-pie-chart:before{content:""}.fa-line-chart:before{content:""}.fa-lastfm:before{content:""}.fa-lastfm-square:before{content:""}.fa-toggle-off:before{content:""}.fa-toggle-on:before{content:""}.fa-bicycle:before{content:""}.fa-bus:before{content:""}.fa-ioxhost:before{content:""}.fa-angellist:before{content:""}.fa-cc:before{content:""}.fa-ils:before,.fa-shekel:before,.fa-sheqel:before{content:""}.fa-meanpath:before{content:""}.fa-buysellads:before{content:""}.fa-connectdevelop:before{content:""}.fa-dashcube:before{content:""}.fa-forumbee:before{content:""}.fa-leanpub:before{content:""}.fa-sellsy:before{content:""}.fa-shirtsinbulk:before{content:""}.fa-simplybuilt:before{content:""}.fa-skyatlas:before{content:""}.fa-cart-plus:before{content:""}.fa-cart-arrow-down:before{content:""}.fa-diamond:before{content:""}.fa-ship:before{content:""}.fa-user-secret:before{content:""}.fa-motorcycle:before{content:""}.fa-street-view:before{content:""}.fa-heartbeat:before{content:""}.fa-venus:before{content:""}.fa-mars:before{content:""}.fa-mercury:before{content:""}.fa-intersex:before,.fa-transgender:before{content:""}.fa-transgender-alt:before{content:""}.fa-venus-double:before{content:""}.fa-mars-double:before{content:""}.fa-venus-mars:before{content:""}.fa-mars-stroke:before{content:""}.fa-mars-stroke-v:before{content:""}.fa-mars-stroke-h:before{content:""}.fa-neuter:before{content:""}.fa-genderless:before{content:""}.fa-facebook-official:before{content:""}.fa-pinterest-p:before{content:""}.fa-whatsapp:before{content:""}.fa-server:before{content:""}.fa-user-plus:before{content:""}.fa-user-times:before{content:""}.fa-bed:before,.fa-hotel:before{content:""}.fa-viacoin:before{content:""}.fa-train:before{content:""}.fa-subway:before{content:""}.fa-medium:before{content:""}.fa-y-combinator:before,.fa-yc:before{content:""}.fa-optin-monster:before{content:""}.fa-opencart:before{content:""}.fa-expeditedssl:before{content:""}.fa-battery-4:before,.fa-battery-full:before,.fa-battery:before{content:""}.fa-battery-3:before,.fa-battery-three-quarters:before{content:""}.fa-battery-2:before,.fa-battery-half:before{content:""}.fa-battery-1:before,.fa-battery-quarter:before{content:""}.fa-battery-0:before,.fa-battery-empty:before{content:""}.fa-mouse-pointer:before{content:""}.fa-i-cursor:before{content:""}.fa-object-group:before{content:""}.fa-object-ungroup:before{content:""}.fa-sticky-note:before{content:""}.fa-sticky-note-o:before{content:""}.fa-cc-jcb:before{content:""}.fa-cc-diners-club:before{content:""}.fa-clone:before{content:""}.fa-balance-scale:before{content:""}.fa-hourglass-o:before{content:""}.fa-hourglass-1:before,.fa-hourglass-start:before{content:""}.fa-hourglass-2:before,.fa-hourglass-half:before{content:""}.fa-hourglass-3:before,.fa-hourglass-end:before{content:""}.fa-hourglass:before{content:""}.fa-hand-grab-o:before,.fa-hand-rock-o:before{content:""}.fa-hand-paper-o:before,.fa-hand-stop-o:before{content:""}.fa-hand-scissors-o:before{content:""}.fa-hand-lizard-o:before{content:""}.fa-hand-spock-o:before{content:""}.fa-hand-pointer-o:before{content:""}.fa-hand-peace-o:before{content:""}.fa-trademark:before{content:""}.fa-registered:before{content:""}.fa-creative-commons:before{content:""}.fa-gg:before{content:""}.fa-gg-circle:before{content:""}.fa-tripadvisor:before{content:""}.fa-odnoklassniki:before{content:""}.fa-odnoklassniki-square:before{content:""}.fa-get-pocket:before{content:""}.fa-wikipedia-w:before{content:""}.fa-safari:before{content:""}.fa-chrome:before{content:""}.fa-firefox:before{content:""}.fa-opera:before{content:""}.fa-internet-explorer:before{content:""}.fa-television:before,.fa-tv:before{content:""}.fa-contao:before{content:""}.fa-500px:before{content:""}.fa-amazon:before{content:""}.fa-calendar-plus-o:before{content:""}.fa-calendar-minus-o:before{content:""}.fa-calendar-times-o:before{content:""}.fa-calendar-check-o:before{content:""}.fa-industry:before{content:""}.fa-map-pin:before{content:""}.fa-map-signs:before{content:""}.fa-map-o:before{content:""}.fa-map:before{content:""}.fa-commenting:before{content:""}.fa-commenting-o:before{content:""}.fa-houzz:before{content:""}.fa-vimeo:before{content:""}.fa-black-tie:before{content:""}.fa-fonticons:before{content:""}.fa-reddit-alien:before{content:""}.fa-edge:before{content:""}.fa-credit-card-alt:before{content:""}.fa-codiepie:before{content:""}.fa-modx:before{content:""}.fa-fort-awesome:before{content:""}.fa-usb:before{content:""}.fa-product-hunt:before{content:""}.fa-mixcloud:before{content:""}.fa-scribd:before{content:""}.fa-pause-circle:before{content:""}.fa-pause-circle-o:before{content:""}.fa-stop-circle:before{content:""}.fa-stop-circle-o:before{content:""}.fa-shopping-bag:before{content:""}.fa-shopping-basket:before{content:""}.fa-hashtag:before{content:""}.fa-bluetooth:before{content:""}.fa-bluetooth-b:before{content:""}.fa-percent:before{content:""}.fa-gitlab:before,.icon-gitlab:before{content:""}.fa-wpbeginner:before{content:""}.fa-wpforms:before{content:""}.fa-envira:before{content:""}.fa-universal-access:before{content:""}.fa-wheelchair-alt:before{content:""}.fa-question-circle-o:before{content:""}.fa-blind:before{content:""}.fa-audio-description:before{content:""}.fa-volume-control-phone:before{content:""}.fa-braille:before{content:""}.fa-assistive-listening-systems:before{content:""}.fa-american-sign-language-interpreting:before,.fa-asl-interpreting:before{content:""}.fa-deaf:before,.fa-deafness:before,.fa-hard-of-hearing:before{content:""}.fa-glide:before{content:""}.fa-glide-g:before{content:""}.fa-sign-language:before,.fa-signing:before{content:""}.fa-low-vision:before{content:""}.fa-viadeo:before{content:""}.fa-viadeo-square:before{content:""}.fa-snapchat:before{content:""}.fa-snapchat-ghost:before{content:""}.fa-snapchat-square:before{content:""}.fa-pied-piper:before{content:""}.fa-first-order:before{content:""}.fa-yoast:before{content:""}.fa-themeisle:before{content:""}.fa-google-plus-circle:before,.fa-google-plus-official:before{content:""}.fa-fa:before,.fa-font-awesome:before{content:""}.fa-handshake-o:before{content:""}.fa-envelope-open:before{content:""}.fa-envelope-open-o:before{content:""}.fa-linode:before{content:""}.fa-address-book:before{content:""}.fa-address-book-o:before{content:""}.fa-address-card:before,.fa-vcard:before{content:""}.fa-address-card-o:before,.fa-vcard-o:before{content:""}.fa-user-circle:before{content:""}.fa-user-circle-o:before{content:""}.fa-user-o:before{content:""}.fa-id-badge:before{content:""}.fa-drivers-license:before,.fa-id-card:before{content:""}.fa-drivers-license-o:before,.fa-id-card-o:before{content:""}.fa-quora:before{content:""}.fa-free-code-camp:before{content:""}.fa-telegram:before{content:""}.fa-thermometer-4:before,.fa-thermometer-full:before,.fa-thermometer:before{content:""}.fa-thermometer-3:before,.fa-thermometer-three-quarters:before{content:""}.fa-thermometer-2:before,.fa-thermometer-half:before{content:""}.fa-thermometer-1:before,.fa-thermometer-quarter:before{content:""}.fa-thermometer-0:before,.fa-thermometer-empty:before{content:""}.fa-shower:before{content:""}.fa-bath:before,.fa-bathtub:before,.fa-s15:before{content:""}.fa-podcast:before{content:""}.fa-window-maximize:before{content:""}.fa-window-minimize:before{content:""}.fa-window-restore:before{content:""}.fa-times-rectangle:before,.fa-window-close:before{content:""}.fa-times-rectangle-o:before,.fa-window-close-o:before{content:""}.fa-bandcamp:before{content:""}.fa-grav:before{content:""}.fa-etsy:before{content:""}.fa-imdb:before{content:""}.fa-ravelry:before{content:""}.fa-eercast:before{content:""}.fa-microchip:before{content:""}.fa-snowflake-o:before{content:""}.fa-superpowers:before{content:""}.fa-wpexplorer:before{content:""}.fa-meetup:before{content:""}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}.fa,.icon,.rst-content .admonition-title,.rst-content .code-block-caption .headerlink,.rst-content code.download span:first-child,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink,.rst-content tt.download span:first-child,.wy-dropdown .caret,.wy-inline-validate.wy-inline-validate-danger .wy-input-context,.wy-inline-validate.wy-inline-validate-info .wy-input-context,.wy-inline-validate.wy-inline-validate-success .wy-input-context,.wy-inline-validate.wy-inline-validate-warning .wy-input-context,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li span.toctree-expand{font-family:inherit}.fa:before,.icon:before,.rst-content .admonition-title:before,.rst-content .code-block-caption .headerlink:before,.rst-content code.download span:first-child:before,.rst-content dl dt .headerlink:before,.rst-content h1 .headerlink:before,.rst-content h2 .headerlink:before,.rst-content h3 .headerlink:before,.rst-content h4 .headerlink:before,.rst-content h5 .headerlink:before,.rst-content h6 .headerlink:before,.rst-content p.caption .headerlink:before,.rst-content table>caption .headerlink:before,.rst-content tt.download span:first-child:before,.wy-dropdown .caret:before,.wy-inline-validate.wy-inline-validate-danger .wy-input-context:before,.wy-inline-validate.wy-inline-validate-info .wy-input-context:before,.wy-inline-validate.wy-inline-validate-success .wy-input-context:before,.wy-inline-validate.wy-inline-validate-warning .wy-input-context:before,.wy-menu-vertical li.current>a span.toctree-expand:before,.wy-menu-vertical li.on a span.toctree-expand:before,.wy-menu-vertical li span.toctree-expand:before{font-family:FontAwesome;display:inline-block;font-style:normal;font-weight:400;line-height:1;text-decoration:inherit}.rst-content .code-block-caption a .headerlink,.rst-content a .admonition-title,.rst-content code.download a span:first-child,.rst-content dl dt a .headerlink,.rst-content h1 a .headerlink,.rst-content h2 a .headerlink,.rst-content h3 a .headerlink,.rst-content h4 a .headerlink,.rst-content h5 a .headerlink,.rst-content h6 a .headerlink,.rst-content p.caption a .headerlink,.rst-content table>caption a .headerlink,.rst-content tt.download a span:first-child,.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand,.wy-menu-vertical li a span.toctree-expand,a .fa,a .icon,a .rst-content .admonition-title,a .rst-content .code-block-caption .headerlink,a .rst-content code.download span:first-child,a .rst-content dl dt .headerlink,a .rst-content h1 .headerlink,a .rst-content h2 .headerlink,a .rst-content h3 .headerlink,a .rst-content h4 .headerlink,a .rst-content h5 .headerlink,a .rst-content h6 .headerlink,a .rst-content p.caption .headerlink,a .rst-content table>caption .headerlink,a .rst-content tt.download span:first-child,a .wy-menu-vertical li span.toctree-expand{display:inline-block;text-decoration:inherit}.btn .fa,.btn .icon,.btn .rst-content .admonition-title,.btn .rst-content .code-block-caption .headerlink,.btn .rst-content code.download span:first-child,.btn .rst-content dl dt .headerlink,.btn .rst-content h1 .headerlink,.btn .rst-content h2 .headerlink,.btn .rst-content h3 .headerlink,.btn .rst-content h4 .headerlink,.btn .rst-content h5 .headerlink,.btn .rst-content h6 .headerlink,.btn .rst-content p.caption .headerlink,.btn .rst-content table>caption .headerlink,.btn .rst-content tt.download span:first-child,.btn .wy-menu-vertical li.current>a span.toctree-expand,.btn .wy-menu-vertical li.on a span.toctree-expand,.btn .wy-menu-vertical li span.toctree-expand,.nav .fa,.nav .icon,.nav .rst-content .admonition-title,.nav .rst-content .code-block-caption .headerlink,.nav .rst-content code.download span:first-child,.nav .rst-content dl dt .headerlink,.nav .rst-content h1 .headerlink,.nav .rst-content h2 .headerlink,.nav .rst-content h3 .headerlink,.nav .rst-content h4 .headerlink,.nav .rst-content h5 .headerlink,.nav .rst-content h6 .headerlink,.nav .rst-content p.caption .headerlink,.nav .rst-content table>caption .headerlink,.nav .rst-content tt.download span:first-child,.nav .wy-menu-vertical li.current>a span.toctree-expand,.nav .wy-menu-vertical li.on a span.toctree-expand,.nav .wy-menu-vertical li span.toctree-expand,.rst-content .btn .admonition-title,.rst-content .code-block-caption .btn .headerlink,.rst-content .code-block-caption .nav .headerlink,.rst-content .nav .admonition-title,.rst-content code.download .btn span:first-child,.rst-content code.download .nav span:first-child,.rst-content dl dt .btn .headerlink,.rst-content dl dt .nav .headerlink,.rst-content h1 .btn .headerlink,.rst-content h1 .nav .headerlink,.rst-content h2 .btn .headerlink,.rst-content h2 .nav .headerlink,.rst-content h3 .btn .headerlink,.rst-content h3 .nav .headerlink,.rst-content h4 .btn .headerlink,.rst-content h4 .nav .headerlink,.rst-content h5 .btn .headerlink,.rst-content h5 .nav .headerlink,.rst-content h6 .btn .headerlink,.rst-content h6 .nav .headerlink,.rst-content p.caption .btn .headerlink,.rst-content p.caption .nav .headerlink,.rst-content table>caption .btn .headerlink,.rst-content table>caption .nav .headerlink,.rst-content tt.download .btn span:first-child,.rst-content tt.download .nav span:first-child,.wy-menu-vertical li .btn span.toctree-expand,.wy-menu-vertical li.current>a .btn span.toctree-expand,.wy-menu-vertical li.current>a .nav span.toctree-expand,.wy-menu-vertical li .nav span.toctree-expand,.wy-menu-vertical li.on a .btn span.toctree-expand,.wy-menu-vertical li.on a .nav span.toctree-expand{display:inline}.btn .fa-large.icon,.btn .fa.fa-large,.btn .rst-content .code-block-caption .fa-large.headerlink,.btn .rst-content .fa-large.admonition-title,.btn .rst-content code.download span.fa-large:first-child,.btn .rst-content dl dt .fa-large.headerlink,.btn .rst-content h1 .fa-large.headerlink,.btn .rst-content h2 .fa-large.headerlink,.btn .rst-content h3 .fa-large.headerlink,.btn .rst-content h4 .fa-large.headerlink,.btn .rst-content h5 .fa-large.headerlink,.btn .rst-content h6 .fa-large.headerlink,.btn .rst-content p.caption .fa-large.headerlink,.btn .rst-content table>caption .fa-large.headerlink,.btn .rst-content tt.download span.fa-large:first-child,.btn .wy-menu-vertical li span.fa-large.toctree-expand,.nav .fa-large.icon,.nav .fa.fa-large,.nav .rst-content .code-block-caption .fa-large.headerlink,.nav .rst-content .fa-large.admonition-title,.nav .rst-content code.download span.fa-large:first-child,.nav .rst-content dl dt .fa-large.headerlink,.nav .rst-content h1 .fa-large.headerlink,.nav .rst-content h2 .fa-large.headerlink,.nav .rst-content h3 .fa-large.headerlink,.nav .rst-content h4 .fa-large.headerlink,.nav .rst-content h5 .fa-large.headerlink,.nav .rst-content h6 .fa-large.headerlink,.nav .rst-content p.caption .fa-large.headerlink,.nav .rst-content table>caption .fa-large.headerlink,.nav .rst-content tt.download span.fa-large:first-child,.nav .wy-menu-vertical li span.fa-large.toctree-expand,.rst-content .btn .fa-large.admonition-title,.rst-content .code-block-caption .btn .fa-large.headerlink,.rst-content .code-block-caption .nav .fa-large.headerlink,.rst-content .nav .fa-large.admonition-title,.rst-content code.download .btn span.fa-large:first-child,.rst-content code.download .nav span.fa-large:first-child,.rst-content dl dt .btn .fa-large.headerlink,.rst-content dl dt .nav .fa-large.headerlink,.rst-content h1 .btn .fa-large.headerlink,.rst-content h1 .nav .fa-large.headerlink,.rst-content h2 .btn .fa-large.headerlink,.rst-content h2 .nav .fa-large.headerlink,.rst-content h3 .btn .fa-large.headerlink,.rst-content h3 .nav .fa-large.headerlink,.rst-content h4 .btn .fa-large.headerlink,.rst-content h4 .nav .fa-large.headerlink,.rst-content h5 .btn .fa-large.headerlink,.rst-content h5 .nav .fa-large.headerlink,.rst-content h6 .btn .fa-large.headerlink,.rst-content h6 .nav .fa-large.headerlink,.rst-content p.caption .btn .fa-large.headerlink,.rst-content p.caption .nav .fa-large.headerlink,.rst-content table>caption .btn .fa-large.headerlink,.rst-content table>caption .nav .fa-large.headerlink,.rst-content tt.download .btn span.fa-large:first-child,.rst-content tt.download .nav span.fa-large:first-child,.wy-menu-vertical li .btn span.fa-large.toctree-expand,.wy-menu-vertical li .nav span.fa-large.toctree-expand{line-height:.9em}.btn .fa-spin.icon,.btn .fa.fa-spin,.btn .rst-content .code-block-caption .fa-spin.headerlink,.btn .rst-content .fa-spin.admonition-title,.btn .rst-content code.download span.fa-spin:first-child,.btn .rst-content dl dt .fa-spin.headerlink,.btn .rst-content h1 .fa-spin.headerlink,.btn .rst-content h2 .fa-spin.headerlink,.btn .rst-content h3 .fa-spin.headerlink,.btn .rst-content h4 .fa-spin.headerlink,.btn .rst-content h5 .fa-spin.headerlink,.btn .rst-content h6 .fa-spin.headerlink,.btn .rst-content p.caption .fa-spin.headerlink,.btn .rst-content table>caption .fa-spin.headerlink,.btn .rst-content tt.download span.fa-spin:first-child,.btn .wy-menu-vertical li span.fa-spin.toctree-expand,.nav .fa-spin.icon,.nav .fa.fa-spin,.nav .rst-content .code-block-caption .fa-spin.headerlink,.nav .rst-content .fa-spin.admonition-title,.nav .rst-content code.download span.fa-spin:first-child,.nav .rst-content dl dt .fa-spin.headerlink,.nav .rst-content h1 .fa-spin.headerlink,.nav .rst-content h2 .fa-spin.headerlink,.nav .rst-content h3 .fa-spin.headerlink,.nav .rst-content h4 .fa-spin.headerlink,.nav .rst-content h5 .fa-spin.headerlink,.nav .rst-content h6 .fa-spin.headerlink,.nav .rst-content p.caption .fa-spin.headerlink,.nav .rst-content table>caption .fa-spin.headerlink,.nav .rst-content tt.download span.fa-spin:first-child,.nav .wy-menu-vertical li span.fa-spin.toctree-expand,.rst-content .btn .fa-spin.admonition-title,.rst-content .code-block-caption .btn .fa-spin.headerlink,.rst-content .code-block-caption .nav .fa-spin.headerlink,.rst-content .nav .fa-spin.admonition-title,.rst-content code.download .btn span.fa-spin:first-child,.rst-content code.download .nav span.fa-spin:first-child,.rst-content dl dt .btn .fa-spin.headerlink,.rst-content dl dt .nav .fa-spin.headerlink,.rst-content h1 .btn .fa-spin.headerlink,.rst-content h1 .nav .fa-spin.headerlink,.rst-content h2 .btn .fa-spin.headerlink,.rst-content h2 .nav .fa-spin.headerlink,.rst-content h3 .btn .fa-spin.headerlink,.rst-content h3 .nav .fa-spin.headerlink,.rst-content h4 .btn .fa-spin.headerlink,.rst-content h4 .nav .fa-spin.headerlink,.rst-content h5 .btn .fa-spin.headerlink,.rst-content h5 .nav .fa-spin.headerlink,.rst-content h6 .btn .fa-spin.headerlink,.rst-content h6 .nav .fa-spin.headerlink,.rst-content p.caption .btn .fa-spin.headerlink,.rst-content p.caption .nav .fa-spin.headerlink,.rst-content table>caption .btn .fa-spin.headerlink,.rst-content table>caption .nav .fa-spin.headerlink,.rst-content tt.download .btn span.fa-spin:first-child,.rst-content tt.download .nav span.fa-spin:first-child,.wy-menu-vertical li .btn span.fa-spin.toctree-expand,.wy-menu-vertical li .nav span.fa-spin.toctree-expand{display:inline-block}.btn.fa:before,.btn.icon:before,.rst-content .btn.admonition-title:before,.rst-content .code-block-caption .btn.headerlink:before,.rst-content code.download span.btn:first-child:before,.rst-content dl dt .btn.headerlink:before,.rst-content h1 .btn.headerlink:before,.rst-content h2 .btn.headerlink:before,.rst-content h3 .btn.headerlink:before,.rst-content h4 .btn.headerlink:before,.rst-content h5 .btn.headerlink:before,.rst-content h6 .btn.headerlink:before,.rst-content p.caption .btn.headerlink:before,.rst-content table>caption .btn.headerlink:before,.rst-content tt.download span.btn:first-child:before,.wy-menu-vertical li span.btn.toctree-expand:before{opacity:.5;-webkit-transition:opacity .05s ease-in;-moz-transition:opacity .05s ease-in;transition:opacity .05s ease-in}.btn.fa:hover:before,.btn.icon:hover:before,.rst-content .btn.admonition-title:hover:before,.rst-content .code-block-caption .btn.headerlink:hover:before,.rst-content code.download span.btn:first-child:hover:before,.rst-content dl dt .btn.headerlink:hover:before,.rst-content h1 .btn.headerlink:hover:before,.rst-content h2 .btn.headerlink:hover:before,.rst-content h3 .btn.headerlink:hover:before,.rst-content h4 .btn.headerlink:hover:before,.rst-content h5 .btn.headerlink:hover:before,.rst-content h6 .btn.headerlink:hover:before,.rst-content p.caption .btn.headerlink:hover:before,.rst-content table>caption .btn.headerlink:hover:before,.rst-content tt.download span.btn:first-child:hover:before,.wy-menu-vertical li span.btn.toctree-expand:hover:before{opacity:1}.btn-mini .fa:before,.btn-mini .icon:before,.btn-mini .rst-content .admonition-title:before,.btn-mini .rst-content .code-block-caption .headerlink:before,.btn-mini .rst-content code.download span:first-child:before,.btn-mini .rst-content dl dt .headerlink:before,.btn-mini .rst-content h1 .headerlink:before,.btn-mini .rst-content h2 .headerlink:before,.btn-mini .rst-content h3 .headerlink:before,.btn-mini .rst-content h4 .headerlink:before,.btn-mini .rst-content h5 .headerlink:before,.btn-mini .rst-content h6 .headerlink:before,.btn-mini .rst-content p.caption .headerlink:before,.btn-mini .rst-content table>caption .headerlink:before,.btn-mini .rst-content tt.download span:first-child:before,.btn-mini .wy-menu-vertical li span.toctree-expand:before,.rst-content .btn-mini .admonition-title:before,.rst-content .code-block-caption .btn-mini .headerlink:before,.rst-content code.download .btn-mini span:first-child:before,.rst-content dl dt .btn-mini .headerlink:before,.rst-content h1 .btn-mini .headerlink:before,.rst-content h2 .btn-mini .headerlink:before,.rst-content h3 .btn-mini .headerlink:before,.rst-content h4 .btn-mini .headerlink:before,.rst-content h5 .btn-mini .headerlink:before,.rst-content h6 .btn-mini .headerlink:before,.rst-content p.caption .btn-mini .headerlink:before,.rst-content table>caption .btn-mini .headerlink:before,.rst-content tt.download .btn-mini span:first-child:before,.wy-menu-vertical li .btn-mini span.toctree-expand:before{font-size:14px;vertical-align:-15%}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning,.wy-alert{padding:12px;line-height:24px;margin-bottom:24px;background:#e7f2fa}.rst-content .admonition-title,.wy-alert-title{font-weight:700;display:block;color:#fff;background:#6ab0de;padding:6px 12px;margin:-12px -12px 12px}.rst-content .danger,.rst-content .error,.rst-content .wy-alert-danger.admonition,.rst-content .wy-alert-danger.admonition-todo,.rst-content .wy-alert-danger.attention,.rst-content .wy-alert-danger.caution,.rst-content .wy-alert-danger.hint,.rst-content .wy-alert-danger.important,.rst-content .wy-alert-danger.note,.rst-content .wy-alert-danger.seealso,.rst-content .wy-alert-danger.tip,.rst-content .wy-alert-danger.warning,.wy-alert.wy-alert-danger{background:#fdf3f2}.rst-content .danger .admonition-title,.rst-content .danger .wy-alert-title,.rst-content .error .admonition-title,.rst-content .error .wy-alert-title,.rst-content .wy-alert-danger.admonition-todo .admonition-title,.rst-content .wy-alert-danger.admonition-todo .wy-alert-title,.rst-content .wy-alert-danger.admonition .admonition-title,.rst-content .wy-alert-danger.admonition .wy-alert-title,.rst-content .wy-alert-danger.attention .admonition-title,.rst-content .wy-alert-danger.attention .wy-alert-title,.rst-content .wy-alert-danger.caution .admonition-title,.rst-content .wy-alert-danger.caution .wy-alert-title,.rst-content .wy-alert-danger.hint .admonition-title,.rst-content .wy-alert-danger.hint .wy-alert-title,.rst-content .wy-alert-danger.important .admonition-title,.rst-content .wy-alert-danger.important .wy-alert-title,.rst-content .wy-alert-danger.note .admonition-title,.rst-content .wy-alert-danger.note .wy-alert-title,.rst-content .wy-alert-danger.seealso .admonition-title,.rst-content .wy-alert-danger.seealso .wy-alert-title,.rst-content .wy-alert-danger.tip .admonition-title,.rst-content .wy-alert-danger.tip .wy-alert-title,.rst-content .wy-alert-danger.warning .admonition-title,.rst-content .wy-alert-danger.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-danger .admonition-title,.wy-alert.wy-alert-danger .rst-content .admonition-title,.wy-alert.wy-alert-danger .wy-alert-title{background:#f29f97}.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .warning,.rst-content .wy-alert-warning.admonition,.rst-content .wy-alert-warning.danger,.rst-content .wy-alert-warning.error,.rst-content .wy-alert-warning.hint,.rst-content .wy-alert-warning.important,.rst-content .wy-alert-warning.note,.rst-content .wy-alert-warning.seealso,.rst-content .wy-alert-warning.tip,.wy-alert.wy-alert-warning{background:#ffedcc}.rst-content .admonition-todo .admonition-title,.rst-content .admonition-todo .wy-alert-title,.rst-content .attention .admonition-title,.rst-content .attention .wy-alert-title,.rst-content .caution .admonition-title,.rst-content .caution .wy-alert-title,.rst-content .warning .admonition-title,.rst-content .warning .wy-alert-title,.rst-content .wy-alert-warning.admonition .admonition-title,.rst-content .wy-alert-warning.admonition .wy-alert-title,.rst-content .wy-alert-warning.danger .admonition-title,.rst-content .wy-alert-warning.danger .wy-alert-title,.rst-content .wy-alert-warning.error .admonition-title,.rst-content .wy-alert-warning.error .wy-alert-title,.rst-content .wy-alert-warning.hint .admonition-title,.rst-content .wy-alert-warning.hint .wy-alert-title,.rst-content .wy-alert-warning.important .admonition-title,.rst-content .wy-alert-warning.important .wy-alert-title,.rst-content .wy-alert-warning.note .admonition-title,.rst-content .wy-alert-warning.note .wy-alert-title,.rst-content .wy-alert-warning.seealso .admonition-title,.rst-content .wy-alert-warning.seealso .wy-alert-title,.rst-content .wy-alert-warning.tip .admonition-title,.rst-content .wy-alert-warning.tip .wy-alert-title,.rst-content .wy-alert.wy-alert-warning .admonition-title,.wy-alert.wy-alert-warning .rst-content .admonition-title,.wy-alert.wy-alert-warning .wy-alert-title{background:#f0b37e}.rst-content .note,.rst-content .seealso,.rst-content .wy-alert-info.admonition,.rst-content .wy-alert-info.admonition-todo,.rst-content .wy-alert-info.attention,.rst-content .wy-alert-info.caution,.rst-content .wy-alert-info.danger,.rst-content .wy-alert-info.error,.rst-content .wy-alert-info.hint,.rst-content .wy-alert-info.important,.rst-content .wy-alert-info.tip,.rst-content .wy-alert-info.warning,.wy-alert.wy-alert-info{background:#e7f2fa}.rst-content .note .admonition-title,.rst-content .note .wy-alert-title,.rst-content .seealso .admonition-title,.rst-content .seealso .wy-alert-title,.rst-content .wy-alert-info.admonition-todo .admonition-title,.rst-content .wy-alert-info.admonition-todo .wy-alert-title,.rst-content .wy-alert-info.admonition .admonition-title,.rst-content .wy-alert-info.admonition .wy-alert-title,.rst-content .wy-alert-info.attention .admonition-title,.rst-content .wy-alert-info.attention .wy-alert-title,.rst-content .wy-alert-info.caution .admonition-title,.rst-content .wy-alert-info.caution .wy-alert-title,.rst-content .wy-alert-info.danger .admonition-title,.rst-content .wy-alert-info.danger .wy-alert-title,.rst-content .wy-alert-info.error .admonition-title,.rst-content .wy-alert-info.error .wy-alert-title,.rst-content .wy-alert-info.hint .admonition-title,.rst-content .wy-alert-info.hint .wy-alert-title,.rst-content .wy-alert-info.important .admonition-title,.rst-content .wy-alert-info.important .wy-alert-title,.rst-content .wy-alert-info.tip .admonition-title,.rst-content .wy-alert-info.tip .wy-alert-title,.rst-content .wy-alert-info.warning .admonition-title,.rst-content .wy-alert-info.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-info .admonition-title,.wy-alert.wy-alert-info .rst-content .admonition-title,.wy-alert.wy-alert-info .wy-alert-title{background:#6ab0de}.rst-content .hint,.rst-content .important,.rst-content .tip,.rst-content .wy-alert-success.admonition,.rst-content .wy-alert-success.admonition-todo,.rst-content .wy-alert-success.attention,.rst-content .wy-alert-success.caution,.rst-content .wy-alert-success.danger,.rst-content .wy-alert-success.error,.rst-content .wy-alert-success.note,.rst-content .wy-alert-success.seealso,.rst-content .wy-alert-success.warning,.wy-alert.wy-alert-success{background:#dbfaf4}.rst-content .hint .admonition-title,.rst-content .hint .wy-alert-title,.rst-content .important .admonition-title,.rst-content .important .wy-alert-title,.rst-content .tip .admonition-title,.rst-content .tip .wy-alert-title,.rst-content .wy-alert-success.admonition-todo .admonition-title,.rst-content .wy-alert-success.admonition-todo .wy-alert-title,.rst-content .wy-alert-success.admonition .admonition-title,.rst-content .wy-alert-success.admonition .wy-alert-title,.rst-content .wy-alert-success.attention .admonition-title,.rst-content .wy-alert-success.attention .wy-alert-title,.rst-content .wy-alert-success.caution .admonition-title,.rst-content .wy-alert-success.caution .wy-alert-title,.rst-content .wy-alert-success.danger .admonition-title,.rst-content .wy-alert-success.danger .wy-alert-title,.rst-content .wy-alert-success.error .admonition-title,.rst-content .wy-alert-success.error .wy-alert-title,.rst-content .wy-alert-success.note .admonition-title,.rst-content .wy-alert-success.note .wy-alert-title,.rst-content .wy-alert-success.seealso .admonition-title,.rst-content .wy-alert-success.seealso .wy-alert-title,.rst-content .wy-alert-success.warning .admonition-title,.rst-content .wy-alert-success.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-success .admonition-title,.wy-alert.wy-alert-success .rst-content .admonition-title,.wy-alert.wy-alert-success .wy-alert-title{background:#1abc9c}.rst-content .wy-alert-neutral.admonition,.rst-content .wy-alert-neutral.admonition-todo,.rst-content .wy-alert-neutral.attention,.rst-content .wy-alert-neutral.caution,.rst-content .wy-alert-neutral.danger,.rst-content .wy-alert-neutral.error,.rst-content .wy-alert-neutral.hint,.rst-content .wy-alert-neutral.important,.rst-content .wy-alert-neutral.note,.rst-content .wy-alert-neutral.seealso,.rst-content .wy-alert-neutral.tip,.rst-content .wy-alert-neutral.warning,.wy-alert.wy-alert-neutral{background:#f3f6f6}.rst-content .wy-alert-neutral.admonition-todo .admonition-title,.rst-content .wy-alert-neutral.admonition-todo .wy-alert-title,.rst-content .wy-alert-neutral.admonition .admonition-title,.rst-content .wy-alert-neutral.admonition .wy-alert-title,.rst-content .wy-alert-neutral.attention .admonition-title,.rst-content .wy-alert-neutral.attention .wy-alert-title,.rst-content .wy-alert-neutral.caution .admonition-title,.rst-content .wy-alert-neutral.caution .wy-alert-title,.rst-content .wy-alert-neutral.danger .admonition-title,.rst-content .wy-alert-neutral.danger .wy-alert-title,.rst-content .wy-alert-neutral.error .admonition-title,.rst-content .wy-alert-neutral.error .wy-alert-title,.rst-content .wy-alert-neutral.hint .admonition-title,.rst-content .wy-alert-neutral.hint .wy-alert-title,.rst-content .wy-alert-neutral.important .admonition-title,.rst-content .wy-alert-neutral.important .wy-alert-title,.rst-content .wy-alert-neutral.note .admonition-title,.rst-content .wy-alert-neutral.note .wy-alert-title,.rst-content .wy-alert-neutral.seealso .admonition-title,.rst-content .wy-alert-neutral.seealso .wy-alert-title,.rst-content .wy-alert-neutral.tip .admonition-title,.rst-content .wy-alert-neutral.tip .wy-alert-title,.rst-content .wy-alert-neutral.warning .admonition-title,.rst-content .wy-alert-neutral.warning .wy-alert-title,.rst-content .wy-alert.wy-alert-neutral .admonition-title,.wy-alert.wy-alert-neutral .rst-content .admonition-title,.wy-alert.wy-alert-neutral .wy-alert-title{color:#404040;background:#e1e4e5}.rst-content .wy-alert-neutral.admonition-todo a,.rst-content .wy-alert-neutral.admonition a,.rst-content .wy-alert-neutral.attention a,.rst-content .wy-alert-neutral.caution a,.rst-content .wy-alert-neutral.danger a,.rst-content .wy-alert-neutral.error a,.rst-content .wy-alert-neutral.hint a,.rst-content .wy-alert-neutral.important a,.rst-content .wy-alert-neutral.note a,.rst-content .wy-alert-neutral.seealso a,.rst-content .wy-alert-neutral.tip a,.rst-content .wy-alert-neutral.warning a,.wy-alert.wy-alert-neutral a{color:#2980b9}.rst-content .admonition-todo p:last-child,.rst-content .admonition p:last-child,.rst-content .attention p:last-child,.rst-content .caution p:last-child,.rst-content .danger p:last-child,.rst-content .error p:last-child,.rst-content .hint p:last-child,.rst-content .important p:last-child,.rst-content .note p:last-child,.rst-content .seealso p:last-child,.rst-content .tip p:last-child,.rst-content .warning p:last-child,.wy-alert p:last-child{margin-bottom:0}.wy-tray-container{position:fixed;bottom:0;left:0;z-index:600}.wy-tray-container li{display:block;width:300px;background:transparent;color:#fff;text-align:center;box-shadow:0 5px 5px 0 rgba(0,0,0,.1);padding:0 24px;min-width:20%;opacity:0;height:0;line-height:56px;overflow:hidden;-webkit-transition:all .3s ease-in;-moz-transition:all .3s ease-in;transition:all .3s ease-in}.wy-tray-container li.wy-tray-item-success{background:#27ae60}.wy-tray-container li.wy-tray-item-info{background:#2980b9}.wy-tray-container li.wy-tray-item-warning{background:#e67e22}.wy-tray-container li.wy-tray-item-danger{background:#e74c3c}.wy-tray-container li.on{opacity:1;height:56px}@media screen and (max-width:768px){.wy-tray-container{bottom:auto;top:0;width:100%}.wy-tray-container li{width:100%}}button{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle;cursor:pointer;line-height:normal;-webkit-appearance:button;*overflow:visible}button::-moz-focus-inner,input::-moz-focus-inner{border:0;padding:0}button[disabled]{cursor:default}.btn{display:inline-block;border-radius:2px;line-height:normal;white-space:nowrap;text-align:center;cursor:pointer;font-size:100%;padding:6px 12px 8px;color:#fff;border:1px solid rgba(0,0,0,.1);background-color:#27ae60;text-decoration:none;font-weight:400;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 2px -1px hsla(0,0%,100%,.5),inset 0 -2px 0 0 rgba(0,0,0,.1);outline-none:false;vertical-align:middle;*display:inline;zoom:1;-webkit-user-drag:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-transition:all .1s linear;-moz-transition:all .1s linear;transition:all .1s linear}.btn-hover{background:#2e8ece;color:#fff}.btn:hover{background:#2cc36b;color:#fff}.btn:focus{background:#2cc36b;outline:0}.btn:active{box-shadow:inset 0 -1px 0 0 rgba(0,0,0,.05),inset 0 2px 0 0 rgba(0,0,0,.1);padding:8px 12px 6px}.btn:visited{color:#fff}.btn-disabled,.btn-disabled:active,.btn-disabled:focus,.btn-disabled:hover,.btn:disabled{background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled = false);filter:alpha(opacity=40);opacity:.4;cursor:not-allowed;box-shadow:none}.btn::-moz-focus-inner{padding:0;border:0}.btn-small{font-size:80%}.btn-info{background-color:#2980b9!important}.btn-info:hover{background-color:#2e8ece!important}.btn-neutral{background-color:#f3f6f6!important;color:#404040!important}.btn-neutral:hover{background-color:#e5ebeb!important;color:#404040}.btn-neutral:visited{color:#404040!important}.btn-success{background-color:#27ae60!important}.btn-success:hover{background-color:#295!important}.btn-danger{background-color:#e74c3c!important}.btn-danger:hover{background-color:#ea6153!important}.btn-warning{background-color:#e67e22!important}.btn-warning:hover{background-color:#e98b39!important}.btn-invert{background-color:#222}.btn-invert:hover{background-color:#2f2f2f!important}.btn-link{background-color:transparent!important;color:#2980b9;box-shadow:none;border-color:transparent!important}.btn-link:active,.btn-link:hover{background-color:transparent!important;color:#409ad5!important;box-shadow:none}.btn-link:visited{color:#9b59b6}.wy-btn-group .btn,.wy-control .btn{vertical-align:middle}.wy-btn-group{margin-bottom:24px;*zoom:1}.wy-btn-group:after,.wy-btn-group:before{display:table;content:""}.wy-btn-group:after{clear:both}.wy-dropdown{position:relative;display:inline-block}.wy-dropdown-active .wy-dropdown-menu{display:block}.wy-dropdown-menu{position:absolute;left:0;display:none;float:left;top:100%;min-width:100%;background:#fcfcfc;z-index:100;border:1px solid #cfd7dd;box-shadow:0 2px 2px 0 rgba(0,0,0,.1);padding:12px}.wy-dropdown-menu>dd>a{display:block;clear:both;color:#404040;white-space:nowrap;font-size:90%;padding:0 12px;cursor:pointer}.wy-dropdown-menu>dd>a:hover{background:#2980b9;color:#fff}.wy-dropdown-menu>dd.divider{border-top:1px solid #cfd7dd;margin:6px 0}.wy-dropdown-menu>dd.search{padding-bottom:12px}.wy-dropdown-menu>dd.search input[type=search]{width:100%}.wy-dropdown-menu>dd.call-to-action{background:#e3e3e3;text-transform:uppercase;font-weight:500;font-size:80%}.wy-dropdown-menu>dd.call-to-action:hover{background:#e3e3e3}.wy-dropdown-menu>dd.call-to-action .btn{color:#fff}.wy-dropdown.wy-dropdown-up .wy-dropdown-menu{bottom:100%;top:auto;left:auto;right:0}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu{background:#fcfcfc;margin-top:2px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a{padding:6px 12px}.wy-dropdown.wy-dropdown-bubble .wy-dropdown-menu a:hover{background:#2980b9;color:#fff}.wy-dropdown.wy-dropdown-left .wy-dropdown-menu{right:0;left:auto;text-align:right}.wy-dropdown-arrow:before{content:" ";border-bottom:5px solid #f5f5f5;border-left:5px solid transparent;border-right:5px solid transparent;position:absolute;display:block;top:-4px;left:50%;margin-left:-3px}.wy-dropdown-arrow.wy-dropdown-arrow-left:before{left:11px}.wy-form-stacked select{display:block}.wy-form-aligned .wy-help-inline,.wy-form-aligned input,.wy-form-aligned label,.wy-form-aligned select,.wy-form-aligned textarea{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-form-aligned .wy-control-group>label{display:inline-block;vertical-align:middle;width:10em;margin:6px 12px 0 0;float:left}.wy-form-aligned .wy-control{float:left}.wy-form-aligned .wy-control label{display:block}.wy-form-aligned .wy-control select{margin-top:6px}fieldset{margin:0}fieldset,legend{border:0;padding:0}legend{width:100%;white-space:normal;margin-bottom:24px;font-size:150%;*margin-left:-7px}label,legend{display:block}label{margin:0 0 .3125em;color:#333;font-size:90%}input,select,textarea{font-size:100%;margin:0;vertical-align:baseline;*vertical-align:middle}.wy-control-group{margin-bottom:24px;max-width:1200px;margin-left:auto;margin-right:auto;*zoom:1}.wy-control-group:after,.wy-control-group:before{display:table;content:""}.wy-control-group:after{clear:both}.wy-control-group.wy-control-group-required>label:after{content:" *";color:#e74c3c}.wy-control-group .wy-form-full,.wy-control-group .wy-form-halves,.wy-control-group .wy-form-thirds{padding-bottom:12px}.wy-control-group .wy-form-full input[type=color],.wy-control-group .wy-form-full input[type=date],.wy-control-group .wy-form-full input[type=datetime-local],.wy-control-group .wy-form-full input[type=datetime],.wy-control-group .wy-form-full input[type=email],.wy-control-group .wy-form-full input[type=month],.wy-control-group .wy-form-full input[type=number],.wy-control-group .wy-form-full input[type=password],.wy-control-group .wy-form-full input[type=search],.wy-control-group .wy-form-full input[type=tel],.wy-control-group .wy-form-full input[type=text],.wy-control-group .wy-form-full input[type=time],.wy-control-group .wy-form-full input[type=url],.wy-control-group .wy-form-full input[type=week],.wy-control-group .wy-form-full select,.wy-control-group .wy-form-halves input[type=color],.wy-control-group .wy-form-halves input[type=date],.wy-control-group .wy-form-halves input[type=datetime-local],.wy-control-group .wy-form-halves input[type=datetime],.wy-control-group .wy-form-halves input[type=email],.wy-control-group .wy-form-halves input[type=month],.wy-control-group .wy-form-halves input[type=number],.wy-control-group .wy-form-halves input[type=password],.wy-control-group .wy-form-halves input[type=search],.wy-control-group .wy-form-halves input[type=tel],.wy-control-group .wy-form-halves input[type=text],.wy-control-group .wy-form-halves input[type=time],.wy-control-group .wy-form-halves input[type=url],.wy-control-group .wy-form-halves input[type=week],.wy-control-group .wy-form-halves select,.wy-control-group .wy-form-thirds input[type=color],.wy-control-group .wy-form-thirds input[type=date],.wy-control-group .wy-form-thirds input[type=datetime-local],.wy-control-group .wy-form-thirds input[type=datetime],.wy-control-group .wy-form-thirds input[type=email],.wy-control-group .wy-form-thirds input[type=month],.wy-control-group .wy-form-thirds input[type=number],.wy-control-group .wy-form-thirds input[type=password],.wy-control-group .wy-form-thirds input[type=search],.wy-control-group .wy-form-thirds input[type=tel],.wy-control-group .wy-form-thirds input[type=text],.wy-control-group .wy-form-thirds input[type=time],.wy-control-group .wy-form-thirds input[type=url],.wy-control-group .wy-form-thirds input[type=week],.wy-control-group .wy-form-thirds select{width:100%}.wy-control-group .wy-form-full{float:left;display:block;width:100%;margin-right:0}.wy-control-group .wy-form-full:last-child{margin-right:0}.wy-control-group .wy-form-halves{float:left;display:block;margin-right:2.35765%;width:48.82117%}.wy-control-group .wy-form-halves:last-child,.wy-control-group .wy-form-halves:nth-of-type(2n){margin-right:0}.wy-control-group .wy-form-halves:nth-of-type(odd){clear:left}.wy-control-group .wy-form-thirds{float:left;display:block;margin-right:2.35765%;width:31.76157%}.wy-control-group .wy-form-thirds:last-child,.wy-control-group .wy-form-thirds:nth-of-type(3n){margin-right:0}.wy-control-group .wy-form-thirds:nth-of-type(3n+1){clear:left}.wy-control-group.wy-control-group-no-input .wy-control,.wy-control-no-input{margin:6px 0 0;font-size:90%}.wy-control-no-input{display:inline-block}.wy-control-group.fluid-input input[type=color],.wy-control-group.fluid-input input[type=date],.wy-control-group.fluid-input input[type=datetime-local],.wy-control-group.fluid-input input[type=datetime],.wy-control-group.fluid-input input[type=email],.wy-control-group.fluid-input input[type=month],.wy-control-group.fluid-input input[type=number],.wy-control-group.fluid-input input[type=password],.wy-control-group.fluid-input input[type=search],.wy-control-group.fluid-input input[type=tel],.wy-control-group.fluid-input input[type=text],.wy-control-group.fluid-input input[type=time],.wy-control-group.fluid-input input[type=url],.wy-control-group.fluid-input input[type=week]{width:100%}.wy-form-message-inline{padding-left:.3em;color:#666;font-size:90%}.wy-form-message{display:block;color:#999;font-size:70%;margin-top:.3125em;font-style:italic}.wy-form-message p{font-size:inherit;font-style:italic;margin-bottom:6px}.wy-form-message p:last-child{margin-bottom:0}input{line-height:normal}input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;*overflow:visible}input[type=color],input[type=date],input[type=datetime-local],input[type=datetime],input[type=email],input[type=month],input[type=number],input[type=password],input[type=search],input[type=tel],input[type=text],input[type=time],input[type=url],input[type=week]{-webkit-appearance:none;padding:6px;display:inline-block;border:1px solid #ccc;font-size:80%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;box-shadow:inset 0 1px 3px #ddd;border-radius:0;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}input[type=datetime-local]{padding:.34375em .625em}input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{padding:0;margin-right:.3125em;*height:13px;*width:13px}input[type=checkbox],input[type=radio],input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}input[type=color]:focus,input[type=date]:focus,input[type=datetime-local]:focus,input[type=datetime]:focus,input[type=email]:focus,input[type=month]:focus,input[type=number]:focus,input[type=password]:focus,input[type=search]:focus,input[type=tel]:focus,input[type=text]:focus,input[type=time]:focus,input[type=url]:focus,input[type=week]:focus{outline:0;outline:thin dotted\9;border-color:#333}input.no-focus:focus{border-color:#ccc!important}input[type=checkbox]:focus,input[type=file]:focus,input[type=radio]:focus{outline:thin dotted #333;outline:1px auto #129fea}input[type=color][disabled],input[type=date][disabled],input[type=datetime-local][disabled],input[type=datetime][disabled],input[type=email][disabled],input[type=month][disabled],input[type=number][disabled],input[type=password][disabled],input[type=search][disabled],input[type=tel][disabled],input[type=text][disabled],input[type=time][disabled],input[type=url][disabled],input[type=week][disabled]{cursor:not-allowed;background-color:#fafafa}input:focus:invalid,select:focus:invalid,textarea:focus:invalid{color:#e74c3c;border:1px solid #e74c3c}input:focus:invalid:focus,select:focus:invalid:focus,textarea:focus:invalid:focus{border-color:#e74c3c}input[type=checkbox]:focus:invalid:focus,input[type=file]:focus:invalid:focus,input[type=radio]:focus:invalid:focus{outline-color:#e74c3c}input.wy-input-large{padding:12px;font-size:100%}textarea{overflow:auto;vertical-align:top;width:100%;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif}select,textarea{padding:.5em .625em;display:inline-block;border:1px solid #ccc;font-size:80%;box-shadow:inset 0 1px 3px #ddd;-webkit-transition:border .3s linear;-moz-transition:border .3s linear;transition:border .3s linear}select{border:1px solid #ccc;background-color:#fff}select[multiple]{height:auto}select:focus,textarea:focus{outline:0}input[readonly],select[disabled],select[readonly],textarea[disabled],textarea[readonly]{cursor:not-allowed;background-color:#fafafa}input[type=checkbox][disabled],input[type=radio][disabled]{cursor:not-allowed}.wy-checkbox,.wy-radio{margin:6px 0;color:#404040;display:block}.wy-checkbox input,.wy-radio input{vertical-align:baseline}.wy-form-message-inline{display:inline-block;*display:inline;*zoom:1;vertical-align:middle}.wy-input-prefix,.wy-input-suffix{white-space:nowrap;padding:6px}.wy-input-prefix .wy-input-context,.wy-input-suffix .wy-input-context{line-height:27px;padding:0 8px;display:inline-block;font-size:80%;background-color:#f3f6f6;border:1px solid #ccc;color:#999}.wy-input-suffix .wy-input-context{border-left:0}.wy-input-prefix .wy-input-context{border-right:0}.wy-switch{position:relative;display:block;height:24px;margin-top:12px;cursor:pointer}.wy-switch:before{left:0;top:0;width:36px;height:12px;background:#ccc}.wy-switch:after,.wy-switch:before{position:absolute;content:"";display:block;border-radius:4px;-webkit-transition:all .2s ease-in-out;-moz-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.wy-switch:after{width:18px;height:18px;background:#999;left:-3px;top:-3px}.wy-switch span{position:absolute;left:48px;display:block;font-size:12px;color:#ccc;line-height:1}.wy-switch.active:before{background:#1e8449}.wy-switch.active:after{left:24px;background:#27ae60}.wy-switch.disabled{cursor:not-allowed;opacity:.8}.wy-control-group.wy-control-group-error .wy-form-message,.wy-control-group.wy-control-group-error>label{color:#e74c3c}.wy-control-group.wy-control-group-error input[type=color],.wy-control-group.wy-control-group-error input[type=date],.wy-control-group.wy-control-group-error input[type=datetime-local],.wy-control-group.wy-control-group-error input[type=datetime],.wy-control-group.wy-control-group-error input[type=email],.wy-control-group.wy-control-group-error input[type=month],.wy-control-group.wy-control-group-error input[type=number],.wy-control-group.wy-control-group-error input[type=password],.wy-control-group.wy-control-group-error input[type=search],.wy-control-group.wy-control-group-error input[type=tel],.wy-control-group.wy-control-group-error input[type=text],.wy-control-group.wy-control-group-error input[type=time],.wy-control-group.wy-control-group-error input[type=url],.wy-control-group.wy-control-group-error input[type=week],.wy-control-group.wy-control-group-error textarea{border:1px solid #e74c3c}.wy-inline-validate{white-space:nowrap}.wy-inline-validate .wy-input-context{padding:.5em .625em;display:inline-block;font-size:80%}.wy-inline-validate.wy-inline-validate-success .wy-input-context{color:#27ae60}.wy-inline-validate.wy-inline-validate-danger .wy-input-context{color:#e74c3c}.wy-inline-validate.wy-inline-validate-warning .wy-input-context{color:#e67e22}.wy-inline-validate.wy-inline-validate-info .wy-input-context{color:#2980b9}.rotate-90{-webkit-transform:rotate(90deg);-moz-transform:rotate(90deg);-ms-transform:rotate(90deg);-o-transform:rotate(90deg);transform:rotate(90deg)}.rotate-180{-webkit-transform:rotate(180deg);-moz-transform:rotate(180deg);-ms-transform:rotate(180deg);-o-transform:rotate(180deg);transform:rotate(180deg)}.rotate-270{-webkit-transform:rotate(270deg);-moz-transform:rotate(270deg);-ms-transform:rotate(270deg);-o-transform:rotate(270deg);transform:rotate(270deg)}.mirror{-webkit-transform:scaleX(-1);-moz-transform:scaleX(-1);-ms-transform:scaleX(-1);-o-transform:scaleX(-1);transform:scaleX(-1)}.mirror.rotate-90{-webkit-transform:scaleX(-1) rotate(90deg);-moz-transform:scaleX(-1) rotate(90deg);-ms-transform:scaleX(-1) rotate(90deg);-o-transform:scaleX(-1) rotate(90deg);transform:scaleX(-1) rotate(90deg)}.mirror.rotate-180{-webkit-transform:scaleX(-1) rotate(180deg);-moz-transform:scaleX(-1) rotate(180deg);-ms-transform:scaleX(-1) rotate(180deg);-o-transform:scaleX(-1) rotate(180deg);transform:scaleX(-1) rotate(180deg)}.mirror.rotate-270{-webkit-transform:scaleX(-1) rotate(270deg);-moz-transform:scaleX(-1) rotate(270deg);-ms-transform:scaleX(-1) rotate(270deg);-o-transform:scaleX(-1) rotate(270deg);transform:scaleX(-1) rotate(270deg)}@media only screen and (max-width:480px){.wy-form button[type=submit]{margin:.7em 0 0}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=text],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week],.wy-form label{margin-bottom:.3em;display:block}.wy-form input[type=color],.wy-form input[type=date],.wy-form input[type=datetime-local],.wy-form input[type=datetime],.wy-form input[type=email],.wy-form input[type=month],.wy-form input[type=number],.wy-form input[type=password],.wy-form input[type=search],.wy-form input[type=tel],.wy-form input[type=time],.wy-form input[type=url],.wy-form input[type=week]{margin-bottom:0}.wy-form-aligned .wy-control-group label{margin-bottom:.3em;text-align:left;display:block;width:100%}.wy-form-aligned .wy-control{margin:1.5em 0 0}.wy-form-message,.wy-form-message-inline,.wy-form .wy-help-inline{display:block;font-size:80%;padding:6px 0}}@media screen and (max-width:768px){.tablet-hide{display:none}}@media screen and (max-width:480px){.mobile-hide{display:none}}.float-left{float:left}.float-right{float:right}.full-width{width:100%}.rst-content table.docutils,.rst-content table.field-list,.wy-table{border-collapse:collapse;border-spacing:0;empty-cells:show;margin-bottom:24px}.rst-content table.docutils caption,.rst-content table.field-list caption,.wy-table caption{color:#000;font:italic 85%/1 arial,sans-serif;padding:1em 0;text-align:center}.rst-content table.docutils td,.rst-content table.docutils th,.rst-content table.field-list td,.rst-content table.field-list th,.wy-table td,.wy-table th{font-size:90%;margin:0;overflow:visible;padding:8px 16px}.rst-content table.docutils td:first-child,.rst-content table.docutils th:first-child,.rst-content table.field-list td:first-child,.rst-content table.field-list th:first-child,.wy-table td:first-child,.wy-table th:first-child{border-left-width:0}.rst-content table.docutils thead,.rst-content table.field-list thead,.wy-table thead{color:#000;text-align:left;vertical-align:bottom;white-space:nowrap}.rst-content table.docutils thead th,.rst-content table.field-list thead th,.wy-table thead th{font-weight:700;border-bottom:2px solid #e1e4e5}.rst-content table.docutils td,.rst-content table.field-list td,.wy-table td{background-color:transparent;vertical-align:middle}.rst-content table.docutils td p,.rst-content table.field-list td p,.wy-table td p{line-height:18px}.rst-content table.docutils td p:last-child,.rst-content table.field-list td p:last-child,.wy-table td p:last-child{margin-bottom:0}.rst-content table.docutils .wy-table-cell-min,.rst-content table.field-list .wy-table-cell-min,.wy-table .wy-table-cell-min{width:1%;padding-right:0}.rst-content table.docutils .wy-table-cell-min input[type=checkbox],.rst-content table.field-list .wy-table-cell-min input[type=checkbox],.wy-table .wy-table-cell-min input[type=checkbox]{margin:0}.wy-table-secondary{color:grey;font-size:90%}.wy-table-tertiary{color:grey;font-size:80%}.rst-content table.docutils:not(.field-list) tr:nth-child(2n-1) td,.wy-table-backed,.wy-table-odd td,.wy-table-striped tr:nth-child(2n-1) td{background-color:#f3f6f6}.rst-content table.docutils,.wy-table-bordered-all{border:1px solid #e1e4e5}.rst-content table.docutils td,.wy-table-bordered-all td{border-bottom:1px solid #e1e4e5;border-left:1px solid #e1e4e5}.rst-content table.docutils tbody>tr:last-child td,.wy-table-bordered-all tbody>tr:last-child td{border-bottom-width:0}.wy-table-bordered{border:1px solid #e1e4e5}.wy-table-bordered-rows td{border-bottom:1px solid #e1e4e5}.wy-table-bordered-rows tbody>tr:last-child td{border-bottom-width:0}.wy-table-horizontal td,.wy-table-horizontal th{border-width:0 0 1px;border-bottom:1px solid #e1e4e5}.wy-table-horizontal tbody>tr:last-child td{border-bottom-width:0}.wy-table-responsive{margin-bottom:24px;max-width:100%;overflow:auto}.wy-table-responsive table{margin-bottom:0!important}.wy-table-responsive table td,.wy-table-responsive table th{white-space:nowrap}a{color:#2980b9;text-decoration:none;cursor:pointer}a:hover{color:#3091d1}a:visited{color:#9b59b6}html{height:100%}body,html{overflow-x:hidden}body{font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;font-weight:400;color:#404040;min-height:100%;background:#edf0f2}.wy-text-left{text-align:left}.wy-text-center{text-align:center}.wy-text-right{text-align:right}.wy-text-large{font-size:120%}.wy-text-normal{font-size:100%}.wy-text-small,small{font-size:80%}.wy-text-strike{text-decoration:line-through}.wy-text-warning{color:#e67e22!important}a.wy-text-warning:hover{color:#eb9950!important}.wy-text-info{color:#2980b9!important}a.wy-text-info:hover{color:#409ad5!important}.wy-text-success{color:#27ae60!important}a.wy-text-success:hover{color:#36d278!important}.wy-text-danger{color:#e74c3c!important}a.wy-text-danger:hover{color:#ed7669!important}.wy-text-neutral{color:#404040!important}a.wy-text-neutral:hover{color:#595959!important}.rst-content .toctree-wrapper>p.caption,h1,h2,h3,h4,h5,h6,legend{margin-top:0;font-weight:700;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif}p{line-height:24px;font-size:16px;margin:0 0 24px}h1{font-size:175%}.rst-content .toctree-wrapper>p.caption,h2{font-size:150%}h3{font-size:125%}h4{font-size:115%}h5{font-size:110%}h6{font-size:100%}hr{display:block;height:1px;border:0;border-top:1px solid #e1e4e5;margin:24px 0;padding:0}.rst-content code,.rst-content tt,code{white-space:nowrap;max-width:100%;background:#fff;border:1px solid #e1e4e5;font-size:75%;padding:0 5px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;color:#e74c3c;overflow-x:auto}.rst-content tt.code-large,code.code-large{font-size:90%}.rst-content .section ul,.rst-content .toctree-wrapper ul,.wy-plain-list-disc,article ul{list-style:disc;line-height:24px;margin-bottom:24px}.rst-content .section ul li,.rst-content .toctree-wrapper ul li,.wy-plain-list-disc li,article ul li{list-style:disc;margin-left:24px}.rst-content .section ul li p:last-child,.rst-content .section ul li ul,.rst-content .toctree-wrapper ul li p:last-child,.rst-content .toctree-wrapper ul li ul,.wy-plain-list-disc li p:last-child,.wy-plain-list-disc li ul,article ul li p:last-child,article ul li ul{margin-bottom:0}.rst-content .section ul li li,.rst-content .toctree-wrapper ul li li,.wy-plain-list-disc li li,article ul li li{list-style:circle}.rst-content .section ul li li li,.rst-content .toctree-wrapper ul li li li,.wy-plain-list-disc li li li,article ul li li li{list-style:square}.rst-content .section ul li ol li,.rst-content .toctree-wrapper ul li ol li,.wy-plain-list-disc li ol li,article ul li ol li{list-style:decimal}.rst-content .section ol,.rst-content ol.arabic,.wy-plain-list-decimal,article ol{list-style:decimal;line-height:24px;margin-bottom:24px}.rst-content .section ol li,.rst-content ol.arabic li,.wy-plain-list-decimal li,article ol li{list-style:decimal;margin-left:24px}.rst-content .section ol li p:last-child,.rst-content .section ol li ul,.rst-content ol.arabic li p:last-child,.rst-content ol.arabic li ul,.wy-plain-list-decimal li p:last-child,.wy-plain-list-decimal li ul,article ol li p:last-child,article ol li ul{margin-bottom:0}.rst-content .section ol li ul li,.rst-content ol.arabic li ul li,.wy-plain-list-decimal li ul li,article ol li ul li{list-style:disc}.wy-breadcrumbs{*zoom:1}.wy-breadcrumbs:after,.wy-breadcrumbs:before{display:table;content:""}.wy-breadcrumbs:after{clear:both}.wy-breadcrumbs li{display:inline-block}.wy-breadcrumbs li.wy-breadcrumbs-aside{float:right}.wy-breadcrumbs li a{display:inline-block;padding:5px}.wy-breadcrumbs li a:first-child{padding-left:0}.rst-content .wy-breadcrumbs li tt,.wy-breadcrumbs li .rst-content tt,.wy-breadcrumbs li code{padding:5px;border:none;background:none}.rst-content .wy-breadcrumbs li tt.literal,.wy-breadcrumbs li .rst-content tt.literal,.wy-breadcrumbs li code.literal{color:#404040}.wy-breadcrumbs-extra{margin-bottom:0;color:#b3b3b3;font-size:80%;display:inline-block}@media screen and (max-width:480px){.wy-breadcrumbs-extra,.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}@media print{.wy-breadcrumbs li.wy-breadcrumbs-aside{display:none}}html{font-size:16px}.wy-affix{position:fixed;top:1.618em}.wy-menu a:hover{text-decoration:none}.wy-menu-horiz{*zoom:1}.wy-menu-horiz:after,.wy-menu-horiz:before{display:table;content:""}.wy-menu-horiz:after{clear:both}.wy-menu-horiz li,.wy-menu-horiz ul{display:inline-block}.wy-menu-horiz li:hover{background:hsla(0,0%,100%,.1)}.wy-menu-horiz li.divide-left{border-left:1px solid #404040}.wy-menu-horiz li.divide-right{border-right:1px solid #404040}.wy-menu-horiz a{height:32px;display:inline-block;line-height:32px;padding:0 16px}.wy-menu-vertical{width:300px}.wy-menu-vertical header,.wy-menu-vertical p.caption{color:#55a5d9;height:32px;line-height:32px;padding:0 1.618em;margin:12px 0 0;display:block;font-weight:700;text-transform:uppercase;font-size:85%;white-space:nowrap}.wy-menu-vertical ul{margin-bottom:0}.wy-menu-vertical li.divide-top{border-top:1px solid #404040}.wy-menu-vertical li.divide-bottom{border-bottom:1px solid #404040}.wy-menu-vertical li.current{background:#e3e3e3}.wy-menu-vertical li.current a{color:grey;border-right:1px solid #c9c9c9;padding:.4045em 2.427em}.wy-menu-vertical li.current a:hover{background:#d6d6d6}.rst-content .wy-menu-vertical li tt,.wy-menu-vertical li .rst-content tt,.wy-menu-vertical li code{border:none;background:inherit;color:inherit;padding-left:0;padding-right:0}.wy-menu-vertical li span.toctree-expand{display:block;float:left;margin-left:-1.2em;font-size:.8em;line-height:1.6em;color:#4d4d4d}.wy-menu-vertical li.current>a,.wy-menu-vertical li.on a{color:#404040;font-weight:700;position:relative;background:#fcfcfc;border:none;padding:.4045em 1.618em}.wy-menu-vertical li.current>a:hover,.wy-menu-vertical li.on a:hover{background:#fcfcfc}.wy-menu-vertical li.current>a:hover span.toctree-expand,.wy-menu-vertical li.on a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.current>a span.toctree-expand,.wy-menu-vertical li.on a span.toctree-expand{display:block;font-size:.8em;line-height:1.6em;color:#333}.wy-menu-vertical li.toctree-l1.current>a{border-bottom:1px solid #c9c9c9;border-top:1px solid #c9c9c9}.wy-menu-vertical .toctree-l1.current .toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .toctree-l11>ul{display:none}.wy-menu-vertical .toctree-l1.current .current.toctree-l2>ul,.wy-menu-vertical .toctree-l2.current .current.toctree-l3>ul,.wy-menu-vertical .toctree-l3.current .current.toctree-l4>ul,.wy-menu-vertical .toctree-l4.current .current.toctree-l5>ul,.wy-menu-vertical .toctree-l5.current .current.toctree-l6>ul,.wy-menu-vertical .toctree-l6.current .current.toctree-l7>ul,.wy-menu-vertical .toctree-l7.current .current.toctree-l8>ul,.wy-menu-vertical .toctree-l8.current .current.toctree-l9>ul,.wy-menu-vertical .toctree-l9.current .current.toctree-l10>ul,.wy-menu-vertical .toctree-l10.current .current.toctree-l11>ul{display:block}.wy-menu-vertical li.toctree-l3,.wy-menu-vertical li.toctree-l4{font-size:.9em}.wy-menu-vertical li.toctree-l2 a,.wy-menu-vertical li.toctree-l3 a,.wy-menu-vertical li.toctree-l4 a,.wy-menu-vertical li.toctree-l5 a,.wy-menu-vertical li.toctree-l6 a,.wy-menu-vertical li.toctree-l7 a,.wy-menu-vertical li.toctree-l8 a,.wy-menu-vertical li.toctree-l9 a,.wy-menu-vertical li.toctree-l10 a{color:#404040}.wy-menu-vertical li.toctree-l2 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l3 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l4 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l5 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l6 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l7 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l8 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l9 a:hover span.toctree-expand,.wy-menu-vertical li.toctree-l10 a:hover span.toctree-expand{color:grey}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{display:block}.wy-menu-vertical li.toctree-l2.current>a{padding:.4045em 2.427em}.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a,.wy-menu-vertical li.toctree-l3.current>a{padding:.4045em 4.045em}.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a,.wy-menu-vertical li.toctree-l4.current>a{padding:.4045em 5.663em}.wy-menu-vertical li.toctree-l4.current li.toctree-l5>a,.wy-menu-vertical li.toctree-l5.current>a{padding:.4045em 7.281em}.wy-menu-vertical li.toctree-l5.current li.toctree-l6>a,.wy-menu-vertical li.toctree-l6.current>a{padding:.4045em 8.899em}.wy-menu-vertical li.toctree-l6.current li.toctree-l7>a,.wy-menu-vertical li.toctree-l7.current>a{padding:.4045em 10.517em}.wy-menu-vertical li.toctree-l7.current li.toctree-l8>a,.wy-menu-vertical li.toctree-l8.current>a{padding:.4045em 12.135em}.wy-menu-vertical li.toctree-l8.current li.toctree-l9>a,.wy-menu-vertical li.toctree-l9.current>a{padding:.4045em 13.753em}.wy-menu-vertical li.toctree-l9.current li.toctree-l10>a,.wy-menu-vertical li.toctree-l10.current>a{padding:.4045em 15.371em}.wy-menu-vertical li.toctree-l10.current li.toctree-l11>a{padding:.4045em 16.989em}.wy-menu-vertical li.toctree-l2.current>a,.wy-menu-vertical li.toctree-l2.current li.toctree-l3>a{background:#c9c9c9}.wy-menu-vertical li.toctree-l2 span.toctree-expand{color:#a3a3a3}.wy-menu-vertical li.toctree-l3.current>a,.wy-menu-vertical li.toctree-l3.current li.toctree-l4>a{background:#bdbdbd}.wy-menu-vertical li.toctree-l3 span.toctree-expand{color:#969696}.wy-menu-vertical li.current ul{display:block}.wy-menu-vertical li ul{margin-bottom:0;display:none}.wy-menu-vertical li ul li a{margin-bottom:0;color:#d9d9d9;font-weight:400}.wy-menu-vertical a{line-height:18px;padding:.4045em 1.618em;display:block;position:relative;font-size:90%;color:#d9d9d9}.wy-menu-vertical a:hover{background-color:#4e4a4a;cursor:pointer}.wy-menu-vertical a:hover span.toctree-expand{color:#d9d9d9}.wy-menu-vertical a:active{background-color:#2980b9;cursor:pointer;color:#fff}.wy-menu-vertical a:active span.toctree-expand{color:#fff}.wy-side-nav-search{display:block;width:300px;padding:.809em;margin-bottom:.809em;z-index:200;background-color:#2980b9;text-align:center;color:#fcfcfc}.wy-side-nav-search input[type=text]{width:100%;border-radius:50px;padding:6px 12px;border-color:#2472a4}.wy-side-nav-search img{display:block;margin:auto auto .809em;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-side-nav-search .wy-dropdown>a,.wy-side-nav-search>a{color:#fcfcfc;font-size:100%;font-weight:700;display:inline-block;padding:4px 6px;margin-bottom:.809em}.wy-side-nav-search .wy-dropdown>a:hover,.wy-side-nav-search>a:hover{background:hsla(0,0%,100%,.1)}.wy-side-nav-search .wy-dropdown>a img.logo,.wy-side-nav-search>a img.logo{display:block;margin:0 auto;height:auto;width:auto;border-radius:0;max-width:100%;background:transparent}.wy-side-nav-search .wy-dropdown>a.icon img.logo,.wy-side-nav-search>a.icon img.logo{margin-top:.85em}.wy-side-nav-search>div.version{margin-top:-.4045em;margin-bottom:.809em;font-weight:400;color:hsla(0,0%,100%,.3)}.wy-nav .wy-menu-vertical header{color:#2980b9}.wy-nav .wy-menu-vertical a{color:#b3b3b3}.wy-nav .wy-menu-vertical a:hover{background-color:#2980b9;color:#fff}[data-menu-wrap]{-webkit-transition:all .2s ease-in;-moz-transition:all .2s ease-in;transition:all .2s ease-in;position:absolute;opacity:1;width:100%;opacity:0}[data-menu-wrap].move-center{left:0;right:auto;opacity:1}[data-menu-wrap].move-left{right:auto;left:-100%;opacity:0}[data-menu-wrap].move-right{right:-100%;left:auto;opacity:0}.wy-body-for-nav{background:#fcfcfc}.wy-grid-for-nav{position:absolute;width:100%;height:100%}.wy-nav-side{position:fixed;top:0;bottom:0;left:0;padding-bottom:2em;width:300px;overflow-x:hidden;overflow-y:hidden;min-height:100%;color:#9b9b9b;background:#343131;z-index:200}.wy-side-scroll{width:320px;position:relative;overflow-x:hidden;overflow-y:scroll;height:100%}.wy-nav-top{display:none;background:#2980b9;color:#fff;padding:.4045em .809em;position:relative;line-height:50px;text-align:center;font-size:100%;*zoom:1}.wy-nav-top:after,.wy-nav-top:before{display:table;content:""}.wy-nav-top:after{clear:both}.wy-nav-top a{color:#fff;font-weight:700}.wy-nav-top img{margin-right:12px;height:45px;width:45px;background-color:#2980b9;padding:5px;border-radius:100%}.wy-nav-top i{font-size:30px;float:left;cursor:pointer;padding-top:inherit}.wy-nav-content-wrap{margin-left:300px;background:#fcfcfc;min-height:100%}.wy-nav-content{padding:1.618em 3.236em;height:100%;max-width:800px;margin:auto}.wy-body-mask{position:fixed;width:100%;height:100%;background:rgba(0,0,0,.2);display:none;z-index:499}.wy-body-mask.on{display:block}footer{color:grey}footer p{margin-bottom:12px}.rst-content footer span.commit tt,footer span.commit .rst-content tt,footer span.commit code{padding:0;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:1em;background:none;border:none;color:grey}.rst-footer-buttons{*zoom:1}.rst-footer-buttons:after,.rst-footer-buttons:before{width:100%;display:table;content:""}.rst-footer-buttons:after{clear:both}.rst-breadcrumbs-buttons{margin-top:12px;*zoom:1}.rst-breadcrumbs-buttons:after,.rst-breadcrumbs-buttons:before{display:table;content:""}.rst-breadcrumbs-buttons:after{clear:both}#search-results .search li{margin-bottom:24px;border-bottom:1px solid #e1e4e5;padding-bottom:24px}#search-results .search li:first-child{border-top:1px solid #e1e4e5;padding-top:24px}#search-results .search li a{font-size:120%;margin-bottom:12px;display:inline-block}#search-results .context{color:grey;font-size:90%}.genindextable li>ul{margin-left:24px}@media screen and (max-width:768px){.wy-body-for-nav{background:#fcfcfc}.wy-nav-top{display:block}.wy-nav-side{left:-300px}.wy-nav-side.shift{width:85%;left:0}.wy-menu.wy-menu-vertical,.wy-side-nav-search,.wy-side-scroll{width:auto}.wy-nav-content-wrap{margin-left:0}.wy-nav-content-wrap .wy-nav-content{padding:1.618em}.wy-nav-content-wrap.shift{position:fixed;min-width:100%;left:85%;top:0;height:100%;overflow:hidden}}@media screen and (min-width:1100px){.wy-nav-content-wrap{background:rgba(0,0,0,.05)}.wy-nav-content{margin:0;background:#fcfcfc}}@media print{.rst-versions,.wy-nav-side,footer{display:none}.wy-nav-content-wrap{margin-left:0}}.rst-versions{position:fixed;bottom:0;left:0;width:300px;color:#fcfcfc;background:#1f1d1d;font-family:Lato,proxima-nova,Helvetica Neue,Arial,sans-serif;z-index:400}.rst-versions a{color:#2980b9;text-decoration:none}.rst-versions .rst-badge-small{display:none}.rst-versions .rst-current-version{padding:12px;background-color:#272525;display:block;text-align:right;font-size:90%;cursor:pointer;color:#27ae60;*zoom:1}.rst-versions .rst-current-version:after,.rst-versions .rst-current-version:before{display:table;content:""}.rst-versions .rst-current-version:after{clear:both}.rst-content .code-block-caption .rst-versions .rst-current-version .headerlink,.rst-content .rst-versions .rst-current-version .admonition-title,.rst-content code.download .rst-versions .rst-current-version span:first-child,.rst-content dl dt .rst-versions .rst-current-version .headerlink,.rst-content h1 .rst-versions .rst-current-version .headerlink,.rst-content h2 .rst-versions .rst-current-version .headerlink,.rst-content h3 .rst-versions .rst-current-version .headerlink,.rst-content h4 .rst-versions .rst-current-version .headerlink,.rst-content h5 .rst-versions .rst-current-version .headerlink,.rst-content h6 .rst-versions .rst-current-version .headerlink,.rst-content p.caption .rst-versions .rst-current-version .headerlink,.rst-content table>caption .rst-versions .rst-current-version .headerlink,.rst-content tt.download .rst-versions .rst-current-version span:first-child,.rst-versions .rst-current-version .fa,.rst-versions .rst-current-version .icon,.rst-versions .rst-current-version .rst-content .admonition-title,.rst-versions .rst-current-version .rst-content .code-block-caption .headerlink,.rst-versions .rst-current-version .rst-content code.download span:first-child,.rst-versions .rst-current-version .rst-content dl dt .headerlink,.rst-versions .rst-current-version .rst-content h1 .headerlink,.rst-versions .rst-current-version .rst-content h2 .headerlink,.rst-versions .rst-current-version .rst-content h3 .headerlink,.rst-versions .rst-current-version .rst-content h4 .headerlink,.rst-versions .rst-current-version .rst-content h5 .headerlink,.rst-versions .rst-current-version .rst-content h6 .headerlink,.rst-versions .rst-current-version .rst-content p.caption .headerlink,.rst-versions .rst-current-version .rst-content table>caption .headerlink,.rst-versions .rst-current-version .rst-content tt.download span:first-child,.rst-versions .rst-current-version .wy-menu-vertical li span.toctree-expand,.wy-menu-vertical li .rst-versions .rst-current-version span.toctree-expand{color:#fcfcfc}.rst-versions .rst-current-version .fa-book,.rst-versions .rst-current-version .icon-book{float:left}.rst-versions .rst-current-version.rst-out-of-date{background-color:#e74c3c;color:#fff}.rst-versions .rst-current-version.rst-active-old-version{background-color:#f1c40f;color:#000}.rst-versions.shift-up{height:auto;max-height:100%;overflow-y:scroll}.rst-versions.shift-up .rst-other-versions{display:block}.rst-versions .rst-other-versions{font-size:90%;padding:12px;color:grey;display:none}.rst-versions .rst-other-versions hr{display:block;height:1px;border:0;margin:20px 0;padding:0;border-top:1px solid #413d3d}.rst-versions .rst-other-versions dd{display:inline-block;margin:0}.rst-versions .rst-other-versions dd a{display:inline-block;padding:6px;color:#fcfcfc}.rst-versions.rst-badge{width:auto;bottom:20px;right:20px;left:auto;border:none;max-width:300px;max-height:90%}.rst-versions.rst-badge .fa-book,.rst-versions.rst-badge .icon-book{float:none;line-height:30px}.rst-versions.rst-badge.shift-up .rst-current-version{text-align:right}.rst-versions.rst-badge.shift-up .rst-current-version .fa-book,.rst-versions.rst-badge.shift-up .rst-current-version .icon-book{float:left}.rst-versions.rst-badge>.rst-current-version{width:auto;height:30px;line-height:30px;padding:0 6px;display:block;text-align:center}@media screen and (max-width:768px){.rst-versions{width:85%;display:none}.rst-versions.shift{display:block}}.rst-content img{max-width:100%;height:auto}.rst-content div.figure{margin-bottom:24px}.rst-content div.figure p.caption{font-style:italic}.rst-content div.figure p:last-child.caption{margin-bottom:0}.rst-content div.figure.align-center{text-align:center}.rst-content .section>a>img,.rst-content .section>img{margin-bottom:24px}.rst-content abbr[title]{text-decoration:none}.rst-content.style-external-links a.reference.external:after{font-family:FontAwesome;content:"\f08e";color:#b3b3b3;vertical-align:super;font-size:60%;margin:0 .2em}.rst-content blockquote{margin-left:24px;line-height:24px;margin-bottom:24px}.rst-content pre.literal-block{white-space:pre;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;display:block;overflow:auto}.rst-content div[class^=highlight],.rst-content pre.literal-block{border:1px solid #e1e4e5;overflow-x:auto;margin:1px 0 24px}.rst-content div[class^=highlight] div[class^=highlight],.rst-content pre.literal-block div[class^=highlight]{padding:0;border:none;margin:0}.rst-content div[class^=highlight] td.code{width:100%}.rst-content .linenodiv pre{border-right:1px solid #e6e9ea;margin:0;padding:12px;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;user-select:none;pointer-events:none}.rst-content div[class^=highlight] pre{white-space:pre;margin:0;padding:12px;display:block;overflow:auto}.rst-content div[class^=highlight] pre .hll{display:block;margin:0 -12px;padding:0 12px}.rst-content .linenodiv pre,.rst-content div[class^=highlight] pre,.rst-content pre.literal-block{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;font-size:12px;line-height:1.4}.rst-content div.highlight .gp{user-select:none;pointer-events:none}.rst-content .code-block-caption{font-style:italic;font-size:85%;line-height:1;padding:1em 0;text-align:center}@media print{.rst-content .codeblock,.rst-content div[class^=highlight],.rst-content div[class^=highlight] pre{white-space:pre-wrap}}.rst-content .admonition,.rst-content .admonition-todo,.rst-content .attention,.rst-content .caution,.rst-content .danger,.rst-content .error,.rst-content .hint,.rst-content .important,.rst-content .note,.rst-content .seealso,.rst-content .tip,.rst-content .warning{clear:both}.rst-content .admonition-todo .last,.rst-content .admonition-todo>:last-child,.rst-content .admonition .last,.rst-content .admonition>:last-child,.rst-content .attention .last,.rst-content .attention>:last-child,.rst-content .caution .last,.rst-content .caution>:last-child,.rst-content .danger .last,.rst-content .danger>:last-child,.rst-content .error .last,.rst-content .error>:last-child,.rst-content .hint .last,.rst-content .hint>:last-child,.rst-content .important .last,.rst-content .important>:last-child,.rst-content .note .last,.rst-content .note>:last-child,.rst-content .seealso .last,.rst-content .seealso>:last-child,.rst-content .tip .last,.rst-content .tip>:last-child,.rst-content .warning .last,.rst-content .warning>:last-child{margin-bottom:0}.rst-content .admonition-title:before{margin-right:4px}.rst-content .admonition table{border-color:rgba(0,0,0,.1)}.rst-content .admonition table td,.rst-content .admonition table th{background:transparent!important;border-color:rgba(0,0,0,.1)!important}.rst-content .section ol.loweralpha,.rst-content .section ol.loweralpha>li{list-style:lower-alpha}.rst-content .section ol.upperalpha,.rst-content .section ol.upperalpha>li{list-style:upper-alpha}.rst-content .section ol li>*,.rst-content .section ul li>*{margin-top:12px;margin-bottom:12px}.rst-content .section ol li>:first-child,.rst-content .section ul li>:first-child{margin-top:0}.rst-content .section ol li>p,.rst-content .section ol li>p:last-child,.rst-content .section ul li>p,.rst-content .section ul li>p:last-child{margin-bottom:12px}.rst-content .section ol li>p:only-child,.rst-content .section ol li>p:only-child:last-child,.rst-content .section ul li>p:only-child,.rst-content .section ul li>p:only-child:last-child{margin-bottom:0}.rst-content .section ol li>ol,.rst-content .section ol li>ul,.rst-content .section ul li>ol,.rst-content .section ul li>ul{margin-bottom:12px}.rst-content .section ol.simple li>*,.rst-content .section ol.simple li ol,.rst-content .section ol.simple li ul,.rst-content .section ul.simple li>*,.rst-content .section ul.simple li ol,.rst-content .section ul.simple li ul{margin-top:0;margin-bottom:0}.rst-content .line-block{margin-left:0;margin-bottom:24px;line-height:24px}.rst-content .line-block .line-block{margin-left:24px;margin-bottom:0}.rst-content .topic-title{font-weight:700;margin-bottom:12px}.rst-content .toc-backref{color:#404040}.rst-content .align-right{float:right;margin:0 0 24px 24px}.rst-content .align-left{float:left;margin:0 24px 24px 0}.rst-content .align-center{margin:auto}.rst-content .align-center:not(table){display:block}.rst-content .code-block-caption .headerlink,.rst-content .toctree-wrapper>p.caption .headerlink,.rst-content dl dt .headerlink,.rst-content h1 .headerlink,.rst-content h2 .headerlink,.rst-content h3 .headerlink,.rst-content h4 .headerlink,.rst-content h5 .headerlink,.rst-content h6 .headerlink,.rst-content p.caption .headerlink,.rst-content table>caption .headerlink{visibility:hidden;font-size:14px}.rst-content .code-block-caption .headerlink:after,.rst-content .toctree-wrapper>p.caption .headerlink:after,.rst-content dl dt .headerlink:after,.rst-content h1 .headerlink:after,.rst-content h2 .headerlink:after,.rst-content h3 .headerlink:after,.rst-content h4 .headerlink:after,.rst-content h5 .headerlink:after,.rst-content h6 .headerlink:after,.rst-content p.caption .headerlink:after,.rst-content table>caption .headerlink:after{content:"\f0c1";font-family:FontAwesome}.rst-content .code-block-caption:hover .headerlink:after,.rst-content .toctree-wrapper>p.caption:hover .headerlink:after,.rst-content dl dt:hover .headerlink:after,.rst-content h1:hover .headerlink:after,.rst-content h2:hover .headerlink:after,.rst-content h3:hover .headerlink:after,.rst-content h4:hover .headerlink:after,.rst-content h5:hover .headerlink:after,.rst-content h6:hover .headerlink:after,.rst-content p.caption:hover .headerlink:after,.rst-content table>caption:hover .headerlink:after{visibility:visible}.rst-content table>caption .headerlink:after{font-size:12px}.rst-content .centered{text-align:center}.rst-content .sidebar{float:right;width:40%;display:block;margin:0 0 24px 24px;padding:24px;background:#f3f6f6;border:1px solid #e1e4e5}.rst-content .sidebar dl,.rst-content .sidebar p,.rst-content .sidebar ul{font-size:90%}.rst-content .sidebar .last,.rst-content .sidebar>:last-child{margin-bottom:0}.rst-content .sidebar .sidebar-title{display:block;font-family:Roboto Slab,ff-tisa-web-pro,Georgia,Arial,sans-serif;font-weight:700;background:#e1e4e5;padding:6px 12px;margin:-24px -24px 24px;font-size:100%}.rst-content .highlighted{background:#f1c40f;box-shadow:0 0 0 2px #f1c40f;display:inline;font-weight:700}.rst-content .citation-reference,.rst-content .footnote-reference{vertical-align:baseline;position:relative;top:-.4em;line-height:0;font-size:90%}.rst-content .hlist{width:100%}html.writer-html4 .rst-content table.docutils.citation,html.writer-html4 .rst-content table.docutils.footnote{background:none;border:none}html.writer-html4 .rst-content table.docutils.citation td,html.writer-html4 .rst-content table.docutils.citation tr,html.writer-html4 .rst-content table.docutils.footnote td,html.writer-html4 .rst-content table.docutils.footnote tr{border:none;background-color:transparent!important;white-space:normal}html.writer-html4 .rst-content table.docutils.citation td.label,html.writer-html4 .rst-content table.docutils.footnote td.label{padding-left:0;padding-right:0;vertical-align:top}html.writer-html5 .rst-content dl dt span.classifier:before{content:" : "}html.writer-html5 .rst-content dl.field-list,html.writer-html5 .rst-content dl.footnote{display:grid;grid-template-columns:max-content auto}html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dt{padding-left:1rem}html.writer-html5 .rst-content dl.field-list>dt:after,html.writer-html5 .rst-content dl.footnote>dt:after{content:":"}html.writer-html5 .rst-content dl.field-list>dd,html.writer-html5 .rst-content dl.field-list>dt,html.writer-html5 .rst-content dl.footnote>dd,html.writer-html5 .rst-content dl.footnote>dt{margin-bottom:0}html.writer-html5 .rst-content dl.footnote{font-size:.9rem}html.writer-html5 .rst-content dl.footnote>dt{margin:0 .5rem .5rem 0;line-height:1.2rem;word-break:break-all;font-weight:400}html.writer-html5 .rst-content dl.footnote>dt>span.brackets{margin-right:.5rem}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:before{content:"["}html.writer-html5 .rst-content dl.footnote>dt>span.brackets:after{content:"]"}html.writer-html5 .rst-content dl.footnote>dt>span.fn-backref{font-style:italic}html.writer-html5 .rst-content dl.footnote>dd{margin:0 0 .5rem;line-height:1.2rem}html.writer-html5 .rst-content dl.footnote>dd p,html.writer-html5 .rst-content dl.option-list kbd{font-size:.9rem}.rst-content table.docutils.footnote,html.writer-html4 .rst-content table.docutils.citation,html.writer-html5 .rst-content dl.footnote{color:grey}.rst-content table.docutils.footnote code,.rst-content table.docutils.footnote tt,html.writer-html4 .rst-content table.docutils.citation code,html.writer-html4 .rst-content table.docutils.citation tt,html.writer-html5 .rst-content dl.footnote code,html.writer-html5 .rst-content dl.footnote tt{color:#555}.rst-content .wy-table-responsive.citation,.rst-content .wy-table-responsive.footnote{margin-bottom:0}.rst-content .wy-table-responsive.citation+:not(.citation),.rst-content .wy-table-responsive.footnote+:not(.footnote){margin-top:24px}.rst-content .wy-table-responsive.citation:last-child,.rst-content .wy-table-responsive.footnote:last-child{margin-bottom:24px}.rst-content table.docutils th{border-color:#e1e4e5}html.writer-html5 .rst-content table.docutils th{border:1px solid #e1e4e5}html.writer-html5 .rst-content table.docutils td>p,html.writer-html5 .rst-content table.docutils th>p{line-height:1rem;margin-bottom:0;font-size:.9rem}.rst-content table.docutils td .last,.rst-content table.docutils td .last>:last-child{margin-bottom:0}.rst-content table.field-list,.rst-content table.field-list td{border:none}.rst-content table.field-list td p{font-size:inherit;line-height:inherit}.rst-content table.field-list td>strong{display:inline-block}.rst-content table.field-list .field-name{padding-right:10px;text-align:left;white-space:nowrap}.rst-content table.field-list .field-body{text-align:left}.rst-content code,.rst-content tt{color:#000;font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace;padding:2px 5px}.rst-content code big,.rst-content code em,.rst-content tt big,.rst-content tt em{font-size:100%!important;line-height:normal}.rst-content code.literal,.rst-content tt.literal{color:#e74c3c}.rst-content code.xref,.rst-content tt.xref,a .rst-content code,a .rst-content tt{font-weight:700;color:#404040}.rst-content kbd,.rst-content pre,.rst-content samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,Liberation Mono,Courier New,Courier,monospace}.rst-content a code,.rst-content a tt{color:#2980b9}.rst-content dl{margin-bottom:24px}.rst-content dl dt{font-weight:700;margin-bottom:12px}.rst-content dl ol,.rst-content dl p,.rst-content dl table,.rst-content dl ul{margin-bottom:12px}.rst-content dl dd{margin:0 0 12px 24px;line-height:24px}html.writer-html4 .rst-content dl:not(.docutils),html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple){margin-bottom:24px}html.writer-html4 .rst-content dl:not(.docutils)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt{display:table;margin:6px 0;font-size:90%;line-height:normal;background:#e7f2fa;color:#2980b9;border-top:3px solid #6ab0de;padding:6px;position:relative}html.writer-html4 .rst-content dl:not(.docutils)>dt:before,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:before{color:#6ab0de}html.writer-html4 .rst-content dl:not(.docutils)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt{margin-bottom:6px;border:none;border-left:3px solid #ccc;background:#f0f0f0;color:#555}html.writer-html4 .rst-content dl:not(.docutils) dl:not(.field-list)>dt .headerlink,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) dl:not(.field-list)>dt .headerlink{color:#404040;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils)>dt:first-child,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple)>dt:first-child{margin-top:0}html.writer-html4 .rst-content dl:not(.docutils) code,html.writer-html4 .rst-content dl:not(.docutils) tt,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) code.descclassname,html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descclassname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descclassname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{background-color:transparent;border:none;padding:0;font-size:100%!important}html.writer-html4 .rst-content dl:not(.docutils) code.descname,html.writer-html4 .rst-content dl:not(.docutils) tt.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) code.descname,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) tt.descname{font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .optional,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .optional{display:inline-block;padding:0 4px;color:#000;font-weight:700}html.writer-html4 .rst-content dl:not(.docutils) .property,html.writer-html5 .rst-content dl[class]:not(.option-list):not(.field-list):not(.footnote):not(.glossary):not(.simple) .property{display:inline-block;padding-right:8px}.rst-content .viewcode-back,.rst-content .viewcode-link{display:inline-block;color:#27ae60;font-size:80%;padding-left:24px}.rst-content .viewcode-back{display:block;float:right}.rst-content p.rubric{margin-bottom:12px;font-weight:700}.rst-content code.download,.rst-content tt.download{background:inherit;padding:inherit;font-weight:400;font-family:inherit;font-size:inherit;color:inherit;border:inherit;white-space:inherit}.rst-content code.download span:first-child,.rst-content tt.download span:first-child{-webkit-font-smoothing:subpixel-antialiased}.rst-content code.download span:first-child:before,.rst-content tt.download span:first-child:before{margin-right:4px}.rst-content .guilabel{border:1px solid #7fbbe3;background:#e7f2fa;font-size:80%;font-weight:700;border-radius:4px;padding:2.4px 6px;margin:auto 2px}.rst-content .versionmodified{font-style:italic}@media screen and (max-width:480px){.rst-content .sidebar{width:100%}}span[id*=MathJax-Span]{color:#404040}.math{text-align:center}@font-face{font-family:Lato;src:url(fonts/lato-normal.woff2?bd03a2cc277bbbc338d464e679fe9942) format("woff2"),url(fonts/lato-normal.woff?27bd77b9162d388cb8d4c4217c7c5e2a) format("woff");font-weight:400;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold.woff2?cccb897485813c7c256901dbca54ecf2) format("woff2"),url(fonts/lato-bold.woff?d878b6c29b10beca227e9eef4246111b) format("woff");font-weight:700;font-style:normal;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-bold-italic.woff2?0b6bb6725576b072c5d0b02ecdd1900d) format("woff2"),url(fonts/lato-bold-italic.woff?9c7e4e9eb485b4a121c760e61bc3707c) format("woff");font-weight:700;font-style:italic;font-display:block}@font-face{font-family:Lato;src:url(fonts/lato-normal-italic.woff2?4eb103b4d12be57cb1d040ed5e162e9d) format("woff2"),url(fonts/lato-normal-italic.woff?f28f2d6482446544ef1ea1ccc6dd5892) format("woff");font-weight:400;font-style:italic;font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:400;src:url(fonts/Roboto-Slab-Regular.woff2?7abf5b8d04d26a2cafea937019bca958) format("woff2"),url(fonts/Roboto-Slab-Regular.woff?c1be9284088d487c5e3ff0a10a92e58c) format("woff");font-display:block}@font-face{font-family:Roboto Slab;font-style:normal;font-weight:700;src:url(fonts/Roboto-Slab-Bold.woff2?9984f4a9bda09be08e83f2506954adbe) format("woff2"),url(fonts/Roboto-Slab-Bold.woff?bed5564a116b05148e3b3bea6fb1162a) format("woff");font-display:block} \ No newline at end of file diff --git a/cvc5-1.0.2/static/custom.css b/cvc5-1.0.2/static/custom.css new file mode 100644 index 0000000..0647fc6 --- /dev/null +++ b/cvc5-1.0.2/static/custom.css @@ -0,0 +1,109 @@ +.wy-nav-content { + background: #fcfffa; +} + +code { + border: 0px !important; +} + +code.xref { + color: unset !important; +} + +.rst-content code { + padding: 1px !important; + background: unset !important; +} + +.wy-side-nav-search { + background-color: #0099e6; +} + +.wy-breadcrumbs a { + color: #739900; +} + +.wy-breadcrumbs a:hover, a:focus { + color: #0099e6; +} + +.wy-side-nav-search input[type="text"] { + border-color: #0077b3; +} + +.wy-menu-vertical a { + color: #4dc3ff; +} + +.wy-menu-vertical a:visited { + color: #4dc3ff; +} + +.wy-menu-vertical a:hover, a:focus { + color: #ace600; +} + +a { + color: #0099e6; +} + +a:visited { + color: #0099e6; +} + +a:hover, a:focus { + color: #739900; +} + +.wy-nav-top { + color: #ace600; + background-color: #0099e6; +} + +.wy-nav-top a { + color: #ace600; +} + +.wy-side-nav-search > a { + color: #ace600; +} + +.wy-side-nav-search > a:hover, > a:focus, > a:visited { + color: #ace600; +} + +.highlight .o { + color: #ac7339; +} + +.highlight .k { + color: #2980b9; +} + +.highlight .m { + color: #ba2121; +} + +/* Removes margin of code blocks within tabs */ +.sphinx-tabs-panel div[class^="highlight"] { + margin: 1px 0 0 0; +} + +/* Adds a space between icon and content for fa icons */ +.icon-margin.fa::before { + margin-right: 0.25em; +} + +#c-api-class-hierarchy code { + font-size: 100%; + font-weight: normal; + font-family: "Lato","proxima-nova","Helvetica Neue","Arial","sans-serif"; +} + +.hide-toctree { + display: none; +} + +.expert-option { + opacity: 0.7; +} \ No newline at end of file diff --git a/cvc5-1.0.2/static/doctools.js b/cvc5-1.0.2/static/doctools.js new file mode 100644 index 0000000..c3db08d --- /dev/null +++ b/cvc5-1.0.2/static/doctools.js @@ -0,0 +1,264 @@ +/* + * doctools.js + * ~~~~~~~~~~~ + * + * Base JavaScript utilities for all Sphinx HTML documentation. + * + * :copyright: Copyright 2007-2022 by the Sphinx team, see AUTHORS. + * :license: BSD, see LICENSE for details. + * + */ +"use strict"; + +const _ready = (callback) => { + if (document.readyState !== "loading") { + callback(); + } else { + document.addEventListener("DOMContentLoaded", callback); + } +}; + +/** + * highlight a given string on a node by wrapping it in + * span elements with the given class name. + */ +const _highlight = (node, addItems, text, className) => { + if (node.nodeType === Node.TEXT_NODE) { + const val = node.nodeValue; + const parent = node.parentNode; + const pos = val.toLowerCase().indexOf(text); + if ( + pos >= 0 && + !parent.classList.contains(className) && + !parent.classList.contains("nohighlight") + ) { + let span; + + const closestNode = parent.closest("body, svg, foreignObject"); + const isInSVG = closestNode && closestNode.matches("svg"); + if (isInSVG) { + span = document.createElementNS("http://www.w3.org/2000/svg", "tspan"); + } else { + span = document.createElement("span"); + span.classList.add(className); + } + + span.appendChild(document.createTextNode(val.substr(pos, text.length))); + parent.insertBefore( + span, + parent.insertBefore( + document.createTextNode(val.substr(pos + text.length)), + node.nextSibling + ) + ); + node.nodeValue = val.substr(0, pos); + + if (isInSVG) { + const rect = document.createElementNS( + "http://www.w3.org/2000/svg", + "rect" + ); + const bbox = parent.getBBox(); + rect.x.baseVal.value = bbox.x; + rect.y.baseVal.value = bbox.y; + rect.width.baseVal.value = bbox.width; + rect.height.baseVal.value = bbox.height; + rect.setAttribute("class", className); + addItems.push({ parent: parent, target: rect }); + } + } + } else if (node.matches && !node.matches("button, select, textarea")) { + node.childNodes.forEach((el) => _highlight(el, addItems, text, className)); + } +}; +const _highlightText = (thisNode, text, className) => { + let addItems = []; + _highlight(thisNode, addItems, text, className); + addItems.forEach((obj) => + obj.parent.insertAdjacentElement("beforebegin", obj.target) + ); +}; + +/** + * Small JavaScript module for the documentation. + */ +const Documentation = { + init: () => { + Documentation.highlightSearchWords(); + Documentation.initDomainIndexTable(); + Documentation.initOnKeyListeners(); + }, + + /** + * i18n support + */ + TRANSLATIONS: {}, + PLURAL_EXPR: (n) => (n === 1 ? 0 : 1), + LOCALE: "unknown", + + // gettext and ngettext don't access this so that the functions + // can safely bound to a different name (_ = Documentation.gettext) + gettext: (string) => { + const translated = Documentation.TRANSLATIONS[string]; + switch (typeof translated) { + case "undefined": + return string; // no translation + case "string": + return translated; // translation exists + default: + return translated[0]; // (singular, plural) translation tuple exists + } + }, + + ngettext: (singular, plural, n) => { + const translated = Documentation.TRANSLATIONS[singular]; + if (typeof translated !== "undefined") + return translated[Documentation.PLURAL_EXPR(n)]; + return n === 1 ? singular : plural; + }, + + addTranslations: (catalog) => { + Object.assign(Documentation.TRANSLATIONS, catalog.messages); + Documentation.PLURAL_EXPR = new Function( + "n", + `return (${catalog.plural_expr})` + ); + Documentation.LOCALE = catalog.locale; + }, + + /** + * highlight the search words provided in the url in the text + */ + highlightSearchWords: () => { + const highlight = + new URLSearchParams(window.location.search).get("highlight") || ""; + const terms = highlight.toLowerCase().split(/\s+/).filter(x => x); + if (terms.length === 0) return; // nothing to do + + // There should never be more than one element matching "div.body" + const divBody = document.querySelectorAll("div.body"); + const body = divBody.length ? divBody[0] : document.querySelector("body"); + window.setTimeout(() => { + terms.forEach((term) => _highlightText(body, term, "highlighted")); + }, 10); + + const searchBox = document.getElementById("searchbox"); + if (searchBox === null) return; + searchBox.appendChild( + document + .createRange() + .createContextualFragment( + '" + ) + ); + }, + + /** + * helper function to hide the search marks again + */ + hideSearchWords: () => { + document + .querySelectorAll("#searchbox .highlight-link") + .forEach((el) => el.remove()); + document + .querySelectorAll("span.highlighted") + .forEach((el) => el.classList.remove("highlighted")); + const url = new URL(window.location); + url.searchParams.delete("highlight"); + window.history.replaceState({}, "", url); + }, + + /** + * helper function to focus on search bar + */ + focusSearchBar: () => { + document.querySelectorAll("input[name=q]")[0]?.focus(); + }, + + /** + * Initialise the domain index toggle buttons + */ + initDomainIndexTable: () => { + const toggler = (el) => { + const idNumber = el.id.substr(7); + const toggledRows = document.querySelectorAll(`tr.cg-${idNumber}`); + if (el.src.substr(-9) === "minus.png") { + el.src = `${el.src.substr(0, el.src.length - 9)}plus.png`; + toggledRows.forEach((el) => (el.style.display = "none")); + } else { + el.src = `${el.src.substr(0, el.src.length - 8)}minus.png`; + toggledRows.forEach((el) => (el.style.display = "")); + } + }; + + const togglerElements = document.querySelectorAll("img.toggler"); + togglerElements.forEach((el) => + el.addEventListener("click", (event) => toggler(event.currentTarget)) + ); + togglerElements.forEach((el) => (el.style.display = "")); + if (DOCUMENTATION_OPTIONS.COLLAPSE_INDEX) togglerElements.forEach(toggler); + }, + + initOnKeyListeners: () => { + // only install a listener if it is really needed + if ( + !DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS && + !DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS + ) + return; + + const blacklistedElements = new Set([ + "TEXTAREA", + "INPUT", + "SELECT", + "BUTTON", + ]); + document.addEventListener("keydown", (event) => { + if (blacklistedElements.has(document.activeElement.tagName)) return; // bail for input elements + if (event.altKey || event.ctrlKey || event.metaKey) return; // bail with special keys + + if (!event.shiftKey) { + switch (event.key) { + case "ArrowLeft": + if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break; + + const prevLink = document.querySelector('link[rel="prev"]'); + if (prevLink && prevLink.href) { + window.location.href = prevLink.href; + event.preventDefault(); + } + break; + case "ArrowRight": + if (!DOCUMENTATION_OPTIONS.NAVIGATION_WITH_KEYS) break; + + const nextLink = document.querySelector('link[rel="next"]'); + if (nextLink && nextLink.href) { + window.location.href = nextLink.href; + event.preventDefault(); + } + break; + case "Escape": + if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break; + Documentation.hideSearchWords(); + event.preventDefault(); + } + } + + // some keyboard layouts may need Shift to get / + switch (event.key) { + case "/": + if (!DOCUMENTATION_OPTIONS.ENABLE_SEARCH_SHORTCUTS) break; + Documentation.focusSearchBar(); + event.preventDefault(); + } + }); + }, +}; + +// quick alias for translations +const _ = Documentation.gettext; + +_ready(Documentation.init); diff --git a/cvc5-1.0.2/static/documentation_options.js b/cvc5-1.0.2/static/documentation_options.js new file mode 100644 index 0000000..b57ae3b --- /dev/null +++ b/cvc5-1.0.2/static/documentation_options.js @@ -0,0 +1,14 @@ +var DOCUMENTATION_OPTIONS = { + URL_ROOT: document.getElementById("documentation_options").getAttribute('data-url_root'), + VERSION: '', + LANGUAGE: 'en', + COLLAPSE_INDEX: false, + BUILDER: 'html', + FILE_SUFFIX: '.html', + LINK_SUFFIX: '.html', + HAS_SOURCE: true, + SOURCELINK_SUFFIX: '.txt', + NAVIGATION_WITH_KEYS: false, + SHOW_SEARCH_SUMMARY: true, + ENABLE_SEARCH_SHORTCUTS: true, +}; \ No newline at end of file diff --git a/cvc5-1.0.2/static/file.png b/cvc5-1.0.2/static/file.png new file mode 100644 index 0000000..a858a41 Binary files /dev/null and b/cvc5-1.0.2/static/file.png differ diff --git a/cvc5-1.0.2/static/jquery-3.6.0.js b/cvc5-1.0.2/static/jquery-3.6.0.js new file mode 100644 index 0000000..fc6c299 --- /dev/null +++ b/cvc5-1.0.2/static/jquery-3.6.0.js @@ -0,0 +1,10881 @@ +/*! + * jQuery JavaScript Library v3.6.0 + * https://jquery.com/ + * + * Includes Sizzle.js + * https://sizzlejs.com/ + * + * Copyright OpenJS Foundation and other contributors + * Released under the MIT license + * https://jquery.org/license + * + * Date: 2021-03-02T17:08Z + */ +( function( global, factory ) { + + "use strict"; + + if ( typeof module === "object" && typeof module.exports === "object" ) { + + // For CommonJS and CommonJS-like environments where a proper `window` + // is present, execute the factory and get jQuery. + // For environments that do not have a `window` with a `document` + // (such as Node.js), expose a factory as module.exports. + // This accentuates the need for the creation of a real `window`. + // e.g. var jQuery = require("jquery")(window); + // See ticket #14549 for more info. + module.exports = global.document ? + factory( global, true ) : + function( w ) { + if ( !w.document ) { + throw new Error( "jQuery requires a window with a document" ); + } + return factory( w ); + }; + } else { + factory( global ); + } + +// Pass this if window is not defined yet +} )( typeof window !== "undefined" ? window : this, function( window, noGlobal ) { + +// Edge <= 12 - 13+, Firefox <=18 - 45+, IE 10 - 11, Safari 5.1 - 9+, iOS 6 - 9.1 +// throw exceptions when non-strict code (e.g., ASP.NET 4.5) accesses strict mode +// arguments.callee.caller (trac-13335). But as of jQuery 3.0 (2016), strict mode should be common +// enough that all such attempts are guarded in a try block. +"use strict"; + +var arr = []; + +var getProto = Object.getPrototypeOf; + +var slice = arr.slice; + +var flat = arr.flat ? function( array ) { + return arr.flat.call( array ); +} : function( array ) { + return arr.concat.apply( [], array ); +}; + + +var push = arr.push; + +var indexOf = arr.indexOf; + +var class2type = {}; + +var toString = class2type.toString; + +var hasOwn = class2type.hasOwnProperty; + +var fnToString = hasOwn.toString; + +var ObjectFunctionString = fnToString.call( Object ); + +var support = {}; + +var isFunction = function isFunction( obj ) { + + // Support: Chrome <=57, Firefox <=52 + // In some browsers, typeof returns "function" for HTML elements + // (i.e., `typeof document.createElement( "object" ) === "function"`). + // We don't want to classify *any* DOM node as a function. + // Support: QtWeb <=3.8.5, WebKit <=534.34, wkhtmltopdf tool <=0.12.5 + // Plus for old WebKit, typeof returns "function" for HTML collections + // (e.g., `typeof document.getElementsByTagName("div") === "function"`). (gh-4756) + return typeof obj === "function" && typeof obj.nodeType !== "number" && + typeof obj.item !== "function"; + }; + + +var isWindow = function isWindow( obj ) { + return obj != null && obj === obj.window; + }; + + +var document = window.document; + + + + var preservedScriptAttributes = { + type: true, + src: true, + nonce: true, + noModule: true + }; + + function DOMEval( code, node, doc ) { + doc = doc || document; + + var i, val, + script = doc.createElement( "script" ); + + script.text = code; + if ( node ) { + for ( i in preservedScriptAttributes ) { + + // Support: Firefox 64+, Edge 18+ + // Some browsers don't support the "nonce" property on scripts. + // On the other hand, just using `getAttribute` is not enough as + // the `nonce` attribute is reset to an empty string whenever it + // becomes browsing-context connected. + // See https://github.com/whatwg/html/issues/2369 + // See https://html.spec.whatwg.org/#nonce-attributes + // The `node.getAttribute` check was added for the sake of + // `jQuery.globalEval` so that it can fake a nonce-containing node + // via an object. + val = node[ i ] || node.getAttribute && node.getAttribute( i ); + if ( val ) { + script.setAttribute( i, val ); + } + } + } + doc.head.appendChild( script ).parentNode.removeChild( script ); + } + + +function toType( obj ) { + if ( obj == null ) { + return obj + ""; + } + + // Support: Android <=2.3 only (functionish RegExp) + return typeof obj === "object" || typeof obj === "function" ? + class2type[ toString.call( obj ) ] || "object" : + typeof obj; +} +/* global Symbol */ +// Defining this global in .eslintrc.json would create a danger of using the global +// unguarded in another place, it seems safer to define global only for this module + + + +var + version = "3.6.0", + + // Define a local copy of jQuery + jQuery = function( selector, context ) { + + // The jQuery object is actually just the init constructor 'enhanced' + // Need init if jQuery is called (just allow error to be thrown if not included) + return new jQuery.fn.init( selector, context ); + }; + +jQuery.fn = jQuery.prototype = { + + // The current version of jQuery being used + jquery: version, + + constructor: jQuery, + + // The default length of a jQuery object is 0 + length: 0, + + toArray: function() { + return slice.call( this ); + }, + + // Get the Nth element in the matched element set OR + // Get the whole matched element set as a clean array + get: function( num ) { + + // Return all the elements in a clean array + if ( num == null ) { + return slice.call( this ); + } + + // Return just the one element from the set + return num < 0 ? this[ num + this.length ] : this[ num ]; + }, + + // Take an array of elements and push it onto the stack + // (returning the new matched element set) + pushStack: function( elems ) { + + // Build a new jQuery matched element set + var ret = jQuery.merge( this.constructor(), elems ); + + // Add the old object onto the stack (as a reference) + ret.prevObject = this; + + // Return the newly-formed element set + return ret; + }, + + // Execute a callback for every element in the matched set. + each: function( callback ) { + return jQuery.each( this, callback ); + }, + + map: function( callback ) { + return this.pushStack( jQuery.map( this, function( elem, i ) { + return callback.call( elem, i, elem ); + } ) ); + }, + + slice: function() { + return this.pushStack( slice.apply( this, arguments ) ); + }, + + first: function() { + return this.eq( 0 ); + }, + + last: function() { + return this.eq( -1 ); + }, + + even: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return ( i + 1 ) % 2; + } ) ); + }, + + odd: function() { + return this.pushStack( jQuery.grep( this, function( _elem, i ) { + return i % 2; + } ) ); + }, + + eq: function( i ) { + var len = this.length, + j = +i + ( i < 0 ? len : 0 ); + return this.pushStack( j >= 0 && j < len ? [ this[ j ] ] : [] ); + }, + + end: function() { + return this.prevObject || this.constructor(); + }, + + // For internal use only. + // Behaves like an Array's method, not like a jQuery method. + push: push, + sort: arr.sort, + splice: arr.splice +}; + +jQuery.extend = jQuery.fn.extend = function() { + var options, name, src, copy, copyIsArray, clone, + target = arguments[ 0 ] || {}, + i = 1, + length = arguments.length, + deep = false; + + // Handle a deep copy situation + if ( typeof target === "boolean" ) { + deep = target; + + // Skip the boolean and the target + target = arguments[ i ] || {}; + i++; + } + + // Handle case when target is a string or something (possible in deep copy) + if ( typeof target !== "object" && !isFunction( target ) ) { + target = {}; + } + + // Extend jQuery itself if only one argument is passed + if ( i === length ) { + target = this; + i--; + } + + for ( ; i < length; i++ ) { + + // Only deal with non-null/undefined values + if ( ( options = arguments[ i ] ) != null ) { + + // Extend the base object + for ( name in options ) { + copy = options[ name ]; + + // Prevent Object.prototype pollution + // Prevent never-ending loop + if ( name === "__proto__" || target === copy ) { + continue; + } + + // Recurse if we're merging plain objects or arrays + if ( deep && copy && ( jQuery.isPlainObject( copy ) || + ( copyIsArray = Array.isArray( copy ) ) ) ) { + src = target[ name ]; + + // Ensure proper type for the source value + if ( copyIsArray && !Array.isArray( src ) ) { + clone = []; + } else if ( !copyIsArray && !jQuery.isPlainObject( src ) ) { + clone = {}; + } else { + clone = src; + } + copyIsArray = false; + + // Never move original objects, clone them + target[ name ] = jQuery.extend( deep, clone, copy ); + + // Don't bring in undefined values + } else if ( copy !== undefined ) { + target[ name ] = copy; + } + } + } + } + + // Return the modified object + return target; +}; + +jQuery.extend( { + + // Unique for each copy of jQuery on the page + expando: "jQuery" + ( version + Math.random() ).replace( /\D/g, "" ), + + // Assume jQuery is ready without the ready module + isReady: true, + + error: function( msg ) { + throw new Error( msg ); + }, + + noop: function() {}, + + isPlainObject: function( obj ) { + var proto, Ctor; + + // Detect obvious negatives + // Use toString instead of jQuery.type to catch host objects + if ( !obj || toString.call( obj ) !== "[object Object]" ) { + return false; + } + + proto = getProto( obj ); + + // Objects with no prototype (e.g., `Object.create( null )`) are plain + if ( !proto ) { + return true; + } + + // Objects with prototype are plain iff they were constructed by a global Object function + Ctor = hasOwn.call( proto, "constructor" ) && proto.constructor; + return typeof Ctor === "function" && fnToString.call( Ctor ) === ObjectFunctionString; + }, + + isEmptyObject: function( obj ) { + var name; + + for ( name in obj ) { + return false; + } + return true; + }, + + // Evaluates a script in a provided context; falls back to the global one + // if not specified. + globalEval: function( code, options, doc ) { + DOMEval( code, { nonce: options && options.nonce }, doc ); + }, + + each: function( obj, callback ) { + var length, i = 0; + + if ( isArrayLike( obj ) ) { + length = obj.length; + for ( ; i < length; i++ ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } else { + for ( i in obj ) { + if ( callback.call( obj[ i ], i, obj[ i ] ) === false ) { + break; + } + } + } + + return obj; + }, + + // results is for internal usage only + makeArray: function( arr, results ) { + var ret = results || []; + + if ( arr != null ) { + if ( isArrayLike( Object( arr ) ) ) { + jQuery.merge( ret, + typeof arr === "string" ? + [ arr ] : arr + ); + } else { + push.call( ret, arr ); + } + } + + return ret; + }, + + inArray: function( elem, arr, i ) { + return arr == null ? -1 : indexOf.call( arr, elem, i ); + }, + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + merge: function( first, second ) { + var len = +second.length, + j = 0, + i = first.length; + + for ( ; j < len; j++ ) { + first[ i++ ] = second[ j ]; + } + + first.length = i; + + return first; + }, + + grep: function( elems, callback, invert ) { + var callbackInverse, + matches = [], + i = 0, + length = elems.length, + callbackExpect = !invert; + + // Go through the array, only saving the items + // that pass the validator function + for ( ; i < length; i++ ) { + callbackInverse = !callback( elems[ i ], i ); + if ( callbackInverse !== callbackExpect ) { + matches.push( elems[ i ] ); + } + } + + return matches; + }, + + // arg is for internal usage only + map: function( elems, callback, arg ) { + var length, value, + i = 0, + ret = []; + + // Go through the array, translating each of the items to their new values + if ( isArrayLike( elems ) ) { + length = elems.length; + for ( ; i < length; i++ ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + + // Go through every key on the object, + } else { + for ( i in elems ) { + value = callback( elems[ i ], i, arg ); + + if ( value != null ) { + ret.push( value ); + } + } + } + + // Flatten any nested arrays + return flat( ret ); + }, + + // A global GUID counter for objects + guid: 1, + + // jQuery.support is not used in Core but other projects attach their + // properties to it so it needs to exist. + support: support +} ); + +if ( typeof Symbol === "function" ) { + jQuery.fn[ Symbol.iterator ] = arr[ Symbol.iterator ]; +} + +// Populate the class2type map +jQuery.each( "Boolean Number String Function Array Date RegExp Object Error Symbol".split( " " ), + function( _i, name ) { + class2type[ "[object " + name + "]" ] = name.toLowerCase(); + } ); + +function isArrayLike( obj ) { + + // Support: real iOS 8.2 only (not reproducible in simulator) + // `in` check used to prevent JIT error (gh-2145) + // hasOwn isn't used here due to false negatives + // regarding Nodelist length in IE + var length = !!obj && "length" in obj && obj.length, + type = toType( obj ); + + if ( isFunction( obj ) || isWindow( obj ) ) { + return false; + } + + return type === "array" || length === 0 || + typeof length === "number" && length > 0 && ( length - 1 ) in obj; +} +var Sizzle = +/*! + * Sizzle CSS Selector Engine v2.3.6 + * https://sizzlejs.com/ + * + * Copyright JS Foundation and other contributors + * Released under the MIT license + * https://js.foundation/ + * + * Date: 2021-02-16 + */ +( function( window ) { +var i, + support, + Expr, + getText, + isXML, + tokenize, + compile, + select, + outermostContext, + sortInput, + hasDuplicate, + + // Local document vars + setDocument, + document, + docElem, + documentIsHTML, + rbuggyQSA, + rbuggyMatches, + matches, + contains, + + // Instance-specific data + expando = "sizzle" + 1 * new Date(), + preferredDoc = window.document, + dirruns = 0, + done = 0, + classCache = createCache(), + tokenCache = createCache(), + compilerCache = createCache(), + nonnativeSelectorCache = createCache(), + sortOrder = function( a, b ) { + if ( a === b ) { + hasDuplicate = true; + } + return 0; + }, + + // Instance methods + hasOwn = ( {} ).hasOwnProperty, + arr = [], + pop = arr.pop, + pushNative = arr.push, + push = arr.push, + slice = arr.slice, + + // Use a stripped-down indexOf as it's faster than native + // https://jsperf.com/thor-indexof-vs-for/5 + indexOf = function( list, elem ) { + var i = 0, + len = list.length; + for ( ; i < len; i++ ) { + if ( list[ i ] === elem ) { + return i; + } + } + return -1; + }, + + booleans = "checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|" + + "ismap|loop|multiple|open|readonly|required|scoped", + + // Regular expressions + + // http://www.w3.org/TR/css3-selectors/#whitespace + whitespace = "[\\x20\\t\\r\\n\\f]", + + // https://www.w3.org/TR/css-syntax-3/#ident-token-diagram + identifier = "(?:\\\\[\\da-fA-F]{1,6}" + whitespace + + "?|\\\\[^\\r\\n\\f]|[\\w-]|[^\0-\\x7f])+", + + // Attribute selectors: http://www.w3.org/TR/selectors/#attribute-selectors + attributes = "\\[" + whitespace + "*(" + identifier + ")(?:" + whitespace + + + // Operator (capture 2) + "*([*^$|!~]?=)" + whitespace + + + // "Attribute values must be CSS identifiers [capture 5] + // or strings [capture 3 or capture 4]" + "*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|(" + identifier + "))|)" + + whitespace + "*\\]", + + pseudos = ":(" + identifier + ")(?:\\((" + + + // To reduce the number of selectors needing tokenize in the preFilter, prefer arguments: + // 1. quoted (capture 3; capture 4 or capture 5) + "('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|" + + + // 2. simple (capture 6) + "((?:\\\\.|[^\\\\()[\\]]|" + attributes + ")*)|" + + + // 3. anything else (capture 2) + ".*" + + ")\\)|)", + + // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter + rwhitespace = new RegExp( whitespace + "+", "g" ), + rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + + whitespace + "+$", "g" ), + + rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ), + rcombinators = new RegExp( "^" + whitespace + "*([>+~]|" + whitespace + ")" + whitespace + + "*" ), + rdescend = new RegExp( whitespace + "|>" ), + + rpseudo = new RegExp( pseudos ), + ridentifier = new RegExp( "^" + identifier + "$" ), + + matchExpr = { + "ID": new RegExp( "^#(" + identifier + ")" ), + "CLASS": new RegExp( "^\\.(" + identifier + ")" ), + "TAG": new RegExp( "^(" + identifier + "|[*])" ), + "ATTR": new RegExp( "^" + attributes ), + "PSEUDO": new RegExp( "^" + pseudos ), + "CHILD": new RegExp( "^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\(" + + whitespace + "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + + whitespace + "*(\\d+)|))" + whitespace + "*\\)|)", "i" ), + "bool": new RegExp( "^(?:" + booleans + ")$", "i" ), + + // For use in libraries implementing .is() + // We use this for POS matching in `select` + "needsContext": new RegExp( "^" + whitespace + + "*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace + + "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)", "i" ) + }, + + rhtml = /HTML$/i, + rinputs = /^(?:input|select|textarea|button)$/i, + rheader = /^h\d$/i, + + rnative = /^[^{]+\{\s*\[native \w/, + + // Easily-parseable/retrievable ID or TAG or CLASS selectors + rquickExpr = /^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/, + + rsibling = /[+~]/, + + // CSS escapes + // http://www.w3.org/TR/CSS21/syndata.html#escaped-characters + runescape = new RegExp( "\\\\[\\da-fA-F]{1,6}" + whitespace + "?|\\\\([^\\r\\n\\f])", "g" ), + funescape = function( escape, nonHex ) { + var high = "0x" + escape.slice( 1 ) - 0x10000; + + return nonHex ? + + // Strip the backslash prefix from a non-hex escape sequence + nonHex : + + // Replace a hexadecimal escape sequence with the encoded Unicode code point + // Support: IE <=11+ + // For values outside the Basic Multilingual Plane (BMP), manually construct a + // surrogate pair + high < 0 ? + String.fromCharCode( high + 0x10000 ) : + String.fromCharCode( high >> 10 | 0xD800, high & 0x3FF | 0xDC00 ); + }, + + // CSS string/identifier serialization + // https://drafts.csswg.org/cssom/#common-serializing-idioms + rcssescape = /([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g, + fcssescape = function( ch, asCodePoint ) { + if ( asCodePoint ) { + + // U+0000 NULL becomes U+FFFD REPLACEMENT CHARACTER + if ( ch === "\0" ) { + return "\uFFFD"; + } + + // Control characters and (dependent upon position) numbers get escaped as code points + return ch.slice( 0, -1 ) + "\\" + + ch.charCodeAt( ch.length - 1 ).toString( 16 ) + " "; + } + + // Other potentially-special ASCII characters get backslash-escaped + return "\\" + ch; + }, + + // Used for iframes + // See setDocument() + // Removing the function wrapper causes a "Permission Denied" + // error in IE + unloadHandler = function() { + setDocument(); + }, + + inDisabledFieldset = addCombinator( + function( elem ) { + return elem.disabled === true && elem.nodeName.toLowerCase() === "fieldset"; + }, + { dir: "parentNode", next: "legend" } + ); + +// Optimize for push.apply( _, NodeList ) +try { + push.apply( + ( arr = slice.call( preferredDoc.childNodes ) ), + preferredDoc.childNodes + ); + + // Support: Android<4.0 + // Detect silently failing push.apply + // eslint-disable-next-line no-unused-expressions + arr[ preferredDoc.childNodes.length ].nodeType; +} catch ( e ) { + push = { apply: arr.length ? + + // Leverage slice if possible + function( target, els ) { + pushNative.apply( target, slice.call( els ) ); + } : + + // Support: IE<9 + // Otherwise append directly + function( target, els ) { + var j = target.length, + i = 0; + + // Can't trust NodeList.length + while ( ( target[ j++ ] = els[ i++ ] ) ) {} + target.length = j - 1; + } + }; +} + +function Sizzle( selector, context, results, seed ) { + var m, i, elem, nid, match, groups, newSelector, + newContext = context && context.ownerDocument, + + // nodeType defaults to 9, since context defaults to document + nodeType = context ? context.nodeType : 9; + + results = results || []; + + // Return early from calls with invalid selector or context + if ( typeof selector !== "string" || !selector || + nodeType !== 1 && nodeType !== 9 && nodeType !== 11 ) { + + return results; + } + + // Try to shortcut find operations (as opposed to filters) in HTML documents + if ( !seed ) { + setDocument( context ); + context = context || document; + + if ( documentIsHTML ) { + + // If the selector is sufficiently simple, try using a "get*By*" DOM method + // (excepting DocumentFragment context, where the methods don't exist) + if ( nodeType !== 11 && ( match = rquickExpr.exec( selector ) ) ) { + + // ID selector + if ( ( m = match[ 1 ] ) ) { + + // Document context + if ( nodeType === 9 ) { + if ( ( elem = context.getElementById( m ) ) ) { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( elem.id === m ) { + results.push( elem ); + return results; + } + } else { + return results; + } + + // Element context + } else { + + // Support: IE, Opera, Webkit + // TODO: identify versions + // getElementById can match elements by name instead of ID + if ( newContext && ( elem = newContext.getElementById( m ) ) && + contains( context, elem ) && + elem.id === m ) { + + results.push( elem ); + return results; + } + } + + // Type selector + } else if ( match[ 2 ] ) { + push.apply( results, context.getElementsByTagName( selector ) ); + return results; + + // Class selector + } else if ( ( m = match[ 3 ] ) && support.getElementsByClassName && + context.getElementsByClassName ) { + + push.apply( results, context.getElementsByClassName( m ) ); + return results; + } + } + + // Take advantage of querySelectorAll + if ( support.qsa && + !nonnativeSelectorCache[ selector + " " ] && + ( !rbuggyQSA || !rbuggyQSA.test( selector ) ) && + + // Support: IE 8 only + // Exclude object elements + ( nodeType !== 1 || context.nodeName.toLowerCase() !== "object" ) ) { + + newSelector = selector; + newContext = context; + + // qSA considers elements outside a scoping root when evaluating child or + // descendant combinators, which is not what we want. + // In such cases, we work around the behavior by prefixing every selector in the + // list with an ID selector referencing the scope context. + // The technique has to be used as well when a leading combinator is used + // as such selectors are not recognized by querySelectorAll. + // Thanks to Andrew Dupont for this technique. + if ( nodeType === 1 && + ( rdescend.test( selector ) || rcombinators.test( selector ) ) ) { + + // Expand context for sibling selectors + newContext = rsibling.test( selector ) && testContext( context.parentNode ) || + context; + + // We can use :scope instead of the ID hack if the browser + // supports it & if we're not changing the context. + if ( newContext !== context || !support.scope ) { + + // Capture the context ID, setting it first if necessary + if ( ( nid = context.getAttribute( "id" ) ) ) { + nid = nid.replace( rcssescape, fcssescape ); + } else { + context.setAttribute( "id", ( nid = expando ) ); + } + } + + // Prefix every selector in the list + groups = tokenize( selector ); + i = groups.length; + while ( i-- ) { + groups[ i ] = ( nid ? "#" + nid : ":scope" ) + " " + + toSelector( groups[ i ] ); + } + newSelector = groups.join( "," ); + } + + try { + push.apply( results, + newContext.querySelectorAll( newSelector ) + ); + return results; + } catch ( qsaError ) { + nonnativeSelectorCache( selector, true ); + } finally { + if ( nid === expando ) { + context.removeAttribute( "id" ); + } + } + } + } + } + + // All others + return select( selector.replace( rtrim, "$1" ), context, results, seed ); +} + +/** + * Create key-value caches of limited size + * @returns {function(string, object)} Returns the Object data after storing it on itself with + * property name the (space-suffixed) string and (if the cache is larger than Expr.cacheLength) + * deleting the oldest entry + */ +function createCache() { + var keys = []; + + function cache( key, value ) { + + // Use (key + " ") to avoid collision with native prototype properties (see Issue #157) + if ( keys.push( key + " " ) > Expr.cacheLength ) { + + // Only keep the most recent entries + delete cache[ keys.shift() ]; + } + return ( cache[ key + " " ] = value ); + } + return cache; +} + +/** + * Mark a function for special use by Sizzle + * @param {Function} fn The function to mark + */ +function markFunction( fn ) { + fn[ expando ] = true; + return fn; +} + +/** + * Support testing using an element + * @param {Function} fn Passed the created element and returns a boolean result + */ +function assert( fn ) { + var el = document.createElement( "fieldset" ); + + try { + return !!fn( el ); + } catch ( e ) { + return false; + } finally { + + // Remove from its parent by default + if ( el.parentNode ) { + el.parentNode.removeChild( el ); + } + + // release memory in IE + el = null; + } +} + +/** + * Adds the same handler for all of the specified attrs + * @param {String} attrs Pipe-separated list of attributes + * @param {Function} handler The method that will be applied + */ +function addHandle( attrs, handler ) { + var arr = attrs.split( "|" ), + i = arr.length; + + while ( i-- ) { + Expr.attrHandle[ arr[ i ] ] = handler; + } +} + +/** + * Checks document order of two siblings + * @param {Element} a + * @param {Element} b + * @returns {Number} Returns less than 0 if a precedes b, greater than 0 if a follows b + */ +function siblingCheck( a, b ) { + var cur = b && a, + diff = cur && a.nodeType === 1 && b.nodeType === 1 && + a.sourceIndex - b.sourceIndex; + + // Use IE sourceIndex if available on both nodes + if ( diff ) { + return diff; + } + + // Check if b follows a + if ( cur ) { + while ( ( cur = cur.nextSibling ) ) { + if ( cur === b ) { + return -1; + } + } + } + + return a ? 1 : -1; +} + +/** + * Returns a function to use in pseudos for input types + * @param {String} type + */ +function createInputPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for buttons + * @param {String} type + */ +function createButtonPseudo( type ) { + return function( elem ) { + var name = elem.nodeName.toLowerCase(); + return ( name === "input" || name === "button" ) && elem.type === type; + }; +} + +/** + * Returns a function to use in pseudos for :enabled/:disabled + * @param {Boolean} disabled true for :disabled; false for :enabled + */ +function createDisabledPseudo( disabled ) { + + // Known :disabled false positives: fieldset[disabled] > legend:nth-of-type(n+2) :can-disable + return function( elem ) { + + // Only certain elements can match :enabled or :disabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-enabled + // https://html.spec.whatwg.org/multipage/scripting.html#selector-disabled + if ( "form" in elem ) { + + // Check for inherited disabledness on relevant non-disabled elements: + // * listed form-associated elements in a disabled fieldset + // https://html.spec.whatwg.org/multipage/forms.html#category-listed + // https://html.spec.whatwg.org/multipage/forms.html#concept-fe-disabled + // * option elements in a disabled optgroup + // https://html.spec.whatwg.org/multipage/forms.html#concept-option-disabled + // All such elements have a "form" property. + if ( elem.parentNode && elem.disabled === false ) { + + // Option elements defer to a parent optgroup if present + if ( "label" in elem ) { + if ( "label" in elem.parentNode ) { + return elem.parentNode.disabled === disabled; + } else { + return elem.disabled === disabled; + } + } + + // Support: IE 6 - 11 + // Use the isDisabled shortcut property to check for disabled fieldset ancestors + return elem.isDisabled === disabled || + + // Where there is no isDisabled, check manually + /* jshint -W018 */ + elem.isDisabled !== !disabled && + inDisabledFieldset( elem ) === disabled; + } + + return elem.disabled === disabled; + + // Try to winnow out elements that can't be disabled before trusting the disabled property. + // Some victims get caught in our net (label, legend, menu, track), but it shouldn't + // even exist on them, let alone have a boolean value. + } else if ( "label" in elem ) { + return elem.disabled === disabled; + } + + // Remaining elements are neither :enabled nor :disabled + return false; + }; +} + +/** + * Returns a function to use in pseudos for positionals + * @param {Function} fn + */ +function createPositionalPseudo( fn ) { + return markFunction( function( argument ) { + argument = +argument; + return markFunction( function( seed, matches ) { + var j, + matchIndexes = fn( [], seed.length, argument ), + i = matchIndexes.length; + + // Match elements found at the specified indexes + while ( i-- ) { + if ( seed[ ( j = matchIndexes[ i ] ) ] ) { + seed[ j ] = !( matches[ j ] = seed[ j ] ); + } + } + } ); + } ); +} + +/** + * Checks a node for validity as a Sizzle context + * @param {Element|Object=} context + * @returns {Element|Object|Boolean} The input node if acceptable, otherwise a falsy value + */ +function testContext( context ) { + return context && typeof context.getElementsByTagName !== "undefined" && context; +} + +// Expose support vars for convenience +support = Sizzle.support = {}; + +/** + * Detects XML nodes + * @param {Element|Object} elem An element or a document + * @returns {Boolean} True iff elem is a non-HTML XML node + */ +isXML = Sizzle.isXML = function( elem ) { + var namespace = elem && elem.namespaceURI, + docElem = elem && ( elem.ownerDocument || elem ).documentElement; + + // Support: IE <=8 + // Assume HTML when documentElement doesn't yet exist, such as inside loading iframes + // https://bugs.jquery.com/ticket/4833 + return !rhtml.test( namespace || docElem && docElem.nodeName || "HTML" ); +}; + +/** + * Sets document-related variables once based on the current document + * @param {Element|Object} [doc] An element or document object to use to set the document + * @returns {Object} Returns the current document + */ +setDocument = Sizzle.setDocument = function( node ) { + var hasCompare, subWindow, + doc = node ? node.ownerDocument || node : preferredDoc; + + // Return early if doc is invalid or already selected + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( doc == document || doc.nodeType !== 9 || !doc.documentElement ) { + return document; + } + + // Update global variables + document = doc; + docElem = document.documentElement; + documentIsHTML = !isXML( document ); + + // Support: IE 9 - 11+, Edge 12 - 18+ + // Accessing iframe documents after unload throws "permission denied" errors (jQuery #13936) + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( preferredDoc != document && + ( subWindow = document.defaultView ) && subWindow.top !== subWindow ) { + + // Support: IE 11, Edge + if ( subWindow.addEventListener ) { + subWindow.addEventListener( "unload", unloadHandler, false ); + + // Support: IE 9 - 10 only + } else if ( subWindow.attachEvent ) { + subWindow.attachEvent( "onunload", unloadHandler ); + } + } + + // Support: IE 8 - 11+, Edge 12 - 18+, Chrome <=16 - 25 only, Firefox <=3.6 - 31 only, + // Safari 4 - 5 only, Opera <=11.6 - 12.x only + // IE/Edge & older browsers don't support the :scope pseudo-class. + // Support: Safari 6.0 only + // Safari 6.0 supports :scope but it's an alias of :root there. + support.scope = assert( function( el ) { + docElem.appendChild( el ).appendChild( document.createElement( "div" ) ); + return typeof el.querySelectorAll !== "undefined" && + !el.querySelectorAll( ":scope fieldset div" ).length; + } ); + + /* Attributes + ---------------------------------------------------------------------- */ + + // Support: IE<8 + // Verify that getAttribute really returns attributes and not properties + // (excepting IE8 booleans) + support.attributes = assert( function( el ) { + el.className = "i"; + return !el.getAttribute( "className" ); + } ); + + /* getElement(s)By* + ---------------------------------------------------------------------- */ + + // Check if getElementsByTagName("*") returns only elements + support.getElementsByTagName = assert( function( el ) { + el.appendChild( document.createComment( "" ) ); + return !el.getElementsByTagName( "*" ).length; + } ); + + // Support: IE<9 + support.getElementsByClassName = rnative.test( document.getElementsByClassName ); + + // Support: IE<10 + // Check if getElementById returns elements by name + // The broken getElementById methods don't pick up programmatically-set names, + // so use a roundabout getElementsByName test + support.getById = assert( function( el ) { + docElem.appendChild( el ).id = expando; + return !document.getElementsByName || !document.getElementsByName( expando ).length; + } ); + + // ID filter and find + if ( support.getById ) { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + return elem.getAttribute( "id" ) === attrId; + }; + }; + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var elem = context.getElementById( id ); + return elem ? [ elem ] : []; + } + }; + } else { + Expr.filter[ "ID" ] = function( id ) { + var attrId = id.replace( runescape, funescape ); + return function( elem ) { + var node = typeof elem.getAttributeNode !== "undefined" && + elem.getAttributeNode( "id" ); + return node && node.value === attrId; + }; + }; + + // Support: IE 6 - 7 only + // getElementById is not reliable as a find shortcut + Expr.find[ "ID" ] = function( id, context ) { + if ( typeof context.getElementById !== "undefined" && documentIsHTML ) { + var node, i, elems, + elem = context.getElementById( id ); + + if ( elem ) { + + // Verify the id attribute + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + + // Fall back on getElementsByName + elems = context.getElementsByName( id ); + i = 0; + while ( ( elem = elems[ i++ ] ) ) { + node = elem.getAttributeNode( "id" ); + if ( node && node.value === id ) { + return [ elem ]; + } + } + } + + return []; + } + }; + } + + // Tag + Expr.find[ "TAG" ] = support.getElementsByTagName ? + function( tag, context ) { + if ( typeof context.getElementsByTagName !== "undefined" ) { + return context.getElementsByTagName( tag ); + + // DocumentFragment nodes don't have gEBTN + } else if ( support.qsa ) { + return context.querySelectorAll( tag ); + } + } : + + function( tag, context ) { + var elem, + tmp = [], + i = 0, + + // By happy coincidence, a (broken) gEBTN appears on DocumentFragment nodes too + results = context.getElementsByTagName( tag ); + + // Filter out possible comments + if ( tag === "*" ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem.nodeType === 1 ) { + tmp.push( elem ); + } + } + + return tmp; + } + return results; + }; + + // Class + Expr.find[ "CLASS" ] = support.getElementsByClassName && function( className, context ) { + if ( typeof context.getElementsByClassName !== "undefined" && documentIsHTML ) { + return context.getElementsByClassName( className ); + } + }; + + /* QSA/matchesSelector + ---------------------------------------------------------------------- */ + + // QSA and matchesSelector support + + // matchesSelector(:active) reports false when true (IE9/Opera 11.5) + rbuggyMatches = []; + + // qSa(:focus) reports false when true (Chrome 21) + // We allow this because of a bug in IE8/9 that throws an error + // whenever `document.activeElement` is accessed on an iframe + // So, we allow :focus to pass through QSA all the time to avoid the IE error + // See https://bugs.jquery.com/ticket/13378 + rbuggyQSA = []; + + if ( ( support.qsa = rnative.test( document.querySelectorAll ) ) ) { + + // Build QSA regex + // Regex strategy adopted from Diego Perini + assert( function( el ) { + + var input; + + // Select is set to empty string on purpose + // This is to test IE's treatment of not explicitly + // setting a boolean content attribute, + // since its presence should be enough + // https://bugs.jquery.com/ticket/12359 + docElem.appendChild( el ).innerHTML = "" + + ""; + + // Support: IE8, Opera 11-12.16 + // Nothing should be selected when empty strings follow ^= or $= or *= + // The test attribute must be unknown in Opera but "safe" for WinRT + // https://msdn.microsoft.com/en-us/library/ie/hh465388.aspx#attribute_section + if ( el.querySelectorAll( "[msallowcapture^='']" ).length ) { + rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" ); + } + + // Support: IE8 + // Boolean attributes and "value" are not treated correctly + if ( !el.querySelectorAll( "[selected]" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" ); + } + + // Support: Chrome<29, Android<4.4, Safari<7.0+, iOS<7.0+, PhantomJS<1.9.8+ + if ( !el.querySelectorAll( "[id~=" + expando + "-]" ).length ) { + rbuggyQSA.push( "~=" ); + } + + // Support: IE 11+, Edge 15 - 18+ + // IE 11/Edge don't find elements on a `[name='']` query in some cases. + // Adding a temporary attribute to the document before the selection works + // around the issue. + // Interestingly, IE 10 & older don't seem to have the issue. + input = document.createElement( "input" ); + input.setAttribute( "name", "" ); + el.appendChild( input ); + if ( !el.querySelectorAll( "[name='']" ).length ) { + rbuggyQSA.push( "\\[" + whitespace + "*name" + whitespace + "*=" + + whitespace + "*(?:''|\"\")" ); + } + + // Webkit/Opera - :checked should return selected option elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + // IE8 throws error here and will not see later tests + if ( !el.querySelectorAll( ":checked" ).length ) { + rbuggyQSA.push( ":checked" ); + } + + // Support: Safari 8+, iOS 8+ + // https://bugs.webkit.org/show_bug.cgi?id=136851 + // In-page `selector#id sibling-combinator selector` fails + if ( !el.querySelectorAll( "a#" + expando + "+*" ).length ) { + rbuggyQSA.push( ".#.+[+~]" ); + } + + // Support: Firefox <=3.6 - 5 only + // Old Firefox doesn't throw on a badly-escaped identifier. + el.querySelectorAll( "\\\f" ); + rbuggyQSA.push( "[\\r\\n\\f]" ); + } ); + + assert( function( el ) { + el.innerHTML = "" + + ""; + + // Support: Windows 8 Native Apps + // The type and name attributes are restricted during .innerHTML assignment + var input = document.createElement( "input" ); + input.setAttribute( "type", "hidden" ); + el.appendChild( input ).setAttribute( "name", "D" ); + + // Support: IE8 + // Enforce case-sensitivity of name attribute + if ( el.querySelectorAll( "[name=d]" ).length ) { + rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" ); + } + + // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled) + // IE8 throws error here and will not see later tests + if ( el.querySelectorAll( ":enabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: IE9-11+ + // IE's :disabled selector does not pick up the children of disabled fieldsets + docElem.appendChild( el ).disabled = true; + if ( el.querySelectorAll( ":disabled" ).length !== 2 ) { + rbuggyQSA.push( ":enabled", ":disabled" ); + } + + // Support: Opera 10 - 11 only + // Opera 10-11 does not throw on post-comma invalid pseudos + el.querySelectorAll( "*,:x" ); + rbuggyQSA.push( ",.*:" ); + } ); + } + + if ( ( support.matchesSelector = rnative.test( ( matches = docElem.matches || + docElem.webkitMatchesSelector || + docElem.mozMatchesSelector || + docElem.oMatchesSelector || + docElem.msMatchesSelector ) ) ) ) { + + assert( function( el ) { + + // Check to see if it's possible to do matchesSelector + // on a disconnected node (IE 9) + support.disconnectedMatch = matches.call( el, "*" ); + + // This should fail with an exception + // Gecko does not error, returns false instead + matches.call( el, "[s!='']:x" ); + rbuggyMatches.push( "!=", pseudos ); + } ); + } + + rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join( "|" ) ); + rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join( "|" ) ); + + /* Contains + ---------------------------------------------------------------------- */ + hasCompare = rnative.test( docElem.compareDocumentPosition ); + + // Element contains another + // Purposefully self-exclusive + // As in, an element does not contain itself + contains = hasCompare || rnative.test( docElem.contains ) ? + function( a, b ) { + var adown = a.nodeType === 9 ? a.documentElement : a, + bup = b && b.parentNode; + return a === bup || !!( bup && bup.nodeType === 1 && ( + adown.contains ? + adown.contains( bup ) : + a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16 + ) ); + } : + function( a, b ) { + if ( b ) { + while ( ( b = b.parentNode ) ) { + if ( b === a ) { + return true; + } + } + } + return false; + }; + + /* Sorting + ---------------------------------------------------------------------- */ + + // Document order sorting + sortOrder = hasCompare ? + function( a, b ) { + + // Flag for duplicate removal + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + // Sort on method existence if only one input has compareDocumentPosition + var compare = !a.compareDocumentPosition - !b.compareDocumentPosition; + if ( compare ) { + return compare; + } + + // Calculate position if both inputs belong to the same document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + compare = ( a.ownerDocument || a ) == ( b.ownerDocument || b ) ? + a.compareDocumentPosition( b ) : + + // Otherwise we know they are disconnected + 1; + + // Disconnected nodes + if ( compare & 1 || + ( !support.sortDetached && b.compareDocumentPosition( a ) === compare ) ) { + + // Choose the first element that is related to our preferred document + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( a == document || a.ownerDocument == preferredDoc && + contains( preferredDoc, a ) ) { + return -1; + } + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( b == document || b.ownerDocument == preferredDoc && + contains( preferredDoc, b ) ) { + return 1; + } + + // Maintain original order + return sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + } + + return compare & 4 ? -1 : 1; + } : + function( a, b ) { + + // Exit early if the nodes are identical + if ( a === b ) { + hasDuplicate = true; + return 0; + } + + var cur, + i = 0, + aup = a.parentNode, + bup = b.parentNode, + ap = [ a ], + bp = [ b ]; + + // Parentless nodes are either documents or disconnected + if ( !aup || !bup ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + return a == document ? -1 : + b == document ? 1 : + /* eslint-enable eqeqeq */ + aup ? -1 : + bup ? 1 : + sortInput ? + ( indexOf( sortInput, a ) - indexOf( sortInput, b ) ) : + 0; + + // If the nodes are siblings, we can do a quick check + } else if ( aup === bup ) { + return siblingCheck( a, b ); + } + + // Otherwise we need full lists of their ancestors for comparison + cur = a; + while ( ( cur = cur.parentNode ) ) { + ap.unshift( cur ); + } + cur = b; + while ( ( cur = cur.parentNode ) ) { + bp.unshift( cur ); + } + + // Walk down the tree looking for a discrepancy + while ( ap[ i ] === bp[ i ] ) { + i++; + } + + return i ? + + // Do a sibling check if the nodes have a common ancestor + siblingCheck( ap[ i ], bp[ i ] ) : + + // Otherwise nodes in our document sort first + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + /* eslint-disable eqeqeq */ + ap[ i ] == preferredDoc ? -1 : + bp[ i ] == preferredDoc ? 1 : + /* eslint-enable eqeqeq */ + 0; + }; + + return document; +}; + +Sizzle.matches = function( expr, elements ) { + return Sizzle( expr, null, null, elements ); +}; + +Sizzle.matchesSelector = function( elem, expr ) { + setDocument( elem ); + + if ( support.matchesSelector && documentIsHTML && + !nonnativeSelectorCache[ expr + " " ] && + ( !rbuggyMatches || !rbuggyMatches.test( expr ) ) && + ( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) { + + try { + var ret = matches.call( elem, expr ); + + // IE 9's matchesSelector returns false on disconnected nodes + if ( ret || support.disconnectedMatch || + + // As well, disconnected nodes are said to be in a document + // fragment in IE 9 + elem.document && elem.document.nodeType !== 11 ) { + return ret; + } + } catch ( e ) { + nonnativeSelectorCache( expr, true ); + } + } + + return Sizzle( expr, document, null, [ elem ] ).length > 0; +}; + +Sizzle.contains = function( context, elem ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( context.ownerDocument || context ) != document ) { + setDocument( context ); + } + return contains( context, elem ); +}; + +Sizzle.attr = function( elem, name ) { + + // Set document vars if needed + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( ( elem.ownerDocument || elem ) != document ) { + setDocument( elem ); + } + + var fn = Expr.attrHandle[ name.toLowerCase() ], + + // Don't get fooled by Object.prototype properties (jQuery #13807) + val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ? + fn( elem, name, !documentIsHTML ) : + undefined; + + return val !== undefined ? + val : + support.attributes || !documentIsHTML ? + elem.getAttribute( name ) : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; +}; + +Sizzle.escape = function( sel ) { + return ( sel + "" ).replace( rcssescape, fcssescape ); +}; + +Sizzle.error = function( msg ) { + throw new Error( "Syntax error, unrecognized expression: " + msg ); +}; + +/** + * Document sorting and removing duplicates + * @param {ArrayLike} results + */ +Sizzle.uniqueSort = function( results ) { + var elem, + duplicates = [], + j = 0, + i = 0; + + // Unless we *know* we can detect duplicates, assume their presence + hasDuplicate = !support.detectDuplicates; + sortInput = !support.sortStable && results.slice( 0 ); + results.sort( sortOrder ); + + if ( hasDuplicate ) { + while ( ( elem = results[ i++ ] ) ) { + if ( elem === results[ i ] ) { + j = duplicates.push( i ); + } + } + while ( j-- ) { + results.splice( duplicates[ j ], 1 ); + } + } + + // Clear input after sorting to release objects + // See https://github.com/jquery/sizzle/pull/225 + sortInput = null; + + return results; +}; + +/** + * Utility function for retrieving the text value of an array of DOM nodes + * @param {Array|Element} elem + */ +getText = Sizzle.getText = function( elem ) { + var node, + ret = "", + i = 0, + nodeType = elem.nodeType; + + if ( !nodeType ) { + + // If no nodeType, this is expected to be an array + while ( ( node = elem[ i++ ] ) ) { + + // Do not traverse comment nodes + ret += getText( node ); + } + } else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) { + + // Use textContent for elements + // innerText usage removed for consistency of new lines (jQuery #11153) + if ( typeof elem.textContent === "string" ) { + return elem.textContent; + } else { + + // Traverse its children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + ret += getText( elem ); + } + } + } else if ( nodeType === 3 || nodeType === 4 ) { + return elem.nodeValue; + } + + // Do not include comment or processing instruction nodes + + return ret; +}; + +Expr = Sizzle.selectors = { + + // Can be adjusted by the user + cacheLength: 50, + + createPseudo: markFunction, + + match: matchExpr, + + attrHandle: {}, + + find: {}, + + relative: { + ">": { dir: "parentNode", first: true }, + " ": { dir: "parentNode" }, + "+": { dir: "previousSibling", first: true }, + "~": { dir: "previousSibling" } + }, + + preFilter: { + "ATTR": function( match ) { + match[ 1 ] = match[ 1 ].replace( runescape, funescape ); + + // Move the given value to match[3] whether quoted or unquoted + match[ 3 ] = ( match[ 3 ] || match[ 4 ] || + match[ 5 ] || "" ).replace( runescape, funescape ); + + if ( match[ 2 ] === "~=" ) { + match[ 3 ] = " " + match[ 3 ] + " "; + } + + return match.slice( 0, 4 ); + }, + + "CHILD": function( match ) { + + /* matches from matchExpr["CHILD"] + 1 type (only|nth|...) + 2 what (child|of-type) + 3 argument (even|odd|\d*|\d*n([+-]\d+)?|...) + 4 xn-component of xn+y argument ([+-]?\d*n|) + 5 sign of xn-component + 6 x of xn-component + 7 sign of y-component + 8 y of y-component + */ + match[ 1 ] = match[ 1 ].toLowerCase(); + + if ( match[ 1 ].slice( 0, 3 ) === "nth" ) { + + // nth-* requires argument + if ( !match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + // numeric x and y parameters for Expr.filter.CHILD + // remember that false/true cast respectively to 0/1 + match[ 4 ] = +( match[ 4 ] ? + match[ 5 ] + ( match[ 6 ] || 1 ) : + 2 * ( match[ 3 ] === "even" || match[ 3 ] === "odd" ) ); + match[ 5 ] = +( ( match[ 7 ] + match[ 8 ] ) || match[ 3 ] === "odd" ); + + // other types prohibit arguments + } else if ( match[ 3 ] ) { + Sizzle.error( match[ 0 ] ); + } + + return match; + }, + + "PSEUDO": function( match ) { + var excess, + unquoted = !match[ 6 ] && match[ 2 ]; + + if ( matchExpr[ "CHILD" ].test( match[ 0 ] ) ) { + return null; + } + + // Accept quoted arguments as-is + if ( match[ 3 ] ) { + match[ 2 ] = match[ 4 ] || match[ 5 ] || ""; + + // Strip excess characters from unquoted arguments + } else if ( unquoted && rpseudo.test( unquoted ) && + + // Get excess from tokenize (recursively) + ( excess = tokenize( unquoted, true ) ) && + + // advance to the next closing parenthesis + ( excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length ) ) { + + // excess is a negative index + match[ 0 ] = match[ 0 ].slice( 0, excess ); + match[ 2 ] = unquoted.slice( 0, excess ); + } + + // Return only captures needed by the pseudo filter method (type and argument) + return match.slice( 0, 3 ); + } + }, + + filter: { + + "TAG": function( nodeNameSelector ) { + var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase(); + return nodeNameSelector === "*" ? + function() { + return true; + } : + function( elem ) { + return elem.nodeName && elem.nodeName.toLowerCase() === nodeName; + }; + }, + + "CLASS": function( className ) { + var pattern = classCache[ className + " " ]; + + return pattern || + ( pattern = new RegExp( "(^|" + whitespace + + ")" + className + "(" + whitespace + "|$)" ) ) && classCache( + className, function( elem ) { + return pattern.test( + typeof elem.className === "string" && elem.className || + typeof elem.getAttribute !== "undefined" && + elem.getAttribute( "class" ) || + "" + ); + } ); + }, + + "ATTR": function( name, operator, check ) { + return function( elem ) { + var result = Sizzle.attr( elem, name ); + + if ( result == null ) { + return operator === "!="; + } + if ( !operator ) { + return true; + } + + result += ""; + + /* eslint-disable max-len */ + + return operator === "=" ? result === check : + operator === "!=" ? result !== check : + operator === "^=" ? check && result.indexOf( check ) === 0 : + operator === "*=" ? check && result.indexOf( check ) > -1 : + operator === "$=" ? check && result.slice( -check.length ) === check : + operator === "~=" ? ( " " + result.replace( rwhitespace, " " ) + " " ).indexOf( check ) > -1 : + operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" : + false; + /* eslint-enable max-len */ + + }; + }, + + "CHILD": function( type, what, _argument, first, last ) { + var simple = type.slice( 0, 3 ) !== "nth", + forward = type.slice( -4 ) !== "last", + ofType = what === "of-type"; + + return first === 1 && last === 0 ? + + // Shortcut for :nth-*(n) + function( elem ) { + return !!elem.parentNode; + } : + + function( elem, _context, xml ) { + var cache, uniqueCache, outerCache, node, nodeIndex, start, + dir = simple !== forward ? "nextSibling" : "previousSibling", + parent = elem.parentNode, + name = ofType && elem.nodeName.toLowerCase(), + useCache = !xml && !ofType, + diff = false; + + if ( parent ) { + + // :(first|last|only)-(child|of-type) + if ( simple ) { + while ( dir ) { + node = elem; + while ( ( node = node[ dir ] ) ) { + if ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) { + + return false; + } + } + + // Reverse direction for :only-* (if we haven't yet done so) + start = dir = type === "only" && !start && "nextSibling"; + } + return true; + } + + start = [ forward ? parent.firstChild : parent.lastChild ]; + + // non-xml :nth-child(...) stores cache data on `parent` + if ( forward && useCache ) { + + // Seek `elem` from a previously-cached index + + // ...in a gzip-friendly way + node = parent; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex && cache[ 2 ]; + node = nodeIndex && parent.childNodes[ nodeIndex ]; + + while ( ( node = ++nodeIndex && node && node[ dir ] || + + // Fallback to seeking `elem` from the start + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + // When found, cache indexes on `parent` and break + if ( node.nodeType === 1 && ++diff && node === elem ) { + uniqueCache[ type ] = [ dirruns, nodeIndex, diff ]; + break; + } + } + + } else { + + // Use previously-cached element index if available + if ( useCache ) { + + // ...in a gzip-friendly way + node = elem; + outerCache = node[ expando ] || ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + cache = uniqueCache[ type ] || []; + nodeIndex = cache[ 0 ] === dirruns && cache[ 1 ]; + diff = nodeIndex; + } + + // xml :nth-child(...) + // or :nth-last-child(...) or :nth(-last)?-of-type(...) + if ( diff === false ) { + + // Use the same loop as above to seek `elem` from the start + while ( ( node = ++nodeIndex && node && node[ dir ] || + ( diff = nodeIndex = 0 ) || start.pop() ) ) { + + if ( ( ofType ? + node.nodeName.toLowerCase() === name : + node.nodeType === 1 ) && + ++diff ) { + + // Cache the index of each encountered element + if ( useCache ) { + outerCache = node[ expando ] || + ( node[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ node.uniqueID ] || + ( outerCache[ node.uniqueID ] = {} ); + + uniqueCache[ type ] = [ dirruns, diff ]; + } + + if ( node === elem ) { + break; + } + } + } + } + } + + // Incorporate the offset, then check against cycle size + diff -= last; + return diff === first || ( diff % first === 0 && diff / first >= 0 ); + } + }; + }, + + "PSEUDO": function( pseudo, argument ) { + + // pseudo-class names are case-insensitive + // http://www.w3.org/TR/selectors/#pseudo-classes + // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters + // Remember that setFilters inherits from pseudos + var args, + fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] || + Sizzle.error( "unsupported pseudo: " + pseudo ); + + // The user may use createPseudo to indicate that + // arguments are needed to create the filter function + // just as Sizzle does + if ( fn[ expando ] ) { + return fn( argument ); + } + + // But maintain support for old signatures + if ( fn.length > 1 ) { + args = [ pseudo, pseudo, "", argument ]; + return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ? + markFunction( function( seed, matches ) { + var idx, + matched = fn( seed, argument ), + i = matched.length; + while ( i-- ) { + idx = indexOf( seed, matched[ i ] ); + seed[ idx ] = !( matches[ idx ] = matched[ i ] ); + } + } ) : + function( elem ) { + return fn( elem, 0, args ); + }; + } + + return fn; + } + }, + + pseudos: { + + // Potentially complex pseudos + "not": markFunction( function( selector ) { + + // Trim the selector passed to compile + // to avoid treating leading and trailing + // spaces as combinators + var input = [], + results = [], + matcher = compile( selector.replace( rtrim, "$1" ) ); + + return matcher[ expando ] ? + markFunction( function( seed, matches, _context, xml ) { + var elem, + unmatched = matcher( seed, null, xml, [] ), + i = seed.length; + + // Match elements unmatched by `matcher` + while ( i-- ) { + if ( ( elem = unmatched[ i ] ) ) { + seed[ i ] = !( matches[ i ] = elem ); + } + } + } ) : + function( elem, _context, xml ) { + input[ 0 ] = elem; + matcher( input, null, xml, results ); + + // Don't keep the element (issue #299) + input[ 0 ] = null; + return !results.pop(); + }; + } ), + + "has": markFunction( function( selector ) { + return function( elem ) { + return Sizzle( selector, elem ).length > 0; + }; + } ), + + "contains": markFunction( function( text ) { + text = text.replace( runescape, funescape ); + return function( elem ) { + return ( elem.textContent || getText( elem ) ).indexOf( text ) > -1; + }; + } ), + + // "Whether an element is represented by a :lang() selector + // is based solely on the element's language value + // being equal to the identifier C, + // or beginning with the identifier C immediately followed by "-". + // The matching of C against the element's language value is performed case-insensitively. + // The identifier C does not have to be a valid language name." + // http://www.w3.org/TR/selectors/#lang-pseudo + "lang": markFunction( function( lang ) { + + // lang value must be a valid identifier + if ( !ridentifier.test( lang || "" ) ) { + Sizzle.error( "unsupported lang: " + lang ); + } + lang = lang.replace( runescape, funescape ).toLowerCase(); + return function( elem ) { + var elemLang; + do { + if ( ( elemLang = documentIsHTML ? + elem.lang : + elem.getAttribute( "xml:lang" ) || elem.getAttribute( "lang" ) ) ) { + + elemLang = elemLang.toLowerCase(); + return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0; + } + } while ( ( elem = elem.parentNode ) && elem.nodeType === 1 ); + return false; + }; + } ), + + // Miscellaneous + "target": function( elem ) { + var hash = window.location && window.location.hash; + return hash && hash.slice( 1 ) === elem.id; + }, + + "root": function( elem ) { + return elem === docElem; + }, + + "focus": function( elem ) { + return elem === document.activeElement && + ( !document.hasFocus || document.hasFocus() ) && + !!( elem.type || elem.href || ~elem.tabIndex ); + }, + + // Boolean properties + "enabled": createDisabledPseudo( false ), + "disabled": createDisabledPseudo( true ), + + "checked": function( elem ) { + + // In CSS3, :checked should return both checked and selected elements + // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked + var nodeName = elem.nodeName.toLowerCase(); + return ( nodeName === "input" && !!elem.checked ) || + ( nodeName === "option" && !!elem.selected ); + }, + + "selected": function( elem ) { + + // Accessing this property makes selected-by-default + // options in Safari work properly + if ( elem.parentNode ) { + // eslint-disable-next-line no-unused-expressions + elem.parentNode.selectedIndex; + } + + return elem.selected === true; + }, + + // Contents + "empty": function( elem ) { + + // http://www.w3.org/TR/selectors/#empty-pseudo + // :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5), + // but not by others (comment: 8; processing instruction: 7; etc.) + // nodeType < 6 works because attributes (2) do not appear as children + for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) { + if ( elem.nodeType < 6 ) { + return false; + } + } + return true; + }, + + "parent": function( elem ) { + return !Expr.pseudos[ "empty" ]( elem ); + }, + + // Element/input types + "header": function( elem ) { + return rheader.test( elem.nodeName ); + }, + + "input": function( elem ) { + return rinputs.test( elem.nodeName ); + }, + + "button": function( elem ) { + var name = elem.nodeName.toLowerCase(); + return name === "input" && elem.type === "button" || name === "button"; + }, + + "text": function( elem ) { + var attr; + return elem.nodeName.toLowerCase() === "input" && + elem.type === "text" && + + // Support: IE<8 + // New HTML5 attribute values (e.g., "search") appear with elem.type === "text" + ( ( attr = elem.getAttribute( "type" ) ) == null || + attr.toLowerCase() === "text" ); + }, + + // Position-in-collection + "first": createPositionalPseudo( function() { + return [ 0 ]; + } ), + + "last": createPositionalPseudo( function( _matchIndexes, length ) { + return [ length - 1 ]; + } ), + + "eq": createPositionalPseudo( function( _matchIndexes, length, argument ) { + return [ argument < 0 ? argument + length : argument ]; + } ), + + "even": createPositionalPseudo( function( matchIndexes, length ) { + var i = 0; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "odd": createPositionalPseudo( function( matchIndexes, length ) { + var i = 1; + for ( ; i < length; i += 2 ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "lt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? + argument + length : + argument > length ? + length : + argument; + for ( ; --i >= 0; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ), + + "gt": createPositionalPseudo( function( matchIndexes, length, argument ) { + var i = argument < 0 ? argument + length : argument; + for ( ; ++i < length; ) { + matchIndexes.push( i ); + } + return matchIndexes; + } ) + } +}; + +Expr.pseudos[ "nth" ] = Expr.pseudos[ "eq" ]; + +// Add button/input type pseudos +for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) { + Expr.pseudos[ i ] = createInputPseudo( i ); +} +for ( i in { submit: true, reset: true } ) { + Expr.pseudos[ i ] = createButtonPseudo( i ); +} + +// Easy API for creating new setFilters +function setFilters() {} +setFilters.prototype = Expr.filters = Expr.pseudos; +Expr.setFilters = new setFilters(); + +tokenize = Sizzle.tokenize = function( selector, parseOnly ) { + var matched, match, tokens, type, + soFar, groups, preFilters, + cached = tokenCache[ selector + " " ]; + + if ( cached ) { + return parseOnly ? 0 : cached.slice( 0 ); + } + + soFar = selector; + groups = []; + preFilters = Expr.preFilter; + + while ( soFar ) { + + // Comma and first run + if ( !matched || ( match = rcomma.exec( soFar ) ) ) { + if ( match ) { + + // Don't consume trailing commas as valid + soFar = soFar.slice( match[ 0 ].length ) || soFar; + } + groups.push( ( tokens = [] ) ); + } + + matched = false; + + // Combinators + if ( ( match = rcombinators.exec( soFar ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + + // Cast descendant combinators to space + type: match[ 0 ].replace( rtrim, " " ) + } ); + soFar = soFar.slice( matched.length ); + } + + // Filters + for ( type in Expr.filter ) { + if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] || + ( match = preFilters[ type ]( match ) ) ) ) { + matched = match.shift(); + tokens.push( { + value: matched, + type: type, + matches: match + } ); + soFar = soFar.slice( matched.length ); + } + } + + if ( !matched ) { + break; + } + } + + // Return the length of the invalid excess + // if we're just parsing + // Otherwise, throw an error or return tokens + return parseOnly ? + soFar.length : + soFar ? + Sizzle.error( selector ) : + + // Cache the tokens + tokenCache( selector, groups ).slice( 0 ); +}; + +function toSelector( tokens ) { + var i = 0, + len = tokens.length, + selector = ""; + for ( ; i < len; i++ ) { + selector += tokens[ i ].value; + } + return selector; +} + +function addCombinator( matcher, combinator, base ) { + var dir = combinator.dir, + skip = combinator.next, + key = skip || dir, + checkNonElements = base && key === "parentNode", + doneName = done++; + + return combinator.first ? + + // Check against closest ancestor/preceding element + function( elem, context, xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + return matcher( elem, context, xml ); + } + } + return false; + } : + + // Check against all ancestor/preceding elements + function( elem, context, xml ) { + var oldCache, uniqueCache, outerCache, + newCache = [ dirruns, doneName ]; + + // We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching + if ( xml ) { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + if ( matcher( elem, context, xml ) ) { + return true; + } + } + } + } else { + while ( ( elem = elem[ dir ] ) ) { + if ( elem.nodeType === 1 || checkNonElements ) { + outerCache = elem[ expando ] || ( elem[ expando ] = {} ); + + // Support: IE <9 only + // Defend against cloned attroperties (jQuery gh-1709) + uniqueCache = outerCache[ elem.uniqueID ] || + ( outerCache[ elem.uniqueID ] = {} ); + + if ( skip && skip === elem.nodeName.toLowerCase() ) { + elem = elem[ dir ] || elem; + } else if ( ( oldCache = uniqueCache[ key ] ) && + oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) { + + // Assign to newCache so results back-propagate to previous elements + return ( newCache[ 2 ] = oldCache[ 2 ] ); + } else { + + // Reuse newcache so results back-propagate to previous elements + uniqueCache[ key ] = newCache; + + // A match means we're done; a fail means we have to keep checking + if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) { + return true; + } + } + } + } + } + return false; + }; +} + +function elementMatcher( matchers ) { + return matchers.length > 1 ? + function( elem, context, xml ) { + var i = matchers.length; + while ( i-- ) { + if ( !matchers[ i ]( elem, context, xml ) ) { + return false; + } + } + return true; + } : + matchers[ 0 ]; +} + +function multipleContexts( selector, contexts, results ) { + var i = 0, + len = contexts.length; + for ( ; i < len; i++ ) { + Sizzle( selector, contexts[ i ], results ); + } + return results; +} + +function condense( unmatched, map, filter, context, xml ) { + var elem, + newUnmatched = [], + i = 0, + len = unmatched.length, + mapped = map != null; + + for ( ; i < len; i++ ) { + if ( ( elem = unmatched[ i ] ) ) { + if ( !filter || filter( elem, context, xml ) ) { + newUnmatched.push( elem ); + if ( mapped ) { + map.push( i ); + } + } + } + } + + return newUnmatched; +} + +function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) { + if ( postFilter && !postFilter[ expando ] ) { + postFilter = setMatcher( postFilter ); + } + if ( postFinder && !postFinder[ expando ] ) { + postFinder = setMatcher( postFinder, postSelector ); + } + return markFunction( function( seed, results, context, xml ) { + var temp, i, elem, + preMap = [], + postMap = [], + preexisting = results.length, + + // Get initial elements from seed or context + elems = seed || multipleContexts( + selector || "*", + context.nodeType ? [ context ] : context, + [] + ), + + // Prefilter to get matcher input, preserving a map for seed-results synchronization + matcherIn = preFilter && ( seed || !selector ) ? + condense( elems, preMap, preFilter, context, xml ) : + elems, + + matcherOut = matcher ? + + // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results, + postFinder || ( seed ? preFilter : preexisting || postFilter ) ? + + // ...intermediate processing is necessary + [] : + + // ...otherwise use results directly + results : + matcherIn; + + // Find primary matches + if ( matcher ) { + matcher( matcherIn, matcherOut, context, xml ); + } + + // Apply postFilter + if ( postFilter ) { + temp = condense( matcherOut, postMap ); + postFilter( temp, [], context, xml ); + + // Un-match failing elements by moving them back to matcherIn + i = temp.length; + while ( i-- ) { + if ( ( elem = temp[ i ] ) ) { + matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem ); + } + } + } + + if ( seed ) { + if ( postFinder || preFilter ) { + if ( postFinder ) { + + // Get the final matcherOut by condensing this intermediate into postFinder contexts + temp = []; + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) ) { + + // Restore matcherIn since elem is not yet a final match + temp.push( ( matcherIn[ i ] = elem ) ); + } + } + postFinder( null, ( matcherOut = [] ), temp, xml ); + } + + // Move matched elements from seed to results to keep them synchronized + i = matcherOut.length; + while ( i-- ) { + if ( ( elem = matcherOut[ i ] ) && + ( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) { + + seed[ temp ] = !( results[ temp ] = elem ); + } + } + } + + // Add elements to results, through postFinder if defined + } else { + matcherOut = condense( + matcherOut === results ? + matcherOut.splice( preexisting, matcherOut.length ) : + matcherOut + ); + if ( postFinder ) { + postFinder( null, results, matcherOut, xml ); + } else { + push.apply( results, matcherOut ); + } + } + } ); +} + +function matcherFromTokens( tokens ) { + var checkContext, matcher, j, + len = tokens.length, + leadingRelative = Expr.relative[ tokens[ 0 ].type ], + implicitRelative = leadingRelative || Expr.relative[ " " ], + i = leadingRelative ? 1 : 0, + + // The foundational matcher ensures that elements are reachable from top-level context(s) + matchContext = addCombinator( function( elem ) { + return elem === checkContext; + }, implicitRelative, true ), + matchAnyContext = addCombinator( function( elem ) { + return indexOf( checkContext, elem ) > -1; + }, implicitRelative, true ), + matchers = [ function( elem, context, xml ) { + var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || ( + ( checkContext = context ).nodeType ? + matchContext( elem, context, xml ) : + matchAnyContext( elem, context, xml ) ); + + // Avoid hanging onto element (issue #299) + checkContext = null; + return ret; + } ]; + + for ( ; i < len; i++ ) { + if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) { + matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ]; + } else { + matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches ); + + // Return special upon seeing a positional matcher + if ( matcher[ expando ] ) { + + // Find the next relative operator (if any) for proper handling + j = ++i; + for ( ; j < len; j++ ) { + if ( Expr.relative[ tokens[ j ].type ] ) { + break; + } + } + return setMatcher( + i > 1 && elementMatcher( matchers ), + i > 1 && toSelector( + + // If the preceding token was a descendant combinator, insert an implicit any-element `*` + tokens + .slice( 0, i - 1 ) + .concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } ) + ).replace( rtrim, "$1" ), + matcher, + i < j && matcherFromTokens( tokens.slice( i, j ) ), + j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ), + j < len && toSelector( tokens ) + ); + } + matchers.push( matcher ); + } + } + + return elementMatcher( matchers ); +} + +function matcherFromGroupMatchers( elementMatchers, setMatchers ) { + var bySet = setMatchers.length > 0, + byElement = elementMatchers.length > 0, + superMatcher = function( seed, context, xml, results, outermost ) { + var elem, j, matcher, + matchedCount = 0, + i = "0", + unmatched = seed && [], + setMatched = [], + contextBackup = outermostContext, + + // We must always have either seed elements or outermost context + elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ), + + // Use integer dirruns iff this is the outermost matcher + dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ), + len = elems.length; + + if ( outermost ) { + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + outermostContext = context == document || context || outermost; + } + + // Add elements passing elementMatchers directly to results + // Support: IE<9, Safari + // Tolerate NodeList properties (IE: "length"; Safari: ) matching elements by id + for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) { + if ( byElement && elem ) { + j = 0; + + // Support: IE 11+, Edge 17 - 18+ + // IE/Edge sometimes throw a "Permission denied" error when strict-comparing + // two documents; shallow comparisons work. + // eslint-disable-next-line eqeqeq + if ( !context && elem.ownerDocument != document ) { + setDocument( elem ); + xml = !documentIsHTML; + } + while ( ( matcher = elementMatchers[ j++ ] ) ) { + if ( matcher( elem, context || document, xml ) ) { + results.push( elem ); + break; + } + } + if ( outermost ) { + dirruns = dirrunsUnique; + } + } + + // Track unmatched elements for set filters + if ( bySet ) { + + // They will have gone through all possible matchers + if ( ( elem = !matcher && elem ) ) { + matchedCount--; + } + + // Lengthen the array for every element, matched or not + if ( seed ) { + unmatched.push( elem ); + } + } + } + + // `i` is now the count of elements visited above, and adding it to `matchedCount` + // makes the latter nonnegative. + matchedCount += i; + + // Apply set filters to unmatched elements + // NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount` + // equals `i`), unless we didn't visit _any_ elements in the above loop because we have + // no element matchers and no seed. + // Incrementing an initially-string "0" `i` allows `i` to remain a string only in that + // case, which will result in a "00" `matchedCount` that differs from `i` but is also + // numerically zero. + if ( bySet && i !== matchedCount ) { + j = 0; + while ( ( matcher = setMatchers[ j++ ] ) ) { + matcher( unmatched, setMatched, context, xml ); + } + + if ( seed ) { + + // Reintegrate element matches to eliminate the need for sorting + if ( matchedCount > 0 ) { + while ( i-- ) { + if ( !( unmatched[ i ] || setMatched[ i ] ) ) { + setMatched[ i ] = pop.call( results ); + } + } + } + + // Discard index placeholder values to get only actual matches + setMatched = condense( setMatched ); + } + + // Add matches to results + push.apply( results, setMatched ); + + // Seedless set matches succeeding multiple successful matchers stipulate sorting + if ( outermost && !seed && setMatched.length > 0 && + ( matchedCount + setMatchers.length ) > 1 ) { + + Sizzle.uniqueSort( results ); + } + } + + // Override manipulation of globals by nested matchers + if ( outermost ) { + dirruns = dirrunsUnique; + outermostContext = contextBackup; + } + + return unmatched; + }; + + return bySet ? + markFunction( superMatcher ) : + superMatcher; +} + +compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) { + var i, + setMatchers = [], + elementMatchers = [], + cached = compilerCache[ selector + " " ]; + + if ( !cached ) { + + // Generate a function of recursive functions that can be used to check each element + if ( !match ) { + match = tokenize( selector ); + } + i = match.length; + while ( i-- ) { + cached = matcherFromTokens( match[ i ] ); + if ( cached[ expando ] ) { + setMatchers.push( cached ); + } else { + elementMatchers.push( cached ); + } + } + + // Cache the compiled function + cached = compilerCache( + selector, + matcherFromGroupMatchers( elementMatchers, setMatchers ) + ); + + // Save selector and tokenization + cached.selector = selector; + } + return cached; +}; + +/** + * A low-level selection function that works with Sizzle's compiled + * selector functions + * @param {String|Function} selector A selector or a pre-compiled + * selector function built with Sizzle.compile + * @param {Element} context + * @param {Array} [results] + * @param {Array} [seed] A set of elements to match against + */ +select = Sizzle.select = function( selector, context, results, seed ) { + var i, tokens, token, type, find, + compiled = typeof selector === "function" && selector, + match = !seed && tokenize( ( selector = compiled.selector || selector ) ); + + results = results || []; + + // Try to minimize operations if there is only one selector in the list and no seed + // (the latter of which guarantees us context) + if ( match.length === 1 ) { + + // Reduce context if the leading compound selector is an ID + tokens = match[ 0 ] = match[ 0 ].slice( 0 ); + if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" && + context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) { + + context = ( Expr.find[ "ID" ]( token.matches[ 0 ] + .replace( runescape, funescape ), context ) || [] )[ 0 ]; + if ( !context ) { + return results; + + // Precompiled matchers will still verify ancestry, so step up a level + } else if ( compiled ) { + context = context.parentNode; + } + + selector = selector.slice( tokens.shift().value.length ); + } + + // Fetch a seed set for right-to-left matching + i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length; + while ( i-- ) { + token = tokens[ i ]; + + // Abort if we hit a combinator + if ( Expr.relative[ ( type = token.type ) ] ) { + break; + } + if ( ( find = Expr.find[ type ] ) ) { + + // Search, expanding context for leading sibling combinators + if ( ( seed = find( + token.matches[ 0 ].replace( runescape, funescape ), + rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) || + context + ) ) ) { + + // If seed is empty or no tokens remain, we can return early + tokens.splice( i, 1 ); + selector = seed.length && toSelector( tokens ); + if ( !selector ) { + push.apply( results, seed ); + return results; + } + + break; + } + } + } + } + + // Compile and execute a filtering function if one is not provided + // Provide `match` to avoid retokenization if we modified the selector above + ( compiled || compile( selector, match ) )( + seed, + context, + !documentIsHTML, + results, + !context || rsibling.test( selector ) && testContext( context.parentNode ) || context + ); + return results; +}; + +// One-time assignments + +// Sort stability +support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando; + +// Support: Chrome 14-35+ +// Always assume duplicates if they aren't passed to the comparison function +support.detectDuplicates = !!hasDuplicate; + +// Initialize against the default document +setDocument(); + +// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27) +// Detached nodes confoundingly follow *each other* +support.sortDetached = assert( function( el ) { + + // Should return 1, but returns 4 (following) + return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1; +} ); + +// Support: IE<8 +// Prevent attribute/property "interpolation" +// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx +if ( !assert( function( el ) { + el.innerHTML = ""; + return el.firstChild.getAttribute( "href" ) === "#"; +} ) ) { + addHandle( "type|href|height|width", function( elem, name, isXML ) { + if ( !isXML ) { + return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 ); + } + } ); +} + +// Support: IE<9 +// Use defaultValue in place of getAttribute("value") +if ( !support.attributes || !assert( function( el ) { + el.innerHTML = ""; + el.firstChild.setAttribute( "value", "" ); + return el.firstChild.getAttribute( "value" ) === ""; +} ) ) { + addHandle( "value", function( elem, _name, isXML ) { + if ( !isXML && elem.nodeName.toLowerCase() === "input" ) { + return elem.defaultValue; + } + } ); +} + +// Support: IE<9 +// Use getAttributeNode to fetch booleans when getAttribute lies +if ( !assert( function( el ) { + return el.getAttribute( "disabled" ) == null; +} ) ) { + addHandle( booleans, function( elem, name, isXML ) { + var val; + if ( !isXML ) { + return elem[ name ] === true ? name.toLowerCase() : + ( val = elem.getAttributeNode( name ) ) && val.specified ? + val.value : + null; + } + } ); +} + +return Sizzle; + +} )( window ); + + + +jQuery.find = Sizzle; +jQuery.expr = Sizzle.selectors; + +// Deprecated +jQuery.expr[ ":" ] = jQuery.expr.pseudos; +jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort; +jQuery.text = Sizzle.getText; +jQuery.isXMLDoc = Sizzle.isXML; +jQuery.contains = Sizzle.contains; +jQuery.escapeSelector = Sizzle.escape; + + + + +var dir = function( elem, dir, until ) { + var matched = [], + truncate = until !== undefined; + + while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) { + if ( elem.nodeType === 1 ) { + if ( truncate && jQuery( elem ).is( until ) ) { + break; + } + matched.push( elem ); + } + } + return matched; +}; + + +var siblings = function( n, elem ) { + var matched = []; + + for ( ; n; n = n.nextSibling ) { + if ( n.nodeType === 1 && n !== elem ) { + matched.push( n ); + } + } + + return matched; +}; + + +var rneedsContext = jQuery.expr.match.needsContext; + + + +function nodeName( elem, name ) { + + return elem.nodeName && elem.nodeName.toLowerCase() === name.toLowerCase(); + +} +var rsingleTag = ( /^<([a-z][^\/\0>:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i ); + + + +// Implement the identical functionality for filter and not +function winnow( elements, qualifier, not ) { + if ( isFunction( qualifier ) ) { + return jQuery.grep( elements, function( elem, i ) { + return !!qualifier.call( elem, i, elem ) !== not; + } ); + } + + // Single element + if ( qualifier.nodeType ) { + return jQuery.grep( elements, function( elem ) { + return ( elem === qualifier ) !== not; + } ); + } + + // Arraylike of elements (jQuery, arguments, Array) + if ( typeof qualifier !== "string" ) { + return jQuery.grep( elements, function( elem ) { + return ( indexOf.call( qualifier, elem ) > -1 ) !== not; + } ); + } + + // Filtered directly for both simple and complex selectors + return jQuery.filter( qualifier, elements, not ); +} + +jQuery.filter = function( expr, elems, not ) { + var elem = elems[ 0 ]; + + if ( not ) { + expr = ":not(" + expr + ")"; + } + + if ( elems.length === 1 && elem.nodeType === 1 ) { + return jQuery.find.matchesSelector( elem, expr ) ? [ elem ] : []; + } + + return jQuery.find.matches( expr, jQuery.grep( elems, function( elem ) { + return elem.nodeType === 1; + } ) ); +}; + +jQuery.fn.extend( { + find: function( selector ) { + var i, ret, + len = this.length, + self = this; + + if ( typeof selector !== "string" ) { + return this.pushStack( jQuery( selector ).filter( function() { + for ( i = 0; i < len; i++ ) { + if ( jQuery.contains( self[ i ], this ) ) { + return true; + } + } + } ) ); + } + + ret = this.pushStack( [] ); + + for ( i = 0; i < len; i++ ) { + jQuery.find( selector, self[ i ], ret ); + } + + return len > 1 ? jQuery.uniqueSort( ret ) : ret; + }, + filter: function( selector ) { + return this.pushStack( winnow( this, selector || [], false ) ); + }, + not: function( selector ) { + return this.pushStack( winnow( this, selector || [], true ) ); + }, + is: function( selector ) { + return !!winnow( + this, + + // If this is a positional/relative selector, check membership in the returned set + // so $("p:first").is("p:last") won't return true for a doc with two "p". + typeof selector === "string" && rneedsContext.test( selector ) ? + jQuery( selector ) : + selector || [], + false + ).length; + } +} ); + + +// Initialize a jQuery object + + +// A central reference to the root jQuery(document) +var rootjQuery, + + // A simple way to check for HTML strings + // Prioritize #id over to avoid XSS via location.hash (#9521) + // Strict HTML recognition (#11290: must start with <) + // Shortcut simple #id case for speed + rquickExpr = /^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]+))$/, + + init = jQuery.fn.init = function( selector, context, root ) { + var match, elem; + + // HANDLE: $(""), $(null), $(undefined), $(false) + if ( !selector ) { + return this; + } + + // Method init() accepts an alternate rootjQuery + // so migrate can support jQuery.sub (gh-2101) + root = root || rootjQuery; + + // Handle HTML strings + if ( typeof selector === "string" ) { + if ( selector[ 0 ] === "<" && + selector[ selector.length - 1 ] === ">" && + selector.length >= 3 ) { + + // Assume that strings that start and end with <> are HTML and skip the regex check + match = [ null, selector, null ]; + + } else { + match = rquickExpr.exec( selector ); + } + + // Match html or make sure no context is specified for #id + if ( match && ( match[ 1 ] || !context ) ) { + + // HANDLE: $(html) -> $(array) + if ( match[ 1 ] ) { + context = context instanceof jQuery ? context[ 0 ] : context; + + // Option to run scripts is true for back-compat + // Intentionally let the error be thrown if parseHTML is not present + jQuery.merge( this, jQuery.parseHTML( + match[ 1 ], + context && context.nodeType ? context.ownerDocument || context : document, + true + ) ); + + // HANDLE: $(html, props) + if ( rsingleTag.test( match[ 1 ] ) && jQuery.isPlainObject( context ) ) { + for ( match in context ) { + + // Properties of context are called as methods if possible + if ( isFunction( this[ match ] ) ) { + this[ match ]( context[ match ] ); + + // ...and otherwise set as attributes + } else { + this.attr( match, context[ match ] ); + } + } + } + + return this; + + // HANDLE: $(#id) + } else { + elem = document.getElementById( match[ 2 ] ); + + if ( elem ) { + + // Inject the element directly into the jQuery object + this[ 0 ] = elem; + this.length = 1; + } + return this; + } + + // HANDLE: $(expr, $(...)) + } else if ( !context || context.jquery ) { + return ( context || root ).find( selector ); + + // HANDLE: $(expr, context) + // (which is just equivalent to: $(context).find(expr) + } else { + return this.constructor( context ).find( selector ); + } + + // HANDLE: $(DOMElement) + } else if ( selector.nodeType ) { + this[ 0 ] = selector; + this.length = 1; + return this; + + // HANDLE: $(function) + // Shortcut for document ready + } else if ( isFunction( selector ) ) { + return root.ready !== undefined ? + root.ready( selector ) : + + // Execute immediately if ready is not present + selector( jQuery ); + } + + return jQuery.makeArray( selector, this ); + }; + +// Give the init function the jQuery prototype for later instantiation +init.prototype = jQuery.fn; + +// Initialize central reference +rootjQuery = jQuery( document ); + + +var rparentsprev = /^(?:parents|prev(?:Until|All))/, + + // Methods guaranteed to produce a unique set when starting from a unique set + guaranteedUnique = { + children: true, + contents: true, + next: true, + prev: true + }; + +jQuery.fn.extend( { + has: function( target ) { + var targets = jQuery( target, this ), + l = targets.length; + + return this.filter( function() { + var i = 0; + for ( ; i < l; i++ ) { + if ( jQuery.contains( this, targets[ i ] ) ) { + return true; + } + } + } ); + }, + + closest: function( selectors, context ) { + var cur, + i = 0, + l = this.length, + matched = [], + targets = typeof selectors !== "string" && jQuery( selectors ); + + // Positional selectors never match, since there's no _selection_ context + if ( !rneedsContext.test( selectors ) ) { + for ( ; i < l; i++ ) { + for ( cur = this[ i ]; cur && cur !== context; cur = cur.parentNode ) { + + // Always skip document fragments + if ( cur.nodeType < 11 && ( targets ? + targets.index( cur ) > -1 : + + // Don't pass non-elements to Sizzle + cur.nodeType === 1 && + jQuery.find.matchesSelector( cur, selectors ) ) ) { + + matched.push( cur ); + break; + } + } + } + } + + return this.pushStack( matched.length > 1 ? jQuery.uniqueSort( matched ) : matched ); + }, + + // Determine the position of an element within the set + index: function( elem ) { + + // No argument, return index in parent + if ( !elem ) { + return ( this[ 0 ] && this[ 0 ].parentNode ) ? this.first().prevAll().length : -1; + } + + // Index in selector + if ( typeof elem === "string" ) { + return indexOf.call( jQuery( elem ), this[ 0 ] ); + } + + // Locate the position of the desired element + return indexOf.call( this, + + // If it receives a jQuery object, the first element is used + elem.jquery ? elem[ 0 ] : elem + ); + }, + + add: function( selector, context ) { + return this.pushStack( + jQuery.uniqueSort( + jQuery.merge( this.get(), jQuery( selector, context ) ) + ) + ); + }, + + addBack: function( selector ) { + return this.add( selector == null ? + this.prevObject : this.prevObject.filter( selector ) + ); + } +} ); + +function sibling( cur, dir ) { + while ( ( cur = cur[ dir ] ) && cur.nodeType !== 1 ) {} + return cur; +} + +jQuery.each( { + parent: function( elem ) { + var parent = elem.parentNode; + return parent && parent.nodeType !== 11 ? parent : null; + }, + parents: function( elem ) { + return dir( elem, "parentNode" ); + }, + parentsUntil: function( elem, _i, until ) { + return dir( elem, "parentNode", until ); + }, + next: function( elem ) { + return sibling( elem, "nextSibling" ); + }, + prev: function( elem ) { + return sibling( elem, "previousSibling" ); + }, + nextAll: function( elem ) { + return dir( elem, "nextSibling" ); + }, + prevAll: function( elem ) { + return dir( elem, "previousSibling" ); + }, + nextUntil: function( elem, _i, until ) { + return dir( elem, "nextSibling", until ); + }, + prevUntil: function( elem, _i, until ) { + return dir( elem, "previousSibling", until ); + }, + siblings: function( elem ) { + return siblings( ( elem.parentNode || {} ).firstChild, elem ); + }, + children: function( elem ) { + return siblings( elem.firstChild ); + }, + contents: function( elem ) { + if ( elem.contentDocument != null && + + // Support: IE 11+ + // elements with no `data` attribute has an object + // `contentDocument` with a `null` prototype. + getProto( elem.contentDocument ) ) { + + return elem.contentDocument; + } + + // Support: IE 9 - 11 only, iOS 7 only, Android Browser <=4.3 only + // Treat the template element as a regular one in browsers that + // don't support it. + if ( nodeName( elem, "template" ) ) { + elem = elem.content || elem; + } + + return jQuery.merge( [], elem.childNodes ); + } +}, function( name, fn ) { + jQuery.fn[ name ] = function( until, selector ) { + var matched = jQuery.map( this, fn, until ); + + if ( name.slice( -5 ) !== "Until" ) { + selector = until; + } + + if ( selector && typeof selector === "string" ) { + matched = jQuery.filter( selector, matched ); + } + + if ( this.length > 1 ) { + + // Remove duplicates + if ( !guaranteedUnique[ name ] ) { + jQuery.uniqueSort( matched ); + } + + // Reverse order for parents* and prev-derivatives + if ( rparentsprev.test( name ) ) { + matched.reverse(); + } + } + + return this.pushStack( matched ); + }; +} ); +var rnothtmlwhite = ( /[^\x20\t\r\n\f]+/g ); + + + +// Convert String-formatted options into Object-formatted ones +function createOptions( options ) { + var object = {}; + jQuery.each( options.match( rnothtmlwhite ) || [], function( _, flag ) { + object[ flag ] = true; + } ); + return object; +} + +/* + * Create a callback list using the following parameters: + * + * options: an optional list of space-separated options that will change how + * the callback list behaves or a more traditional option object + * + * By default a callback list will act like an event callback list and can be + * "fired" multiple times. + * + * Possible options: + * + * once: will ensure the callback list can only be fired once (like a Deferred) + * + * memory: will keep track of previous values and will call any callback added + * after the list has been fired right away with the latest "memorized" + * values (like a Deferred) + * + * unique: will ensure a callback can only be added once (no duplicate in the list) + * + * stopOnFalse: interrupt callings when a callback returns false + * + */ +jQuery.Callbacks = function( options ) { + + // Convert options from String-formatted to Object-formatted if needed + // (we check in cache first) + options = typeof options === "string" ? + createOptions( options ) : + jQuery.extend( {}, options ); + + var // Flag to know if list is currently firing + firing, + + // Last fire value for non-forgettable lists + memory, + + // Flag to know if list was already fired + fired, + + // Flag to prevent firing + locked, + + // Actual callback list + list = [], + + // Queue of execution data for repeatable lists + queue = [], + + // Index of currently firing callback (modified by add/remove as needed) + firingIndex = -1, + + // Fire callbacks + fire = function() { + + // Enforce single-firing + locked = locked || options.once; + + // Execute callbacks for all pending executions, + // respecting firingIndex overrides and runtime changes + fired = firing = true; + for ( ; queue.length; firingIndex = -1 ) { + memory = queue.shift(); + while ( ++firingIndex < list.length ) { + + // Run callback and check for early termination + if ( list[ firingIndex ].apply( memory[ 0 ], memory[ 1 ] ) === false && + options.stopOnFalse ) { + + // Jump to end and forget the data so .add doesn't re-fire + firingIndex = list.length; + memory = false; + } + } + } + + // Forget the data if we're done with it + if ( !options.memory ) { + memory = false; + } + + firing = false; + + // Clean up if we're done firing for good + if ( locked ) { + + // Keep an empty list if we have data for future add calls + if ( memory ) { + list = []; + + // Otherwise, this object is spent + } else { + list = ""; + } + } + }, + + // Actual Callbacks object + self = { + + // Add a callback or a collection of callbacks to the list + add: function() { + if ( list ) { + + // If we have memory from a past run, we should fire after adding + if ( memory && !firing ) { + firingIndex = list.length - 1; + queue.push( memory ); + } + + ( function add( args ) { + jQuery.each( args, function( _, arg ) { + if ( isFunction( arg ) ) { + if ( !options.unique || !self.has( arg ) ) { + list.push( arg ); + } + } else if ( arg && arg.length && toType( arg ) !== "string" ) { + + // Inspect recursively + add( arg ); + } + } ); + } )( arguments ); + + if ( memory && !firing ) { + fire(); + } + } + return this; + }, + + // Remove a callback from the list + remove: function() { + jQuery.each( arguments, function( _, arg ) { + var index; + while ( ( index = jQuery.inArray( arg, list, index ) ) > -1 ) { + list.splice( index, 1 ); + + // Handle firing indexes + if ( index <= firingIndex ) { + firingIndex--; + } + } + } ); + return this; + }, + + // Check if a given callback is in the list. + // If no argument is given, return whether or not list has callbacks attached. + has: function( fn ) { + return fn ? + jQuery.inArray( fn, list ) > -1 : + list.length > 0; + }, + + // Remove all callbacks from the list + empty: function() { + if ( list ) { + list = []; + } + return this; + }, + + // Disable .fire and .add + // Abort any current/pending executions + // Clear all callbacks and values + disable: function() { + locked = queue = []; + list = memory = ""; + return this; + }, + disabled: function() { + return !list; + }, + + // Disable .fire + // Also disable .add unless we have memory (since it would have no effect) + // Abort any pending executions + lock: function() { + locked = queue = []; + if ( !memory && !firing ) { + list = memory = ""; + } + return this; + }, + locked: function() { + return !!locked; + }, + + // Call all callbacks with the given context and arguments + fireWith: function( context, args ) { + if ( !locked ) { + args = args || []; + args = [ context, args.slice ? args.slice() : args ]; + queue.push( args ); + if ( !firing ) { + fire(); + } + } + return this; + }, + + // Call all the callbacks with the given arguments + fire: function() { + self.fireWith( this, arguments ); + return this; + }, + + // To know if the callbacks have already been called at least once + fired: function() { + return !!fired; + } + }; + + return self; +}; + + +function Identity( v ) { + return v; +} +function Thrower( ex ) { + throw ex; +} + +function adoptValue( value, resolve, reject, noValue ) { + var method; + + try { + + // Check for promise aspect first to privilege synchronous behavior + if ( value && isFunction( ( method = value.promise ) ) ) { + method.call( value ).done( resolve ).fail( reject ); + + // Other thenables + } else if ( value && isFunction( ( method = value.then ) ) ) { + method.call( value, resolve, reject ); + + // Other non-thenables + } else { + + // Control `resolve` arguments by letting Array#slice cast boolean `noValue` to integer: + // * false: [ value ].slice( 0 ) => resolve( value ) + // * true: [ value ].slice( 1 ) => resolve() + resolve.apply( undefined, [ value ].slice( noValue ) ); + } + + // For Promises/A+, convert exceptions into rejections + // Since jQuery.when doesn't unwrap thenables, we can skip the extra checks appearing in + // Deferred#then to conditionally suppress rejection. + } catch ( value ) { + + // Support: Android 4.0 only + // Strict mode functions invoked without .call/.apply get global-object context + reject.apply( undefined, [ value ] ); + } +} + +jQuery.extend( { + + Deferred: function( func ) { + var tuples = [ + + // action, add listener, callbacks, + // ... .then handlers, argument index, [final state] + [ "notify", "progress", jQuery.Callbacks( "memory" ), + jQuery.Callbacks( "memory" ), 2 ], + [ "resolve", "done", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 0, "resolved" ], + [ "reject", "fail", jQuery.Callbacks( "once memory" ), + jQuery.Callbacks( "once memory" ), 1, "rejected" ] + ], + state = "pending", + promise = { + state: function() { + return state; + }, + always: function() { + deferred.done( arguments ).fail( arguments ); + return this; + }, + "catch": function( fn ) { + return promise.then( null, fn ); + }, + + // Keep pipe for back-compat + pipe: function( /* fnDone, fnFail, fnProgress */ ) { + var fns = arguments; + + return jQuery.Deferred( function( newDefer ) { + jQuery.each( tuples, function( _i, tuple ) { + + // Map tuples (progress, done, fail) to arguments (done, fail, progress) + var fn = isFunction( fns[ tuple[ 4 ] ] ) && fns[ tuple[ 4 ] ]; + + // deferred.progress(function() { bind to newDefer or newDefer.notify }) + // deferred.done(function() { bind to newDefer or newDefer.resolve }) + // deferred.fail(function() { bind to newDefer or newDefer.reject }) + deferred[ tuple[ 1 ] ]( function() { + var returned = fn && fn.apply( this, arguments ); + if ( returned && isFunction( returned.promise ) ) { + returned.promise() + .progress( newDefer.notify ) + .done( newDefer.resolve ) + .fail( newDefer.reject ); + } else { + newDefer[ tuple[ 0 ] + "With" ]( + this, + fn ? [ returned ] : arguments + ); + } + } ); + } ); + fns = null; + } ).promise(); + }, + then: function( onFulfilled, onRejected, onProgress ) { + var maxDepth = 0; + function resolve( depth, deferred, handler, special ) { + return function() { + var that = this, + args = arguments, + mightThrow = function() { + var returned, then; + + // Support: Promises/A+ section 2.3.3.3.3 + // https://promisesaplus.com/#point-59 + // Ignore double-resolution attempts + if ( depth < maxDepth ) { + return; + } + + returned = handler.apply( that, args ); + + // Support: Promises/A+ section 2.3.1 + // https://promisesaplus.com/#point-48 + if ( returned === deferred.promise() ) { + throw new TypeError( "Thenable self-resolution" ); + } + + // Support: Promises/A+ sections 2.3.3.1, 3.5 + // https://promisesaplus.com/#point-54 + // https://promisesaplus.com/#point-75 + // Retrieve `then` only once + then = returned && + + // Support: Promises/A+ section 2.3.4 + // https://promisesaplus.com/#point-64 + // Only check objects and functions for thenability + ( typeof returned === "object" || + typeof returned === "function" ) && + returned.then; + + // Handle a returned thenable + if ( isFunction( then ) ) { + + // Special processors (notify) just wait for resolution + if ( special ) { + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ) + ); + + // Normal processors (resolve) also hook into progress + } else { + + // ...and disregard older resolution values + maxDepth++; + + then.call( + returned, + resolve( maxDepth, deferred, Identity, special ), + resolve( maxDepth, deferred, Thrower, special ), + resolve( maxDepth, deferred, Identity, + deferred.notifyWith ) + ); + } + + // Handle all other returned values + } else { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Identity ) { + that = undefined; + args = [ returned ]; + } + + // Process the value(s) + // Default process is resolve + ( special || deferred.resolveWith )( that, args ); + } + }, + + // Only normal processors (resolve) catch and reject exceptions + process = special ? + mightThrow : + function() { + try { + mightThrow(); + } catch ( e ) { + + if ( jQuery.Deferred.exceptionHook ) { + jQuery.Deferred.exceptionHook( e, + process.stackTrace ); + } + + // Support: Promises/A+ section 2.3.3.3.4.1 + // https://promisesaplus.com/#point-61 + // Ignore post-resolution exceptions + if ( depth + 1 >= maxDepth ) { + + // Only substitute handlers pass on context + // and multiple values (non-spec behavior) + if ( handler !== Thrower ) { + that = undefined; + args = [ e ]; + } + + deferred.rejectWith( that, args ); + } + } + }; + + // Support: Promises/A+ section 2.3.3.3.1 + // https://promisesaplus.com/#point-57 + // Re-resolve promises immediately to dodge false rejection from + // subsequent errors + if ( depth ) { + process(); + } else { + + // Call an optional hook to record the stack, in case of exception + // since it's otherwise lost when execution goes async + if ( jQuery.Deferred.getStackHook ) { + process.stackTrace = jQuery.Deferred.getStackHook(); + } + window.setTimeout( process ); + } + }; + } + + return jQuery.Deferred( function( newDefer ) { + + // progress_handlers.add( ... ) + tuples[ 0 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onProgress ) ? + onProgress : + Identity, + newDefer.notifyWith + ) + ); + + // fulfilled_handlers.add( ... ) + tuples[ 1 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onFulfilled ) ? + onFulfilled : + Identity + ) + ); + + // rejected_handlers.add( ... ) + tuples[ 2 ][ 3 ].add( + resolve( + 0, + newDefer, + isFunction( onRejected ) ? + onRejected : + Thrower + ) + ); + } ).promise(); + }, + + // Get a promise for this deferred + // If obj is provided, the promise aspect is added to the object + promise: function( obj ) { + return obj != null ? jQuery.extend( obj, promise ) : promise; + } + }, + deferred = {}; + + // Add list-specific methods + jQuery.each( tuples, function( i, tuple ) { + var list = tuple[ 2 ], + stateString = tuple[ 5 ]; + + // promise.progress = list.add + // promise.done = list.add + // promise.fail = list.add + promise[ tuple[ 1 ] ] = list.add; + + // Handle state + if ( stateString ) { + list.add( + function() { + + // state = "resolved" (i.e., fulfilled) + // state = "rejected" + state = stateString; + }, + + // rejected_callbacks.disable + // fulfilled_callbacks.disable + tuples[ 3 - i ][ 2 ].disable, + + // rejected_handlers.disable + // fulfilled_handlers.disable + tuples[ 3 - i ][ 3 ].disable, + + // progress_callbacks.lock + tuples[ 0 ][ 2 ].lock, + + // progress_handlers.lock + tuples[ 0 ][ 3 ].lock + ); + } + + // progress_handlers.fire + // fulfilled_handlers.fire + // rejected_handlers.fire + list.add( tuple[ 3 ].fire ); + + // deferred.notify = function() { deferred.notifyWith(...) } + // deferred.resolve = function() { deferred.resolveWith(...) } + // deferred.reject = function() { deferred.rejectWith(...) } + deferred[ tuple[ 0 ] ] = function() { + deferred[ tuple[ 0 ] + "With" ]( this === deferred ? undefined : this, arguments ); + return this; + }; + + // deferred.notifyWith = list.fireWith + // deferred.resolveWith = list.fireWith + // deferred.rejectWith = list.fireWith + deferred[ tuple[ 0 ] + "With" ] = list.fireWith; + } ); + + // Make the deferred a promise + promise.promise( deferred ); + + // Call given func if any + if ( func ) { + func.call( deferred, deferred ); + } + + // All done! + return deferred; + }, + + // Deferred helper + when: function( singleValue ) { + var + + // count of uncompleted subordinates + remaining = arguments.length, + + // count of unprocessed arguments + i = remaining, + + // subordinate fulfillment data + resolveContexts = Array( i ), + resolveValues = slice.call( arguments ), + + // the primary Deferred + primary = jQuery.Deferred(), + + // subordinate callback factory + updateFunc = function( i ) { + return function( value ) { + resolveContexts[ i ] = this; + resolveValues[ i ] = arguments.length > 1 ? slice.call( arguments ) : value; + if ( !( --remaining ) ) { + primary.resolveWith( resolveContexts, resolveValues ); + } + }; + }; + + // Single- and empty arguments are adopted like Promise.resolve + if ( remaining <= 1 ) { + adoptValue( singleValue, primary.done( updateFunc( i ) ).resolve, primary.reject, + !remaining ); + + // Use .then() to unwrap secondary thenables (cf. gh-3000) + if ( primary.state() === "pending" || + isFunction( resolveValues[ i ] && resolveValues[ i ].then ) ) { + + return primary.then(); + } + } + + // Multiple arguments are aggregated like Promise.all array elements + while ( i-- ) { + adoptValue( resolveValues[ i ], updateFunc( i ), primary.reject ); + } + + return primary.promise(); + } +} ); + + +// These usually indicate a programmer mistake during development, +// warn about them ASAP rather than swallowing them by default. +var rerrorNames = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/; + +jQuery.Deferred.exceptionHook = function( error, stack ) { + + // Support: IE 8 - 9 only + // Console exists when dev tools are open, which can happen at any time + if ( window.console && window.console.warn && error && rerrorNames.test( error.name ) ) { + window.console.warn( "jQuery.Deferred exception: " + error.message, error.stack, stack ); + } +}; + + + + +jQuery.readyException = function( error ) { + window.setTimeout( function() { + throw error; + } ); +}; + + + + +// The deferred used on DOM ready +var readyList = jQuery.Deferred(); + +jQuery.fn.ready = function( fn ) { + + readyList + .then( fn ) + + // Wrap jQuery.readyException in a function so that the lookup + // happens at the time of error handling instead of callback + // registration. + .catch( function( error ) { + jQuery.readyException( error ); + } ); + + return this; +}; + +jQuery.extend( { + + // Is the DOM ready to be used? Set to true once it occurs. + isReady: false, + + // A counter to track how many items to wait for before + // the ready event fires. See #6781 + readyWait: 1, + + // Handle when the DOM is ready + ready: function( wait ) { + + // Abort if there are pending holds or we're already ready + if ( wait === true ? --jQuery.readyWait : jQuery.isReady ) { + return; + } + + // Remember that the DOM is ready + jQuery.isReady = true; + + // If a normal DOM Ready event fired, decrement, and wait if need be + if ( wait !== true && --jQuery.readyWait > 0 ) { + return; + } + + // If there are functions bound, to execute + readyList.resolveWith( document, [ jQuery ] ); + } +} ); + +jQuery.ready.then = readyList.then; + +// The ready event handler and self cleanup method +function completed() { + document.removeEventListener( "DOMContentLoaded", completed ); + window.removeEventListener( "load", completed ); + jQuery.ready(); +} + +// Catch cases where $(document).ready() is called +// after the browser event has already occurred. +// Support: IE <=9 - 10 only +// Older IE sometimes signals "interactive" too soon +if ( document.readyState === "complete" || + ( document.readyState !== "loading" && !document.documentElement.doScroll ) ) { + + // Handle it asynchronously to allow scripts the opportunity to delay ready + window.setTimeout( jQuery.ready ); + +} else { + + // Use the handy event callback + document.addEventListener( "DOMContentLoaded", completed ); + + // A fallback to window.onload, that will always work + window.addEventListener( "load", completed ); +} + + + + +// Multifunctional method to get and set values of a collection +// The value/s can optionally be executed if it's a function +var access = function( elems, fn, key, value, chainable, emptyGet, raw ) { + var i = 0, + len = elems.length, + bulk = key == null; + + // Sets many values + if ( toType( key ) === "object" ) { + chainable = true; + for ( i in key ) { + access( elems, fn, i, key[ i ], true, emptyGet, raw ); + } + + // Sets one value + } else if ( value !== undefined ) { + chainable = true; + + if ( !isFunction( value ) ) { + raw = true; + } + + if ( bulk ) { + + // Bulk operations run against the entire set + if ( raw ) { + fn.call( elems, value ); + fn = null; + + // ...except when executing function values + } else { + bulk = fn; + fn = function( elem, _key, value ) { + return bulk.call( jQuery( elem ), value ); + }; + } + } + + if ( fn ) { + for ( ; i < len; i++ ) { + fn( + elems[ i ], key, raw ? + value : + value.call( elems[ i ], i, fn( elems[ i ], key ) ) + ); + } + } + } + + if ( chainable ) { + return elems; + } + + // Gets + if ( bulk ) { + return fn.call( elems ); + } + + return len ? fn( elems[ 0 ], key ) : emptyGet; +}; + + +// Matches dashed string for camelizing +var rmsPrefix = /^-ms-/, + rdashAlpha = /-([a-z])/g; + +// Used by camelCase as callback to replace() +function fcamelCase( _all, letter ) { + return letter.toUpperCase(); +} + +// Convert dashed to camelCase; used by the css and data modules +// Support: IE <=9 - 11, Edge 12 - 15 +// Microsoft forgot to hump their vendor prefix (#9572) +function camelCase( string ) { + return string.replace( rmsPrefix, "ms-" ).replace( rdashAlpha, fcamelCase ); +} +var acceptData = function( owner ) { + + // Accepts only: + // - Node + // - Node.ELEMENT_NODE + // - Node.DOCUMENT_NODE + // - Object + // - Any + return owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType ); +}; + + + + +function Data() { + this.expando = jQuery.expando + Data.uid++; +} + +Data.uid = 1; + +Data.prototype = { + + cache: function( owner ) { + + // Check if the owner object already has a cache + var value = owner[ this.expando ]; + + // If not, create one + if ( !value ) { + value = {}; + + // We can accept data for non-element nodes in modern browsers, + // but we should not, see #8335. + // Always return an empty object. + if ( acceptData( owner ) ) { + + // If it is a node unlikely to be stringify-ed or looped over + // use plain assignment + if ( owner.nodeType ) { + owner[ this.expando ] = value; + + // Otherwise secure it in a non-enumerable property + // configurable must be true to allow the property to be + // deleted when data is removed + } else { + Object.defineProperty( owner, this.expando, { + value: value, + configurable: true + } ); + } + } + } + + return value; + }, + set: function( owner, data, value ) { + var prop, + cache = this.cache( owner ); + + // Handle: [ owner, key, value ] args + // Always use camelCase key (gh-2257) + if ( typeof data === "string" ) { + cache[ camelCase( data ) ] = value; + + // Handle: [ owner, { properties } ] args + } else { + + // Copy the properties one-by-one to the cache object + for ( prop in data ) { + cache[ camelCase( prop ) ] = data[ prop ]; + } + } + return cache; + }, + get: function( owner, key ) { + return key === undefined ? + this.cache( owner ) : + + // Always use camelCase key (gh-2257) + owner[ this.expando ] && owner[ this.expando ][ camelCase( key ) ]; + }, + access: function( owner, key, value ) { + + // In cases where either: + // + // 1. No key was specified + // 2. A string key was specified, but no value provided + // + // Take the "read" path and allow the get method to determine + // which value to return, respectively either: + // + // 1. The entire cache object + // 2. The data stored at the key + // + if ( key === undefined || + ( ( key && typeof key === "string" ) && value === undefined ) ) { + + return this.get( owner, key ); + } + + // When the key is not a string, or both a key and value + // are specified, set or extend (existing objects) with either: + // + // 1. An object of properties + // 2. A key and value + // + this.set( owner, key, value ); + + // Since the "set" path can have two possible entry points + // return the expected data based on which path was taken[*] + return value !== undefined ? value : key; + }, + remove: function( owner, key ) { + var i, + cache = owner[ this.expando ]; + + if ( cache === undefined ) { + return; + } + + if ( key !== undefined ) { + + // Support array or space separated string of keys + if ( Array.isArray( key ) ) { + + // If key is an array of keys... + // We always set camelCase keys, so remove that. + key = key.map( camelCase ); + } else { + key = camelCase( key ); + + // If a key with the spaces exists, use it. + // Otherwise, create an array by matching non-whitespace + key = key in cache ? + [ key ] : + ( key.match( rnothtmlwhite ) || [] ); + } + + i = key.length; + + while ( i-- ) { + delete cache[ key[ i ] ]; + } + } + + // Remove the expando if there's no more data + if ( key === undefined || jQuery.isEmptyObject( cache ) ) { + + // Support: Chrome <=35 - 45 + // Webkit & Blink performance suffers when deleting properties + // from DOM nodes, so set to undefined instead + // https://bugs.chromium.org/p/chromium/issues/detail?id=378607 (bug restricted) + if ( owner.nodeType ) { + owner[ this.expando ] = undefined; + } else { + delete owner[ this.expando ]; + } + } + }, + hasData: function( owner ) { + var cache = owner[ this.expando ]; + return cache !== undefined && !jQuery.isEmptyObject( cache ); + } +}; +var dataPriv = new Data(); + +var dataUser = new Data(); + + + +// Implementation Summary +// +// 1. Enforce API surface and semantic compatibility with 1.9.x branch +// 2. Improve the module's maintainability by reducing the storage +// paths to a single mechanism. +// 3. Use the same single mechanism to support "private" and "user" data. +// 4. _Never_ expose "private" data to user code (TODO: Drop _data, _removeData) +// 5. Avoid exposing implementation details on user objects (eg. expando properties) +// 6. Provide a clear path for implementation upgrade to WeakMap in 2014 + +var rbrace = /^(?:\{[\w\W]*\}|\[[\w\W]*\])$/, + rmultiDash = /[A-Z]/g; + +function getData( data ) { + if ( data === "true" ) { + return true; + } + + if ( data === "false" ) { + return false; + } + + if ( data === "null" ) { + return null; + } + + // Only convert to a number if it doesn't change the string + if ( data === +data + "" ) { + return +data; + } + + if ( rbrace.test( data ) ) { + return JSON.parse( data ); + } + + return data; +} + +function dataAttr( elem, key, data ) { + var name; + + // If nothing was found internally, try to fetch any + // data from the HTML5 data-* attribute + if ( data === undefined && elem.nodeType === 1 ) { + name = "data-" + key.replace( rmultiDash, "-$&" ).toLowerCase(); + data = elem.getAttribute( name ); + + if ( typeof data === "string" ) { + try { + data = getData( data ); + } catch ( e ) {} + + // Make sure we set the data so it isn't changed later + dataUser.set( elem, key, data ); + } else { + data = undefined; + } + } + return data; +} + +jQuery.extend( { + hasData: function( elem ) { + return dataUser.hasData( elem ) || dataPriv.hasData( elem ); + }, + + data: function( elem, name, data ) { + return dataUser.access( elem, name, data ); + }, + + removeData: function( elem, name ) { + dataUser.remove( elem, name ); + }, + + // TODO: Now that all calls to _data and _removeData have been replaced + // with direct calls to dataPriv methods, these can be deprecated. + _data: function( elem, name, data ) { + return dataPriv.access( elem, name, data ); + }, + + _removeData: function( elem, name ) { + dataPriv.remove( elem, name ); + } +} ); + +jQuery.fn.extend( { + data: function( key, value ) { + var i, name, data, + elem = this[ 0 ], + attrs = elem && elem.attributes; + + // Gets all values + if ( key === undefined ) { + if ( this.length ) { + data = dataUser.get( elem ); + + if ( elem.nodeType === 1 && !dataPriv.get( elem, "hasDataAttrs" ) ) { + i = attrs.length; + while ( i-- ) { + + // Support: IE 11 only + // The attrs elements can be null (#14894) + if ( attrs[ i ] ) { + name = attrs[ i ].name; + if ( name.indexOf( "data-" ) === 0 ) { + name = camelCase( name.slice( 5 ) ); + dataAttr( elem, name, data[ name ] ); + } + } + } + dataPriv.set( elem, "hasDataAttrs", true ); + } + } + + return data; + } + + // Sets multiple values + if ( typeof key === "object" ) { + return this.each( function() { + dataUser.set( this, key ); + } ); + } + + return access( this, function( value ) { + var data; + + // The calling jQuery object (element matches) is not empty + // (and therefore has an element appears at this[ 0 ]) and the + // `value` parameter was not undefined. An empty jQuery object + // will result in `undefined` for elem = this[ 0 ] which will + // throw an exception if an attempt to read a data cache is made. + if ( elem && value === undefined ) { + + // Attempt to get data from the cache + // The key will always be camelCased in Data + data = dataUser.get( elem, key ); + if ( data !== undefined ) { + return data; + } + + // Attempt to "discover" the data in + // HTML5 custom data-* attrs + data = dataAttr( elem, key ); + if ( data !== undefined ) { + return data; + } + + // We tried really hard, but the data doesn't exist. + return; + } + + // Set the data... + this.each( function() { + + // We always store the camelCased key + dataUser.set( this, key, value ); + } ); + }, null, value, arguments.length > 1, null, true ); + }, + + removeData: function( key ) { + return this.each( function() { + dataUser.remove( this, key ); + } ); + } +} ); + + +jQuery.extend( { + queue: function( elem, type, data ) { + var queue; + + if ( elem ) { + type = ( type || "fx" ) + "queue"; + queue = dataPriv.get( elem, type ); + + // Speed up dequeue by getting out quickly if this is just a lookup + if ( data ) { + if ( !queue || Array.isArray( data ) ) { + queue = dataPriv.access( elem, type, jQuery.makeArray( data ) ); + } else { + queue.push( data ); + } + } + return queue || []; + } + }, + + dequeue: function( elem, type ) { + type = type || "fx"; + + var queue = jQuery.queue( elem, type ), + startLength = queue.length, + fn = queue.shift(), + hooks = jQuery._queueHooks( elem, type ), + next = function() { + jQuery.dequeue( elem, type ); + }; + + // If the fx queue is dequeued, always remove the progress sentinel + if ( fn === "inprogress" ) { + fn = queue.shift(); + startLength--; + } + + if ( fn ) { + + // Add a progress sentinel to prevent the fx queue from being + // automatically dequeued + if ( type === "fx" ) { + queue.unshift( "inprogress" ); + } + + // Clear up the last queue stop function + delete hooks.stop; + fn.call( elem, next, hooks ); + } + + if ( !startLength && hooks ) { + hooks.empty.fire(); + } + }, + + // Not public - generate a queueHooks object, or return the current one + _queueHooks: function( elem, type ) { + var key = type + "queueHooks"; + return dataPriv.get( elem, key ) || dataPriv.access( elem, key, { + empty: jQuery.Callbacks( "once memory" ).add( function() { + dataPriv.remove( elem, [ type + "queue", key ] ); + } ) + } ); + } +} ); + +jQuery.fn.extend( { + queue: function( type, data ) { + var setter = 2; + + if ( typeof type !== "string" ) { + data = type; + type = "fx"; + setter--; + } + + if ( arguments.length < setter ) { + return jQuery.queue( this[ 0 ], type ); + } + + return data === undefined ? + this : + this.each( function() { + var queue = jQuery.queue( this, type, data ); + + // Ensure a hooks for this queue + jQuery._queueHooks( this, type ); + + if ( type === "fx" && queue[ 0 ] !== "inprogress" ) { + jQuery.dequeue( this, type ); + } + } ); + }, + dequeue: function( type ) { + return this.each( function() { + jQuery.dequeue( this, type ); + } ); + }, + clearQueue: function( type ) { + return this.queue( type || "fx", [] ); + }, + + // Get a promise resolved when queues of a certain type + // are emptied (fx is the type by default) + promise: function( type, obj ) { + var tmp, + count = 1, + defer = jQuery.Deferred(), + elements = this, + i = this.length, + resolve = function() { + if ( !( --count ) ) { + defer.resolveWith( elements, [ elements ] ); + } + }; + + if ( typeof type !== "string" ) { + obj = type; + type = undefined; + } + type = type || "fx"; + + while ( i-- ) { + tmp = dataPriv.get( elements[ i ], type + "queueHooks" ); + if ( tmp && tmp.empty ) { + count++; + tmp.empty.add( resolve ); + } + } + resolve(); + return defer.promise( obj ); + } +} ); +var pnum = ( /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/ ).source; + +var rcssNum = new RegExp( "^(?:([+-])=|)(" + pnum + ")([a-z%]*)$", "i" ); + + +var cssExpand = [ "Top", "Right", "Bottom", "Left" ]; + +var documentElement = document.documentElement; + + + + var isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ); + }, + composed = { composed: true }; + + // Support: IE 9 - 11+, Edge 12 - 18+, iOS 10.0 - 10.2 only + // Check attachment across shadow DOM boundaries when possible (gh-3504) + // Support: iOS 10.0-10.2 only + // Early iOS 10 versions support `attachShadow` but not `getRootNode`, + // leading to errors. We need to check for `getRootNode`. + if ( documentElement.getRootNode ) { + isAttached = function( elem ) { + return jQuery.contains( elem.ownerDocument, elem ) || + elem.getRootNode( composed ) === elem.ownerDocument; + }; + } +var isHiddenWithinTree = function( elem, el ) { + + // isHiddenWithinTree might be called from jQuery#filter function; + // in that case, element will be second argument + elem = el || elem; + + // Inline style trumps all + return elem.style.display === "none" || + elem.style.display === "" && + + // Otherwise, check computed style + // Support: Firefox <=43 - 45 + // Disconnected elements can have computed display: none, so first confirm that elem is + // in the document. + isAttached( elem ) && + + jQuery.css( elem, "display" ) === "none"; + }; + + + +function adjustCSS( elem, prop, valueParts, tween ) { + var adjusted, scale, + maxIterations = 20, + currentValue = tween ? + function() { + return tween.cur(); + } : + function() { + return jQuery.css( elem, prop, "" ); + }, + initial = currentValue(), + unit = valueParts && valueParts[ 3 ] || ( jQuery.cssNumber[ prop ] ? "" : "px" ), + + // Starting value computation is required for potential unit mismatches + initialInUnit = elem.nodeType && + ( jQuery.cssNumber[ prop ] || unit !== "px" && +initial ) && + rcssNum.exec( jQuery.css( elem, prop ) ); + + if ( initialInUnit && initialInUnit[ 3 ] !== unit ) { + + // Support: Firefox <=54 + // Halve the iteration target value to prevent interference from CSS upper bounds (gh-2144) + initial = initial / 2; + + // Trust units reported by jQuery.css + unit = unit || initialInUnit[ 3 ]; + + // Iteratively approximate from a nonzero starting point + initialInUnit = +initial || 1; + + while ( maxIterations-- ) { + + // Evaluate and update our best guess (doubling guesses that zero out). + // Finish if the scale equals or crosses 1 (making the old*new product non-positive). + jQuery.style( elem, prop, initialInUnit + unit ); + if ( ( 1 - scale ) * ( 1 - ( scale = currentValue() / initial || 0.5 ) ) <= 0 ) { + maxIterations = 0; + } + initialInUnit = initialInUnit / scale; + + } + + initialInUnit = initialInUnit * 2; + jQuery.style( elem, prop, initialInUnit + unit ); + + // Make sure we update the tween properties later on + valueParts = valueParts || []; + } + + if ( valueParts ) { + initialInUnit = +initialInUnit || +initial || 0; + + // Apply relative offset (+=/-=) if specified + adjusted = valueParts[ 1 ] ? + initialInUnit + ( valueParts[ 1 ] + 1 ) * valueParts[ 2 ] : + +valueParts[ 2 ]; + if ( tween ) { + tween.unit = unit; + tween.start = initialInUnit; + tween.end = adjusted; + } + } + return adjusted; +} + + +var defaultDisplayMap = {}; + +function getDefaultDisplay( elem ) { + var temp, + doc = elem.ownerDocument, + nodeName = elem.nodeName, + display = defaultDisplayMap[ nodeName ]; + + if ( display ) { + return display; + } + + temp = doc.body.appendChild( doc.createElement( nodeName ) ); + display = jQuery.css( temp, "display" ); + + temp.parentNode.removeChild( temp ); + + if ( display === "none" ) { + display = "block"; + } + defaultDisplayMap[ nodeName ] = display; + + return display; +} + +function showHide( elements, show ) { + var display, elem, + values = [], + index = 0, + length = elements.length; + + // Determine new display value for elements that need to change + for ( ; index < length; index++ ) { + elem = elements[ index ]; + if ( !elem.style ) { + continue; + } + + display = elem.style.display; + if ( show ) { + + // Since we force visibility upon cascade-hidden elements, an immediate (and slow) + // check is required in this first loop unless we have a nonempty display value (either + // inline or about-to-be-restored) + if ( display === "none" ) { + values[ index ] = dataPriv.get( elem, "display" ) || null; + if ( !values[ index ] ) { + elem.style.display = ""; + } + } + if ( elem.style.display === "" && isHiddenWithinTree( elem ) ) { + values[ index ] = getDefaultDisplay( elem ); + } + } else { + if ( display !== "none" ) { + values[ index ] = "none"; + + // Remember what we're overwriting + dataPriv.set( elem, "display", display ); + } + } + } + + // Set the display of the elements in a second loop to avoid constant reflow + for ( index = 0; index < length; index++ ) { + if ( values[ index ] != null ) { + elements[ index ].style.display = values[ index ]; + } + } + + return elements; +} + +jQuery.fn.extend( { + show: function() { + return showHide( this, true ); + }, + hide: function() { + return showHide( this ); + }, + toggle: function( state ) { + if ( typeof state === "boolean" ) { + return state ? this.show() : this.hide(); + } + + return this.each( function() { + if ( isHiddenWithinTree( this ) ) { + jQuery( this ).show(); + } else { + jQuery( this ).hide(); + } + } ); + } +} ); +var rcheckableType = ( /^(?:checkbox|radio)$/i ); + +var rtagName = ( /<([a-z][^\/\0>\x20\t\r\n\f]*)/i ); + +var rscriptType = ( /^$|^module$|\/(?:java|ecma)script/i ); + + + +( function() { + var fragment = document.createDocumentFragment(), + div = fragment.appendChild( document.createElement( "div" ) ), + input = document.createElement( "input" ); + + // Support: Android 4.0 - 4.3 only + // Check state lost if the name is set (#11217) + // Support: Windows Web Apps (WWA) + // `name` and `type` must use .setAttribute for WWA (#14901) + input.setAttribute( "type", "radio" ); + input.setAttribute( "checked", "checked" ); + input.setAttribute( "name", "t" ); + + div.appendChild( input ); + + // Support: Android <=4.1 only + // Older WebKit doesn't clone checked state correctly in fragments + support.checkClone = div.cloneNode( true ).cloneNode( true ).lastChild.checked; + + // Support: IE <=11 only + // Make sure textarea (and checkbox) defaultValue is properly cloned + div.innerHTML = ""; + support.noCloneChecked = !!div.cloneNode( true ).lastChild.defaultValue; + + // Support: IE <=9 only + // IE <=9 replaces "; + support.option = !!div.lastChild; +} )(); + + +// We have to close these tags to support XHTML (#13200) +var wrapMap = { + + // XHTML parsers do not magically insert elements in the + // same way that tag soup parsers do. So we cannot shorten + // this by omitting or other required elements. + thead: [ 1, "", "
    " ], + col: [ 2, "", "
    " ], + tr: [ 2, "", "
    " ], + td: [ 3, "", "
    " ], + + _default: [ 0, "", "" ] +}; + +wrapMap.tbody = wrapMap.tfoot = wrapMap.colgroup = wrapMap.caption = wrapMap.thead; +wrapMap.th = wrapMap.td; + +// Support: IE <=9 only +if ( !support.option ) { + wrapMap.optgroup = wrapMap.option = [ 1, "" ]; +} + + +function getAll( context, tag ) { + + // Support: IE <=9 - 11 only + // Use typeof to avoid zero-argument method invocation on host objects (#15151) + var ret; + + if ( typeof context.getElementsByTagName !== "undefined" ) { + ret = context.getElementsByTagName( tag || "*" ); + + } else if ( typeof context.querySelectorAll !== "undefined" ) { + ret = context.querySelectorAll( tag || "*" ); + + } else { + ret = []; + } + + if ( tag === undefined || tag && nodeName( context, tag ) ) { + return jQuery.merge( [ context ], ret ); + } + + return ret; +} + + +// Mark scripts as having already been evaluated +function setGlobalEval( elems, refElements ) { + var i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + dataPriv.set( + elems[ i ], + "globalEval", + !refElements || dataPriv.get( refElements[ i ], "globalEval" ) + ); + } +} + + +var rhtml = /<|&#?\w+;/; + +function buildFragment( elems, context, scripts, selection, ignored ) { + var elem, tmp, tag, wrap, attached, j, + fragment = context.createDocumentFragment(), + nodes = [], + i = 0, + l = elems.length; + + for ( ; i < l; i++ ) { + elem = elems[ i ]; + + if ( elem || elem === 0 ) { + + // Add nodes directly + if ( toType( elem ) === "object" ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, elem.nodeType ? [ elem ] : elem ); + + // Convert non-html into a text node + } else if ( !rhtml.test( elem ) ) { + nodes.push( context.createTextNode( elem ) ); + + // Convert html into DOM nodes + } else { + tmp = tmp || fragment.appendChild( context.createElement( "div" ) ); + + // Deserialize a standard representation + tag = ( rtagName.exec( elem ) || [ "", "" ] )[ 1 ].toLowerCase(); + wrap = wrapMap[ tag ] || wrapMap._default; + tmp.innerHTML = wrap[ 1 ] + jQuery.htmlPrefilter( elem ) + wrap[ 2 ]; + + // Descend through wrappers to the right content + j = wrap[ 0 ]; + while ( j-- ) { + tmp = tmp.lastChild; + } + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( nodes, tmp.childNodes ); + + // Remember the top-level container + tmp = fragment.firstChild; + + // Ensure the created nodes are orphaned (#12392) + tmp.textContent = ""; + } + } + } + + // Remove wrapper from fragment + fragment.textContent = ""; + + i = 0; + while ( ( elem = nodes[ i++ ] ) ) { + + // Skip elements already in the context collection (trac-4087) + if ( selection && jQuery.inArray( elem, selection ) > -1 ) { + if ( ignored ) { + ignored.push( elem ); + } + continue; + } + + attached = isAttached( elem ); + + // Append to fragment + tmp = getAll( fragment.appendChild( elem ), "script" ); + + // Preserve script evaluation history + if ( attached ) { + setGlobalEval( tmp ); + } + + // Capture executables + if ( scripts ) { + j = 0; + while ( ( elem = tmp[ j++ ] ) ) { + if ( rscriptType.test( elem.type || "" ) ) { + scripts.push( elem ); + } + } + } + } + + return fragment; +} + + +var rtypenamespace = /^([^.]*)(?:\.(.+)|)/; + +function returnTrue() { + return true; +} + +function returnFalse() { + return false; +} + +// Support: IE <=9 - 11+ +// focus() and blur() are asynchronous, except when they are no-op. +// So expect focus to be synchronous when the element is already active, +// and blur to be synchronous when the element is not already active. +// (focus and blur are always synchronous in other supported browsers, +// this just defines when we can count on it). +function expectSync( elem, type ) { + return ( elem === safeActiveElement() ) === ( type === "focus" ); +} + +// Support: IE <=9 only +// Accessing document.activeElement can throw unexpectedly +// https://bugs.jquery.com/ticket/13393 +function safeActiveElement() { + try { + return document.activeElement; + } catch ( err ) { } +} + +function on( elem, types, selector, data, fn, one ) { + var origFn, type; + + // Types can be a map of types/handlers + if ( typeof types === "object" ) { + + // ( types-Object, selector, data ) + if ( typeof selector !== "string" ) { + + // ( types-Object, data ) + data = data || selector; + selector = undefined; + } + for ( type in types ) { + on( elem, type, selector, data, types[ type ], one ); + } + return elem; + } + + if ( data == null && fn == null ) { + + // ( types, fn ) + fn = selector; + data = selector = undefined; + } else if ( fn == null ) { + if ( typeof selector === "string" ) { + + // ( types, selector, fn ) + fn = data; + data = undefined; + } else { + + // ( types, data, fn ) + fn = data; + data = selector; + selector = undefined; + } + } + if ( fn === false ) { + fn = returnFalse; + } else if ( !fn ) { + return elem; + } + + if ( one === 1 ) { + origFn = fn; + fn = function( event ) { + + // Can use an empty set, since event contains the info + jQuery().off( event ); + return origFn.apply( this, arguments ); + }; + + // Use same guid so caller can remove using origFn + fn.guid = origFn.guid || ( origFn.guid = jQuery.guid++ ); + } + return elem.each( function() { + jQuery.event.add( this, types, fn, data, selector ); + } ); +} + +/* + * Helper functions for managing events -- not part of the public interface. + * Props to Dean Edwards' addEvent library for many of the ideas. + */ +jQuery.event = { + + global: {}, + + add: function( elem, types, handler, data, selector ) { + + var handleObjIn, eventHandle, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.get( elem ); + + // Only attach events to objects that accept data + if ( !acceptData( elem ) ) { + return; + } + + // Caller can pass in an object of custom data in lieu of the handler + if ( handler.handler ) { + handleObjIn = handler; + handler = handleObjIn.handler; + selector = handleObjIn.selector; + } + + // Ensure that invalid selectors throw exceptions at attach time + // Evaluate against documentElement in case elem is a non-element node (e.g., document) + if ( selector ) { + jQuery.find.matchesSelector( documentElement, selector ); + } + + // Make sure that the handler has a unique ID, used to find/remove it later + if ( !handler.guid ) { + handler.guid = jQuery.guid++; + } + + // Init the element's event structure and main handler, if this is the first + if ( !( events = elemData.events ) ) { + events = elemData.events = Object.create( null ); + } + if ( !( eventHandle = elemData.handle ) ) { + eventHandle = elemData.handle = function( e ) { + + // Discard the second event of a jQuery.event.trigger() and + // when an event is called after a page has unloaded + return typeof jQuery !== "undefined" && jQuery.event.triggered !== e.type ? + jQuery.event.dispatch.apply( elem, arguments ) : undefined; + }; + } + + // Handle multiple events separated by a space + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // There *must* be a type, no attaching namespace-only handlers + if ( !type ) { + continue; + } + + // If event changes its type, use the special event handlers for the changed type + special = jQuery.event.special[ type ] || {}; + + // If selector defined, determine special event api type, otherwise given type + type = ( selector ? special.delegateType : special.bindType ) || type; + + // Update special based on newly reset type + special = jQuery.event.special[ type ] || {}; + + // handleObj is passed to all event handlers + handleObj = jQuery.extend( { + type: type, + origType: origType, + data: data, + handler: handler, + guid: handler.guid, + selector: selector, + needsContext: selector && jQuery.expr.match.needsContext.test( selector ), + namespace: namespaces.join( "." ) + }, handleObjIn ); + + // Init the event handler queue if we're the first + if ( !( handlers = events[ type ] ) ) { + handlers = events[ type ] = []; + handlers.delegateCount = 0; + + // Only use addEventListener if the special events handler returns false + if ( !special.setup || + special.setup.call( elem, data, namespaces, eventHandle ) === false ) { + + if ( elem.addEventListener ) { + elem.addEventListener( type, eventHandle ); + } + } + } + + if ( special.add ) { + special.add.call( elem, handleObj ); + + if ( !handleObj.handler.guid ) { + handleObj.handler.guid = handler.guid; + } + } + + // Add to the element's handler list, delegates in front + if ( selector ) { + handlers.splice( handlers.delegateCount++, 0, handleObj ); + } else { + handlers.push( handleObj ); + } + + // Keep track of which events have ever been used, for event optimization + jQuery.event.global[ type ] = true; + } + + }, + + // Detach an event or set of events from an element + remove: function( elem, types, handler, selector, mappedTypes ) { + + var j, origCount, tmp, + events, t, handleObj, + special, handlers, type, namespaces, origType, + elemData = dataPriv.hasData( elem ) && dataPriv.get( elem ); + + if ( !elemData || !( events = elemData.events ) ) { + return; + } + + // Once for each type.namespace in types; type may be omitted + types = ( types || "" ).match( rnothtmlwhite ) || [ "" ]; + t = types.length; + while ( t-- ) { + tmp = rtypenamespace.exec( types[ t ] ) || []; + type = origType = tmp[ 1 ]; + namespaces = ( tmp[ 2 ] || "" ).split( "." ).sort(); + + // Unbind all events (on this namespace, if provided) for the element + if ( !type ) { + for ( type in events ) { + jQuery.event.remove( elem, type + types[ t ], handler, selector, true ); + } + continue; + } + + special = jQuery.event.special[ type ] || {}; + type = ( selector ? special.delegateType : special.bindType ) || type; + handlers = events[ type ] || []; + tmp = tmp[ 2 ] && + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ); + + // Remove matching events + origCount = j = handlers.length; + while ( j-- ) { + handleObj = handlers[ j ]; + + if ( ( mappedTypes || origType === handleObj.origType ) && + ( !handler || handler.guid === handleObj.guid ) && + ( !tmp || tmp.test( handleObj.namespace ) ) && + ( !selector || selector === handleObj.selector || + selector === "**" && handleObj.selector ) ) { + handlers.splice( j, 1 ); + + if ( handleObj.selector ) { + handlers.delegateCount--; + } + if ( special.remove ) { + special.remove.call( elem, handleObj ); + } + } + } + + // Remove generic event handler if we removed something and no more handlers exist + // (avoids potential for endless recursion during removal of special event handlers) + if ( origCount && !handlers.length ) { + if ( !special.teardown || + special.teardown.call( elem, namespaces, elemData.handle ) === false ) { + + jQuery.removeEvent( elem, type, elemData.handle ); + } + + delete events[ type ]; + } + } + + // Remove data and the expando if it's no longer used + if ( jQuery.isEmptyObject( events ) ) { + dataPriv.remove( elem, "handle events" ); + } + }, + + dispatch: function( nativeEvent ) { + + var i, j, ret, matched, handleObj, handlerQueue, + args = new Array( arguments.length ), + + // Make a writable jQuery.Event from the native event object + event = jQuery.event.fix( nativeEvent ), + + handlers = ( + dataPriv.get( this, "events" ) || Object.create( null ) + )[ event.type ] || [], + special = jQuery.event.special[ event.type ] || {}; + + // Use the fix-ed jQuery.Event rather than the (read-only) native event + args[ 0 ] = event; + + for ( i = 1; i < arguments.length; i++ ) { + args[ i ] = arguments[ i ]; + } + + event.delegateTarget = this; + + // Call the preDispatch hook for the mapped type, and let it bail if desired + if ( special.preDispatch && special.preDispatch.call( this, event ) === false ) { + return; + } + + // Determine handlers + handlerQueue = jQuery.event.handlers.call( this, event, handlers ); + + // Run delegates first; they may want to stop propagation beneath us + i = 0; + while ( ( matched = handlerQueue[ i++ ] ) && !event.isPropagationStopped() ) { + event.currentTarget = matched.elem; + + j = 0; + while ( ( handleObj = matched.handlers[ j++ ] ) && + !event.isImmediatePropagationStopped() ) { + + // If the event is namespaced, then each handler is only invoked if it is + // specially universal or its namespaces are a superset of the event's. + if ( !event.rnamespace || handleObj.namespace === false || + event.rnamespace.test( handleObj.namespace ) ) { + + event.handleObj = handleObj; + event.data = handleObj.data; + + ret = ( ( jQuery.event.special[ handleObj.origType ] || {} ).handle || + handleObj.handler ).apply( matched.elem, args ); + + if ( ret !== undefined ) { + if ( ( event.result = ret ) === false ) { + event.preventDefault(); + event.stopPropagation(); + } + } + } + } + } + + // Call the postDispatch hook for the mapped type + if ( special.postDispatch ) { + special.postDispatch.call( this, event ); + } + + return event.result; + }, + + handlers: function( event, handlers ) { + var i, handleObj, sel, matchedHandlers, matchedSelectors, + handlerQueue = [], + delegateCount = handlers.delegateCount, + cur = event.target; + + // Find delegate handlers + if ( delegateCount && + + // Support: IE <=9 + // Black-hole SVG instance trees (trac-13180) + cur.nodeType && + + // Support: Firefox <=42 + // Suppress spec-violating clicks indicating a non-primary pointer button (trac-3861) + // https://www.w3.org/TR/DOM-Level-3-Events/#event-type-click + // Support: IE 11 only + // ...but not arrow key "clicks" of radio inputs, which can have `button` -1 (gh-2343) + !( event.type === "click" && event.button >= 1 ) ) { + + for ( ; cur !== this; cur = cur.parentNode || this ) { + + // Don't check non-elements (#13208) + // Don't process clicks on disabled elements (#6911, #8165, #11382, #11764) + if ( cur.nodeType === 1 && !( event.type === "click" && cur.disabled === true ) ) { + matchedHandlers = []; + matchedSelectors = {}; + for ( i = 0; i < delegateCount; i++ ) { + handleObj = handlers[ i ]; + + // Don't conflict with Object.prototype properties (#13203) + sel = handleObj.selector + " "; + + if ( matchedSelectors[ sel ] === undefined ) { + matchedSelectors[ sel ] = handleObj.needsContext ? + jQuery( sel, this ).index( cur ) > -1 : + jQuery.find( sel, this, null, [ cur ] ).length; + } + if ( matchedSelectors[ sel ] ) { + matchedHandlers.push( handleObj ); + } + } + if ( matchedHandlers.length ) { + handlerQueue.push( { elem: cur, handlers: matchedHandlers } ); + } + } + } + } + + // Add the remaining (directly-bound) handlers + cur = this; + if ( delegateCount < handlers.length ) { + handlerQueue.push( { elem: cur, handlers: handlers.slice( delegateCount ) } ); + } + + return handlerQueue; + }, + + addProp: function( name, hook ) { + Object.defineProperty( jQuery.Event.prototype, name, { + enumerable: true, + configurable: true, + + get: isFunction( hook ) ? + function() { + if ( this.originalEvent ) { + return hook( this.originalEvent ); + } + } : + function() { + if ( this.originalEvent ) { + return this.originalEvent[ name ]; + } + }, + + set: function( value ) { + Object.defineProperty( this, name, { + enumerable: true, + configurable: true, + writable: true, + value: value + } ); + } + } ); + }, + + fix: function( originalEvent ) { + return originalEvent[ jQuery.expando ] ? + originalEvent : + new jQuery.Event( originalEvent ); + }, + + special: { + load: { + + // Prevent triggered image.load events from bubbling to window.load + noBubble: true + }, + click: { + + // Utilize native event to ensure correct state for checkable inputs + setup: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Claim the first handler + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + // dataPriv.set( el, "click", ... ) + leverageNative( el, "click", returnTrue ); + } + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function( data ) { + + // For mutual compressibility with _default, replace `this` access with a local var. + // `|| data` is dead code meant only to preserve the variable through minification. + var el = this || data; + + // Force setup before triggering a click + if ( rcheckableType.test( el.type ) && + el.click && nodeName( el, "input" ) ) { + + leverageNative( el, "click" ); + } + + // Return non-false to allow normal event-path propagation + return true; + }, + + // For cross-browser consistency, suppress native .click() on links + // Also prevent it if we're currently inside a leveraged native-event stack + _default: function( event ) { + var target = event.target; + return rcheckableType.test( target.type ) && + target.click && nodeName( target, "input" ) && + dataPriv.get( target, "click" ) || + nodeName( target, "a" ); + } + }, + + beforeunload: { + postDispatch: function( event ) { + + // Support: Firefox 20+ + // Firefox doesn't alert if the returnValue field is not set. + if ( event.result !== undefined && event.originalEvent ) { + event.originalEvent.returnValue = event.result; + } + } + } + } +}; + +// Ensure the presence of an event listener that handles manually-triggered +// synthetic events by interrupting progress until reinvoked in response to +// *native* events that it fires directly, ensuring that state changes have +// already occurred before other listeners are invoked. +function leverageNative( el, type, expectSync ) { + + // Missing expectSync indicates a trigger call, which must force setup through jQuery.event.add + if ( !expectSync ) { + if ( dataPriv.get( el, type ) === undefined ) { + jQuery.event.add( el, type, returnTrue ); + } + return; + } + + // Register the controller as a special universal handler for all event namespaces + dataPriv.set( el, type, false ); + jQuery.event.add( el, type, { + namespace: false, + handler: function( event ) { + var notAsync, result, + saved = dataPriv.get( this, type ); + + if ( ( event.isTrigger & 1 ) && this[ type ] ) { + + // Interrupt processing of the outer synthetic .trigger()ed event + // Saved data should be false in such cases, but might be a leftover capture object + // from an async native handler (gh-4350) + if ( !saved.length ) { + + // Store arguments for use when handling the inner native event + // There will always be at least one argument (an event object), so this array + // will not be confused with a leftover capture object. + saved = slice.call( arguments ); + dataPriv.set( this, type, saved ); + + // Trigger the native event and capture its result + // Support: IE <=9 - 11+ + // focus() and blur() are asynchronous + notAsync = expectSync( this, type ); + this[ type ](); + result = dataPriv.get( this, type ); + if ( saved !== result || notAsync ) { + dataPriv.set( this, type, false ); + } else { + result = {}; + } + if ( saved !== result ) { + + // Cancel the outer synthetic event + event.stopImmediatePropagation(); + event.preventDefault(); + + // Support: Chrome 86+ + // In Chrome, if an element having a focusout handler is blurred by + // clicking outside of it, it invokes the handler synchronously. If + // that handler calls `.remove()` on the element, the data is cleared, + // leaving `result` undefined. We need to guard against this. + return result && result.value; + } + + // If this is an inner synthetic event for an event with a bubbling surrogate + // (focus or blur), assume that the surrogate already propagated from triggering the + // native event and prevent that from happening again here. + // This technically gets the ordering wrong w.r.t. to `.trigger()` (in which the + // bubbling surrogate propagates *after* the non-bubbling base), but that seems + // less bad than duplication. + } else if ( ( jQuery.event.special[ type ] || {} ).delegateType ) { + event.stopPropagation(); + } + + // If this is a native event triggered above, everything is now in order + // Fire an inner synthetic event with the original arguments + } else if ( saved.length ) { + + // ...and capture the result + dataPriv.set( this, type, { + value: jQuery.event.trigger( + + // Support: IE <=9 - 11+ + // Extend with the prototype to reset the above stopImmediatePropagation() + jQuery.extend( saved[ 0 ], jQuery.Event.prototype ), + saved.slice( 1 ), + this + ) + } ); + + // Abort handling of the native event + event.stopImmediatePropagation(); + } + } + } ); +} + +jQuery.removeEvent = function( elem, type, handle ) { + + // This "if" is needed for plain objects + if ( elem.removeEventListener ) { + elem.removeEventListener( type, handle ); + } +}; + +jQuery.Event = function( src, props ) { + + // Allow instantiation without the 'new' keyword + if ( !( this instanceof jQuery.Event ) ) { + return new jQuery.Event( src, props ); + } + + // Event object + if ( src && src.type ) { + this.originalEvent = src; + this.type = src.type; + + // Events bubbling up the document may have been marked as prevented + // by a handler lower down the tree; reflect the correct value. + this.isDefaultPrevented = src.defaultPrevented || + src.defaultPrevented === undefined && + + // Support: Android <=2.3 only + src.returnValue === false ? + returnTrue : + returnFalse; + + // Create target properties + // Support: Safari <=6 - 7 only + // Target should not be a text node (#504, #13143) + this.target = ( src.target && src.target.nodeType === 3 ) ? + src.target.parentNode : + src.target; + + this.currentTarget = src.currentTarget; + this.relatedTarget = src.relatedTarget; + + // Event type + } else { + this.type = src; + } + + // Put explicitly provided properties onto the event object + if ( props ) { + jQuery.extend( this, props ); + } + + // Create a timestamp if incoming event doesn't have one + this.timeStamp = src && src.timeStamp || Date.now(); + + // Mark it as fixed + this[ jQuery.expando ] = true; +}; + +// jQuery.Event is based on DOM3 Events as specified by the ECMAScript Language Binding +// https://www.w3.org/TR/2003/WD-DOM-Level-3-Events-20030331/ecma-script-binding.html +jQuery.Event.prototype = { + constructor: jQuery.Event, + isDefaultPrevented: returnFalse, + isPropagationStopped: returnFalse, + isImmediatePropagationStopped: returnFalse, + isSimulated: false, + + preventDefault: function() { + var e = this.originalEvent; + + this.isDefaultPrevented = returnTrue; + + if ( e && !this.isSimulated ) { + e.preventDefault(); + } + }, + stopPropagation: function() { + var e = this.originalEvent; + + this.isPropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopPropagation(); + } + }, + stopImmediatePropagation: function() { + var e = this.originalEvent; + + this.isImmediatePropagationStopped = returnTrue; + + if ( e && !this.isSimulated ) { + e.stopImmediatePropagation(); + } + + this.stopPropagation(); + } +}; + +// Includes all common event props including KeyEvent and MouseEvent specific props +jQuery.each( { + altKey: true, + bubbles: true, + cancelable: true, + changedTouches: true, + ctrlKey: true, + detail: true, + eventPhase: true, + metaKey: true, + pageX: true, + pageY: true, + shiftKey: true, + view: true, + "char": true, + code: true, + charCode: true, + key: true, + keyCode: true, + button: true, + buttons: true, + clientX: true, + clientY: true, + offsetX: true, + offsetY: true, + pointerId: true, + pointerType: true, + screenX: true, + screenY: true, + targetTouches: true, + toElement: true, + touches: true, + which: true +}, jQuery.event.addProp ); + +jQuery.each( { focus: "focusin", blur: "focusout" }, function( type, delegateType ) { + jQuery.event.special[ type ] = { + + // Utilize native event if possible so blur/focus sequence is correct + setup: function() { + + // Claim the first handler + // dataPriv.set( this, "focus", ... ) + // dataPriv.set( this, "blur", ... ) + leverageNative( this, type, expectSync ); + + // Return false to allow normal processing in the caller + return false; + }, + trigger: function() { + + // Force setup before trigger + leverageNative( this, type ); + + // Return non-false to allow normal event-path propagation + return true; + }, + + // Suppress native focus or blur as it's already being fired + // in leverageNative. + _default: function() { + return true; + }, + + delegateType: delegateType + }; +} ); + +// Create mouseenter/leave events using mouseover/out and event-time checks +// so that event delegation works in jQuery. +// Do the same for pointerenter/pointerleave and pointerover/pointerout +// +// Support: Safari 7 only +// Safari sends mouseenter too often; see: +// https://bugs.chromium.org/p/chromium/issues/detail?id=470258 +// for the description of the bug (it existed in older Chrome versions as well). +jQuery.each( { + mouseenter: "mouseover", + mouseleave: "mouseout", + pointerenter: "pointerover", + pointerleave: "pointerout" +}, function( orig, fix ) { + jQuery.event.special[ orig ] = { + delegateType: fix, + bindType: fix, + + handle: function( event ) { + var ret, + target = this, + related = event.relatedTarget, + handleObj = event.handleObj; + + // For mouseenter/leave call the handler if related is outside the target. + // NB: No relatedTarget if the mouse left/entered the browser window + if ( !related || ( related !== target && !jQuery.contains( target, related ) ) ) { + event.type = handleObj.origType; + ret = handleObj.handler.apply( this, arguments ); + event.type = fix; + } + return ret; + } + }; +} ); + +jQuery.fn.extend( { + + on: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn ); + }, + one: function( types, selector, data, fn ) { + return on( this, types, selector, data, fn, 1 ); + }, + off: function( types, selector, fn ) { + var handleObj, type; + if ( types && types.preventDefault && types.handleObj ) { + + // ( event ) dispatched jQuery.Event + handleObj = types.handleObj; + jQuery( types.delegateTarget ).off( + handleObj.namespace ? + handleObj.origType + "." + handleObj.namespace : + handleObj.origType, + handleObj.selector, + handleObj.handler + ); + return this; + } + if ( typeof types === "object" ) { + + // ( types-object [, selector] ) + for ( type in types ) { + this.off( type, selector, types[ type ] ); + } + return this; + } + if ( selector === false || typeof selector === "function" ) { + + // ( types [, fn] ) + fn = selector; + selector = undefined; + } + if ( fn === false ) { + fn = returnFalse; + } + return this.each( function() { + jQuery.event.remove( this, types, fn, selector ); + } ); + } +} ); + + +var + + // Support: IE <=10 - 11, Edge 12 - 13 only + // In IE/Edge using regex groups here causes severe slowdowns. + // See https://connect.microsoft.com/IE/feedback/details/1736512/ + rnoInnerhtml = /\s*$/g; + +// Prefer a tbody over its parent table for containing new rows +function manipulationTarget( elem, content ) { + if ( nodeName( elem, "table" ) && + nodeName( content.nodeType !== 11 ? content : content.firstChild, "tr" ) ) { + + return jQuery( elem ).children( "tbody" )[ 0 ] || elem; + } + + return elem; +} + +// Replace/restore the type attribute of script elements for safe DOM manipulation +function disableScript( elem ) { + elem.type = ( elem.getAttribute( "type" ) !== null ) + "/" + elem.type; + return elem; +} +function restoreScript( elem ) { + if ( ( elem.type || "" ).slice( 0, 5 ) === "true/" ) { + elem.type = elem.type.slice( 5 ); + } else { + elem.removeAttribute( "type" ); + } + + return elem; +} + +function cloneCopyEvent( src, dest ) { + var i, l, type, pdataOld, udataOld, udataCur, events; + + if ( dest.nodeType !== 1 ) { + return; + } + + // 1. Copy private data: events, handlers, etc. + if ( dataPriv.hasData( src ) ) { + pdataOld = dataPriv.get( src ); + events = pdataOld.events; + + if ( events ) { + dataPriv.remove( dest, "handle events" ); + + for ( type in events ) { + for ( i = 0, l = events[ type ].length; i < l; i++ ) { + jQuery.event.add( dest, type, events[ type ][ i ] ); + } + } + } + } + + // 2. Copy user data + if ( dataUser.hasData( src ) ) { + udataOld = dataUser.access( src ); + udataCur = jQuery.extend( {}, udataOld ); + + dataUser.set( dest, udataCur ); + } +} + +// Fix IE bugs, see support tests +function fixInput( src, dest ) { + var nodeName = dest.nodeName.toLowerCase(); + + // Fails to persist the checked state of a cloned checkbox or radio button. + if ( nodeName === "input" && rcheckableType.test( src.type ) ) { + dest.checked = src.checked; + + // Fails to return the selected option to the default selected state when cloning options + } else if ( nodeName === "input" || nodeName === "textarea" ) { + dest.defaultValue = src.defaultValue; + } +} + +function domManip( collection, args, callback, ignored ) { + + // Flatten any nested arrays + args = flat( args ); + + var fragment, first, scripts, hasScripts, node, doc, + i = 0, + l = collection.length, + iNoClone = l - 1, + value = args[ 0 ], + valueIsFunction = isFunction( value ); + + // We can't cloneNode fragments that contain checked, in WebKit + if ( valueIsFunction || + ( l > 1 && typeof value === "string" && + !support.checkClone && rchecked.test( value ) ) ) { + return collection.each( function( index ) { + var self = collection.eq( index ); + if ( valueIsFunction ) { + args[ 0 ] = value.call( this, index, self.html() ); + } + domManip( self, args, callback, ignored ); + } ); + } + + if ( l ) { + fragment = buildFragment( args, collection[ 0 ].ownerDocument, false, collection, ignored ); + first = fragment.firstChild; + + if ( fragment.childNodes.length === 1 ) { + fragment = first; + } + + // Require either new content or an interest in ignored elements to invoke the callback + if ( first || ignored ) { + scripts = jQuery.map( getAll( fragment, "script" ), disableScript ); + hasScripts = scripts.length; + + // Use the original fragment for the last item + // instead of the first because it can end up + // being emptied incorrectly in certain situations (#8070). + for ( ; i < l; i++ ) { + node = fragment; + + if ( i !== iNoClone ) { + node = jQuery.clone( node, true, true ); + + // Keep references to cloned scripts for later restoration + if ( hasScripts ) { + + // Support: Android <=4.0 only, PhantomJS 1 only + // push.apply(_, arraylike) throws on ancient WebKit + jQuery.merge( scripts, getAll( node, "script" ) ); + } + } + + callback.call( collection[ i ], node, i ); + } + + if ( hasScripts ) { + doc = scripts[ scripts.length - 1 ].ownerDocument; + + // Reenable scripts + jQuery.map( scripts, restoreScript ); + + // Evaluate executable scripts on first document insertion + for ( i = 0; i < hasScripts; i++ ) { + node = scripts[ i ]; + if ( rscriptType.test( node.type || "" ) && + !dataPriv.access( node, "globalEval" ) && + jQuery.contains( doc, node ) ) { + + if ( node.src && ( node.type || "" ).toLowerCase() !== "module" ) { + + // Optional AJAX dependency, but won't run scripts if not present + if ( jQuery._evalUrl && !node.noModule ) { + jQuery._evalUrl( node.src, { + nonce: node.nonce || node.getAttribute( "nonce" ) + }, doc ); + } + } else { + DOMEval( node.textContent.replace( rcleanScript, "" ), node, doc ); + } + } + } + } + } + } + + return collection; +} + +function remove( elem, selector, keepData ) { + var node, + nodes = selector ? jQuery.filter( selector, elem ) : elem, + i = 0; + + for ( ; ( node = nodes[ i ] ) != null; i++ ) { + if ( !keepData && node.nodeType === 1 ) { + jQuery.cleanData( getAll( node ) ); + } + + if ( node.parentNode ) { + if ( keepData && isAttached( node ) ) { + setGlobalEval( getAll( node, "script" ) ); + } + node.parentNode.removeChild( node ); + } + } + + return elem; +} + +jQuery.extend( { + htmlPrefilter: function( html ) { + return html; + }, + + clone: function( elem, dataAndEvents, deepDataAndEvents ) { + var i, l, srcElements, destElements, + clone = elem.cloneNode( true ), + inPage = isAttached( elem ); + + // Fix IE cloning issues + if ( !support.noCloneChecked && ( elem.nodeType === 1 || elem.nodeType === 11 ) && + !jQuery.isXMLDoc( elem ) ) { + + // We eschew Sizzle here for performance reasons: https://jsperf.com/getall-vs-sizzle/2 + destElements = getAll( clone ); + srcElements = getAll( elem ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + fixInput( srcElements[ i ], destElements[ i ] ); + } + } + + // Copy the events from the original to the clone + if ( dataAndEvents ) { + if ( deepDataAndEvents ) { + srcElements = srcElements || getAll( elem ); + destElements = destElements || getAll( clone ); + + for ( i = 0, l = srcElements.length; i < l; i++ ) { + cloneCopyEvent( srcElements[ i ], destElements[ i ] ); + } + } else { + cloneCopyEvent( elem, clone ); + } + } + + // Preserve script evaluation history + destElements = getAll( clone, "script" ); + if ( destElements.length > 0 ) { + setGlobalEval( destElements, !inPage && getAll( elem, "script" ) ); + } + + // Return the cloned set + return clone; + }, + + cleanData: function( elems ) { + var data, elem, type, + special = jQuery.event.special, + i = 0; + + for ( ; ( elem = elems[ i ] ) !== undefined; i++ ) { + if ( acceptData( elem ) ) { + if ( ( data = elem[ dataPriv.expando ] ) ) { + if ( data.events ) { + for ( type in data.events ) { + if ( special[ type ] ) { + jQuery.event.remove( elem, type ); + + // This is a shortcut to avoid jQuery.event.remove's overhead + } else { + jQuery.removeEvent( elem, type, data.handle ); + } + } + } + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataPriv.expando ] = undefined; + } + if ( elem[ dataUser.expando ] ) { + + // Support: Chrome <=35 - 45+ + // Assign undefined instead of using delete, see Data#remove + elem[ dataUser.expando ] = undefined; + } + } + } + } +} ); + +jQuery.fn.extend( { + detach: function( selector ) { + return remove( this, selector, true ); + }, + + remove: function( selector ) { + return remove( this, selector ); + }, + + text: function( value ) { + return access( this, function( value ) { + return value === undefined ? + jQuery.text( this ) : + this.empty().each( function() { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + this.textContent = value; + } + } ); + }, null, value, arguments.length ); + }, + + append: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.appendChild( elem ); + } + } ); + }, + + prepend: function() { + return domManip( this, arguments, function( elem ) { + if ( this.nodeType === 1 || this.nodeType === 11 || this.nodeType === 9 ) { + var target = manipulationTarget( this, elem ); + target.insertBefore( elem, target.firstChild ); + } + } ); + }, + + before: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this ); + } + } ); + }, + + after: function() { + return domManip( this, arguments, function( elem ) { + if ( this.parentNode ) { + this.parentNode.insertBefore( elem, this.nextSibling ); + } + } ); + }, + + empty: function() { + var elem, + i = 0; + + for ( ; ( elem = this[ i ] ) != null; i++ ) { + if ( elem.nodeType === 1 ) { + + // Prevent memory leaks + jQuery.cleanData( getAll( elem, false ) ); + + // Remove any remaining nodes + elem.textContent = ""; + } + } + + return this; + }, + + clone: function( dataAndEvents, deepDataAndEvents ) { + dataAndEvents = dataAndEvents == null ? false : dataAndEvents; + deepDataAndEvents = deepDataAndEvents == null ? dataAndEvents : deepDataAndEvents; + + return this.map( function() { + return jQuery.clone( this, dataAndEvents, deepDataAndEvents ); + } ); + }, + + html: function( value ) { + return access( this, function( value ) { + var elem = this[ 0 ] || {}, + i = 0, + l = this.length; + + if ( value === undefined && elem.nodeType === 1 ) { + return elem.innerHTML; + } + + // See if we can take a shortcut and just use innerHTML + if ( typeof value === "string" && !rnoInnerhtml.test( value ) && + !wrapMap[ ( rtagName.exec( value ) || [ "", "" ] )[ 1 ].toLowerCase() ] ) { + + value = jQuery.htmlPrefilter( value ); + + try { + for ( ; i < l; i++ ) { + elem = this[ i ] || {}; + + // Remove element nodes and prevent memory leaks + if ( elem.nodeType === 1 ) { + jQuery.cleanData( getAll( elem, false ) ); + elem.innerHTML = value; + } + } + + elem = 0; + + // If using innerHTML throws an exception, use the fallback method + } catch ( e ) {} + } + + if ( elem ) { + this.empty().append( value ); + } + }, null, value, arguments.length ); + }, + + replaceWith: function() { + var ignored = []; + + // Make the changes, replacing each non-ignored context element with the new content + return domManip( this, arguments, function( elem ) { + var parent = this.parentNode; + + if ( jQuery.inArray( this, ignored ) < 0 ) { + jQuery.cleanData( getAll( this ) ); + if ( parent ) { + parent.replaceChild( elem, this ); + } + } + + // Force callback invocation + }, ignored ); + } +} ); + +jQuery.each( { + appendTo: "append", + prependTo: "prepend", + insertBefore: "before", + insertAfter: "after", + replaceAll: "replaceWith" +}, function( name, original ) { + jQuery.fn[ name ] = function( selector ) { + var elems, + ret = [], + insert = jQuery( selector ), + last = insert.length - 1, + i = 0; + + for ( ; i <= last; i++ ) { + elems = i === last ? this : this.clone( true ); + jQuery( insert[ i ] )[ original ]( elems ); + + // Support: Android <=4.0 only, PhantomJS 1 only + // .get() because push.apply(_, arraylike) throws on ancient WebKit + push.apply( ret, elems.get() ); + } + + return this.pushStack( ret ); + }; +} ); +var rnumnonpx = new RegExp( "^(" + pnum + ")(?!px)[a-z%]+$", "i" ); + +var getStyles = function( elem ) { + + // Support: IE <=11 only, Firefox <=30 (#15098, #14150) + // IE throws on elements created in popups + // FF meanwhile throws on frame elements through "defaultView.getComputedStyle" + var view = elem.ownerDocument.defaultView; + + if ( !view || !view.opener ) { + view = window; + } + + return view.getComputedStyle( elem ); + }; + +var swap = function( elem, options, callback ) { + var ret, name, + old = {}; + + // Remember the old values, and insert the new ones + for ( name in options ) { + old[ name ] = elem.style[ name ]; + elem.style[ name ] = options[ name ]; + } + + ret = callback.call( elem ); + + // Revert the old values + for ( name in options ) { + elem.style[ name ] = old[ name ]; + } + + return ret; +}; + + +var rboxStyle = new RegExp( cssExpand.join( "|" ), "i" ); + + + +( function() { + + // Executing both pixelPosition & boxSizingReliable tests require only one layout + // so they're executed at the same time to save the second computation. + function computeStyleTests() { + + // This is a singleton, we need to execute it only once + if ( !div ) { + return; + } + + container.style.cssText = "position:absolute;left:-11111px;width:60px;" + + "margin-top:1px;padding:0;border:0"; + div.style.cssText = + "position:relative;display:block;box-sizing:border-box;overflow:scroll;" + + "margin:auto;border:1px;padding:1px;" + + "width:60%;top:1%"; + documentElement.appendChild( container ).appendChild( div ); + + var divStyle = window.getComputedStyle( div ); + pixelPositionVal = divStyle.top !== "1%"; + + // Support: Android 4.0 - 4.3 only, Firefox <=3 - 44 + reliableMarginLeftVal = roundPixelMeasures( divStyle.marginLeft ) === 12; + + // Support: Android 4.0 - 4.3 only, Safari <=9.1 - 10.1, iOS <=7.0 - 9.3 + // Some styles come back with percentage values, even though they shouldn't + div.style.right = "60%"; + pixelBoxStylesVal = roundPixelMeasures( divStyle.right ) === 36; + + // Support: IE 9 - 11 only + // Detect misreporting of content dimensions for box-sizing:border-box elements + boxSizingReliableVal = roundPixelMeasures( divStyle.width ) === 36; + + // Support: IE 9 only + // Detect overflow:scroll screwiness (gh-3699) + // Support: Chrome <=64 + // Don't get tricked when zoom affects offsetWidth (gh-4029) + div.style.position = "absolute"; + scrollboxSizeVal = roundPixelMeasures( div.offsetWidth / 3 ) === 12; + + documentElement.removeChild( container ); + + // Nullify the div so it wouldn't be stored in the memory and + // it will also be a sign that checks already performed + div = null; + } + + function roundPixelMeasures( measure ) { + return Math.round( parseFloat( measure ) ); + } + + var pixelPositionVal, boxSizingReliableVal, scrollboxSizeVal, pixelBoxStylesVal, + reliableTrDimensionsVal, reliableMarginLeftVal, + container = document.createElement( "div" ), + div = document.createElement( "div" ); + + // Finish early in limited (non-browser) environments + if ( !div.style ) { + return; + } + + // Support: IE <=9 - 11 only + // Style of cloned element affects source element cloned (#8908) + div.style.backgroundClip = "content-box"; + div.cloneNode( true ).style.backgroundClip = ""; + support.clearCloneStyle = div.style.backgroundClip === "content-box"; + + jQuery.extend( support, { + boxSizingReliable: function() { + computeStyleTests(); + return boxSizingReliableVal; + }, + pixelBoxStyles: function() { + computeStyleTests(); + return pixelBoxStylesVal; + }, + pixelPosition: function() { + computeStyleTests(); + return pixelPositionVal; + }, + reliableMarginLeft: function() { + computeStyleTests(); + return reliableMarginLeftVal; + }, + scrollboxSize: function() { + computeStyleTests(); + return scrollboxSizeVal; + }, + + // Support: IE 9 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Behavior in IE 9 is more subtle than in newer versions & it passes + // some versions of this test; make sure not to make it pass there! + // + // Support: Firefox 70+ + // Only Firefox includes border widths + // in computed dimensions. (gh-4529) + reliableTrDimensions: function() { + var table, tr, trChild, trStyle; + if ( reliableTrDimensionsVal == null ) { + table = document.createElement( "table" ); + tr = document.createElement( "tr" ); + trChild = document.createElement( "div" ); + + table.style.cssText = "position:absolute;left:-11111px;border-collapse:separate"; + tr.style.cssText = "border:1px solid"; + + // Support: Chrome 86+ + // Height set through cssText does not get applied. + // Computed height then comes back as 0. + tr.style.height = "1px"; + trChild.style.height = "9px"; + + // Support: Android 8 Chrome 86+ + // In our bodyBackground.html iframe, + // display for all div elements is set to "inline", + // which causes a problem only in Android 8 Chrome 86. + // Ensuring the div is display: block + // gets around this issue. + trChild.style.display = "block"; + + documentElement + .appendChild( table ) + .appendChild( tr ) + .appendChild( trChild ); + + trStyle = window.getComputedStyle( tr ); + reliableTrDimensionsVal = ( parseInt( trStyle.height, 10 ) + + parseInt( trStyle.borderTopWidth, 10 ) + + parseInt( trStyle.borderBottomWidth, 10 ) ) === tr.offsetHeight; + + documentElement.removeChild( table ); + } + return reliableTrDimensionsVal; + } + } ); +} )(); + + +function curCSS( elem, name, computed ) { + var width, minWidth, maxWidth, ret, + + // Support: Firefox 51+ + // Retrieving style before computed somehow + // fixes an issue with getting wrong values + // on detached elements + style = elem.style; + + computed = computed || getStyles( elem ); + + // getPropertyValue is needed for: + // .css('filter') (IE 9 only, #12537) + // .css('--customProperty) (#3144) + if ( computed ) { + ret = computed.getPropertyValue( name ) || computed[ name ]; + + if ( ret === "" && !isAttached( elem ) ) { + ret = jQuery.style( elem, name ); + } + + // A tribute to the "awesome hack by Dean Edwards" + // Android Browser returns percentage for some values, + // but width seems to be reliably pixels. + // This is against the CSSOM draft spec: + // https://drafts.csswg.org/cssom/#resolved-values + if ( !support.pixelBoxStyles() && rnumnonpx.test( ret ) && rboxStyle.test( name ) ) { + + // Remember the original values + width = style.width; + minWidth = style.minWidth; + maxWidth = style.maxWidth; + + // Put in the new values to get a computed value out + style.minWidth = style.maxWidth = style.width = ret; + ret = computed.width; + + // Revert the changed values + style.width = width; + style.minWidth = minWidth; + style.maxWidth = maxWidth; + } + } + + return ret !== undefined ? + + // Support: IE <=9 - 11 only + // IE returns zIndex value as an integer. + ret + "" : + ret; +} + + +function addGetHookIf( conditionFn, hookFn ) { + + // Define the hook, we'll check on the first run if it's really needed. + return { + get: function() { + if ( conditionFn() ) { + + // Hook not needed (or it's not possible to use it due + // to missing dependency), remove it. + delete this.get; + return; + } + + // Hook needed; redefine it so that the support test is not executed again. + return ( this.get = hookFn ).apply( this, arguments ); + } + }; +} + + +var cssPrefixes = [ "Webkit", "Moz", "ms" ], + emptyStyle = document.createElement( "div" ).style, + vendorProps = {}; + +// Return a vendor-prefixed property or undefined +function vendorPropName( name ) { + + // Check for vendor prefixed names + var capName = name[ 0 ].toUpperCase() + name.slice( 1 ), + i = cssPrefixes.length; + + while ( i-- ) { + name = cssPrefixes[ i ] + capName; + if ( name in emptyStyle ) { + return name; + } + } +} + +// Return a potentially-mapped jQuery.cssProps or vendor prefixed property +function finalPropName( name ) { + var final = jQuery.cssProps[ name ] || vendorProps[ name ]; + + if ( final ) { + return final; + } + if ( name in emptyStyle ) { + return name; + } + return vendorProps[ name ] = vendorPropName( name ) || name; +} + + +var + + // Swappable if display is none or starts with table + // except "table", "table-cell", or "table-caption" + // See here for display values: https://developer.mozilla.org/en-US/docs/CSS/display + rdisplayswap = /^(none|table(?!-c[ea]).+)/, + rcustomProp = /^--/, + cssShow = { position: "absolute", visibility: "hidden", display: "block" }, + cssNormalTransform = { + letterSpacing: "0", + fontWeight: "400" + }; + +function setPositiveNumber( _elem, value, subtract ) { + + // Any relative (+/-) values have already been + // normalized at this point + var matches = rcssNum.exec( value ); + return matches ? + + // Guard against undefined "subtract", e.g., when used as in cssHooks + Math.max( 0, matches[ 2 ] - ( subtract || 0 ) ) + ( matches[ 3 ] || "px" ) : + value; +} + +function boxModelAdjustment( elem, dimension, box, isBorderBox, styles, computedVal ) { + var i = dimension === "width" ? 1 : 0, + extra = 0, + delta = 0; + + // Adjustment may not be necessary + if ( box === ( isBorderBox ? "border" : "content" ) ) { + return 0; + } + + for ( ; i < 4; i += 2 ) { + + // Both box models exclude margin + if ( box === "margin" ) { + delta += jQuery.css( elem, box + cssExpand[ i ], true, styles ); + } + + // If we get here with a content-box, we're seeking "padding" or "border" or "margin" + if ( !isBorderBox ) { + + // Add padding + delta += jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + + // For "border" or "margin", add border + if ( box !== "padding" ) { + delta += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + + // But still keep track of it otherwise + } else { + extra += jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + + // If we get here with a border-box (content + padding + border), we're seeking "content" or + // "padding" or "margin" + } else { + + // For "content", subtract padding + if ( box === "content" ) { + delta -= jQuery.css( elem, "padding" + cssExpand[ i ], true, styles ); + } + + // For "content" or "padding", subtract border + if ( box !== "margin" ) { + delta -= jQuery.css( elem, "border" + cssExpand[ i ] + "Width", true, styles ); + } + } + } + + // Account for positive content-box scroll gutter when requested by providing computedVal + if ( !isBorderBox && computedVal >= 0 ) { + + // offsetWidth/offsetHeight is a rounded sum of content, padding, scroll gutter, and border + // Assuming integer scroll gutter, subtract the rest and round down + delta += Math.max( 0, Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + computedVal - + delta - + extra - + 0.5 + + // If offsetWidth/offsetHeight is unknown, then we can't determine content-box scroll gutter + // Use an explicit zero to avoid NaN (gh-3964) + ) ) || 0; + } + + return delta; +} + +function getWidthOrHeight( elem, dimension, extra ) { + + // Start with computed style + var styles = getStyles( elem ), + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-4322). + // Fake content-box until we know it's needed to know the true value. + boxSizingNeeded = !support.boxSizingReliable() || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + valueIsBorderBox = isBorderBox, + + val = curCSS( elem, dimension, styles ), + offsetProp = "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ); + + // Support: Firefox <=54 + // Return a confounding non-pixel value or feign ignorance, as appropriate. + if ( rnumnonpx.test( val ) ) { + if ( !extra ) { + return val; + } + val = "auto"; + } + + + // Support: IE 9 - 11 only + // Use offsetWidth/offsetHeight for when box sizing is unreliable. + // In those cases, the computed value can be trusted to be border-box. + if ( ( !support.boxSizingReliable() && isBorderBox || + + // Support: IE 10 - 11+, Edge 15 - 18+ + // IE/Edge misreport `getComputedStyle` of table rows with width/height + // set in CSS while `offset*` properties report correct values. + // Interestingly, in some cases IE 9 doesn't suffer from this issue. + !support.reliableTrDimensions() && nodeName( elem, "tr" ) || + + // Fall back to offsetWidth/offsetHeight when value is "auto" + // This happens for inline elements with no explicit setting (gh-3571) + val === "auto" || + + // Support: Android <=4.1 - 4.3 only + // Also use offsetWidth/offsetHeight for misreported inline dimensions (gh-3602) + !parseFloat( val ) && jQuery.css( elem, "display", false, styles ) === "inline" ) && + + // Make sure the element is visible & connected + elem.getClientRects().length ) { + + isBorderBox = jQuery.css( elem, "boxSizing", false, styles ) === "border-box"; + + // Where available, offsetWidth/offsetHeight approximate border box dimensions. + // Where not available (e.g., SVG), assume unreliable box-sizing and interpret the + // retrieved value as a content box dimension. + valueIsBorderBox = offsetProp in elem; + if ( valueIsBorderBox ) { + val = elem[ offsetProp ]; + } + } + + // Normalize "" and auto + val = parseFloat( val ) || 0; + + // Adjust for the element's box model + return ( val + + boxModelAdjustment( + elem, + dimension, + extra || ( isBorderBox ? "border" : "content" ), + valueIsBorderBox, + styles, + + // Provide the current computed size to request scroll gutter calculation (gh-3589) + val + ) + ) + "px"; +} + +jQuery.extend( { + + // Add in style property hooks for overriding the default + // behavior of getting and setting a style property + cssHooks: { + opacity: { + get: function( elem, computed ) { + if ( computed ) { + + // We should always get a number back from opacity + var ret = curCSS( elem, "opacity" ); + return ret === "" ? "1" : ret; + } + } + } + }, + + // Don't automatically add "px" to these possibly-unitless properties + cssNumber: { + "animationIterationCount": true, + "columnCount": true, + "fillOpacity": true, + "flexGrow": true, + "flexShrink": true, + "fontWeight": true, + "gridArea": true, + "gridColumn": true, + "gridColumnEnd": true, + "gridColumnStart": true, + "gridRow": true, + "gridRowEnd": true, + "gridRowStart": true, + "lineHeight": true, + "opacity": true, + "order": true, + "orphans": true, + "widows": true, + "zIndex": true, + "zoom": true + }, + + // Add in properties whose names you wish to fix before + // setting or getting the value + cssProps: {}, + + // Get and set the style property on a DOM Node + style: function( elem, name, value, extra ) { + + // Don't set styles on text and comment nodes + if ( !elem || elem.nodeType === 3 || elem.nodeType === 8 || !elem.style ) { + return; + } + + // Make sure that we're working with the right name + var ret, type, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ), + style = elem.style; + + // Make sure that we're working with the right name. We don't + // want to query the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Gets hook for the prefixed version, then unprefixed version + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // Check if we're setting a value + if ( value !== undefined ) { + type = typeof value; + + // Convert "+=" or "-=" to relative numbers (#7345) + if ( type === "string" && ( ret = rcssNum.exec( value ) ) && ret[ 1 ] ) { + value = adjustCSS( elem, name, ret ); + + // Fixes bug #9237 + type = "number"; + } + + // Make sure that null and NaN values aren't set (#7116) + if ( value == null || value !== value ) { + return; + } + + // If a number was passed in, add the unit (except for certain CSS properties) + // The isCustomProp check can be removed in jQuery 4.0 when we only auto-append + // "px" to a few hardcoded values. + if ( type === "number" && !isCustomProp ) { + value += ret && ret[ 3 ] || ( jQuery.cssNumber[ origName ] ? "" : "px" ); + } + + // background-* props affect original clone's values + if ( !support.clearCloneStyle && value === "" && name.indexOf( "background" ) === 0 ) { + style[ name ] = "inherit"; + } + + // If a hook was provided, use that value, otherwise just set the specified value + if ( !hooks || !( "set" in hooks ) || + ( value = hooks.set( elem, value, extra ) ) !== undefined ) { + + if ( isCustomProp ) { + style.setProperty( name, value ); + } else { + style[ name ] = value; + } + } + + } else { + + // If a hook was provided get the non-computed value from there + if ( hooks && "get" in hooks && + ( ret = hooks.get( elem, false, extra ) ) !== undefined ) { + + return ret; + } + + // Otherwise just get the value from the style object + return style[ name ]; + } + }, + + css: function( elem, name, extra, styles ) { + var val, num, hooks, + origName = camelCase( name ), + isCustomProp = rcustomProp.test( name ); + + // Make sure that we're working with the right name. We don't + // want to modify the value if it is a CSS custom property + // since they are user-defined. + if ( !isCustomProp ) { + name = finalPropName( origName ); + } + + // Try prefixed name followed by the unprefixed name + hooks = jQuery.cssHooks[ name ] || jQuery.cssHooks[ origName ]; + + // If a hook was provided get the computed value from there + if ( hooks && "get" in hooks ) { + val = hooks.get( elem, true, extra ); + } + + // Otherwise, if a way to get the computed value exists, use that + if ( val === undefined ) { + val = curCSS( elem, name, styles ); + } + + // Convert "normal" to computed value + if ( val === "normal" && name in cssNormalTransform ) { + val = cssNormalTransform[ name ]; + } + + // Make numeric if forced or a qualifier was provided and val looks numeric + if ( extra === "" || extra ) { + num = parseFloat( val ); + return extra === true || isFinite( num ) ? num || 0 : val; + } + + return val; + } +} ); + +jQuery.each( [ "height", "width" ], function( _i, dimension ) { + jQuery.cssHooks[ dimension ] = { + get: function( elem, computed, extra ) { + if ( computed ) { + + // Certain elements can have dimension info if we invisibly show them + // but it must have a current display style that would benefit + return rdisplayswap.test( jQuery.css( elem, "display" ) ) && + + // Support: Safari 8+ + // Table columns in Safari have non-zero offsetWidth & zero + // getBoundingClientRect().width unless display is changed. + // Support: IE <=11 only + // Running getBoundingClientRect on a disconnected node + // in IE throws an error. + ( !elem.getClientRects().length || !elem.getBoundingClientRect().width ) ? + swap( elem, cssShow, function() { + return getWidthOrHeight( elem, dimension, extra ); + } ) : + getWidthOrHeight( elem, dimension, extra ); + } + }, + + set: function( elem, value, extra ) { + var matches, + styles = getStyles( elem ), + + // Only read styles.position if the test has a chance to fail + // to avoid forcing a reflow. + scrollboxSizeBuggy = !support.scrollboxSize() && + styles.position === "absolute", + + // To avoid forcing a reflow, only fetch boxSizing if we need it (gh-3991) + boxSizingNeeded = scrollboxSizeBuggy || extra, + isBorderBox = boxSizingNeeded && + jQuery.css( elem, "boxSizing", false, styles ) === "border-box", + subtract = extra ? + boxModelAdjustment( + elem, + dimension, + extra, + isBorderBox, + styles + ) : + 0; + + // Account for unreliable border-box dimensions by comparing offset* to computed and + // faking a content-box to get border and padding (gh-3699) + if ( isBorderBox && scrollboxSizeBuggy ) { + subtract -= Math.ceil( + elem[ "offset" + dimension[ 0 ].toUpperCase() + dimension.slice( 1 ) ] - + parseFloat( styles[ dimension ] ) - + boxModelAdjustment( elem, dimension, "border", false, styles ) - + 0.5 + ); + } + + // Convert to pixels if value adjustment is needed + if ( subtract && ( matches = rcssNum.exec( value ) ) && + ( matches[ 3 ] || "px" ) !== "px" ) { + + elem.style[ dimension ] = value; + value = jQuery.css( elem, dimension ); + } + + return setPositiveNumber( elem, value, subtract ); + } + }; +} ); + +jQuery.cssHooks.marginLeft = addGetHookIf( support.reliableMarginLeft, + function( elem, computed ) { + if ( computed ) { + return ( parseFloat( curCSS( elem, "marginLeft" ) ) || + elem.getBoundingClientRect().left - + swap( elem, { marginLeft: 0 }, function() { + return elem.getBoundingClientRect().left; + } ) + ) + "px"; + } + } +); + +// These hooks are used by animate to expand properties +jQuery.each( { + margin: "", + padding: "", + border: "Width" +}, function( prefix, suffix ) { + jQuery.cssHooks[ prefix + suffix ] = { + expand: function( value ) { + var i = 0, + expanded = {}, + + // Assumes a single number if not a string + parts = typeof value === "string" ? value.split( " " ) : [ value ]; + + for ( ; i < 4; i++ ) { + expanded[ prefix + cssExpand[ i ] + suffix ] = + parts[ i ] || parts[ i - 2 ] || parts[ 0 ]; + } + + return expanded; + } + }; + + if ( prefix !== "margin" ) { + jQuery.cssHooks[ prefix + suffix ].set = setPositiveNumber; + } +} ); + +jQuery.fn.extend( { + css: function( name, value ) { + return access( this, function( elem, name, value ) { + var styles, len, + map = {}, + i = 0; + + if ( Array.isArray( name ) ) { + styles = getStyles( elem ); + len = name.length; + + for ( ; i < len; i++ ) { + map[ name[ i ] ] = jQuery.css( elem, name[ i ], false, styles ); + } + + return map; + } + + return value !== undefined ? + jQuery.style( elem, name, value ) : + jQuery.css( elem, name ); + }, name, value, arguments.length > 1 ); + } +} ); + + +function Tween( elem, options, prop, end, easing ) { + return new Tween.prototype.init( elem, options, prop, end, easing ); +} +jQuery.Tween = Tween; + +Tween.prototype = { + constructor: Tween, + init: function( elem, options, prop, end, easing, unit ) { + this.elem = elem; + this.prop = prop; + this.easing = easing || jQuery.easing._default; + this.options = options; + this.start = this.now = this.cur(); + this.end = end; + this.unit = unit || ( jQuery.cssNumber[ prop ] ? "" : "px" ); + }, + cur: function() { + var hooks = Tween.propHooks[ this.prop ]; + + return hooks && hooks.get ? + hooks.get( this ) : + Tween.propHooks._default.get( this ); + }, + run: function( percent ) { + var eased, + hooks = Tween.propHooks[ this.prop ]; + + if ( this.options.duration ) { + this.pos = eased = jQuery.easing[ this.easing ]( + percent, this.options.duration * percent, 0, 1, this.options.duration + ); + } else { + this.pos = eased = percent; + } + this.now = ( this.end - this.start ) * eased + this.start; + + if ( this.options.step ) { + this.options.step.call( this.elem, this.now, this ); + } + + if ( hooks && hooks.set ) { + hooks.set( this ); + } else { + Tween.propHooks._default.set( this ); + } + return this; + } +}; + +Tween.prototype.init.prototype = Tween.prototype; + +Tween.propHooks = { + _default: { + get: function( tween ) { + var result; + + // Use a property on the element directly when it is not a DOM element, + // or when there is no matching style property that exists. + if ( tween.elem.nodeType !== 1 || + tween.elem[ tween.prop ] != null && tween.elem.style[ tween.prop ] == null ) { + return tween.elem[ tween.prop ]; + } + + // Passing an empty string as a 3rd parameter to .css will automatically + // attempt a parseFloat and fallback to a string if the parse fails. + // Simple values such as "10px" are parsed to Float; + // complex values such as "rotate(1rad)" are returned as-is. + result = jQuery.css( tween.elem, tween.prop, "" ); + + // Empty strings, null, undefined and "auto" are converted to 0. + return !result || result === "auto" ? 0 : result; + }, + set: function( tween ) { + + // Use step hook for back compat. + // Use cssHook if its there. + // Use .style if available and use plain properties where available. + if ( jQuery.fx.step[ tween.prop ] ) { + jQuery.fx.step[ tween.prop ]( tween ); + } else if ( tween.elem.nodeType === 1 && ( + jQuery.cssHooks[ tween.prop ] || + tween.elem.style[ finalPropName( tween.prop ) ] != null ) ) { + jQuery.style( tween.elem, tween.prop, tween.now + tween.unit ); + } else { + tween.elem[ tween.prop ] = tween.now; + } + } + } +}; + +// Support: IE <=9 only +// Panic based approach to setting things on disconnected nodes +Tween.propHooks.scrollTop = Tween.propHooks.scrollLeft = { + set: function( tween ) { + if ( tween.elem.nodeType && tween.elem.parentNode ) { + tween.elem[ tween.prop ] = tween.now; + } + } +}; + +jQuery.easing = { + linear: function( p ) { + return p; + }, + swing: function( p ) { + return 0.5 - Math.cos( p * Math.PI ) / 2; + }, + _default: "swing" +}; + +jQuery.fx = Tween.prototype.init; + +// Back compat <1.8 extension point +jQuery.fx.step = {}; + + + + +var + fxNow, inProgress, + rfxtypes = /^(?:toggle|show|hide)$/, + rrun = /queueHooks$/; + +function schedule() { + if ( inProgress ) { + if ( document.hidden === false && window.requestAnimationFrame ) { + window.requestAnimationFrame( schedule ); + } else { + window.setTimeout( schedule, jQuery.fx.interval ); + } + + jQuery.fx.tick(); + } +} + +// Animations created synchronously will run synchronously +function createFxNow() { + window.setTimeout( function() { + fxNow = undefined; + } ); + return ( fxNow = Date.now() ); +} + +// Generate parameters to create a standard animation +function genFx( type, includeWidth ) { + var which, + i = 0, + attrs = { height: type }; + + // If we include width, step value is 1 to do all cssExpand values, + // otherwise step value is 2 to skip over Left and Right + includeWidth = includeWidth ? 1 : 0; + for ( ; i < 4; i += 2 - includeWidth ) { + which = cssExpand[ i ]; + attrs[ "margin" + which ] = attrs[ "padding" + which ] = type; + } + + if ( includeWidth ) { + attrs.opacity = attrs.width = type; + } + + return attrs; +} + +function createTween( value, prop, animation ) { + var tween, + collection = ( Animation.tweeners[ prop ] || [] ).concat( Animation.tweeners[ "*" ] ), + index = 0, + length = collection.length; + for ( ; index < length; index++ ) { + if ( ( tween = collection[ index ].call( animation, prop, value ) ) ) { + + // We're done with this property + return tween; + } + } +} + +function defaultPrefilter( elem, props, opts ) { + var prop, value, toggle, hooks, oldfire, propTween, restoreDisplay, display, + isBox = "width" in props || "height" in props, + anim = this, + orig = {}, + style = elem.style, + hidden = elem.nodeType && isHiddenWithinTree( elem ), + dataShow = dataPriv.get( elem, "fxshow" ); + + // Queue-skipping animations hijack the fx hooks + if ( !opts.queue ) { + hooks = jQuery._queueHooks( elem, "fx" ); + if ( hooks.unqueued == null ) { + hooks.unqueued = 0; + oldfire = hooks.empty.fire; + hooks.empty.fire = function() { + if ( !hooks.unqueued ) { + oldfire(); + } + }; + } + hooks.unqueued++; + + anim.always( function() { + + // Ensure the complete handler is called before this completes + anim.always( function() { + hooks.unqueued--; + if ( !jQuery.queue( elem, "fx" ).length ) { + hooks.empty.fire(); + } + } ); + } ); + } + + // Detect show/hide animations + for ( prop in props ) { + value = props[ prop ]; + if ( rfxtypes.test( value ) ) { + delete props[ prop ]; + toggle = toggle || value === "toggle"; + if ( value === ( hidden ? "hide" : "show" ) ) { + + // Pretend to be hidden if this is a "show" and + // there is still data from a stopped show/hide + if ( value === "show" && dataShow && dataShow[ prop ] !== undefined ) { + hidden = true; + + // Ignore all other no-op show/hide data + } else { + continue; + } + } + orig[ prop ] = dataShow && dataShow[ prop ] || jQuery.style( elem, prop ); + } + } + + // Bail out if this is a no-op like .hide().hide() + propTween = !jQuery.isEmptyObject( props ); + if ( !propTween && jQuery.isEmptyObject( orig ) ) { + return; + } + + // Restrict "overflow" and "display" styles during box animations + if ( isBox && elem.nodeType === 1 ) { + + // Support: IE <=9 - 11, Edge 12 - 15 + // Record all 3 overflow attributes because IE does not infer the shorthand + // from identically-valued overflowX and overflowY and Edge just mirrors + // the overflowX value there. + opts.overflow = [ style.overflow, style.overflowX, style.overflowY ]; + + // Identify a display type, preferring old show/hide data over the CSS cascade + restoreDisplay = dataShow && dataShow.display; + if ( restoreDisplay == null ) { + restoreDisplay = dataPriv.get( elem, "display" ); + } + display = jQuery.css( elem, "display" ); + if ( display === "none" ) { + if ( restoreDisplay ) { + display = restoreDisplay; + } else { + + // Get nonempty value(s) by temporarily forcing visibility + showHide( [ elem ], true ); + restoreDisplay = elem.style.display || restoreDisplay; + display = jQuery.css( elem, "display" ); + showHide( [ elem ] ); + } + } + + // Animate inline elements as inline-block + if ( display === "inline" || display === "inline-block" && restoreDisplay != null ) { + if ( jQuery.css( elem, "float" ) === "none" ) { + + // Restore the original display value at the end of pure show/hide animations + if ( !propTween ) { + anim.done( function() { + style.display = restoreDisplay; + } ); + if ( restoreDisplay == null ) { + display = style.display; + restoreDisplay = display === "none" ? "" : display; + } + } + style.display = "inline-block"; + } + } + } + + if ( opts.overflow ) { + style.overflow = "hidden"; + anim.always( function() { + style.overflow = opts.overflow[ 0 ]; + style.overflowX = opts.overflow[ 1 ]; + style.overflowY = opts.overflow[ 2 ]; + } ); + } + + // Implement show/hide animations + propTween = false; + for ( prop in orig ) { + + // General show/hide setup for this element animation + if ( !propTween ) { + if ( dataShow ) { + if ( "hidden" in dataShow ) { + hidden = dataShow.hidden; + } + } else { + dataShow = dataPriv.access( elem, "fxshow", { display: restoreDisplay } ); + } + + // Store hidden/visible for toggle so `.stop().toggle()` "reverses" + if ( toggle ) { + dataShow.hidden = !hidden; + } + + // Show elements before animating them + if ( hidden ) { + showHide( [ elem ], true ); + } + + /* eslint-disable no-loop-func */ + + anim.done( function() { + + /* eslint-enable no-loop-func */ + + // The final step of a "hide" animation is actually hiding the element + if ( !hidden ) { + showHide( [ elem ] ); + } + dataPriv.remove( elem, "fxshow" ); + for ( prop in orig ) { + jQuery.style( elem, prop, orig[ prop ] ); + } + } ); + } + + // Per-property setup + propTween = createTween( hidden ? dataShow[ prop ] : 0, prop, anim ); + if ( !( prop in dataShow ) ) { + dataShow[ prop ] = propTween.start; + if ( hidden ) { + propTween.end = propTween.start; + propTween.start = 0; + } + } + } +} + +function propFilter( props, specialEasing ) { + var index, name, easing, value, hooks; + + // camelCase, specialEasing and expand cssHook pass + for ( index in props ) { + name = camelCase( index ); + easing = specialEasing[ name ]; + value = props[ index ]; + if ( Array.isArray( value ) ) { + easing = value[ 1 ]; + value = props[ index ] = value[ 0 ]; + } + + if ( index !== name ) { + props[ name ] = value; + delete props[ index ]; + } + + hooks = jQuery.cssHooks[ name ]; + if ( hooks && "expand" in hooks ) { + value = hooks.expand( value ); + delete props[ name ]; + + // Not quite $.extend, this won't overwrite existing keys. + // Reusing 'index' because we have the correct "name" + for ( index in value ) { + if ( !( index in props ) ) { + props[ index ] = value[ index ]; + specialEasing[ index ] = easing; + } + } + } else { + specialEasing[ name ] = easing; + } + } +} + +function Animation( elem, properties, options ) { + var result, + stopped, + index = 0, + length = Animation.prefilters.length, + deferred = jQuery.Deferred().always( function() { + + // Don't match elem in the :animated selector + delete tick.elem; + } ), + tick = function() { + if ( stopped ) { + return false; + } + var currentTime = fxNow || createFxNow(), + remaining = Math.max( 0, animation.startTime + animation.duration - currentTime ), + + // Support: Android 2.3 only + // Archaic crash bug won't allow us to use `1 - ( 0.5 || 0 )` (#12497) + temp = remaining / animation.duration || 0, + percent = 1 - temp, + index = 0, + length = animation.tweens.length; + + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( percent ); + } + + deferred.notifyWith( elem, [ animation, percent, remaining ] ); + + // If there's more to do, yield + if ( percent < 1 && length ) { + return remaining; + } + + // If this was an empty animation, synthesize a final progress notification + if ( !length ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + } + + // Resolve the animation and report its conclusion + deferred.resolveWith( elem, [ animation ] ); + return false; + }, + animation = deferred.promise( { + elem: elem, + props: jQuery.extend( {}, properties ), + opts: jQuery.extend( true, { + specialEasing: {}, + easing: jQuery.easing._default + }, options ), + originalProperties: properties, + originalOptions: options, + startTime: fxNow || createFxNow(), + duration: options.duration, + tweens: [], + createTween: function( prop, end ) { + var tween = jQuery.Tween( elem, animation.opts, prop, end, + animation.opts.specialEasing[ prop ] || animation.opts.easing ); + animation.tweens.push( tween ); + return tween; + }, + stop: function( gotoEnd ) { + var index = 0, + + // If we are going to the end, we want to run all the tweens + // otherwise we skip this part + length = gotoEnd ? animation.tweens.length : 0; + if ( stopped ) { + return this; + } + stopped = true; + for ( ; index < length; index++ ) { + animation.tweens[ index ].run( 1 ); + } + + // Resolve when we played the last frame; otherwise, reject + if ( gotoEnd ) { + deferred.notifyWith( elem, [ animation, 1, 0 ] ); + deferred.resolveWith( elem, [ animation, gotoEnd ] ); + } else { + deferred.rejectWith( elem, [ animation, gotoEnd ] ); + } + return this; + } + } ), + props = animation.props; + + propFilter( props, animation.opts.specialEasing ); + + for ( ; index < length; index++ ) { + result = Animation.prefilters[ index ].call( animation, elem, props, animation.opts ); + if ( result ) { + if ( isFunction( result.stop ) ) { + jQuery._queueHooks( animation.elem, animation.opts.queue ).stop = + result.stop.bind( result ); + } + return result; + } + } + + jQuery.map( props, createTween, animation ); + + if ( isFunction( animation.opts.start ) ) { + animation.opts.start.call( elem, animation ); + } + + // Attach callbacks from options + animation + .progress( animation.opts.progress ) + .done( animation.opts.done, animation.opts.complete ) + .fail( animation.opts.fail ) + .always( animation.opts.always ); + + jQuery.fx.timer( + jQuery.extend( tick, { + elem: elem, + anim: animation, + queue: animation.opts.queue + } ) + ); + + return animation; +} + +jQuery.Animation = jQuery.extend( Animation, { + + tweeners: { + "*": [ function( prop, value ) { + var tween = this.createTween( prop, value ); + adjustCSS( tween.elem, prop, rcssNum.exec( value ), tween ); + return tween; + } ] + }, + + tweener: function( props, callback ) { + if ( isFunction( props ) ) { + callback = props; + props = [ "*" ]; + } else { + props = props.match( rnothtmlwhite ); + } + + var prop, + index = 0, + length = props.length; + + for ( ; index < length; index++ ) { + prop = props[ index ]; + Animation.tweeners[ prop ] = Animation.tweeners[ prop ] || []; + Animation.tweeners[ prop ].unshift( callback ); + } + }, + + prefilters: [ defaultPrefilter ], + + prefilter: function( callback, prepend ) { + if ( prepend ) { + Animation.prefilters.unshift( callback ); + } else { + Animation.prefilters.push( callback ); + } + } +} ); + +jQuery.speed = function( speed, easing, fn ) { + var opt = speed && typeof speed === "object" ? jQuery.extend( {}, speed ) : { + complete: fn || !fn && easing || + isFunction( speed ) && speed, + duration: speed, + easing: fn && easing || easing && !isFunction( easing ) && easing + }; + + // Go to the end state if fx are off + if ( jQuery.fx.off ) { + opt.duration = 0; + + } else { + if ( typeof opt.duration !== "number" ) { + if ( opt.duration in jQuery.fx.speeds ) { + opt.duration = jQuery.fx.speeds[ opt.duration ]; + + } else { + opt.duration = jQuery.fx.speeds._default; + } + } + } + + // Normalize opt.queue - true/undefined/null -> "fx" + if ( opt.queue == null || opt.queue === true ) { + opt.queue = "fx"; + } + + // Queueing + opt.old = opt.complete; + + opt.complete = function() { + if ( isFunction( opt.old ) ) { + opt.old.call( this ); + } + + if ( opt.queue ) { + jQuery.dequeue( this, opt.queue ); + } + }; + + return opt; +}; + +jQuery.fn.extend( { + fadeTo: function( speed, to, easing, callback ) { + + // Show any hidden elements after setting opacity to 0 + return this.filter( isHiddenWithinTree ).css( "opacity", 0 ).show() + + // Animate to the value specified + .end().animate( { opacity: to }, speed, easing, callback ); + }, + animate: function( prop, speed, easing, callback ) { + var empty = jQuery.isEmptyObject( prop ), + optall = jQuery.speed( speed, easing, callback ), + doAnimation = function() { + + // Operate on a copy of prop so per-property easing won't be lost + var anim = Animation( this, jQuery.extend( {}, prop ), optall ); + + // Empty animations, or finishing resolves immediately + if ( empty || dataPriv.get( this, "finish" ) ) { + anim.stop( true ); + } + }; + + doAnimation.finish = doAnimation; + + return empty || optall.queue === false ? + this.each( doAnimation ) : + this.queue( optall.queue, doAnimation ); + }, + stop: function( type, clearQueue, gotoEnd ) { + var stopQueue = function( hooks ) { + var stop = hooks.stop; + delete hooks.stop; + stop( gotoEnd ); + }; + + if ( typeof type !== "string" ) { + gotoEnd = clearQueue; + clearQueue = type; + type = undefined; + } + if ( clearQueue ) { + this.queue( type || "fx", [] ); + } + + return this.each( function() { + var dequeue = true, + index = type != null && type + "queueHooks", + timers = jQuery.timers, + data = dataPriv.get( this ); + + if ( index ) { + if ( data[ index ] && data[ index ].stop ) { + stopQueue( data[ index ] ); + } + } else { + for ( index in data ) { + if ( data[ index ] && data[ index ].stop && rrun.test( index ) ) { + stopQueue( data[ index ] ); + } + } + } + + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && + ( type == null || timers[ index ].queue === type ) ) { + + timers[ index ].anim.stop( gotoEnd ); + dequeue = false; + timers.splice( index, 1 ); + } + } + + // Start the next in the queue if the last step wasn't forced. + // Timers currently will call their complete callbacks, which + // will dequeue but only if they were gotoEnd. + if ( dequeue || !gotoEnd ) { + jQuery.dequeue( this, type ); + } + } ); + }, + finish: function( type ) { + if ( type !== false ) { + type = type || "fx"; + } + return this.each( function() { + var index, + data = dataPriv.get( this ), + queue = data[ type + "queue" ], + hooks = data[ type + "queueHooks" ], + timers = jQuery.timers, + length = queue ? queue.length : 0; + + // Enable finishing flag on private data + data.finish = true; + + // Empty the queue first + jQuery.queue( this, type, [] ); + + if ( hooks && hooks.stop ) { + hooks.stop.call( this, true ); + } + + // Look for any active animations, and finish them + for ( index = timers.length; index--; ) { + if ( timers[ index ].elem === this && timers[ index ].queue === type ) { + timers[ index ].anim.stop( true ); + timers.splice( index, 1 ); + } + } + + // Look for any animations in the old queue and finish them + for ( index = 0; index < length; index++ ) { + if ( queue[ index ] && queue[ index ].finish ) { + queue[ index ].finish.call( this ); + } + } + + // Turn off finishing flag + delete data.finish; + } ); + } +} ); + +jQuery.each( [ "toggle", "show", "hide" ], function( _i, name ) { + var cssFn = jQuery.fn[ name ]; + jQuery.fn[ name ] = function( speed, easing, callback ) { + return speed == null || typeof speed === "boolean" ? + cssFn.apply( this, arguments ) : + this.animate( genFx( name, true ), speed, easing, callback ); + }; +} ); + +// Generate shortcuts for custom animations +jQuery.each( { + slideDown: genFx( "show" ), + slideUp: genFx( "hide" ), + slideToggle: genFx( "toggle" ), + fadeIn: { opacity: "show" }, + fadeOut: { opacity: "hide" }, + fadeToggle: { opacity: "toggle" } +}, function( name, props ) { + jQuery.fn[ name ] = function( speed, easing, callback ) { + return this.animate( props, speed, easing, callback ); + }; +} ); + +jQuery.timers = []; +jQuery.fx.tick = function() { + var timer, + i = 0, + timers = jQuery.timers; + + fxNow = Date.now(); + + for ( ; i < timers.length; i++ ) { + timer = timers[ i ]; + + // Run the timer and safely remove it when done (allowing for external removal) + if ( !timer() && timers[ i ] === timer ) { + timers.splice( i--, 1 ); + } + } + + if ( !timers.length ) { + jQuery.fx.stop(); + } + fxNow = undefined; +}; + +jQuery.fx.timer = function( timer ) { + jQuery.timers.push( timer ); + jQuery.fx.start(); +}; + +jQuery.fx.interval = 13; +jQuery.fx.start = function() { + if ( inProgress ) { + return; + } + + inProgress = true; + schedule(); +}; + +jQuery.fx.stop = function() { + inProgress = null; +}; + +jQuery.fx.speeds = { + slow: 600, + fast: 200, + + // Default speed + _default: 400 +}; + + +// Based off of the plugin by Clint Helfers, with permission. +// https://web.archive.org/web/20100324014747/http://blindsignals.com/index.php/2009/07/jquery-delay/ +jQuery.fn.delay = function( time, type ) { + time = jQuery.fx ? jQuery.fx.speeds[ time ] || time : time; + type = type || "fx"; + + return this.queue( type, function( next, hooks ) { + var timeout = window.setTimeout( next, time ); + hooks.stop = function() { + window.clearTimeout( timeout ); + }; + } ); +}; + + +( function() { + var input = document.createElement( "input" ), + select = document.createElement( "select" ), + opt = select.appendChild( document.createElement( "option" ) ); + + input.type = "checkbox"; + + // Support: Android <=4.3 only + // Default value for a checkbox should be "on" + support.checkOn = input.value !== ""; + + // Support: IE <=11 only + // Must access selectedIndex to make default options select + support.optSelected = opt.selected; + + // Support: IE <=11 only + // An input loses its value after becoming a radio + input = document.createElement( "input" ); + input.value = "t"; + input.type = "radio"; + support.radioValue = input.value === "t"; +} )(); + + +var boolHook, + attrHandle = jQuery.expr.attrHandle; + +jQuery.fn.extend( { + attr: function( name, value ) { + return access( this, jQuery.attr, name, value, arguments.length > 1 ); + }, + + removeAttr: function( name ) { + return this.each( function() { + jQuery.removeAttr( this, name ); + } ); + } +} ); + +jQuery.extend( { + attr: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set attributes on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + // Fallback to prop when attributes are not supported + if ( typeof elem.getAttribute === "undefined" ) { + return jQuery.prop( elem, name, value ); + } + + // Attribute hooks are determined by the lowercase version + // Grab necessary hook if one is defined + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + hooks = jQuery.attrHooks[ name.toLowerCase() ] || + ( jQuery.expr.match.bool.test( name ) ? boolHook : undefined ); + } + + if ( value !== undefined ) { + if ( value === null ) { + jQuery.removeAttr( elem, name ); + return; + } + + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + elem.setAttribute( name, value + "" ); + return value; + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + ret = jQuery.find.attr( elem, name ); + + // Non-existent attributes return null, we normalize to undefined + return ret == null ? undefined : ret; + }, + + attrHooks: { + type: { + set: function( elem, value ) { + if ( !support.radioValue && value === "radio" && + nodeName( elem, "input" ) ) { + var val = elem.value; + elem.setAttribute( "type", value ); + if ( val ) { + elem.value = val; + } + return value; + } + } + } + }, + + removeAttr: function( elem, value ) { + var name, + i = 0, + + // Attribute names can contain non-HTML whitespace characters + // https://html.spec.whatwg.org/multipage/syntax.html#attributes-2 + attrNames = value && value.match( rnothtmlwhite ); + + if ( attrNames && elem.nodeType === 1 ) { + while ( ( name = attrNames[ i++ ] ) ) { + elem.removeAttribute( name ); + } + } + } +} ); + +// Hooks for boolean attributes +boolHook = { + set: function( elem, value, name ) { + if ( value === false ) { + + // Remove boolean attributes when set to false + jQuery.removeAttr( elem, name ); + } else { + elem.setAttribute( name, name ); + } + return name; + } +}; + +jQuery.each( jQuery.expr.match.bool.source.match( /\w+/g ), function( _i, name ) { + var getter = attrHandle[ name ] || jQuery.find.attr; + + attrHandle[ name ] = function( elem, name, isXML ) { + var ret, handle, + lowercaseName = name.toLowerCase(); + + if ( !isXML ) { + + // Avoid an infinite loop by temporarily removing this function from the getter + handle = attrHandle[ lowercaseName ]; + attrHandle[ lowercaseName ] = ret; + ret = getter( elem, name, isXML ) != null ? + lowercaseName : + null; + attrHandle[ lowercaseName ] = handle; + } + return ret; + }; +} ); + + + + +var rfocusable = /^(?:input|select|textarea|button)$/i, + rclickable = /^(?:a|area)$/i; + +jQuery.fn.extend( { + prop: function( name, value ) { + return access( this, jQuery.prop, name, value, arguments.length > 1 ); + }, + + removeProp: function( name ) { + return this.each( function() { + delete this[ jQuery.propFix[ name ] || name ]; + } ); + } +} ); + +jQuery.extend( { + prop: function( elem, name, value ) { + var ret, hooks, + nType = elem.nodeType; + + // Don't get/set properties on text, comment and attribute nodes + if ( nType === 3 || nType === 8 || nType === 2 ) { + return; + } + + if ( nType !== 1 || !jQuery.isXMLDoc( elem ) ) { + + // Fix name and attach hooks + name = jQuery.propFix[ name ] || name; + hooks = jQuery.propHooks[ name ]; + } + + if ( value !== undefined ) { + if ( hooks && "set" in hooks && + ( ret = hooks.set( elem, value, name ) ) !== undefined ) { + return ret; + } + + return ( elem[ name ] = value ); + } + + if ( hooks && "get" in hooks && ( ret = hooks.get( elem, name ) ) !== null ) { + return ret; + } + + return elem[ name ]; + }, + + propHooks: { + tabIndex: { + get: function( elem ) { + + // Support: IE <=9 - 11 only + // elem.tabIndex doesn't always return the + // correct value when it hasn't been explicitly set + // https://web.archive.org/web/20141116233347/http://fluidproject.org/blog/2008/01/09/getting-setting-and-removing-tabindex-values-with-javascript/ + // Use proper attribute retrieval(#12072) + var tabindex = jQuery.find.attr( elem, "tabindex" ); + + if ( tabindex ) { + return parseInt( tabindex, 10 ); + } + + if ( + rfocusable.test( elem.nodeName ) || + rclickable.test( elem.nodeName ) && + elem.href + ) { + return 0; + } + + return -1; + } + } + }, + + propFix: { + "for": "htmlFor", + "class": "className" + } +} ); + +// Support: IE <=11 only +// Accessing the selectedIndex property +// forces the browser to respect setting selected +// on the option +// The getter ensures a default option is selected +// when in an optgroup +// eslint rule "no-unused-expressions" is disabled for this code +// since it considers such accessions noop +if ( !support.optSelected ) { + jQuery.propHooks.selected = { + get: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent && parent.parentNode ) { + parent.parentNode.selectedIndex; + } + return null; + }, + set: function( elem ) { + + /* eslint no-unused-expressions: "off" */ + + var parent = elem.parentNode; + if ( parent ) { + parent.selectedIndex; + + if ( parent.parentNode ) { + parent.parentNode.selectedIndex; + } + } + } + }; +} + +jQuery.each( [ + "tabIndex", + "readOnly", + "maxLength", + "cellSpacing", + "cellPadding", + "rowSpan", + "colSpan", + "useMap", + "frameBorder", + "contentEditable" +], function() { + jQuery.propFix[ this.toLowerCase() ] = this; +} ); + + + + + // Strip and collapse whitespace according to HTML spec + // https://infra.spec.whatwg.org/#strip-and-collapse-ascii-whitespace + function stripAndCollapse( value ) { + var tokens = value.match( rnothtmlwhite ) || []; + return tokens.join( " " ); + } + + +function getClass( elem ) { + return elem.getAttribute && elem.getAttribute( "class" ) || ""; +} + +function classesToArray( value ) { + if ( Array.isArray( value ) ) { + return value; + } + if ( typeof value === "string" ) { + return value.match( rnothtmlwhite ) || []; + } + return []; +} + +jQuery.fn.extend( { + addClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).addClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + if ( cur.indexOf( " " + clazz + " " ) < 0 ) { + cur += clazz + " "; + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + removeClass: function( value ) { + var classes, elem, cur, curValue, clazz, j, finalValue, + i = 0; + + if ( isFunction( value ) ) { + return this.each( function( j ) { + jQuery( this ).removeClass( value.call( this, j, getClass( this ) ) ); + } ); + } + + if ( !arguments.length ) { + return this.attr( "class", "" ); + } + + classes = classesToArray( value ); + + if ( classes.length ) { + while ( ( elem = this[ i++ ] ) ) { + curValue = getClass( elem ); + + // This expression is here for better compressibility (see addClass) + cur = elem.nodeType === 1 && ( " " + stripAndCollapse( curValue ) + " " ); + + if ( cur ) { + j = 0; + while ( ( clazz = classes[ j++ ] ) ) { + + // Remove *all* instances + while ( cur.indexOf( " " + clazz + " " ) > -1 ) { + cur = cur.replace( " " + clazz + " ", " " ); + } + } + + // Only assign if different to avoid unneeded rendering. + finalValue = stripAndCollapse( cur ); + if ( curValue !== finalValue ) { + elem.setAttribute( "class", finalValue ); + } + } + } + } + + return this; + }, + + toggleClass: function( value, stateVal ) { + var type = typeof value, + isValidValue = type === "string" || Array.isArray( value ); + + if ( typeof stateVal === "boolean" && isValidValue ) { + return stateVal ? this.addClass( value ) : this.removeClass( value ); + } + + if ( isFunction( value ) ) { + return this.each( function( i ) { + jQuery( this ).toggleClass( + value.call( this, i, getClass( this ), stateVal ), + stateVal + ); + } ); + } + + return this.each( function() { + var className, i, self, classNames; + + if ( isValidValue ) { + + // Toggle individual class names + i = 0; + self = jQuery( this ); + classNames = classesToArray( value ); + + while ( ( className = classNames[ i++ ] ) ) { + + // Check each className given, space separated list + if ( self.hasClass( className ) ) { + self.removeClass( className ); + } else { + self.addClass( className ); + } + } + + // Toggle whole class name + } else if ( value === undefined || type === "boolean" ) { + className = getClass( this ); + if ( className ) { + + // Store className if set + dataPriv.set( this, "__className__", className ); + } + + // If the element has a class name or if we're passed `false`, + // then remove the whole classname (if there was one, the above saved it). + // Otherwise bring back whatever was previously saved (if anything), + // falling back to the empty string if nothing was stored. + if ( this.setAttribute ) { + this.setAttribute( "class", + className || value === false ? + "" : + dataPriv.get( this, "__className__" ) || "" + ); + } + } + } ); + }, + + hasClass: function( selector ) { + var className, elem, + i = 0; + + className = " " + selector + " "; + while ( ( elem = this[ i++ ] ) ) { + if ( elem.nodeType === 1 && + ( " " + stripAndCollapse( getClass( elem ) ) + " " ).indexOf( className ) > -1 ) { + return true; + } + } + + return false; + } +} ); + + + + +var rreturn = /\r/g; + +jQuery.fn.extend( { + val: function( value ) { + var hooks, ret, valueIsFunction, + elem = this[ 0 ]; + + if ( !arguments.length ) { + if ( elem ) { + hooks = jQuery.valHooks[ elem.type ] || + jQuery.valHooks[ elem.nodeName.toLowerCase() ]; + + if ( hooks && + "get" in hooks && + ( ret = hooks.get( elem, "value" ) ) !== undefined + ) { + return ret; + } + + ret = elem.value; + + // Handle most common string cases + if ( typeof ret === "string" ) { + return ret.replace( rreturn, "" ); + } + + // Handle cases where value is null/undef or number + return ret == null ? "" : ret; + } + + return; + } + + valueIsFunction = isFunction( value ); + + return this.each( function( i ) { + var val; + + if ( this.nodeType !== 1 ) { + return; + } + + if ( valueIsFunction ) { + val = value.call( this, i, jQuery( this ).val() ); + } else { + val = value; + } + + // Treat null/undefined as ""; convert numbers to string + if ( val == null ) { + val = ""; + + } else if ( typeof val === "number" ) { + val += ""; + + } else if ( Array.isArray( val ) ) { + val = jQuery.map( val, function( value ) { + return value == null ? "" : value + ""; + } ); + } + + hooks = jQuery.valHooks[ this.type ] || jQuery.valHooks[ this.nodeName.toLowerCase() ]; + + // If set returns undefined, fall back to normal setting + if ( !hooks || !( "set" in hooks ) || hooks.set( this, val, "value" ) === undefined ) { + this.value = val; + } + } ); + } +} ); + +jQuery.extend( { + valHooks: { + option: { + get: function( elem ) { + + var val = jQuery.find.attr( elem, "value" ); + return val != null ? + val : + + // Support: IE <=10 - 11 only + // option.text throws exceptions (#14686, #14858) + // Strip and collapse whitespace + // https://html.spec.whatwg.org/#strip-and-collapse-whitespace + stripAndCollapse( jQuery.text( elem ) ); + } + }, + select: { + get: function( elem ) { + var value, option, i, + options = elem.options, + index = elem.selectedIndex, + one = elem.type === "select-one", + values = one ? null : [], + max = one ? index + 1 : options.length; + + if ( index < 0 ) { + i = max; + + } else { + i = one ? index : 0; + } + + // Loop through all the selected options + for ( ; i < max; i++ ) { + option = options[ i ]; + + // Support: IE <=9 only + // IE8-9 doesn't update selected after form reset (#2551) + if ( ( option.selected || i === index ) && + + // Don't return options that are disabled or in a disabled optgroup + !option.disabled && + ( !option.parentNode.disabled || + !nodeName( option.parentNode, "optgroup" ) ) ) { + + // Get the specific value for the option + value = jQuery( option ).val(); + + // We don't need an array for one selects + if ( one ) { + return value; + } + + // Multi-Selects return an array + values.push( value ); + } + } + + return values; + }, + + set: function( elem, value ) { + var optionSet, option, + options = elem.options, + values = jQuery.makeArray( value ), + i = options.length; + + while ( i-- ) { + option = options[ i ]; + + /* eslint-disable no-cond-assign */ + + if ( option.selected = + jQuery.inArray( jQuery.valHooks.option.get( option ), values ) > -1 + ) { + optionSet = true; + } + + /* eslint-enable no-cond-assign */ + } + + // Force browsers to behave consistently when non-matching value is set + if ( !optionSet ) { + elem.selectedIndex = -1; + } + return values; + } + } + } +} ); + +// Radios and checkboxes getter/setter +jQuery.each( [ "radio", "checkbox" ], function() { + jQuery.valHooks[ this ] = { + set: function( elem, value ) { + if ( Array.isArray( value ) ) { + return ( elem.checked = jQuery.inArray( jQuery( elem ).val(), value ) > -1 ); + } + } + }; + if ( !support.checkOn ) { + jQuery.valHooks[ this ].get = function( elem ) { + return elem.getAttribute( "value" ) === null ? "on" : elem.value; + }; + } +} ); + + + + +// Return jQuery for attributes-only inclusion + + +support.focusin = "onfocusin" in window; + + +var rfocusMorph = /^(?:focusinfocus|focusoutblur)$/, + stopPropagationCallback = function( e ) { + e.stopPropagation(); + }; + +jQuery.extend( jQuery.event, { + + trigger: function( event, data, elem, onlyHandlers ) { + + var i, cur, tmp, bubbleType, ontype, handle, special, lastElement, + eventPath = [ elem || document ], + type = hasOwn.call( event, "type" ) ? event.type : event, + namespaces = hasOwn.call( event, "namespace" ) ? event.namespace.split( "." ) : []; + + cur = lastElement = tmp = elem = elem || document; + + // Don't do events on text and comment nodes + if ( elem.nodeType === 3 || elem.nodeType === 8 ) { + return; + } + + // focus/blur morphs to focusin/out; ensure we're not firing them right now + if ( rfocusMorph.test( type + jQuery.event.triggered ) ) { + return; + } + + if ( type.indexOf( "." ) > -1 ) { + + // Namespaced trigger; create a regexp to match event type in handle() + namespaces = type.split( "." ); + type = namespaces.shift(); + namespaces.sort(); + } + ontype = type.indexOf( ":" ) < 0 && "on" + type; + + // Caller can pass in a jQuery.Event object, Object, or just an event type string + event = event[ jQuery.expando ] ? + event : + new jQuery.Event( type, typeof event === "object" && event ); + + // Trigger bitmask: & 1 for native handlers; & 2 for jQuery (always true) + event.isTrigger = onlyHandlers ? 2 : 3; + event.namespace = namespaces.join( "." ); + event.rnamespace = event.namespace ? + new RegExp( "(^|\\.)" + namespaces.join( "\\.(?:.*\\.|)" ) + "(\\.|$)" ) : + null; + + // Clean up the event in case it is being reused + event.result = undefined; + if ( !event.target ) { + event.target = elem; + } + + // Clone any incoming data and prepend the event, creating the handler arg list + data = data == null ? + [ event ] : + jQuery.makeArray( data, [ event ] ); + + // Allow special events to draw outside the lines + special = jQuery.event.special[ type ] || {}; + if ( !onlyHandlers && special.trigger && special.trigger.apply( elem, data ) === false ) { + return; + } + + // Determine event propagation path in advance, per W3C events spec (#9951) + // Bubble up to document, then to window; watch for a global ownerDocument var (#9724) + if ( !onlyHandlers && !special.noBubble && !isWindow( elem ) ) { + + bubbleType = special.delegateType || type; + if ( !rfocusMorph.test( bubbleType + type ) ) { + cur = cur.parentNode; + } + for ( ; cur; cur = cur.parentNode ) { + eventPath.push( cur ); + tmp = cur; + } + + // Only add window if we got to document (e.g., not plain obj or detached DOM) + if ( tmp === ( elem.ownerDocument || document ) ) { + eventPath.push( tmp.defaultView || tmp.parentWindow || window ); + } + } + + // Fire handlers on the event path + i = 0; + while ( ( cur = eventPath[ i++ ] ) && !event.isPropagationStopped() ) { + lastElement = cur; + event.type = i > 1 ? + bubbleType : + special.bindType || type; + + // jQuery handler + handle = ( dataPriv.get( cur, "events" ) || Object.create( null ) )[ event.type ] && + dataPriv.get( cur, "handle" ); + if ( handle ) { + handle.apply( cur, data ); + } + + // Native handler + handle = ontype && cur[ ontype ]; + if ( handle && handle.apply && acceptData( cur ) ) { + event.result = handle.apply( cur, data ); + if ( event.result === false ) { + event.preventDefault(); + } + } + } + event.type = type; + + // If nobody prevented the default action, do it now + if ( !onlyHandlers && !event.isDefaultPrevented() ) { + + if ( ( !special._default || + special._default.apply( eventPath.pop(), data ) === false ) && + acceptData( elem ) ) { + + // Call a native DOM method on the target with the same name as the event. + // Don't do default actions on window, that's where global variables be (#6170) + if ( ontype && isFunction( elem[ type ] ) && !isWindow( elem ) ) { + + // Don't re-trigger an onFOO event when we call its FOO() method + tmp = elem[ ontype ]; + + if ( tmp ) { + elem[ ontype ] = null; + } + + // Prevent re-triggering of the same event, since we already bubbled it above + jQuery.event.triggered = type; + + if ( event.isPropagationStopped() ) { + lastElement.addEventListener( type, stopPropagationCallback ); + } + + elem[ type ](); + + if ( event.isPropagationStopped() ) { + lastElement.removeEventListener( type, stopPropagationCallback ); + } + + jQuery.event.triggered = undefined; + + if ( tmp ) { + elem[ ontype ] = tmp; + } + } + } + } + + return event.result; + }, + + // Piggyback on a donor event to simulate a different one + // Used only for `focus(in | out)` events + simulate: function( type, elem, event ) { + var e = jQuery.extend( + new jQuery.Event(), + event, + { + type: type, + isSimulated: true + } + ); + + jQuery.event.trigger( e, null, elem ); + } + +} ); + +jQuery.fn.extend( { + + trigger: function( type, data ) { + return this.each( function() { + jQuery.event.trigger( type, data, this ); + } ); + }, + triggerHandler: function( type, data ) { + var elem = this[ 0 ]; + if ( elem ) { + return jQuery.event.trigger( type, data, elem, true ); + } + } +} ); + + +// Support: Firefox <=44 +// Firefox doesn't have focus(in | out) events +// Related ticket - https://bugzilla.mozilla.org/show_bug.cgi?id=687787 +// +// Support: Chrome <=48 - 49, Safari <=9.0 - 9.1 +// focus(in | out) events fire after focus & blur events, +// which is spec violation - http://www.w3.org/TR/DOM-Level-3-Events/#events-focusevent-event-order +// Related ticket - https://bugs.chromium.org/p/chromium/issues/detail?id=449857 +if ( !support.focusin ) { + jQuery.each( { focus: "focusin", blur: "focusout" }, function( orig, fix ) { + + // Attach a single capturing handler on the document while someone wants focusin/focusout + var handler = function( event ) { + jQuery.event.simulate( fix, event.target, jQuery.event.fix( event ) ); + }; + + jQuery.event.special[ fix ] = { + setup: function() { + + // Handle: regular nodes (via `this.ownerDocument`), window + // (via `this.document`) & document (via `this`). + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ); + + if ( !attaches ) { + doc.addEventListener( orig, handler, true ); + } + dataPriv.access( doc, fix, ( attaches || 0 ) + 1 ); + }, + teardown: function() { + var doc = this.ownerDocument || this.document || this, + attaches = dataPriv.access( doc, fix ) - 1; + + if ( !attaches ) { + doc.removeEventListener( orig, handler, true ); + dataPriv.remove( doc, fix ); + + } else { + dataPriv.access( doc, fix, attaches ); + } + } + }; + } ); +} +var location = window.location; + +var nonce = { guid: Date.now() }; + +var rquery = ( /\?/ ); + + + +// Cross-browser xml parsing +jQuery.parseXML = function( data ) { + var xml, parserErrorElem; + if ( !data || typeof data !== "string" ) { + return null; + } + + // Support: IE 9 - 11 only + // IE throws on parseFromString with invalid input. + try { + xml = ( new window.DOMParser() ).parseFromString( data, "text/xml" ); + } catch ( e ) {} + + parserErrorElem = xml && xml.getElementsByTagName( "parsererror" )[ 0 ]; + if ( !xml || parserErrorElem ) { + jQuery.error( "Invalid XML: " + ( + parserErrorElem ? + jQuery.map( parserErrorElem.childNodes, function( el ) { + return el.textContent; + } ).join( "\n" ) : + data + ) ); + } + return xml; +}; + + +var + rbracket = /\[\]$/, + rCRLF = /\r?\n/g, + rsubmitterTypes = /^(?:submit|button|image|reset|file)$/i, + rsubmittable = /^(?:input|select|textarea|keygen)/i; + +function buildParams( prefix, obj, traditional, add ) { + var name; + + if ( Array.isArray( obj ) ) { + + // Serialize array item. + jQuery.each( obj, function( i, v ) { + if ( traditional || rbracket.test( prefix ) ) { + + // Treat each array item as a scalar. + add( prefix, v ); + + } else { + + // Item is non-scalar (array or object), encode its numeric index. + buildParams( + prefix + "[" + ( typeof v === "object" && v != null ? i : "" ) + "]", + v, + traditional, + add + ); + } + } ); + + } else if ( !traditional && toType( obj ) === "object" ) { + + // Serialize object item. + for ( name in obj ) { + buildParams( prefix + "[" + name + "]", obj[ name ], traditional, add ); + } + + } else { + + // Serialize scalar item. + add( prefix, obj ); + } +} + +// Serialize an array of form elements or a set of +// key/values into a query string +jQuery.param = function( a, traditional ) { + var prefix, + s = [], + add = function( key, valueOrFunction ) { + + // If value is a function, invoke it and use its return value + var value = isFunction( valueOrFunction ) ? + valueOrFunction() : + valueOrFunction; + + s[ s.length ] = encodeURIComponent( key ) + "=" + + encodeURIComponent( value == null ? "" : value ); + }; + + if ( a == null ) { + return ""; + } + + // If an array was passed in, assume that it is an array of form elements. + if ( Array.isArray( a ) || ( a.jquery && !jQuery.isPlainObject( a ) ) ) { + + // Serialize the form elements + jQuery.each( a, function() { + add( this.name, this.value ); + } ); + + } else { + + // If traditional, encode the "old" way (the way 1.3.2 or older + // did it), otherwise encode params recursively. + for ( prefix in a ) { + buildParams( prefix, a[ prefix ], traditional, add ); + } + } + + // Return the resulting serialization + return s.join( "&" ); +}; + +jQuery.fn.extend( { + serialize: function() { + return jQuery.param( this.serializeArray() ); + }, + serializeArray: function() { + return this.map( function() { + + // Can add propHook for "elements" to filter or add form elements + var elements = jQuery.prop( this, "elements" ); + return elements ? jQuery.makeArray( elements ) : this; + } ).filter( function() { + var type = this.type; + + // Use .is( ":disabled" ) so that fieldset[disabled] works + return this.name && !jQuery( this ).is( ":disabled" ) && + rsubmittable.test( this.nodeName ) && !rsubmitterTypes.test( type ) && + ( this.checked || !rcheckableType.test( type ) ); + } ).map( function( _i, elem ) { + var val = jQuery( this ).val(); + + if ( val == null ) { + return null; + } + + if ( Array.isArray( val ) ) { + return jQuery.map( val, function( val ) { + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ); + } + + return { name: elem.name, value: val.replace( rCRLF, "\r\n" ) }; + } ).get(); + } +} ); + + +var + r20 = /%20/g, + rhash = /#.*$/, + rantiCache = /([?&])_=[^&]*/, + rheaders = /^(.*?):[ \t]*([^\r\n]*)$/mg, + + // #7653, #8125, #8152: local protocol detection + rlocalProtocol = /^(?:about|app|app-storage|.+-extension|file|res|widget):$/, + rnoContent = /^(?:GET|HEAD)$/, + rprotocol = /^\/\//, + + /* Prefilters + * 1) They are useful to introduce custom dataTypes (see ajax/jsonp.js for an example) + * 2) These are called: + * - BEFORE asking for a transport + * - AFTER param serialization (s.data is a string if s.processData is true) + * 3) key is the dataType + * 4) the catchall symbol "*" can be used + * 5) execution will start with transport dataType and THEN continue down to "*" if needed + */ + prefilters = {}, + + /* Transports bindings + * 1) key is the dataType + * 2) the catchall symbol "*" can be used + * 3) selection will start with transport dataType and THEN go to "*" if needed + */ + transports = {}, + + // Avoid comment-prolog char sequence (#10098); must appease lint and evade compression + allTypes = "*/".concat( "*" ), + + // Anchor tag for parsing the document origin + originAnchor = document.createElement( "a" ); + +originAnchor.href = location.href; + +// Base "constructor" for jQuery.ajaxPrefilter and jQuery.ajaxTransport +function addToPrefiltersOrTransports( structure ) { + + // dataTypeExpression is optional and defaults to "*" + return function( dataTypeExpression, func ) { + + if ( typeof dataTypeExpression !== "string" ) { + func = dataTypeExpression; + dataTypeExpression = "*"; + } + + var dataType, + i = 0, + dataTypes = dataTypeExpression.toLowerCase().match( rnothtmlwhite ) || []; + + if ( isFunction( func ) ) { + + // For each dataType in the dataTypeExpression + while ( ( dataType = dataTypes[ i++ ] ) ) { + + // Prepend if requested + if ( dataType[ 0 ] === "+" ) { + dataType = dataType.slice( 1 ) || "*"; + ( structure[ dataType ] = structure[ dataType ] || [] ).unshift( func ); + + // Otherwise append + } else { + ( structure[ dataType ] = structure[ dataType ] || [] ).push( func ); + } + } + } + }; +} + +// Base inspection function for prefilters and transports +function inspectPrefiltersOrTransports( structure, options, originalOptions, jqXHR ) { + + var inspected = {}, + seekingTransport = ( structure === transports ); + + function inspect( dataType ) { + var selected; + inspected[ dataType ] = true; + jQuery.each( structure[ dataType ] || [], function( _, prefilterOrFactory ) { + var dataTypeOrTransport = prefilterOrFactory( options, originalOptions, jqXHR ); + if ( typeof dataTypeOrTransport === "string" && + !seekingTransport && !inspected[ dataTypeOrTransport ] ) { + + options.dataTypes.unshift( dataTypeOrTransport ); + inspect( dataTypeOrTransport ); + return false; + } else if ( seekingTransport ) { + return !( selected = dataTypeOrTransport ); + } + } ); + return selected; + } + + return inspect( options.dataTypes[ 0 ] ) || !inspected[ "*" ] && inspect( "*" ); +} + +// A special extend for ajax options +// that takes "flat" options (not to be deep extended) +// Fixes #9887 +function ajaxExtend( target, src ) { + var key, deep, + flatOptions = jQuery.ajaxSettings.flatOptions || {}; + + for ( key in src ) { + if ( src[ key ] !== undefined ) { + ( flatOptions[ key ] ? target : ( deep || ( deep = {} ) ) )[ key ] = src[ key ]; + } + } + if ( deep ) { + jQuery.extend( true, target, deep ); + } + + return target; +} + +/* Handles responses to an ajax request: + * - finds the right dataType (mediates between content-type and expected dataType) + * - returns the corresponding response + */ +function ajaxHandleResponses( s, jqXHR, responses ) { + + var ct, type, finalDataType, firstDataType, + contents = s.contents, + dataTypes = s.dataTypes; + + // Remove auto dataType and get content-type in the process + while ( dataTypes[ 0 ] === "*" ) { + dataTypes.shift(); + if ( ct === undefined ) { + ct = s.mimeType || jqXHR.getResponseHeader( "Content-Type" ); + } + } + + // Check if we're dealing with a known content-type + if ( ct ) { + for ( type in contents ) { + if ( contents[ type ] && contents[ type ].test( ct ) ) { + dataTypes.unshift( type ); + break; + } + } + } + + // Check to see if we have a response for the expected dataType + if ( dataTypes[ 0 ] in responses ) { + finalDataType = dataTypes[ 0 ]; + } else { + + // Try convertible dataTypes + for ( type in responses ) { + if ( !dataTypes[ 0 ] || s.converters[ type + " " + dataTypes[ 0 ] ] ) { + finalDataType = type; + break; + } + if ( !firstDataType ) { + firstDataType = type; + } + } + + // Or just use first one + finalDataType = finalDataType || firstDataType; + } + + // If we found a dataType + // We add the dataType to the list if needed + // and return the corresponding response + if ( finalDataType ) { + if ( finalDataType !== dataTypes[ 0 ] ) { + dataTypes.unshift( finalDataType ); + } + return responses[ finalDataType ]; + } +} + +/* Chain conversions given the request and the original response + * Also sets the responseXXX fields on the jqXHR instance + */ +function ajaxConvert( s, response, jqXHR, isSuccess ) { + var conv2, current, conv, tmp, prev, + converters = {}, + + // Work with a copy of dataTypes in case we need to modify it for conversion + dataTypes = s.dataTypes.slice(); + + // Create converters map with lowercased keys + if ( dataTypes[ 1 ] ) { + for ( conv in s.converters ) { + converters[ conv.toLowerCase() ] = s.converters[ conv ]; + } + } + + current = dataTypes.shift(); + + // Convert to each sequential dataType + while ( current ) { + + if ( s.responseFields[ current ] ) { + jqXHR[ s.responseFields[ current ] ] = response; + } + + // Apply the dataFilter if provided + if ( !prev && isSuccess && s.dataFilter ) { + response = s.dataFilter( response, s.dataType ); + } + + prev = current; + current = dataTypes.shift(); + + if ( current ) { + + // There's only work to do if current dataType is non-auto + if ( current === "*" ) { + + current = prev; + + // Convert response if prev dataType is non-auto and differs from current + } else if ( prev !== "*" && prev !== current ) { + + // Seek a direct converter + conv = converters[ prev + " " + current ] || converters[ "* " + current ]; + + // If none found, seek a pair + if ( !conv ) { + for ( conv2 in converters ) { + + // If conv2 outputs current + tmp = conv2.split( " " ); + if ( tmp[ 1 ] === current ) { + + // If prev can be converted to accepted input + conv = converters[ prev + " " + tmp[ 0 ] ] || + converters[ "* " + tmp[ 0 ] ]; + if ( conv ) { + + // Condense equivalence converters + if ( conv === true ) { + conv = converters[ conv2 ]; + + // Otherwise, insert the intermediate dataType + } else if ( converters[ conv2 ] !== true ) { + current = tmp[ 0 ]; + dataTypes.unshift( tmp[ 1 ] ); + } + break; + } + } + } + } + + // Apply converter (if not an equivalence) + if ( conv !== true ) { + + // Unless errors are allowed to bubble, catch and return them + if ( conv && s.throws ) { + response = conv( response ); + } else { + try { + response = conv( response ); + } catch ( e ) { + return { + state: "parsererror", + error: conv ? e : "No conversion from " + prev + " to " + current + }; + } + } + } + } + } + } + + return { state: "success", data: response }; +} + +jQuery.extend( { + + // Counter for holding the number of active queries + active: 0, + + // Last-Modified header cache for next request + lastModified: {}, + etag: {}, + + ajaxSettings: { + url: location.href, + type: "GET", + isLocal: rlocalProtocol.test( location.protocol ), + global: true, + processData: true, + async: true, + contentType: "application/x-www-form-urlencoded; charset=UTF-8", + + /* + timeout: 0, + data: null, + dataType: null, + username: null, + password: null, + cache: null, + throws: false, + traditional: false, + headers: {}, + */ + + accepts: { + "*": allTypes, + text: "text/plain", + html: "text/html", + xml: "application/xml, text/xml", + json: "application/json, text/javascript" + }, + + contents: { + xml: /\bxml\b/, + html: /\bhtml/, + json: /\bjson\b/ + }, + + responseFields: { + xml: "responseXML", + text: "responseText", + json: "responseJSON" + }, + + // Data converters + // Keys separate source (or catchall "*") and destination types with a single space + converters: { + + // Convert anything to text + "* text": String, + + // Text to html (true = no transformation) + "text html": true, + + // Evaluate text as a json expression + "text json": JSON.parse, + + // Parse text as xml + "text xml": jQuery.parseXML + }, + + // For options that shouldn't be deep extended: + // you can add your own custom options here if + // and when you create one that shouldn't be + // deep extended (see ajaxExtend) + flatOptions: { + url: true, + context: true + } + }, + + // Creates a full fledged settings object into target + // with both ajaxSettings and settings fields. + // If target is omitted, writes into ajaxSettings. + ajaxSetup: function( target, settings ) { + return settings ? + + // Building a settings object + ajaxExtend( ajaxExtend( target, jQuery.ajaxSettings ), settings ) : + + // Extending ajaxSettings + ajaxExtend( jQuery.ajaxSettings, target ); + }, + + ajaxPrefilter: addToPrefiltersOrTransports( prefilters ), + ajaxTransport: addToPrefiltersOrTransports( transports ), + + // Main method + ajax: function( url, options ) { + + // If url is an object, simulate pre-1.5 signature + if ( typeof url === "object" ) { + options = url; + url = undefined; + } + + // Force options to be an object + options = options || {}; + + var transport, + + // URL without anti-cache param + cacheURL, + + // Response headers + responseHeadersString, + responseHeaders, + + // timeout handle + timeoutTimer, + + // Url cleanup var + urlAnchor, + + // Request state (becomes false upon send and true upon completion) + completed, + + // To know if global events are to be dispatched + fireGlobals, + + // Loop variable + i, + + // uncached part of the url + uncached, + + // Create the final options object + s = jQuery.ajaxSetup( {}, options ), + + // Callbacks context + callbackContext = s.context || s, + + // Context for global events is callbackContext if it is a DOM node or jQuery collection + globalEventContext = s.context && + ( callbackContext.nodeType || callbackContext.jquery ) ? + jQuery( callbackContext ) : + jQuery.event, + + // Deferreds + deferred = jQuery.Deferred(), + completeDeferred = jQuery.Callbacks( "once memory" ), + + // Status-dependent callbacks + statusCode = s.statusCode || {}, + + // Headers (they are sent all at once) + requestHeaders = {}, + requestHeadersNames = {}, + + // Default abort message + strAbort = "canceled", + + // Fake xhr + jqXHR = { + readyState: 0, + + // Builds headers hashtable if needed + getResponseHeader: function( key ) { + var match; + if ( completed ) { + if ( !responseHeaders ) { + responseHeaders = {}; + while ( ( match = rheaders.exec( responseHeadersString ) ) ) { + responseHeaders[ match[ 1 ].toLowerCase() + " " ] = + ( responseHeaders[ match[ 1 ].toLowerCase() + " " ] || [] ) + .concat( match[ 2 ] ); + } + } + match = responseHeaders[ key.toLowerCase() + " " ]; + } + return match == null ? null : match.join( ", " ); + }, + + // Raw string + getAllResponseHeaders: function() { + return completed ? responseHeadersString : null; + }, + + // Caches the header + setRequestHeader: function( name, value ) { + if ( completed == null ) { + name = requestHeadersNames[ name.toLowerCase() ] = + requestHeadersNames[ name.toLowerCase() ] || name; + requestHeaders[ name ] = value; + } + return this; + }, + + // Overrides response content-type header + overrideMimeType: function( type ) { + if ( completed == null ) { + s.mimeType = type; + } + return this; + }, + + // Status-dependent callbacks + statusCode: function( map ) { + var code; + if ( map ) { + if ( completed ) { + + // Execute the appropriate callbacks + jqXHR.always( map[ jqXHR.status ] ); + } else { + + // Lazy-add the new callbacks in a way that preserves old ones + for ( code in map ) { + statusCode[ code ] = [ statusCode[ code ], map[ code ] ]; + } + } + } + return this; + }, + + // Cancel the request + abort: function( statusText ) { + var finalText = statusText || strAbort; + if ( transport ) { + transport.abort( finalText ); + } + done( 0, finalText ); + return this; + } + }; + + // Attach deferreds + deferred.promise( jqXHR ); + + // Add protocol if not provided (prefilters might expect it) + // Handle falsy url in the settings object (#10093: consistency with old signature) + // We also use the url parameter if available + s.url = ( ( url || s.url || location.href ) + "" ) + .replace( rprotocol, location.protocol + "//" ); + + // Alias method option to type as per ticket #12004 + s.type = options.method || options.type || s.method || s.type; + + // Extract dataTypes list + s.dataTypes = ( s.dataType || "*" ).toLowerCase().match( rnothtmlwhite ) || [ "" ]; + + // A cross-domain request is in order when the origin doesn't match the current origin. + if ( s.crossDomain == null ) { + urlAnchor = document.createElement( "a" ); + + // Support: IE <=8 - 11, Edge 12 - 15 + // IE throws exception on accessing the href property if url is malformed, + // e.g. http://example.com:80x/ + try { + urlAnchor.href = s.url; + + // Support: IE <=8 - 11 only + // Anchor's host property isn't correctly set when s.url is relative + urlAnchor.href = urlAnchor.href; + s.crossDomain = originAnchor.protocol + "//" + originAnchor.host !== + urlAnchor.protocol + "//" + urlAnchor.host; + } catch ( e ) { + + // If there is an error parsing the URL, assume it is crossDomain, + // it can be rejected by the transport if it is invalid + s.crossDomain = true; + } + } + + // Convert data if not already a string + if ( s.data && s.processData && typeof s.data !== "string" ) { + s.data = jQuery.param( s.data, s.traditional ); + } + + // Apply prefilters + inspectPrefiltersOrTransports( prefilters, s, options, jqXHR ); + + // If request was aborted inside a prefilter, stop there + if ( completed ) { + return jqXHR; + } + + // We can fire global events as of now if asked to + // Don't fire events if jQuery.event is undefined in an AMD-usage scenario (#15118) + fireGlobals = jQuery.event && s.global; + + // Watch for a new set of requests + if ( fireGlobals && jQuery.active++ === 0 ) { + jQuery.event.trigger( "ajaxStart" ); + } + + // Uppercase the type + s.type = s.type.toUpperCase(); + + // Determine if request has content + s.hasContent = !rnoContent.test( s.type ); + + // Save the URL in case we're toying with the If-Modified-Since + // and/or If-None-Match header later on + // Remove hash to simplify url manipulation + cacheURL = s.url.replace( rhash, "" ); + + // More options handling for requests with no content + if ( !s.hasContent ) { + + // Remember the hash so we can put it back + uncached = s.url.slice( cacheURL.length ); + + // If data is available and should be processed, append data to url + if ( s.data && ( s.processData || typeof s.data === "string" ) ) { + cacheURL += ( rquery.test( cacheURL ) ? "&" : "?" ) + s.data; + + // #9682: remove data so that it's not used in an eventual retry + delete s.data; + } + + // Add or update anti-cache param if needed + if ( s.cache === false ) { + cacheURL = cacheURL.replace( rantiCache, "$1" ); + uncached = ( rquery.test( cacheURL ) ? "&" : "?" ) + "_=" + ( nonce.guid++ ) + + uncached; + } + + // Put hash and anti-cache on the URL that will be requested (gh-1732) + s.url = cacheURL + uncached; + + // Change '%20' to '+' if this is encoded form body content (gh-2658) + } else if ( s.data && s.processData && + ( s.contentType || "" ).indexOf( "application/x-www-form-urlencoded" ) === 0 ) { + s.data = s.data.replace( r20, "+" ); + } + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + if ( jQuery.lastModified[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-Modified-Since", jQuery.lastModified[ cacheURL ] ); + } + if ( jQuery.etag[ cacheURL ] ) { + jqXHR.setRequestHeader( "If-None-Match", jQuery.etag[ cacheURL ] ); + } + } + + // Set the correct header, if data is being sent + if ( s.data && s.hasContent && s.contentType !== false || options.contentType ) { + jqXHR.setRequestHeader( "Content-Type", s.contentType ); + } + + // Set the Accepts header for the server, depending on the dataType + jqXHR.setRequestHeader( + "Accept", + s.dataTypes[ 0 ] && s.accepts[ s.dataTypes[ 0 ] ] ? + s.accepts[ s.dataTypes[ 0 ] ] + + ( s.dataTypes[ 0 ] !== "*" ? ", " + allTypes + "; q=0.01" : "" ) : + s.accepts[ "*" ] + ); + + // Check for headers option + for ( i in s.headers ) { + jqXHR.setRequestHeader( i, s.headers[ i ] ); + } + + // Allow custom headers/mimetypes and early abort + if ( s.beforeSend && + ( s.beforeSend.call( callbackContext, jqXHR, s ) === false || completed ) ) { + + // Abort if not done already and return + return jqXHR.abort(); + } + + // Aborting is no longer a cancellation + strAbort = "abort"; + + // Install callbacks on deferreds + completeDeferred.add( s.complete ); + jqXHR.done( s.success ); + jqXHR.fail( s.error ); + + // Get transport + transport = inspectPrefiltersOrTransports( transports, s, options, jqXHR ); + + // If no transport, we auto-abort + if ( !transport ) { + done( -1, "No Transport" ); + } else { + jqXHR.readyState = 1; + + // Send global event + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxSend", [ jqXHR, s ] ); + } + + // If request was aborted inside ajaxSend, stop there + if ( completed ) { + return jqXHR; + } + + // Timeout + if ( s.async && s.timeout > 0 ) { + timeoutTimer = window.setTimeout( function() { + jqXHR.abort( "timeout" ); + }, s.timeout ); + } + + try { + completed = false; + transport.send( requestHeaders, done ); + } catch ( e ) { + + // Rethrow post-completion exceptions + if ( completed ) { + throw e; + } + + // Propagate others as results + done( -1, e ); + } + } + + // Callback for when everything is done + function done( status, nativeStatusText, responses, headers ) { + var isSuccess, success, error, response, modified, + statusText = nativeStatusText; + + // Ignore repeat invocations + if ( completed ) { + return; + } + + completed = true; + + // Clear timeout if it exists + if ( timeoutTimer ) { + window.clearTimeout( timeoutTimer ); + } + + // Dereference transport for early garbage collection + // (no matter how long the jqXHR object will be used) + transport = undefined; + + // Cache response headers + responseHeadersString = headers || ""; + + // Set readyState + jqXHR.readyState = status > 0 ? 4 : 0; + + // Determine if successful + isSuccess = status >= 200 && status < 300 || status === 304; + + // Get response data + if ( responses ) { + response = ajaxHandleResponses( s, jqXHR, responses ); + } + + // Use a noop converter for missing script but not if jsonp + if ( !isSuccess && + jQuery.inArray( "script", s.dataTypes ) > -1 && + jQuery.inArray( "json", s.dataTypes ) < 0 ) { + s.converters[ "text script" ] = function() {}; + } + + // Convert no matter what (that way responseXXX fields are always set) + response = ajaxConvert( s, response, jqXHR, isSuccess ); + + // If successful, handle type chaining + if ( isSuccess ) { + + // Set the If-Modified-Since and/or If-None-Match header, if in ifModified mode. + if ( s.ifModified ) { + modified = jqXHR.getResponseHeader( "Last-Modified" ); + if ( modified ) { + jQuery.lastModified[ cacheURL ] = modified; + } + modified = jqXHR.getResponseHeader( "etag" ); + if ( modified ) { + jQuery.etag[ cacheURL ] = modified; + } + } + + // if no content + if ( status === 204 || s.type === "HEAD" ) { + statusText = "nocontent"; + + // if not modified + } else if ( status === 304 ) { + statusText = "notmodified"; + + // If we have data, let's convert it + } else { + statusText = response.state; + success = response.data; + error = response.error; + isSuccess = !error; + } + } else { + + // Extract error from statusText and normalize for non-aborts + error = statusText; + if ( status || !statusText ) { + statusText = "error"; + if ( status < 0 ) { + status = 0; + } + } + } + + // Set data for the fake xhr object + jqXHR.status = status; + jqXHR.statusText = ( nativeStatusText || statusText ) + ""; + + // Success/Error + if ( isSuccess ) { + deferred.resolveWith( callbackContext, [ success, statusText, jqXHR ] ); + } else { + deferred.rejectWith( callbackContext, [ jqXHR, statusText, error ] ); + } + + // Status-dependent callbacks + jqXHR.statusCode( statusCode ); + statusCode = undefined; + + if ( fireGlobals ) { + globalEventContext.trigger( isSuccess ? "ajaxSuccess" : "ajaxError", + [ jqXHR, s, isSuccess ? success : error ] ); + } + + // Complete + completeDeferred.fireWith( callbackContext, [ jqXHR, statusText ] ); + + if ( fireGlobals ) { + globalEventContext.trigger( "ajaxComplete", [ jqXHR, s ] ); + + // Handle the global AJAX counter + if ( !( --jQuery.active ) ) { + jQuery.event.trigger( "ajaxStop" ); + } + } + } + + return jqXHR; + }, + + getJSON: function( url, data, callback ) { + return jQuery.get( url, data, callback, "json" ); + }, + + getScript: function( url, callback ) { + return jQuery.get( url, undefined, callback, "script" ); + } +} ); + +jQuery.each( [ "get", "post" ], function( _i, method ) { + jQuery[ method ] = function( url, data, callback, type ) { + + // Shift arguments if data argument was omitted + if ( isFunction( data ) ) { + type = type || callback; + callback = data; + data = undefined; + } + + // The url can be an options object (which then must have .url) + return jQuery.ajax( jQuery.extend( { + url: url, + type: method, + dataType: type, + data: data, + success: callback + }, jQuery.isPlainObject( url ) && url ) ); + }; +} ); + +jQuery.ajaxPrefilter( function( s ) { + var i; + for ( i in s.headers ) { + if ( i.toLowerCase() === "content-type" ) { + s.contentType = s.headers[ i ] || ""; + } + } +} ); + + +jQuery._evalUrl = function( url, options, doc ) { + return jQuery.ajax( { + url: url, + + // Make this explicit, since user can override this through ajaxSetup (#11264) + type: "GET", + dataType: "script", + cache: true, + async: false, + global: false, + + // Only evaluate the response if it is successful (gh-4126) + // dataFilter is not invoked for failure responses, so using it instead + // of the default converter is kludgy but it works. + converters: { + "text script": function() {} + }, + dataFilter: function( response ) { + jQuery.globalEval( response, options, doc ); + } + } ); +}; + + +jQuery.fn.extend( { + wrapAll: function( html ) { + var wrap; + + if ( this[ 0 ] ) { + if ( isFunction( html ) ) { + html = html.call( this[ 0 ] ); + } + + // The elements to wrap the target around + wrap = jQuery( html, this[ 0 ].ownerDocument ).eq( 0 ).clone( true ); + + if ( this[ 0 ].parentNode ) { + wrap.insertBefore( this[ 0 ] ); + } + + wrap.map( function() { + var elem = this; + + while ( elem.firstElementChild ) { + elem = elem.firstElementChild; + } + + return elem; + } ).append( this ); + } + + return this; + }, + + wrapInner: function( html ) { + if ( isFunction( html ) ) { + return this.each( function( i ) { + jQuery( this ).wrapInner( html.call( this, i ) ); + } ); + } + + return this.each( function() { + var self = jQuery( this ), + contents = self.contents(); + + if ( contents.length ) { + contents.wrapAll( html ); + + } else { + self.append( html ); + } + } ); + }, + + wrap: function( html ) { + var htmlIsFunction = isFunction( html ); + + return this.each( function( i ) { + jQuery( this ).wrapAll( htmlIsFunction ? html.call( this, i ) : html ); + } ); + }, + + unwrap: function( selector ) { + this.parent( selector ).not( "body" ).each( function() { + jQuery( this ).replaceWith( this.childNodes ); + } ); + return this; + } +} ); + + +jQuery.expr.pseudos.hidden = function( elem ) { + return !jQuery.expr.pseudos.visible( elem ); +}; +jQuery.expr.pseudos.visible = function( elem ) { + return !!( elem.offsetWidth || elem.offsetHeight || elem.getClientRects().length ); +}; + + + + +jQuery.ajaxSettings.xhr = function() { + try { + return new window.XMLHttpRequest(); + } catch ( e ) {} +}; + +var xhrSuccessStatus = { + + // File protocol always yields status code 0, assume 200 + 0: 200, + + // Support: IE <=9 only + // #1450: sometimes IE returns 1223 when it should be 204 + 1223: 204 + }, + xhrSupported = jQuery.ajaxSettings.xhr(); + +support.cors = !!xhrSupported && ( "withCredentials" in xhrSupported ); +support.ajax = xhrSupported = !!xhrSupported; + +jQuery.ajaxTransport( function( options ) { + var callback, errorCallback; + + // Cross domain only allowed if supported through XMLHttpRequest + if ( support.cors || xhrSupported && !options.crossDomain ) { + return { + send: function( headers, complete ) { + var i, + xhr = options.xhr(); + + xhr.open( + options.type, + options.url, + options.async, + options.username, + options.password + ); + + // Apply custom fields if provided + if ( options.xhrFields ) { + for ( i in options.xhrFields ) { + xhr[ i ] = options.xhrFields[ i ]; + } + } + + // Override mime type if needed + if ( options.mimeType && xhr.overrideMimeType ) { + xhr.overrideMimeType( options.mimeType ); + } + + // X-Requested-With header + // For cross-domain requests, seeing as conditions for a preflight are + // akin to a jigsaw puzzle, we simply never set it to be sure. + // (it can always be set on a per-request basis or even using ajaxSetup) + // For same-domain requests, won't change header if already provided. + if ( !options.crossDomain && !headers[ "X-Requested-With" ] ) { + headers[ "X-Requested-With" ] = "XMLHttpRequest"; + } + + // Set headers + for ( i in headers ) { + xhr.setRequestHeader( i, headers[ i ] ); + } + + // Callback + callback = function( type ) { + return function() { + if ( callback ) { + callback = errorCallback = xhr.onload = + xhr.onerror = xhr.onabort = xhr.ontimeout = + xhr.onreadystatechange = null; + + if ( type === "abort" ) { + xhr.abort(); + } else if ( type === "error" ) { + + // Support: IE <=9 only + // On a manual native abort, IE9 throws + // errors on any property access that is not readyState + if ( typeof xhr.status !== "number" ) { + complete( 0, "error" ); + } else { + complete( + + // File: protocol always yields status 0; see #8605, #14207 + xhr.status, + xhr.statusText + ); + } + } else { + complete( + xhrSuccessStatus[ xhr.status ] || xhr.status, + xhr.statusText, + + // Support: IE <=9 only + // IE9 has no XHR2 but throws on binary (trac-11426) + // For XHR2 non-text, let the caller handle it (gh-2498) + ( xhr.responseType || "text" ) !== "text" || + typeof xhr.responseText !== "string" ? + { binary: xhr.response } : + { text: xhr.responseText }, + xhr.getAllResponseHeaders() + ); + } + } + }; + }; + + // Listen to events + xhr.onload = callback(); + errorCallback = xhr.onerror = xhr.ontimeout = callback( "error" ); + + // Support: IE 9 only + // Use onreadystatechange to replace onabort + // to handle uncaught aborts + if ( xhr.onabort !== undefined ) { + xhr.onabort = errorCallback; + } else { + xhr.onreadystatechange = function() { + + // Check readyState before timeout as it changes + if ( xhr.readyState === 4 ) { + + // Allow onerror to be called first, + // but that will not handle a native abort + // Also, save errorCallback to a variable + // as xhr.onerror cannot be accessed + window.setTimeout( function() { + if ( callback ) { + errorCallback(); + } + } ); + } + }; + } + + // Create the abort callback + callback = callback( "abort" ); + + try { + + // Do send the request (this may raise an exception) + xhr.send( options.hasContent && options.data || null ); + } catch ( e ) { + + // #14683: Only rethrow if this hasn't been notified as an error yet + if ( callback ) { + throw e; + } + } + }, + + abort: function() { + if ( callback ) { + callback(); + } + } + }; + } +} ); + + + + +// Prevent auto-execution of scripts when no explicit dataType was provided (See gh-2432) +jQuery.ajaxPrefilter( function( s ) { + if ( s.crossDomain ) { + s.contents.script = false; + } +} ); + +// Install script dataType +jQuery.ajaxSetup( { + accepts: { + script: "text/javascript, application/javascript, " + + "application/ecmascript, application/x-ecmascript" + }, + contents: { + script: /\b(?:java|ecma)script\b/ + }, + converters: { + "text script": function( text ) { + jQuery.globalEval( text ); + return text; + } + } +} ); + +// Handle cache's special case and crossDomain +jQuery.ajaxPrefilter( "script", function( s ) { + if ( s.cache === undefined ) { + s.cache = false; + } + if ( s.crossDomain ) { + s.type = "GET"; + } +} ); + +// Bind script tag hack transport +jQuery.ajaxTransport( "script", function( s ) { + + // This transport only deals with cross domain or forced-by-attrs requests + if ( s.crossDomain || s.scriptAttrs ) { + var script, callback; + return { + send: function( _, complete ) { + script = jQuery( " + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Statistics +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Statistics + + ¶ + +

    +

    + cvc5 collects a wide variety of statistics that give some insight on how it solves a particular input. +The statistics can be inspected via the + + + + Solver::getStatistics() + + + + API +function, or printed using the following options: +

    + +

    + Statistics collection is only available if the + + + ENABLE_STATISTICS + + + cmake option +is set to true, which is the case for all but competition builds. +Statistics, obtained via + + + + Solver::getStatistics() + + + + , +are always a snapshot of the statistics values that is decoupled from the +solver object and will not change when the solver is used again or deallocated. +Individual statistics values can be obtained via the API either by iterating over the + + + + Statistics + + + + object or by querying it by name. +

    +

    + A statistic value (of type + + + + Stat + + + + ) has two general +properties, + + + + isInternal() + + + + and + + + + isDefault() + + + + . + + + + isInternal() + + + + indicates whether a +statistic is considered public or internal. Public statistics are considered to +be part of the public API and should therefore remain stable across different +minor versions of cvc5. There is no such guarantee for internal statistics. + + + + isDefault() + + + + checks whether the +current value of a statistics is still the default value, or whether its value +was changed. +

    +

    + A statistic value can be any of the following types: +

    +
      +
    • +

      + integer, more specifically a signed 64-bit integer ( + + + int64_t + + + in C++). +

      +
    • +
    • +

      + double, a 64-bit floating-point value ( + + + double + + + in C++). +

      +
    • +
    • +

      + string, a character sequence ( + + + std::string + + + in C++). Timer statistics are +exported as string values as well, given as + + + "<value>ms" + + + . +

      +
    • +
    • +

      + histogram, a mapping from some integral or enumeration type to their count. +The integral or enumeration types are exported as string representations +( + + + std::map<std::string, + + + uint64_t> + + + in C++). +

      +
    • +
    +

    + Printing statistics on the command line looks like this: +

    +
    +
    +
    $ bin/cvc5 --stats ../test/regress/cli/regress0/auflia/bug336.smt2
    +unsat
    +cvc5::CONSTANT = { UNKNOWN_TYPE_CONSTANT: 4, integer type: 4 }
    +cvc5::TERM = { AND: 1, APPLY_UF: 4, EQUAL: 4, NOT: 2, STORE: 2 }
    +driver::filename = ../test/regress/cli/regress0/auflia/bug336.smt2
    +global::totalTime = 5ms
    +theory::arith::inferencesLemma = { ARITH_SPLIT_DEQ: 1 }
    +theory::arrays::inferencesFact = { ARRAYS_READ_OVER_WRITE_1: 2 }
    +theory::arrays::inferencesLemma = { ARRAYS_EXT: 1, ARRAYS_READ_OVER_WRITE: 3 }
    +theory::builtin::inferencesLemma = { COMBINATION_SPLIT: 1 }
    +
    +
    +
    +

    + Public statistics include some general information about the input file +( + + + driver::filename + + + and + + + * + + + ), the overall runtime ( + + + global::totalTime + + + ) +and the lemmas each theory sent to the core solver ( + + + theory::* + + + ). +

    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/bags.html b/cvc5-1.0.2/theories/bags.html new file mode 100644 index 0000000..526f5e9 --- /dev/null +++ b/cvc5-1.0.2/theories/bags.html @@ -0,0 +1,1613 @@ + + + + + + + + Theory Reference: Bags — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Bags + + ¶ + +

    +
    +

    + Finite Bags + + ¶ + +

    +

    + cvc5 supports the theory of finite bags using the following sorts, constants, +functions and predicates. +

    +

    + For the C++ API examples in the table below, we assume that we have created +a + + cvc5::Solver solver + + object. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMTLIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + + + (set-logic + + + ALL) + + +

    +
    +

    + + + solver.setLogic("ALL"); + + +

    +
    +

    + Sort +

    +
    +

    + + + (Bag + + + <Sort>) + + +

    +
    +

    + + + solver.mkBagSort(cvc5::Sort + + + elementSort); + + +

    +
    +

    + Constants +

    +
    +
    +
    + + + (declare-const + + + X + + + (Bag + + + String)) + + + | + + + Sort + + + s + + + = + + + solver.mkBagSort(solver.getStringSort()); + + +
    +
    +
    +
    +
    +
    +
    + + + Term + + + X + + + = + + + solver.mkConst(s, + + + "X"); + + +
    +
    +
    +
    +
    +

    + Union disjoint +

    +
    +

    + + + (bag.union_disjoint + + + X + + + Y) + + +

    +
    +

    + + + Term + + + Y + + + = + + + solver.mkConst(s, + + + "Y"); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_UNION_DISJOINT, + + + {X, + + + Y}); + + +

    +
    +

    + Union max +

    +
    +

    + + + (bag.union_max + + + X + + + Y) + + +

    +
    +

    + + + Term + + + Y + + + = + + + solver.mkConst(s, + + + "Y"); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_UNION_MAX, + + + {X, + + + Y}); + + +

    +
    +

    + Intersection min +

    +
    +

    + + + (bag.inter_min + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_INTER_MIN, + + + {X, + + + Y}); + + +

    +
    +

    + Difference subtract +

    +
    +

    + + + (bag.difference_subtract + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_DIFFERENCE_SUBTRACT, + + + {X, + + + Y}); + + +

    +
    +

    + Duplicate elimination +

    +
    +

    + + + (bag.duplicate_removal + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_DUPLICATE_REMOVAL, + + + {X}); + + +

    +
    +

    + Membership +

    +
    +

    + + + (bag.member + + + x + + + X) + + +

    +
    +

    + + + Term + + + x + + + = + + + solver.mkConst(solver.getStringSort(), + + + "x"); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_MEMBER, + + + {x, + + + X}); + + +

    +
    +

    + Subbag +

    +
    +

    + + + (bag.subbag + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_SUBBAG, + + + {X, + + + Y}); + + +

    +
    +

    + Emptybag +

    +
    +

    + + + (as + + + bag.empty + + + (Bag + + + Int)) + + + | + + + Term + + + t + + + = + + + solver.mkEmptyBag(s); + + +

    +
    +

    + Make bag +

    +
    +

    + + + (bag + + + "a" + + + 3) + + +

    +
    +
    +
    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::BAG_MAKE, + + +
    +
    +

    + + + {solver.mkString("a"), + + + solver.mkInteger(1)}); + + +

    +
    +
    +
    +
    +

    + Semantics + + ¶ + +

    +

    + A bag (or a multiset) + + \(m\) + + can be defined as a function from the domain of its elements +to the set of natural numbers (i.e., + + \(m : D \rightarrow \mathbb{N}\) + + ), +where + + \(m(e)\) + + represents the multiplicity of element + + \(e\) + + in the bag + + \(m\) + + . +

    +

    + The semantics of supported bag operators is given in the table below. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    + Bag operator +

    +
    +

    + cvc5 operator +

    +
    +

    + Semantics +

    +
    +

    + union disjoint + + \(m_1 \uplus m_2\) + +

    +
    +

    + bag.union_disjoint +

    +
    +

    + + \(\forall e. \; (m_1 \uplus m_2)(e) = m_1(e) + m_2 (e)\) + +

    +
    +

    + union max + + \(m_1 \cup m_2\) + +

    +
    +

    + bag.union_max +

    +
    +

    + + \(\forall e. \; (m_1 \cup m_2)(e) = max(m_1(e), m_2 (e))\) + +

    +
    +

    + intersection + + \(m_1 \cap m_2\) + +

    +
    +

    + bag.inter_min +

    +
    +

    + + \(\forall e. \; (m_1 \cap m_2)(e) = min(m_1(e), m_2 (e))\) + +

    +
    +

    + difference subtract + + \(m_1 \setminus m_2\) + +

    +
    +

    + bag.difference_subtract +

    +
    +

    + + \(\forall e. \; (m_1 \setminus m_2)(e) = max(m_1(e) - m_2 (e), 0)\) + +

    +
    +

    + difference remove + + \(m_1 \setminus\setminus m_2\) + +

    +
    +

    + bag.difference_remove +

    +
    +

    + + \(\forall e. \; (m_1 \setminus\setminus m_2)(e) = ite(m_2(e) = 0, m_1(e), 0)\) + +

    +
    +

    + duplicate elimination + + \(\delta(m)\) + +

    +
    +

    + bag.duplicate_removal +

    +
    +

    + + \(\forall e. \; (\delta(m))(e) = ite(1 \leq m(e), 1, 0)\) + +

    +
    +

    + subbag + + \(m_1 \subseteq m_2\) + +

    +
    +

    + bag.subbag +

    +
    +

    + + \(\forall e. \; m_1(e) \leq m_2(e)\) + +

    +
    +

    + equality + + \(m_1 = m_2\) + +

    +
    +

    + = +

    +
    +

    + + \(\forall e. \; m_1(e) = m_2(e)\) + +

    +
    +

    + membership + + \(e \in m\) + +

    +
    +

    + bag.member +

    +
    +

    + + \(m(e) \geq 1\) + +

    +
    +

    + Below is a more extensive example on how to use finite bags: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/bags.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Mudathir Mohamed
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of reasoning about bags.
    + 14  */
    + 15 
    + 16 #include <cvc5/cvc5.h>
    + 17 
    + 18 #include <iostream>
    + 19 
    + 20 using namespace std;
    + 21 using namespace cvc5;
    + 22 
    + 23 int main()
    + 24 {
    + 25   Solver slv;
    + 26   slv.setLogic("ALL");
    + 27   // Produce models
    + 28   slv.setOption("produce-models", "true");
    + 29   slv.setOption("incremental", "true");
    + 30 
    + 31   Sort bag = slv.mkBagSort(slv.getStringSort());
    + 32   Term A = slv.mkConst(bag, "A");
    + 33   Term B = slv.mkConst(bag, "B");
    + 34   Term C = slv.mkConst(bag, "C");
    + 35   Term x = slv.mkConst(slv.getStringSort(), "x");
    + 36 
    + 37   Term intersectionAC = slv.mkTerm(BAG_INTER_MIN, {A, C});
    + 38   Term intersectionBC = slv.mkTerm(BAG_INTER_MIN, {B, C});
    + 39 
    + 40   // union disjoint does not distribute over intersection
    + 41   {
    + 42     Term unionDisjointAB = slv.mkTerm(BAG_UNION_DISJOINT, {A, B});
    + 43     Term lhs = slv.mkTerm(BAG_INTER_MIN, {unionDisjointAB, C});
    + 44     Term rhs = slv.mkTerm(BAG_UNION_DISJOINT, {intersectionAC, intersectionBC});
    + 45     Term guess = slv.mkTerm(EQUAL, {lhs, rhs});
    + 46     cout << "cvc5 reports: " << guess.notTerm() << " is "
    + 47          << slv.checkSatAssuming(guess.notTerm()) << "." << endl;
    + 48 
    + 49     cout << A << ": " << slv.getValue(A) << endl;
    + 50     cout << B << ": " << slv.getValue(B) << endl;
    + 51     cout << C << ": " << slv.getValue(C) << endl;
    + 52     cout << lhs << ": " << slv.getValue(lhs) << endl;
    + 53     cout << rhs << ": " << slv.getValue(rhs) << endl;
    + 54   }
    + 55 
    + 56   // union max distributes over intersection
    + 57   {
    + 58     Term unionMaxAB = slv.mkTerm(BAG_UNION_MAX, {A, B});
    + 59     Term lhs = slv.mkTerm(BAG_INTER_MIN, {unionMaxAB, C});
    + 60     Term rhs = slv.mkTerm(BAG_UNION_MAX, {intersectionAC, intersectionBC});
    + 61     Term theorem = slv.mkTerm(EQUAL, {lhs, rhs});
    + 62     cout << "cvc5 reports: " << theorem.notTerm() << " is "
    + 63          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    + 64   }
    + 65 
    + 66   // Verify emptbag is a subbag of any bag
    + 67   {
    + 68     Term emptybag = slv.mkEmptyBag(bag);
    + 69     Term theorem = slv.mkTerm(BAG_SUBBAG, {emptybag, A});
    + 70 
    + 71     cout << "cvc5 reports: " << theorem.notTerm() << " is "
    + 72          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    + 73   }
    + 74 
    + 75   // find an element with multiplicity 4 in the disjoint union of
    + 76   // ; {|"a", "a", "b", "b", "b"|} and {|"b", "c", "c"|}
    + 77 
    + 78   {
    + 79     Term one = slv.mkInteger(1);
    + 80     Term two = slv.mkInteger(2);
    + 81     Term three = slv.mkInteger(3);
    + 82     Term four = slv.mkInteger(4);
    + 83     Term a = slv.mkString("a");
    + 84     Term b = slv.mkString("b");
    + 85     Term c = slv.mkString("c");
    + 86 
    + 87     Term bag_a_2 = slv.mkTerm(BAG_MAKE, {a, two});
    + 88     Term bag_b_3 = slv.mkTerm(BAG_MAKE, {b, three});
    + 89     Term bag_b_1 = slv.mkTerm(BAG_MAKE, {b, one});
    + 90     Term bag_c_2 = slv.mkTerm(BAG_MAKE, {c, two});
    + 91     Term bag_a_2_b_3 = slv.mkTerm(BAG_UNION_DISJOINT, {bag_a_2, bag_b_3});
    + 92     Term bag_b_1_c_2 = slv.mkTerm(BAG_UNION_DISJOINT, {bag_b_1, bag_c_2});
    + 93     Term union_disjoint =
    + 94         slv.mkTerm(BAG_UNION_DISJOINT, {bag_a_2_b_3, bag_b_1_c_2});
    + 95 
    + 96     Term count_x = slv.mkTerm(BAG_COUNT, {x, union_disjoint});
    + 97     Term e = slv.mkTerm(EQUAL, {four, count_x});
    + 98     Result result = slv.checkSatAssuming(e);
    + 99 
    +100     cout << "cvc5 reports: " << e << " is " << result << "." << endl;
    +101     if (result.isSat())
    +102     {
    +103       cout << x << ": " << slv.getValue(x) << endl;
    +104     }
    +105   }
    +106 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/datatypes.html b/cvc5-1.0.2/theories/datatypes.html new file mode 100644 index 0000000..f0d46a1 --- /dev/null +++ b/cvc5-1.0.2/theories/datatypes.html @@ -0,0 +1,2326 @@ + + + + + + + + Theory Reference: Datatypes — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Datatypes + + ¶ + +

    +

    + cvc5 implements some extensions to the support for datatypes in SMT-LIB 2. +

    +
    +

    + Logic + + ¶ + +

    +

    + To enable cvc5’s decision procedure for datatypes, include + + + DT + + + in the logic: +

    +
    +
    +
    (set-logic QF_DT)
    +
    +
    +
    +

    + Alternatively, use the + + + ALL + + + logic: +

    +
    +
    +
    (set-logic ALL)
    +
    +
    +
    +
    +
    +

    + Syntax + + ¶ + +

    +

    + cvc5 supports the following syntax for declaring mutually recursive blocks of +datatypes in + + + *.smt2 + + + input files in the smt lib 2.6 format: +

    +
    +
    +
    (declare-datatypes ((D1 n1) ... (Dk nk))
    + (((C1 (S11 T1) ... (S1i Ti)) ... (Cj ... ))
    +  ...
    +  ((...) ... (...)))
    +
    +
    +
    +

    + where + + + D1 + + + ... + + + Dk + + + are datatype types, + + + C1 + + + ... + + + Cj + + + are the constructors for +datatype + + + D1 + + + , + + + S11 + + + ... + + + S1i + + + are the selectors (or “destructors”) of constructor + + + C1 + + + , and +each + + + T1 + + + ... + + + Ti + + + is a previously declared type or one of + + + D1 + + + ... + + + Dk + + + . +The numbers + + + n1 + + + ... + + + nk + + + denote the number of type +parameters for the datatype, where + + + 0 + + + is used for non-parametric datatypes. +

    +

    + In addition to declaring symbols for constructors and selectors, the above +command also allows for tester (or “discriminator”) indexed symbols of the form + + + (_ + + + is + + + C) + + + for each constructor + + + C + + + , which are unary predicates which +evaluate to true iff their argument has top-symbol + + + C + + + . It also allows for +updater indexed symbols of the form + + + (_ + + + update + + + Sij) + + + for each selector + + + Sij + + + , +whose semantics are described below. +

    +
    +
    +

    + Semantics + + ¶ + +

    +

    + The decision procedure for inductive datatypes is described in + + [ + + BST07 + + ] + + . +

    +
    +
    +

    + Example Declarations + + ¶ + +

    +

    + An enumeration: +

    +
    +
    +
    (declare-datatypes ((Color 0))
    + (((Red) (Black))))
    +
    +
    +
    +

    + A List of + + + Int + + + with + + + cons + + + and + + + nil + + + as constructors: +

    +
    +
    +
    (declare-datatypes ((list 0))
    + (((cons (head Int) (tail list)) (nil))))
    +
    +
    +
    +

    + A parametric List of T’s: +

    +
    +
    +
    (declare-datatypes ((list 1))
    + ((par (T) ((cons (head T) (tail (list T))) (nil)))))
    +
    +
    +
    +

    + Mutual recursion: +

    +
    +
    +
    (declare-datatypes ((list 0) (tree 0))
    + (((cons (head tree) (tail list)) (nil))
    +  ((node (data Int) (children list)))))
    +
    +
    +
    +

    + A (non-recursive) record type: +

    +
    +
    +
    (declare-datatypes ((record 0))
    + (((rec (fname String) (lname String) (id Int)))))
    +
    +
    +
    +
    +
    +

    + Examples + + ¶ + +

    +
    +
    +
    (declare-datatypes ((list 0))
    +   (((cons (head Int) (tail list)) (nil))))
    + (declare-const a list)
    + (declare-const b list)
    + (assert (and (= (tail a) b) (not ((_ is nil) b)) (> (head b) 0)))
    + (check-sat)
    +
    +
    +
    +
    +
    +
    (declare-datatypes ((record 0))
    +  (((rec (fname String) (lname String) (id Int)))))
    +(declare-const x record)
    +(assert (and (= (fname x) "John") (= (lname x) "Smith")))
    +(check-sat)
    +
    +
    +
    +
    +
    +

    + Datatype Updaters + + ¶ + +

    +

    + Datatype updaters are a (non-standard) extension available in datatype logics. +The term: +

    +
    +
    +
    ((_ update Sij) t u)
    +
    +
    +
    +

    + is equivalent to replacing the field of + + + t + + + denoted by the selector + + + Sij + + + with the value + + + u + + + , or + + + t + + + itself if that selector does not apply to the +constructor symbol of + + + t + + + . For example, for the list datatype, we have that: +

    +
    +
    +
    ((_ update head) (cons 4 nil) 7) = (cons 7 nil)
    +((_ update tail) (cons 4 nil) (cons 5 nil)) = (cons 4 (cons 5 nil))
    +((_ update head) nil 5) = nil
    +
    +
    +
    +

    + Note that datatype updaters can be seen as syntax sugar for an if-then-else +term that checks whether the constructor of + + + t + + + is the same as the one +associated with the given selector. +

    +
    +
    +

    + Parametric Datatypes + + ¶ + +

    +

    + Instances of parametric datatypes must have their arguments instantiated with +concrete types. For instance, in the example: +

    +
    +
    +
    (declare-datatypes ((list 1)) ((par (T) (cons (head T) (tail (list T))) (nil))))
    +
    +
    +
    +

    + To declare a list of + + + Int + + + , use the command: +

    +
    +
    +
    (declare-const f (list Int))
    +
    +
    +
    +

    + Use of constructors that are ambiguously typed must be cast to a concrete type, +for instance all occurrences of + + + nil + + + for the above datatype must be cast with +the syntax: +

    +
    +
    +
    (as nil (list Int))
    +
    +
    +
    +
    +
    +

    + Tuples + + ¶ + +

    +

    + Tuples are a particular instance of an inductive datatype. cvc5 supports +special syntax for tuples as an extension of the SMT-LIB version 2 format. +For example: +

    +
    +
    +
    (declare-const t (Tuple Int Int))
    +(assert (= ((_ tuple.select 0) t) 3))
    +(assert (not (= t (tuple 3 4))))
    +
    +
    +
    +
    +
    +

    + Codatatypes + + ¶ + +

    +

    + cvc5 also supports co-inductive datatypes, as described in + + [ + + RB15 + + ] + + . +

    +

    + The syntax for declaring mutually recursive coinductive datatype blocks is +identical to inductive datatypes, except that + + + declare-datatypes + + + is replaced +by + + + declare-codatatypes + + + . For example, the following declares the type denote +streams of + + + Int + + + : +

    +
    +
    +
    (declare-codatatypes ((stream 0))
    + (((cons (head Int) (tail stream)))))
    +
    +
    +
    +
    +
    +

    + Syntax/API + + ¶ + +

    +

    + For the C++ API examples in the table below, we assume that we have created +a + + cvc5::Solver solver + + object. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMTLIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + + + (set-logic + + + QF_DT) + + +

    +
    +

    + + + solver.setLogic("QF_DT"); + + +

    +
    +

    + Datatype Sort +

    +
    +

    + + + (declare-datatype + + + ...) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkDatatypeSort(...); + + +

    +
    +

    + Datatype Sorts +

    +
    +

    + + + (declare-datatypes + + + ...) + + +

    +
    +

    + + + std::vector<Sort> + + + s + + + = + + + solver.mkDatatypeSorts(...); + + +

    +
    +

    + Constructor +

    +
    +

    + + + (Ci + + + <Term_1>, + + + ..., + + + <Term_n>) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkDatatypeSort(...); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + ci + + + = + + + dt[i].getTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_CONSTRUCTOR, + + + {ci, + + + <Term_1>, + + + ..., + + + <Term_n>}); + + +

    +
    +

    + Selector +

    +
    +

    + + + (Sij + + + t) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkDatatypeSort(...); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + sij + + + = + + + dt[i].getSelector(j).getTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_SELECTOR, + + + {sij, + + + t}); + + +

    +
    +

    + Updater +

    +
    +

    + + + ((_ + + + update + + + Sij) + + + t + + + u) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkDatatypeSort(...); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + upd + + + = + + + dt[i].getSelector(j).getUpdaterTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_UPDATER, + + + {upd, + + + t, + + + u}); + + +

    +
    +

    + Tester +

    +
    +

    + + + ((_ + + + is + + + Ci) + + + t) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkDatatypeSort(...); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + upd + + + = + + + dt[i].getTesterTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_TESTER, + + + {upd, + + + t, + + + u}); + + +

    +
    +

    + Tuple Sort +

    +
    +

    + + + (Tuple + + + <Sort_1>, + + + ..., + + + <Sort_n>) + + +

    +
    +

    + + + std::vector<cvc5::Sort> + + + sorts + + + = + + + { + + + ... + + + }; + + +

    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +
    + +

    + + + (declare-const + + + t + + + (Tuple + + + Int + + + Int)) + + +

    +
    +

    + + + Sort + + + s_int + + + = + + + solver.getIntegerSort(); + + +

    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort({s_int, + + + s_int}); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkConst(s, + + + "t"); + + +

    +
    +

    + Tuple Constructor +

    +
    +

    + + + (tuple + + + <Term_1>, + + + ..., + + + <Term_n>) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + c + + + = + + + dt[0].getTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_CONSTRUCTOR, + + + {c, + + + <Term_1>, + + + ..., + + + <Term_n>}); + + +

    +
    +

    + Tuple Selector +

    +
    +

    + + + ((_ + + + tuple.select + + + i) + + + t) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + sel + + + = + + + dt[0].getSelector(i).getTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_SELECTOR, + + + {sel, + + + t}); + + +

    +
    +

    + Tuple Updater +

    +
    +

    + + + ((_ + + + tuple.update + + + i) + + + t + + + u) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + upd + + + = + + + dt[0].getSelector(i).getUpdaterTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_UPDATER, + + + {upd, + + + t, + + + u}); + + +

    +
    +

    + Tuple Projection +

    +
    +

    + + + ((_ + + + tuple.project + + + i1 + + + ... + + + in) + + + t) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + proj + + + = + + + solver.mkOp(Kind::TUPLE_PROJECT, + + + {i1, + + + ..., + + + in}); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::TUPLE_PROJECT, + + + {proj, + + + t}); + + +

    +
    +

    + Record Sort +

    +
    +

    + n/a +

    +
    +

    + + + Sort + + + s + + + = + + + mkRecordSort(const + + + std::vector<std::pair<std::string, + + + Sort>>& + + + fields); + + +

    +
    + +

    + n/a +

    +
    +

    + + + std::vector<std::pair<std::string, + + + Sort>> + + + fields; + + +

    +

    + + + fields.push_back(std::pair<std::string, + + + Sort>("fst", + + + solver.getIntegerSort())); + + +

    +

    + + + fields.push_back(std::pair<std::string, + + + Sort>("snd", + + + solver.getIntegerSort())); + + +

    +

    + + + Sort + + + s + + + = + + + mkRecordSort(fields); + + +

    +
    +

    + Record Constructor +

    +
    +

    + n/a +

    +
    +

    + + + Sort + + + s + + + = + + + mkRecordSort(fields); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + c + + + = + + + dt[0].getTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_CONSTRUCTOR, + + + {c, + + + <Term_1>, + + + ..., + + + <Term_n>}); + + +

    +
    +

    + Record Selector +

    +
    +

    + n/a +

    +
    +

    + + + Sort + + + s + + + = + + + mkRecordSort(fields); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + sel + + + = + + + dt[0].getSelector(name).getSelectorTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_SELECTOR, + + + {sel, + + + t}); + + +

    +
    +

    + Record Updater +

    +
    +

    + n/a +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkRecordSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + upd + + + = + + + dt[0].getSelector(name).getUpdaterTerm(); + + +

    +

    + + + Term + + + r + + + = + + + solver.mkTerm(Kind::APPLY_UPDATER, + + + {upd, + + + t, + + + u}); + + +

    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/separation-logic.html b/cvc5-1.0.2/theories/separation-logic.html new file mode 100644 index 0000000..a76b1e0 --- /dev/null +++ b/cvc5-1.0.2/theories/separation-logic.html @@ -0,0 +1,1159 @@ + + + + + + + + Theory Reference: Separation Logic — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Separation Logic + + ¶ + +

    +

    + cvc5 supports a syntax for separation logic as an extension of the SMT-LIB 2.6 +language. +

    +
    +

    + Signature + + ¶ + +

    +

    + Given a (decidable) base theory + + \(T\) + + , cvc5 implements a decision procedure +for quantifier-free + + \(SL(T)_{Loc,Data}\) + + formulas + + [ + + RISK16 + + ] + + , +where + + \(Loc\) + + and + + \(Data\) + + are any sort belonging to + + \(T\) + + . +

    +

    + A + + \(SL(T)_{Loc,Data}\) + + formula is one from the following grammar: +

    +
    +
    +
    F : L | sep.emp | (pto t u) | (sep F1 ... Fn) | (wand F1 F2) | ~F1 | F1 op ... op Fn
    +
    +
    +
    +

    + where + + + op + + + is any classical Boolean connective, + + + t + + + and + + + u + + + are terms +built from symbols in the signature of + + \(T\) + + of sort + + \(Loc\) + + and + + \(Data\) + + respectively, and + + \(L\) + + is a + + \(T\) + + -literal. +

    +

    + The operator + + + sep.emp + + + denotes the empty heap constraint, the operator + + + pto + + + denotes the points-to predicate, the operator + + + sep + + + denotes separation start +and is variadic, and the operator + + + wand + + + denote magic wand. +

    +
    +
    +

    + Semantics + + ¶ + +

    +

    + A satisfiability relation + + \(I,h \models_{SL} \varphi\) + + is defined for + + \(SL(T)_{Loc,Data}\) + + formulas + + \(\varphi\) + + , +where + + \(I\) + + is an interpretation, and + + \(h\) + + is a heap. +

    +

    + The semantics of separation logic operators are as follows: +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    +

    + + \(I,h \models_{SL} L\) + +

    +
    +

    + Iff +

    +
    +

    + + \(I \models L\) + + , if + + \(L\) + + is a + + \(T\) + + -literal +

    +
    +

    + + \(I,h \models_{SL}\) + + (emp + + \(t \ u\) + + ) +

    +
    +

    + Iff +

    +
    +

    + + \(h = \emptyset\) + +

    +
    +

    + + \(I,h \models_{SL}\) + + (pto + + \(t \ u\) + + ) +

    +
    +

    + Iff +

    +
    +

    + + \(h = \{(t^I,u^I)\} \text{ and } t^I\not=nil^I\) + +

    +
    +

    + + \(I,h \models_{SL}\) + + (sep + + \(\phi_1 \ldots \phi_n)\) + +

    +
    +

    + Iff +

    +
    +

    + there exist heaps + + \(h_1,\ldots,h_n\) + + s.t. + + \(h=h_1\uplus \ldots \uplus h_n\) + +

    +

    + and + + \(I,h_i \models_{SL} \phi_i, i = 1,\ldots,n\) + +

    +
    +

    + + \(I,h \models_{SL}\) + + (wand + + \(\phi_1 \ \phi_2\) + + ) +

    +
    +

    + Iff +

    +
    +

    + for all heaps + + \(h'\) + + if + + \(h'\#h\) + + and + + \(I,h' \models_{SL} \phi_1\) + +

    +

    + then + + \(I,h'\uplus h \models_{SL} \phi_2\) + +

    +
    +

    + where + + \(h_1 \uplus \ldots \uplus h_n\) + + denotes the disjoint union of heaps + + \(h_1, \ldots, h_n\) + + and + + \(h'\#h\) + + denotes that heaps + + \(h'\) + + and + + \(h\) + + are disjoint, and + + \(nil\) + + is a distinguished variable of sort + + \(Loc\) + + . +All classical Boolean connectives are interpreted as expected. +

    +
    +
    +

    + Syntax + + ¶ + +

    +

    + Separation logic in cvc5 requires the + + + QF_ALL + + + logic, and for the types of the heap to be declared via the + + declare-heap + + command: +

    +
    +
    +
    (declare-heap (T1 T2))
    +
    +
    +
    +

    + This command must be executed when the solver is in its Start mode (see page 52 of the SMT-LIB 2.6 standard + + [ + + BFT17 + + ] + + ). This command sets the location type of the heap + + \(Loc\) + + to + + \(T1\) + + and the data type + + \(Data\) + + to + + \(T2\) + + , where + + \(T1\) + + and + + \(T2\) + + are any defined types. This command can only be executed once in any context, and is reset only via a + + reset + + command. +

    +

    + The syntax for the operators of separation logic is summarized in the following +table. For the C++ API examples in this table, we assume that we have created +a + + + + cvc5::Solver + + + + object. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMTLIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + + + (set-logic + + + QF_ALL) + + +

    +
    +

    + + + solver.setLogic("QF_ALL"); + + +

    +
    +

    + Empty Heap +

    +
    +

    + + + sep.emp + + +

    +
    +

    + + + solver.mkSepEmp(); + + +

    +

    + where + + + x + + + and + + + y + + + are of sort + + + <Sort_1> + + + and + + + <Sort_2> + + +

    +
    +

    + Points-To +

    +
    +

    + + + (pto + + + x + + + y) + + +

    +
    +

    + + + solver.mkTerm(Kind::SEP_PTO, + + + {x, + + + y}); + + +

    +
    +

    + Separation Star +

    +
    +

    + + + (sep + + + c1 + + + .. + + + cn) + + +

    +
    +

    + + + solver.mkTerm(Kind::SEP_STAR, + + + {c1, + + + ..., + + + cn}); + + +

    +
    +

    + Magic Wand +

    +
    +

    + + + (wand + + + c1 + + + c1) + + +

    +
    +

    + + + solver.mkTerm(Kind::SEP_WAND, + + + {c1, + + + c2}); + + +

    +
    +

    + Nil Element +

    +
    +

    + + + (as + + + sep.nil + + + <Sort>) + + +

    +
    +

    + + + solver.mkSepNil(cvc5::Sort + + + sort); + + +

    +
    +
    +
    +

    + Examples + + ¶ + +

    +

    + The following input on heaps + + + Int + + + -> + + + Int + + + is unsatisfiable: +

    +
    +
    +
    (set-logic QF_ALL)
    +(declare-heap (Int Int))
    +(set-info :status unsat)
    +(declare-const x Int)
    +(declare-const a Int)
    +(declare-const b Int)
    +(assert (and (pto x a) (pto x b)))
    +(assert (not (= a b)))
    +(check-sat)
    +
    +
    +
    +

    + The following input on heaps + + + U + + + -> + + + Int + + + is satisfiable. Notice that the +formula + + + (not + + + sep.emp) + + + is satisfied by heaps + + + U + + + -> + + + Int + + + whose domain is +non-empty. +

    +
    +
    +
    (set-logic QF_ALL)
    +(set-info :status sat)
    +(declare-sort U 0)
    +(declare-heap (U Int))
    +(declare-const x U)
    +(declare-const a Int)
    +(assert (and (not sep.emp) (pto x a)))
    +(check-sat)
    +
    +
    +
    +

    + The following input on heaps + + + Int + + + -> + + + Node + + + is satisfiable, where + + + Node + + + denotes a user-defined inductive + + + Theory Reference: Datatypes + + + . +

    +
    +
    +
    (set-logic QF_ALL)
    +(set-info :status sat)
    +(declare-const x Int)
    +(declare-const y Int)
    +(declare-const z Int)
    +(declare-datatype Node ((node (data Int) (left Int) (right Int))))
    +(declare-heap (Int Node))
    +(assert (pto x (node 0 y z)))
    +(check-sat)
    +
    +
    +
    +
    +

    + Note +

    +

    + Given a separation logic input, the sorts + + \(Loc\) + + and + + \(Data\) + + declared via the + + declare-heap + + command must match all separation logic +predicates in the input. cvc5 does not accept an input such as: +

    +
    +
    +
    (set-logic QF_ALL)
    +(declare-sort U 0)
    +(declare-heap (U Int))
    +(declare-const x U)
    +(assert (and (pto x 0) (pto 1 2)))
    +(check-sat)
    +
    +
    +
    +

    + since the second points-to predicate uses Int for its location type. +

    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/sequences.html b/cvc5-1.0.2/theories/sequences.html new file mode 100644 index 0000000..229b0d6 --- /dev/null +++ b/cvc5-1.0.2/theories/sequences.html @@ -0,0 +1,1347 @@ + + + + + + + + Theory Reference: Sequences — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Sequences + + ¶ + +

    +
    +

    + Note +

    +

    + cvc5 currently only supports sequences where the element sort either has an +infinite domain, e.g., sequences of integers, or a finite domain of a fixed +cardinality, e.g. bit-vectors. +

    +
    +
    +

    + Semantics + + ¶ + +

    +
    +
    +
    * (seq.empty (Seq S))
    +
    +  ⟦seq.empty⟧ = []
    +
    +* (seq.unit S (Seq S))
    +
    +  ⟦seq.unit⟧(x) = [x]
    +
    +* (seq.len (Seq S) Int)
    +
    +  ⟦seq.len⟧(s) is the length of the sequence s, denoted as |s|.
    +
    +* (seq.nth ((Seq S) Int) S)
    +
    +  ⟦seq.nth⟧(s, i) is the n-th element in the sequence s,
    +                  denoted as nth(s, i).
    +                  It is uninterpreted if i out of bounds,
    +                  i.e. i < 0 or i >= |s|.
    +
    +* (seq.update ((Seq S) Int (Seq S)) (Seq S))
    +
    +  ⟦seq.update⟧(s, i, sub) is a sequence obtained by updating the continuous
    +                          sub-sequence of s starting at index i by sub.
    +                          The updated sequence has the same length as |s|.
    +                          If i + |sub| > |s|,
    +                          the out of bounds part of sub is ignored.
    +                          If i out of bounds, i.e. i < 0 or i >= |s|,
    +                          the updated sequence remains same with s.
    +
    +* (seq.extract ((Seq S) Int Int) (Seq S))
    +
    +  ⟦seq.extract⟧(s, i, j) is the maximal sub-sequence of s that starts at
    +                         index i and has length at most j,
    +                         in case both i and j are non-negative and i is
    +                         smaller than |s|.
    +                         Otherwise, the return value is the empty sequence.
    +
    + * (seq.++ ((Seq S) (Seq S)) (Seq S))
    +
    +  ⟦seq.++⟧(s1, s2) is a sequence that is the concatenation of s1 and s2.
    +
    + * (seq.at ((Seq S) Int) (Seq S))
    +
    +  ⟦seq.at⟧(s, i) is a unit sequence that contains the i-th element of s as
    +                 the only element, or is the empty sequence if i < 0 or i > |s|.
    +
    + * (seq.contains ((Seq S) (Seq S)) Bool)
    +
    +  ⟦seq.contains⟧(s, sub) is true if sub is a continuous sub-sequence of s,
    +                         i.e. sub = seq.extract(s, i, j) for some i, j,
    +                         and false if otherwise.
    +
    + * (seq.indexof ((Seq S) (Seq S) Int) Int)
    +
    +  ⟦seq.indexof⟧(s, sub, i) is the first position of sub at or after i in s,
    +                           and -1 if there is no occurrence.
    +
    + * (seq.replace ((Seq S) (Seq S) (Seq S)) (Seq S))
    +
    +  ⟦seq.replace⟧(s, src, dst) is the sequence obtained by replacing the
    +                             first occurrence of src by dst in s.
    +                             It is s if there is no occurrence.
    +
    + * (seq.replace_all ((Seq S) (Seq S) (Seq S)) (Seq S))
    +
    +  ⟦seq.replace_all⟧(s, src, dst) is the sequence obtained by replacing all
    +                                 the occurrences of src by dst in s,
    +                                 in the order from left to right.
    +                                 It is s if there is no occurrence.
    +
    + * (seq.rev (Seq S) (Seq S))
    +
    +  ⟦seq.rev⟧(s) is the sequence obtained by reversing s.
    +
    + * (seq.prefixof ((Seq S) (Seq S)) Bool)
    +
    +  ⟦seq.prefixof⟧(pre s) is true if pre is a prefix of s, false otherwise.
    +
    + * (seq.suffixof ((Seq S) (Seq S)) Bool)
    +
    +  ⟦seq.suffixof⟧(suf s) is true if suf is a suffix of s, false otherwise.
    +
    +
    +
    +
    +
    +

    + Syntax + + ¶ + +

    +

    + For the C++ API examples in the table below, we assume that we have created +a + + + cvc5::api::Solver + + + solver + + + object. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMT-LIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + use + + S + + for sequences and strings +

    +

    + + + (set-logic + + + QF_SLIA) + + +

    +
    +

    + use + + S + + for sequences and strings +

    +

    + + + solver.setLogic("QF_SLIA"); + + +

    +
    +

    + Sort +

    +
    +

    + + + (Seq + + + <Sort>) + + +

    +
    +

    + + + solver.mkSequenceSort(<Sort>); + + +

    +
    +

    + Constants +

    +
    +

    + + + (declare-const + + + X + + + (Seq + + + Int)) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkSequenceSort(solver.getIntegerSort()); + + +

    +

    + + + Term + + + X + + + = + + + solver.mkConst(s, + + + "X"); + + +

    +
    +

    + Empty sequence +

    +
    +

    + + + (as + + + seq.empty + + + (Seq + + + Int)) + + +

    +
    +

    + + + Sort + + + intSort + + + = + + + solver.getIntegerSort(); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkEmptySequence(intSort); + + +

    +
    +

    + Unit sequence +

    +
    +

    + + + (seq.unit + + + 1) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_UNIT, + + + {solver.mkInteger(1)}); + + +

    +
    +

    + Sequence length +

    +
    +

    + + + (seq.len + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_LENGTH, + + + {X}); + + +

    +
    +

    + Element access +

    +
    +

    + + + (seq.nth + + + X + + + i) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_NTH, + + + {X, + + + i}); + + +

    +
    +

    + Element update +

    +
    +

    + + + (seq.update + + + X + + + i + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_UPDATE, + + + {X, + + + i, + + + Y}); + + +

    +
    +

    + Extraction +

    +
    +

    + + + (seq.extract + + + X + + + i + + + j) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_EXTRACT, + + + {X, + + + i, + + + j}); + + +

    +
    +

    + Concatenation +

    +
    +

    + + + (seq.++ + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_CONCAT, + + + {X, + + + Y}); + + +

    +
    +

    + Sub-sequence with +single element +

    +
    +

    + + + (seq.at + + + X + + + i) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_AT, + + + {X, + + + i}); + + +

    +
    +

    + Sequence containment +

    +
    +

    + + + (seq.contains + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_CONTAINS, + + + {X, + + + Y}); + + +

    +
    +

    + Sequence indexof +

    +
    +

    + + + (seq.indexof + + + X + + + Y + + + i) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_INDEXOF, + + + {X, + + + Y, + + + i}); + + +

    +
    +

    + Sub-sequence replace +

    +
    +

    + + + (seq.replace + + + X + + + Y + + + Z) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_REPLACE, + + + {X, + + + Y, + + + Z}); + + +

    +
    +

    + Sub-sequence +replace all +

    +
    +

    + + + (seq.replace_all + + + X + + + Y + + + Z) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_REPLACE_ALL, + + + {X, + + + Y, + + + Z}); + + +

    +
    +

    + Sequence reverse +

    +
    +

    + + + (seq.rev + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_REV, + + + {X}); + + +

    +
    +

    + Sequence prefix of +

    +
    +

    + + + (seq.prefixof + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_PREFIX, + + + {X, + + + Y}); + + +

    +
    +

    + Sequence suffix of +

    +
    +

    + + + (seq.suffixof + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SEQ_SUFFIX, + + + {X, + + + Y}); + + +

    +
    +
    +
    +

    + Examples + + ¶ + +

    +
    +
    +
    (set-logic QF_SLIA)
    +(set-info :status unsat)
    +(declare-fun x () (Seq Int))
    +(declare-fun y () (Seq Int))
    +(declare-fun z () (Seq Int))
    +(declare-fun a () Int)
    +(declare-fun b () Int)
    +(assert (= y (seq.update x 0 (seq.unit a))))
    +(assert (= z (seq.update x 0 (seq.unit b))))
    +(assert (not (= a b)))
    +(assert (= y z))
    +(assert (> (seq.len y) 0))
    +(check-sat)
    +
    +
    +
    +
    +
    +
    (set-logic QF_SLIA)
    +(set-info :status unsat)
    +(declare-fun A () (Seq Int))
    +(declare-fun S () (Seq Int))
    +(declare-fun i () Int)
    +(assert (<= 0 i))
    +(assert (< i (- (seq.len A) 1)))
    +(assert (= S (seq.extract A i 1)))
    +(assert (distinct (seq.nth S 0) (seq.nth A i)))
    +(check-sat)
    +
    +
    +
    +
    +
    +
    (set-logic QF_SLIA)
    +(set-info :status unsat)
    +(declare-fun x () (Seq Int))
    +(declare-fun y () (Seq Int))
    +(declare-fun a () Int)
    +(declare-fun b () Int)
    +(assert (= (seq.++ (seq.unit a) y) (seq.update x 0 (seq.unit b))))
    +(assert (not (= a b)))
    +(check-sat)
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/sets-and-relations.html b/cvc5-1.0.2/theories/sets-and-relations.html new file mode 100644 index 0000000..181aff2 --- /dev/null +++ b/cvc5-1.0.2/theories/sets-and-relations.html @@ -0,0 +1,2966 @@ + + + + + + + + Theory Reference: Sets and Relations — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    + + +

    + Theory Reference: Sets and Relations + + ¶ + +

    +
    +

    + Finite Sets + + ¶ + +

    +

    + cvc5 supports the theory of finite sets using the following sorts, constants, +functions and predicates. More details can be found in + + [ + + BBRT17 + + ] + + . +

    +

    + For the C++ API examples in the table below, we assume that we have created +a + + cvc5::Solver solver + + object. +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMTLIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + append + + FS + + for finite sets +

    +

    + + + (set-logic + + + QF_UFLIAFS) + + +

    +
    +

    + append + + FS + + for finite sets +

    +

    + + + solver.setLogic("QF_UFLIAFS"); + + +

    +
    +

    + Sort +

    +
    +

    + + + (Set + + + <Sort>) + + +

    +
    +

    + + + solver.mkSetSort(cvc5::Sort + + + elementSort); + + +

    +
    +

    + Constants +

    +
    +

    + + + (declare-const + + + X + + + (Set + + + Int) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkSetSort(solver.getIntegerSort()); + + +

    +

    + + + Term + + + X + + + = + + + solver.mkConst(s, + + + "X"); + + +

    +
    +

    + Union +

    +
    +

    + + + (set.union + + + X + + + Y) + + +

    +
    +

    + + + Term + + + Y + + + = + + + solver.mkConst(s, + + + "Y"); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_UNION, + + + {X, + + + Y}); + + +

    +
    +

    + Intersection +

    +
    +

    + + + (set.inter + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_INTER, + + + {X, + + + Y}); + + +

    +
    +

    + Minus +

    +
    +

    + + + (set.minus + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_MINUS, + + + {X, + + + Y}); + + +

    +
    +

    + Membership +

    +
    +

    + + + (set.member + + + x + + + X) + + +

    +
    +

    + + + Term + + + x + + + = + + + solver.mkConst(solver.getIntegerSort(), + + + "x"); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_MEMBER, + + + {x, + + + X}); + + +

    +
    +

    + Subset +

    +
    +

    + + + (set.subset + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_SUBSET, + + + {X, + + + Y}); + + +

    +
    +

    + Emptyset +

    +
    +

    + + + (as + + + set.empty + + + (Set + + + Int) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkEmptySet(s); + + +

    +
    +

    + Singleton Set +

    +
    +

    + + + (set.singleton + + + 1) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_SINGLETON, + + + {solver.mkInteger(1)}); + + +

    +
    +

    + Cardinality +

    +
    +

    + + + (set.card + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_CARD, + + + {X}); + + +

    +
    +

    + Insert / Finite Sets +

    +
    +

    + + + (set.insert + + + 1 + + + 2 + + + 3 + + + (set.singleton + + + 4)) + + +

    +
    +

    + + + Term + + + one + + + = + + + solver.mkInteger(1); + + +

    +

    + + + Term + + + two + + + = + + + solver.mkInteger(2); + + +

    +

    + + + Term + + + three + + + = + + + solver.mkInteger(3); + + +

    +

    + + + Term + + + sgl + + + = + + + solver.mkTerm(Kind::SET_SINGLETON, + + + {solver.mkInteger(4)}); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_INSERT, + + + {one, + + + two, + + + three, + + + sgl}); + + +

    +
    +

    + Complement +

    +
    +

    + + + (set.complement + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::SET_COMPLEMENT, + + + {X}); + + +

    +
    +

    + Universe Set +

    +
    +

    + + + (as + + + set.universe + + + (Set + + + Int)) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkUniverseSet(s); + + +

    +
    +
    +

    + Semantics + + ¶ + +

    +

    + The semantics of most of the above operators (e.g., + + + set.union + + + , + + + set.inter + + + , difference) are straightforward. +The semantics for the universe set and complement are more subtle and explained +in the following. +

    +

    + The universe set + + + (as + + + set.universe + + + (Set + + + T)) + + + is + + not + + interpreted as the set +containing all elements of sort + + + T + + + . +Instead it may be interpreted as any set such that all sets of sort + + + (Set + + + T) + + + are interpreted as subsets of it. +In other words, it is the union of the interpretations of all (finite) sets in +our input. +

    +

    + For example: +

    +
    +
    +
    (declare-fun x () (Set Int))
    +(declare-fun y () (Set Int))
    +(declare-fun z () (Set Int))
    +(assert (set.member 0 x))
    +(assert (set.member 1 y))
    +(assert (= z (as set.universe (Set Int))))
    +(check-sat)
    +
    +
    +
    +

    + Here, a possible model is: +

    +
    +
    +
    (define-fun x () (set.singleton 0))
    +(define-fun y () (set.singleton 1))
    +(define-fun z () (set.union (set.singleton 1) (set.singleton 0)))
    +
    +
    +
    +

    + Notice that the universe set in this example is interpreted the same as + + + z + + + , +and is such that all sets in this example ( + + + x + + + , + + + y + + + , and + + + z + + + ) are subsets +of it. +

    +

    + The set complement operator for + + + (Set + + + T) + + + is interpreted relative to the +interpretation of the universe set for + + + (Set + + + T) + + + , and not relative to the set +of all elements of sort + + + T + + + . +That is, for all sets + + + X + + + of sort + + + (Set + + + T) + + + , the complement operator is +such that + + + (= + + + (set.complement + + + X) + + + (set.minus + + + (as + + + set.universe + + + (Set + + + T)) + + + X)) + + + holds in all models. +

    +

    + The motivation for these semantics is to ensure that the universe set for sort + + + T + + + and applications of set complement can always be interpreted as a finite +set in (quantifier-free) inputs, even if the cardinality of + + + T + + + is infinite. +Above, notice that we were able to find a model for the universe set of sort + + + (Set + + + Int) + + + that contained two elements only. +

    +
    +

    + Note +

    +

    + In the presence of quantifiers, cvc5’s implementation of the above theory +allows infinite sets. +In particular, the following formula is SAT (even though cvc5 is not able to +say this): +

    +
    +
    +
    (set-logic ALL)
    +(declare-fun x () (Set Int))
    +(assert (forall ((z Int) (set.member (* 2 z) x)))
    +(check-sat)
    +
    +
    +
    +

    + The reason for that is that making this formula (and similar ones) + + unsat + + is +counter-intuitive when quantifiers are present. +

    +
    +

    + Below is a more extensive example on how to use finite sets: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/sets.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Aina Niemetz, Kshitij Bansal, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of reasoning about sets with cvc5.
    +14  */
    +15 
    +16 #include <cvc5/cvc5.h>
    +17 
    +18 #include <iostream>
    +19 
    +20 using namespace std;
    +21 using namespace cvc5;
    +22 
    +23 int main()
    +24 {
    +25   Solver slv;
    +26 
    +27   // Optionally, set the logic. We need at least UF for equality predicate,
    +28   // integers (LIA) and sets (FS).
    +29   slv.setLogic("QF_UFLIAFS");
    +30 
    +31   // Produce models
    +32   slv.setOption("produce-models", "true");
    +33   slv.setOption("output-language", "smt2");
    +34 
    +35   Sort integer = slv.getIntegerSort();
    +36   Sort set = slv.mkSetSort(integer);
    +37 
    +38   // Verify union distributions over intersection
    +39   // (A union B) intersection C = (A intersection C) union (B intersection C)
    +40   {
    +41     Term A = slv.mkConst(set, "A");
    +42     Term B = slv.mkConst(set, "B");
    +43     Term C = slv.mkConst(set, "C");
    +44 
    +45     Term unionAB = slv.mkTerm(SET_UNION, {A, B});
    +46     Term lhs = slv.mkTerm(SET_INTER, {unionAB, C});
    +47 
    +48     Term intersectionAC = slv.mkTerm(SET_INTER, {A, C});
    +49     Term intersectionBC = slv.mkTerm(SET_INTER, {B, C});
    +50     Term rhs = slv.mkTerm(SET_UNION, {intersectionAC, intersectionBC});
    +51 
    +52     Term theorem = slv.mkTerm(EQUAL, {lhs, rhs});
    +53 
    +54     cout << "cvc5 reports: " << theorem << " is "
    +55          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    +56   }
    +57 
    +58   // Verify emptset is a subset of any set
    +59   {
    +60     Term A = slv.mkConst(set, "A");
    +61     Term emptyset = slv.mkEmptySet(set);
    +62 
    +63     Term theorem = slv.mkTerm(SET_SUBSET, {emptyset, A});
    +64 
    +65     cout << "cvc5 reports: " << theorem << " is "
    +66          << slv.checkSatAssuming(theorem.notTerm()) << "." << endl;
    +67   }
    +68 
    +69   // Find me an element in {1, 2} intersection {2, 3}, if there is one.
    +70   {
    +71     Term one = slv.mkInteger(1);
    +72     Term two = slv.mkInteger(2);
    +73     Term three = slv.mkInteger(3);
    +74 
    +75     Term singleton_one = slv.mkTerm(SET_SINGLETON, {one});
    +76     Term singleton_two = slv.mkTerm(SET_SINGLETON, {two});
    +77     Term singleton_three = slv.mkTerm(SET_SINGLETON, {three});
    +78     Term one_two = slv.mkTerm(SET_UNION, {singleton_one, singleton_two});
    +79     Term two_three = slv.mkTerm(SET_UNION, {singleton_two, singleton_three});
    +80     Term intersection = slv.mkTerm(SET_INTER, {one_two, two_three});
    +81 
    +82     Term x = slv.mkConst(integer, "x");
    +83 
    +84     Term e = slv.mkTerm(SET_MEMBER, {x, intersection});
    +85 
    +86     Result result = slv.checkSatAssuming(e);
    +87     cout << "cvc5 reports: " << e << " is " << result << "." << endl;
    +88 
    +89     if (result.isSat())
    +90     {
    +91       cout << "For instance, " << slv.getValue(x) << " is a member." << endl;
    +92     }
    +93   }
    +94 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    +

    + Finite Relations + + ¶ + +

    +

    + cvc5 also supports the theory of finite relations, using the following sorts, +constants, functions and predicates. +More details can be found in + + [ + + MRTB17 + + ] + + . +

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +

    + SMTLIB language +

    +
    +

    + C++ API +

    +
    +

    + Logic String +

    +
    +

    + + + (set-logic + + + QF_ALL) + + +

    +
    +

    + + + solver.setLogic("QF_ALL"); + + +

    +
    +

    + Tuple Sort +

    +
    +

    + + + (Tuple + + + <Sort_1>, + + + ..., + + + <Sort_n>) + + +

    +
    +

    + + + std::vector<cvc5::Sort> + + + sorts + + + = + + + { + + + ... + + + }; + + +

    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +
    + +

    + + + (declare-const + + + t + + + (Tuple + + + Int + + + Int)) + + +

    +
    +

    + + + Sort + + + s_int + + + = + + + solver.getIntegerSort(); + + +

    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort({s_int, + + + s_int}); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkConst(s, + + + "t"); + + +

    +
    +

    + Tuple Constructor +

    +
    +

    + + + (tuple + + + <Term_1>, + + + ..., + + + <Term_n>) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTuple({<Sort_1>, + + + ..., + + + <Sort_n>}, + + + {Term_1>, + + + ..., + + + <Term_n>}); + + +

    +
    +

    + Tuple Selector +

    +
    +

    + + + ((_ + + + tuple_select + + + i) + + + t) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkTupleSort(sorts); + + +

    +

    + + + Datatype + + + dt + + + = + + + s.getDatatype(); + + +

    +

    + + + Term + + + c + + + = + + + dt[0].getSelector(); + + +

    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::APPLY_SELECTOR, + + + {s, + + + t}); + + +

    +
    +

    + Relation Sort +

    +
    +

    + + + (Relation + + + <Sort_1>, + + + ..., + + + <Sort_n>) + + +

    +

    + which is a syntax sugar for +

    +

    + + + (Set + + + (Tuple + + + <Sort_1>, + + + ..., + + + <Sort_n>)) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkSetSort(cvc5::Sort + + + tupleSort); + + +

    +
    +

    + Constants +

    +
    +

    + + + (declare-const + + + X + + + (Set + + + (Tuple + + + Int + + + Int) + + +

    +
    +

    + + + Sort + + + s + + + = + + + solver.mkSetSort(solver.mkTupleSort({s_int, + + + s_int}); + + +

    +

    + + + Term + + + X + + + = + + + solver.mkConst(s, + + + "X"); + + +

    +
    +

    + Transpose +

    +
    +

    + + + (rel.transpose + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::RELATION_TRANSPOSE, + + + X); + + +

    +
    +

    + Transitive Closure +

    +
    +

    + + + (rel.tclosure + + + X) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::RELATION_TCLOSURE, + + + X); + + +

    +
    +

    + Join +

    +
    +

    + + + (rel.join + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::RELATION_JOIN, + + + X, + + + Y); + + +

    +
    +

    + Product +

    +
    +

    + + + (rel.product + + + X + + + Y) + + +

    +
    +

    + + + Term + + + t + + + = + + + solver.mkTerm(Kind::RELATION_PRODUCT, + + + X, + + + Y); + + +

    +
    +

    + Example: +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/relations.cpp + +

    +
    +
    +
      1 /******************************************************************************
    +  2  * Top contributors (to current version):
    +  3  *   Mudathir Mohamed, Mathias Preiner
    +  4  *
    +  5  * This file is part of the cvc5 project.
    +  6  *
    +  7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    +  8  * in the top-level source directory and their institutional affiliations.
    +  9  * All rights reserved.  See the file COPYING in the top-level source
    + 10  * directory for licensing information.
    + 11  * ****************************************************************************
    + 12  *
    + 13  * A simple demonstration of reasoning about relations with cvc5 via C++ API.
    + 14  */
    + 15 
    + 16 #include <cvc5/cvc5.h>
    + 17 
    + 18 #include <iostream>
    + 19 
    + 20 using namespace cvc5;
    + 21 
    + 22 int main()
    + 23 {
    + 24   Solver solver;
    + 25 
    + 26   // Set the logic
    + 27   solver.setLogic("ALL");
    + 28 
    + 29   // options
    + 30   solver.setOption("produce-models", "true");
    + 31   // we need finite model finding to answer sat problems with universal
    + 32   // quantified formulas
    + 33   solver.setOption("finite-model-find", "true");
    + 34   // we need sets extension to support set.universe operator
    + 35   solver.setOption("sets-ext", "true");
    + 36 
    + 37   // (declare-sort Person 0)
    + 38   Sort personSort = solver.mkUninterpretedSort("Person");
    + 39 
    + 40   // (Tuple Person)
    + 41   Sort tupleArity1 = solver.mkTupleSort({personSort});
    + 42   // (Relation Person)
    + 43   Sort relationArity1 = solver.mkSetSort(tupleArity1);
    + 44 
    + 45   // (Tuple Person Person)
    + 46   Sort tupleArity2 = solver.mkTupleSort({personSort, personSort});
    + 47   // (Relation Person Person)
    + 48   Sort relationArity2 = solver.mkSetSort(tupleArity2);
    + 49 
    + 50   // empty set
    + 51   Term emptySetTerm = solver.mkEmptySet(relationArity1);
    + 52 
    + 53   // empty relation
    + 54   Term emptyRelationTerm = solver.mkEmptySet(relationArity2);
    + 55 
    + 56   // universe set
    + 57   Term universeSet = solver.mkUniverseSet(relationArity1);
    + 58 
    + 59   // variables
    + 60   Term people = solver.mkConst(relationArity1, "people");
    + 61   Term males = solver.mkConst(relationArity1, "males");
    + 62   Term females = solver.mkConst(relationArity1, "females");
    + 63   Term father = solver.mkConst(relationArity2, "father");
    + 64   Term mother = solver.mkConst(relationArity2, "mother");
    + 65   Term parent = solver.mkConst(relationArity2, "parent");
    + 66   Term ancestor = solver.mkConst(relationArity2, "ancestor");
    + 67   Term descendant = solver.mkConst(relationArity2, "descendant");
    + 68 
    + 69   Term isEmpty1 = solver.mkTerm(EQUAL, {males, emptySetTerm});
    + 70   Term isEmpty2 = solver.mkTerm(EQUAL, {females, emptySetTerm});
    + 71 
    + 72   // (assert (= people (as set.universe (Relation Person))))
    + 73   Term peopleAreTheUniverse = solver.mkTerm(EQUAL, {people, universeSet});
    + 74   // (assert (not (= males (as set.empty (Relation Person)))))
    + 75   Term maleSetIsNotEmpty = solver.mkTerm(NOT, {isEmpty1});
    + 76   // (assert (not (= females (as set.empty (Relation Person)))))
    + 77   Term femaleSetIsNotEmpty = solver.mkTerm(NOT, {isEmpty2});
    + 78 
    + 79   // (assert (= (set.inter males females)
    + 80   //            (as set.empty (Relation Person))))
    + 81   Term malesFemalesIntersection = solver.mkTerm(SET_INTER, {males, females});
    + 82   Term malesAndFemalesAreDisjoint =
    + 83       solver.mkTerm(EQUAL, {malesFemalesIntersection, emptySetTerm});
    + 84 
    + 85   // (assert (not (= father (as set.empty (Relation Person Person)))))
    + 86   // (assert (not (= mother (as set.empty (Relation Person Person)))))
    + 87   Term isEmpty3 = solver.mkTerm(EQUAL, {father, emptyRelationTerm});
    + 88   Term isEmpty4 = solver.mkTerm(EQUAL, {mother, emptyRelationTerm});
    + 89   Term fatherIsNotEmpty = solver.mkTerm(NOT, {isEmpty3});
    + 90   Term motherIsNotEmpty = solver.mkTerm(NOT, {isEmpty4});
    + 91 
    + 92   // fathers are males
    + 93   // (assert (set.subset (rel.join father people) males))
    + 94   Term fathers = solver.mkTerm(RELATION_JOIN, {father, people});
    + 95   Term fathersAreMales = solver.mkTerm(SET_SUBSET, {fathers, males});
    + 96 
    + 97   // mothers are females
    + 98   // (assert (set.subset (rel.join mother people) females))
    + 99   Term mothers = solver.mkTerm(RELATION_JOIN, {mother, people});
    +100   Term mothersAreFemales = solver.mkTerm(SET_SUBSET, {mothers, females});
    +101 
    +102   // (assert (= parent (set.union father mother)))
    +103   Term unionFatherMother = solver.mkTerm(SET_UNION, {father, mother});
    +104   Term parentIsFatherOrMother =
    +105       solver.mkTerm(EQUAL, {parent, unionFatherMother});
    +106 
    +107   // (assert (= ancestor (rel.tclosure parent)))
    +108   Term transitiveClosure = solver.mkTerm(RELATION_TCLOSURE, {parent});
    +109   Term ancestorFormula = solver.mkTerm(EQUAL, {ancestor, transitiveClosure});
    +110 
    +111   // (assert (= descendant (rel.transpose descendant)))
    +112   Term transpose = solver.mkTerm(RELATION_TRANSPOSE, {ancestor});
    +113   Term descendantFormula = solver.mkTerm(EQUAL, {descendant, transpose});
    +114 
    +115   // (assert (forall ((x Person)) (not (set.member (tuple x x) ancestor))))
    +116   Term x = solver.mkVar(personSort, "x");
    +117   Term xxTuple = solver.mkTuple({personSort, personSort}, {x, x});
    +118   Term member = solver.mkTerm(SET_MEMBER, {xxTuple, ancestor});
    +119   Term notMember = solver.mkTerm(NOT, {member});
    +120 
    +121   Term quantifiedVariables = solver.mkTerm(VARIABLE_LIST, {x});
    +122   Term noSelfAncestor = solver.mkTerm(FORALL, {quantifiedVariables, notMember});
    +123 
    +124   // formulas
    +125   solver.assertFormula(peopleAreTheUniverse);
    +126   solver.assertFormula(maleSetIsNotEmpty);
    +127   solver.assertFormula(femaleSetIsNotEmpty);
    +128   solver.assertFormula(malesAndFemalesAreDisjoint);
    +129   solver.assertFormula(fatherIsNotEmpty);
    +130   solver.assertFormula(motherIsNotEmpty);
    +131   solver.assertFormula(fathersAreMales);
    +132   solver.assertFormula(mothersAreFemales);
    +133   solver.assertFormula(parentIsFatherOrMother);
    +134   solver.assertFormula(descendantFormula);
    +135   solver.assertFormula(ancestorFormula);
    +136   solver.assertFormula(noSelfAncestor);
    +137 
    +138   // check sat
    +139   Result result = solver.checkSat();
    +140 
    +141   // output
    +142   std::cout << "Result     = " << result << std::endl;
    +143   std::cout << "people     = " << solver.getValue(people) << std::endl;
    +144   std::cout << "males      = " << solver.getValue(males) << std::endl;
    +145   std::cout << "females    = " << solver.getValue(females) << std::endl;
    +146   std::cout << "father     = " << solver.getValue(father) << std::endl;
    +147   std::cout << "mother     = " << solver.getValue(mother) << std::endl;
    +148   std::cout << "parent     = " << solver.getValue(parent) << std::endl;
    +149   std::cout << "descendant = " << solver.getValue(descendant) << std::endl;
    +150   std::cout << "ancestor   = " << solver.getValue(ancestor) << std::endl;
    +151 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/strings.html b/cvc5-1.0.2/theories/strings.html new file mode 100644 index 0000000..eea90ba --- /dev/null +++ b/cvc5-1.0.2/theories/strings.html @@ -0,0 +1,367 @@ + + + + + + + + Theory Reference: Strings — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Strings + + ¶ + +

    +

    + cvc5 supports all operators of the + + SMT-LIB standard for strings + + . It additionally +supports some non-standard operators that are described below. +

    +
    +

    + Semantics + + ¶ + +

    +
    +
    +
    * (str.indexof_re String RegLan Int Int)
    +
    +  Let w₂ = ⟦str.substr⟧(w, i, |w| - i)
    +
    +  - ⟦str.indexof_re⟧(w, L, i) = -1     if no substring of w₂ is in L or i < 0
    +
    +  - ⟦str.indexof_re⟧(w, L, i) = |u₁|
    +    where u₁, w₁ are the shortest words such that
    +      - w₂ = u₁w₁u₂
    +      - w₁ ∈ L
    +                                       if some substring of w₂ is in L and i > 0
    +
    +* (str.update String Int String)
    +
    +  - ⟦str.update⟧(w, i, w₂) = w         if i < 0 or i >= |w|
    +
    +  - ⟦str.update⟧(w, i, w₂) = u₁u₂u₃
    +    where
    +      - w = u₁w₃u₃
    +      - |w₃| = |u₂|
    +      - |u₁| = i
    +      - u₂u₄ = w₂
    +      - |u₂| = min(|w₂|, |w| - i)      otherwise
    +
    +* (str.rev String String)
    +
    +  ⟦str.rev⟧(w) is the string obtained by reversing w, e.g.,
    +  ⟦str.rev⟧("abc") = "cba".
    +
    +* (str.to_lower String String)
    +
    +  ⟦str.to_lower⟧(w) = w₂
    +  where
    +    - |w| = |w₂|
    +    - the i-th character ri in w₂ is:
    +
    +      code(ri) = code(si) + ite(65 <= code(si) <= 90, 32, 0)
    +
    +      where si is the i-th character in w
    +
    +  Note: This operator performs the case conversion for the ASCII portion of
    +  Unicode only.
    +
    +* (str.to_upper String String)
    +
    +  ⟦str.to_upper⟧(w) = w₂
    +  where
    +    - |w| = |w₂|
    +    - the i-th character ri in w₂ is:
    +
    +      code(ri) = code(si) - ite(97 <= code(si) <= 122, 32, 0)
    +
    +      where si is the i-th character in w
    +
    +  Note: This operator performs the case conversion for the ASCII portion of
    +  Unicode only.
    +
    +
    +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/theories.html b/cvc5-1.0.2/theories/theories.html new file mode 100644 index 0000000..3b12759 --- /dev/null +++ b/cvc5-1.0.2/theories/theories.html @@ -0,0 +1,420 @@ + + + + + + + + Theory References — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    +
      +
    • + + + » +
    • +
    • + Theory References +
    • +
    • +
    • +
    +
    +
    +
    +
    +
    +

    + Theory References + + ¶ + +

    +

    + cvc5 supports all theories that are currently standardized in SMT-LIB. +Additionally, it also implements several theories that are not (yet) +standardized, or that extend beyond the respective standardized theory. +Furthermore, cvc5 supports all combinations of all implemented theories as well +as combinations with + + datatypes, quantifiers, and uninterpreted functions (as +defined in the SMT-LIB standard) + + . +

    +
    +

    + Standardized theories + + ¶ + +

    + +
    +
    +

    + Non-standard or extended theories + + ¶ + +

    + +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/cvc5-1.0.2/theories/transcendentals.html b/cvc5-1.0.2/theories/transcendentals.html new file mode 100644 index 0000000..e1c3963 --- /dev/null +++ b/cvc5-1.0.2/theories/transcendentals.html @@ -0,0 +1,832 @@ + + + + + + + + Theory Reference: Transcendentals — cvc5 documentation + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + +
    +
    +
    + +
    +
    +
    +
    +
    +

    + Theory Reference: Transcendentals + + ¶ + +

    +

    + cvc5 supports transcendental functions that naturally extend the nonlinear real arithmetic theories + + + NRA + + + and + + + NIRA + + + . +The theory consists of the constant + + \(\pi\) + + and function symbols for most common transcendental functions like, e.g., + + + sin + + + , + + + cos + + + and + + + tan + + + . +

    +
    +

    + Logic + + ¶ + +

    +

    + To enable cvc5’s decision procedure for transcendentals, append + + + T + + + to the arithmetic logic that is being used: +

    +
    +
    +
    (set-logic QF_NRAT)
    +
    +
    +
    +

    + Alternatively, use the + + + ALL + + + logic: +

    +
    +
    +
    (set-logic ALL)
    +
    +
    +
    +
    +
    +

    + Syntax + + ¶ + +

    +

    + cvc5 internally defines a constant + + + real.pi + + + of sort + + + Real + + + and the following unary function symbols from + + + Real + + + to + + + Real + + + : +

    +
      +
    • +

      + the square root function + + + sqrt + + +

      +
    • +
    • +

      + the exponential function + + + exp + + +

      +
    • +
    • +

      + the sine function + + + sin + + +

      +
    • +
    • +

      + the cosine function + + + cos + + +

      +
    • +
    • +

      + the tangent function + + + tan + + +

      +
    • +
    • +

      + the cosecant function + + + csc + + +

      +
    • +
    • +

      + the secant function + + + sec + + +

      +
    • +
    • +

      + the cotangent function + + + cot + + +

      +
    • +
    • +

      + the arcsine function + + + arcsin + + +

      +
    • +
    • +

      + the arccosine function + + + arccos + + +

      +
    • +
    • +

      + the arctangent function + + + arctan + + +

      +
    • +
    • +

      + the arccosecant function + + + arccsc + + +

      +
    • +
    • +

      + the arcsecant function + + + arcsec + + +

      +
    • +
    • +

      + the arccotangent function + + + arccot + + +

      +
    • +
    +
    +
    +

    + Semantics + + ¶ + +

    +

    + Both the constant + + + real.pi + + + and all function symbols are defined on real numbers and are thus not subject to limited precision. That being said, cvc5 internally uses inexact techniques based on incremental linearization. +While + + + real.pi + + + is specified using a rational enclosing interval that is automatically refined on demand, the function symbols are approximated using tangent planes and secant lines using the techniques described in + + [ + + CGI+18 + + ] + + . +

    +
    +
    +

    + Examples + + ¶ + +

    +
    +
    + + + + +
    +
    +

    + + examples/api/cpp/transcendentals.cpp + +

    +
    +
    +
     1 /******************************************************************************
    + 2  * Top contributors (to current version):
    + 3  *   Gereon Kremer, Mathias Preiner
    + 4  *
    + 5  * This file is part of the cvc5 project.
    + 6  *
    + 7  * Copyright (c) 2009-2022 by the authors listed in the file AUTHORS
    + 8  * in the top-level source directory and their institutional affiliations.
    + 9  * All rights reserved.  See the file COPYING in the top-level source
    +10  * directory for licensing information.
    +11  * ****************************************************************************
    +12  *
    +13  * A simple demonstration of the transcendental extension.
    +14  */
    +15 
    +16 #include <iostream>
    +17 
    +18 #include <cvc5/cvc5.h>
    +19 
    +20 using namespace std;
    +21 using namespace cvc5;
    +22 
    +23 int main()
    +24 {
    +25   Solver slv;
    +26   slv.setLogic("QF_NRAT");
    +27 
    +28   Sort real = slv.getRealSort();
    +29 
    +30   // Variables
    +31   Term x = slv.mkConst(real, "x");
    +32   Term y = slv.mkConst(real, "y");
    +33 
    +34   // Helper terms
    +35   Term two = slv.mkReal(2);
    +36   Term pi = slv.mkPi();
    +37   Term twopi = slv.mkTerm(MULT, {two, pi});
    +38   Term ysq = slv.mkTerm(MULT, {y, y});
    +39   Term sinx = slv.mkTerm(SINE, {x});
    +40 
    +41   // Formulas
    +42   Term x_gt_pi = slv.mkTerm(GT, {x, pi});
    +43   Term x_lt_tpi = slv.mkTerm(LT, {x, twopi});
    +44   Term ysq_lt_sinx = slv.mkTerm(LT, {ysq, sinx});
    +45 
    +46   slv.assertFormula(x_gt_pi);
    +47   slv.assertFormula(x_lt_tpi);
    +48   slv.assertFormula(ysq_lt_sinx);
    +49 
    +50   cout << "cvc5 should report UNSAT." << endl;
    +51   cout << "Result from cvc5 is: " << slv.checkSat() << endl;
    +52 
    +53   return 0;
    +54 }
    +
    +
    +
    +
    + + + +
    +
    +
    +
    +
    + +
    +
    +
    +
    + + + \ No newline at end of file diff --git a/index.html b/index.html index 359b585..18a2992 100644 --- a/index.html +++ b/index.html @@ -2,5 +2,5 @@ Redirect to latest release - - \ No newline at end of file + + \ No newline at end of file diff --git a/latest b/latest index 05ca16a..fc042b2 120000 --- a/latest +++ b/latest @@ -1 +1 @@ -cvc5-1.0.1 \ No newline at end of file +cvc5-1.0.2 \ No newline at end of file