TSTP Solution File: SYN573-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN573-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 29 18:26:02 EDT 2024
% Result : Unsatisfiable 0.38s 1.02s
% Output : Proof 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.16 % Problem : SYN573-1 : TPTP v8.2.0. Released v2.5.0.
% 0.14/0.17 % Command : do_cvc5 %s %d
% 0.15/0.39 % Computer : n002.cluster.edu
% 0.15/0.39 % Model : x86_64 x86_64
% 0.15/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.39 % Memory : 8042.1875MB
% 0.15/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.39 % CPULimit : 300
% 0.15/0.39 % WCLimit : 300
% 0.15/0.39 % DateTime : Tue May 28 13:45:24 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.38/0.56 %----Proving TF0_NAR, FOF, or CNF
% 0.38/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.38/1.02 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.D5JCs8hAK7/cvc5---1.0.5_28179.smt2
% 0.38/1.02 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.D5JCs8hAK7/cvc5---1.0.5_28179.smt2
% 0.38/1.03 (assume a0 (tptp.p12 tptp.c15))
% 0.38/1.03 (assume a1 (forall ((X30 $$unsorted)) (tptp.p4 X30 X30)))
% 0.38/1.03 (assume a2 (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)))
% 0.38/1.03 (assume a3 (forall ((X16 $$unsorted)) (or (tptp.p2 X16 (tptp.f9 (tptp.f10 X16))) (not (tptp.p12 X16)))))
% 0.38/1.03 (assume a4 (forall ((X10 $$unsorted) (X11 $$unsorted)) (or (tptp.p12 X10) (not (tptp.p12 X11)) (not (tptp.p2 X11 X10)))))
% 0.38/1.03 (assume a5 (forall ((X37 $$unsorted) (X38 $$unsorted)) (or (tptp.p4 (tptp.f7 X37) (tptp.f7 X38)) (not (tptp.p4 X37 X38)))))
% 0.38/1.03 (assume a6 (forall ((X24 $$unsorted) (X25 $$unsorted)) (or (tptp.p2 (tptp.f5 X24) (tptp.f5 X25)) (not (tptp.p4 X24 X25)))))
% 0.38/1.03 (assume a7 (forall ((X26 $$unsorted) (X27 $$unsorted)) (or (tptp.p2 (tptp.f8 X26) (tptp.f8 X27)) (not (tptp.p2 X26 X27)))))
% 0.38/1.03 (assume a8 (forall ((X28 $$unsorted) (X29 $$unsorted)) (or (tptp.p2 (tptp.f9 X28) (tptp.f9 X29)) (not (tptp.p4 X28 X29)))))
% 0.38/1.03 (assume a9 (forall ((X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p4 (tptp.f10 X33) (tptp.f10 X34)) (not (tptp.p2 X33 X34)))))
% 0.38/1.03 (assume a10 (forall ((X35 $$unsorted) (X36 $$unsorted)) (or (tptp.p4 (tptp.f6 X35) (tptp.f6 X36)) (not (tptp.p4 X35 X36)))))
% 0.38/1.03 (assume a11 (forall ((X31 $$unsorted) (X32 $$unsorted) (X30 $$unsorted)) (or (tptp.p4 X31 X32) (not (tptp.p4 X30 X31)) (not (tptp.p4 X30 X32)))))
% 0.38/1.03 (assume a12 (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))))
% 0.38/1.03 (assume a13 (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))))
% 0.38/1.03 (assume a14 (forall ((X16 $$unsorted)) (or (tptp.p13 (tptp.f10 X16) tptp.c17) (tptp.p4 (tptp.f10 X16) tptp.c17) (not (tptp.p12 X16)))))
% 0.38/1.03 (assume a15 (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))
% 0.38/1.03 (assume a16 (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.38/1.03 (assume a17 (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted) (X15 $$unsorted)) (or (tptp.p13 X12 X13) (not (tptp.p4 X14 X12)) (not (tptp.p4 X15 X13)) (not (tptp.p13 X14 X15)))))
% 0.38/1.03 (assume a18 (not (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))
% 0.38/1.03 (assume a19 (forall ((X20 $$unsorted) (X21 $$unsorted) (X22 $$unsorted) (X23 $$unsorted)) (or (tptp.p2 (tptp.f3 X20 X21) (tptp.f3 X22 X23)) (not (tptp.p2 X20 X22)) (not (tptp.p2 X21 X23)))))
% 0.38/1.03 (assume a20 (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))))
% 0.38/1.03 (step t1 (cl (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) (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))))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t2)
% 0.38/1.03 (assume t2.a0 (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.38/1.03 (step t2.t1 (cl (or (not (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))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule forall_inst :args ((:= X0 tptp.c15) (:= X1 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (:= X2 (tptp.f9 tptp.c17)) (:= X3 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))
% 0.38/1.03 (step t2.t2 (cl (not (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))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) :rule or :premises (t2.t1))
% 0.38/1.03 (step t2.t3 (cl (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.38/1.03 (step t2 (cl (not (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))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) :rule subproof :discharge (t2.a0))
% 0.38/1.03 (step t3 (cl (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) :rule resolution :premises (t1 t2))
% 0.38/1.03 (step t4 (cl (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule implies_neg2)
% 0.38/1.03 (step t5 (cl (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule resolution :premises (t3 t4))
% 0.38/1.03 (step t6 (cl (=> (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)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule contraction :premises (t5))
% 0.38/1.03 (step t7 (cl (not (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))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) :rule implies :premises (t6))
% 0.38/1.03 (step t8 (cl (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))) (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule or_pos)
% 0.38/1.03 (step t9 (cl (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule reordering :premises (t8))
% 0.38/1.03 (step t10 (cl (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t11)
% 0.38/1.03 (assume t11.a0 (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))
% 0.38/1.03 (step t11.t1 (cl (or (not (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule forall_inst :args ((:= X7 (tptp.f9 tptp.c17)) (:= X8 tptp.c16)))
% 0.38/1.03 (step t11.t2 (cl (not (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule or :premises (t11.t1))
% 0.38/1.03 (step t11.t3 (cl (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t11.t2 t11.a0))
% 0.38/1.03 (step t11 (cl (not (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule subproof :discharge (t11.a0))
% 0.38/1.03 (step t12 (cl (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t10 t11))
% 0.38/1.03 (step t13 (cl (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule implies_neg2)
% 0.38/1.03 (step t14 (cl (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule resolution :premises (t12 t13))
% 0.38/1.03 (step t15 (cl (=> (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule contraction :premises (t14))
% 0.38/1.03 (step t16 (cl (not (forall ((X7 $$unsorted) (X8 $$unsorted)) (tptp.p11 X7 (tptp.f3 (tptp.f8 X8) (tptp.f3 (tptp.f8 X7) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule implies :premises (t15))
% 0.38/1.03 (step t17 (cl (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t16 a15))
% 0.38/1.03 (step t18 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t19)
% 0.38/1.03 (assume t19.a0 (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)))
% 0.38/1.03 (step t19.t1 (cl (or (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule forall_inst :args ((:= X17 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))))
% 0.38/1.03 (step t19.t2 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule or :premises (t19.t1))
% 0.38/1.03 (step t19.t3 (cl (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t19.t2 t19.a0))
% 0.38/1.03 (step t19 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule subproof :discharge (t19.a0))
% 0.38/1.03 (step t20 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t18 t19))
% 0.38/1.03 (step t21 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule implies_neg2)
% 0.38/1.03 (step t22 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule resolution :premises (t20 t21))
% 0.38/1.03 (step t23 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))) :rule contraction :premises (t22))
% 0.38/1.03 (step t24 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule implies :premises (t23))
% 0.38/1.03 (step t25 (cl (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) :rule resolution :premises (t24 a2))
% 0.38/1.03 (step t26 (cl (not (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))) :rule or_pos)
% 0.38/1.03 (step t27 (cl (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)) (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))))) :rule reordering :premises (t26))
% 0.38/1.03 (step t28 (cl (not (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))) :rule or_pos)
% 0.38/1.03 (step t29 (cl (not (tptp.p12 tptp.c15)) (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))))) :rule reordering :premises (t28))
% 0.38/1.03 (step t30 (cl (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))) :rule or_pos)
% 0.38/1.03 (step t31 (cl (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)) (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))))) :rule reordering :premises (t30))
% 0.38/1.03 (step t32 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5))))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t33)
% 0.38/1.03 (assume t33.a0 (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))))
% 0.38/1.03 (step t33.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))))) :rule forall_inst :args ((:= X4 tptp.c15) (:= X5 tptp.c16) (:= X6 (tptp.f9 tptp.c17))))
% 0.38/1.03 (step t33.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule or :premises (t33.t1))
% 0.38/1.03 (step t33.t3 (cl (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule resolution :premises (t33.t2 t33.a0))
% 0.38/1.03 (step t33 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule subproof :discharge (t33.a0))
% 0.38/1.03 (step t34 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule resolution :premises (t32 t33))
% 0.38/1.03 (step t35 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))))) :rule implies_neg2)
% 0.38/1.03 (step t36 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))))) :rule resolution :premises (t34 t35))
% 0.38/1.03 (step t37 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5)))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16))))) :rule contraction :premises (t36))
% 0.38/1.03 (step t38 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p11 X4 (tptp.f3 (tptp.f8 X5) (tptp.f3 (tptp.f8 X6) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 X4 X5))))) (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule implies :premises (t37))
% 0.38/1.03 (step t39 (cl (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p11 tptp.c15 tptp.c16)))) :rule resolution :premises (t38 a20))
% 0.38/1.03 (step t40 (cl (not (tptp.p11 tptp.c15 tptp.c16))) :rule resolution :premises (t31 a18 t39))
% 0.38/1.03 (step t41 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9))))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t42)
% 0.38/1.03 (assume t42.a0 (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))))
% 0.38/1.03 (step t42.t1 (cl (or (not (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9))))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))))) :rule forall_inst :args ((:= X9 tptp.c15)))
% 0.38/1.03 (step t42.t2 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9))))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule or :premises (t42.t1))
% 0.38/1.03 (step t42.t3 (cl (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule resolution :premises (t42.t2 t42.a0))
% 0.38/1.03 (step t42 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9))))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule subproof :discharge (t42.a0))
% 0.38/1.03 (step t43 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule resolution :premises (t41 t42))
% 0.38/1.03 (step t44 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) (not (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))))) :rule implies_neg2)
% 0.38/1.03 (step t45 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))))) :rule resolution :premises (t43 t44))
% 0.38/1.03 (step t46 (cl (=> (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9)))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15))))) :rule contraction :premises (t45))
% 0.38/1.03 (step t47 (cl (not (forall ((X9 $$unsorted)) (or (tptp.p11 X9 tptp.c16) (tptp.p2 X9 (tptp.f9 tptp.c17)) (not (tptp.p12 X9))))) (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule implies :premises (t46))
% 0.38/1.03 (step t48 (cl (or (tptp.p11 tptp.c15 tptp.c16) (tptp.p2 tptp.c15 (tptp.f9 tptp.c17)) (not (tptp.p12 tptp.c15)))) :rule resolution :premises (t47 a13))
% 0.38/1.03 (step t49 (cl (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) :rule resolution :premises (t29 a0 t40 t48))
% 0.38/1.03 (step t50 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15)) (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t51)
% 0.38/1.03 (assume t51.a0 (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)))
% 0.38/1.03 (step t51.t1 (cl (or (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 tptp.c15 tptp.c15))) :rule forall_inst :args ((:= X17 tptp.c15)))
% 0.38/1.03 (step t51.t2 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 tptp.c15 tptp.c15)) :rule or :premises (t51.t1))
% 0.38/1.03 (step t51.t3 (cl (tptp.p2 tptp.c15 tptp.c15)) :rule resolution :premises (t51.t2 t51.a0))
% 0.38/1.03 (step t51 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 tptp.c15 tptp.c15)) :rule subproof :discharge (t51.a0))
% 0.38/1.03 (step t52 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15)) (tptp.p2 tptp.c15 tptp.c15)) :rule resolution :premises (t50 t51))
% 0.38/1.03 (step t53 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15)) (not (tptp.p2 tptp.c15 tptp.c15))) :rule implies_neg2)
% 0.38/1.03 (step t54 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15)) (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15))) :rule resolution :premises (t52 t53))
% 0.38/1.03 (step t55 (cl (=> (forall ((X17 $$unsorted)) (tptp.p2 X17 X17)) (tptp.p2 tptp.c15 tptp.c15))) :rule contraction :premises (t54))
% 0.38/1.03 (step t56 (cl (not (forall ((X17 $$unsorted)) (tptp.p2 X17 X17))) (tptp.p2 tptp.c15 tptp.c15)) :rule implies :premises (t55))
% 0.38/1.03 (step t57 (cl (tptp.p2 tptp.c15 tptp.c15)) :rule resolution :premises (t56 a2))
% 0.38/1.03 (step t58 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19))))) :rule implies_neg1)
% 0.38/1.03 (anchor :step t59)
% 0.38/1.03 (assume t59.a0 (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))))
% 0.38/1.03 (step t59.t1 (cl (or (not (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19))))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))))) :rule forall_inst :args ((:= X18 (tptp.f9 tptp.c17)) (:= X19 tptp.c15) (:= X17 tptp.c15)))
% 0.38/1.03 (step t59.t2 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19))))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule or :premises (t59.t1))
% 0.38/1.03 (step t59.t3 (cl (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule resolution :premises (t59.t2 t59.a0))
% 0.38/1.03 (step t59 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19))))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule subproof :discharge (t59.a0))
% 0.38/1.03 (step t60 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule resolution :premises (t58 t59))
% 0.38/1.03 (step t61 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) (not (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))))) :rule implies_neg2)
% 0.38/1.03 (step t62 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))))) :rule resolution :premises (t60 t61))
% 0.38/1.03 (step t63 (cl (=> (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19)))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15))))) :rule contraction :premises (t62))
% 0.38/1.03 (step t64 (cl (not (forall ((X18 $$unsorted) (X19 $$unsorted) (X17 $$unsorted)) (or (tptp.p2 X18 X19) (not (tptp.p2 X17 X18)) (not (tptp.p2 X17 X19))))) (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule implies :premises (t63))
% 0.38/1.03 (step t65 (cl (or (tptp.p2 (tptp.f9 tptp.c17) tptp.c15) (not (tptp.p2 tptp.c15 (tptp.f9 tptp.c17))) (not (tptp.p2 tptp.c15 tptp.c15)))) :rule resolution :premises (t64 a12))
% 0.38/1.03 (step t66 (cl (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) :rule resolution :premises (t27 t49 t57 t65))
% 0.38/1.03 (step t67 (cl (not (or (tptp.p11 tptp.c15 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))) (not (tptp.p2 (tptp.f9 tptp.c17) tptp.c15)) (not (tptp.p2 (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14))))))) (not (tptp.p11 (tptp.f9 tptp.c17) (tptp.f3 (tptp.f8 tptp.c16) (tptp.f3 (tptp.f8 (tptp.f9 tptp.c17)) (tptp.f5 (tptp.f6 (tptp.f7 tptp.c14)))))))))) :rule resolution :premises (t9 a18 t17 t25 t66))
% 0.38/1.03 (step t68 (cl) :rule resolution :premises (t7 t67 a16))
% 0.38/1.03
% 0.38/1.03 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.D5JCs8hAK7/cvc5---1.0.5_28179.smt2
% 0.38/1.03 % cvc5---1.0.5 exiting
% 0.38/1.03 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------