Debian Codegraph @

test/regress/cli/regress0/tptp/BOO027-1.smt2

raw
1 (set-logic ALL)
2 (set-info :status unsat)
3 (declare-sort $$unsorted 0)
4 (declare-fun tptp.add ($$unsorted $$unsorted) $$unsorted)
5 (declare-fun tptp.multiply ($$unsorted $$unsorted) $$unsorted)
6 (assert (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (tptp.multiply X (tptp.add Y Z)) (tptp.add (tptp.multiply Y X) (tptp.multiply Z X)))))
7 (declare-fun tptp.inverse ($$unsorted) $$unsorted)
8 (declare-fun tptp.one () $$unsorted)
9 (assert (forall ((X $$unsorted)) (= (tptp.add X (tptp.inverse X)) tptp.one)))
10 (assert (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.inverse X))) (= (tptp.add (tptp.multiply X _let_1) (tptp.add (tptp.multiply X Y) (tptp.multiply _let_1 Y))) Y))))
11 (assert (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.inverse Y))) (= (tptp.add (tptp.multiply X _let_1) (tptp.add (tptp.multiply X Y) (tptp.multiply _let_1 Y))) X))))
12 (assert (forall ((X $$unsorted) (Y $$unsorted)) (let ((_let_1 (tptp.inverse Y))) (= (tptp.add (tptp.multiply X _let_1) (tptp.add (tptp.multiply X X) (tptp.multiply _let_1 X))) X))))
13 (declare-fun tptp.a () $$unsorted)
14 (assert (not (= (tptp.add tptp.a tptp.a) tptp.a)))
15 (set-info :filename BOO027-1)
16 (check-sat)