TSTP Solution File: SYN201-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN201-1 : TPTP v8.2.0. Released v1.1.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:24:47 EDT 2024
% Result : Unsatisfiable 1.81s 2.00s
% Output : Proof 1.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.15/0.18 % Problem : SYN201-1 : TPTP v8.2.0. Released v1.1.0.
% 0.15/0.20 % Command : do_cvc5 %s %d
% 0.20/0.42 % Computer : n013.cluster.edu
% 0.20/0.42 % Model : x86_64 x86_64
% 0.20/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.42 % Memory : 8042.1875MB
% 0.20/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.42 % CPULimit : 300
% 0.20/0.42 % WCLimit : 300
% 0.20/0.42 % DateTime : Tue May 28 13:54:39 EDT 2024
% 0.20/0.42 % CPUTime :
% 0.46/0.66 %----Proving TF0_NAR, FOF, or CNF
% 0.46/0.67 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 1.81/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox2/tmp/tmp.Mju8fOCdgU/cvc5---1.0.5_2592.smt2
% 1.81/2.00 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.Mju8fOCdgU/cvc5---1.0.5_2592.smt2
% 1.81/2.01 (assume a0 (tptp.s0 tptp.d))
% 1.81/2.01 (assume a1 (tptp.q0 tptp.e tptp.d))
% 1.81/2.01 (assume a2 (tptp.n0 tptp.d tptp.e))
% 1.81/2.01 (assume a3 (tptp.m0 tptp.e tptp.d tptp.a))
% 1.81/2.01 (assume a4 (tptp.s0 tptp.b))
% 1.81/2.01 (assume a5 (tptp.q0 tptp.b tptp.b))
% 1.81/2.01 (assume a6 (tptp.n0 tptp.d tptp.b))
% 1.81/2.01 (assume a7 (tptp.m0 tptp.e tptp.d tptp.e))
% 1.81/2.01 (assume a8 (tptp.r0 tptp.b))
% 1.81/2.01 (assume a9 (tptp.p0 tptp.b tptp.d))
% 1.81/2.01 (assume a10 (tptp.n0 tptp.e tptp.b))
% 1.81/2.01 (assume a11 (forall ((X $$unsorted)) (tptp.m0 tptp.a X tptp.a)))
% 1.81/2.01 (assume a12 (tptp.r0 tptp.e))
% 1.81/2.01 (assume a13 (forall ((X $$unsorted)) (tptp.p0 tptp.b X)))
% 1.81/2.01 (assume a14 (tptp.n0 tptp.a tptp.b))
% 1.81/2.01 (assume a15 (tptp.m0 tptp.c tptp.b tptp.a))
% 1.81/2.01 (assume a16 (forall ((X $$unsorted)) (tptp.q0 X tptp.d)))
% 1.81/2.01 (assume a17 (tptp.p0 tptp.c tptp.b))
% 1.81/2.01 (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.m0 X tptp.d Y)))
% 1.81/2.01 (assume a19 (tptp.l0 tptp.a))
% 1.81/2.01 (assume a20 (tptp.q0 tptp.b tptp.e))
% 1.81/2.01 (assume a21 (tptp.p0 tptp.b tptp.c))
% 1.81/2.01 (assume a22 (tptp.m0 tptp.a tptp.e tptp.e))
% 1.81/2.01 (assume a23 (tptp.l0 tptp.c))
% 1.81/2.01 (assume a24 (tptp.q0 tptp.d tptp.d))
% 1.81/2.01 (assume a25 (tptp.n0 tptp.d tptp.c))
% 1.81/2.01 (assume a26 (tptp.m0 tptp.e tptp.b tptp.c))
% 1.81/2.01 (assume a27 (tptp.k0 tptp.e))
% 1.81/2.01 (assume a28 (tptp.q0 tptp.d tptp.b))
% 1.81/2.01 (assume a29 (tptp.n0 tptp.e tptp.e))
% 1.81/2.01 (assume a30 (tptp.m0 tptp.b tptp.b tptp.e))
% 1.81/2.01 (assume a31 (tptp.k0 tptp.b))
% 1.81/2.01 (assume a32 (tptp.q0 tptp.d tptp.c))
% 1.81/2.01 (assume a33 (tptp.n0 tptp.c tptp.d))
% 1.81/2.01 (assume a34 (tptp.m0 tptp.d tptp.e tptp.c))
% 1.81/2.01 (assume a35 (tptp.q0 tptp.a tptp.b))
% 1.81/2.01 (assume a36 (tptp.n0 tptp.b tptp.a))
% 1.81/2.01 (assume a37 (tptp.m0 tptp.b tptp.a tptp.a))
% 1.81/2.01 (assume a38 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))))
% 1.81/2.01 (assume a39 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a42 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m1 B C B) (not (tptp.m0 C C B)))))
% 1.81/2.01 (assume a43 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J J) (not (tptp.m0 A A J)))))
% 1.81/2.01 (assume a44 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))))
% 1.81/2.01 (assume a45 (or (tptp.m1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a48 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J A) (not (tptp.k0 J)) (not (tptp.n0 A A)))))
% 1.81/2.01 (assume a49 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 1.81/2.01 (assume a50 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H H H) (not (tptp.q0 I H)))))
% 1.81/2.01 (assume a51 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.m1 E E E) (not (tptp.m0 F G E)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a54 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)) (not (tptp.q0 G tptp.d)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a57 (or (tptp.m1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 1.81/2.01 (assume a58 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))))
% 1.81/2.01 (assume a59 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.s0 tptp.e))))
% 1.81/2.01 (assume a60 (or (tptp.m1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.s0 tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a62 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.m1 C C C) (not (tptp.m0 D E C)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a66 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))))
% 1.81/2.01 (assume a67 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a69 (forall ((F $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a72 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.r0 I)) (not (tptp.l0 J)))))
% 1.81/2.01 (assume a73 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.n1 A A B) (not (tptp.m0 tptp.b B A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a75 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.n0 G G)) (not (tptp.q0 tptp.a G)))))
% 1.81/2.01 (assume a76 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.n1 E tptp.c E) (not (tptp.m0 F E tptp.c)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a80 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k1 G)) (not (tptp.p0 G G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a82 (or (tptp.n1 tptp.d tptp.d tptp.d) (not (tptp.q0 tptp.d tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a86 (or (tptp.n1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a93 (or (tptp.n1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.r0 tptp.a))))
% 1.81/2.01 (assume a94 (forall ((D $$unsorted)) (or (tptp.n1 D D D) (not (tptp.r0 D)))))
% 1.81/2.01 (assume a95 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.n1 B B B) (not (tptp.l1 C B)) (not (tptp.n0 C B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a98 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k0 G)) (not (tptp.s0 G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a100 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a103 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p1 G G G) (not (tptp.n0 H G)))))
% 1.81/2.01 (assume a104 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p1 E E E) (not (tptp.q0 F E)))))
% 1.81/2.01 (assume a105 (forall ((D $$unsorted)) (or (tptp.p1 D D D) (not (tptp.k0 D)))))
% 1.81/2.01 (assume a106 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)))))
% 1.81/2.01 (assume a107 (or (tptp.p1 tptp.c tptp.c tptp.c) (not (tptp.p0 tptp.a tptp.c))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a109 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p1 F F F) (not (tptp.s0 G)) (not (tptp.s0 F)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a111 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)) (not (tptp.r0 B)))))
% 1.81/2.01 (assume a112 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.p0 tptp.b tptp.a))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a114 (or (tptp.p1 tptp.c tptp.e tptp.b) (not (tptp.m0 tptp.b tptp.c tptp.e))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a122 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B B) (not (tptp.p0 C B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a125 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a127 (or (tptp.p1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e)) (not (tptp.k0 tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a130 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.q1 H H H) (not (tptp.q0 I H)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a132 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a134 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.s0 A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a137 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C C) (not (tptp.n0 D C)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a139 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q1 J J J) (not (tptp.k0 J)) (not (tptp.l0 A)))))
% 1.81/2.01 (assume a140 (forall ((I $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 I tptp.c tptp.b)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a142 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C D) (not (tptp.s0 C)) (not (tptp.p0 D tptp.d)))))
% 1.81/2.01 (assume a143 (forall ((B $$unsorted)) (or (tptp.q1 B B B) (not (tptp.s0 B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a147 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.q1 B B B) (not (tptp.m0 C D B)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a149 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.k1 A)) (not (tptp.s0 tptp.b)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a151 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 F F G)) (not (tptp.k0 G)))))
% 1.81/2.01 (assume a152 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 1.81/2.01 (assume a153 (forall ((E $$unsorted)) (or (tptp.q1 E E E) (not (tptp.r0 E)))))
% 1.81/2.01 (assume a154 (or (tptp.q1 tptp.d tptp.d tptp.d) (not (tptp.k0 tptp.e)) (not (tptp.s0 tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a156 (forall ((B $$unsorted)) (or (tptp.q1 B tptp.b tptp.b) (not (tptp.s0 B)) (not (tptp.s0 tptp.b)))))
% 1.81/2.01 (assume a157 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.r0 tptp.b))))
% 1.81/2.01 (assume a158 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 J A I)))))
% 1.81/2.01 (assume a159 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q1 G G G) (not (tptp.m0 G H G)))))
% 1.81/2.01 (assume a160 (forall ((F $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 tptp.c F F)) (not (tptp.r0 F)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a162 (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))))
% 1.81/2.01 (assume a163 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.s1 F) (not (tptp.q0 F G)) (not (tptp.s1 H)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a166 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))))
% 1.81/2.01 (assume a167 (or (tptp.k2 tptp.e tptp.e) (not (tptp.l1 tptp.e tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a169 (or (tptp.l2 tptp.c tptp.c) (not (tptp.l2 tptp.c tptp.c)) (not (tptp.l1 tptp.e tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a172 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.m2 F) (not (tptp.s0 F)) (not (tptp.l1 G H)))))
% 1.81/2.01 (assume a173 (or (tptp.m2 tptp.b) (not (tptp.k1 tptp.b))))
% 1.81/2.01 (assume a174 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.n2 A) (not (tptp.p1 B C A)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a176 (or (tptp.n2 tptp.c) (not (tptp.l1 tptp.e tptp.c)) (not (tptp.k0 tptp.b))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a178 (forall ((B $$unsorted)) (or (tptp.p2 B tptp.a B) (not (tptp.q1 B tptp.a B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a184 (or (tptp.p2 tptp.e tptp.c tptp.c) (not (tptp.r1 tptp.d)) (not (tptp.l1 tptp.e tptp.c))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a187 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))))
% 1.81/2.01 (assume a188 (or (tptp.p2 tptp.d tptp.d tptp.d) (not (tptp.k1 tptp.d)) (not (tptp.s0 tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a190 (forall ((B $$unsorted)) (or (tptp.p2 B B B) (not (tptp.n1 tptp.d tptp.d B)))))
% 1.81/2.01 (assume a191 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.q1 A A A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a194 (forall ((E $$unsorted)) (or (tptp.p2 E E E) (not (tptp.l1 E tptp.d)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a196 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.k1 A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a198 (or (tptp.p2 tptp.d tptp.b tptp.b) (not (tptp.p1 tptp.d tptp.b tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a204 (forall ((G $$unsorted)) (or (tptp.p2 G G G) (not (tptp.s1 G)) (not (tptp.k1 G)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a207 (forall ((C $$unsorted)) (or (tptp.p2 C tptp.e C) (not (tptp.n1 C tptp.e tptp.e)))))
% 1.81/2.01 (assume a208 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.p2 A A A) (not (tptp.n1 B B B)) (not (tptp.p0 A A)))))
% 1.81/2.01 (assume a209 (or (tptp.p2 tptp.a tptp.a tptp.a) (not (tptp.p1 tptp.e tptp.e tptp.a))))
% 1.81/2.01 (assume a210 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p2 I I I) (not (tptp.r1 J)) (not (tptp.r0 I)))))
% 1.81/2.01 (assume a211 (forall ((H $$unsorted)) (or (tptp.p2 H H H) (not (tptp.n2 H)) (not (tptp.k1 tptp.e)))))
% 1.81/2.01 (assume a212 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.l1 G F)))))
% 1.81/2.01 (assume a213 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))))
% 1.81/2.01 (assume a214 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a216 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q2 J J J) (not (tptp.k1 A)) (not (tptp.n1 J J A)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a218 (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a221 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.q2 B B B) (not (tptp.q1 C tptp.c B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a223 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q2 G G H) (not (tptp.l1 H G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a225 (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))))
% 1.81/2.01 (assume a226 (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b)))))
% 1.81/2.01 (assume a227 (or (tptp.s2 tptp.d) (not (tptp.s1 tptp.a)) (not (tptp.s0 tptp.d))))
% 1.81/2.01 (assume a228 (or (tptp.s2 tptp.d) (not (tptp.r1 tptp.d)) (not (tptp.s1 tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a231 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.k3 F F G) (not (tptp.k2 G F)))))
% 1.81/2.01 (assume a232 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.s2 tptp.e)) (not (tptp.k2 tptp.c tptp.e))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a234 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.k3 A A A) (not (tptp.l2 B tptp.b)) (not (tptp.k1 A)))))
% 1.81/2.01 (assume a235 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.k0 tptp.a)) (not (tptp.r2 tptp.c))))
% 1.81/2.01 (assume a236 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k3 I J J) (not (tptp.l1 J I)) (not (tptp.k3 I J J)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a241 (or (tptp.k3 tptp.a tptp.a tptp.a) (not (tptp.r2 tptp.a))))
% 1.81/2.01 (assume a242 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.k3 E E E) (not (tptp.p2 F E E)))))
% 1.81/2.01 (assume a243 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.k3 C D C) (not (tptp.p2 D C C)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a245 (forall ((I $$unsorted)) (or (tptp.k3 I I I) (not (tptp.r2 tptp.c)) (not (tptp.l1 tptp.b I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a247 (forall ((D $$unsorted)) (or (tptp.k3 D D D) (not (tptp.n2 D)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a249 (forall ((B $$unsorted)) (or (tptp.k3 B B B) (not (tptp.m2 B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a251 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.r2 tptp.c))))
% 1.81/2.01 (assume a252 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G H) (not (tptp.r0 G)) (not (tptp.p2 G H G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a254 (forall ((C $$unsorted)) (or (tptp.l3 C C) (not (tptp.n2 C)) (not (tptp.m2 tptp.b)))))
% 1.81/2.01 (assume a255 (forall ((B $$unsorted)) (or (tptp.l3 B B) (not (tptp.r2 B)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a257 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G G) (not (tptp.s2 H)) (not (tptp.l1 G G)))))
% 1.81/2.01 (assume a258 (or (tptp.l3 tptp.d tptp.d) (not (tptp.k2 tptp.a tptp.d))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a260 (or (tptp.l3 tptp.c tptp.c) (not (tptp.k2 tptp.b tptp.c))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a266 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.q2 tptp.a tptp.b tptp.a))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a268 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m3 H I H) (not (tptp.r2 H)) (not (tptp.k2 tptp.c I)))))
% 1.81/2.01 (assume a269 (forall ((G $$unsorted)) (or (tptp.m3 G G G) (not (tptp.l2 G G)) (not (tptp.n2 G)))))
% 1.81/2.01 (assume a270 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.m3 E E E) (not (tptp.n2 E)) (not (tptp.m2 F)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a272 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m3 B B C) (not (tptp.r2 C)) (not (tptp.k3 B C B)))))
% 1.81/2.01 (assume a273 (forall ((A $$unsorted)) (or (tptp.m3 A A A) (not (tptp.n2 A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a275 (forall ((I $$unsorted)) (or (tptp.m3 I I I) (not (tptp.p2 I I I)))))
% 1.81/2.01 (assume a276 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.l2 tptp.a tptp.b))))
% 1.81/2.01 (assume a277 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a281 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.n2 H)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a283 (forall ((D $$unsorted)) (or (tptp.p3 D D D) (not (tptp.l2 D D)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a285 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p3 I I I) (not (tptp.p2 J I I)) (not (tptp.n3 I)))))
% 1.81/2.01 (assume a286 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.k1 H)) (not (tptp.n2 H)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a290 (or (tptp.p3 tptp.b tptp.c tptp.b) (not (tptp.k2 tptp.c tptp.b))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a293 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q3 E E) (not (tptp.p2 F E E)) (not (tptp.q3 F E)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a297 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.r3 G H H) (not (tptp.s2 H)) (not (tptp.l2 tptp.c G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a301 (forall ((H $$unsorted)) (or (tptp.r3 H H H) (not (tptp.s2 H)))))
% 1.81/2.01 (assume a302 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.r3 F F F) (not (tptp.l2 G F)))))
% 1.81/2.01 (assume a303 (forall ((E $$unsorted)) (or (tptp.r3 E E E) (not (tptp.r2 E)))))
% 1.81/2.01 (assume a304 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a314 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.l4 J) (not (tptp.p3 A B J)))))
% 1.81/2.01 (assume a315 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l4 H) (not (tptp.m0 I H H)) (not (tptp.l4 I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a318 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n4 J A) (not (tptp.p3 J A A)) (not (tptp.n4 J J)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a321 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n4 H H) (not (tptp.k4 I)) (not (tptp.m3 H H H)))))
% 1.81/2.01 (assume a322 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p4 G G H) (not (tptp.r0 G)) (not (tptp.r3 H G H)))))
% 1.81/2.01 (assume a323 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p4 D D D) (not (tptp.q3 E F)) (not (tptp.n3 D)))))
% 1.81/2.01 (assume a324 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p4 B C B) (not (tptp.k3 B B C)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a328 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p4 I I I) (not (tptp.p3 J J I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a337 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.k5 E) (not (tptp.s4 F)) (not (tptp.r3 G E E)))))
% 1.81/2.01 (assume a338 (or (tptp.k5 tptp.b) (not (tptp.s4 tptp.e)) (not (tptp.n1 tptp.b tptp.b tptp.b))))
% 1.81/2.01 (assume a339 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l5 H) (not (tptp.q4 I I)) (not (tptp.k1 H)))))
% 1.81/2.01 (assume a340 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.m5 D E) (not (tptp.r0 D)) (not (tptp.p4 D F E)))))
% 1.81/2.01 (assume a341 (forall ((C $$unsorted)) (or (tptp.m5 C C) (not (tptp.k4 C)))))
% 1.81/2.01 (assume a342 (forall ((B $$unsorted)) (or (tptp.m5 B B) (not (tptp.s4 B)) (not (tptp.m4 tptp.e tptp.e)))))
% 1.81/2.01 (assume a343 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m5 J J) (not (tptp.s4 A)) (not (tptp.r0 J)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a345 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n5 J J) (not (tptp.m0 A J A)) (not (tptp.n5 A J)))))
% 1.81/2.01 (assume a346 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n5 H H) (not (tptp.n4 I H)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a348 (or (tptp.n5 tptp.d tptp.d) (not (tptp.p4 tptp.c tptp.d tptp.c))))
% 1.81/2.01 (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))))
% 1.81/2.01 (assume a350 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.n5 C C) (not (tptp.q4 D C)))))
% 1.81/2.01 (assume a351 (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))))
% 1.81/2.01 (assume a352 (forall ((A $$unsorted)) (or (tptp.n5 A A) (not (tptp.s1 A)) (not (tptp.k4 A)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a355 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p5 E E F) (not (tptp.s4 F)) (not (tptp.l2 E E)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a357 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p5 I J I) (not (tptp.q4 J A)) (not (tptp.s1 I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a359 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q5 J A) (not (tptp.s4 J)) (not (tptp.m2 A)))))
% 1.81/2.01 (assume a360 (or (tptp.q5 tptp.a tptp.a) (not (tptp.r4 tptp.a))))
% 1.81/2.01 (assume a361 (forall ((I $$unsorted)) (or (tptp.q5 I I) (not (tptp.l4 I)))))
% 1.81/2.01 (assume a362 (forall ((H $$unsorted)) (or (tptp.q5 H H) (not (tptp.q4 H H)))))
% 1.81/2.01 (assume a363 (forall ((G $$unsorted)) (or (tptp.q5 G G) (not (tptp.m4 G G)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a365 (forall ((B $$unsorted)) (or (tptp.r5 B B) (not (tptp.k4 B)))))
% 1.81/2.01 (assume a366 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.s5 H) (not (tptp.l4 H)) (not (tptp.r4 I)))))
% 1.81/2.01 (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)))))
% 1.81/2.01 (assume a368 (not (tptp.s2 tptp.b)))
% 1.81/2.01 (step t1 (cl (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) :rule implies_neg1)
% 1.81/2.01 (anchor :step t2)
% 1.81/2.01 (assume t2.a0 (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))))
% 1.81/2.01 (step t2.t1 (cl (or (not (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule forall_inst :args ((:= H tptp.b)))
% 1.81/2.01 (step t2.t2 (cl (not (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) :rule or :premises (t2.t1))
% 1.81/2.01 (step t2.t3 (cl (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) :rule resolution :premises (t2.t2 t2.a0))
% 1.81/2.01 (step t2 (cl (not (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) :rule subproof :discharge (t2.a0))
% 1.81/2.01 (step t3 (cl (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) :rule resolution :premises (t1 t2))
% 1.81/2.01 (step t4 (cl (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) (not (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule implies_neg2)
% 1.81/2.01 (step t5 (cl (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule resolution :premises (t3 t4))
% 1.81/2.01 (step t6 (cl (=> (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule contraction :premises (t5))
% 1.81/2.01 (step t7 (cl (not (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) :rule implies :premises (t6))
% 1.81/2.01 (step t8 (cl (not (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)))) (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))) :rule or_pos)
% 1.81/2.01 (step t9 (cl (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b)) (not (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule reordering :premises (t8))
% 1.81/2.01 (step t10 (cl (not (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))) :rule or_pos)
% 1.81/2.01 (step t11 (cl (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)) (tptp.q2 tptp.b tptp.b tptp.b) (not (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))))) :rule reordering :premises (t10))
% 1.81/2.01 (step t12 (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)
% 1.81/2.01 (step t13 (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 (t12))
% 1.81/2.01 (step t14 (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)
% 1.81/2.01 (anchor :step t15)
% 1.81/2.01 (assume t15.a0 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))))
% 1.81/2.01 (step t15.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)))
% 1.81/2.01 (step t15.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 (t15.t1))
% 1.81/2.01 (step t15.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 (t15.t2 t15.a0))
% 1.81/2.01 (step t15 (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 (t15.a0))
% 1.81/2.01 (step t16 (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 (t14 t15))
% 1.81/2.01 (step t17 (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)
% 1.81/2.01 (step t18 (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 (t16 t17))
% 1.81/2.01 (step t19 (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 (t18))
% 1.81/2.01 (step t20 (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 (t19))
% 1.81/2.01 (step t21 (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 (t20 a100))
% 1.81/2.01 (step t22 (cl (tptp.p1 tptp.b tptp.b tptp.b)) :rule resolution :premises (t13 a31 a6 t21))
% 1.81/2.01 (step t23 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E))))) :rule implies_neg1)
% 1.81/2.01 (anchor :step t24)
% 1.81/2.01 (assume t24.a0 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))))
% 1.81/2.01 (step t24.t1 (cl (or (not (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E))))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))))) :rule forall_inst :args ((:= E tptp.b) (:= F tptp.b)))
% 1.81/2.01 (step t24.t2 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E))))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule or :premises (t24.t1))
% 1.81/2.01 (step t24.t3 (cl (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule resolution :premises (t24.t2 t24.a0))
% 1.81/2.01 (step t24 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E))))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule subproof :discharge (t24.a0))
% 1.81/2.01 (step t25 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule resolution :premises (t23 t24))
% 1.81/2.01 (step t26 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) (not (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))))) :rule implies_neg2)
% 1.81/2.01 (step t27 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))))) :rule resolution :premises (t25 t26))
% 1.81/2.01 (step t28 (cl (=> (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b))))) :rule contraction :premises (t27))
% 1.81/2.01 (step t29 (cl (not (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E))))) (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule implies :premises (t28))
% 1.81/2.01 (step t30 (cl (or (tptp.q2 tptp.b tptp.b tptp.b) (not (tptp.k0 tptp.b)) (not (tptp.p1 tptp.b tptp.b tptp.b)))) :rule resolution :premises (t29 a214))
% 1.81/2.01 (step t31 (cl (tptp.q2 tptp.b tptp.b tptp.b)) :rule resolution :premises (t11 a31 t22 t30))
% 1.81/2.01 (step t32 (cl (not (or (tptp.s2 tptp.b) (not (tptp.q2 tptp.b tptp.b tptp.b))))) :rule resolution :premises (t9 a368 t31))
% 1.81/2.01 (step t33 (cl (not (= (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b)))) (or (not (tptp.s1 tptp.b)) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))))) (not (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b))))) (or (not (tptp.s1 tptp.b)) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))))) :rule equiv_pos2)
% 1.81/2.01 (step t34 (cl (= (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b)))) (or (not (tptp.s1 tptp.b)) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))))) :rule all_simplify)
% 1.81/2.01 (step t35 (cl (or (not (tptp.s1 tptp.b)) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)))))) :rule resolution :premises (t33 t34 a226))
% 1.81/2.01 (step t36 (cl (not (tptp.s1 tptp.b)) (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) :rule or :premises (t35))
% 1.81/2.01 (step t37 (cl (not (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))) :rule or_pos)
% 1.81/2.01 (step t38 (cl (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)) (not (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))))) :rule reordering :premises (t37))
% 1.81/2.01 (step t39 (cl (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b)) (forall ((X $$unsorted)) (tptp.p0 tptp.b X))) :rule implies_neg1)
% 1.81/2.01 (anchor :step t40)
% 1.81/2.01 (assume t40.a0 (forall ((X $$unsorted)) (tptp.p0 tptp.b X)))
% 1.81/2.01 (step t40.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.p0 tptp.b X))) (tptp.p0 tptp.b tptp.b))) :rule forall_inst :args ((:= X tptp.b)))
% 1.81/2.01 (step t40.t2 (cl (not (forall ((X $$unsorted)) (tptp.p0 tptp.b X))) (tptp.p0 tptp.b tptp.b)) :rule or :premises (t40.t1))
% 1.81/2.01 (step t40.t3 (cl (tptp.p0 tptp.b tptp.b)) :rule resolution :premises (t40.t2 t40.a0))
% 1.81/2.01 (step t40 (cl (not (forall ((X $$unsorted)) (tptp.p0 tptp.b X))) (tptp.p0 tptp.b tptp.b)) :rule subproof :discharge (t40.a0))
% 1.81/2.01 (step t41 (cl (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b)) (tptp.p0 tptp.b tptp.b)) :rule resolution :premises (t39 t40))
% 1.81/2.01 (step t42 (cl (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b)) (not (tptp.p0 tptp.b tptp.b))) :rule implies_neg2)
% 1.81/2.01 (step t43 (cl (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b)) (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b))) :rule resolution :premises (t41 t42))
% 1.81/2.01 (step t44 (cl (=> (forall ((X $$unsorted)) (tptp.p0 tptp.b X)) (tptp.p0 tptp.b tptp.b))) :rule contraction :premises (t43))
% 1.81/2.01 (step t45 (cl (not (forall ((X $$unsorted)) (tptp.p0 tptp.b X))) (tptp.p0 tptp.b tptp.b)) :rule implies :premises (t44))
% 1.81/2.01 (step t46 (cl (tptp.p0 tptp.b tptp.b)) :rule resolution :premises (t45 a13))
% 1.81/2.01 (step t47 (cl (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I))))) :rule implies_neg1)
% 1.81/2.01 (anchor :step t48)
% 1.81/2.01 (assume t48.a0 (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))))
% 1.81/2.01 (step t48.t1 (cl (or (not (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I))))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))))) :rule forall_inst :args ((:= I tptp.b)))
% 1.81/2.01 (step t48.t2 (cl (not (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I))))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule or :premises (t48.t1))
% 1.81/2.01 (step t48.t3 (cl (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule resolution :premises (t48.t2 t48.a0))
% 1.81/2.01 (step t48 (cl (not (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I))))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule subproof :discharge (t48.a0))
% 1.81/2.01 (step t49 (cl (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule resolution :premises (t47 t48))
% 1.81/2.01 (step t50 (cl (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) (not (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))))) :rule implies_neg2)
% 1.81/2.01 (step t51 (cl (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))))) :rule resolution :premises (t49 t50))
% 1.81/2.01 (step t52 (cl (=> (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b))))) :rule contraction :premises (t51))
% 1.81/2.01 (step t53 (cl (not (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I))))) (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule implies :premises (t52))
% 1.81/2.01 (step t54 (cl (or (tptp.s1 tptp.b) (not (tptp.p0 tptp.b tptp.b)))) :rule resolution :premises (t53 a162))
% 1.81/2.01 (step t55 (cl (tptp.s1 tptp.b)) :rule resolution :premises (t38 t46 t54))
% 1.81/2.01 (step t56 (cl (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b))))) :rule resolution :premises (t36 t55))
% 1.81/2.01 (step t57 (cl) :rule resolution :premises (t7 t32 t56))
% 1.81/2.01
% 1.81/2.02 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.Mju8fOCdgU/cvc5---1.0.5_2592.smt2
% 1.81/2.02 % cvc5---1.0.5 exiting
% 1.81/2.03 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------