TSTP Solution File: SYN591-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN591-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n003.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:05 EDT 2024
% Result : Unsatisfiable 0.90s 1.12s
% Output : Proof 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN591-1 : TPTP v8.2.0. Released v2.5.0.
% 0.15/0.16 % Command : do_cvc5 %s %d
% 0.16/0.37 % Computer : n003.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue May 28 13:43:09 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.39/0.54 %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.55 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.90/1.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.eQsbQXYDMm/cvc5---1.0.5_28799.smt2
% 0.90/1.12 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.eQsbQXYDMm/cvc5---1.0.5_28799.smt2
% 0.90/1.13 (assume a0 (tptp.p9 tptp.c14))
% 0.90/1.13 (assume a1 (tptp.p8 tptp.c13))
% 0.90/1.13 (assume a2 (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)))
% 0.90/1.13 (assume a3 (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)))
% 0.90/1.13 (assume a4 (forall ((X23 $$unsorted)) (tptp.p3 X23 X23)))
% 0.90/1.13 (assume a5 (forall ((X4 $$unsorted)) (tptp.p10 tptp.c14 X4)))
% 0.90/1.13 (assume a6 (tptp.p10 tptp.c13 tptp.c15))
% 0.90/1.13 (assume a7 (tptp.p10 tptp.c13 tptp.c17))
% 0.90/1.13 (assume a8 (tptp.p10 tptp.c13 tptp.c16))
% 0.90/1.13 (assume a9 (not (tptp.p2 tptp.c15 tptp.c17)))
% 0.90/1.13 (assume a10 (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))
% 0.90/1.13 (assume a11 (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))
% 0.90/1.13 (assume a12 (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))
% 0.90/1.13 (assume a13 (forall ((X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p8 X33) (not (tptp.p8 X34)) (not (tptp.p7 X34 X33)))))
% 0.90/1.13 (assume a14 (forall ((X35 $$unsorted) (X36 $$unsorted)) (or (tptp.p9 X35) (not (tptp.p9 X36)) (not (tptp.p7 X36 X35)))))
% 0.90/1.13 (assume a15 (forall ((X10 $$unsorted)) (or (tptp.p11 tptp.c14 (tptp.f4 tptp.c15 X10)) (not (tptp.p10 tptp.c13 X10)))))
% 0.90/1.13 (assume a16 (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p2 (tptp.f5 X18) (tptp.f5 X19)) (not (tptp.p2 X18 X19)))))
% 0.90/1.13 (assume a17 (forall ((X21 $$unsorted) (X22 $$unsorted)) (or (tptp.p2 (tptp.f6 X21) (tptp.f6 X22)) (not (tptp.p2 X21 X22)))))
% 0.90/1.13 (assume a18 (forall ((X31 $$unsorted) (X32 $$unsorted) (X30 $$unsorted)) (or (tptp.p7 X31 X32) (not (tptp.p7 X30 X31)) (not (tptp.p7 X30 X32)))))
% 0.90/1.13 (assume a19 (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))))
% 0.90/1.13 (assume a20 (forall ((X24 $$unsorted) (X25 $$unsorted) (X23 $$unsorted)) (or (tptp.p3 X24 X25) (not (tptp.p3 X23 X24)) (not (tptp.p3 X23 X25)))))
% 0.90/1.13 (assume a21 (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))))
% 0.90/1.13 (assume a22 (forall ((X0 $$unsorted) (X1 $$unsorted) (X3 $$unsorted) (X2 $$unsorted)) (or (tptp.p10 X0 X1) (not (tptp.p2 X3 X1)) (not (tptp.p7 X2 X0)) (not (tptp.p10 X2 X3)))))
% 0.90/1.13 (assume a23 (forall ((X11 $$unsorted) (X12 $$unsorted) (X14 $$unsorted) (X13 $$unsorted)) (or (tptp.p12 X11 X12) (not (tptp.p3 X14 X12)) (not (tptp.p7 X13 X11)) (not (tptp.p12 X13 X14)))))
% 0.90/1.13 (assume a24 (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))))
% 0.90/1.13 (assume a25 (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))))
% 0.90/1.13 (assume a26 (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))))
% 0.90/1.13 (step t1 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t2)
% 0.90/1.13 (assume t2.a0 (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))))
% 0.90/1.13 (step t2.t1 (cl (or (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule forall_inst :args ((:= X26 (tptp.f5 tptp.c18)) (:= X27 tptp.c17) (:= X28 (tptp.f6 tptp.c18)) (:= X29 tptp.c17)))
% 0.90/1.13 (step t2.t2 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule or :premises (t2.t1))
% 0.90/1.13 (step t2.t3 (cl (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.90/1.13 (step t2 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule subproof :discharge (t2.a0))
% 0.90/1.13 (step t3 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule resolution :premises (t1 t2))
% 0.90/1.13 (step t4 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (not (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule implies_neg2)
% 0.90/1.13 (step t5 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule resolution :premises (t3 t4))
% 0.90/1.13 (step t6 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule contraction :premises (t5))
% 0.90/1.13 (step t7 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule implies :premises (t6))
% 0.90/1.13 (step t8 (cl (not (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))) :rule or_pos)
% 0.90/1.13 (step t9 (cl (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule reordering :premises (t8))
% 0.90/1.13 (step t10 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17)) (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t11)
% 0.90/1.13 (assume t11.a0 (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)))
% 0.90/1.13 (step t11.t1 (cl (or (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17))) :rule forall_inst :args ((:= X15 tptp.c17)))
% 0.90/1.13 (step t11.t2 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule or :premises (t11.t1))
% 0.90/1.13 (step t11.t3 (cl (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t11.t2 t11.a0))
% 0.90/1.13 (step t11 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule subproof :discharge (t11.a0))
% 0.90/1.13 (step t12 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17)) (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t10 t11))
% 0.90/1.13 (step t13 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 tptp.c17 tptp.c17))) :rule implies_neg2)
% 0.90/1.13 (step t14 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17)) (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17))) :rule resolution :premises (t12 t13))
% 0.90/1.13 (step t15 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17))) :rule contraction :premises (t14))
% 0.90/1.13 (step t16 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule implies :premises (t15))
% 0.90/1.13 (step t17 (cl (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t16 a3))
% 0.90/1.13 (step t18 (cl (not (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))) :rule or_pos)
% 0.90/1.13 (step t19 (cl (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))))) :rule reordering :premises (t18))
% 0.90/1.13 (step t20 (cl (not (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))) :rule or_pos)
% 0.90/1.13 (step t21 (cl (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule reordering :premises (t20))
% 0.90/1.13 (step t22 (cl (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17)))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t23)
% 0.90/1.13 (assume t23.a0 (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))))
% 0.90/1.13 (step t23.t1 (cl (or (not (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17)))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule forall_inst :args ((:= X20 tptp.c18)))
% 0.90/1.13 (step t23.t2 (cl (not (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17)))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule or :premises (t23.t1))
% 0.90/1.13 (step t23.t3 (cl (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t23.t2 t23.a0))
% 0.90/1.13 (step t23 (cl (not (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17)))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule subproof :discharge (t23.a0))
% 0.90/1.13 (step t24 (cl (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t22 t23))
% 0.90/1.13 (step t25 (cl (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (not (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule implies_neg2)
% 0.90/1.13 (step t26 (cl (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule resolution :premises (t24 t25))
% 0.90/1.13 (step t27 (cl (=> (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule contraction :premises (t26))
% 0.90/1.13 (step t28 (cl (not (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17)))))) (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule implies :premises (t27))
% 0.90/1.13 (step t29 (cl (or (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t28 a21))
% 0.90/1.13 (step t30 (cl (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) :rule resolution :premises (t21 a10 t29))
% 0.90/1.13 (step t31 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t32)
% 0.90/1.13 (assume t32.a0 (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)))
% 0.90/1.13 (step t32.t1 (cl (or (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))) :rule forall_inst :args ((:= X15 (tptp.f6 tptp.c18))))
% 0.90/1.13 (step t32.t2 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule or :premises (t32.t1))
% 0.90/1.13 (step t32.t3 (cl (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule resolution :premises (t32.t2 t32.a0))
% 0.90/1.13 (step t32 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule subproof :discharge (t32.a0))
% 0.90/1.13 (step t33 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule resolution :premises (t31 t32))
% 0.90/1.13 (step t34 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))) :rule implies_neg2)
% 0.90/1.13 (step t35 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))) :rule resolution :premises (t33 t34))
% 0.90/1.13 (step t36 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))) :rule contraction :premises (t35))
% 0.90/1.13 (step t37 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule implies :premises (t36))
% 0.90/1.13 (step t38 (cl (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))) :rule resolution :premises (t37 a3))
% 0.90/1.13 (step t39 (cl (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t40)
% 0.90/1.13 (assume t40.a0 (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))))
% 0.90/1.13 (step t40.t1 (cl (or (not (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17))))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))))) :rule forall_inst :args ((:= X16 (tptp.f5 tptp.c18)) (:= X17 (tptp.f6 tptp.c18)) (:= X15 (tptp.f6 tptp.c18))))
% 0.90/1.13 (step t40.t2 (cl (not (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17))))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule or :premises (t40.t1))
% 0.90/1.13 (step t40.t3 (cl (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t40.t2 t40.a0))
% 0.90/1.13 (step t40 (cl (not (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17))))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule subproof :discharge (t40.a0))
% 0.90/1.13 (step t41 (cl (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t39 t40))
% 0.90/1.13 (step t42 (cl (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) (not (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))))) :rule implies_neg2)
% 0.90/1.13 (step t43 (cl (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))))) :rule resolution :premises (t41 t42))
% 0.90/1.13 (step t44 (cl (=> (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17)))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18)))))) :rule contraction :premises (t43))
% 0.90/1.13 (step t45 (cl (not (forall ((X16 $$unsorted) (X17 $$unsorted) (X15 $$unsorted)) (or (tptp.p2 X16 X17) (not (tptp.p2 X15 X16)) (not (tptp.p2 X15 X17))))) (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule implies :premises (t44))
% 0.90/1.13 (step t46 (cl (or (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t45 a19))
% 0.90/1.13 (step t47 (cl (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) :rule resolution :premises (t19 t30 t38 t46))
% 0.90/1.13 (step t48 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))) :rule or_pos)
% 0.90/1.13 (step t49 (cl (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))))) :rule reordering :premises (t48))
% 0.90/1.13 (step t50 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))) :rule or_pos)
% 0.90/1.13 (step t51 (cl (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule reordering :premises (t50))
% 0.90/1.13 (step t52 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))) :rule or_pos)
% 0.90/1.13 (step t53 (cl (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))))) :rule reordering :premises (t52))
% 0.90/1.13 (step t54 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13)) (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t55)
% 0.90/1.13 (assume t55.a0 (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)))
% 0.90/1.13 (step t55.t1 (cl (or (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13))) :rule forall_inst :args ((:= X30 tptp.c13)))
% 0.90/1.13 (step t55.t2 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule or :premises (t55.t1))
% 0.90/1.13 (step t55.t3 (cl (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t55.t2 t55.a0))
% 0.90/1.13 (step t55 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule subproof :discharge (t55.a0))
% 0.90/1.13 (step t56 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13)) (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t54 t55))
% 0.90/1.13 (step t57 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p7 tptp.c13 tptp.c13))) :rule implies_neg2)
% 0.90/1.13 (step t58 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13)) (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13))) :rule resolution :premises (t56 t57))
% 0.90/1.13 (step t59 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13))) :rule contraction :premises (t58))
% 0.90/1.13 (step t60 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule implies :premises (t59))
% 0.90/1.13 (step t61 (cl (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t60 a2))
% 0.90/1.13 (step t62 (cl (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))) :rule or_pos)
% 0.90/1.13 (step t63 (cl (not (tptp.p2 tptp.c17 tptp.c17)) (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))))) :rule reordering :premises (t62))
% 0.90/1.13 (step t64 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t65)
% 0.90/1.13 (assume t65.a0 (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))))
% 0.90/1.13 (step t65.t1 (cl (or (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))))) :rule forall_inst :args ((:= X26 tptp.c17) (:= X27 (tptp.f5 tptp.c18)) (:= X28 tptp.c17) (:= X29 (tptp.f6 tptp.c18))))
% 0.90/1.13 (step t65.t2 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule or :premises (t65.t1))
% 0.90/1.13 (step t65.t3 (cl (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t65.t2 t65.a0))
% 0.90/1.13 (step t65 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule subproof :discharge (t65.a0))
% 0.90/1.13 (step t66 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t64 t65))
% 0.90/1.13 (step t67 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))))) :rule implies_neg2)
% 0.90/1.13 (step t68 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))))) :rule resolution :premises (t66 t67))
% 0.90/1.13 (step t69 (cl (=> (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29)))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18)))))) :rule contraction :premises (t68))
% 0.90/1.13 (step t70 (cl (not (forall ((X26 $$unsorted) (X27 $$unsorted) (X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p3 (tptp.f4 X26 X27) (tptp.f4 X28 X29)) (not (tptp.p2 X26 X28)) (not (tptp.p2 X27 X29))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule implies :premises (t69))
% 0.90/1.13 (step t71 (cl (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))))) :rule resolution :premises (t70 a25))
% 0.90/1.13 (step t72 (cl (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) :rule resolution :premises (t63 t17 t47 t71))
% 0.90/1.13 (step t73 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t74)
% 0.90/1.13 (assume t74.a0 (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))))
% 0.90/1.13 (step t74.t1 (cl (or (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))))) :rule forall_inst :args ((:= X5 tptp.c13) (:= X6 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (:= X8 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (:= X7 tptp.c13)))
% 0.90/1.13 (step t74.t2 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule or :premises (t74.t1))
% 0.90/1.13 (step t74.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule resolution :premises (t74.t2 t74.a0))
% 0.90/1.13 (step t74 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule subproof :discharge (t74.a0))
% 0.90/1.13 (step t75 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule resolution :premises (t73 t74))
% 0.90/1.13 (step t76 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))))) :rule implies_neg2)
% 0.90/1.13 (step t77 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))))) :rule resolution :premises (t75 t76))
% 0.90/1.13 (step t78 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))))) :rule contraction :premises (t77))
% 0.90/1.13 (step t79 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule implies :premises (t78))
% 0.90/1.13 (step t80 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))) :rule resolution :premises (t79 a24))
% 0.90/1.13 (step t81 (cl (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))))) :rule resolution :premises (t53 a11 t61 t72 t80))
% 0.90/1.13 (step t82 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t83)
% 0.90/1.13 (assume t83.a0 (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))))
% 0.90/1.13 (step t83.t1 (cl (or (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule forall_inst :args ((:= X9 tptp.c18)))
% 0.90/1.13 (step t83.t2 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule or :premises (t83.t1))
% 0.90/1.13 (step t83.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t83.t2 t83.a0))
% 0.90/1.13 (step t83 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule subproof :discharge (t83.a0))
% 0.90/1.13 (step t84 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t82 t83))
% 0.90/1.13 (step t85 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule implies_neg2)
% 0.90/1.13 (step t86 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule resolution :premises (t84 t85))
% 0.90/1.13 (step t87 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule contraction :premises (t86))
% 0.90/1.13 (step t88 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule implies :premises (t87))
% 0.90/1.13 (step t89 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t88 a26))
% 0.90/1.13 (step t90 (cl (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) :rule resolution :premises (t51 a10 t81 t89))
% 0.90/1.13 (step t91 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) :rule implies_neg1)
% 0.90/1.13 (anchor :step t92)
% 0.90/1.13 (assume t92.a0 (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))))
% 0.90/1.13 (step t92.t1 (cl (or (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))))) :rule forall_inst :args ((:= X5 tptp.c13) (:= X6 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (:= X8 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (:= X7 tptp.c13)))
% 0.90/1.13 (step t92.t2 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule or :premises (t92.t1))
% 0.90/1.13 (step t92.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule resolution :premises (t92.t2 t92.a0))
% 0.90/1.13 (step t92 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule subproof :discharge (t92.a0))
% 0.90/1.13 (step t93 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule resolution :premises (t91 t92))
% 0.90/1.13 (step t94 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))))) :rule implies_neg2)
% 0.90/1.13 (step t95 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))))) :rule resolution :premises (t93 t94))
% 0.90/1.13 (step t96 (cl (=> (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8)))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))))) :rule contraction :premises (t95))
% 0.90/1.13 (step t97 (cl (not (forall ((X5 $$unsorted) (X6 $$unsorted) (X8 $$unsorted) (X7 $$unsorted)) (or (tptp.p11 X5 X6) (not (tptp.p3 X8 X6)) (not (tptp.p7 X7 X5)) (not (tptp.p11 X7 X8))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule implies :premises (t96))
% 0.90/1.13 (step t98 (cl (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))) :rule resolution :premises (t97 a24))
% 0.90/1.13 (step t99 (cl (not (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))) :rule resolution :premises (t49 a12 t90 t61 t98))
% 0.90/1.13 (step t100 (cl (not (or (tptp.p3 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17) (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f5 tptp.c18) (tptp.f6 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule resolution :premises (t9 t17 t47 t99))
% 0.90/1.13 (step t101 (cl) :rule resolution :premises (t7 t100 a25))
% 0.90/1.13
% 0.90/1.13 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.eQsbQXYDMm/cvc5---1.0.5_28799.smt2
% 0.90/1.13 % cvc5---1.0.5 exiting
% 0.90/1.14 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------