TSTP Solution File: SYN575-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN575-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n025.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:03 EDT 2024
% Result : Unsatisfiable 0.42s 0.60s
% Output : Proof 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN575-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n025.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 13:36: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.42/0.60 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.fF6MrHGQ8q/cvc5---1.0.5_2305.smt2
% 0.42/0.60 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.fF6MrHGQ8q/cvc5---1.0.5_2305.smt2
% 0.42/0.61 (assume a0 (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)))
% 0.42/0.61 (assume a1 (forall ((X21 $$unsorted)) (tptp.p7 X21 X21)))
% 0.42/0.61 (assume a2 (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)))
% 0.42/0.61 (assume a3 (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)))
% 0.42/0.61 (assume a4 (tptp.p9 tptp.c12 tptp.c13))
% 0.42/0.61 (assume a5 (tptp.p11 tptp.c14 tptp.c15))
% 0.42/0.61 (assume a6 (forall ((X17 $$unsorted)) (tptp.p3 (tptp.f4 (tptp.f5 X17)) (tptp.f4 X17))))
% 0.42/0.61 (assume a7 (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))))
% 0.42/0.61 (assume a8 (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))))
% 0.42/0.61 (assume a9 (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))))
% 0.42/0.61 (assume a10 (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))))
% 0.42/0.61 (assume a11 (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))))
% 0.42/0.61 (assume a12 (forall ((X15 $$unsorted) (X16 $$unsorted)) (or (tptp.p3 (tptp.f4 X15) (tptp.f4 X16)) (not (tptp.p2 X15 X16)))))
% 0.42/0.61 (assume a13 (forall ((X1 $$unsorted) (X2 $$unsorted) (X0 $$unsorted)) (or (tptp.p10 X1 X2) (not (tptp.p10 X0 X1)) (not (tptp.p10 X0 X2)))))
% 0.42/0.61 (assume a14 (forall ((X22 $$unsorted) (X23 $$unsorted) (X21 $$unsorted)) (or (tptp.p7 X22 X23) (not (tptp.p7 X21 X22)) (not (tptp.p7 X21 X23)))))
% 0.42/0.61 (assume a15 (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))))
% 0.42/0.61 (assume a16 (forall ((X8 $$unsorted) (X9 $$unsorted) (X7 $$unsorted)) (or (tptp.p2 X8 X9) (not (tptp.p2 X7 X8)) (not (tptp.p2 X7 X9)))))
% 0.42/0.61 (assume a17 (forall ((X3 $$unsorted) (X4 $$unsorted) (X6 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X3 X4) (not (tptp.p11 X6 X5)) (not (tptp.p2 X6 X3)) (not (tptp.p10 X5 X4)))))
% 0.42/0.61 (assume a18 (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))))
% 0.42/0.61 (assume a19 (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))))
% 0.42/0.61 (assume a20 (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))))
% 0.42/0.61 (assume a21 (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))))
% 0.42/0.61 (step t1 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) :rule implies_neg1)
% 0.42/0.61 (anchor :step t2)
% 0.42/0.61 (assume t2.a0 (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))))
% 0.42/0.61 (step t2.t1 (cl (or (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule forall_inst :args ((:= X28 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (:= X29 (tptp.f6 (tptp.f5 tptp.c14))) (:= X31 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (:= X30 (tptp.f6 tptp.c14))))
% 0.42/0.61 (step t2.t2 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule or :premises (t2.t1))
% 0.42/0.61 (step t2.t3 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.42/0.61 (step t2 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule subproof :discharge (t2.a0))
% 0.42/0.61 (step t3 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t1 t2))
% 0.42/0.61 (step t4 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule implies_neg2)
% 0.42/0.61 (step t5 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule resolution :premises (t3 t4))
% 0.42/0.61 (step t6 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule contraction :premises (t5))
% 0.42/0.61 (step t7 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule implies :premises (t6))
% 0.42/0.61 (step t8 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))) :rule or_pos)
% 0.42/0.61 (step t9 (cl (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule reordering :premises (t8))
% 0.42/0.61 (step t10 (cl (not (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))) :rule or_pos)
% 0.42/0.61 (step t11 (cl (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule reordering :premises (t10))
% 0.42/0.61 (step t12 (cl (not (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))) :rule or_pos)
% 0.42/0.61 (step t13 (cl (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)) (not (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))))) :rule reordering :premises (t12))
% 0.42/0.61 (step t14 (cl (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14)) (forall ((X7 $$unsorted)) (tptp.p2 X7 X7))) :rule implies_neg1)
% 0.42/0.61 (anchor :step t15)
% 0.42/0.61 (assume t15.a0 (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)))
% 0.42/0.61 (step t15.t1 (cl (or (not (forall ((X7 $$unsorted)) (tptp.p2 X7 X7))) (tptp.p2 tptp.c14 tptp.c14))) :rule forall_inst :args ((:= X7 tptp.c14)))
% 0.42/0.61 (step t15.t2 (cl (not (forall ((X7 $$unsorted)) (tptp.p2 X7 X7))) (tptp.p2 tptp.c14 tptp.c14)) :rule or :premises (t15.t1))
% 0.42/0.61 (step t15.t3 (cl (tptp.p2 tptp.c14 tptp.c14)) :rule resolution :premises (t15.t2 t15.a0))
% 0.42/0.61 (step t15 (cl (not (forall ((X7 $$unsorted)) (tptp.p2 X7 X7))) (tptp.p2 tptp.c14 tptp.c14)) :rule subproof :discharge (t15.a0))
% 0.42/0.61 (step t16 (cl (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14)) (tptp.p2 tptp.c14 tptp.c14)) :rule resolution :premises (t14 t15))
% 0.42/0.61 (step t17 (cl (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))) :rule implies_neg2)
% 0.42/0.61 (step t18 (cl (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14)) (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14))) :rule resolution :premises (t16 t17))
% 0.42/0.61 (step t19 (cl (=> (forall ((X7 $$unsorted)) (tptp.p2 X7 X7)) (tptp.p2 tptp.c14 tptp.c14))) :rule contraction :premises (t18))
% 0.42/0.61 (step t20 (cl (not (forall ((X7 $$unsorted)) (tptp.p2 X7 X7))) (tptp.p2 tptp.c14 tptp.c14)) :rule implies :premises (t19))
% 0.42/0.61 (step t21 (cl (tptp.p2 tptp.c14 tptp.c14)) :rule resolution :premises (t20 a3))
% 0.42/0.61 (step t22 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11))))) :rule implies_neg1)
% 0.42/0.61 (anchor :step t23)
% 0.42/0.61 (assume t23.a0 (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))))
% 0.42/0.61 (step t23.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11))))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))))) :rule forall_inst :args ((:= X10 tptp.c14) (:= X11 tptp.c14)))
% 0.42/0.61 (step t23.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11))))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule or :premises (t23.t1))
% 0.42/0.61 (step t23.t3 (cl (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule resolution :premises (t23.t2 t23.a0))
% 0.42/0.61 (step t23 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11))))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule subproof :discharge (t23.a0))
% 0.45/0.61 (step t24 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule resolution :premises (t22 t23))
% 0.45/0.61 (step t25 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) (not (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))))) :rule implies_neg2)
% 0.45/0.61 (step t26 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))))) :rule resolution :premises (t24 t25))
% 0.45/0.61 (step t27 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11)))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14))))) :rule contraction :premises (t26))
% 0.45/0.61 (step t28 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p2 (tptp.f5 X10) (tptp.f5 X11)) (not (tptp.p2 X10 X11))))) (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule implies :premises (t27))
% 0.45/0.61 (step t29 (cl (or (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)) (not (tptp.p2 tptp.c14 tptp.c14)))) :rule resolution :premises (t28 a10))
% 0.45/0.61 (step t30 (cl (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) :rule resolution :premises (t13 t21 t29))
% 0.45/0.61 (step t31 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule or_pos)
% 0.45/0.61 (step t32 (cl (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule reordering :premises (t31))
% 0.45/0.61 (step t33 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))) :rule or_pos)
% 0.45/0.61 (step t34 (cl (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule reordering :premises (t33))
% 0.45/0.61 (step t35 (cl (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35)))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t36)
% 0.45/0.61 (assume t36.a0 (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))))
% 0.45/0.61 (step t36.t1 (cl (or (not (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule forall_inst :args ((:= X33 tptp.c13) (:= X34 (tptp.f5 tptp.c14)) (:= X35 tptp.c14)))
% 0.45/0.61 (step t36.t2 (cl (not (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule or :premises (t36.t1))
% 0.45/0.61 (step t36.t3 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t36.t2 t36.a0))
% 0.45/0.61 (step t36 (cl (not (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule subproof :discharge (t36.a0))
% 0.45/0.61 (step t37 (cl (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t35 t36))
% 0.45/0.61 (step t38 (cl (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule implies_neg2)
% 0.45/0.61 (step t39 (cl (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule resolution :premises (t37 t38))
% 0.45/0.61 (step t40 (cl (=> (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule contraction :premises (t39))
% 0.45/0.61 (step t41 (cl (not (forall ((X33 $$unsorted) (X34 $$unsorted) (X35 $$unsorted)) (or (tptp.p9 (tptp.f8 X33 X34) X33) (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)) (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule implies :premises (t40))
% 0.45/0.61 (step t42 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t41 a20))
% 0.45/0.61 (step t43 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule or_pos)
% 0.45/0.61 (step t44 (cl (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule reordering :premises (t43))
% 0.45/0.61 (step t45 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t46)
% 0.45/0.61 (assume t46.a0 (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))))
% 0.45/0.61 (step t46.t1 (cl (or (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule forall_inst :args ((:= X28 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (:= X29 (tptp.f6 tptp.c14)) (:= X31 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (:= X30 (tptp.f6 (tptp.f5 tptp.c14)))))
% 0.45/0.61 (step t46.t2 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule or :premises (t46.t1))
% 0.45/0.61 (step t46.t3 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t46.t2 t46.a0))
% 0.45/0.61 (step t46 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule subproof :discharge (t46.a0))
% 0.45/0.61 (step t47 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t45 t46))
% 0.45/0.61 (step t48 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule implies_neg2)
% 0.45/0.61 (step t49 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule resolution :premises (t47 t48))
% 0.45/0.61 (step t50 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule contraction :premises (t49))
% 0.45/0.61 (step t51 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X31 $$unsorted) (X30 $$unsorted)) (or (tptp.p9 X28 X29) (not (tptp.p7 X31 X28)) (not (tptp.p9 X31 X30)) (not (tptp.p3 X30 X29))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule implies :premises (t50))
% 0.45/0.61 (step t52 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t51 a18))
% 0.45/0.61 (step t53 (cl (not (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))) :rule or_pos)
% 0.45/0.61 (step t54 (cl (not (tptp.p3 tptp.c13 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))))) :rule reordering :premises (t53))
% 0.45/0.61 (step t55 (cl (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13)) (forall ((X12 $$unsorted)) (tptp.p3 X12 X12))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t56)
% 0.45/0.61 (assume t56.a0 (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)))
% 0.45/0.61 (step t56.t1 (cl (or (not (forall ((X12 $$unsorted)) (tptp.p3 X12 X12))) (tptp.p3 tptp.c13 tptp.c13))) :rule forall_inst :args ((:= X12 tptp.c13)))
% 0.45/0.61 (step t56.t2 (cl (not (forall ((X12 $$unsorted)) (tptp.p3 X12 X12))) (tptp.p3 tptp.c13 tptp.c13)) :rule or :premises (t56.t1))
% 0.45/0.61 (step t56.t3 (cl (tptp.p3 tptp.c13 tptp.c13)) :rule resolution :premises (t56.t2 t56.a0))
% 0.45/0.61 (step t56 (cl (not (forall ((X12 $$unsorted)) (tptp.p3 X12 X12))) (tptp.p3 tptp.c13 tptp.c13)) :rule subproof :discharge (t56.a0))
% 0.45/0.61 (step t57 (cl (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13)) (tptp.p3 tptp.c13 tptp.c13)) :rule resolution :premises (t55 t56))
% 0.45/0.61 (step t58 (cl (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13)) (not (tptp.p3 tptp.c13 tptp.c13))) :rule implies_neg2)
% 0.45/0.61 (step t59 (cl (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13)) (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13))) :rule resolution :premises (t57 t58))
% 0.45/0.61 (step t60 (cl (=> (forall ((X12 $$unsorted)) (tptp.p3 X12 X12)) (tptp.p3 tptp.c13 tptp.c13))) :rule contraction :premises (t59))
% 0.45/0.61 (step t61 (cl (not (forall ((X12 $$unsorted)) (tptp.p3 X12 X12))) (tptp.p3 tptp.c13 tptp.c13)) :rule implies :premises (t60))
% 0.45/0.61 (step t62 (cl (tptp.p3 tptp.c13 tptp.c13)) :rule resolution :premises (t61 a2))
% 0.45/0.61 (step t63 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t64)
% 0.45/0.61 (assume t64.a0 (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))))
% 0.45/0.61 (step t64.t1 (cl (or (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26))))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))))) :rule forall_inst :args ((:= X24 tptp.c13) (:= X25 (tptp.f5 tptp.c14)) (:= X26 tptp.c13) (:= X27 (tptp.f5 tptp.c14))))
% 0.45/0.61 (step t64.t2 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26))))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule or :premises (t64.t1))
% 0.45/0.61 (step t64.t3 (cl (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule resolution :premises (t64.t2 t64.a0))
% 0.45/0.61 (step t64 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26))))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule subproof :discharge (t64.a0))
% 0.45/0.61 (step t65 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule resolution :premises (t63 t64))
% 0.45/0.61 (step t66 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) (not (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))))) :rule implies_neg2)
% 0.45/0.61 (step t67 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))))) :rule resolution :premises (t65 t66))
% 0.45/0.61 (step t68 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26)))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13))))) :rule contraction :premises (t67))
% 0.45/0.61 (step t69 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p7 (tptp.f8 X24 X25) (tptp.f8 X26 X27)) (not (tptp.p2 X25 X27)) (not (tptp.p3 X24 X26))))) (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule implies :premises (t68))
% 0.45/0.61 (step t70 (cl (or (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p3 tptp.c13 tptp.c13)))) :rule resolution :premises (t69 a19))
% 0.45/0.61 (step t71 (cl (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) :rule resolution :premises (t54 t62 t30 t70))
% 0.45/0.61 (step t72 (cl (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20)))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t73)
% 0.45/0.61 (assume t73.a0 (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))))
% 0.45/0.61 (step t73.t1 (cl (or (not (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20)))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule forall_inst :args ((:= X20 tptp.c14)))
% 0.45/0.61 (step t73.t2 (cl (not (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20)))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule or :premises (t73.t1))
% 0.45/0.61 (step t73.t3 (cl (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule resolution :premises (t73.t2 t73.a0))
% 0.45/0.61 (step t73 (cl (not (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20)))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule subproof :discharge (t73.a0))
% 0.45/0.61 (step t74 (cl (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule resolution :premises (t72 t73))
% 0.45/0.61 (step t75 (cl (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule implies_neg2)
% 0.45/0.61 (step t76 (cl (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule resolution :premises (t74 t75))
% 0.45/0.61 (step t77 (cl (=> (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))) :rule contraction :premises (t76))
% 0.45/0.61 (step t78 (cl (not (forall ((X20 $$unsorted)) (tptp.p3 (tptp.f6 (tptp.f5 X20)) (tptp.f6 X20)))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule implies :premises (t77))
% 0.45/0.61 (step t79 (cl (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule resolution :premises (t78 a7))
% 0.45/0.61 (step t80 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))) :rule or_pos)
% 0.45/0.61 (step t81 (cl (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))))) :rule reordering :premises (t80))
% 0.45/0.61 (step t82 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t83)
% 0.45/0.61 (assume t83.a0 (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))))
% 0.45/0.61 (step t83.t1 (cl (or (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))))) :rule forall_inst :args ((:= X32 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))))
% 0.45/0.61 (step t83.t2 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule or :premises (t83.t1))
% 0.45/0.61 (step t83.t3 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule resolution :premises (t83.t2 t83.a0))
% 0.45/0.61 (step t83 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule subproof :discharge (t83.a0))
% 0.45/0.61 (step t84 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule resolution :premises (t82 t83))
% 0.45/0.61 (step t85 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))))) :rule implies_neg2)
% 0.45/0.61 (step t86 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))))) :rule resolution :premises (t84 t85))
% 0.45/0.61 (step t87 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13)))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13))))) :rule contraction :premises (t86))
% 0.45/0.61 (step t88 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 (tptp.f6 tptp.c14)) (not (tptp.p9 X32 tptp.c13))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule implies :premises (t87))
% 0.45/0.61 (step t89 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)))) :rule resolution :premises (t88 a9))
% 0.45/0.61 (step t90 (cl (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)) (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule resolution :premises (t34 t42 t30 a5 a4 t44 t52 t71 t79 t81 t89))
% 0.45/0.61 (step t91 (cl (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) :rule contraction :premises (t90))
% 0.45/0.61 (step t92 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14)))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t93)
% 0.45/0.61 (assume t93.a0 (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))))
% 0.45/0.61 (step t93.t1 (cl (or (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule forall_inst :args ((:= X32 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))))
% 0.45/0.61 (step t93.t2 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule or :premises (t93.t1))
% 0.45/0.61 (step t93.t3 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t93.t2 t93.a0))
% 0.45/0.61 (step t93 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule subproof :discharge (t93.a0))
% 0.45/0.61 (step t94 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t92 t93))
% 0.45/0.61 (step t95 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule implies_neg2)
% 0.45/0.61 (step t96 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule resolution :premises (t94 t95))
% 0.45/0.61 (step t97 (cl (=> (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14)))))) :rule contraction :premises (t96))
% 0.45/0.61 (step t98 (cl (not (forall ((X32 $$unsorted)) (or (tptp.p9 X32 tptp.c13) (not (tptp.p9 X32 (tptp.f6 tptp.c14)))))) (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule implies :premises (t97))
% 0.45/0.61 (step t99 (cl (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))))) :rule resolution :premises (t98 a8))
% 0.45/0.61 (step t100 (cl (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) :rule resolution :premises (t32 t91 t99))
% 0.45/0.61 (step t101 (cl (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t102)
% 0.45/0.61 (assume t102.a0 (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))))
% 0.45/0.61 (step t102.t1 (cl (or (not (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule forall_inst :args ((:= X35 tptp.c14) (:= X33 tptp.c13) (:= X34 (tptp.f5 tptp.c14))))
% 0.45/0.61 (step t102.t2 (cl (not (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule or :premises (t102.t1))
% 0.45/0.61 (step t102.t3 (cl (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t102.t2 t102.a0))
% 0.45/0.61 (step t102 (cl (not (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule subproof :discharge (t102.a0))
% 0.45/0.61 (step t103 (cl (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t101 t102))
% 0.45/0.61 (step t104 (cl (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (not (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule implies_neg2)
% 0.45/0.61 (step t105 (cl (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule resolution :premises (t103 t104))
% 0.45/0.61 (step t106 (cl (=> (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule contraction :premises (t105))
% 0.45/0.61 (step t107 (cl (not (forall ((X35 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (not (tptp.p11 X35 tptp.c15)) (not (tptp.p9 tptp.c12 X33)) (not (tptp.p2 X34 (tptp.f5 X35))) (not (tptp.p9 (tptp.f8 X33 X34) X33)) (not (tptp.p9 (tptp.f8 X33 X34) (tptp.f6 X34)))))) (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule implies :premises (t106))
% 0.45/0.61 (step t108 (cl (or (not (tptp.p11 tptp.c14 tptp.c15)) (not (tptp.p9 tptp.c12 tptp.c13)) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) tptp.c13)) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t107 a21))
% 0.45/0.61 (step t109 (cl (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))) :rule resolution :premises (t11 a4 a5 t30 t100 t108))
% 0.45/0.61 (step t110 (cl (not (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))) :rule or_pos)
% 0.45/0.61 (step t111 (cl (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule reordering :premises (t110))
% 0.45/0.61 (step t112 (cl (not (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))) :rule or_pos)
% 0.45/0.61 (step t113 (cl (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))) (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule reordering :premises (t112))
% 0.45/0.61 (step t114 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t115)
% 0.45/0.61 (assume t115.a0 (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))))
% 0.45/0.61 (step t115.t1 (cl (or (not (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19))))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule forall_inst :args ((:= X18 (tptp.f5 tptp.c14)) (:= X19 (tptp.f5 tptp.c14))))
% 0.45/0.61 (step t115.t2 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19))))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule or :premises (t115.t1))
% 0.45/0.61 (step t115.t3 (cl (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t115.t2 t115.a0))
% 0.45/0.61 (step t115 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19))))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule subproof :discharge (t115.a0))
% 0.45/0.61 (step t116 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t114 t115))
% 0.45/0.61 (step t117 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (not (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule implies_neg2)
% 0.45/0.61 (step t118 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule resolution :premises (t116 t117))
% 0.45/0.61 (step t119 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19)))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14)))))) :rule contraction :premises (t118))
% 0.45/0.61 (step t120 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p3 (tptp.f6 X18) (tptp.f6 X19)) (not (tptp.p2 X18 X19))))) (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule implies :premises (t119))
% 0.45/0.61 (step t121 (cl (or (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p2 (tptp.f5 tptp.c14) (tptp.f5 tptp.c14))))) :rule resolution :premises (t120 a11))
% 0.45/0.61 (step t122 (cl (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))) :rule resolution :premises (t113 t30 t121))
% 0.45/0.61 (step t123 (cl (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14))))) :rule implies_neg1)
% 0.45/0.61 (anchor :step t124)
% 0.45/0.61 (assume t124.a0 (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))))
% 0.45/0.61 (step t124.t1 (cl (or (not (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14))))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule forall_inst :args ((:= X13 (tptp.f6 tptp.c14)) (:= X14 (tptp.f6 (tptp.f5 tptp.c14))) (:= X12 (tptp.f6 (tptp.f5 tptp.c14)))))
% 0.45/0.61 (step t124.t2 (cl (not (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14))))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule or :premises (t124.t1))
% 0.45/0.61 (step t124.t3 (cl (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t124.t2 t124.a0))
% 0.45/0.61 (step t124 (cl (not (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14))))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule subproof :discharge (t124.a0))
% 0.45/0.61 (step t125 (cl (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t123 t124))
% 0.45/0.61 (step t126 (cl (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (not (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule implies_neg2)
% 0.45/0.61 (step t127 (cl (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule resolution :premises (t125 t126))
% 0.45/0.61 (step t128 (cl (=> (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14)))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule contraction :premises (t127))
% 0.45/0.61 (step t129 (cl (not (forall ((X13 $$unsorted) (X14 $$unsorted) (X12 $$unsorted)) (or (tptp.p3 X13 X14) (not (tptp.p3 X12 X13)) (not (tptp.p3 X12 X14))))) (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule implies :premises (t128))
% 0.45/0.61 (step t130 (cl (or (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14)))))) :rule resolution :premises (t129 a15))
% 0.45/0.61 (step t131 (cl (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14)))) :rule resolution :premises (t111 t79 t122 t130))
% 0.45/0.61 (step t132 (cl (not (or (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 (tptp.f5 tptp.c14))) (not (tptp.p7 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)))) (not (tptp.p9 (tptp.f8 tptp.c13 (tptp.f5 tptp.c14)) (tptp.f6 tptp.c14))) (not (tptp.p3 (tptp.f6 tptp.c14) (tptp.f6 (tptp.f5 tptp.c14))))))) :rule resolution :premises (t9 t109 t91 t71 t131))
% 0.45/0.61 (step t133 (cl) :rule resolution :premises (t7 t132 a18))
% 0.45/0.61
% 0.45/0.61 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.fF6MrHGQ8q/cvc5---1.0.5_2305.smt2
% 0.45/0.61 % cvc5---1.0.5 exiting
% 0.45/0.62 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------