TSTP Solution File: SYN618-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN618-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n026.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:09 EDT 2024
% Result : Unsatisfiable 0.47s 0.70s
% Output : Proof 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN618-1 : TPTP v8.2.0. Released v2.5.0.
% 0.07/0.15 % Command : do_cvc5 %s %d
% 0.15/0.36 % Computer : n026.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue May 28 13:32:39 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.50 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.47/0.70 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.kLeZEqlelZ/cvc5---1.0.5_17977.smt2
% 0.47/0.70 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.kLeZEqlelZ/cvc5---1.0.5_17977.smt2
% 0.47/0.71 (assume a0 (tptp.p9 tptp.c16))
% 0.47/0.71 (assume a1 (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)))
% 0.47/0.71 (assume a2 (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)))
% 0.47/0.71 (assume a3 (forall ((X29 $$unsorted)) (tptp.p4 X29 X29)))
% 0.47/0.71 (assume a4 (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)))
% 0.47/0.71 (assume a5 (forall ((X17 $$unsorted)) (tptp.p14 X17 X17)))
% 0.47/0.71 (assume a6 (tptp.p12 tptp.c19 tptp.c20))
% 0.47/0.71 (assume a7 (tptp.p13 tptp.c23 tptp.c21))
% 0.47/0.71 (assume a8 (tptp.p13 tptp.c19 tptp.c23))
% 0.47/0.71 (assume a9 (tptp.p13 tptp.c19 tptp.c21))
% 0.47/0.71 (assume a10 (tptp.p12 tptp.c20 tptp.c21))
% 0.47/0.71 (assume a11 (tptp.p2 tptp.c17 (tptp.f3 tptp.c16)))
% 0.47/0.71 (assume a12 (tptp.p11 tptp.c16 tptp.c17 tptp.c18))
% 0.47/0.71 (assume a13 (tptp.p5 (tptp.f8 tptp.c16 tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))))
% 0.47/0.71 (assume a14 (forall ((X44 $$unsorted) (X45 $$unsorted)) (or (tptp.p9 X44) (not (tptp.p9 X45)) (not (tptp.p2 X45 X44)))))
% 0.47/0.71 (assume a15 (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))
% 0.47/0.71 (assume a16 (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22)))))
% 0.47/0.71 (assume a17 (forall ((X38 $$unsorted) (X39 $$unsorted)) (or (tptp.p5 (tptp.f6 X38) (tptp.f6 X39)) (not (tptp.p4 X38 X39)))))
% 0.47/0.71 (assume a18 (forall ((X27 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 (tptp.f3 X27) (tptp.f3 X28)) (not (tptp.p2 X27 X28)))))
% 0.47/0.71 (assume a19 (forall ((X32 $$unsorted) (X33 $$unsorted)) (or (tptp.p4 (tptp.f7 X32) (tptp.f7 X33)) (not (tptp.p4 X32 X33)))))
% 0.47/0.71 (assume a20 (forall ((X1 $$unsorted) (X2 $$unsorted) (X0 $$unsorted)) (or (tptp.p10 X1 X2) (not (tptp.p10 X0 X1)) (not (tptp.p10 X0 X2)))))
% 0.47/0.71 (assume a21 (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))))
% 0.47/0.71 (assume a22 (forall ((X30 $$unsorted) (X31 $$unsorted) (X29 $$unsorted)) (or (tptp.p4 X30 X31) (not (tptp.p4 X29 X30)) (not (tptp.p4 X29 X31)))))
% 0.47/0.71 (assume a23 (forall ((X25 $$unsorted) (X26 $$unsorted) (X24 $$unsorted)) (or (tptp.p2 X25 X26) (not (tptp.p2 X24 X25)) (not (tptp.p2 X24 X26)))))
% 0.47/0.71 (assume a24 (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p14 X18 X19) (not (tptp.p14 X17 X18)) (not (tptp.p14 X17 X19)))))
% 0.47/0.71 (assume a25 (forall ((X9 $$unsorted) (X10 $$unsorted) (X11 $$unsorted) (X12 $$unsorted)) (or (tptp.p12 X9 X10) (not (tptp.p5 X11 X9)) (not (tptp.p5 X12 X10)) (not (tptp.p12 X11 X12)))))
% 0.47/0.71 (assume a26 (forall ((X20 $$unsorted) (X21 $$unsorted) (X23 $$unsorted) (X22 $$unsorted)) (or (tptp.p15 X20 X21) (not (tptp.p14 X23 X20)) (not (tptp.p15 X23 X22)) (not (tptp.p10 X22 X21)))))
% 0.47/0.71 (assume a27 (forall ((X13 $$unsorted) (X14 $$unsorted) (X15 $$unsorted) (X16 $$unsorted)) (or (tptp.p13 X13 X14) (not (tptp.p5 X15 X13)) (not (tptp.p5 X16 X14)) (not (tptp.p13 X15 X16)))))
% 0.47/0.71 (assume a28 (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p15 tptp.c24 tptp.c18)))))
% 0.47/0.71 (assume a29 (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))))
% 0.47/0.71 (assume a30 (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))))
% 0.47/0.71 (assume a31 (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c16 X37) (tptp.f6 (tptp.f7 tptp.c22)))))))
% 0.47/0.71 (assume a32 (forall ((X3 $$unsorted) (X4 $$unsorted) (X5 $$unsorted) (X8 $$unsorted) (X7 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X3 X4 X5) (not (tptp.p2 X8 X4)) (not (tptp.p2 X7 X3)) (not (tptp.p10 X6 X5)) (not (tptp.p11 X7 X8 X6)))))
% 0.47/0.71 (step t1 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t2)
% 0.47/0.71 (assume t2.a0 (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))))
% 0.47/0.71 (step t2.t1 (cl (or (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule forall_inst :args ((:= X40 (tptp.f3 tptp.c16)) (:= X41 tptp.c23) (:= X42 (tptp.f3 tptp.c16)) (:= X43 tptp.c20)))
% 0.47/0.71 (step t2.t2 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) :rule or :premises (t2.t1))
% 0.47/0.71 (step t2.t3 (cl (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) :rule resolution :premises (t2.t2 t2.a0))
% 0.47/0.71 (step t2 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) :rule subproof :discharge (t2.a0))
% 0.47/0.71 (step t3 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) :rule resolution :premises (t1 t2))
% 0.47/0.71 (step t4 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule implies_neg2)
% 0.47/0.71 (step t5 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule resolution :premises (t3 t4))
% 0.47/0.71 (step t6 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule contraction :premises (t5))
% 0.47/0.71 (step t7 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) :rule implies :premises (t6))
% 0.47/0.71 (step t8 (cl (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20)))) (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))) :rule or_pos)
% 0.47/0.71 (step t9 (cl (not (tptp.p5 tptp.c23 tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule reordering :premises (t8))
% 0.47/0.71 (step t10 (cl (not (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))) :rule or_pos)
% 0.47/0.71 (step t11 (cl (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))) (not (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule reordering :premises (t10))
% 0.47/0.71 (step t12 (cl (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))) :rule or_pos)
% 0.47/0.71 (step t13 (cl (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule reordering :premises (t12))
% 0.47/0.71 (step t14 (cl (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))) :rule or_pos)
% 0.47/0.71 (step t15 (cl (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))))) :rule reordering :premises (t14))
% 0.47/0.71 (step t16 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t17)
% 0.47/0.71 (assume t17.a0 (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)))
% 0.47/0.71 (step t17.t1 (cl (or (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))) :rule forall_inst :args ((:= X34 (tptp.f8 tptp.c17 tptp.c23))))
% 0.47/0.71 (step t17.t2 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule or :premises (t17.t1))
% 0.47/0.71 (step t17.t3 (cl (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule resolution :premises (t17.t2 t17.a0))
% 0.47/0.71 (step t17 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule subproof :discharge (t17.a0))
% 0.47/0.71 (step t18 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule resolution :premises (t16 t17))
% 0.47/0.71 (step t19 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))) :rule implies_neg2)
% 0.47/0.71 (step t20 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))) :rule resolution :premises (t18 t19))
% 0.47/0.71 (step t21 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))) :rule contraction :premises (t20))
% 0.47/0.71 (step t22 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule implies :premises (t21))
% 0.47/0.71 (step t23 (cl (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule resolution :premises (t22 a2))
% 0.47/0.71 (step t24 (cl (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))) :rule or_pos)
% 0.47/0.71 (step t25 (cl (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)) (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))))) :rule reordering :premises (t24))
% 0.47/0.71 (step t26 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23)) (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t27)
% 0.47/0.71 (assume t27.a0 (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)))
% 0.47/0.71 (step t27.t1 (cl (or (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 tptp.c23 tptp.c23))) :rule forall_inst :args ((:= X34 tptp.c23)))
% 0.47/0.71 (step t27.t2 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 tptp.c23 tptp.c23)) :rule or :premises (t27.t1))
% 0.47/0.71 (step t27.t3 (cl (tptp.p5 tptp.c23 tptp.c23)) :rule resolution :premises (t27.t2 t27.a0))
% 0.47/0.71 (step t27 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 tptp.c23 tptp.c23)) :rule subproof :discharge (t27.a0))
% 0.47/0.71 (step t28 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23)) (tptp.p5 tptp.c23 tptp.c23)) :rule resolution :premises (t26 t27))
% 0.47/0.71 (step t29 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23)) (not (tptp.p5 tptp.c23 tptp.c23))) :rule implies_neg2)
% 0.47/0.71 (step t30 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23)) (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23))) :rule resolution :premises (t28 t29))
% 0.47/0.71 (step t31 (cl (=> (forall ((X34 $$unsorted)) (tptp.p5 X34 X34)) (tptp.p5 tptp.c23 tptp.c23))) :rule contraction :premises (t30))
% 0.47/0.71 (step t32 (cl (not (forall ((X34 $$unsorted)) (tptp.p5 X34 X34))) (tptp.p5 tptp.c23 tptp.c23)) :rule implies :premises (t31))
% 0.47/0.71 (step t33 (cl (tptp.p5 tptp.c23 tptp.c23)) :rule resolution :premises (t32 a2))
% 0.47/0.71 (step t34 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t35)
% 0.47/0.71 (assume t35.a0 (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))))
% 0.47/0.71 (step t35.t1 (cl (or (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))))) :rule forall_inst :args ((:= X40 tptp.c17) (:= X41 tptp.c23) (:= X42 (tptp.f3 tptp.c16)) (:= X43 tptp.c23)))
% 0.47/0.71 (step t35.t2 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule or :premises (t35.t1))
% 0.47/0.71 (step t35.t3 (cl (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule resolution :premises (t35.t2 t35.a0))
% 0.47/0.71 (step t35 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule subproof :discharge (t35.a0))
% 0.47/0.71 (step t36 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule resolution :premises (t34 t35))
% 0.47/0.71 (step t37 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))))) :rule implies_neg2)
% 0.47/0.71 (step t38 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))))) :rule resolution :premises (t36 t37))
% 0.47/0.71 (step t39 (cl (=> (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23))))) :rule contraction :premises (t38))
% 0.47/0.71 (step t40 (cl (not (forall ((X40 $$unsorted) (X41 $$unsorted) (X42 $$unsorted) (X43 $$unsorted)) (or (tptp.p5 (tptp.f8 X40 X41) (tptp.f8 X42 X43)) (not (tptp.p2 X40 X42)) (not (tptp.p5 X41 X43))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule implies :premises (t39))
% 0.47/0.71 (step t41 (cl (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (not (tptp.p2 tptp.c17 (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c23)))) :rule resolution :premises (t40 a29))
% 0.47/0.71 (step t42 (cl (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) :rule resolution :premises (t25 a11 t33 t41))
% 0.47/0.71 (step t43 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t44)
% 0.47/0.71 (assume t44.a0 (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))))
% 0.47/0.71 (step t44.t1 (cl (or (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))))) :rule forall_inst :args ((:= X35 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23)) (:= X36 (tptp.f8 tptp.c17 tptp.c23)) (:= X34 (tptp.f8 tptp.c17 tptp.c23))))
% 0.47/0.71 (step t44.t2 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule or :premises (t44.t1))
% 0.47/0.71 (step t44.t3 (cl (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule resolution :premises (t44.t2 t44.a0))
% 0.47/0.71 (step t44 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule subproof :discharge (t44.a0))
% 0.47/0.71 (step t45 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule resolution :premises (t43 t44))
% 0.47/0.71 (step t46 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))))) :rule implies_neg2)
% 0.47/0.71 (step t47 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))))) :rule resolution :premises (t45 t46))
% 0.47/0.71 (step t48 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23)))))) :rule contraction :premises (t47))
% 0.47/0.71 (step t49 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule implies :premises (t48))
% 0.47/0.71 (step t50 (cl (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f8 tptp.c17 tptp.c23))))) :rule resolution :premises (t49 a21))
% 0.47/0.71 (step t51 (cl (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) :rule resolution :premises (t15 t23 t42 t50))
% 0.47/0.71 (step t52 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t53)
% 0.47/0.71 (assume t53.a0 (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))))
% 0.47/0.71 (step t53.t1 (cl (or (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule forall_inst :args ((:= X35 (tptp.f8 tptp.c17 tptp.c23)) (:= X36 (tptp.f6 (tptp.f7 tptp.c22))) (:= X34 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))))
% 0.47/0.71 (step t53.t2 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule or :premises (t53.t1))
% 0.47/0.71 (step t53.t3 (cl (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t53.t2 t53.a0))
% 0.47/0.71 (step t53 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule subproof :discharge (t53.a0))
% 0.47/0.71 (step t54 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t52 t53))
% 0.47/0.71 (step t55 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (not (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule implies_neg2)
% 0.47/0.71 (step t56 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule resolution :premises (t54 t55))
% 0.47/0.71 (step t57 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule contraction :premises (t56))
% 0.47/0.71 (step t58 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule implies :premises (t57))
% 0.47/0.71 (step t59 (cl (or (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 tptp.c17 tptp.c23))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t58 a21))
% 0.47/0.71 (step t60 (cl (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))) :rule resolution :premises (t13 a15 t51 t59))
% 0.47/0.71 (step t61 (cl (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t62)
% 0.47/0.71 (assume t62.a0 (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))))
% 0.47/0.71 (step t62.t1 (cl (or (not (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22))))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule forall_inst :args ((:= X37 tptp.c23)))
% 0.47/0.71 (step t62.t2 (cl (not (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22))))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule or :premises (t62.t1))
% 0.47/0.71 (step t62.t3 (cl (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t62.t2 t62.a0))
% 0.47/0.71 (step t62 (cl (not (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22))))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule subproof :discharge (t62.a0))
% 0.47/0.71 (step t63 (cl (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t61 t62))
% 0.47/0.71 (step t64 (cl (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (not (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule implies_neg2)
% 0.47/0.71 (step t65 (cl (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule resolution :premises (t63 t64))
% 0.47/0.71 (step t66 (cl (=> (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule contraction :premises (t65))
% 0.47/0.71 (step t67 (cl (not (forall ((X37 $$unsorted)) (or (tptp.p5 X37 tptp.c20) (not (tptp.p13 X37 tptp.c21)) (not (tptp.p13 tptp.c19 X37)) (not (tptp.p5 (tptp.f8 tptp.c17 X37) (tptp.f6 (tptp.f7 tptp.c22))))))) (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule implies :premises (t66))
% 0.47/0.71 (step t68 (cl (or (tptp.p5 tptp.c23 tptp.c20) (not (tptp.p13 tptp.c23 tptp.c21)) (not (tptp.p13 tptp.c19 tptp.c23)) (not (tptp.p5 (tptp.f8 tptp.c17 tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t67 a30))
% 0.47/0.71 (step t69 (cl (tptp.p5 tptp.c23 tptp.c20)) :rule resolution :premises (t11 a7 a8 t60 t68))
% 0.47/0.71 (step t70 (cl (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (forall ((X24 $$unsorted)) (tptp.p2 X24 X24))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t71)
% 0.47/0.71 (assume t71.a0 (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)))
% 0.47/0.71 (step t71.t1 (cl (or (not (forall ((X24 $$unsorted)) (tptp.p2 X24 X24))) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16)))) :rule forall_inst :args ((:= X24 (tptp.f3 tptp.c16))))
% 0.47/0.71 (step t71.t2 (cl (not (forall ((X24 $$unsorted)) (tptp.p2 X24 X24))) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule or :premises (t71.t1))
% 0.47/0.71 (step t71.t3 (cl (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule resolution :premises (t71.t2 t71.a0))
% 0.47/0.71 (step t71 (cl (not (forall ((X24 $$unsorted)) (tptp.p2 X24 X24))) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule subproof :discharge (t71.a0))
% 0.47/0.71 (step t72 (cl (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule resolution :premises (t70 t71))
% 0.47/0.71 (step t73 (cl (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16)))) :rule implies_neg2)
% 0.47/0.71 (step t74 (cl (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16)))) :rule resolution :premises (t72 t73))
% 0.47/0.71 (step t75 (cl (=> (forall ((X24 $$unsorted)) (tptp.p2 X24 X24)) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16)))) :rule contraction :premises (t74))
% 0.47/0.71 (step t76 (cl (not (forall ((X24 $$unsorted)) (tptp.p2 X24 X24))) (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule implies :premises (t75))
% 0.47/0.71 (step t77 (cl (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) :rule resolution :premises (t76 a4))
% 0.47/0.71 (step t78 (cl (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))) :rule or_pos)
% 0.47/0.71 (step t79 (cl (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule reordering :premises (t78))
% 0.47/0.71 (step t80 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) :rule implies_neg1)
% 0.47/0.71 (anchor :step t81)
% 0.47/0.71 (assume t81.a0 (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))))
% 0.47/0.71 (step t81.t1 (cl (or (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule forall_inst :args ((:= X35 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (:= X36 (tptp.f6 (tptp.f7 tptp.c22))) (:= X34 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23))))
% 0.47/0.71 (step t81.t2 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule or :premises (t81.t1))
% 0.47/0.71 (step t81.t3 (cl (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t81.t2 t81.a0))
% 0.47/0.71 (step t81 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule subproof :discharge (t81.a0))
% 0.47/0.71 (step t82 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t80 t81))
% 0.47/0.71 (step t83 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule implies_neg2)
% 0.47/0.71 (step t84 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule resolution :premises (t82 t83))
% 0.47/0.71 (step t85 (cl (=> (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36)))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22))))))) :rule contraction :premises (t84))
% 0.47/0.71 (step t86 (cl (not (forall ((X35 $$unsorted) (X36 $$unsorted) (X34 $$unsorted)) (or (tptp.p5 X35 X36) (not (tptp.p5 X34 X35)) (not (tptp.p5 X34 X36))))) (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule implies :premises (t85))
% 0.47/0.71 (step t87 (cl (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c20) (tptp.f6 (tptp.f7 tptp.c22))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20))) (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f6 (tptp.f7 tptp.c22)))))) :rule resolution :premises (t86 a21))
% 0.47/0.71 (step t88 (cl (not (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)))) :rule resolution :premises (t79 a16 a15 t87))
% 0.47/0.71 (step t89 (cl (not (or (tptp.p5 (tptp.f8 (tptp.f3 tptp.c16) tptp.c23) (tptp.f8 (tptp.f3 tptp.c16) tptp.c20)) (not (tptp.p2 (tptp.f3 tptp.c16) (tptp.f3 tptp.c16))) (not (tptp.p5 tptp.c23 tptp.c20))))) :rule resolution :premises (t9 t69 t77 t88))
% 0.47/0.71 (step t90 (cl) :rule resolution :premises (t7 t89 a29))
% 0.47/0.71
% 0.54/0.71 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.kLeZEqlelZ/cvc5---1.0.5_17977.smt2
% 0.54/0.71 % cvc5---1.0.5 exiting
% 0.54/0.71 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------