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