%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SYN162-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n018.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:24:41 EDT 2024

% Result   : Unsatisfiable 2.07s 2.26s
% Output   : Proof 2.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.16  % Problem    : SYN162-1 : TPTP v8.2.0. Released v1.1.0.
% 0.15/0.17  % Command    : do_cvc5 %s %d
% 0.18/0.40  % Computer : n018.cluster.edu
% 0.18/0.40  % Model    : x86_64 x86_64
% 0.18/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40  % Memory   : 8042.1875MB
% 0.18/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40  % CPULimit   : 300
% 0.18/0.40  % WCLimit    : 300
% 0.18/0.40  % DateTime   : Tue May 28 13:15:09 EDT 2024
% 0.18/0.40  % CPUTime    : 
% 0.39/0.59  %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.59  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 2.07/2.26  % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.ONv1osKUK5/cvc5---1.0.5_1975.smt2
% 2.07/2.26  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.ONv1osKUK5/cvc5---1.0.5_1975.smt2
% 2.07/2.29  (assume a0 (tptp.s0 tptp.d))
% 2.07/2.29  (assume a1 (tptp.q0 tptp.e tptp.d))
% 2.07/2.29  (assume a2 (tptp.n0 tptp.d tptp.e))
% 2.07/2.29  (assume a3 (tptp.m0 tptp.e tptp.d tptp.a))
% 2.07/2.29  (assume a4 (tptp.s0 tptp.b))
% 2.07/2.29  (assume a5 (tptp.q0 tptp.b tptp.b))
% 2.07/2.29  (assume a6 (tptp.n0 tptp.d tptp.b))
% 2.07/2.29  (assume a7 (tptp.m0 tptp.e tptp.d tptp.e))
% 2.07/2.29  (assume a8 (tptp.r0 tptp.b))
% 2.07/2.29  (assume a9 (tptp.p0 tptp.b tptp.d))
% 2.07/2.29  (assume a10 (tptp.n0 tptp.e tptp.b))
% 2.07/2.29  (assume a11 (forall ((X $$unsorted)) (tptp.m0 tptp.a X tptp.a)))
% 2.07/2.29  (assume a12 (tptp.r0 tptp.e))
% 2.07/2.29  (assume a13 (forall ((X $$unsorted)) (tptp.p0 tptp.b X)))
% 2.07/2.29  (assume a14 (tptp.n0 tptp.a tptp.b))
% 2.07/2.29  (assume a15 (tptp.m0 tptp.c tptp.b tptp.a))
% 2.07/2.29  (assume a16 (forall ((X $$unsorted)) (tptp.q0 X tptp.d)))
% 2.07/2.29  (assume a17 (tptp.p0 tptp.c tptp.b))
% 2.07/2.29  (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.m0 X tptp.d Y)))
% 2.07/2.29  (assume a19 (tptp.l0 tptp.a))
% 2.07/2.29  (assume a20 (tptp.q0 tptp.b tptp.e))
% 2.07/2.29  (assume a21 (tptp.p0 tptp.b tptp.c))
% 2.07/2.29  (assume a22 (tptp.m0 tptp.a tptp.e tptp.e))
% 2.07/2.29  (assume a23 (tptp.l0 tptp.c))
% 2.07/2.29  (assume a24 (tptp.q0 tptp.d tptp.d))
% 2.07/2.29  (assume a25 (tptp.n0 tptp.d tptp.c))
% 2.07/2.29  (assume a26 (tptp.m0 tptp.e tptp.b tptp.c))
% 2.07/2.29  (assume a27 (tptp.k0 tptp.e))
% 2.07/2.29  (assume a28 (tptp.q0 tptp.d tptp.b))
% 2.07/2.29  (assume a29 (tptp.n0 tptp.e tptp.e))
% 2.07/2.29  (assume a30 (tptp.m0 tptp.b tptp.b tptp.e))
% 2.07/2.29  (assume a31 (tptp.k0 tptp.b))
% 2.07/2.29  (assume a32 (tptp.q0 tptp.d tptp.c))
% 2.07/2.29  (assume a33 (tptp.n0 tptp.c tptp.d))
% 2.07/2.29  (assume a34 (tptp.m0 tptp.d tptp.e tptp.c))
% 2.07/2.29  (assume a35 (tptp.q0 tptp.a tptp.b))
% 2.07/2.29  (assume a36 (tptp.n0 tptp.b tptp.a))
% 2.07/2.29  (assume a37 (tptp.m0 tptp.b tptp.a tptp.a))
% 2.07/2.29  (assume a38 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))))
% 2.07/2.29  (assume a39 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))))
% 2.07/2.29  (assume a40 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.l1 C D) (not (tptp.p0 E C)) (not (tptp.r0 F)) (not (tptp.m0 D C E)))))
% 2.07/2.29  (assume a41 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.l1 A A) (not (tptp.k1 A)) (not (tptp.l0 B)) (not (tptp.l1 B B)))))
% 2.07/2.29  (assume a42 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m1 B C B) (not (tptp.m0 C C B)))))
% 2.07/2.29  (assume a43 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J J) (not (tptp.m0 A A J)))))
% 2.07/2.29  (assume a44 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))))
% 2.07/2.29  (assume a45 (or (tptp.m1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 2.07/2.29  (assume a46 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.m1 D D D) (not (tptp.s0 E)) (not (tptp.r0 E)) (not (tptp.q0 F D)))))
% 2.07/2.29  (assume a47 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m1 B B tptp.c) (not (tptp.n0 C C)) (not (tptp.l1 tptp.c tptp.c)) (not (tptp.p0 C B)))))
% 2.07/2.29  (assume a48 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J A) (not (tptp.k0 J)) (not (tptp.n0 A A)))))
% 2.07/2.29  (assume a49 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 2.07/2.29  (assume a50 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H H H) (not (tptp.q0 I H)))))
% 2.07/2.29  (assume a51 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.m1 E E E) (not (tptp.m0 F G E)))))
% 2.07/2.29  (assume a52 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.m1 B C C) (not (tptp.l0 D)) (not (tptp.m0 C C B)))))
% 2.07/2.29  (assume a53 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.m1 H I I) (not (tptp.m1 J I H)) (not (tptp.m1 J A I)))))
% 2.07/2.29  (assume a54 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)) (not (tptp.q0 G tptp.d)))))
% 2.07/2.29  (assume a55 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.m1 C C C) (not (tptp.q0 D E)) (not (tptp.q0 D C)))))
% 2.07/2.29  (assume a56 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.m1 A B tptp.c) (not (tptp.r0 tptp.c)) (not (tptp.s0 tptp.d)) (not (tptp.q0 B tptp.d)) (not (tptp.p0 A B)))))
% 2.07/2.29  (assume a57 (or (tptp.m1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 2.07/2.29  (assume a58 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))))
% 2.07/2.29  (assume a59 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.s0 tptp.e))))
% 2.07/2.29  (assume a60 (or (tptp.m1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.s0 tptp.d))))
% 2.07/2.29  (assume a61 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.m1 F tptp.a G) (not (tptp.m0 tptp.a H tptp.a)) (not (tptp.q0 F G)) (not (tptp.m1 G tptp.c G)))))
% 2.07/2.29  (assume a62 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.m1 C C C) (not (tptp.m0 D E C)))))
% 2.07/2.29  (assume a63 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.m1 A A A) (not (tptp.l0 A)) (not (tptp.l0 B)) (not (tptp.p0 B tptp.d)))))
% 2.07/2.29  (assume a64 (or (tptp.m1 tptp.b tptp.b tptp.b) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.l1 tptp.a tptp.b))))
% 2.07/2.29  (assume a65 (forall ((J $$unsorted)) (or (tptp.m1 J J J) (not (tptp.l0 J)) (not (tptp.k0 J)) (not (tptp.m0 J J J)))))
% 2.07/2.29  (assume a66 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))))
% 2.07/2.29  (assume a67 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 2.07/2.29  (assume a68 (forall ((G $$unsorted)) (or (tptp.m1 tptp.c tptp.a tptp.c) (not (tptp.r0 tptp.e)) (not (tptp.m0 tptp.a tptp.e tptp.c)) (not (tptp.r0 G)) (not (tptp.k0 tptp.e)))))
% 2.07/2.29  (assume a69 (forall ((F $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)))))
% 2.07/2.29  (assume a70 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.m1 C C C) (not (tptp.q0 D D)) (not (tptp.m1 E D C)))))
% 2.07/2.29  (assume a71 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.m1 A B B) (not (tptp.k1 tptp.a)) (not (tptp.k1 B)) (not (tptp.q0 A A)))))
% 2.07/2.29  (assume a72 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.r0 I)) (not (tptp.l0 J)))))
% 2.07/2.29  (assume a73 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.n1 A A B) (not (tptp.m0 tptp.b B A)))))
% 2.07/2.29  (assume a74 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.n1 H I H) (not (tptp.p0 J H)) (not (tptp.l0 I)) (not (tptp.r0 H)))))
% 2.07/2.29  (assume a75 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.n0 G G)) (not (tptp.q0 tptp.a G)))))
% 2.07/2.29  (assume a76 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.n1 E tptp.c E) (not (tptp.m0 F E tptp.c)))))
% 2.07/2.29  (assume a77 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.n1 C tptp.e tptp.e) (not (tptp.m0 C D tptp.e)) (not (tptp.k1 C)))))
% 2.07/2.29  (assume a78 (forall ((B $$unsorted)) (or (tptp.n1 tptp.e tptp.e B) (not (tptp.s0 tptp.b)) (not (tptp.m1 tptp.b B tptp.e)))))
% 2.07/2.29  (assume a79 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.n1 H H H) (not (tptp.m0 I J I)) (not (tptp.k0 H)) (not (tptp.q0 A J)))))
% 2.07/2.29  (assume a80 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k1 G)) (not (tptp.p0 G G)))))
% 2.07/2.29  (assume a81 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n1 D E D) (not (tptp.p0 D D)) (not (tptp.p0 E F)))))
% 2.07/2.29  (assume a82 (or (tptp.n1 tptp.d tptp.d tptp.d) (not (tptp.q0 tptp.d tptp.d))))
% 2.07/2.29  (assume a83 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.n1 A A A) (not (tptp.m1 B C A)) (not (tptp.k0 B)))))
% 2.07/2.29  (assume a84 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.n1 I tptp.d J) (not (tptp.p0 J J)) (not (tptp.r0 I)) (not (tptp.l1 J tptp.d)))))
% 2.07/2.29  (assume a85 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.n1 F F F) (not (tptp.m0 G H H)) (not (tptp.m0 H F G)) (not (tptp.n1 F F F)))))
% 2.07/2.29  (assume a86 (or (tptp.n1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 2.07/2.29  (assume a87 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.n1 D E D) (not (tptp.s0 tptp.b)) (not (tptp.l0 D)) (not (tptp.p0 tptp.b E)))))
% 2.07/2.29  (assume a88 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.n1 B B B) (not (tptp.m1 tptp.c B C)) (not (tptp.m0 tptp.b C tptp.c)) (not (tptp.n1 C B C)))))
% 2.07/2.29  (assume a89 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.n1 I I I) (not (tptp.m0 J J J)) (not (tptp.k1 I)) (not (tptp.s0 I)) (not (tptp.p0 A J)))))
% 2.07/2.29  (assume a90 (forall ((H $$unsorted)) (or (tptp.n1 tptp.a H tptp.b) (not (tptp.p0 H tptp.d)) (not (tptp.p0 tptp.a tptp.b)))))
% 2.07/2.29  (assume a91 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.n1 E F F) (not (tptp.l0 G)) (not (tptp.l1 G E)) (not (tptp.n1 E F E)))))
% 2.07/2.29  (assume a92 (or (tptp.n1 tptp.d tptp.e tptp.e) (not (tptp.p0 tptp.d tptp.d)) (not (tptp.n1 tptp.e tptp.e tptp.e)) (not (tptp.r0 tptp.b))))
% 2.07/2.29  (assume a93 (or (tptp.n1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.r0 tptp.a))))
% 2.07/2.29  (assume a94 (forall ((D $$unsorted)) (or (tptp.n1 D D D) (not (tptp.r0 D)))))
% 2.07/2.29  (assume a95 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.n1 B B B) (not (tptp.l1 C B)) (not (tptp.n0 C B)))))
% 2.07/2.29  (assume a96 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.n1 H H I) (not (tptp.m0 J A A)) (not (tptp.m0 I J H)))))
% 2.07/2.29  (assume a97 (or (tptp.n1 tptp.d tptp.d tptp.b) (not (tptp.q0 tptp.b tptp.e)) (not (tptp.m1 tptp.d tptp.e tptp.e)) (not (tptp.k0 tptp.b))))
% 2.07/2.29  (assume a98 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k0 G)) (not (tptp.s0 G)))))
% 2.07/2.29  (assume a99 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n1 D D D) (not (tptp.m0 E E F)) (not (tptp.n1 E D E)))))
% 2.07/2.29  (assume a100 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))))
% 2.07/2.29  (assume a101 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.p1 A A A) (not (tptp.m0 B C tptp.b)) (not (tptp.l0 A)))))
% 2.07/2.29  (assume a102 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p1 I I I) (not (tptp.l1 J J)) (not (tptp.p0 I J)) (not (tptp.n0 J J)))))
% 2.07/2.29  (assume a103 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p1 G G G) (not (tptp.n0 H G)))))
% 2.07/2.29  (assume a104 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p1 E E E) (not (tptp.q0 F E)))))
% 2.07/2.29  (assume a105 (forall ((D $$unsorted)) (or (tptp.p1 D D D) (not (tptp.k0 D)))))
% 2.07/2.29  (assume a106 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)))))
% 2.07/2.29  (assume a107 (or (tptp.p1 tptp.c tptp.c tptp.c) (not (tptp.p0 tptp.a tptp.c))))
% 2.07/2.29  (assume a108 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p1 H I H) (not (tptp.l0 J)) (not (tptp.p1 I A H)) (not (tptp.s0 tptp.b)))))
% 2.07/2.29  (assume a109 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p1 F F F) (not (tptp.s0 G)) (not (tptp.s0 F)))))
% 2.07/2.29  (assume a110 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D D) (not (tptp.n0 tptp.e tptp.b)) (not (tptp.k0 tptp.b)) (not (tptp.k0 D)) (not (tptp.k1 E)))))
% 2.07/2.29  (assume a111 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)) (not (tptp.r0 B)))))
% 2.07/2.29  (assume a112 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.p0 tptp.b tptp.a))))
% 2.07/2.29  (assume a113 (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.s0 tptp.d))))
% 2.07/2.29  (assume a114 (or (tptp.p1 tptp.c tptp.e tptp.b) (not (tptp.m0 tptp.b tptp.c tptp.e))))
% 2.07/2.29  (assume a115 (or (tptp.p1 tptp.d tptp.d tptp.b) (not (tptp.p0 tptp.d tptp.b)) (not (tptp.m0 tptp.e tptp.a tptp.a))))
% 2.07/2.29  (assume a116 (forall ((A $$unsorted)) (or (tptp.p1 A A A) (not (tptp.k0 tptp.e)) (not (tptp.k1 A)) (not (tptp.l0 tptp.c)))))
% 2.07/2.29  (assume a117 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.p1 G G G) (not (tptp.n0 H H)) (not (tptp.l0 I)) (not (tptp.n1 H J G)))))
% 2.07/2.29  (assume a118 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p1 B B B) (not (tptp.m1 C D B)) (not (tptp.q0 D E)) (not (tptp.l0 F)))))
% 2.07/2.29  (assume a119 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p1 H I J) (not (tptp.m0 J H A)) (not (tptp.p1 J H A)))))
% 2.07/2.29  (assume a120 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p1 F tptp.b G) (not (tptp.m1 F G tptp.b)) (not (tptp.k0 G)))))
% 2.07/2.29  (assume a121 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D D) (not (tptp.m0 tptp.b E tptp.b)) (not (tptp.l1 D tptp.b)))))
% 2.07/2.29  (assume a122 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B B) (not (tptp.p0 C B)))))
% 2.07/2.29  (assume a123 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p1 I I I) (not (tptp.l0 I)) (not (tptp.m0 J A I)))))
% 2.07/2.29  (assume a124 (or (tptp.p1 tptp.a tptp.b tptp.a) (not (tptp.r0 tptp.b)) (not (tptp.p1 tptp.a tptp.a tptp.a))))
% 2.07/2.29  (assume a125 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a))))
% 2.07/2.29  (assume a126 (forall ((H $$unsorted)) (or (tptp.p1 tptp.d tptp.d H) (not (tptp.s0 H)) (not (tptp.n1 tptp.c tptp.d H)) (not (tptp.r0 tptp.d)) (not (tptp.n0 tptp.c H)))))
% 2.07/2.29  (assume a127 (or (tptp.p1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e)) (not (tptp.k0 tptp.e))))
% 2.07/2.29  (assume a128 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.p1 C C C) (not (tptp.q0 D E)) (not (tptp.k1 F)) (not (tptp.n1 D C G)))))
% 2.07/2.29  (assume a129 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.q1 J A J) (not (tptp.n0 B A)) (not (tptp.p0 C J)))))
% 2.07/2.29  (assume a130 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.q1 H H H) (not (tptp.q0 I H)))))
% 2.07/2.29  (assume a131 (or (tptp.q1 tptp.b tptp.e tptp.e) (not (tptp.s0 tptp.e)) (not (tptp.k0 tptp.b)) (not (tptp.l0 tptp.c))))
% 2.07/2.29  (assume a132 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))))
% 2.07/2.29  (assume a133 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.q1 B B B) (not (tptp.n1 C D D)) (not (tptp.p0 C E)) (not (tptp.m1 B D C)) (not (tptp.q1 E C D)))))
% 2.07/2.29  (assume a134 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.s0 A)))))
% 2.07/2.29  (assume a135 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.q1 H H H) (not (tptp.s0 H)) (not (tptp.m0 I I J)))))
% 2.07/2.29  (assume a136 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.q1 E F F) (not (tptp.k0 G)) (not (tptp.l0 E)) (not (tptp.q1 F F G)))))
% 2.07/2.29  (assume a137 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C C) (not (tptp.n0 D C)))))
% 2.07/2.29  (assume a138 (forall ((B $$unsorted)) (or (tptp.q1 B B B) (not (tptp.k1 B)) (not (tptp.q0 B tptp.b)) (not (tptp.p1 tptp.b tptp.b B)))))
% 2.07/2.29  (assume a139 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q1 J J J) (not (tptp.k0 J)) (not (tptp.l0 A)))))
% 2.07/2.29  (assume a140 (forall ((I $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 I tptp.c tptp.b)))))
% 2.07/2.29  (assume a141 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.q1 E F E) (not (tptp.l0 E)) (not (tptp.r0 G)) (not (tptp.p0 H E)) (not (tptp.q0 F F)))))
% 2.07/2.29  (assume a142 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C D) (not (tptp.s0 C)) (not (tptp.p0 D tptp.d)))))
% 2.07/2.29  (assume a143 (forall ((B $$unsorted)) (or (tptp.q1 B B B) (not (tptp.s0 B)))))
% 2.07/2.29  (assume a144 (forall ((A $$unsorted)) (or (tptp.q1 tptp.e A A) (not (tptp.m0 A tptp.d A)) (not (tptp.m0 tptp.e tptp.d A)))))
% 2.07/2.29  (assume a145 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.q1 H H H) (not (tptp.p0 I J)) (not (tptp.p1 H tptp.b tptp.b)) (not (tptp.q0 tptp.b tptp.b)))))
% 2.07/2.29  (assume a146 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.q1 E E F) (not (tptp.p0 G G)) (not (tptp.q0 F E)) (not (tptp.k1 E)))))
% 2.07/2.29  (assume a147 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.q1 B B B) (not (tptp.m0 C D B)))))
% 2.07/2.29  (assume a148 (or (tptp.q1 tptp.d tptp.d tptp.c) (not (tptp.m0 tptp.c tptp.b tptp.a)) (not (tptp.m1 tptp.c tptp.d tptp.a))))
% 2.07/2.29  (assume a149 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.k1 A)) (not (tptp.s0 tptp.b)))))
% 2.07/2.29  (assume a150 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.q1 H H I) (not (tptp.r0 J)) (not (tptp.m1 H I I)))))
% 2.07/2.29  (assume a151 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 F F G)) (not (tptp.k0 G)))))
% 2.07/2.29  (assume a152 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 2.07/2.29  (assume a153 (forall ((E $$unsorted)) (or (tptp.q1 E E E) (not (tptp.r0 E)))))
% 2.07/2.29  (assume a154 (or (tptp.q1 tptp.d tptp.d tptp.d) (not (tptp.k0 tptp.e)) (not (tptp.s0 tptp.d))))
% 2.07/2.29  (assume a155 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C C) (not (tptp.p0 tptp.b tptp.d)) (not (tptp.s0 tptp.b)) (not (tptp.n1 D tptp.d C)))))
% 2.07/2.29  (assume a156 (forall ((B $$unsorted)) (or (tptp.q1 B tptp.b tptp.b) (not (tptp.s0 B)) (not (tptp.s0 tptp.b)))))
% 2.07/2.29  (assume a157 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.r0 tptp.b))))
% 2.07/2.29  (assume a158 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 J A I)))))
% 2.07/2.29  (assume a159 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q1 G G G) (not (tptp.m0 G H G)))))
% 2.07/2.29  (assume a160 (forall ((F $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 tptp.c F F)) (not (tptp.r0 F)))))
% 2.07/2.29  (assume a161 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.s0 tptp.d)) (not (tptp.q1 tptp.d E tptp.d)))))
% 2.07/2.29  (assume a162 (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))))
% 2.07/2.29  (assume a163 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.s1 F) (not (tptp.q0 F G)) (not (tptp.s1 H)))))
% 2.07/2.29  (assume a164 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.k2 C D) (not (tptp.m1 E D C)) (not (tptp.k1 F)) (not (tptp.k2 F D)))))
% 2.07/2.29  (assume a165 (forall ((B $$unsorted)) (or (tptp.k2 B B) (not (tptp.n1 tptp.e tptp.d B)) (not (tptp.m1 B tptp.e B)) (not (tptp.q1 B B tptp.d)))))
% 2.07/2.29  (assume a166 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))))
% 2.07/2.29  (assume a167 (or (tptp.k2 tptp.e tptp.e) (not (tptp.l1 tptp.e tptp.e))))
% 2.07/2.29  (assume a168 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.l2 D E) (not (tptp.s1 D)) (not (tptp.n0 tptp.e E)) (not (tptp.l2 E E)))))
% 2.07/2.29  (assume a169 (or (tptp.l2 tptp.c tptp.c) (not (tptp.l2 tptp.c tptp.c)) (not (tptp.l1 tptp.e tptp.e))))
% 2.07/2.29  (assume a170 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.l2 J J) (not (tptp.p0 A A)) (not (tptp.s1 B)) (not (tptp.m0 C B J)))))
% 2.07/2.29  (assume a171 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.l2 G G) (not (tptp.m0 H G I)) (not (tptp.m1 I H H)) (not (tptp.p0 H G)))))
% 2.07/2.29  (assume a172 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.m2 F) (not (tptp.s0 F)) (not (tptp.l1 G H)))))
% 2.07/2.29  (assume a173 (or (tptp.m2 tptp.b) (not (tptp.k1 tptp.b))))
% 2.07/2.29  (assume a174 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.n2 A) (not (tptp.p1 B C A)))))
% 2.07/2.29  (assume a175 (or (tptp.n2 tptp.a) (not (tptp.m1 tptp.b tptp.a tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.n1 tptp.e tptp.a tptp.e)) (not (tptp.q1 tptp.c tptp.a tptp.d))))
% 2.07/2.29  (assume a176 (or (tptp.n2 tptp.c) (not (tptp.l1 tptp.e tptp.c)) (not (tptp.k0 tptp.b))))
% 2.07/2.29  (assume a177 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.n2 tptp.e) (not (tptp.r1 tptp.b)) (not (tptp.r0 tptp.e)) (not (tptp.p1 tptp.b I J)))))
% 2.07/2.29  (assume a178 (forall ((B $$unsorted)) (or (tptp.p2 B tptp.a B) (not (tptp.q1 B tptp.a B)))))
% 2.07/2.29  (assume a179 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.p2 J J J) (not (tptp.k1 A)) (not (tptp.k0 A)) (not (tptp.l2 tptp.a A)) (not (tptp.k2 J tptp.a)))))
% 2.07/2.29  (assume a180 (or (tptp.p2 tptp.c tptp.e tptp.e) (not (tptp.l1 tptp.c tptp.b)) (not (tptp.q1 tptp.e tptp.e tptp.e))))
% 2.07/2.29  (assume a181 (forall ((I $$unsorted)) (or (tptp.p2 tptp.b tptp.c tptp.a) (not (tptp.r0 tptp.e)) (not (tptp.n1 tptp.c I I)) (not (tptp.p0 tptp.b I)) (not (tptp.k2 tptp.c tptp.a)))))
% 2.07/2.29  (assume a182 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p2 tptp.e G H) (not (tptp.r0 tptp.e)) (not (tptp.p1 G H tptp.e)))))
% 2.07/2.29  (assume a183 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))))
% 2.07/2.29  (assume a184 (or (tptp.p2 tptp.e tptp.c tptp.c) (not (tptp.r1 tptp.d)) (not (tptp.l1 tptp.e tptp.c))))
% 2.07/2.29  (assume a185 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.p2 J J J) (not (tptp.m1 A B J)) (not (tptp.p2 A J A)))))
% 2.07/2.29  (assume a186 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.p2 H H tptp.d) (not (tptp.r1 tptp.a)) (not (tptp.m0 I H tptp.d)))))
% 2.07/2.29  (assume a187 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))))
% 2.07/2.29  (assume a188 (or (tptp.p2 tptp.d tptp.d tptp.d) (not (tptp.k1 tptp.d)) (not (tptp.s0 tptp.d))))
% 2.07/2.29  (assume a189 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.p2 C D D) (not (tptp.n1 E D E)) (not (tptp.p0 C D)) (not (tptp.p2 C D C)))))
% 2.07/2.29  (assume a190 (forall ((B $$unsorted)) (or (tptp.p2 B B B) (not (tptp.n1 tptp.d tptp.d B)))))
% 2.07/2.29  (assume a191 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.q1 A A A)))))
% 2.07/2.29  (assume a192 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.p2 H I I) (not (tptp.k1 J)) (not (tptp.p2 tptp.e H I)))))
% 2.07/2.29  (assume a193 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F tptp.e G) (not (tptp.n1 tptp.e F tptp.a)) (not (tptp.q1 tptp.a G F)))))
% 2.07/2.29  (assume a194 (forall ((E $$unsorted)) (or (tptp.p2 E E E) (not (tptp.l1 E tptp.d)))))
% 2.07/2.29  (assume a195 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.p2 B B C) (not (tptp.q1 tptp.c B D)) (not (tptp.s1 tptp.c)) (not (tptp.s0 tptp.e)) (not (tptp.p2 B D B)))))
% 2.07/2.29  (assume a196 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.k1 A)))))
% 2.07/2.29  (assume a197 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.p2 H H H) (not (tptp.m1 tptp.a tptp.a I)) (not (tptp.p2 tptp.a J H)))))
% 2.07/2.29  (assume a198 (or (tptp.p2 tptp.d tptp.b tptp.b) (not (tptp.p1 tptp.d tptp.b tptp.e))))
% 2.07/2.29  (assume a199 (forall ((G $$unsorted)) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 G tptp.b tptp.b)) (not (tptp.n1 tptp.e tptp.e G)) (not (tptp.q1 tptp.e tptp.c G)))))
% 2.07/2.29  (assume a200 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p2 E E E) (not (tptp.q1 F tptp.c F)) (not (tptp.k2 E tptp.c)))))
% 2.07/2.29  (assume a201 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.p2 B B B) (not (tptp.p0 B B)) (not (tptp.r1 C)) (not (tptp.p2 D C B)))))
% 2.07/2.29  (assume a202 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p2 I I I) (not (tptp.q1 J A J)) (not (tptp.p2 J J A)))))
% 2.07/2.29  (assume a203 (forall ((H $$unsorted)) (or (tptp.p2 tptp.a H tptp.d) (not (tptp.n0 H tptp.d)) (not (tptp.m1 tptp.a H tptp.d)))))
% 2.07/2.29  (assume a204 (forall ((G $$unsorted)) (or (tptp.p2 G G G) (not (tptp.s1 G)) (not (tptp.k1 G)))))
% 2.07/2.29  (assume a205 (or (tptp.p2 tptp.a tptp.c tptp.b) (not (tptp.l1 tptp.e tptp.c)) (not (tptp.l2 tptp.e tptp.b)) (not (tptp.r1 tptp.e)) (not (tptp.m1 tptp.d tptp.a tptp.c))))
% 2.07/2.29  (assume a206 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 D D D) (not (tptp.q1 E E E)) (not (tptp.p1 D F D)))))
% 2.07/2.29  (assume a207 (forall ((C $$unsorted)) (or (tptp.p2 C tptp.e C) (not (tptp.n1 C tptp.e tptp.e)))))
% 2.07/2.29  (assume a208 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.p2 A A A) (not (tptp.n1 B B B)) (not (tptp.p0 A A)))))
% 2.07/2.29  (assume a209 (or (tptp.p2 tptp.a tptp.a tptp.a) (not (tptp.p1 tptp.e tptp.e tptp.a))))
% 2.07/2.29  (assume a210 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p2 I I I) (not (tptp.r1 J)) (not (tptp.r0 I)))))
% 2.07/2.29  (assume a211 (forall ((H $$unsorted)) (or (tptp.p2 H H H) (not (tptp.n2 H)) (not (tptp.k1 tptp.e)))))
% 2.07/2.29  (assume a212 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.l1 G F)))))
% 2.07/2.29  (assume a213 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))))
% 2.07/2.29  (assume a214 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))))
% 2.07/2.29  (assume a215 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.q2 B B B) (not (tptp.q0 C B)) (not (tptp.n1 C B D)))))
% 2.07/2.29  (assume a216 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q2 J J J) (not (tptp.k1 A)) (not (tptp.n1 J J A)))))
% 2.07/2.29  (assume a217 (or (tptp.q2 tptp.d tptp.a tptp.a) (not (tptp.q2 tptp.d tptp.c tptp.a)) (not (tptp.s1 tptp.c)) (not (tptp.q0 tptp.e tptp.c))))
% 2.07/2.29  (assume a218 (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))))
% 2.07/2.29  (assume a219 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.q2 F G F) (not (tptp.p1 F F H)) (not (tptp.n1 G F H)) (not (tptp.q2 G H F)))))
% 2.07/2.29  (assume a220 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.q2 D tptp.c E) (not (tptp.k1 E)) (not (tptp.l0 tptp.c)) (not (tptp.l2 E D)))))
% 2.07/2.29  (assume a221 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.q2 B B B) (not (tptp.q1 C tptp.c B)))))
% 2.07/2.29  (assume a222 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q2 I I I) (not (tptp.n1 J tptp.d A)) (not (tptp.k1 I)) (not (tptp.q2 A A J)))))
% 2.07/2.29  (assume a223 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q2 G G H) (not (tptp.l1 H G)))))
% 2.07/2.29  (assume a224 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.q2 C D C) (not (tptp.r1 D)) (not (tptp.m0 E F C)) (not (tptp.k0 D)) (not (tptp.q2 D D D)))))
% 2.07/2.29  (assume a225 (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))))
% 2.07/2.29  (assume a226 (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b)))))
% 2.07/2.29  (assume a227 (or (tptp.s2 tptp.d) (not (tptp.s1 tptp.a)) (not (tptp.s0 tptp.d))))
% 2.07/2.29  (assume a228 (or (tptp.s2 tptp.d) (not (tptp.r1 tptp.d)) (not (tptp.s1 tptp.d))))
% 2.07/2.29  (assume a229 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.k3 J A J) (not (tptp.s1 A)) (not (tptp.p2 B A C)) (not (tptp.n0 J C)))))
% 2.07/2.29  (assume a230 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.k3 H H H) (not (tptp.s1 H)) (not (tptp.q2 tptp.d I tptp.d)) (not (tptp.s2 I)))))
% 2.07/2.29  (assume a231 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.k3 F F G) (not (tptp.k2 G F)))))
% 2.07/2.29  (assume a232 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.s2 tptp.e)) (not (tptp.k2 tptp.c tptp.e))))
% 2.07/2.29  (assume a233 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.k3 C C C) (not (tptp.p2 D E D)) (not (tptp.m1 C C E)))))
% 2.07/2.29  (assume a234 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.k3 A A A) (not (tptp.l2 B tptp.b)) (not (tptp.k1 A)))))
% 2.07/2.29  (assume a235 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.k0 tptp.a)) (not (tptp.r2 tptp.c))))
% 2.07/2.29  (assume a236 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k3 I J J) (not (tptp.l1 J I)) (not (tptp.k3 I J J)))))
% 2.07/2.29  (assume a237 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.k3 F F F) (not (tptp.p2 G H tptp.e)) (not (tptp.s1 G)) (not (tptp.k3 F G G)))))
% 2.07/2.29  (assume a238 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.k3 B B C) (not (tptp.p1 C D B)) (not (tptp.m2 E)) (not (tptp.m2 D)))))
% 2.07/2.29  (assume a239 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.k3 G G H) (not (tptp.q0 I H)) (not (tptp.k2 G J)) (not (tptp.k3 H A J)))))
% 2.07/2.29  (assume a240 (or (tptp.k3 tptp.d tptp.d tptp.d) (not (tptp.p1 tptp.a tptp.d tptp.b)) (not (tptp.r2 tptp.a)) (not (tptp.l2 tptp.e tptp.b))))
% 2.07/2.29  (assume a241 (or (tptp.k3 tptp.a tptp.a tptp.a) (not (tptp.r2 tptp.a))))
% 2.07/2.29  (assume a242 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.k3 E E E) (not (tptp.p2 F E E)))))
% 2.07/2.29  (assume a243 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.k3 C D C) (not (tptp.p2 D C C)))))
% 2.07/2.29  (assume a244 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.k3 J J J) (not (tptp.p0 A J)) (not (tptp.k3 J J J)) (not (tptp.k3 A J B)))))
% 2.07/2.29  (assume a245 (forall ((I $$unsorted)) (or (tptp.k3 I I I) (not (tptp.r2 tptp.c)) (not (tptp.l1 tptp.b I)))))
% 2.07/2.29  (assume a246 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.k3 E E E) (not (tptp.m2 F)) (not (tptp.l1 G H)) (not (tptp.s2 E)) (not (tptp.k3 G H G)))))
% 2.07/2.29  (assume a247 (forall ((D $$unsorted)) (or (tptp.k3 D D D) (not (tptp.n2 D)))))
% 2.07/2.29  (assume a248 (forall ((C $$unsorted)) (or (tptp.k3 C C C) (not (tptp.l0 C)) (not (tptp.r2 tptp.e)) (not (tptp.r0 tptp.e)))))
% 2.07/2.29  (assume a249 (forall ((B $$unsorted)) (or (tptp.k3 B B B) (not (tptp.m2 B)))))
% 2.07/2.29  (assume a250 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.k3 I I I) (not (tptp.r1 I)) (not (tptp.p2 J A A)))))
% 2.07/2.29  (assume a251 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.r2 tptp.c))))
% 2.07/2.29  (assume a252 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G H) (not (tptp.r0 G)) (not (tptp.p2 G H G)))))
% 2.07/2.29  (assume a253 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.l3 D D) (not (tptp.p1 D D E)) (not (tptp.p2 E F D)))))
% 2.07/2.29  (assume a254 (forall ((C $$unsorted)) (or (tptp.l3 C C) (not (tptp.n2 C)) (not (tptp.m2 tptp.b)))))
% 2.07/2.29  (assume a255 (forall ((B $$unsorted)) (or (tptp.l3 B B) (not (tptp.r2 B)))))
% 2.07/2.29  (assume a256 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.l3 I I) (not (tptp.n2 J)) (not (tptp.l1 A I)) (not (tptp.l3 A A)))))
% 2.07/2.29  (assume a257 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G G) (not (tptp.s2 H)) (not (tptp.l1 G G)))))
% 2.07/2.29  (assume a258 (or (tptp.l3 tptp.d tptp.d) (not (tptp.k2 tptp.a tptp.d))))
% 2.07/2.29  (assume a259 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.l3 D D) (not (tptp.k3 E D D)) (not (tptp.l2 F F)))))
% 2.07/2.29  (assume a260 (or (tptp.l3 tptp.c tptp.c) (not (tptp.k2 tptp.b tptp.c))))
% 2.07/2.29  (assume a261 (or (tptp.l3 tptp.d tptp.c) (not (tptp.s2 tptp.d)) (not (tptp.k3 tptp.a tptp.c tptp.a)) (not (tptp.r0 tptp.b))))
% 2.07/2.29  (assume a262 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.m3 J A J) (not (tptp.m0 B B A)) (not (tptp.l2 C J)) (not (tptp.m0 J C C)) (not (tptp.s2 B)))))
% 2.07/2.29  (assume a263 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m3 G G G) (not (tptp.k2 H I)) (not (tptp.m3 G I G)) (not (tptp.n0 I tptp.a)) (not (tptp.l2 tptp.a tptp.a)))))
% 2.07/2.29  (assume a264 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.m3 C C C) (not (tptp.q0 D E)) (not (tptp.s0 F)) (not (tptp.s2 E)) (not (tptp.r2 C)))))
% 2.07/2.29  (assume a265 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.m3 J A A) (not (tptp.n2 J)) (not (tptp.m2 A)) (not (tptp.m3 B J B)))))
% 2.07/2.29  (assume a266 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.q2 tptp.a tptp.b tptp.a))))
% 2.07/2.29  (assume a267 (or (tptp.m3 tptp.c tptp.b tptp.d) (not (tptp.l1 tptp.d tptp.b)) (not (tptp.m2 tptp.d)) (not (tptp.q2 tptp.b tptp.c tptp.d))))
% 2.07/2.29  (assume a268 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m3 H I H) (not (tptp.r2 H)) (not (tptp.k2 tptp.c I)))))
% 2.07/2.29  (assume a269 (forall ((G $$unsorted)) (or (tptp.m3 G G G) (not (tptp.l2 G G)) (not (tptp.n2 G)))))
% 2.07/2.29  (assume a270 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.m3 E E E) (not (tptp.n2 E)) (not (tptp.m2 F)))))
% 2.07/2.29  (assume a271 (forall ((D $$unsorted)) (or (tptp.m3 D tptp.e tptp.e) (not (tptp.n2 tptp.e)) (not (tptp.p2 D tptp.e tptp.e)))))
% 2.07/2.29  (assume a272 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m3 B B C) (not (tptp.r2 C)) (not (tptp.k3 B C B)))))
% 2.07/2.29  (assume a273 (forall ((A $$unsorted)) (or (tptp.m3 A A A) (not (tptp.n2 A)))))
% 2.07/2.29  (assume a274 (forall ((J $$unsorted)) (or (tptp.m3 J tptp.c J) (not (tptp.s2 tptp.c)) (not (tptp.q2 J tptp.c tptp.c)))))
% 2.07/2.29  (assume a275 (forall ((I $$unsorted)) (or (tptp.m3 I I I) (not (tptp.p2 I I I)))))
% 2.07/2.29  (assume a276 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.l2 tptp.a tptp.b))))
% 2.07/2.29  (assume a277 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))))
% 2.07/2.29  (assume a278 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p3 C D E) (not (tptp.q2 F tptp.d C)) (not (tptp.k2 D E)))))
% 2.07/2.29  (assume a279 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.p3 J A B) (not (tptp.r2 A)) (not (tptp.k3 A B J)))))
% 2.07/2.29  (assume a280 (forall ((I $$unsorted)) (or (tptp.p3 I tptp.d tptp.e) (not (tptp.l3 tptp.b tptp.e)) (not (tptp.p2 tptp.d tptp.b tptp.c)) (not (tptp.n3 I)) (not (tptp.q2 I tptp.d I)))))
% 2.07/2.29  (assume a281 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.n2 H)))))
% 2.07/2.29  (assume a282 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.p3 E E E) (not (tptp.l1 F F)) (not (tptp.l3 F E)) (not (tptp.p3 G G F)))))
% 2.07/2.29  (assume a283 (forall ((D $$unsorted)) (or (tptp.p3 D D D) (not (tptp.l2 D D)))))
% 2.07/2.29  (assume a284 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.p3 A A A) (not (tptp.n2 A)) (not (tptp.q2 B C A)) (not (tptp.s1 B)))))
% 2.07/2.29  (assume a285 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p3 I I I) (not (tptp.p2 J I I)) (not (tptp.n3 I)))))
% 2.07/2.29  (assume a286 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.k1 H)) (not (tptp.n2 H)))))
% 2.07/2.29  (assume a287 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.p3 E E E) (not (tptp.k1 E)) (not (tptp.q2 F G E)))))
% 2.07/2.29  (assume a288 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.p3 A B B) (not (tptp.m3 B C D)) (not (tptp.p2 A B D)))))
% 2.07/2.29  (assume a289 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.p3 H H H) (not (tptp.q0 I H)) (not (tptp.k2 J J)))))
% 2.07/2.29  (assume a290 (or (tptp.p3 tptp.b tptp.c tptp.b) (not (tptp.k2 tptp.c tptp.b))))
% 2.07/2.29  (assume a291 (forall ((G $$unsorted)) (or (tptp.p3 tptp.e tptp.b tptp.e) (not (tptp.m3 tptp.e G tptp.e)) (not (tptp.q2 G G tptp.b)))))
% 2.07/2.29  (assume a292 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))))
% 2.07/2.29  (assume a293 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q3 E E) (not (tptp.p2 F E E)) (not (tptp.q3 F E)))))
% 2.07/2.29  (assume a294 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.q3 B C) (not (tptp.n1 D B C)) (not (tptp.s2 B)) (not (tptp.q3 C B)))))
% 2.07/2.29  (assume a295 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q3 I I) (not (tptp.r2 I)) (not (tptp.s1 J)) (not (tptp.l2 A A)))))
% 2.07/2.29  (assume a296 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q3 G G) (not (tptp.m0 H tptp.d H)) (not (tptp.k1 G)) (not (tptp.r2 tptp.d)) (not (tptp.q3 H G)))))
% 2.07/2.29  (assume a297 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.r3 G H H) (not (tptp.s2 H)) (not (tptp.l2 tptp.c G)))))
% 2.07/2.29  (assume a298 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.r3 D D D) (not (tptp.l1 E F)) (not (tptp.n1 F F F)) (not (tptp.r2 D)))))
% 2.07/2.29  (assume a299 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.r3 A A A) (not (tptp.p1 B C A)) (not (tptp.l2 C B)) (not (tptp.r3 A B A)))))
% 2.07/2.29  (assume a300 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.r3 I I I) (not (tptp.m0 tptp.d J I)) (not (tptp.r3 I I J)))))
% 2.07/2.29  (assume a301 (forall ((H $$unsorted)) (or (tptp.r3 H H H) (not (tptp.s2 H)))))
% 2.07/2.29  (assume a302 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.r3 F F F) (not (tptp.l2 G F)))))
% 2.07/2.29  (assume a303 (forall ((E $$unsorted)) (or (tptp.r3 E E E) (not (tptp.r2 E)))))
% 2.07/2.29  (assume a304 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))))
% 2.07/2.29  (assume a305 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.r3 H H I) (not (tptp.m2 I)) (not (tptp.m3 J tptp.b H)) (not (tptp.r3 I A A)))))
% 2.07/2.29  (assume a306 (forall ((G $$unsorted)) (or (tptp.r3 tptp.a tptp.a tptp.e) (not (tptp.k2 tptp.a tptp.a)) (not (tptp.q2 G tptp.e G)) (not (tptp.m2 tptp.b)) (not (tptp.m3 tptp.a G G)))))
% 2.07/2.29  (assume a307 (forall ((F $$unsorted)) (or (tptp.r3 F tptp.b F) (not (tptp.r0 F)) (not (tptp.p2 tptp.b F tptp.b)) (not (tptp.l2 F F)))))
% 2.07/2.29  (assume a308 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.r3 C C C) (not (tptp.p3 D C E)) (not (tptp.r3 D D D)))))
% 2.07/2.29  (assume a309 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.r3 J A B) (not (tptp.k2 A B)) (not (tptp.r2 B)) (not (tptp.r3 B J J)))))
% 2.07/2.29  (assume a310 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.s3 I J) (not (tptp.q2 A I A)) (not (tptp.s2 I)) (not (tptp.m0 A B J)))))
% 2.07/2.29  (assume a311 (or (tptp.k4 tptp.c) (not (tptp.n0 tptp.c tptp.d)) (not (tptp.q3 tptp.e tptp.b)) (not (tptp.n3 tptp.e))))
% 2.07/2.29  (assume a312 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.k4 E) (not (tptp.k3 F F F)) (not (tptp.n0 G F)) (not (tptp.k4 E)))))
% 2.07/2.29  (assume a313 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.k4 tptp.e) (not (tptp.q3 C C)) (not (tptp.q1 tptp.a tptp.a D)) (not (tptp.r3 C tptp.e D)))))
% 2.07/2.29  (assume a314 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.l4 J) (not (tptp.p3 A B J)))))
% 2.07/2.29  (assume a315 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l4 H) (not (tptp.m0 I H H)) (not (tptp.l4 I)))))
% 2.07/2.29  (assume a316 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.m4 E F) (not (tptp.l2 G F)) (not (tptp.s3 tptp.a E)))))
% 2.07/2.29  (assume a317 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.m4 C C) (not (tptp.p3 D D D)) (not (tptp.m3 C C D)) (not (tptp.m4 C C)))))
% 2.07/2.29  (assume a318 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n4 J A) (not (tptp.p3 J A A)) (not (tptp.n4 J J)))))
% 2.07/2.29  (assume a319 (or (tptp.n4 tptp.d tptp.d) (not (tptp.k3 tptp.c tptp.c tptp.e)) (not (tptp.q1 tptp.d tptp.d tptp.d))))
% 2.07/2.29  (assume a320 (or (tptp.n4 tptp.e tptp.e) (not (tptp.l3 tptp.b tptp.a)) (not (tptp.p3 tptp.b tptp.e tptp.a))))
% 2.07/2.29  (assume a321 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n4 H H) (not (tptp.k4 I)) (not (tptp.m3 H H H)))))
% 2.07/2.29  (assume a322 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p4 G G H) (not (tptp.r0 G)) (not (tptp.r3 H G H)))))
% 2.07/2.29  (assume a323 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p4 D D D) (not (tptp.q3 E F)) (not (tptp.n3 D)))))
% 2.07/2.29  (assume a324 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p4 B C B) (not (tptp.k3 B B C)))))
% 2.07/2.29  (assume a325 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p4 H I I) (not (tptp.r3 I I H)) (not (tptp.p4 J J A)))))
% 2.07/2.29  (assume a326 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.p4 D D D) (not (tptp.l4 D)) (not (tptp.n0 D E)) (not (tptp.p4 F G F)))))
% 2.07/2.29  (assume a327 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.p4 A A A) (not (tptp.m3 B C A)) (not (tptp.p4 A C A)))))
% 2.07/2.29  (assume a328 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p4 I I I) (not (tptp.p3 J J I)))))
% 2.07/2.29  (assume a329 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.p4 F F F) (not (tptp.k3 G H H)) (not (tptp.n4 F H)) (not (tptp.p1 H G F)))))
% 2.07/2.29  (assume a330 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.p4 C C C) (not (tptp.q3 D E)) (not (tptp.n4 E C)) (not (tptp.l3 D D)))))
% 2.07/2.29  (assume a331 (forall ((B $$unsorted)) (or (tptp.p4 tptp.c tptp.c B) (not (tptp.n3 tptp.a)) (not (tptp.m3 B tptp.c tptp.a)))))
% 2.07/2.29  (assume a332 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.q4 B C) (not (tptp.k3 D D B)) (not (tptp.q2 E C B)) (not (tptp.m3 E F E)))))
% 2.07/2.29  (assume a333 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q4 I I) (not (tptp.r1 I)) (not (tptp.l4 J)) (not (tptp.q4 J A)))))
% 2.07/2.29  (assume a334 (or (tptp.q4 tptp.b tptp.b) (not (tptp.k3 tptp.c tptp.e tptp.b)) (not (tptp.l1 tptp.b tptp.c))))
% 2.07/2.29  (assume a335 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.q3 H I)) (not (tptp.p0 J G)))))
% 2.07/2.29  (assume a336 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.s4 A) (not (tptp.p3 B C D)) (not (tptp.l1 A C)))))
% 2.07/2.29  (assume a337 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.k5 E) (not (tptp.s4 F)) (not (tptp.r3 G E E)))))
% 2.07/2.29  (assume a338 (or (tptp.k5 tptp.b) (not (tptp.s4 tptp.e)) (not (tptp.n1 tptp.b tptp.b tptp.b))))
% 2.07/2.29  (assume a339 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l5 H) (not (tptp.q4 I I)) (not (tptp.k1 H)))))
% 2.07/2.29  (assume a340 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.m5 D E) (not (tptp.r0 D)) (not (tptp.p4 D F E)))))
% 2.07/2.29  (assume a341 (forall ((C $$unsorted)) (or (tptp.m5 C C) (not (tptp.k4 C)))))
% 2.07/2.29  (assume a342 (forall ((B $$unsorted)) (or (tptp.m5 B B) (not (tptp.s4 B)) (not (tptp.m4 tptp.e tptp.e)))))
% 2.07/2.29  (assume a343 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m5 J J) (not (tptp.s4 A)) (not (tptp.r0 J)))))
% 2.07/2.29  (assume a344 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n5 B C) (not (tptp.q4 D E)) (not (tptp.n4 B E)) (not (tptp.p4 F F C)) (not (tptp.n5 F C)))))
% 2.07/2.29  (assume a345 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n5 J J) (not (tptp.m0 A J A)) (not (tptp.n5 A J)))))
% 2.07/2.29  (assume a346 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n5 H H) (not (tptp.n4 I H)))))
% 2.07/2.29  (assume a347 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.n5 E E) (not (tptp.p0 E F)) (not (tptp.m4 G G)) (not (tptp.k5 tptp.d)))))
% 2.07/2.29  (assume a348 (or (tptp.n5 tptp.d tptp.d) (not (tptp.p4 tptp.c tptp.d tptp.c))))
% 2.07/2.29  (assume a349 (or (tptp.n5 tptp.b tptp.e) (not (tptp.r3 tptp.d tptp.b tptp.c)) (not (tptp.n4 tptp.b tptp.e))))
% 2.07/2.29  (assume a350 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.n5 C C) (not (tptp.q4 D C)))))
% 2.07/2.29  (assume a351 (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))))
% 2.07/2.29  (assume a352 (forall ((A $$unsorted)) (or (tptp.n5 A A) (not (tptp.s1 A)) (not (tptp.k4 A)))))
% 2.07/2.29  (assume a353 (forall ((H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.n5 H H) (not (tptp.p4 I H H)) (not (tptp.s1 H)) (not (tptp.p4 tptp.b tptp.b J)))))
% 2.07/2.29  (assume a354 (forall ((G $$unsorted)) (or (tptp.n5 tptp.d G) (not (tptp.k3 tptp.d G tptp.a)) (not (tptp.n4 G tptp.d)))))
% 2.07/2.29  (assume a355 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p5 E E F) (not (tptp.s4 F)) (not (tptp.l2 E E)))))
% 2.07/2.29  (assume a356 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.p5 B C C) (not (tptp.l2 B D)) (not (tptp.p5 B D B)) (not (tptp.m4 D C)))))
% 2.07/2.29  (assume a357 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p5 I J I) (not (tptp.q4 J A)) (not (tptp.s1 I)))))
% 2.07/2.29  (assume a358 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p5 tptp.b tptp.b tptp.b) (not (tptp.p4 G G H)) (not (tptp.k5 tptp.b)))))
% 2.07/2.29  (assume a359 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q5 J A) (not (tptp.s4 J)) (not (tptp.m2 A)))))
% 2.07/2.29  (assume a360 (or (tptp.q5 tptp.a tptp.a) (not (tptp.r4 tptp.a))))
% 2.07/2.29  (assume a361 (forall ((I $$unsorted)) (or (tptp.q5 I I) (not (tptp.l4 I)))))
% 2.07/2.29  (assume a362 (forall ((H $$unsorted)) (or (tptp.q5 H H) (not (tptp.q4 H H)))))
% 2.07/2.29  (assume a363 (forall ((G $$unsorted)) (or (tptp.q5 G G) (not (tptp.m4 G G)))))
% 2.07/2.29  (assume a364 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.r5 C D) (not (tptp.s4 C)) (not (tptp.k0 tptp.b)) (not (tptp.n3 D)))))
% 2.07/2.29  (assume a365 (forall ((B $$unsorted)) (or (tptp.r5 B B) (not (tptp.k4 B)))))
% 2.07/2.29  (assume a366 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.s5 H) (not (tptp.l4 H)) (not (tptp.r4 I)))))
% 2.07/2.29  (assume a367 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.s5 E) (not (tptp.k4 E)) (not (tptp.s3 E F)) (not (tptp.l5 G)) (not (tptp.s5 G)))))
% 2.07/2.29  (assume a368 (not (tptp.n5 tptp.c tptp.c)))
% 2.07/2.29  (step t1 (cl (not (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))) :rule or_pos)
% 2.07/2.29  (step t2 (cl (not (tptp.p0 tptp.b tptp.c)) (not (tptp.n3 tptp.c)) (tptp.r4 tptp.c) (not (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))))) :rule reordering :premises (t1))
% 2.07/2.29  (step t3 (cl (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t4)
% 2.07/2.29  (assume t4.a0 (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))))
% 2.07/2.29  (step t4.t1 (cl (or (not (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))))) :rule forall_inst :args ((:= G tptp.c) (:= J tptp.b)))
% 2.07/2.29  (step t4.t2 (cl (not (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule or :premises (t4.t1))
% 2.07/2.29  (step t4.t3 (cl (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule resolution :premises (t4.t2 t4.a0))
% 2.07/2.29  (step t4 (cl (not (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule subproof :discharge (t4.a0))
% 2.07/2.29  (step t5 (cl (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule resolution :premises (t3 t4))
% 2.07/2.29  (step t6 (cl (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) (not (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))))) :rule implies_neg2)
% 2.07/2.29  (step t7 (cl (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))))) :rule resolution :premises (t5 t6))
% 2.07/2.29  (step t8 (cl (=> (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c))))) :rule contraction :premises (t7))
% 2.07/2.29  (step t9 (cl (not (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule implies :premises (t8))
% 2.07/2.29  (step t10 (cl (not (= (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.q3 H I)) (not (tptp.p0 J G)))) (or (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I)))))) (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.q3 H I)) (not (tptp.p0 J G))))) (or (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I))))) :rule equiv_pos2)
% 2.07/2.29  (step t11 (cl (= (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.q3 H I)) (not (tptp.p0 J G)))) (or (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I)))))) :rule all_simplify)
% 2.07/2.29  (step t12 (cl (or (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I))))) :rule resolution :premises (t10 t11 a335))
% 2.07/2.29  (step t13 (cl (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G)))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I)))) :rule or :premises (t12))
% 2.07/2.29  (step t14 (cl (= (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I))))) :rule hole :args ((forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (= E H) (= F I)))
% 2.07/2.29  (step t15 (cl (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I))))) :rule equiv2 :premises (t14))
% 2.07/2.29  (step t16 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e))) (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F)))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t17)
% 2.07/2.29  (assume t17.a0 (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))))
% 2.07/2.29  (step t17.t1 (cl (or (not (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F)))) (not (tptp.q3 tptp.e tptp.e)))) :rule forall_inst :args ((:= E tptp.e) (:= F tptp.e)))
% 2.07/2.29  (step t17.t2 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F)))) (not (tptp.q3 tptp.e tptp.e))) :rule or :premises (t17.t1))
% 2.07/2.29  (step t17.t3 (cl (not (tptp.q3 tptp.e tptp.e))) :rule resolution :premises (t17.t2 t17.a0))
% 2.07/2.29  (step t17 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F)))) (not (tptp.q3 tptp.e tptp.e))) :rule subproof :discharge (t17.a0))
% 2.07/2.29  (step t18 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e))) (not (tptp.q3 tptp.e tptp.e))) :rule resolution :premises (t16 t17))
% 2.07/2.29  (step t19 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e))) (not (not (tptp.q3 tptp.e tptp.e)))) :rule implies_neg2)
% 2.07/2.29  (step t20 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e))) (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e)))) :rule resolution :premises (t18 t19))
% 2.07/2.29  (step t21 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))) (not (tptp.q3 tptp.e tptp.e)))) :rule contraction :premises (t20))
% 2.07/2.29  (step t22 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F)))) (not (tptp.q3 tptp.e tptp.e))) :rule implies :premises (t21))
% 2.07/2.29  (step t23 (cl (not (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))) :rule or_pos)
% 2.07/2.29  (step t24 (cl (not (tptp.n0 tptp.e tptp.e)) (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))))) :rule reordering :premises (t23))
% 2.07/2.29  (step t25 (cl (not (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))) :rule or_pos)
% 2.07/2.29  (step t26 (cl (not (tptp.p1 tptp.e tptp.e tptp.e)) (tptp.q2 tptp.e tptp.e tptp.e) (not (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))))) :rule reordering :premises (t25))
% 2.07/2.29  (step t27 (cl (tptp.p1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e)) (not (tptp.k0 tptp.e))) :rule or :premises (a127))
% 2.07/2.29  (step t28 (cl (not (tptp.r0 tptp.e)) (not (tptp.k0 tptp.e)) (tptp.p1 tptp.e tptp.e tptp.e)) :rule reordering :premises (t27))
% 2.07/2.29  (step t29 (cl (tptp.p1 tptp.e tptp.e tptp.e)) :rule resolution :premises (t28 a12 a27))
% 2.07/2.29  (step t30 (cl (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t31)
% 2.07/2.29  (assume t31.a0 (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))))
% 2.07/2.29  (step t31.t1 (cl (or (not (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I))))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))))) :rule forall_inst :args ((:= I tptp.e)))
% 2.07/2.29  (step t31.t2 (cl (not (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I))))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule or :premises (t31.t1))
% 2.07/2.29  (step t31.t3 (cl (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule resolution :premises (t31.t2 t31.a0))
% 2.07/2.29  (step t31 (cl (not (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I))))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule subproof :discharge (t31.a0))
% 2.07/2.29  (step t32 (cl (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule resolution :premises (t30 t31))
% 2.07/2.29  (step t33 (cl (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) (not (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))))) :rule implies_neg2)
% 2.07/2.29  (step t34 (cl (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))))) :rule resolution :premises (t32 t33))
% 2.07/2.29  (step t35 (cl (=> (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e))))) :rule contraction :premises (t34))
% 2.07/2.29  (step t36 (cl (not (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I))))) (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule implies :premises (t35))
% 2.07/2.29  (step t37 (cl (or (tptp.q2 tptp.e tptp.e tptp.e) (not (tptp.p1 tptp.e tptp.e tptp.e)))) :rule resolution :premises (t36 a218))
% 2.07/2.29  (step t38 (cl (tptp.q2 tptp.e tptp.e tptp.e)) :rule resolution :premises (t26 t29 t37))
% 2.07/2.29  (step t39 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t40)
% 2.07/2.29  (assume t40.a0 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))))
% 2.07/2.29  (step t40.t1 (cl (or (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G))))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))))) :rule forall_inst :args ((:= G tptp.e) (:= H tptp.e) (:= I tptp.e)))
% 2.07/2.29  (step t40.t2 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G))))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule or :premises (t40.t1))
% 2.07/2.29  (step t40.t3 (cl (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule resolution :premises (t40.t2 t40.a0))
% 2.07/2.29  (step t40 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G))))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule subproof :discharge (t40.a0))
% 2.07/2.29  (step t41 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule resolution :premises (t39 t40))
% 2.07/2.29  (step t42 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) (not (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))))) :rule implies_neg2)
% 2.07/2.29  (step t43 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))))) :rule resolution :premises (t41 t42))
% 2.07/2.29  (step t44 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G)))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e))))) :rule contraction :premises (t43))
% 2.07/2.29  (step t45 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.q3 G H) (not (tptp.q2 I G H)) (not (tptp.n0 I G))))) (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule implies :premises (t44))
% 2.07/2.29  (step t46 (cl (or (tptp.q3 tptp.e tptp.e) (not (tptp.q2 tptp.e tptp.e tptp.e)) (not (tptp.n0 tptp.e tptp.e)))) :rule resolution :premises (t45 a292))
% 2.07/2.29  (step t47 (cl (tptp.q3 tptp.e tptp.e)) :rule resolution :premises (t24 a29 t38 t46))
% 2.07/2.29  (step t48 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (not (tptp.q3 E F))))) :rule resolution :premises (t22 t47))
% 2.07/2.29  (step t49 (cl (not (forall ((H $$unsorted) (I $$unsorted)) (not (tptp.q3 H I))))) :rule resolution :premises (t15 t48))
% 2.07/2.29  (step t50 (cl (forall ((G $$unsorted) (J $$unsorted)) (or (tptp.r4 G) (not (tptp.n3 G)) (not (tptp.p0 J G))))) :rule resolution :premises (t13 t49))
% 2.07/2.29  (step t51 (cl (or (tptp.r4 tptp.c) (not (tptp.n3 tptp.c)) (not (tptp.p0 tptp.b tptp.c)))) :rule resolution :premises (t9 t50))
% 2.07/2.29  (step t52 (cl (not (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))) :rule or_pos)
% 2.07/2.29  (step t53 (cl (not (tptp.p2 tptp.b tptp.c tptp.c)) (tptp.n3 tptp.c) (not (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))))) :rule reordering :premises (t52))
% 2.07/2.29  (step t54 (cl (not (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))) :rule or_pos)
% 2.07/2.29  (step t55 (cl (not (tptp.p1 tptp.b tptp.b tptp.b)) (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)) (not (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))))) :rule reordering :premises (t54))
% 2.07/2.29  (step t56 (cl (not (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))) :rule or_pos)
% 2.07/2.29  (step t57 (cl (not (tptp.k0 tptp.b)) (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))))) :rule reordering :premises (t56))
% 2.07/2.29  (step t58 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t59)
% 2.07/2.29  (assume t59.a0 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))))
% 2.07/2.29  (step t59.t1 (cl (or (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E))))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))))) :rule forall_inst :args ((:= D tptp.b) (:= E tptp.b)))
% 2.07/2.29  (step t59.t2 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E))))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule or :premises (t59.t1))
% 2.07/2.29  (step t59.t3 (cl (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t59.t2 t59.a0))
% 2.07/2.29  (step t59 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E))))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule subproof :discharge (t59.a0))
% 2.07/2.29  (step t60 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t58 t59))
% 2.07/2.29  (step t61 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) (not (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))))) :rule implies_neg2)
% 2.07/2.29  (step t62 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))))) :rule resolution :premises (t60 t61))
% 2.07/2.29  (step t63 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b))))) :rule contraction :premises (t62))
% 2.07/2.29  (step t64 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E))))) (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule implies :premises (t63))
% 2.07/2.29  (step t65 (cl (or (tptp.p1 tptp.b tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t64 a100))
% 2.07/2.29  (step t66 (cl (tptp.p1 tptp.b tptp.b tptp.b)) :rule resolution :premises (t57 a31 a6 t65))
% 2.07/2.29  (step t67 (cl (not (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))) :rule or_pos)
% 2.07/2.29  (step t68 (cl (not (tptp.n0 tptp.d tptp.b)) (tptp.l1 tptp.b tptp.b) (not (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))))) :rule reordering :premises (t67))
% 2.07/2.29  (step t69 (cl (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t70)
% 2.07/2.29  (assume t70.a0 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))))
% 2.07/2.29  (step t70.t1 (cl (or (not (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G))))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))))) :rule forall_inst :args ((:= G tptp.b) (:= H tptp.d)))
% 2.07/2.29  (step t70.t2 (cl (not (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G))))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule or :premises (t70.t1))
% 2.07/2.29  (step t70.t3 (cl (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule resolution :premises (t70.t2 t70.a0))
% 2.07/2.29  (step t70 (cl (not (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G))))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule subproof :discharge (t70.a0))
% 2.07/2.29  (step t71 (cl (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule resolution :premises (t69 t70))
% 2.07/2.29  (step t72 (cl (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) (not (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))))) :rule implies_neg2)
% 2.07/2.29  (step t73 (cl (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))))) :rule resolution :premises (t71 t72))
% 2.07/2.29  (step t74 (cl (=> (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b))))) :rule contraction :premises (t73))
% 2.07/2.29  (step t75 (cl (not (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G))))) (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule implies :premises (t74))
% 2.07/2.29  (step t76 (cl (or (tptp.l1 tptp.b tptp.b) (not (tptp.n0 tptp.d tptp.b)))) :rule resolution :premises (t75 a39))
% 2.07/2.29  (step t77 (cl (tptp.l1 tptp.b tptp.b)) :rule resolution :premises (t68 a6 t76))
% 2.07/2.29  (step t78 (cl (not (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))) :rule or_pos)
% 2.07/2.29  (step t79 (cl (not (tptp.m1 tptp.c tptp.b tptp.c)) (tptp.p2 tptp.b tptp.c tptp.b) (not (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))))) :rule reordering :premises (t78))
% 2.07/2.29  (step t80 (cl (not (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))) :rule or_pos)
% 2.07/2.29  (step t81 (cl (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)) (tptp.m1 tptp.c tptp.b tptp.c) (not (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))))) :rule reordering :premises (t80))
% 2.07/2.29  (step t82 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t83)
% 2.07/2.29  (assume t83.a0 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))))
% 2.07/2.29  (step t83.t1 (cl (or (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J))))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))))) :rule forall_inst :args ((:= I tptp.c) (:= J tptp.b)))
% 2.07/2.29  (step t83.t2 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J))))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule or :premises (t83.t1))
% 2.07/2.29  (step t83.t3 (cl (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t83.t2 t83.a0))
% 2.07/2.29  (step t83 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J))))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule subproof :discharge (t83.a0))
% 2.07/2.29  (step t84 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t82 t83))
% 2.07/2.29  (step t85 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) (not (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))))) :rule implies_neg2)
% 2.07/2.29  (step t86 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))))) :rule resolution :premises (t84 t85))
% 2.07/2.29  (step t87 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b))))) :rule contraction :premises (t86))
% 2.07/2.29  (step t88 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J))))) (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule implies :premises (t87))
% 2.07/2.29  (step t89 (cl (or (tptp.m1 tptp.c tptp.b tptp.c) (not (tptp.l0 tptp.c)) (not (tptp.k0 tptp.b)))) :rule resolution :premises (t88 a58))
% 2.07/2.29  (step t90 (cl (tptp.m1 tptp.c tptp.b tptp.c)) :rule resolution :premises (t81 a23 a31 t89))
% 2.07/2.29  (step t91 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t92)
% 2.07/2.29  (assume t92.a0 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))))
% 2.07/2.29  (step t92.t1 (cl (or (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E))))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))))) :rule forall_inst :args ((:= D tptp.b) (:= E tptp.c)))
% 2.07/2.29  (step t92.t2 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E))))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule or :premises (t92.t1))
% 2.07/2.29  (step t92.t3 (cl (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule resolution :premises (t92.t2 t92.a0))
% 2.07/2.29  (step t92 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E))))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule subproof :discharge (t92.a0))
% 2.07/2.29  (step t93 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule resolution :premises (t91 t92))
% 2.07/2.29  (step t94 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) (not (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))))) :rule implies_neg2)
% 2.07/2.29  (step t95 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))))) :rule resolution :premises (t93 t94))
% 2.07/2.29  (step t96 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c))))) :rule contraction :premises (t95))
% 2.07/2.29  (step t97 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E))))) (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule implies :premises (t96))
% 2.07/2.29  (step t98 (cl (or (tptp.p2 tptp.b tptp.c tptp.b) (not (tptp.m1 tptp.c tptp.b tptp.c)))) :rule resolution :premises (t97 a213))
% 2.07/2.29  (step t99 (cl (tptp.p2 tptp.b tptp.c tptp.b)) :rule resolution :premises (t79 t90 t98))
% 2.07/2.29  (step t100 (cl (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t101)
% 2.07/2.29  (assume t101.a0 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))))
% 2.07/2.29  (step t101.t1 (cl (or (not (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C))))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))))) :rule forall_inst :args ((:= C tptp.b) (:= D tptp.c) (:= E tptp.b) (:= F tptp.b)))
% 2.07/2.29  (step t101.t2 (cl (not (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C))))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule or :premises (t101.t1))
% 2.07/2.29  (step t101.t3 (cl (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule resolution :premises (t101.t2 t101.a0))
% 2.07/2.29  (step t101 (cl (not (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C))))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule subproof :discharge (t101.a0))
% 2.07/2.29  (step t102 (cl (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule resolution :premises (t100 t101))
% 2.07/2.29  (step t103 (cl (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) (not (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))))) :rule implies_neg2)
% 2.07/2.29  (step t104 (cl (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))))) :rule resolution :premises (t102 t103))
% 2.07/2.29  (step t105 (cl (=> (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C)))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b))))) :rule contraction :premises (t104))
% 2.07/2.29  (step t106 (cl (not (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p2 C D D) (not (tptp.p1 C E F)) (not (tptp.l1 E F)) (not (tptp.p2 C D C))))) (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule implies :premises (t105))
% 2.07/2.29  (step t107 (cl (or (tptp.p2 tptp.b tptp.c tptp.c) (not (tptp.p1 tptp.b tptp.b tptp.b)) (not (tptp.l1 tptp.b tptp.b)) (not (tptp.p2 tptp.b tptp.c tptp.b)))) :rule resolution :premises (t106 a183))
% 2.07/2.29  (step t108 (cl (tptp.p2 tptp.b tptp.c tptp.c)) :rule resolution :premises (t55 t66 t77 t99 t107))
% 2.07/2.29  (step t109 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t110)
% 2.07/2.29  (assume t110.a0 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))))
% 2.07/2.29  (step t110.t1 (cl (or (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D))))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))))) :rule forall_inst :args ((:= D tptp.c) (:= E tptp.b) (:= F tptp.c)))
% 2.07/2.29  (step t110.t2 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D))))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule or :premises (t110.t1))
% 2.07/2.29  (step t110.t3 (cl (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t110.t2 t110.a0))
% 2.07/2.29  (step t110 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D))))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule subproof :discharge (t110.a0))
% 2.07/2.29  (step t111 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t109 t110))
% 2.07/2.29  (step t112 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) (not (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))))) :rule implies_neg2)
% 2.07/2.29  (step t113 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))))) :rule resolution :premises (t111 t112))
% 2.07/2.29  (step t114 (cl (=> (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c))))) :rule contraction :premises (t113))
% 2.07/2.29  (step t115 (cl (not (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D))))) (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule implies :premises (t114))
% 2.07/2.29  (step t116 (cl (or (tptp.n3 tptp.c) (not (tptp.p2 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t115 a277))
% 2.07/2.29  (step t117 (cl (tptp.n3 tptp.c)) :rule resolution :premises (t53 t108 t116))
% 2.07/2.29  (step t118 (cl (not (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))) :rule or_pos)
% 2.07/2.29  (step t119 (cl (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)) (not (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))))) :rule reordering :premises (t118))
% 2.07/2.29  (step t120 (cl (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B))))) :rule implies_neg1)
% 2.07/2.29  (anchor :step t121)
% 2.07/2.29  (assume t121.a0 (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))))
% 2.07/2.29  (step t121.t1 (cl (or (not (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B))))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))))) :rule forall_inst :args ((:= B tptp.c)))
% 2.07/2.29  (step t121.t2 (cl (not (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B))))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule or :premises (t121.t1))
% 2.07/2.29  (step t121.t3 (cl (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule resolution :premises (t121.t2 t121.a0))
% 2.07/2.29  (step t121 (cl (not (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B))))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule subproof :discharge (t121.a0))
% 2.07/2.29  (step t122 (cl (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule resolution :premises (t120 t121))
% 2.07/2.29  (step t123 (cl (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) (not (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))))) :rule implies_neg2)
% 2.07/2.29  (step t124 (cl (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))))) :rule resolution :premises (t122 t123))
% 2.07/2.29  (step t125 (cl (=> (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c))))) :rule contraction :premises (t124))
% 2.07/2.29  (step t126 (cl (not (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B))))) (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule implies :premises (t125))
% 2.07/2.29  (step t127 (cl (or (tptp.n5 tptp.c tptp.c) (not (tptp.r4 tptp.c)))) :rule resolution :premises (t126 a351))
% 2.07/2.29  (step t128 (cl (not (tptp.r4 tptp.c))) :rule resolution :premises (t119 a368 t127))
% 2.07/2.29  (step t129 (cl) :rule resolution :premises (t2 t51 t117 t128 a21))
% 2.07/2.29  
% 2.12/2.30  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.ONv1osKUK5/cvc5---1.0.5_1975.smt2
% 2.12/2.31  % cvc5---1.0.5 exiting
% 2.12/2.31  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------