TSTP Solution File: SYN937+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN937+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n032.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:54 EDT 2024
% Result : Theorem 0.15s 0.42s
% Output : Proof 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN937+1 : TPTP v8.2.0. Released v3.1.0.
% 0.03/0.11 % Command : do_cvc5 %s %d
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Tue May 28 12:41:53 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.15/0.40 %----Proving TF0_NAR, FOF, or CNF
% 0.15/0.42 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.15/0.42 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.2oJvfAiLJ3/cvc5---1.0.5_31650.smt2
% 0.15/0.42 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.2oJvfAiLJ3/cvc5---1.0.5_31650.smt2
% 0.15/0.42 (assume a0 (not (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c))))
% 0.15/0.42 (assume a1 true)
% 0.15/0.42 (step t1 (cl (not (= (not (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c))) (not (= (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))))) (not (not (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c)))) (not (= (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)))) :rule equiv_pos2)
% 0.15/0.42 (step t2 (cl (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (forall ((X $$unsorted)) (or (not (tptp.p X)) tptp.c)))) :rule all_simplify)
% 0.15/0.42 (step t3 (cl (= (forall ((X $$unsorted)) (or (not (tptp.p X)) tptp.c)) (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule all_simplify)
% 0.15/0.42 (step t4 (cl (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule trans :premises (t2 t3))
% 0.15/0.42 (step t5 (cl (= (exists ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule all_simplify)
% 0.15/0.42 (step t6 (cl (= tptp.c tptp.c)) :rule refl)
% 0.15/0.42 (step t7 (cl (= (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))) :rule cong :premises (t5 t6))
% 0.15/0.42 (step t8 (cl (= (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c)) (= (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)))) :rule cong :premises (t4 t7))
% 0.15/0.42 (step t9 (cl (= (not (= (forall ((X $$unsorted)) (=> (tptp.p X) tptp.c)) (=> (exists ((X $$unsorted)) (tptp.p X)) tptp.c))) (not (= (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))))) :rule cong :premises (t8))
% 0.15/0.42 (step t10 (cl (not (= (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)))) :rule resolution :premises (t1 t9 a0))
% 0.15/0.42 (step t11 (cl (not (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X))))) (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))) :rule not_equiv2 :premises (t10))
% 0.15/0.42 (step t12 (cl (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c) (not tptp.c)) :rule implies_neg2)
% 0.15/0.42 (step t13 (cl (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule hole :args ((forall ((X $$unsorted)) (not (tptp.p X))) (= X X)))
% 0.15/0.42 (step t14 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule equiv2 :premises (t13))
% 0.15/0.42 (step t15 (cl (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule or_neg)
% 0.15/0.42 (step t16 (cl (not (= (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (forall ((X $$unsorted)) (not (tptp.p X))) tptp.c))) (not (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c)) (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (forall ((X $$unsorted)) (not (tptp.p X))) tptp.c)) :rule equiv_pos2)
% 0.15/0.42 (step t17 (cl (= (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)))) :rule refl)
% 0.15/0.42 (step t18 (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.15/0.42 (step t19 (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 (t18))
% 0.15/0.42 (step t20 (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.15/0.42 (step t21 (cl (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule refl)
% 0.15/0.42 (step t22 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule all_simplify)
% 0.15/0.42 (step t23 (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 (t21 t22))
% 0.15/0.42 (step t24 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule all_simplify)
% 0.15/0.42 (step t25 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) true)) :rule trans :premises (t23 t24))
% 0.15/0.42 (step t26 (cl (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule trans :premises (t20 t25))
% 0.15/0.42 (step t27 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule resolution :premises (t19 t26))
% 0.15/0.42 (step t28 (cl (= tptp.c tptp.c)) :rule refl)
% 0.15/0.42 (step t29 (cl (= (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (forall ((X $$unsorted)) (not (tptp.p X))) tptp.c))) :rule cong :premises (t17 t27 t28))
% 0.15/0.42 (step t30 (cl (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) :rule implies_pos)
% 0.15/0.42 (step t31 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (not (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)))) :rule or_neg)
% 0.15/0.42 (step t32 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (not (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or_neg)
% 0.15/0.42 (step t33 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (not tptp.c)) :rule or_neg)
% 0.15/0.42 (step t34 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c)) :rule resolution :premises (t30 t31 t32 t33))
% 0.15/0.42 (step t35 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c)) :rule contraction :premises (t34))
% 0.15/0.42 (step t36 (cl (or (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (forall ((X $$unsorted)) (not (tptp.p X))) tptp.c)) :rule resolution :premises (t16 t29 t35))
% 0.15/0.42 (step t37 (cl (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (forall ((X $$unsorted)) (not (tptp.p X))) tptp.c) :rule or :premises (t36))
% 0.15/0.42 (step t38 (cl tptp.c (forall ((X $$unsorted)) (not (tptp.p X))) (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))) :rule reordering :premises (t37))
% 0.15/0.42 (step t39 (cl tptp.c (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))) :rule resolution :premises (t14 t15 t38 t11))
% 0.15/0.42 (step t40 (cl tptp.c (not (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c))) :rule contraction :premises (t39))
% 0.15/0.42 (step t41 (cl (not (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) :rule or_pos)
% 0.15/0.42 (step t42 (cl tptp.c (forall ((X $$unsorted)) (not (tptp.p X))) (not (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule reordering :premises (t41))
% 0.15/0.42 (step t43 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule equiv1 :premises (t13))
% 0.15/0.42 (step t44 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule reordering :premises (t43))
% 0.15/0.42 (step t45 (cl (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) :rule not_equiv1 :premises (t10))
% 0.15/0.42 (step t46 (cl (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule implies_neg1)
% 0.15/0.42 (step t47 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) :rule reordering :premises (t46))
% 0.15/0.42 (step t48 (cl tptp.c (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c) (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) :rule resolution :premises (t42 t44 t45 t47))
% 0.15/0.42 (step t49 (cl tptp.c (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) :rule contraction :premises (t48))
% 0.15/0.42 (step t50 (cl tptp.c tptp.c) :rule resolution :premises (t40 t49))
% 0.15/0.42 (step t51 (cl tptp.c) :rule contraction :premises (t50))
% 0.15/0.42 (step t52 (cl (=> (not (forall ((X $$unsorted)) (not (tptp.p X)))) tptp.c)) :rule resolution :premises (t12 t51))
% 0.15/0.42 (step t53 (cl (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X)))) (not tptp.c)) :rule or_neg)
% 0.15/0.42 (step t54 (cl (or tptp.c (forall ((X $$unsorted)) (not (tptp.p X))))) :rule resolution :premises (t53 t51))
% 0.15/0.42 (step t55 (cl) :rule resolution :premises (t11 t52 t54))
% 0.15/0.42
% 0.15/0.42 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.2oJvfAiLJ3/cvc5---1.0.5_31650.smt2
% 0.15/0.42 % cvc5---1.0.5 exiting
% 0.15/0.43 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------