TSTP Solution File: SYN576-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN576-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n005.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.41s 0.59s
% Output : Proof 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN576-1 : TPTP v8.2.0. Released v2.5.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 28 12:34:39 EDT 2024
% 0.14/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.41/0.59 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.BaK62ZvJNV/cvc5---1.0.5_29280.smt2
% 0.41/0.59 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.BaK62ZvJNV/cvc5---1.0.5_29280.smt2
% 0.41/0.60 (assume a0 (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)))
% 0.41/0.60 (assume a1 (forall ((X13 $$unsorted)) (tptp.p2 X13 X13)))
% 0.41/0.60 (assume a2 (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)))
% 0.41/0.60 (assume a3 (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)))
% 0.41/0.60 (assume a4 (tptp.p12 tptp.c15 (tptp.f6 tptp.c13)))
% 0.41/0.60 (assume a5 (tptp.p12 tptp.c16 (tptp.f6 tptp.c13)))
% 0.41/0.60 (assume a6 (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))))
% 0.41/0.60 (assume a7 (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))))
% 0.41/0.60 (assume a8 (forall ((X40 $$unsorted) (X41 $$unsorted)) (or (tptp.p5 (tptp.f6 X40) (tptp.f6 X41)) (not (tptp.p4 X40 X41)))))
% 0.41/0.60 (assume a9 (forall ((X16 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 (tptp.f10 X16) (tptp.f10 X17)) (not (tptp.p2 X16 X17)))))
% 0.41/0.60 (assume a10 (forall ((X43 $$unsorted) (X44 $$unsorted) (X42 $$unsorted)) (or (tptp.p8 X43 X44) (not (tptp.p8 X42 X43)) (not (tptp.p8 X42 X44)))))
% 0.41/0.60 (assume a11 (forall ((X14 $$unsorted) (X15 $$unsorted) (X13 $$unsorted)) (or (tptp.p2 X14 X15) (not (tptp.p2 X13 X14)) (not (tptp.p2 X13 X15)))))
% 0.41/0.60 (assume a12 (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p4 X35 X36) (not (tptp.p4 X34 X35)) (not (tptp.p4 X34 X36)))))
% 0.41/0.60 (assume a13 (forall ((X38 $$unsorted) (X39 $$unsorted) (X37 $$unsorted)) (or (tptp.p5 X38 X39) (not (tptp.p5 X37 X38)) (not (tptp.p5 X37 X39)))))
% 0.41/0.60 (assume a14 (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted) (X3 $$unsorted)) (or (tptp.p11 X0 X1) (not (tptp.p2 X2 X0)) (not (tptp.p2 X3 X1)) (not (tptp.p11 X2 X3)))))
% 0.41/0.60 (assume a15 (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))))
% 0.41/0.60 (assume a16 (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13))))
% 0.41/0.60 (assume a17 (forall ((X18 $$unsorted) (X19 $$unsorted) (X20 $$unsorted) (X21 $$unsorted)) (or (tptp.p2 (tptp.f3 X18 X19) (tptp.f3 X20 X21)) (not (tptp.p2 X18 X20)) (not (tptp.p2 X19 X21)))))
% 0.41/0.60 (assume a18 (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))))
% 0.41/0.60 (assume a19 (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))))
% 0.41/0.60 (assume a20 (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) X12) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))))
% 0.41/0.60 (assume a21 (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))))
% 0.41/0.60 (step t1 (cl (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9))))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t2)
% 0.41/0.60 (assume t2.a0 (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))))
% 0.41/0.60 (step t2.t1 (cl (or (not (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule forall_inst :args ((:= X6 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (:= X7 (tptp.f6 tptp.c13)) (:= X8 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15))) (:= X9 (tptp.f6 tptp.c13))))
% 0.41/0.60 (step t2.t2 (cl (not (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) :rule or :premises (t2.t1))
% 0.41/0.60 (step t2.t3 (cl (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.41/0.60 (step t2 (cl (not (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) :rule subproof :discharge (t2.a0))
% 0.41/0.60 (step t3 (cl (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) :rule resolution :premises (t1 t2))
% 0.41/0.60 (step t4 (cl (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule implies_neg2)
% 0.41/0.60 (step t5 (cl (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule resolution :premises (t3 t4))
% 0.41/0.60 (step t6 (cl (=> (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9)))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule contraction :premises (t5))
% 0.41/0.60 (step t7 (cl (not (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p12 X6 X7) (not (tptp.p2 X8 X6)) (not (tptp.p5 X9 X7)) (not (tptp.p12 X8 X9))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) :rule implies :premises (t6))
% 0.41/0.60 (step t8 (cl (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))))) (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))) :rule or_pos)
% 0.41/0.60 (step t9 (cl (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule reordering :premises (t8))
% 0.41/0.60 (step t10 (cl (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (forall ((X37 $$unsorted)) (tptp.p5 X37 X37))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t11)
% 0.41/0.60 (assume t11.a0 (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)))
% 0.41/0.60 (step t11.t1 (cl (or (not (forall ((X37 $$unsorted)) (tptp.p5 X37 X37))) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13)))) :rule forall_inst :args ((:= X37 (tptp.f6 tptp.c13))))
% 0.41/0.60 (step t11.t2 (cl (not (forall ((X37 $$unsorted)) (tptp.p5 X37 X37))) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule or :premises (t11.t1))
% 0.41/0.60 (step t11.t3 (cl (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule resolution :premises (t11.t2 t11.a0))
% 0.41/0.60 (step t11 (cl (not (forall ((X37 $$unsorted)) (tptp.p5 X37 X37))) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule subproof :discharge (t11.a0))
% 0.41/0.60 (step t12 (cl (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule resolution :premises (t10 t11))
% 0.41/0.60 (step t13 (cl (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13)))) :rule implies_neg2)
% 0.41/0.60 (step t14 (cl (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13)))) :rule resolution :premises (t12 t13))
% 0.41/0.60 (step t15 (cl (=> (forall ((X37 $$unsorted)) (tptp.p5 X37 X37)) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13)))) :rule contraction :premises (t14))
% 0.41/0.60 (step t16 (cl (not (forall ((X37 $$unsorted)) (tptp.p5 X37 X37))) (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule implies :premises (t15))
% 0.41/0.60 (step t17 (cl (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) :rule resolution :premises (t16 a3))
% 0.41/0.60 (step t18 (cl (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule or_pos)
% 0.41/0.60 (step t19 (cl (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))) (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))))) :rule reordering :premises (t18))
% 0.41/0.60 (step t20 (cl (not (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))) :rule or_pos)
% 0.41/0.60 (step t21 (cl (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)) (not (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule reordering :premises (t20))
% 0.41/0.60 (step t22 (cl (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))) :rule or_pos)
% 0.41/0.60 (step t23 (cl (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))))) :rule reordering :premises (t22))
% 0.41/0.60 (step t24 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t25)
% 0.41/0.60 (assume t25.a0 (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))))
% 0.41/0.60 (step t25.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))))) :rule forall_inst :args ((:= X10 tptp.c13) (:= X11 tptp.c15) (:= X12 tptp.c16)))
% 0.41/0.60 (step t25.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule or :premises (t25.t1))
% 0.41/0.60 (step t25.t3 (cl (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule resolution :premises (t25.t2 t25.a0))
% 0.41/0.60 (step t25 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule subproof :discharge (t25.a0))
% 0.41/0.60 (step t26 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule resolution :premises (t24 t25))
% 0.41/0.60 (step t27 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))))) :rule implies_neg2)
% 0.41/0.60 (step t28 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))))) :rule resolution :premises (t26 t27))
% 0.41/0.60 (step t29 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))))) :rule contraction :premises (t28))
% 0.41/0.60 (step t30 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule implies :premises (t29))
% 0.41/0.60 (step t31 (cl (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16))))) :rule resolution :premises (t30 a21))
% 0.41/0.60 (step t32 (cl (not (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)))) :rule resolution :premises (t23 a16 a4 a5 t31))
% 0.41/0.60 (step t33 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4)))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t34)
% 0.41/0.60 (assume t34.a0 (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))))
% 0.41/0.60 (step t34.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4)))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule forall_inst :args ((:= X4 (tptp.f10 tptp.c15)) (:= X5 (tptp.f10 tptp.c16))))
% 0.41/0.60 (step t34.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4)))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule or :premises (t34.t1))
% 0.41/0.60 (step t34.t3 (cl (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule resolution :premises (t34.t2 t34.a0))
% 0.41/0.60 (step t34 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4)))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule subproof :discharge (t34.a0))
% 0.41/0.60 (step t35 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule resolution :premises (t33 t34))
% 0.41/0.60 (step t36 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) (not (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule implies_neg2)
% 0.41/0.60 (step t37 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule resolution :premises (t35 t36))
% 0.41/0.60 (step t38 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule contraction :premises (t37))
% 0.41/0.60 (step t39 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted)) (or (tptp.p11 X4 X5) (tptp.p11 X5 X4)))) (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule implies :premises (t38))
% 0.41/0.60 (step t40 (cl (or (tptp.p11 (tptp.f10 tptp.c15) (tptp.f10 tptp.c16)) (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))) :rule resolution :premises (t39 a6))
% 0.41/0.60 (step t41 (cl (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))) :rule resolution :premises (t21 t32 t40))
% 0.41/0.60 (step t42 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t43)
% 0.41/0.60 (assume t43.a0 (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))))
% 0.41/0.60 (step t43.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))))) :rule forall_inst :args ((:= X10 tptp.c13) (:= X11 tptp.c16) (:= X12 tptp.c15)))
% 0.41/0.60 (step t43.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule or :premises (t43.t1))
% 0.41/0.60 (step t43.t3 (cl (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule resolution :premises (t43.t2 t43.a0))
% 0.41/0.60 (step t43 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule subproof :discharge (t43.a0))
% 0.41/0.60 (step t44 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule resolution :premises (t42 t43))
% 0.41/0.60 (step t45 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))))) :rule implies_neg2)
% 0.41/0.60 (step t46 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))))) :rule resolution :premises (t44 t45))
% 0.41/0.60 (step t47 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15)))))) :rule contraction :premises (t46))
% 0.41/0.60 (step t48 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 (tptp.f7 (tptp.f9 X10 tptp.c14 (tptp.f3 X11 X12)) (tptp.f3 X11 X12)) (tptp.f6 X10)) (not (tptp.p12 X12 (tptp.f6 X10))) (not (tptp.p12 X11 (tptp.f6 X10))) (not (tptp.p11 (tptp.f10 X11) (tptp.f10 X12)))))) (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule implies :premises (t47))
% 0.41/0.60 (step t49 (cl (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)) (not (tptp.p12 tptp.c15 (tptp.f6 tptp.c13))) (not (tptp.p12 tptp.c16 (tptp.f6 tptp.c13))) (not (tptp.p11 (tptp.f10 tptp.c16) (tptp.f10 tptp.c15))))) :rule resolution :premises (t48 a21))
% 0.41/0.60 (step t50 (cl (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13))) :rule resolution :premises (t19 a4 a5 t41 t49))
% 0.41/0.60 (step t51 (cl (not (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule or_pos)
% 0.41/0.60 (step t52 (cl (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule reordering :premises (t51))
% 0.41/0.60 (step t53 (cl (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22)))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t54)
% 0.41/0.60 (assume t54.a0 (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))))
% 0.41/0.60 (step t54.t1 (cl (or (not (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22)))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule forall_inst :args ((:= X22 tptp.c16) (:= X23 tptp.c15)))
% 0.41/0.60 (step t54.t2 (cl (not (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22)))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule or :premises (t54.t1))
% 0.41/0.60 (step t54.t3 (cl (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule resolution :premises (t54.t2 t54.a0))
% 0.41/0.60 (step t54 (cl (not (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22)))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule subproof :discharge (t54.a0))
% 0.41/0.60 (step t55 (cl (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule resolution :premises (t53 t54))
% 0.41/0.60 (step t56 (cl (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule implies_neg2)
% 0.41/0.60 (step t57 (cl (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule resolution :premises (t55 t56))
% 0.41/0.60 (step t58 (cl (=> (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule contraction :premises (t57))
% 0.41/0.60 (step t59 (cl (not (forall ((X22 $$unsorted) (X23 $$unsorted)) (tptp.p2 (tptp.f3 X22 X23) (tptp.f3 X23 X22)))) (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule implies :premises (t58))
% 0.41/0.60 (step t60 (cl (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) :rule resolution :premises (t59 a7))
% 0.41/0.60 (step t61 (cl (not (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))) :rule or_pos)
% 0.41/0.60 (step t62 (cl (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule reordering :premises (t61))
% 0.41/0.60 (step t63 (cl (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13)) (forall ((X34 $$unsorted)) (tptp.p4 X34 X34))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t64)
% 0.41/0.60 (assume t64.a0 (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)))
% 0.41/0.60 (step t64.t1 (cl (or (not (forall ((X34 $$unsorted)) (tptp.p4 X34 X34))) (tptp.p4 tptp.c13 tptp.c13))) :rule forall_inst :args ((:= X34 tptp.c13)))
% 0.41/0.60 (step t64.t2 (cl (not (forall ((X34 $$unsorted)) (tptp.p4 X34 X34))) (tptp.p4 tptp.c13 tptp.c13)) :rule or :premises (t64.t1))
% 0.41/0.60 (step t64.t3 (cl (tptp.p4 tptp.c13 tptp.c13)) :rule resolution :premises (t64.t2 t64.a0))
% 0.41/0.60 (step t64 (cl (not (forall ((X34 $$unsorted)) (tptp.p4 X34 X34))) (tptp.p4 tptp.c13 tptp.c13)) :rule subproof :discharge (t64.a0))
% 0.41/0.60 (step t65 (cl (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13)) (tptp.p4 tptp.c13 tptp.c13)) :rule resolution :premises (t63 t64))
% 0.41/0.60 (step t66 (cl (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p4 tptp.c13 tptp.c13))) :rule implies_neg2)
% 0.41/0.60 (step t67 (cl (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13)) (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13))) :rule resolution :premises (t65 t66))
% 0.41/0.60 (step t68 (cl (=> (forall ((X34 $$unsorted)) (tptp.p4 X34 X34)) (tptp.p4 tptp.c13 tptp.c13))) :rule contraction :premises (t67))
% 0.41/0.60 (step t69 (cl (not (forall ((X34 $$unsorted)) (tptp.p4 X34 X34))) (tptp.p4 tptp.c13 tptp.c13)) :rule implies :premises (t68))
% 0.41/0.60 (step t70 (cl (tptp.p4 tptp.c13 tptp.c13)) :rule resolution :premises (t69 a2))
% 0.41/0.60 (step t71 (cl (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14)) (forall ((X42 $$unsorted)) (tptp.p8 X42 X42))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t72)
% 0.41/0.60 (assume t72.a0 (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)))
% 0.41/0.60 (step t72.t1 (cl (or (not (forall ((X42 $$unsorted)) (tptp.p8 X42 X42))) (tptp.p8 tptp.c14 tptp.c14))) :rule forall_inst :args ((:= X42 tptp.c14)))
% 0.41/0.60 (step t72.t2 (cl (not (forall ((X42 $$unsorted)) (tptp.p8 X42 X42))) (tptp.p8 tptp.c14 tptp.c14)) :rule or :premises (t72.t1))
% 0.41/0.60 (step t72.t3 (cl (tptp.p8 tptp.c14 tptp.c14)) :rule resolution :premises (t72.t2 t72.a0))
% 0.41/0.60 (step t72 (cl (not (forall ((X42 $$unsorted)) (tptp.p8 X42 X42))) (tptp.p8 tptp.c14 tptp.c14)) :rule subproof :discharge (t72.a0))
% 0.41/0.60 (step t73 (cl (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14)) (tptp.p8 tptp.c14 tptp.c14)) :rule resolution :premises (t71 t72))
% 0.41/0.60 (step t74 (cl (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p8 tptp.c14 tptp.c14))) :rule implies_neg2)
% 0.41/0.60 (step t75 (cl (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14)) (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14))) :rule resolution :premises (t73 t74))
% 0.41/0.60 (step t76 (cl (=> (forall ((X42 $$unsorted)) (tptp.p8 X42 X42)) (tptp.p8 tptp.c14 tptp.c14))) :rule contraction :premises (t75))
% 0.41/0.60 (step t77 (cl (not (forall ((X42 $$unsorted)) (tptp.p8 X42 X42))) (tptp.p8 tptp.c14 tptp.c14)) :rule implies :premises (t76))
% 0.41/0.60 (step t78 (cl (tptp.p8 tptp.c14 tptp.c14)) :rule resolution :premises (t77 a0))
% 0.41/0.60 (step t79 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33))))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t80)
% 0.41/0.60 (assume t80.a0 (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))))
% 0.41/0.60 (step t80.t1 (cl (or (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33))))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule forall_inst :args ((:= X28 tptp.c13) (:= X29 tptp.c14) (:= X30 (tptp.f3 tptp.c16 tptp.c15)) (:= X31 tptp.c13) (:= X32 tptp.c14) (:= X33 (tptp.f3 tptp.c15 tptp.c16))))
% 0.41/0.60 (step t80.t2 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33))))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule or :premises (t80.t1))
% 0.41/0.60 (step t80.t3 (cl (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t80.t2 t80.a0))
% 0.41/0.60 (step t80 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33))))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule subproof :discharge (t80.a0))
% 0.41/0.60 (step t81 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t79 t80))
% 0.41/0.60 (step t82 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (not (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule implies_neg2)
% 0.41/0.60 (step t83 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule resolution :premises (t81 t82))
% 0.41/0.60 (step t84 (cl (=> (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33)))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule contraction :premises (t83))
% 0.41/0.60 (step t85 (cl (not (forall ((X28 $$unsorted) (X29 $$unsorted) (X30 $$unsorted) (X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p2 (tptp.f9 X28 X29 X30) (tptp.f9 X31 X32 X33)) (not (tptp.p4 X28 X31)) (not (tptp.p8 X29 X32)) (not (tptp.p2 X30 X33))))) (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule implies :premises (t84))
% 0.41/0.60 (step t86 (cl (or (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p4 tptp.c13 tptp.c13)) (not (tptp.p8 tptp.c14 tptp.c14)) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t85 a19))
% 0.41/0.60 (step t87 (cl (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) :rule resolution :premises (t62 t60 t70 t78 t86))
% 0.41/0.60 (step t88 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27))))) :rule implies_neg1)
% 0.41/0.60 (anchor :step t89)
% 0.41/0.60 (assume t89.a0 (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))))
% 0.41/0.60 (step t89.t1 (cl (or (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27))))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule forall_inst :args ((:= X24 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15))) (:= X25 (tptp.f3 tptp.c16 tptp.c15)) (:= X26 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16))) (:= X27 (tptp.f3 tptp.c15 tptp.c16))))
% 0.41/0.60 (step t89.t2 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27))))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule or :premises (t89.t1))
% 0.41/0.60 (step t89.t3 (cl (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t89.t2 t89.a0))
% 0.41/0.60 (step t89 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27))))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule subproof :discharge (t89.a0))
% 0.41/0.60 (step t90 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t88 t89))
% 0.41/0.60 (step t91 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (not (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule implies_neg2)
% 0.41/0.60 (step t92 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule resolution :premises (t90 t91))
% 0.41/0.60 (step t93 (cl (=> (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27)))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16)))))) :rule contraction :premises (t92))
% 0.41/0.60 (step t94 (cl (not (forall ((X24 $$unsorted) (X25 $$unsorted) (X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f7 X24 X25) (tptp.f7 X26 X27)) (not (tptp.p2 X24 X26)) (not (tptp.p2 X25 X27))))) (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule implies :premises (t93))
% 0.41/0.60 (step t95 (cl (or (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16))) (not (tptp.p2 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p2 (tptp.f3 tptp.c16 tptp.c15) (tptp.f3 tptp.c15 tptp.c16))))) :rule resolution :premises (t94 a18))
% 0.41/0.60 (step t96 (cl (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) :rule resolution :premises (t52 t60 t87 t95))
% 0.41/0.60 (step t97 (cl (not (or (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)) (tptp.f6 tptp.c13)) (not (tptp.p2 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c15 tptp.c16)) (tptp.f3 tptp.c15 tptp.c16)))) (not (tptp.p5 (tptp.f6 tptp.c13) (tptp.f6 tptp.c13))) (not (tptp.p12 (tptp.f7 (tptp.f9 tptp.c13 tptp.c14 (tptp.f3 tptp.c16 tptp.c15)) (tptp.f3 tptp.c16 tptp.c15)) (tptp.f6 tptp.c13)))))) :rule resolution :premises (t9 a16 t17 t50 t96))
% 0.41/0.60 (step t98 (cl) :rule resolution :premises (t7 t97 a15))
% 0.41/0.60
% 0.41/0.60 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.BaK62ZvJNV/cvc5---1.0.5_29280.smt2
% 0.41/0.61 % cvc5---1.0.5 exiting
% 0.41/0.61 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------