TSTP Solution File: SYN963+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN963+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n020.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 18:26:58 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN963+1 : TPTP v8.2.0. Released v3.1.0.
% 0.04/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 28 13:28:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.51 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.4YMh9efrFk/cvc5---1.0.5_8811.smt2
% 0.21/0.51 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.4YMh9efrFk/cvc5---1.0.5_8811.smt2
% 0.21/0.51 (assume a0 (not (= (exists ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.p Y)))))
% 0.21/0.51 (assume a1 true)
% 0.21/0.51 (step t1 (cl (not (= (not (= (exists ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.p Y)))) (not (= (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))))) (not (not (= (exists ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.p Y))))) (not (= (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule equiv_pos2)
% 0.21/0.51 (step t2 (cl (= (exists ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule all_simplify)
% 0.21/0.51 (step t3 (cl (= (exists ((Y $$unsorted)) (tptp.p Y)) (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) :rule all_simplify)
% 0.21/0.51 (step t4 (cl (= (= (exists ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.p Y))) (= (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule cong :premises (t2 t3))
% 0.21/0.51 (step t5 (cl (= (not (= (exists ((X $$unsorted)) (tptp.p X)) (exists ((Y $$unsorted)) (tptp.p Y)))) (not (= (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))))) :rule cong :premises (t4))
% 0.21/0.51 (step t6 (cl (not (= (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule resolution :premises (t1 t5 a0))
% 0.21/0.51 (step t7 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule not_equiv1 :premises (t6))
% 0.21/0.51 (step t8 (cl (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule hole :args ((forall ((X $$unsorted)) (not (tptp.p X))) (= X Y)))
% 0.21/0.51 (step t9 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) :rule equiv1 :premises (t8))
% 0.21/0.51 (step t10 (cl (not (= (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (or (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (not (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) (or (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule equiv_pos2)
% 0.21/0.51 (step t11 (cl (= (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) true) (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule equiv_simplify)
% 0.21/0.51 (step t12 (cl (not (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule equiv1 :premises (t11))
% 0.21/0.51 (step t13 (cl (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) (= (forall ((X $$unsorted)) (not (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule all_simplify)
% 0.21/0.51 (step t14 (cl (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule refl)
% 0.21/0.51 (step t15 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule all_simplify)
% 0.21/0.51 (step t16 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule cong :premises (t14 t15))
% 0.21/0.51 (step t17 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule all_simplify)
% 0.21/0.51 (step t18 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) true)) :rule trans :premises (t16 t17))
% 0.21/0.51 (step t19 (cl (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule trans :premises (t13 t18))
% 0.21/0.51 (step t20 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule resolution :premises (t12 t19))
% 0.21/0.51 (step t21 (cl (= (= (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) true) (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y)))))) :rule equiv_simplify)
% 0.21/0.51 (step t22 (cl (not (= (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) true)) (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule equiv1 :premises (t21))
% 0.21/0.51 (step t23 (cl (= (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))))) :rule all_simplify)
% 0.21/0.51 (step t24 (cl (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule refl)
% 0.21/0.51 (step t25 (cl (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule all_simplify)
% 0.21/0.51 (step t26 (cl (= (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (forall ((Y $$unsorted)) (not (tptp.p Y)))))) :rule cong :premises (t24 t25))
% 0.21/0.51 (step t27 (cl (= (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) true)) :rule all_simplify)
% 0.21/0.51 (step t28 (cl (= (= (forall ((Y $$unsorted)) (not (tptp.p Y))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) true)) :rule trans :premises (t26 t27))
% 0.21/0.51 (step t29 (cl (= (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) true)) :rule trans :premises (t23 t28))
% 0.21/0.51 (step t30 (cl (= (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule resolution :premises (t22 t29))
% 0.21/0.51 (step t31 (cl (= (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (or (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y)))))) :rule cong :premises (t20 t30))
% 0.21/0.51 (step t32 (cl (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) :rule not_equiv2 :premises (t6))
% 0.21/0.51 (step t33 (cl (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (not (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or_neg)
% 0.21/0.51 (step t34 (cl (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (not (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule or_neg)
% 0.21/0.51 (step t35 (cl (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y)))))) (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule resolution :premises (t32 t33 t34))
% 0.21/0.51 (step t36 (cl (or (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((Y $$unsorted)) (not (tptp.p Y))))))) :rule contraction :premises (t35))
% 0.21/0.51 (step t37 (cl (or (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule resolution :premises (t10 t31 t36))
% 0.21/0.51 (step t38 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((Y $$unsorted)) (not (tptp.p Y)))) :rule or :premises (t37))
% 0.21/0.51 (step t39 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (not (forall ((Y $$unsorted)) (not (tptp.p Y))))) :rule equiv2 :premises (t8))
% 0.21/0.51 (step t40 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule resolution :premises (t38 t39))
% 0.21/0.52 (step t41 (cl (forall ((X $$unsorted)) (not (tptp.p X)))) :rule contraction :premises (t40))
% 0.21/0.52 (step t42 (cl (forall ((Y $$unsorted)) (not (tptp.p Y)))) :rule resolution :premises (t9 t41))
% 0.21/0.52 (step t43 (cl) :rule resolution :premises (t7 t42 t41))
% 0.21/0.52
% 0.21/0.52 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.4YMh9efrFk/cvc5---1.0.5_8811.smt2
% 0.21/0.52 % cvc5---1.0.5 exiting
% 0.21/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------