TSTP Solution File: LCL181+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : LCL181+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n018.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 17:24:46 EDT 2024
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : LCL181+1 : TPTP v8.2.0. Released v2.0.0.
% 0.06/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 27 21:27:09 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.51 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.MlEd3DvhFT/cvc5---1.0.5_25524.smt2
% 0.20/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.MlEd3DvhFT/cvc5---1.0.5_25524.smt2
% 0.20/0.51 (assume a0 (not (= (=> (not tptp.p) tptp.q) (=> (not tptp.q) tptp.p))))
% 0.20/0.51 (assume a1 true)
% 0.20/0.51 (step t1 (cl (not (=> (not tptp.p) tptp.q)) (not (=> (not tptp.q) tptp.p))) :rule not_equiv2 :premises (a0))
% 0.20/0.51 (step t2 (cl (=> (not tptp.q) tptp.p) (not tptp.p)) :rule implies_neg2)
% 0.20/0.51 (step t3 (cl (not tptp.p) (=> (not tptp.q) tptp.p)) :rule reordering :premises (t2))
% 0.20/0.51 (step t4 (cl (=> (not tptp.p) tptp.q) (not tptp.q)) :rule implies_neg2)
% 0.20/0.51 (step t5 (cl (not (= (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (or (not (=> (not tptp.q) tptp.p)) tptp.q tptp.p))) (not (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p)) (or (not (=> (not tptp.q) tptp.p)) tptp.q tptp.p)) :rule equiv_pos2)
% 0.20/0.51 (step t6 (cl (= (not (=> (not tptp.q) tptp.p)) (not (=> (not tptp.q) tptp.p)))) :rule refl)
% 0.20/0.51 (step t7 (cl (= (= (= (not (not tptp.q)) tptp.q) true) (= (not (not tptp.q)) tptp.q))) :rule equiv_simplify)
% 0.20/0.51 (step t8 (cl (not (= (= (not (not tptp.q)) tptp.q) true)) (= (not (not tptp.q)) tptp.q)) :rule equiv1 :premises (t7))
% 0.20/0.51 (step t9 (cl (= (= (not (not tptp.q)) tptp.q) (= tptp.q (not (not tptp.q))))) :rule all_simplify)
% 0.20/0.51 (step t10 (cl (= tptp.q tptp.q)) :rule refl)
% 0.20/0.51 (step t11 (cl (= (not (not tptp.q)) tptp.q)) :rule all_simplify)
% 0.20/0.51 (step t12 (cl (= (= tptp.q (not (not tptp.q))) (= tptp.q tptp.q))) :rule cong :premises (t10 t11))
% 0.20/0.51 (step t13 (cl (= (= tptp.q tptp.q) true)) :rule all_simplify)
% 0.20/0.51 (step t14 (cl (= (= tptp.q (not (not tptp.q))) true)) :rule trans :premises (t12 t13))
% 0.20/0.51 (step t15 (cl (= (= (not (not tptp.q)) tptp.q) true)) :rule trans :premises (t9 t14))
% 0.20/0.51 (step t16 (cl (= (not (not tptp.q)) tptp.q)) :rule resolution :premises (t8 t15))
% 0.20/0.51 (step t17 (cl (= tptp.p tptp.p)) :rule refl)
% 0.20/0.51 (step t18 (cl (= (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (or (not (=> (not tptp.q) tptp.p)) tptp.q tptp.p))) :rule cong :premises (t6 t16 t17))
% 0.20/0.51 (step t19 (cl (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) :rule implies_pos)
% 0.20/0.51 (step t20 (cl (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (not (not (=> (not tptp.q) tptp.p)))) :rule or_neg)
% 0.20/0.51 (step t21 (cl (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (not (not (not tptp.q)))) :rule or_neg)
% 0.20/0.51 (step t22 (cl (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (not tptp.p)) :rule or_neg)
% 0.20/0.51 (step t23 (cl (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p) (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p)) :rule resolution :premises (t19 t20 t21 t22))
% 0.20/0.51 (step t24 (cl (or (not (=> (not tptp.q) tptp.p)) (not (not tptp.q)) tptp.p)) :rule contraction :premises (t23))
% 0.20/0.51 (step t25 (cl (or (not (=> (not tptp.q) tptp.p)) tptp.q tptp.p)) :rule resolution :premises (t5 t18 t24))
% 0.20/0.51 (step t26 (cl (not (=> (not tptp.q) tptp.p)) tptp.q tptp.p) :rule or :premises (t25))
% 0.20/0.51 (step t27 (cl tptp.p tptp.q (not (=> (not tptp.q) tptp.p))) :rule reordering :premises (t26))
% 0.20/0.51 (step t28 (cl tptp.p (not (=> (not tptp.q) tptp.p)) (not (=> (not tptp.q) tptp.p))) :rule resolution :premises (t4 t27 t1))
% 0.20/0.51 (step t29 (cl tptp.p (not (=> (not tptp.q) tptp.p))) :rule contraction :premises (t28))
% 0.20/0.51 (step t30 (cl (not (= (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (or (not (=> (not tptp.p) tptp.q)) tptp.p tptp.q))) (not (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q)) (or (not (=> (not tptp.p) tptp.q)) tptp.p tptp.q)) :rule equiv_pos2)
% 0.20/0.51 (step t31 (cl (= (not (=> (not tptp.p) tptp.q)) (not (=> (not tptp.p) tptp.q)))) :rule refl)
% 0.20/0.51 (step t32 (cl (= (= (= (not (not tptp.p)) tptp.p) true) (= (not (not tptp.p)) tptp.p))) :rule equiv_simplify)
% 0.20/0.51 (step t33 (cl (not (= (= (not (not tptp.p)) tptp.p) true)) (= (not (not tptp.p)) tptp.p)) :rule equiv1 :premises (t32))
% 0.20/0.51 (step t34 (cl (= (= (not (not tptp.p)) tptp.p) (= tptp.p (not (not tptp.p))))) :rule all_simplify)
% 0.20/0.52 (step t35 (cl (= tptp.p tptp.p)) :rule refl)
% 0.20/0.52 (step t36 (cl (= (not (not tptp.p)) tptp.p)) :rule all_simplify)
% 0.20/0.52 (step t37 (cl (= (= tptp.p (not (not tptp.p))) (= tptp.p tptp.p))) :rule cong :premises (t35 t36))
% 0.20/0.52 (step t38 (cl (= (= tptp.p tptp.p) true)) :rule all_simplify)
% 0.20/0.52 (step t39 (cl (= (= tptp.p (not (not tptp.p))) true)) :rule trans :premises (t37 t38))
% 0.20/0.52 (step t40 (cl (= (= (not (not tptp.p)) tptp.p) true)) :rule trans :premises (t34 t39))
% 0.20/0.52 (step t41 (cl (= (not (not tptp.p)) tptp.p)) :rule resolution :premises (t33 t40))
% 0.20/0.52 (step t42 (cl (= tptp.q tptp.q)) :rule refl)
% 0.20/0.52 (step t43 (cl (= (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (or (not (=> (not tptp.p) tptp.q)) tptp.p tptp.q))) :rule cong :premises (t31 t41 t42))
% 0.20/0.52 (step t44 (cl (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) :rule implies_pos)
% 0.20/0.52 (step t45 (cl (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (not (not (=> (not tptp.p) tptp.q)))) :rule or_neg)
% 0.20/0.52 (step t46 (cl (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (not (not (not tptp.p)))) :rule or_neg)
% 0.20/0.52 (step t47 (cl (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (not tptp.q)) :rule or_neg)
% 0.20/0.52 (step t48 (cl (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q) (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q)) :rule resolution :premises (t44 t45 t46 t47))
% 0.20/0.52 (step t49 (cl (or (not (=> (not tptp.p) tptp.q)) (not (not tptp.p)) tptp.q)) :rule contraction :premises (t48))
% 0.20/0.52 (step t50 (cl (or (not (=> (not tptp.p) tptp.q)) tptp.p tptp.q)) :rule resolution :premises (t30 t43 t49))
% 0.20/0.52 (step t51 (cl (not (=> (not tptp.p) tptp.q)) tptp.p tptp.q) :rule or :premises (t50))
% 0.20/0.52 (step t52 (cl tptp.p tptp.q (not (=> (not tptp.p) tptp.q))) :rule reordering :premises (t51))
% 0.20/0.52 (step t53 (cl (=> (not tptp.p) tptp.q) (=> (not tptp.q) tptp.p)) :rule not_equiv1 :premises (a0))
% 0.20/0.52 (step t54 (cl (=> (not tptp.q) tptp.p) (not tptp.q)) :rule implies_neg1)
% 0.20/0.52 (step t55 (cl (not tptp.q) (=> (not tptp.q) tptp.p)) :rule reordering :premises (t54))
% 0.20/0.52 (step t56 (cl tptp.p (=> (not tptp.q) tptp.p) (=> (not tptp.q) tptp.p)) :rule resolution :premises (t52 t53 t55))
% 0.20/0.52 (step t57 (cl tptp.p (=> (not tptp.q) tptp.p)) :rule contraction :premises (t56))
% 0.20/0.52 (step t58 (cl tptp.p tptp.p) :rule resolution :premises (t29 t57))
% 0.20/0.52 (step t59 (cl tptp.p) :rule contraction :premises (t58))
% 0.20/0.52 (step t60 (cl (=> (not tptp.q) tptp.p)) :rule resolution :premises (t3 t59))
% 0.20/0.52 (step t61 (cl (=> (not tptp.p) tptp.q) (not tptp.p)) :rule implies_neg1)
% 0.20/0.52 (step t62 (cl (not tptp.p) (=> (not tptp.p) tptp.q)) :rule reordering :premises (t61))
% 0.20/0.52 (step t63 (cl (=> (not tptp.p) tptp.q)) :rule resolution :premises (t62 t59))
% 0.20/0.52 (step t64 (cl) :rule resolution :premises (t1 t60 t63))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.MlEd3DvhFT/cvc5---1.0.5_25524.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------