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