zipperposition
zipperposition copied to clipboard
An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logtk, a supporting library for manipulating terms, formulas, claus...
Apparently, the [TIP language](https://tip-org.github.io/) has incorporated SMT-LIB 2.6 changes (https://github.com/tip-org/tools/commit/2995668c6e0d3fb68ec71a494992f74f3c96b877) and is therefore no longer compatible with zipperposition's current parser: ``` $ zipperposition benchmarks/tip2015/list_elem_map.smt2 parse error at at file 'benchmarks/tip2015/list_elem_map.smt2':...
`./zipperposition.exe -bt --dot /tmp/truc.dot examples/data/length.zf --check -d 5` gets an error in proof checking
on: ``` (declare-datatypes () ((List (nil) (cons (head Int) (tail List))))) (define-fun-rec append ((l1 List) (l2 List)) List (match l1 (case nil l2) (case (cons hd tl) (cons hd (append...
see some problems that are easy with `--ord=rpo6`: - `pelletier_problems/pb47.zf` (which is normally easy) - `examples/sledgehammer/prob_e_1.p` even when KBO finds a proof, it's weirdly long and convoluted
`./zipperposition.exe -o none --dot /tmp/truc.dot -t 10 examples/ARI184=1.p --int-semantic-tauto -p` blocks at step 8. See if we can use a simpler, more correct simplex (funarith?).
mix of negation in head and argument positions?
$TPTP/Axioms/CSR003+0.ax contains mixed integers/symbols and I think we're a bit too strict in assuming "integer numeral => type is $int" there. It makes some problems fail with an error (e.g....
(longer term) - [ ] make `'a flex_state.key` json serializable - [ ] have a set of configurations as json files, embedded into the binary by build system magic -...
Sidekick currently does not support lambda-expressions or other binders. It seems to me that adding support for them into sidekick is the only clean way to implement the proof checker....