TSTP Solution File: DAT067_1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : DAT067_1 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 16:42:57 EDT 2024
% Result : Theorem 0.36s 0.54s
% Output : Proof 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : DAT067_1 : TPTP v8.2.0. Released v5.5.0.
% 0.03/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 27 17:18:24 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.51 %----Proving TF0_ARI
% 0.36/0.54 --- Run --finite-model-find --decision=internal at 15...
% 0.36/0.54 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.Zg9JjpJcGZ/cvc5---1.0.5_21380.smt2
% 0.36/0.54 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.Zg9JjpJcGZ/cvc5---1.0.5_21380.smt2
% 0.36/0.54 (assume a0 (forall ((M Int)) (= (tptp.sel tptp.empty M) 0)))
% 0.36/0.54 (assume a1 (forall ((H tptp.heap) (M Int) (N Int)) (=> (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) N))))
% 0.36/0.54 (assume a2 (forall ((N Int) (H tptp.heap) (M Int)) (=> (not (= M (+ 1 (tptp.length H)))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))))
% 0.36/0.54 (assume a3 (forall ((N Int) (H tptp.heap)) (= (tptp.get (tptp.app H N)) H)))
% 0.36/0.54 (assume a4 (forall ((H tptp.heap) (N Int)) (= (tptp.toop (tptp.app H N)) N)))
% 0.36/0.54 (assume a5 (forall ((H tptp.heap) (H0 tptp.heap) (N Int) (N0 Int)) (= (= (tptp.app H N) (tptp.app H0 N0)) (and (= H H0) (= N N0)))))
% 0.36/0.54 (assume a6 (forall ((H tptp.heap) (N Int)) (not (= tptp.empty (tptp.app H N)))))
% 0.36/0.54 (assume a7 (forall ((H tptp.heap)) (or (= H tptp.empty) (= H (tptp.app (tptp.get H) (tptp.toop H))))))
% 0.36/0.54 (assume a8 (= (tptp.length tptp.empty) 0))
% 0.36/0.54 (assume a9 (forall ((N Int) (H tptp.heap)) (= (tptp.length (tptp.app H N)) (+ 1 (tptp.length H)))))
% 0.36/0.54 (assume a10 (forall ((H tptp.heap)) (not (tptp.lsls H H))))
% 0.36/0.54 (assume a11 (forall ((H0 tptp.heap) (H tptp.heap) (H1 tptp.heap)) (=> (and (tptp.lsls H H0) (tptp.lsls H0 H1)) (tptp.lsls H H1))))
% 0.36/0.54 (assume a12 (forall ((H tptp.heap)) (not (tptp.lsls H tptp.empty))))
% 0.36/0.54 (assume a13 (forall ((N Int) (H0 tptp.heap) (H tptp.heap)) (= (tptp.lsls H0 (tptp.app H N)) (or (= H0 H) (tptp.lsls H0 H)))))
% 0.36/0.54 (assume a14 (not (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H)))))))
% 0.36/0.54 (assume a15 true)
% 0.36/0.54 (step t1 (cl (= (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))) (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H))))))) :rule hole :args ((= (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))) (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H)))))) 13))
% 0.36/0.54 (step t2 (cl (= (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H))))) (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))))) :rule symm :premises (t1))
% 0.36/0.54 (step t3 (cl (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H))))) (not (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))))) :rule equiv2 :premises (t2))
% 0.36/0.54 (step t4 (cl (not (= (forall ((N Int) (H tptp.heap) (M Int)) (=> (not (= M (+ 1 (tptp.length H)))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))) (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))))) (not (forall ((N Int) (H tptp.heap) (M Int)) (=> (not (= M (+ 1 (tptp.length H)))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M))))) (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M))))) :rule equiv_pos2)
% 0.36/0.54 (step t5 (cl (= (forall ((N Int) (H tptp.heap) (M Int)) (=> (not (= M (+ 1 (tptp.length H)))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))) (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)))))) :rule all_simplify)
% 0.36/0.54 (step t6 (cl (forall ((N Int) (H tptp.heap) (M Int)) (or (= M (+ 1 (tptp.length H))) (= (tptp.sel (tptp.app H N) M) (tptp.sel H M))))) :rule resolution :premises (t4 t5 a2))
% 0.36/0.54 (step t7 (cl (forall ((N Int) (M Int) (H tptp.heap)) (or (= (tptp.sel (tptp.app H N) M) (tptp.sel H M)) (= M (+ 1 (tptp.length H)))))) :rule resolution :premises (t3 t6))
% 0.36/0.54 (step t8 (cl) :rule resolution :premises (a14 t7))
% 0.36/0.54
% 0.36/0.54 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.Zg9JjpJcGZ/cvc5---1.0.5_21380.smt2
% 0.36/0.55 % cvc5---1.0.5 exiting
% 0.36/0.55 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------