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

% Computer : n013.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:17 EDT 2024

% Result   : Unsatisfiable 0.45s 0.77s
% Output   : Proof 0.45s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.16  % Problem    : SYN680-1 : TPTP v8.2.0. Released v2.5.0.
% 0.09/0.17  % Command    : do_cvc5 %s %d
% 0.18/0.39  % Computer : n013.cluster.edu
% 0.18/0.39  % Model    : x86_64 x86_64
% 0.18/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39  % Memory   : 8042.1875MB
% 0.18/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39  % CPULimit   : 300
% 0.18/0.39  % WCLimit    : 300
% 0.18/0.39  % DateTime   : Tue May 28 12:59:39 EDT 2024
% 0.18/0.40  % CPUTime    : 
% 0.40/0.58  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.59  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.45/0.77  % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.UXWj3WX0qG/cvc5---1.0.5_15590.smt2
% 0.45/0.77  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.UXWj3WX0qG/cvc5---1.0.5_15590.smt2
% 0.45/0.77  (assume a0 (tptp.p22 tptp.c28))
% 0.45/0.77  (assume a1 (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)))
% 0.45/0.77  (assume a2 (forall ((X91 $$unsorted)) (tptp.p7 X91 X91)))
% 0.45/0.77  (assume a3 (forall ((X88 $$unsorted)) (tptp.p6 X88 X88)))
% 0.45/0.77  (assume a4 (forall ((X83 $$unsorted)) (tptp.p3 X83 X83)))
% 0.45/0.77  (assume a5 (forall ((X51 $$unsorted)) (tptp.p20 X51 X51)))
% 0.45/0.77  (assume a6 (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)))
% 0.45/0.77  (assume a7 (forall ((X25 $$unsorted)) (tptp.p19 X25 X25)))
% 0.45/0.77  (assume a8 (forall ((X18 $$unsorted)) (tptp.p14 X18 X18)))
% 0.45/0.77  (assume a9 (forall ((X11 $$unsorted)) (tptp.p12 X11 X11)))
% 0.45/0.77  (assume a10 (tptp.p10 tptp.c35 tptp.c34))
% 0.45/0.77  (assume a11 (tptp.p25 tptp.c33 tptp.c36))
% 0.45/0.77  (assume a12 (tptp.p25 tptp.c32 tptp.c36))
% 0.45/0.77  (assume a13 (tptp.p25 tptp.c32 tptp.c33))
% 0.45/0.77  (assume a14 (tptp.p2 tptp.c32 (tptp.f9 tptp.c31)))
% 0.45/0.77  (assume a15 (tptp.p7 (tptp.f8 tptp.c29) tptp.c30))
% 0.45/0.77  (assume a16 (tptp.p26 (tptp.f21 tptp.c28 tptp.c37) tptp.c34))
% 0.45/0.77  (assume a17 (forall ((X66 $$unsorted)) (tptp.p23 tptp.c28 (tptp.f4 (tptp.f5 X66)) (tptp.f4 X66))))
% 0.45/0.77  (assume a18 (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))))
% 0.45/0.77  (assume a19 (forall ((X58 $$unsorted) (X59 $$unsorted)) (or (tptp.p22 X58) (not (tptp.p22 X59)) (not (tptp.p19 X59 X58)))))
% 0.45/0.77  (assume a20 (forall ((X41 $$unsorted) (X42 $$unsorted)) (or (tptp.p2 (tptp.f17 X41) (tptp.f17 X42)) (not (tptp.p2 X41 X42)))))
% 0.45/0.77  (assume a21 (forall ((X94 $$unsorted) (X95 $$unsorted)) (or (tptp.p7 (tptp.f8 X94) (tptp.f8 X95)) (not (tptp.p6 X94 X95)))))
% 0.45/0.77  (assume a22 (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))))
% 0.45/0.77  (assume a23 (forall ((X49 $$unsorted) (X50 $$unsorted)) (or (tptp.p2 (tptp.f9 X49) (tptp.f9 X50)) (not (tptp.p2 X49 X50)))))
% 0.45/0.77  (assume a24 (forall ((X47 $$unsorted) (X48 $$unsorted)) (or (tptp.p2 (tptp.f5 X47) (tptp.f5 X48)) (not (tptp.p2 X47 X48)))))
% 0.45/0.77  (assume a25 (forall ((X1 $$unsorted) (X2 $$unsorted) (X0 $$unsorted)) (or (tptp.p10 X1 X2) (not (tptp.p10 X0 X1)) (not (tptp.p10 X0 X2)))))
% 0.45/0.77  (assume a26 (forall ((X92 $$unsorted) (X93 $$unsorted) (X91 $$unsorted)) (or (tptp.p7 X92 X93) (not (tptp.p7 X91 X92)) (not (tptp.p7 X91 X93)))))
% 0.45/0.77  (assume a27 (forall ((X89 $$unsorted) (X90 $$unsorted) (X88 $$unsorted)) (or (tptp.p6 X89 X90) (not (tptp.p6 X88 X89)) (not (tptp.p6 X88 X90)))))
% 0.45/0.77  (assume a28 (forall ((X84 $$unsorted) (X85 $$unsorted) (X83 $$unsorted)) (or (tptp.p3 X84 X85) (not (tptp.p3 X83 X84)) (not (tptp.p3 X83 X85)))))
% 0.45/0.77  (assume a29 (forall ((X52 $$unsorted) (X53 $$unsorted) (X51 $$unsorted)) (or (tptp.p20 X52 X53) (not (tptp.p20 X51 X52)) (not (tptp.p20 X51 X53)))))
% 0.45/0.77  (assume a30 (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))))
% 0.45/0.77  (assume a31 (forall ((X26 $$unsorted) (X27 $$unsorted) (X25 $$unsorted)) (or (tptp.p19 X26 X27) (not (tptp.p19 X25 X26)) (not (tptp.p19 X25 X27)))))
% 0.45/0.77  (assume a32 (forall ((X19 $$unsorted) (X20 $$unsorted) (X18 $$unsorted)) (or (tptp.p14 X19 X20) (not (tptp.p14 X18 X19)) (not (tptp.p14 X18 X20)))))
% 0.45/0.77  (assume a33 (forall ((X12 $$unsorted) (X13 $$unsorted) (X11 $$unsorted)) (or (tptp.p12 X12 X13) (not (tptp.p12 X11 X12)) (not (tptp.p12 X11 X13)))))
% 0.45/0.77  (assume a34 (forall ((X79 $$unsorted) (X80 $$unsorted) (X82 $$unsorted) (X81 $$unsorted)) (or (tptp.p27 X79 X80) (not (tptp.p2 X82 X80)) (not (tptp.p27 X81 X82)) (not (tptp.p2 X81 X79)))))
% 0.45/0.77  (assume a35 (forall ((X67 $$unsorted) (X68 $$unsorted) (X70 $$unsorted) (X69 $$unsorted)) (or (tptp.p24 X67 X68) (not (tptp.p14 X70 X67)) (not (tptp.p24 X70 X69)) (not (tptp.p12 X69 X68)))))
% 0.45/0.77  (assume a36 (forall ((X71 $$unsorted) (X72 $$unsorted) (X74 $$unsorted) (X73 $$unsorted)) (or (tptp.p25 X71 X72) (not (tptp.p2 X74 X72)) (not (tptp.p25 X73 X74)) (not (tptp.p2 X73 X71)))))
% 0.45/0.77  (assume a37 (forall ((X75 $$unsorted) (X76 $$unsorted) (X78 $$unsorted) (X77 $$unsorted)) (or (tptp.p26 X75 X76) (not (tptp.p20 X78 X75)) (not (tptp.p26 X78 X77)) (not (tptp.p10 X77 X76)))))
% 0.45/0.77  (assume a38 (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))
% 0.45/0.77  (assume a39 (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c36) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))
% 0.45/0.77  (assume a40 (tptp.p27 (tptp.f11 (tptp.f4 tptp.c36) tptp.c37) (tptp.f11 (tptp.f4 (tptp.f16 tptp.c36 (tptp.f9 (tptp.f17 tptp.c31)))) tptp.c37)))
% 0.45/0.77  (assume a41 (tptp.p25 (tptp.f11 (tptp.f4 tptp.c33) tptp.c35) (tptp.f11 (tptp.f4 (tptp.f16 tptp.c33 (tptp.f9 (tptp.f17 tptp.c31)))) tptp.c35)))
% 0.45/0.77  (assume a42 (not (tptp.p2 (tptp.f11 (tptp.f4 (tptp.f16 tptp.c32 (tptp.f9 (tptp.f17 tptp.c31)))) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))))
% 0.45/0.77  (assume a43 (forall ((X54 $$unsorted) (X55 $$unsorted) (X56 $$unsorted) (X57 $$unsorted)) (or (tptp.p20 (tptp.f21 X54 X55) (tptp.f21 X56 X57)) (not (tptp.p10 X55 X57)) (not (tptp.p19 X54 X56)))))
% 0.45/0.77  (assume a44 (forall ((X14 $$unsorted) (X15 $$unsorted) (X16 $$unsorted) (X17 $$unsorted)) (or (tptp.p12 (tptp.f13 X14 X15) (tptp.f13 X16 X17)) (not (tptp.p10 X14 X16)) (not (tptp.p2 X15 X17)))))
% 0.45/0.77  (assume a45 (forall ((X21 $$unsorted) (X22 $$unsorted) (X23 $$unsorted) (X24 $$unsorted)) (or (tptp.p14 (tptp.f15 X21 X22) (tptp.f15 X23 X24)) (not (tptp.p12 X22 X24)) (not (tptp.p7 X21 X23)))))
% 0.45/0.77  (assume a46 (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))))
% 0.45/0.77  (assume a47 (forall ((X37 $$unsorted) (X38 $$unsorted) (X39 $$unsorted) (X40 $$unsorted)) (or (tptp.p2 (tptp.f16 X37 X38) (tptp.f16 X39 X40)) (not (tptp.p2 X37 X39)) (not (tptp.p2 X38 X40)))))
% 0.45/0.77  (assume a48 (forall ((X43 $$unsorted) (X44 $$unsorted) (X45 $$unsorted) (X46 $$unsorted)) (or (tptp.p2 (tptp.f18 X43 X44) (tptp.f18 X45 X46)) (not (tptp.p2 X43 X45)) (not (tptp.p2 X44 X46)))))
% 0.45/0.77  (assume a49 (forall ((X35 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X35) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X35 tptp.c33)) (not (tptp.p25 tptp.c32 X35)))))
% 0.45/0.77  (assume a50 (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))))
% 0.45/0.77  (assume a51 (forall ((X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted) (X10 $$unsorted)) (or (tptp.p10 X7 X8) (tptp.p26 (tptp.f21 tptp.c28 X7) X8) (not (tptp.p24 (tptp.f15 tptp.c30 (tptp.f13 X7 X9)) (tptp.f13 X8 X10))))))
% 0.45/0.77  (assume a52 (forall ((X60 $$unsorted) (X61 $$unsorted) (X62 $$unsorted) (X65 $$unsorted) (X64 $$unsorted) (X63 $$unsorted)) (or (tptp.p23 X60 X61 X62) (not (tptp.p3 X65 X62)) (not (tptp.p3 X64 X61)) (not (tptp.p19 X63 X60)) (not (tptp.p23 X63 X64 X65)))))
% 0.45/0.77  (assume a53 (forall ((X3 $$unsorted) (X4 $$unsorted) (X5 $$unsorted) (X6 $$unsorted)) (or (tptp.p10 X3 X4) (not (tptp.p2 (tptp.f11 (tptp.f4 X5) X3) (tptp.f9 tptp.c31))) (not (tptp.p24 (tptp.f15 tptp.c30 (tptp.f13 X3 X5)) (tptp.f13 X4 X6))))))
% 0.45/0.77  (assume a54 (forall ((X7 $$unsorted) (X8 $$unsorted) (X9 $$unsorted) (X10 $$unsorted)) (or (tptp.p26 (tptp.f21 tptp.c28 X7) X8) (tptp.p25 (tptp.f11 (tptp.f4 X9) X8) (tptp.f11 (tptp.f4 X10) X8)) (not (tptp.p24 (tptp.f15 tptp.c30 (tptp.f13 X7 X9)) (tptp.f13 X8 X10))))))
% 0.45/0.77  (step t1 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t2)
% 0.45/0.77  (assume t2.a0 (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))))
% 0.45/0.77  (step t2.t1 (cl (or (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule forall_inst :args ((:= X29 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (:= X30 (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (:= X28 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))))
% 0.45/0.77  (step t2.t2 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule or :premises (t2.t1))
% 0.45/0.77  (step t2.t3 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule resolution :premises (t2.t2 t2.a0))
% 0.45/0.77  (step t2 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule subproof :discharge (t2.a0))
% 0.45/0.77  (step t3 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule resolution :premises (t1 t2))
% 0.45/0.77  (step t4 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule implies_neg2)
% 0.45/0.77  (step t5 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule resolution :premises (t3 t4))
% 0.45/0.77  (step t6 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule contraction :premises (t5))
% 0.45/0.77  (step t7 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule implies :premises (t6))
% 0.45/0.77  (step t8 (cl (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule or_pos)
% 0.45/0.77  (step t9 (cl (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule reordering :premises (t8))
% 0.45/0.77  (step t10 (cl (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31))))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t11)
% 0.45/0.77  (assume t11.a0 (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))))
% 0.45/0.77  (step t11.t1 (cl (or (not (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31))))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule forall_inst :args ((:= X96 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))
% 0.45/0.77  (step t11.t2 (cl (not (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31))))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule or :premises (t11.t1))
% 0.45/0.77  (step t11.t3 (cl (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule resolution :premises (t11.t2 t11.a0))
% 0.45/0.77  (step t11 (cl (not (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31))))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule subproof :discharge (t11.a0))
% 0.45/0.77  (step t12 (cl (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule resolution :premises (t10 t11))
% 0.45/0.77  (step t13 (cl (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) (not (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule implies_neg2)
% 0.45/0.77  (step t14 (cl (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule resolution :premises (t12 t13))
% 0.45/0.77  (step t15 (cl (=> (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31)))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31))))))) :rule contraction :premises (t14))
% 0.45/0.77  (step t16 (cl (not (forall ((X96 $$unsorted)) (not (tptp.p2 X96 (tptp.f18 X96 (tptp.f9 (tptp.f17 tptp.c31))))))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule implies :premises (t15))
% 0.45/0.77  (step t17 (cl (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))) :rule resolution :premises (t16 a18))
% 0.45/0.77  (step t18 (cl (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))) :rule or_pos)
% 0.45/0.77  (step t19 (cl (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))))) :rule reordering :premises (t18))
% 0.45/0.77  (step t20 (cl (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))) :rule or_pos)
% 0.45/0.77  (step t21 (cl (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))))) :rule reordering :premises (t20))
% 0.45/0.77  (step t22 (cl (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t23)
% 0.45/0.77  (assume t23.a0 (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))))
% 0.45/0.77  (step t23.t1 (cl (or (not (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))))) :rule forall_inst :args ((:= X36 tptp.c33)))
% 0.45/0.77  (step t23.t2 (cl (not (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule or :premises (t23.t1))
% 0.45/0.77  (step t23.t3 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule resolution :premises (t23.t2 t23.a0))
% 0.45/0.77  (step t23 (cl (not (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule subproof :discharge (t23.a0))
% 0.45/0.77  (step t24 (cl (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule resolution :premises (t22 t23))
% 0.45/0.77  (step t25 (cl (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))))) :rule implies_neg2)
% 0.45/0.77  (step t26 (cl (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))))) :rule resolution :premises (t24 t25))
% 0.45/0.77  (step t27 (cl (=> (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33))))) :rule contraction :premises (t26))
% 0.45/0.77  (step t28 (cl (not (forall ((X36 $$unsorted)) (or (tptp.p2 (tptp.f11 (tptp.f4 X36) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 X36 tptp.c36)) (not (tptp.p25 tptp.c32 X36))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule implies :premises (t27))
% 0.45/0.77  (step t29 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (not (tptp.p25 tptp.c33 tptp.c36)) (not (tptp.p25 tptp.c32 tptp.c33)))) :rule resolution :premises (t28 a50))
% 0.45/0.77  (step t30 (cl (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) :rule resolution :premises (t21 a11 a13 t29))
% 0.45/0.77  (step t31 (cl (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))) :rule or_pos)
% 0.45/0.77  (step t32 (cl (not (tptp.p10 tptp.c34 tptp.c34)) (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))))) :rule reordering :premises (t31))
% 0.45/0.77  (step t33 (cl (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34)) (forall ((X0 $$unsorted)) (tptp.p10 X0 X0))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t34)
% 0.45/0.77  (assume t34.a0 (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)))
% 0.45/0.77  (step t34.t1 (cl (or (not (forall ((X0 $$unsorted)) (tptp.p10 X0 X0))) (tptp.p10 tptp.c34 tptp.c34))) :rule forall_inst :args ((:= X0 tptp.c34)))
% 0.45/0.77  (step t34.t2 (cl (not (forall ((X0 $$unsorted)) (tptp.p10 X0 X0))) (tptp.p10 tptp.c34 tptp.c34)) :rule or :premises (t34.t1))
% 0.45/0.77  (step t34.t3 (cl (tptp.p10 tptp.c34 tptp.c34)) :rule resolution :premises (t34.t2 t34.a0))
% 0.45/0.77  (step t34 (cl (not (forall ((X0 $$unsorted)) (tptp.p10 X0 X0))) (tptp.p10 tptp.c34 tptp.c34)) :rule subproof :discharge (t34.a0))
% 0.45/0.77  (step t35 (cl (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34)) (tptp.p10 tptp.c34 tptp.c34)) :rule resolution :premises (t33 t34))
% 0.45/0.77  (step t36 (cl (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34))) :rule implies_neg2)
% 0.45/0.77  (step t37 (cl (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34)) (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34))) :rule resolution :premises (t35 t36))
% 0.45/0.77  (step t38 (cl (=> (forall ((X0 $$unsorted)) (tptp.p10 X0 X0)) (tptp.p10 tptp.c34 tptp.c34))) :rule contraction :premises (t37))
% 0.45/0.77  (step t39 (cl (not (forall ((X0 $$unsorted)) (tptp.p10 X0 X0))) (tptp.p10 tptp.c34 tptp.c34)) :rule implies :premises (t38))
% 0.45/0.77  (step t40 (cl (tptp.p10 tptp.c34 tptp.c34)) :rule resolution :premises (t39 a1))
% 0.45/0.77  (step t41 (cl (not (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))) :rule or_pos)
% 0.45/0.77  (step t42 (cl (not (tptp.p2 tptp.c33 tptp.c33)) (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))))) :rule reordering :premises (t41))
% 0.45/0.77  (step t43 (cl (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33)) (forall ((X28 $$unsorted)) (tptp.p2 X28 X28))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t44)
% 0.45/0.77  (assume t44.a0 (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)))
% 0.45/0.77  (step t44.t1 (cl (or (not (forall ((X28 $$unsorted)) (tptp.p2 X28 X28))) (tptp.p2 tptp.c33 tptp.c33))) :rule forall_inst :args ((:= X28 tptp.c33)))
% 0.45/0.77  (step t44.t2 (cl (not (forall ((X28 $$unsorted)) (tptp.p2 X28 X28))) (tptp.p2 tptp.c33 tptp.c33)) :rule or :premises (t44.t1))
% 0.45/0.77  (step t44.t3 (cl (tptp.p2 tptp.c33 tptp.c33)) :rule resolution :premises (t44.t2 t44.a0))
% 0.45/0.77  (step t44 (cl (not (forall ((X28 $$unsorted)) (tptp.p2 X28 X28))) (tptp.p2 tptp.c33 tptp.c33)) :rule subproof :discharge (t44.a0))
% 0.45/0.77  (step t45 (cl (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33)) (tptp.p2 tptp.c33 tptp.c33)) :rule resolution :premises (t43 t44))
% 0.45/0.77  (step t46 (cl (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))) :rule implies_neg2)
% 0.45/0.77  (step t47 (cl (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33)) (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33))) :rule resolution :premises (t45 t46))
% 0.45/0.77  (step t48 (cl (=> (forall ((X28 $$unsorted)) (tptp.p2 X28 X28)) (tptp.p2 tptp.c33 tptp.c33))) :rule contraction :premises (t47))
% 0.45/0.77  (step t49 (cl (not (forall ((X28 $$unsorted)) (tptp.p2 X28 X28))) (tptp.p2 tptp.c33 tptp.c33)) :rule implies :premises (t48))
% 0.45/0.77  (step t50 (cl (tptp.p2 tptp.c33 tptp.c33)) :rule resolution :premises (t49 a6))
% 0.45/0.77  (step t51 (cl (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t52)
% 0.45/0.77  (assume t52.a0 (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))))
% 0.45/0.77  (step t52.t1 (cl (or (not (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87))))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))))) :rule forall_inst :args ((:= X86 tptp.c33) (:= X87 tptp.c33)))
% 0.45/0.77  (step t52.t2 (cl (not (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87))))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule or :premises (t52.t1))
% 0.45/0.77  (step t52.t3 (cl (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule resolution :premises (t52.t2 t52.a0))
% 0.45/0.77  (step t52 (cl (not (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87))))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule subproof :discharge (t52.a0))
% 0.45/0.77  (step t53 (cl (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule resolution :premises (t51 t52))
% 0.45/0.77  (step t54 (cl (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) (not (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))))) :rule implies_neg2)
% 0.45/0.77  (step t55 (cl (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))))) :rule resolution :premises (t53 t54))
% 0.45/0.77  (step t56 (cl (=> (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87)))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33))))) :rule contraction :premises (t55))
% 0.45/0.77  (step t57 (cl (not (forall ((X86 $$unsorted) (X87 $$unsorted)) (or (tptp.p3 (tptp.f4 X86) (tptp.f4 X87)) (not (tptp.p2 X86 X87))))) (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule implies :premises (t56))
% 0.45/0.77  (step t58 (cl (or (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)) (not (tptp.p2 tptp.c33 tptp.c33)))) :rule resolution :premises (t57 a22))
% 0.45/0.77  (step t59 (cl (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))) :rule resolution :premises (t42 t50 t58))
% 0.45/0.77  (step t60 (cl (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t61)
% 0.45/0.77  (assume t61.a0 (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))))
% 0.45/0.77  (step t61.t1 (cl (or (not (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))))) :rule forall_inst :args ((:= X31 (tptp.f4 tptp.c33)) (:= X32 tptp.c34) (:= X33 (tptp.f4 tptp.c33)) (:= X34 tptp.c34)))
% 0.45/0.77  (step t61.t2 (cl (not (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule or :premises (t61.t1))
% 0.45/0.77  (step t61.t3 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule resolution :premises (t61.t2 t61.a0))
% 0.45/0.77  (step t61 (cl (not (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule subproof :discharge (t61.a0))
% 0.45/0.77  (step t62 (cl (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule resolution :premises (t60 t61))
% 0.45/0.77  (step t63 (cl (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))))) :rule implies_neg2)
% 0.45/0.77  (step t64 (cl (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))))) :rule resolution :premises (t62 t63))
% 0.45/0.77  (step t65 (cl (=> (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33)))))) :rule contraction :premises (t64))
% 0.45/0.77  (step t66 (cl (not (forall ((X31 $$unsorted) (X32 $$unsorted) (X33 $$unsorted) (X34 $$unsorted)) (or (tptp.p2 (tptp.f11 X31 X32) (tptp.f11 X33 X34)) (not (tptp.p10 X32 X34)) (not (tptp.p3 X31 X33))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule implies :premises (t65))
% 0.45/0.77  (step t67 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p10 tptp.c34 tptp.c34)) (not (tptp.p3 (tptp.f4 tptp.c33) (tptp.f4 tptp.c33))))) :rule resolution :premises (t66 a46))
% 0.45/0.77  (step t68 (cl (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) :rule resolution :premises (t32 t40 t59 t67))
% 0.45/0.77  (step t69 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) :rule implies_neg1)
% 0.45/0.77  (anchor :step t70)
% 0.45/0.77  (assume t70.a0 (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))))
% 0.45/0.77  (step t70.t1 (cl (or (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))))) :rule forall_inst :args ((:= X29 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34)) (:= X30 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (:= X28 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))
% 0.45/0.77  (step t70.t2 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule or :premises (t70.t1))
% 0.45/0.77  (step t70.t3 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule resolution :premises (t70.t2 t70.a0))
% 0.45/0.77  (step t70 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule subproof :discharge (t70.a0))
% 0.45/0.77  (step t71 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule resolution :premises (t69 t70))
% 0.45/0.77  (step t72 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))))) :rule implies_neg2)
% 0.45/0.77  (step t73 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))))) :rule resolution :premises (t71 t72))
% 0.45/0.77  (step t74 (cl (=> (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30)))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)))))) :rule contraction :premises (t73))
% 0.45/0.77  (step t75 (cl (not (forall ((X29 $$unsorted) (X30 $$unsorted) (X28 $$unsorted)) (or (tptp.p2 X29 X30) (not (tptp.p2 X28 X29)) (not (tptp.p2 X28 X30))))) (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule implies :premises (t74))
% 0.45/0.77  (step t76 (cl (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34)) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c32) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))))) :rule resolution :premises (t75 a30))
% 0.45/0.77  (step t77 (cl (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) :rule resolution :premises (t19 t30 t68 t76))
% 0.45/0.77  (step t78 (cl (not (or (tptp.p2 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f11 (tptp.f4 tptp.c33) tptp.c34))) (not (tptp.p2 (tptp.f11 (tptp.f4 tptp.c32) tptp.c34) (tptp.f18 (tptp.f11 (tptp.f4 tptp.c33) tptp.c34) (tptp.f9 (tptp.f17 tptp.c31)))))))) :rule resolution :premises (t9 a38 t17 t77))
% 0.45/0.77  (step t79 (cl) :rule resolution :premises (t7 t78 a30))
% 0.45/0.77  
% 0.45/0.78  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.UXWj3WX0qG/cvc5---1.0.5_15590.smt2
% 0.45/0.78  % cvc5---1.0.5 exiting
% 0.45/0.78  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------