TSTP Solution File: SYN592-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN592-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n010.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.85s 1.05s
% Output : Proof 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYN592-1 : TPTP v8.2.0. Released v2.5.0.
% 0.13/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue May 28 14:07:39 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.50 %----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.85/1.05 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.HjIhCgo7b1/cvc5---1.0.5_8905.smt2
% 0.85/1.05 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.HjIhCgo7b1/cvc5---1.0.5_8905.smt2
% 0.85/1.05 (assume a0 (tptp.p9 tptp.c14))
% 0.85/1.05 (assume a1 (tptp.p8 tptp.c13))
% 0.85/1.05 (assume a2 (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)))
% 0.85/1.05 (assume a3 (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)))
% 0.85/1.05 (assume a4 (forall ((X23 $$unsorted)) (tptp.p3 X23 X23)))
% 0.85/1.05 (assume a5 (forall ((X4 $$unsorted)) (tptp.p10 tptp.c14 X4)))
% 0.85/1.05 (assume a6 (tptp.p10 tptp.c13 tptp.c15))
% 0.85/1.05 (assume a7 (tptp.p10 tptp.c13 tptp.c17))
% 0.85/1.05 (assume a8 (tptp.p10 tptp.c13 tptp.c16))
% 0.85/1.05 (assume a9 (not (tptp.p2 tptp.c17 tptp.c15)))
% 0.85/1.05 (assume a10 (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))
% 0.85/1.05 (assume a11 (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))))
% 0.85/1.05 (assume a12 (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))))
% 0.85/1.05 (assume a13 (forall ((X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p8 X33) (not (tptp.p8 X34)) (not (tptp.p7 X34 X33)))))
% 0.85/1.05 (assume a14 (forall ((X35 $$unsorted) (X36 $$unsorted)) (or (tptp.p9 X35) (not (tptp.p9 X36)) (not (tptp.p7 X36 X35)))))
% 0.85/1.05 (assume a15 (forall ((X10 $$unsorted)) (or (tptp.p11 tptp.c14 (tptp.f4 tptp.c15 X10)) (not (tptp.p10 tptp.c13 X10)))))
% 0.85/1.05 (assume a16 (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p2 (tptp.f5 X18) (tptp.f5 X19)) (not (tptp.p2 X18 X19)))))
% 0.85/1.05 (assume a17 (forall ((X21 $$unsorted) (X22 $$unsorted)) (or (tptp.p2 (tptp.f6 X21) (tptp.f6 X22)) (not (tptp.p2 X21 X22)))))
% 0.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (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.85/1.05 (assume a26 (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 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.85/1.05 (anchor :step t2)
% 0.85/1.05 (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.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule forall_inst :args ((:= X26 (tptp.f6 tptp.c18)) (:= X27 tptp.c17) (:= X28 (tptp.f5 tptp.c18)) (:= X29 tptp.c17)))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule or :premises (t2.t1))
% 0.85/1.05 (step t2.t3 (cl (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule subproof :discharge (t2.a0))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule resolution :premises (t1 t2))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (not (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule implies_neg2)
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule resolution :premises (t3 t4))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule contraction :premises (t5))
% 0.85/1.05 (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.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) :rule implies :premises (t6))
% 0.85/1.05 (step t8 (cl (not (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)))) (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))) :rule or_pos)
% 0.85/1.05 (step t9 (cl (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule reordering :premises (t8))
% 0.85/1.05 (step t10 (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.85/1.05 (step t11 (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 (t10))
% 0.85/1.05 (step t12 (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.85/1.05 (anchor :step t13)
% 0.85/1.05 (assume t13.a0 (forall ((X20 $$unsorted)) (or (tptp.p2 (tptp.f6 X20) (tptp.f5 X20)) (not (tptp.p12 tptp.c14 (tptp.f4 X20 tptp.c17))))))
% 0.85/1.05 (step t13.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.85/1.05 (step t13.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 (t13.t1))
% 0.85/1.05 (step t13.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 (t13.t2 t13.a0))
% 0.85/1.05 (step t13 (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 (t13.a0))
% 0.85/1.05 (step t14 (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 (t12 t13))
% 0.85/1.05 (step t15 (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.85/1.05 (step t16 (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 (t14 t15))
% 0.85/1.05 (step t17 (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 (t16))
% 0.85/1.05 (step t18 (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 (t17))
% 0.85/1.05 (step t19 (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 (t18 a21))
% 0.85/1.05 (step t20 (cl (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) :rule resolution :premises (t11 a10 t19))
% 0.85/1.05 (step t21 (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.85/1.05 (anchor :step t22)
% 0.85/1.05 (assume t22.a0 (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)))
% 0.85/1.05 (step t22.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.85/1.05 (step t22.t2 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule or :premises (t22.t1))
% 0.85/1.05 (step t22.t3 (cl (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t22.t2 t22.a0))
% 0.85/1.05 (step t22 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule subproof :discharge (t22.a0))
% 0.85/1.05 (step t23 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17)) (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t21 t22))
% 0.85/1.05 (step t24 (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.85/1.05 (step t25 (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 (t23 t24))
% 0.85/1.05 (step t26 (cl (=> (forall ((X15 $$unsorted)) (tptp.p2 X15 X15)) (tptp.p2 tptp.c17 tptp.c17))) :rule contraction :premises (t25))
% 0.85/1.05 (step t27 (cl (not (forall ((X15 $$unsorted)) (tptp.p2 X15 X15))) (tptp.p2 tptp.c17 tptp.c17)) :rule implies :premises (t26))
% 0.85/1.05 (step t28 (cl (tptp.p2 tptp.c17 tptp.c17)) :rule resolution :premises (t27 a3))
% 0.85/1.05 (step t29 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))) :rule or_pos)
% 0.85/1.05 (step t30 (cl (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))))) :rule reordering :premises (t29))
% 0.85/1.05 (step t31 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))) :rule or_pos)
% 0.85/1.05 (step t32 (cl (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule reordering :premises (t31))
% 0.85/1.05 (step t33 (cl (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))) :rule or_pos)
% 0.85/1.05 (step t34 (cl (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))))) :rule reordering :premises (t33))
% 0.85/1.05 (step t35 (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.85/1.05 (anchor :step t36)
% 0.85/1.05 (assume t36.a0 (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)))
% 0.85/1.05 (step t36.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.85/1.05 (step t36.t2 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule or :premises (t36.t1))
% 0.85/1.05 (step t36.t3 (cl (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t36.t2 t36.a0))
% 0.85/1.05 (step t36 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule subproof :discharge (t36.a0))
% 0.85/1.05 (step t37 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13)) (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t35 t36))
% 0.85/1.05 (step t38 (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.85/1.05 (step t39 (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 (t37 t38))
% 0.85/1.05 (step t40 (cl (=> (forall ((X30 $$unsorted)) (tptp.p7 X30 X30)) (tptp.p7 tptp.c13 tptp.c13))) :rule contraction :premises (t39))
% 0.85/1.05 (step t41 (cl (not (forall ((X30 $$unsorted)) (tptp.p7 X30 X30))) (tptp.p7 tptp.c13 tptp.c13)) :rule implies :premises (t40))
% 0.85/1.05 (step t42 (cl (tptp.p7 tptp.c13 tptp.c13)) :rule resolution :premises (t41 a2))
% 0.85/1.05 (step t43 (cl (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))) :rule or_pos)
% 0.85/1.05 (step t44 (cl (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))))) :rule reordering :premises (t43))
% 0.85/1.05 (step t45 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 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.85/1.05 (anchor :step t46)
% 0.85/1.05 (assume t46.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.85/1.05 (step t46.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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))))) :rule forall_inst :args ((:= X26 tptp.c17) (:= X27 (tptp.f6 tptp.c18)) (:= X28 tptp.c17) (:= X29 (tptp.f5 tptp.c18))))
% 0.85/1.05 (step t46.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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule or :premises (t46.t1))
% 0.85/1.05 (step t46.t3 (cl (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule resolution :premises (t46.t2 t46.a0))
% 0.85/1.05 (step t46 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule subproof :discharge (t46.a0))
% 0.85/1.05 (step t47 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule resolution :premises (t45 t46))
% 0.85/1.05 (step t48 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) (not (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))))) :rule implies_neg2)
% 0.85/1.05 (step t49 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))))) :rule resolution :premises (t47 t48))
% 0.85/1.05 (step t50 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18)))))) :rule contraction :premises (t49))
% 0.85/1.05 (step t51 (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.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule implies :premises (t50))
% 0.85/1.05 (step t52 (cl (or (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))))) :rule resolution :premises (t51 a25))
% 0.85/1.05 (step t53 (cl (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) :rule resolution :premises (t44 t20 t28 t52))
% 0.85/1.05 (step t54 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 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.85/1.05 (anchor :step t55)
% 0.85/1.05 (assume t55.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.85/1.05 (step t55.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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))))) :rule forall_inst :args ((:= X5 tptp.c13) (:= X6 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (:= X8 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (:= X7 tptp.c13)))
% 0.85/1.05 (step t55.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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule or :premises (t55.t1))
% 0.85/1.05 (step t55.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule resolution :premises (t55.t2 t55.a0))
% 0.85/1.05 (step t55 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule subproof :discharge (t55.a0))
% 0.85/1.05 (step t56 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule resolution :premises (t54 t55))
% 0.85/1.05 (step t57 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) (not (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))))) :rule implies_neg2)
% 0.85/1.05 (step t58 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))))) :rule resolution :premises (t56 t57))
% 0.85/1.05 (step t59 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))))) :rule contraction :premises (t58))
% 0.85/1.05 (step t60 (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.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule implies :premises (t59))
% 0.85/1.05 (step t61 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f5 tptp.c18))) (not (tptp.p3 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)) (tptp.f4 tptp.c17 (tptp.f5 tptp.c18)))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18)))))) :rule resolution :premises (t60 a24))
% 0.85/1.05 (step t62 (cl (not (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))))) :rule resolution :premises (t34 a11 t42 t53 t61))
% 0.85/1.05 (step t63 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) :rule implies_neg1)
% 0.85/1.05 (anchor :step t64)
% 0.85/1.05 (assume t64.a0 (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))))
% 0.85/1.05 (step t64.t1 (cl (or (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule forall_inst :args ((:= X9 tptp.c18)))
% 0.85/1.05 (step t64.t2 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule or :premises (t64.t1))
% 0.85/1.05 (step t64.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t64.t2 t64.a0))
% 0.85/1.05 (step t64 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule subproof :discharge (t64.a0))
% 0.85/1.05 (step t65 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t63 t64))
% 0.85/1.05 (step t66 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule implies_neg2)
% 0.85/1.05 (step t67 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule resolution :premises (t65 t66))
% 0.85/1.05 (step t68 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17)))))) :rule contraction :premises (t67))
% 0.85/1.05 (step t69 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 X9))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 X9) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 X9 tptp.c17)))))) (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule implies :premises (t68))
% 0.85/1.05 (step t70 (cl (or (tptp.p11 tptp.c13 (tptp.f4 tptp.c17 (tptp.f6 tptp.c18))) (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (not (tptp.p12 tptp.c14 (tptp.f4 tptp.c18 tptp.c17))))) :rule resolution :premises (t69 a26))
% 0.85/1.05 (step t71 (cl (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))) :rule resolution :premises (t32 a10 t62 t70))
% 0.85/1.05 (step t72 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.85/1.05 (anchor :step t73)
% 0.85/1.05 (assume t73.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.85/1.05 (step t73.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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))))) :rule forall_inst :args ((:= X5 tptp.c13) (:= X6 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (:= X8 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)) (:= X7 tptp.c13)))
% 0.85/1.05 (step t73.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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule or :premises (t73.t1))
% 0.85/1.05 (step t73.t3 (cl (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule resolution :premises (t73.t2 t73.a0))
% 0.85/1.05 (step t73 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule subproof :discharge (t73.a0))
% 0.85/1.05 (step t74 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule resolution :premises (t72 t73))
% 0.85/1.05 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) (not (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))))) :rule implies_neg2)
% 0.85/1.05 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))))) :rule resolution :premises (t74 t75))
% 0.85/1.05 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17)))))) :rule contraction :premises (t76))
% 0.85/1.05 (step t78 (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.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule implies :premises (t77))
% 0.85/1.05 (step t79 (cl (or (tptp.p11 tptp.c13 (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17))) (not (tptp.p7 tptp.c13 tptp.c13)) (not (tptp.p11 tptp.c13 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17))))) :rule resolution :premises (t78 a24))
% 0.85/1.05 (step t80 (cl (not (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)))) :rule resolution :premises (t30 a12 t71 t42 t79))
% 0.85/1.05 (step t81 (cl (not (or (tptp.p3 (tptp.f4 (tptp.f6 tptp.c18) tptp.c17) (tptp.f4 (tptp.f5 tptp.c18) tptp.c17)) (not (tptp.p2 (tptp.f6 tptp.c18) (tptp.f5 tptp.c18))) (not (tptp.p2 tptp.c17 tptp.c17))))) :rule resolution :premises (t9 t20 t28 t80))
% 0.85/1.05 (step t82 (cl) :rule resolution :premises (t7 t81 a25))
% 0.85/1.05
% 0.85/1.06 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.HjIhCgo7b1/cvc5---1.0.5_8905.smt2
% 0.85/1.06 % cvc5---1.0.5 exiting
% 0.85/1.06 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------