TSTP Solution File: SYN934+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN934+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n013.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.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN934+1 : TPTP v8.2.0. Released v3.1.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n013.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 : Tue May 28 13:27:39 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.52 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.8nhqW8LXKi/cvc5---1.0.5_10526.smt2
% 0.20/0.52 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.8nhqW8LXKi/cvc5---1.0.5_10526.smt2
% 0.20/0.52 (assume a0 (not (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (=> tptp.c (exists ((X $$unsorted)) (tptp.p X))))))
% 0.20/0.52 (assume a1 true)
% 0.20/0.52 (step t1 (cl (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not tptp.c) (not (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) :rule and_neg)
% 0.20/0.52 (step t2 (cl (= (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule hole :args ((forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))) (= BOUND_VARIABLE_594 X)))
% 0.20/0.52 (step t3 (cl (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule equiv2 :premises (t2))
% 0.20/0.52 (step t4 (cl (not (= (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))))) (not (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule equiv_pos2)
% 0.20/0.52 (step t5 (cl (= (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule refl)
% 0.20/0.52 (step t6 (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.20/0.52 (step t7 (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 (t6))
% 0.20/0.52 (step t8 (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.20/0.52 (step t9 (cl (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule refl)
% 0.20/0.52 (step t10 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule all_simplify)
% 0.20/0.52 (step t11 (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 (t9 t10))
% 0.20/0.52 (step t12 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule all_simplify)
% 0.20/0.52 (step t13 (cl (= (= (forall ((X $$unsorted)) (not (tptp.p X))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) true)) :rule trans :premises (t11 t12))
% 0.20/0.52 (step t14 (cl (= (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) true)) :rule trans :premises (t8 t13))
% 0.20/0.52 (step t15 (cl (= (not (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule resolution :premises (t7 t14))
% 0.20/0.52 (step t16 (cl (= (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule cong :premises (t5 t15))
% 0.20/0.52 (step t17 (cl (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule implies_neg2)
% 0.20/0.52 (step t18 (cl (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or_neg)
% 0.20/0.52 (step t19 (cl (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (not (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or_neg)
% 0.20/0.52 (step t20 (cl (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule resolution :premises (t17 t18 t19))
% 0.20/0.52 (step t21 (cl (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (not (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule contraction :premises (t20))
% 0.20/0.52 (step t22 (cl (or (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X))))) :rule resolution :premises (t4 t16 t21))
% 0.20/0.52 (step t23 (cl (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule or :premises (t22))
% 0.20/0.52 (step t24 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule reordering :premises (t23))
% 0.20/0.52 (step t25 (cl (not (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (forall ((X $$unsorted)) (not (tptp.p X)))) :rule equiv1 :premises (t2))
% 0.20/0.52 (step t26 (cl (forall ((X $$unsorted)) (not (tptp.p X))) (not (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) :rule reordering :premises (t25))
% 0.20/0.52 (step t27 (cl (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) :rule and_pos)
% 0.20/0.52 (step t28 (cl (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))) (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule reordering :premises (t27))
% 0.20/0.52 (step t29 (cl (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (not tptp.c) (not (forall ((X $$unsorted)) (not (tptp.p X))))) :rule implies_pos)
% 0.20/0.52 (step t30 (cl (not (forall ((X $$unsorted)) (not (tptp.p X)))) (not tptp.c) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule reordering :premises (t29))
% 0.20/0.52 (step t31 (cl (not (= (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (or (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))))) (not (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) (or (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule equiv_pos2)
% 0.20/0.52 (step t32 (cl (= (= (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) true) (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) :rule equiv_simplify)
% 0.20/0.52 (step t33 (cl (not (= (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) true)) (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule equiv1 :premises (t32))
% 0.20/0.52 (step t34 (cl (= (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))))) :rule all_simplify)
% 0.20/0.52 (step t35 (cl (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule refl)
% 0.20/0.52 (step t36 (cl (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule all_simplify)
% 0.20/0.52 (step t37 (cl (= (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) :rule cong :premises (t35 t36))
% 0.20/0.52 (step t38 (cl (= (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) true)) :rule all_simplify)
% 0.20/0.52 (step t39 (cl (= (= (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) true)) :rule trans :premises (t37 t38))
% 0.20/0.52 (step t40 (cl (= (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) true)) :rule trans :premises (t34 t39))
% 0.20/0.52 (step t41 (cl (= (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule resolution :premises (t33 t40))
% 0.20/0.52 (step t42 (cl (= (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule refl)
% 0.20/0.52 (step t43 (cl (= (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (or (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))))) :rule cong :premises (t41 t42))
% 0.20/0.52 (step t44 (cl (not (= (not (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (=> tptp.c (exists ((X $$unsorted)) (tptp.p X))))) (not (= (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))))) (not (not (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (=> tptp.c (exists ((X $$unsorted)) (tptp.p X)))))) (not (= (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule equiv_pos2)
% 0.20/0.52 (step t45 (cl (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (not (forall ((X $$unsorted)) (not (=> tptp.c (tptp.p X))))))) :rule all_simplify)
% 0.20/0.52 (step t46 (cl (= (forall ((X $$unsorted)) (not (=> tptp.c (tptp.p X)))) (forall ((X $$unsorted)) (and tptp.c (not (tptp.p X)))))) :rule all_simplify)
% 0.20/0.52 (step t47 (cl (= (forall ((X $$unsorted)) (and tptp.c (not (tptp.p X)))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule all_simplify)
% 0.20/0.52 (step t48 (cl (= (forall ((X $$unsorted)) (not (=> tptp.c (tptp.p X)))) (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule trans :premises (t46 t47))
% 0.20/0.52 (step t49 (cl (= (not (forall ((X $$unsorted)) (not (=> tptp.c (tptp.p X))))) (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) :rule cong :premises (t48))
% 0.20/0.52 (step t50 (cl (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))))) :rule trans :premises (t45 t49))
% 0.20/0.52 (step t51 (cl (= tptp.c tptp.c)) :rule refl)
% 0.20/0.52 (step t52 (cl (= (exists ((X $$unsorted)) (tptp.p X)) (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule all_simplify)
% 0.20/0.52 (step t53 (cl (= (=> tptp.c (exists ((X $$unsorted)) (tptp.p X))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule cong :premises (t51 t52))
% 0.20/0.52 (step t54 (cl (= (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (=> tptp.c (exists ((X $$unsorted)) (tptp.p X)))) (= (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule cong :premises (t50 t53))
% 0.20/0.52 (step t55 (cl (= (not (= (exists ((X $$unsorted)) (=> tptp.c (tptp.p X))) (=> tptp.c (exists ((X $$unsorted)) (tptp.p X))))) (not (= (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))))) :rule cong :premises (t54))
% 0.20/0.52 (step t56 (cl (not (= (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule resolution :premises (t44 t55 a0))
% 0.20/0.52 (step t57 (cl (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule not_equiv2 :premises (t56))
% 0.20/0.52 (step t58 (cl (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (not (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))))) :rule or_neg)
% 0.20/0.52 (step t59 (cl (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (not (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule or_neg)
% 0.20/0.52 (step t60 (cl (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule resolution :premises (t57 t58 t59))
% 0.20/0.52 (step t61 (cl (or (not (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule contraction :premises (t60))
% 0.20/0.52 (step t62 (cl (or (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))))) :rule resolution :premises (t31 t43 t61))
% 0.20/0.52 (step t63 (cl (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or :premises (t62))
% 0.20/0.52 (step t64 (cl (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))) tptp.c) :rule implies_neg1)
% 0.20/0.52 (step t65 (cl tptp.c (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule reordering :premises (t64))
% 0.20/0.52 (step t66 (cl (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) tptp.c) :rule and_pos)
% 0.20/0.52 (step t67 (cl tptp.c (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule reordering :premises (t66))
% 0.20/0.52 (step t68 (cl tptp.c tptp.c) :rule resolution :premises (t63 t65 t67))
% 0.20/0.52 (step t69 (cl tptp.c) :rule contraction :premises (t68))
% 0.20/0.52 (step t70 (cl (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule or :premises (t62))
% 0.20/0.52 (step t71 (cl (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule resolution :premises (t26 t28 t30 t69 t70))
% 0.20/0.52 (step t72 (cl (not (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X))))))) :rule contraction :premises (t71))
% 0.20/0.52 (step t73 (cl (forall ((X $$unsorted)) (not (tptp.p X)))) :rule resolution :premises (t24 t72))
% 0.20/0.52 (step t74 (cl (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))) :rule resolution :premises (t3 t73))
% 0.20/0.52 (step t75 (cl (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594))))) (=> tptp.c (not (forall ((X $$unsorted)) (not (tptp.p X)))))) :rule not_equiv1 :premises (t56))
% 0.20/0.52 (step t76 (cl (not (and tptp.c (forall ((BOUND_VARIABLE_594 $$unsorted)) (not (tptp.p BOUND_VARIABLE_594)))))) :rule resolution :premises (t75 t72))
% 0.20/0.52 (step t77 (cl) :rule resolution :premises (t1 t74 t76 t69))
% 0.20/0.52
% 0.20/0.52 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.8nhqW8LXKi/cvc5---1.0.5_10526.smt2
% 0.20/0.52 % cvc5---1.0.5 exiting
% 0.20/0.52 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------