Debian Codegraph @

test/regress/cli/regress0/tptp/tff0-arith.smt2

raw
1 (set-logic ALL)
2 (set-info :status unsat)
3 (declare-sort $$unsorted 0)
4 (declare-sort tptp.list 0)
5 (declare-fun tptp.nil () tptp.list)
6 (declare-fun tptp.mycons (Int tptp.list) tptp.list)
7 (declare-fun tptp.fib_sorted (tptp.list) Bool)
8 (assert (tptp.fib_sorted tptp.nil))
9 (assert (forall ((X Int)) (tptp.fib_sorted (tptp.mycons X tptp.nil))))
10 (assert (forall ((X Int) (Y Int)) (=> (< X Y) (tptp.fib_sorted (tptp.mycons X (tptp.mycons Y tptp.nil))))))
11 (assert (forall ((X Int) (Y Int) (Z Int) (R tptp.list)) (let ((_let_1 (tptp.mycons Y (tptp.mycons Z R)))) (=> (and (< X Y) (>= Z (+ X Y)) (tptp.fib_sorted _let_1)) (tptp.fib_sorted (tptp.mycons X _let_1))))))
12 (assert (not (tptp.fib_sorted (tptp.mycons 1 (tptp.mycons 2 (tptp.mycons 4 tptp.nil))))))
13 (set-info :filename tff0-arith)
14 (check-sat-assuming ( true ))