%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SYN557-1 : TPTP v8.2.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n020.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:00 EDT 2024

% Result   : Unsatisfiable 0.47s 0.66s
% Output   : Proof 0.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : SYN557-1 : TPTP v8.2.0. Released v2.5.0.
% 0.11/0.13  % Command    : do_cvc5 %s %d
% 0.13/0.34  % Computer : n020.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 14:08:09 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.47/0.66  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.3DldvDceat/cvc5---1.0.5_24513.smt2
% 0.47/0.66  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.3DldvDceat/cvc5---1.0.5_24513.smt2
% 0.47/0.66  (assume a0 (forall ((X3 $$unsorted)) (tptp.p2 X3 X3)))
% 0.47/0.66  (assume a1 (forall ((X19 $$unsorted)) (tptp.p4 X19 X19)))
% 0.47/0.66  (assume a2 (not (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)))))
% 0.47/0.66  (assume a3 (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))))
% 0.47/0.66  (assume a4 (forall ((X15 $$unsorted) (X16 $$unsorted)) (or (tptp.p2 (tptp.f5 X15) (tptp.f5 X16)) (not (tptp.p4 X15 X16)))))
% 0.47/0.66  (assume a5 (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))))
% 0.47/0.66  (assume a6 (forall ((X17 $$unsorted) (X18 $$unsorted) (X19 $$unsorted)) (or (tptp.p4 X17 X18) (not (tptp.p4 X19 X17)) (not (tptp.p4 X19 X18)))))
% 0.47/0.66  (assume a7 (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))))
% 0.47/0.66  (assume a8 (forall ((X0 $$unsorted) (X2 $$unsorted) (X1 $$unsorted)) (or (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)) (not (tptp.p2 X0 X1)))))
% 0.47/0.66  (assume a9 (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))))
% 0.47/0.66  (assume a10 (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 (tptp.f3 X12 X13) X14) (tptp.f3 X12 (tptp.f3 X13 X14)))))
% 0.47/0.66  (assume a11 (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))))
% 0.47/0.66  (assume a12 (forall ((X6 $$unsorted) (X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted)) (or (tptp.p2 (tptp.f3 X6 X7) (tptp.f3 X8 X9)) (not (tptp.p2 X6 X8)) (not (tptp.p2 X7 X9)))))
% 0.47/0.66  (step t1 (cl (not (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule or_pos)
% 0.47/0.66  (step t2 (cl (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (not (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule reordering :premises (t1))
% 0.47/0.66  (step t3 (cl (not (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule or_pos)
% 0.47/0.66  (step t4 (cl (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule reordering :premises (t3))
% 0.47/0.66  (step t5 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t6)
% 0.47/0.66  (assume t6.a0 (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))))
% 0.47/0.66  (step t6.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7))))) :rule forall_inst :args ((:= X10 (tptp.f5 tptp.c7)) (:= X11 tptp.c6)))
% 0.47/0.66  (step t6.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule or :premises (t6.t1))
% 0.47/0.66  (step t6.t3 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule resolution :premises (t6.t2 t6.a0))
% 0.47/0.66  (step t6 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule subproof :discharge (t6.a0))
% 0.47/0.66  (step t7 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule resolution :premises (t5 t6))
% 0.47/0.66  (step t8 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7))))) :rule implies_neg2)
% 0.47/0.66  (step t9 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7))))) :rule resolution :premises (t7 t8))
% 0.47/0.66  (step t10 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7))))) :rule contraction :premises (t9))
% 0.47/0.66  (step t11 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule implies :premises (t10))
% 0.47/0.66  (step t12 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) :rule resolution :premises (t11 a3))
% 0.47/0.66  (step t13 (cl (not (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule or_pos)
% 0.47/0.66  (step t14 (cl (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule reordering :premises (t13))
% 0.47/0.66  (step t15 (cl (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))) :rule or_pos)
% 0.47/0.66  (step t16 (cl (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))))) :rule reordering :premises (t15))
% 0.47/0.66  (step t17 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t18)
% 0.47/0.66  (assume t18.a0 (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))))
% 0.47/0.66  (step t18.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))) :rule forall_inst :args ((:= X10 tptp.c6) (:= X11 (tptp.f5 tptp.c7))))
% 0.47/0.66  (step t18.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule or :premises (t18.t1))
% 0.47/0.66  (step t18.t3 (cl (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule resolution :premises (t18.t2 t18.a0))
% 0.47/0.66  (step t18 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule subproof :discharge (t18.a0))
% 0.47/0.66  (step t19 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule resolution :premises (t17 t18))
% 0.47/0.66  (step t20 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))) :rule implies_neg2)
% 0.47/0.66  (step t21 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))) :rule resolution :premises (t19 t20))
% 0.47/0.66  (step t22 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))) :rule contraction :premises (t21))
% 0.47/0.66  (step t23 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule implies :premises (t22))
% 0.47/0.66  (step t24 (cl (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule resolution :premises (t23 a3))
% 0.47/0.66  (step t25 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t26)
% 0.47/0.66  (assume t26.a0 (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))))
% 0.47/0.66  (step t26.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))))) :rule forall_inst :args ((:= X4 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))) (:= X5 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (:= X3 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))))
% 0.47/0.66  (step t26.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule or :premises (t26.t1))
% 0.47/0.66  (step t26.t3 (cl (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule resolution :premises (t26.t2 t26.a0))
% 0.47/0.66  (step t26 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule subproof :discharge (t26.a0))
% 0.47/0.66  (step t27 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule resolution :premises (t25 t26))
% 0.47/0.66  (step t28 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))))) :rule implies_neg2)
% 0.47/0.66  (step t29 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))))) :rule resolution :premises (t27 t28))
% 0.47/0.66  (step t30 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)))))) :rule contraction :premises (t29))
% 0.47/0.66  (step t31 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule implies :premises (t30))
% 0.47/0.66  (step t32 (cl (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))) :rule resolution :premises (t31 a5))
% 0.47/0.66  (step t33 (cl (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) :rule resolution :premises (t16 a11 t24 t32))
% 0.47/0.66  (step t34 (cl (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule or_pos)
% 0.47/0.66  (step t35 (cl (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule reordering :premises (t34))
% 0.47/0.66  (step t36 (cl (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t37)
% 0.47/0.66  (assume t37.a0 (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))))
% 0.47/0.66  (step t37.t1 (cl (or (not (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))))) :rule forall_inst :args ((:= X12 (tptp.f5 tptp.c7)) (:= X13 tptp.c8) (:= X14 (tptp.f5 tptp.c9))))
% 0.47/0.66  (step t37.t2 (cl (not (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule or :premises (t37.t1))
% 0.47/0.66  (step t37.t3 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule resolution :premises (t37.t2 t37.a0))
% 0.47/0.66  (step t37 (cl (not (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule subproof :discharge (t37.a0))
% 0.47/0.66  (step t38 (cl (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule resolution :premises (t36 t37))
% 0.47/0.66  (step t39 (cl (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))))) :rule implies_neg2)
% 0.47/0.66  (step t40 (cl (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))))) :rule resolution :premises (t38 t39))
% 0.47/0.66  (step t41 (cl (=> (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))))) :rule contraction :premises (t40))
% 0.47/0.66  (step t42 (cl (not (forall ((X12 $$unsorted) (X13 $$unsorted) (X14 $$unsorted)) (tptp.p2 (tptp.f3 X12 (tptp.f3 X13 X14)) (tptp.f3 X13 (tptp.f3 X12 X14))))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule implies :premises (t41))
% 0.47/0.66  (step t43 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) :rule resolution :premises (t42 a9))
% 0.47/0.66  (step t44 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t45)
% 0.47/0.66  (assume t45.a0 (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))))
% 0.47/0.66  (step t45.t1 (cl (or (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule forall_inst :args ((:= X10 (tptp.f5 tptp.c7)) (:= X11 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)))))
% 0.47/0.66  (step t45.t2 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule or :premises (t45.t1))
% 0.47/0.66  (step t45.t3 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t45.t2 t45.a0))
% 0.47/0.66  (step t45 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule subproof :discharge (t45.a0))
% 0.47/0.66  (step t46 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t44 t45))
% 0.47/0.66  (step t47 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule implies_neg2)
% 0.47/0.66  (step t48 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule resolution :premises (t46 t47))
% 0.47/0.66  (step t49 (cl (=> (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))) :rule contraction :premises (t48))
% 0.47/0.66  (step t50 (cl (not (forall ((X10 $$unsorted) (X11 $$unsorted)) (tptp.p2 (tptp.f3 X10 X11) (tptp.f3 X11 X10)))) (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule implies :premises (t49))
% 0.47/0.66  (step t51 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t50 a3))
% 0.47/0.66  (step t52 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t53)
% 0.47/0.66  (assume t53.a0 (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))))
% 0.47/0.66  (step t53.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule forall_inst :args ((:= X4 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9)))) (:= X5 (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (:= X3 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))))))
% 0.47/0.66  (step t53.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule or :premises (t53.t1))
% 0.47/0.66  (step t53.t3 (cl (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t53.t2 t53.a0))
% 0.47/0.66  (step t53 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule subproof :discharge (t53.a0))
% 0.47/0.66  (step t54 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t52 t53))
% 0.47/0.66  (step t55 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (not (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule implies_neg2)
% 0.47/0.66  (step t56 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule resolution :premises (t54 t55))
% 0.47/0.66  (step t57 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule contraction :premises (t56))
% 0.47/0.66  (step t58 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule implies :premises (t57))
% 0.47/0.66  (step t59 (cl (or (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t58 a5))
% 0.47/0.66  (step t60 (cl (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t35 t43 t51 t59))
% 0.47/0.66  (step t61 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t62)
% 0.47/0.66  (assume t62.a0 (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))))
% 0.47/0.66  (step t62.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule forall_inst :args ((:= X4 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6)) (:= X5 (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (:= X3 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))))))
% 0.47/0.66  (step t62.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule or :premises (t62.t1))
% 0.47/0.66  (step t62.t3 (cl (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t62.t2 t62.a0))
% 0.47/0.66  (step t62 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule subproof :discharge (t62.a0))
% 0.47/0.66  (step t63 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t61 t62))
% 0.47/0.66  (step t64 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (not (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule implies_neg2)
% 0.47/0.66  (step t65 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule resolution :premises (t63 t64))
% 0.47/0.66  (step t66 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule contraction :premises (t65))
% 0.47/0.66  (step t67 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule implies :premises (t66))
% 0.47/0.66  (step t68 (cl (or (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))) (not (tptp.p2 (tptp.f3 tptp.c8 (tptp.f3 (tptp.f5 tptp.c7) (tptp.f5 tptp.c9))) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t67 a5))
% 0.47/0.66  (step t69 (cl (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t14 t33 t60 t68))
% 0.47/0.66  (step t70 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t71)
% 0.47/0.66  (assume t71.a0 (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))))
% 0.47/0.66  (step t71.t1 (cl (or (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule forall_inst :args ((:= X4 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7))) (:= X5 (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (:= X3 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6))))
% 0.47/0.66  (step t71.t2 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule or :premises (t71.t1))
% 0.47/0.66  (step t71.t3 (cl (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t71.t2 t71.a0))
% 0.47/0.66  (step t71 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule subproof :discharge (t71.a0))
% 0.47/0.66  (step t72 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t70 t71))
% 0.47/0.66  (step t73 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (not (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule implies_neg2)
% 0.47/0.66  (step t74 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule resolution :premises (t72 t73))
% 0.47/0.66  (step t75 (cl (=> (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5)))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule contraction :premises (t74))
% 0.47/0.66  (step t76 (cl (not (forall ((X4 $$unsorted) (X5 $$unsorted) (X3 $$unsorted)) (or (tptp.p2 X4 X5) (not (tptp.p2 X3 X4)) (not (tptp.p2 X3 X5))))) (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule implies :premises (t75))
% 0.47/0.66  (step t77 (cl (or (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)))) (not (tptp.p2 (tptp.f3 (tptp.f5 tptp.c7) tptp.c6) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t76 a5))
% 0.47/0.66  (step t78 (cl (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))) :rule resolution :premises (t4 t12 t69 t77))
% 0.47/0.66  (step t79 (cl (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)))))) :rule implies_neg1)
% 0.47/0.66  (anchor :step t80)
% 0.47/0.66  (assume t80.a0 (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))))
% 0.47/0.66  (step t80.t1 (cl (or (not (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule forall_inst :args ((:= X0 tptp.c6) (:= X1 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (:= X2 (tptp.f5 tptp.c7))))
% 0.47/0.66  (step t80.t2 (cl (not (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule or :premises (t80.t1))
% 0.47/0.66  (step t80.t3 (cl (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t80.t2 t80.a0))
% 0.47/0.66  (step t80 (cl (not (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule subproof :discharge (t80.a0))
% 0.47/0.66  (step t81 (cl (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t79 t80))
% 0.47/0.66  (step t82 (cl (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (not (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule implies_neg2)
% 0.47/0.66  (step t83 (cl (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule resolution :premises (t81 t82))
% 0.47/0.66  (step t84 (cl (=> (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7))))))) :rule contraction :premises (t83))
% 0.47/0.66  (step t85 (cl (not (forall ((X0 $$unsorted) (X1 $$unsorted) (X2 $$unsorted)) (or (tptp.p2 X0 X1) (not (tptp.p2 (tptp.f3 X0 X2) (tptp.f3 X1 X2)))))) (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule implies :premises (t84))
% 0.47/0.66  (step t86 (cl (or (tptp.p2 tptp.c6 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9))) (not (tptp.p2 (tptp.f3 tptp.c6 (tptp.f5 tptp.c7)) (tptp.f3 (tptp.f3 tptp.c8 (tptp.f5 tptp.c9)) (tptp.f5 tptp.c7)))))) :rule resolution :premises (t85 a7))
% 0.47/0.66  (step t87 (cl) :rule resolution :premises (t2 t78 t86 a2))
% 0.47/0.66  
% 0.47/0.66  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.3DldvDceat/cvc5---1.0.5_24513.smt2
% 0.47/0.67  % cvc5---1.0.5 exiting
% 0.47/0.67  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------