TSTP Solution File: SYN191-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYN191-1 : TPTP v8.2.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n022.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:44 EDT 2024
% Result : Unsatisfiable 9.13s 9.32s
% Output : Proof 9.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15 % Problem : SYN191-1 : TPTP v8.2.0. Released v1.1.0.
% 0.07/0.16 % Command : do_cvc5 %s %d
% 0.16/0.38 % Computer : n022.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Tue May 28 14:08:54 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.24/0.60 %----Proving TF0_NAR, FOF, or CNF
% 0.24/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 9.13/9.32 % SZS status Unsatisfiable for /export/starexec/sandbox/tmp/tmp.vdqqYyhp7E/cvc5---1.0.5_22810.smt2
% 9.13/9.32 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.vdqqYyhp7E/cvc5---1.0.5_22810.smt2
% 9.13/9.33 (assume a0 (tptp.s0 tptp.d))
% 9.13/9.33 (assume a1 (tptp.q0 tptp.e tptp.d))
% 9.13/9.33 (assume a2 (tptp.n0 tptp.d tptp.e))
% 9.13/9.33 (assume a3 (tptp.m0 tptp.e tptp.d tptp.a))
% 9.13/9.33 (assume a4 (tptp.s0 tptp.b))
% 9.13/9.33 (assume a5 (tptp.q0 tptp.b tptp.b))
% 9.13/9.33 (assume a6 (tptp.n0 tptp.d tptp.b))
% 9.13/9.33 (assume a7 (tptp.m0 tptp.e tptp.d tptp.e))
% 9.13/9.33 (assume a8 (tptp.r0 tptp.b))
% 9.13/9.33 (assume a9 (tptp.p0 tptp.b tptp.d))
% 9.13/9.33 (assume a10 (tptp.n0 tptp.e tptp.b))
% 9.13/9.33 (assume a11 (forall ((X $$unsorted)) (tptp.m0 tptp.a X tptp.a)))
% 9.13/9.33 (assume a12 (tptp.r0 tptp.e))
% 9.13/9.33 (assume a13 (forall ((X $$unsorted)) (tptp.p0 tptp.b X)))
% 9.13/9.33 (assume a14 (tptp.n0 tptp.a tptp.b))
% 9.13/9.33 (assume a15 (tptp.m0 tptp.c tptp.b tptp.a))
% 9.13/9.33 (assume a16 (forall ((X $$unsorted)) (tptp.q0 X tptp.d)))
% 9.13/9.33 (assume a17 (tptp.p0 tptp.c tptp.b))
% 9.13/9.33 (assume a18 (forall ((X $$unsorted) (Y $$unsorted)) (tptp.m0 X tptp.d Y)))
% 9.13/9.33 (assume a19 (tptp.l0 tptp.a))
% 9.13/9.33 (assume a20 (tptp.q0 tptp.b tptp.e))
% 9.13/9.33 (assume a21 (tptp.p0 tptp.b tptp.c))
% 9.13/9.33 (assume a22 (tptp.m0 tptp.a tptp.e tptp.e))
% 9.13/9.33 (assume a23 (tptp.l0 tptp.c))
% 9.13/9.33 (assume a24 (tptp.q0 tptp.d tptp.d))
% 9.13/9.33 (assume a25 (tptp.n0 tptp.d tptp.c))
% 9.13/9.33 (assume a26 (tptp.m0 tptp.e tptp.b tptp.c))
% 9.13/9.33 (assume a27 (tptp.k0 tptp.e))
% 9.13/9.33 (assume a28 (tptp.q0 tptp.d tptp.b))
% 9.13/9.33 (assume a29 (tptp.n0 tptp.e tptp.e))
% 9.13/9.33 (assume a30 (tptp.m0 tptp.b tptp.b tptp.e))
% 9.13/9.33 (assume a31 (tptp.k0 tptp.b))
% 9.13/9.33 (assume a32 (tptp.q0 tptp.d tptp.c))
% 9.13/9.33 (assume a33 (tptp.n0 tptp.c tptp.d))
% 9.13/9.33 (assume a34 (tptp.m0 tptp.d tptp.e tptp.c))
% 9.13/9.33 (assume a35 (tptp.q0 tptp.a tptp.b))
% 9.13/9.33 (assume a36 (tptp.n0 tptp.b tptp.a))
% 9.13/9.33 (assume a37 (tptp.m0 tptp.b tptp.a tptp.a))
% 9.13/9.33 (assume a38 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))))
% 9.13/9.33 (assume a39 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l1 G G) (not (tptp.n0 H G)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a42 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m1 B C B) (not (tptp.m0 C C B)))))
% 9.13/9.33 (assume a43 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J J) (not (tptp.m0 A A J)))))
% 9.13/9.33 (assume a44 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))))
% 9.13/9.33 (assume a45 (or (tptp.m1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a48 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m1 J J A) (not (tptp.k0 J)) (not (tptp.n0 A A)))))
% 9.13/9.33 (assume a49 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 9.13/9.33 (assume a50 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H H H) (not (tptp.q0 I H)))))
% 9.13/9.33 (assume a51 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.m1 E E E) (not (tptp.m0 F G E)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a54 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)) (not (tptp.q0 G tptp.d)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a57 (or (tptp.m1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 9.13/9.33 (assume a58 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.l0 I)) (not (tptp.k0 J)))))
% 9.13/9.33 (assume a59 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.s0 tptp.e))))
% 9.13/9.33 (assume a60 (or (tptp.m1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.s0 tptp.d))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a62 (forall ((C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (tptp.m1 C C C) (not (tptp.m0 D E C)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a66 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))))
% 9.13/9.33 (assume a67 (or (tptp.m1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a69 (forall ((F $$unsorted)) (or (tptp.m1 F F F) (not (tptp.s0 F)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a72 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.m1 I J I) (not (tptp.r0 I)) (not (tptp.l0 J)))))
% 9.13/9.33 (assume a73 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.n1 A A B) (not (tptp.m0 tptp.b B A)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a75 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.n0 G G)) (not (tptp.q0 tptp.a G)))))
% 9.13/9.33 (assume a76 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.n1 E tptp.c E) (not (tptp.m0 F E tptp.c)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a80 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k1 G)) (not (tptp.p0 G G)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a82 (or (tptp.n1 tptp.d tptp.d tptp.d) (not (tptp.q0 tptp.d tptp.d))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a86 (or (tptp.n1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a93 (or (tptp.n1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a)) (not (tptp.r0 tptp.a))))
% 9.13/9.33 (assume a94 (forall ((D $$unsorted)) (or (tptp.n1 D D D) (not (tptp.r0 D)))))
% 9.13/9.33 (assume a95 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.n1 B B B) (not (tptp.l1 C B)) (not (tptp.n0 C B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a98 (forall ((G $$unsorted)) (or (tptp.n1 G G G) (not (tptp.k0 G)) (not (tptp.s0 G)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a100 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p1 D D E) (not (tptp.n0 tptp.d D)) (not (tptp.k0 E)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a103 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p1 G G G) (not (tptp.n0 H G)))))
% 9.13/9.33 (assume a104 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p1 E E E) (not (tptp.q0 F E)))))
% 9.13/9.33 (assume a105 (forall ((D $$unsorted)) (or (tptp.p1 D D D) (not (tptp.k0 D)))))
% 9.13/9.33 (assume a106 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)))))
% 9.13/9.33 (assume a107 (or (tptp.p1 tptp.c tptp.c tptp.c) (not (tptp.p0 tptp.a tptp.c))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a109 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p1 F F F) (not (tptp.s0 G)) (not (tptp.s0 F)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a111 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B C) (not (tptp.p0 C B)) (not (tptp.r0 B)))))
% 9.13/9.33 (assume a112 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.p0 tptp.b tptp.a))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a114 (or (tptp.p1 tptp.c tptp.e tptp.b) (not (tptp.m0 tptp.b tptp.c tptp.e))))
% 9.13/9.33 (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))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a122 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p1 B B B) (not (tptp.p0 C B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a125 (or (tptp.p1 tptp.a tptp.a tptp.a) (not (tptp.l0 tptp.a))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a127 (or (tptp.p1 tptp.e tptp.e tptp.e) (not (tptp.r0 tptp.e)) (not (tptp.k0 tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a130 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.q1 H H H) (not (tptp.q0 I H)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a132 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a134 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.s0 A)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a137 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C C) (not (tptp.n0 D C)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a139 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q1 J J J) (not (tptp.k0 J)) (not (tptp.l0 A)))))
% 9.13/9.33 (assume a140 (forall ((I $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 I tptp.c tptp.b)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a142 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.q1 C C D) (not (tptp.s0 C)) (not (tptp.p0 D tptp.d)))))
% 9.13/9.33 (assume a143 (forall ((B $$unsorted)) (or (tptp.q1 B B B) (not (tptp.s0 B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a147 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.q1 B B B) (not (tptp.m0 C D B)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a149 (forall ((A $$unsorted)) (or (tptp.q1 A A A) (not (tptp.k1 A)) (not (tptp.s0 tptp.b)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a151 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 F F G)) (not (tptp.k0 G)))))
% 9.13/9.33 (assume a152 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.l0 tptp.b))))
% 9.13/9.33 (assume a153 (forall ((E $$unsorted)) (or (tptp.q1 E E E) (not (tptp.r0 E)))))
% 9.13/9.33 (assume a154 (or (tptp.q1 tptp.d tptp.d tptp.d) (not (tptp.k0 tptp.e)) (not (tptp.s0 tptp.d))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a156 (forall ((B $$unsorted)) (or (tptp.q1 B tptp.b tptp.b) (not (tptp.s0 B)) (not (tptp.s0 tptp.b)))))
% 9.13/9.33 (assume a157 (or (tptp.q1 tptp.b tptp.b tptp.b) (not (tptp.r0 tptp.b))))
% 9.13/9.33 (assume a158 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.q1 I I I) (not (tptp.m0 J A I)))))
% 9.13/9.33 (assume a159 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q1 G G G) (not (tptp.m0 G H G)))))
% 9.13/9.33 (assume a160 (forall ((F $$unsorted)) (or (tptp.q1 F F F) (not (tptp.m0 tptp.c F F)) (not (tptp.r0 F)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a162 (forall ((I $$unsorted)) (or (tptp.s1 I) (not (tptp.p0 I I)))))
% 9.13/9.33 (assume a163 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.s1 F) (not (tptp.q0 F G)) (not (tptp.s1 H)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a166 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))))
% 9.13/9.33 (assume a167 (or (tptp.k2 tptp.e tptp.e) (not (tptp.l1 tptp.e tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a169 (or (tptp.l2 tptp.c tptp.c) (not (tptp.l2 tptp.c tptp.c)) (not (tptp.l1 tptp.e tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a172 (forall ((F $$unsorted) (G $$unsorted) (H $$unsorted)) (or (tptp.m2 F) (not (tptp.s0 F)) (not (tptp.l1 G H)))))
% 9.13/9.33 (assume a173 (or (tptp.m2 tptp.b) (not (tptp.k1 tptp.b))))
% 9.13/9.33 (assume a174 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (tptp.n2 A) (not (tptp.p1 B C A)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a176 (or (tptp.n2 tptp.c) (not (tptp.l1 tptp.e tptp.c)) (not (tptp.k0 tptp.b))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a178 (forall ((B $$unsorted)) (or (tptp.p2 B tptp.a B) (not (tptp.q1 B tptp.a B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a184 (or (tptp.p2 tptp.e tptp.c tptp.c) (not (tptp.r1 tptp.d)) (not (tptp.l1 tptp.e tptp.c))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a187 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))))
% 9.13/9.33 (assume a188 (or (tptp.p2 tptp.d tptp.d tptp.d) (not (tptp.k1 tptp.d)) (not (tptp.s0 tptp.d))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a190 (forall ((B $$unsorted)) (or (tptp.p2 B B B) (not (tptp.n1 tptp.d tptp.d B)))))
% 9.13/9.33 (assume a191 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.q1 A A A)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a194 (forall ((E $$unsorted)) (or (tptp.p2 E E E) (not (tptp.l1 E tptp.d)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a196 (forall ((A $$unsorted)) (or (tptp.p2 A A A) (not (tptp.k1 A)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a198 (or (tptp.p2 tptp.d tptp.b tptp.b) (not (tptp.p1 tptp.d tptp.b tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a204 (forall ((G $$unsorted)) (or (tptp.p2 G G G) (not (tptp.s1 G)) (not (tptp.k1 G)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a207 (forall ((C $$unsorted)) (or (tptp.p2 C tptp.e C) (not (tptp.n1 C tptp.e tptp.e)))))
% 9.13/9.33 (assume a208 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.p2 A A A) (not (tptp.n1 B B B)) (not (tptp.p0 A A)))))
% 9.13/9.33 (assume a209 (or (tptp.p2 tptp.a tptp.a tptp.a) (not (tptp.p1 tptp.e tptp.e tptp.a))))
% 9.13/9.33 (assume a210 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p2 I I I) (not (tptp.r1 J)) (not (tptp.r0 I)))))
% 9.13/9.33 (assume a211 (forall ((H $$unsorted)) (or (tptp.p2 H H H) (not (tptp.n2 H)) (not (tptp.k1 tptp.e)))))
% 9.13/9.33 (assume a212 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.l1 G F)))))
% 9.13/9.33 (assume a213 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.p2 D E D) (not (tptp.m1 E D E)))))
% 9.13/9.33 (assume a214 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q2 E F F) (not (tptp.k0 F)) (not (tptp.p1 E E E)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a216 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q2 J J J) (not (tptp.k1 A)) (not (tptp.n1 J J A)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a218 (forall ((I $$unsorted)) (or (tptp.q2 I I I) (not (tptp.p1 I I I)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a221 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.q2 B B B) (not (tptp.q1 C tptp.c B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a223 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.q2 G G H) (not (tptp.l1 H G)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a225 (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))))
% 9.13/9.33 (assume a226 (forall ((H $$unsorted)) (or (tptp.s2 H) (not (tptp.q2 tptp.b H tptp.b)) (not (tptp.s1 tptp.b)))))
% 9.13/9.33 (assume a227 (or (tptp.s2 tptp.d) (not (tptp.s1 tptp.a)) (not (tptp.s0 tptp.d))))
% 9.13/9.33 (assume a228 (or (tptp.s2 tptp.d) (not (tptp.r1 tptp.d)) (not (tptp.s1 tptp.d))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a231 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.k3 F F G) (not (tptp.k2 G F)))))
% 9.13/9.33 (assume a232 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.s2 tptp.e)) (not (tptp.k2 tptp.c tptp.e))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a234 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.k3 A A A) (not (tptp.l2 B tptp.b)) (not (tptp.k1 A)))))
% 9.13/9.33 (assume a235 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.k0 tptp.a)) (not (tptp.r2 tptp.c))))
% 9.13/9.33 (assume a236 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k3 I J J) (not (tptp.l1 J I)) (not (tptp.k3 I J J)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (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))))
% 9.13/9.33 (assume a241 (or (tptp.k3 tptp.a tptp.a tptp.a) (not (tptp.r2 tptp.a))))
% 9.13/9.33 (assume a242 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.k3 E E E) (not (tptp.p2 F E E)))))
% 9.13/9.33 (assume a243 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.k3 C D C) (not (tptp.p2 D C C)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a245 (forall ((I $$unsorted)) (or (tptp.k3 I I I) (not (tptp.r2 tptp.c)) (not (tptp.l1 tptp.b I)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a247 (forall ((D $$unsorted)) (or (tptp.k3 D D D) (not (tptp.n2 D)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a249 (forall ((B $$unsorted)) (or (tptp.k3 B B B) (not (tptp.m2 B)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a251 (or (tptp.k3 tptp.c tptp.c tptp.c) (not (tptp.r2 tptp.c))))
% 9.13/9.33 (assume a252 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G H) (not (tptp.r0 G)) (not (tptp.p2 G H G)))))
% 9.13/9.33 (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)))))
% 9.13/9.33 (assume a254 (forall ((C $$unsorted)) (or (tptp.l3 C C) (not (tptp.n2 C)) (not (tptp.m2 tptp.b)))))
% 9.13/9.34 (assume a255 (forall ((B $$unsorted)) (or (tptp.l3 B B) (not (tptp.r2 B)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a257 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.l3 G G) (not (tptp.s2 H)) (not (tptp.l1 G G)))))
% 9.13/9.34 (assume a258 (or (tptp.l3 tptp.d tptp.d) (not (tptp.k2 tptp.a tptp.d))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a260 (or (tptp.l3 tptp.c tptp.c) (not (tptp.k2 tptp.b tptp.c))))
% 9.13/9.34 (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))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a266 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.q2 tptp.a tptp.b tptp.a))))
% 9.13/9.34 (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))))
% 9.13/9.34 (assume a268 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m3 H I H) (not (tptp.r2 H)) (not (tptp.k2 tptp.c I)))))
% 9.13/9.34 (assume a269 (forall ((G $$unsorted)) (or (tptp.m3 G G G) (not (tptp.l2 G G)) (not (tptp.n2 G)))))
% 9.13/9.34 (assume a270 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.m3 E E E) (not (tptp.n2 E)) (not (tptp.m2 F)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a272 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.m3 B B C) (not (tptp.r2 C)) (not (tptp.k3 B C B)))))
% 9.13/9.34 (assume a273 (forall ((A $$unsorted)) (or (tptp.m3 A A A) (not (tptp.n2 A)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a275 (forall ((I $$unsorted)) (or (tptp.m3 I I I) (not (tptp.p2 I I I)))))
% 9.13/9.34 (assume a276 (or (tptp.m3 tptp.b tptp.b tptp.b) (not (tptp.l2 tptp.a tptp.b))))
% 9.13/9.34 (assume a277 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.n3 D) (not (tptp.p2 E F D)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a281 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.n2 H)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a283 (forall ((D $$unsorted)) (or (tptp.p3 D D D) (not (tptp.l2 D D)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a285 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p3 I I I) (not (tptp.p2 J I I)) (not (tptp.n3 I)))))
% 9.13/9.34 (assume a286 (forall ((H $$unsorted)) (or (tptp.p3 H H H) (not (tptp.k1 H)) (not (tptp.n2 H)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a290 (or (tptp.p3 tptp.b tptp.c tptp.b) (not (tptp.k2 tptp.c tptp.b))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a293 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.q3 E E) (not (tptp.p2 F E E)) (not (tptp.q3 F E)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a297 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.r3 G H H) (not (tptp.s2 H)) (not (tptp.l2 tptp.c G)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a301 (forall ((H $$unsorted)) (or (tptp.r3 H H H) (not (tptp.s2 H)))))
% 9.13/9.34 (assume a302 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.r3 F F F) (not (tptp.l2 G F)))))
% 9.13/9.34 (assume a303 (forall ((E $$unsorted)) (or (tptp.r3 E E E) (not (tptp.r2 E)))))
% 9.13/9.34 (assume a304 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a314 (forall ((J $$unsorted) (A $$unsorted) (B $$unsorted)) (or (tptp.l4 J) (not (tptp.p3 A B J)))))
% 9.13/9.34 (assume a315 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l4 H) (not (tptp.m0 I H H)) (not (tptp.l4 I)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a318 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n4 J A) (not (tptp.p3 J A A)) (not (tptp.n4 J J)))))
% 9.13/9.34 (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))))
% 9.13/9.34 (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))))
% 9.13/9.34 (assume a321 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n4 H H) (not (tptp.k4 I)) (not (tptp.m3 H H H)))))
% 9.13/9.34 (assume a322 (forall ((G $$unsorted) (H $$unsorted)) (or (tptp.p4 G G H) (not (tptp.r0 G)) (not (tptp.r3 H G H)))))
% 9.13/9.34 (assume a323 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.p4 D D D) (not (tptp.q3 E F)) (not (tptp.n3 D)))))
% 9.13/9.34 (assume a324 (forall ((B $$unsorted) (C $$unsorted)) (or (tptp.p4 B C B) (not (tptp.k3 B B C)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a328 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.p4 I I I) (not (tptp.p3 J J I)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a337 (forall ((E $$unsorted) (F $$unsorted) (G $$unsorted)) (or (tptp.k5 E) (not (tptp.s4 F)) (not (tptp.r3 G E E)))))
% 9.13/9.34 (assume a338 (or (tptp.k5 tptp.b) (not (tptp.s4 tptp.e)) (not (tptp.n1 tptp.b tptp.b tptp.b))))
% 9.13/9.34 (assume a339 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.l5 H) (not (tptp.q4 I I)) (not (tptp.k1 H)))))
% 9.13/9.34 (assume a340 (forall ((D $$unsorted) (E $$unsorted) (F $$unsorted)) (or (tptp.m5 D E) (not (tptp.r0 D)) (not (tptp.p4 D F E)))))
% 9.13/9.34 (assume a341 (forall ((C $$unsorted)) (or (tptp.m5 C C) (not (tptp.k4 C)))))
% 9.13/9.34 (assume a342 (forall ((B $$unsorted)) (or (tptp.m5 B B) (not (tptp.s4 B)) (not (tptp.m4 tptp.e tptp.e)))))
% 9.13/9.34 (assume a343 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.m5 J J) (not (tptp.s4 A)) (not (tptp.r0 J)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a345 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.n5 J J) (not (tptp.m0 A J A)) (not (tptp.n5 A J)))))
% 9.13/9.34 (assume a346 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.n5 H H) (not (tptp.n4 I H)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a348 (or (tptp.n5 tptp.d tptp.d) (not (tptp.p4 tptp.c tptp.d tptp.c))))
% 9.13/9.34 (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))))
% 9.13/9.34 (assume a350 (forall ((C $$unsorted) (D $$unsorted)) (or (tptp.n5 C C) (not (tptp.q4 D C)))))
% 9.13/9.34 (assume a351 (forall ((B $$unsorted)) (or (tptp.n5 B B) (not (tptp.r4 B)))))
% 9.13/9.34 (assume a352 (forall ((A $$unsorted)) (or (tptp.n5 A A) (not (tptp.s1 A)) (not (tptp.k4 A)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a355 (forall ((E $$unsorted) (F $$unsorted)) (or (tptp.p5 E E F) (not (tptp.s4 F)) (not (tptp.l2 E E)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a357 (forall ((I $$unsorted) (J $$unsorted) (A $$unsorted)) (or (tptp.p5 I J I) (not (tptp.q4 J A)) (not (tptp.s1 I)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a359 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.q5 J A) (not (tptp.s4 J)) (not (tptp.m2 A)))))
% 9.13/9.34 (assume a360 (or (tptp.q5 tptp.a tptp.a) (not (tptp.r4 tptp.a))))
% 9.13/9.34 (assume a361 (forall ((I $$unsorted)) (or (tptp.q5 I I) (not (tptp.l4 I)))))
% 9.13/9.34 (assume a362 (forall ((H $$unsorted)) (or (tptp.q5 H H) (not (tptp.q4 H H)))))
% 9.13/9.34 (assume a363 (forall ((G $$unsorted)) (or (tptp.q5 G G) (not (tptp.m4 G G)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a365 (forall ((B $$unsorted)) (or (tptp.r5 B B) (not (tptp.k4 B)))))
% 9.13/9.34 (assume a366 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.s5 H) (not (tptp.l4 H)) (not (tptp.r4 I)))))
% 9.13/9.34 (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)))))
% 9.13/9.34 (assume a368 (not (tptp.r3 tptp.c tptp.b tptp.c)))
% 9.13/9.34 (step t1 (cl (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) (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))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t2)
% 9.13/9.34 (assume t2.a0 (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)))))
% 9.13/9.34 (step t2.t1 (cl (or (not (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))))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule forall_inst :args ((:= J tptp.c) (:= A tptp.b) (:= B tptp.c)))
% 9.13/9.34 (step t2.t2 (cl (not (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))))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) :rule or :premises (t2.t1))
% 9.13/9.34 (step t2.t3 (cl (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t2.t2 t2.a0))
% 9.13/9.34 (step t2 (cl (not (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))))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) :rule subproof :discharge (t2.a0))
% 9.13/9.34 (step t3 (cl (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t1 t2))
% 9.13/9.34 (step t4 (cl (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) (not (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t5 (cl (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule resolution :premises (t3 t4))
% 9.13/9.34 (step t6 (cl (=> (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)))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule contraction :premises (t5))
% 9.13/9.34 (step t7 (cl (not (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))))) (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) :rule implies :premises (t6))
% 9.13/9.34 (step t8 (cl (not (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c)))) (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))) :rule or_pos)
% 9.13/9.34 (step t9 (cl (not (tptp.r2 tptp.c)) (not (tptp.k2 tptp.b tptp.c)) (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.r3 tptp.c tptp.c tptp.c)) (not (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule reordering :premises (t8))
% 9.13/9.34 (step t10 (cl (not (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))) :rule or_pos)
% 9.13/9.34 (step t11 (cl (not (tptp.l0 tptp.c)) (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))))) :rule reordering :premises (t10))
% 9.13/9.34 (step t12 (cl (not (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))) :rule or_pos)
% 9.13/9.34 (step t13 (cl (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)) (tptp.r1 tptp.c) (not (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))))) :rule reordering :premises (t12))
% 9.13/9.34 (step t14 (cl (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d)) (forall ((X $$unsorted)) (tptp.q0 X tptp.d))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t15)
% 9.13/9.34 (assume t15.a0 (forall ((X $$unsorted)) (tptp.q0 X tptp.d)))
% 9.13/9.34 (step t15.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.q0 X tptp.d))) (tptp.q0 tptp.c tptp.d))) :rule forall_inst :args ((:= X tptp.c)))
% 9.13/9.34 (step t15.t2 (cl (not (forall ((X $$unsorted)) (tptp.q0 X tptp.d))) (tptp.q0 tptp.c tptp.d)) :rule or :premises (t15.t1))
% 9.13/9.34 (step t15.t3 (cl (tptp.q0 tptp.c tptp.d)) :rule resolution :premises (t15.t2 t15.a0))
% 9.13/9.34 (step t15 (cl (not (forall ((X $$unsorted)) (tptp.q0 X tptp.d))) (tptp.q0 tptp.c tptp.d)) :rule subproof :discharge (t15.a0))
% 9.13/9.34 (step t16 (cl (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d)) (tptp.q0 tptp.c tptp.d)) :rule resolution :premises (t14 t15))
% 9.13/9.34 (step t17 (cl (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d)) (not (tptp.q0 tptp.c tptp.d))) :rule implies_neg2)
% 9.13/9.34 (step t18 (cl (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d)) (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d))) :rule resolution :premises (t16 t17))
% 9.13/9.34 (step t19 (cl (=> (forall ((X $$unsorted)) (tptp.q0 X tptp.d)) (tptp.q0 tptp.c tptp.d))) :rule contraction :premises (t18))
% 9.13/9.34 (step t20 (cl (not (forall ((X $$unsorted)) (tptp.q0 X tptp.d))) (tptp.q0 tptp.c tptp.d)) :rule implies :premises (t19))
% 9.13/9.34 (step t21 (cl (tptp.q0 tptp.c tptp.d) (not (forall ((X $$unsorted)) (tptp.q0 X tptp.d)))) :rule reordering :premises (t20))
% 9.13/9.34 (step t22 (cl (tptp.q0 tptp.c tptp.d)) :rule resolution :premises (t21 a16))
% 9.13/9.34 (step t23 (cl (tptp.q1 tptp.d tptp.d tptp.d) (not (tptp.k0 tptp.e)) (not (tptp.s0 tptp.d))) :rule or :premises (a154))
% 9.13/9.34 (step t24 (cl (not (tptp.s0 tptp.d)) (not (tptp.k0 tptp.e)) (tptp.q1 tptp.d tptp.d tptp.d)) :rule reordering :premises (t23))
% 9.13/9.34 (step t25 (cl (tptp.q1 tptp.d tptp.d tptp.d)) :rule resolution :premises (t24 a0 a27))
% 9.13/9.34 (step t26 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t27)
% 9.13/9.34 (assume t27.a0 (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))))
% 9.13/9.34 (step t27.t1 (cl (or (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))))) :rule forall_inst :args ((:= D tptp.c) (:= E tptp.d)))
% 9.13/9.34 (step t27.t2 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule or :premises (t27.t1))
% 9.13/9.34 (step t27.t3 (cl (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule resolution :premises (t27.t2 t27.a0))
% 9.13/9.34 (step t27 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule subproof :discharge (t27.a0))
% 9.13/9.34 (step t28 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule resolution :premises (t26 t27))
% 9.13/9.34 (step t29 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) (not (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))))) :rule implies_neg2)
% 9.13/9.34 (step t30 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))))) :rule resolution :premises (t28 t29))
% 9.13/9.34 (step t31 (cl (=> (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d))))) :rule contraction :premises (t30))
% 9.13/9.34 (step t32 (cl (not (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule implies :premises (t31))
% 9.13/9.34 (step t33 (cl (not (= (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)))) (or (not (tptp.s0 tptp.d)) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))))) (not (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))))) (or (not (tptp.s0 tptp.d)) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))))) :rule equiv_pos2)
% 9.13/9.34 (step t34 (cl (= (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)))) (or (not (tptp.s0 tptp.d)) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))))) :rule all_simplify)
% 9.13/9.34 (step t35 (cl (or (not (tptp.s0 tptp.d)) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d)))))) :rule resolution :premises (t33 t34 a161))
% 9.13/9.34 (step t36 (cl (not (tptp.s0 tptp.d)) (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) :rule or :premises (t35))
% 9.13/9.34 (step t37 (cl (forall ((D $$unsorted) (E $$unsorted)) (or (tptp.r1 D) (not (tptp.q0 D E)) (not (tptp.q1 tptp.d E tptp.d))))) :rule resolution :premises (t36 a0))
% 9.13/9.34 (step t38 (cl (or (tptp.r1 tptp.c) (not (tptp.q0 tptp.c tptp.d)) (not (tptp.q1 tptp.d tptp.d tptp.d)))) :rule resolution :premises (t32 t37))
% 9.13/9.34 (step t39 (cl (tptp.r1 tptp.c)) :rule resolution :premises (t13 t22 t25 t38))
% 9.13/9.34 (step t40 (cl (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t41)
% 9.13/9.34 (assume t41.a0 (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))))
% 9.13/9.34 (step t41.t1 (cl (or (not (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G))))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))))) :rule forall_inst :args ((:= G tptp.c)))
% 9.13/9.34 (step t41.t2 (cl (not (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G))))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule or :premises (t41.t1))
% 9.13/9.34 (step t41.t3 (cl (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule resolution :premises (t41.t2 t41.a0))
% 9.13/9.34 (step t41 (cl (not (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G))))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule subproof :discharge (t41.a0))
% 9.13/9.34 (step t42 (cl (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule resolution :premises (t40 t41))
% 9.13/9.34 (step t43 (cl (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) (not (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t44 (cl (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))))) :rule resolution :premises (t42 t43))
% 9.13/9.34 (step t45 (cl (=> (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G)))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c))))) :rule contraction :premises (t44))
% 9.13/9.34 (step t46 (cl (not (forall ((G $$unsorted)) (or (tptp.r2 G) (not (tptp.r1 G)) (not (tptp.l0 G))))) (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule implies :premises (t45))
% 9.13/9.34 (step t47 (cl (or (tptp.r2 tptp.c) (not (tptp.r1 tptp.c)) (not (tptp.l0 tptp.c)))) :rule resolution :premises (t46 a225))
% 9.13/9.34 (step t48 (cl (tptp.r2 tptp.c)) :rule resolution :premises (t11 a23 t39 t47))
% 9.13/9.34 (step t49 (cl (not (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))) :rule or_pos)
% 9.13/9.34 (step t50 (cl (not (tptp.k1 tptp.e)) (tptp.k2 tptp.b tptp.c) (not (tptp.k2 tptp.e tptp.c)) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))))) :rule reordering :premises (t49))
% 9.13/9.34 (step t51 (cl (not (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))) :rule or_pos)
% 9.13/9.34 (step t52 (cl (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)) (not (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))))) :rule reordering :premises (t51))
% 9.13/9.34 (step t53 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t54)
% 9.13/9.34 (assume t54.a0 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))))
% 9.13/9.34 (step t54.t1 (cl (or (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))))) :rule forall_inst :args ((:= I tptp.e) (:= J tptp.d)))
% 9.13/9.34 (step t54.t2 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule or :premises (t54.t1))
% 9.13/9.34 (step t54.t3 (cl (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule resolution :premises (t54.t2 t54.a0))
% 9.13/9.34 (step t54 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule subproof :discharge (t54.a0))
% 9.13/9.34 (step t55 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule resolution :premises (t53 t54))
% 9.13/9.34 (step t56 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) (not (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))))) :rule implies_neg2)
% 9.13/9.34 (step t57 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))))) :rule resolution :premises (t55 t56))
% 9.13/9.34 (step t58 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e))))) :rule contraction :premises (t57))
% 9.13/9.34 (step t59 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule implies :premises (t58))
% 9.13/9.34 (step t60 (cl (or (tptp.k1 tptp.e) (not (tptp.n0 tptp.d tptp.e)))) :rule resolution :premises (t59 a38))
% 9.13/9.34 (step t61 (cl (tptp.k1 tptp.e)) :rule resolution :premises (t52 a2 t60))
% 9.13/9.34 (step t62 (cl (not (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))) :rule or_pos)
% 9.13/9.34 (step t63 (cl (not (tptp.k1 tptp.c)) (tptp.k2 tptp.e tptp.c) (not (tptp.k2 tptp.c tptp.c)) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))))) :rule reordering :premises (t62))
% 9.13/9.34 (step t64 (cl (not (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))) :rule or_pos)
% 9.13/9.34 (step t65 (cl (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)) (not (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))))) :rule reordering :premises (t64))
% 9.13/9.34 (step t66 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t67)
% 9.13/9.34 (assume t67.a0 (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))))
% 9.13/9.34 (step t67.t1 (cl (or (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))))) :rule forall_inst :args ((:= I tptp.c) (:= J tptp.d)))
% 9.13/9.34 (step t67.t2 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule or :premises (t67.t1))
% 9.13/9.34 (step t67.t3 (cl (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule resolution :premises (t67.t2 t67.a0))
% 9.13/9.34 (step t67 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule subproof :discharge (t67.a0))
% 9.13/9.34 (step t68 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule resolution :premises (t66 t67))
% 9.13/9.34 (step t69 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) (not (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t70 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))))) :rule resolution :premises (t68 t69))
% 9.13/9.34 (step t71 (cl (=> (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I)))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c))))) :rule contraction :premises (t70))
% 9.13/9.34 (step t72 (cl (not (forall ((I $$unsorted) (J $$unsorted)) (or (tptp.k1 I) (not (tptp.n0 J I))))) (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule implies :premises (t71))
% 9.13/9.34 (step t73 (cl (or (tptp.k1 tptp.c) (not (tptp.n0 tptp.d tptp.c)))) :rule resolution :premises (t72 a38))
% 9.13/9.34 (step t74 (cl (tptp.k1 tptp.c)) :rule resolution :premises (t65 a25 t73))
% 9.13/9.34 (step t75 (cl (not (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))) :rule or_pos)
% 9.13/9.34 (step t76 (cl (not (tptp.q1 tptp.b tptp.c tptp.c)) (tptp.k2 tptp.c tptp.c) (not (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))))) :rule reordering :premises (t75))
% 9.13/9.34 (step t77 (cl (not (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))) :rule or_pos)
% 9.13/9.34 (step t78 (cl (not (tptp.p0 tptp.c tptp.b)) (tptp.q1 tptp.b tptp.c tptp.c) (not (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))))) :rule reordering :premises (t77))
% 9.13/9.34 (step t79 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t80)
% 9.13/9.34 (assume t80.a0 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))))
% 9.13/9.34 (step t80.t1 (cl (or (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F))))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))))) :rule forall_inst :args ((:= F tptp.b) (:= G tptp.c)))
% 9.13/9.34 (step t80.t2 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F))))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule or :premises (t80.t1))
% 9.13/9.34 (step t80.t3 (cl (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule resolution :premises (t80.t2 t80.a0))
% 9.13/9.34 (step t80 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F))))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule subproof :discharge (t80.a0))
% 9.13/9.34 (step t81 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule resolution :premises (t79 t80))
% 9.13/9.34 (step t82 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) (not (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))))) :rule implies_neg2)
% 9.13/9.34 (step t83 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))))) :rule resolution :premises (t81 t82))
% 9.13/9.34 (step t84 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F)))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b))))) :rule contraction :premises (t83))
% 9.13/9.34 (step t85 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.q1 F G G) (not (tptp.p0 G F))))) (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule implies :premises (t84))
% 9.13/9.34 (step t86 (cl (or (tptp.q1 tptp.b tptp.c tptp.c) (not (tptp.p0 tptp.c tptp.b)))) :rule resolution :premises (t85 a132))
% 9.13/9.34 (step t87 (cl (tptp.q1 tptp.b tptp.c tptp.c)) :rule resolution :premises (t78 a17 t86))
% 9.13/9.34 (step t88 (cl (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t89)
% 9.13/9.34 (assume t89.a0 (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))))
% 9.13/9.34 (step t89.t1 (cl (or (not (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J))))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))))) :rule forall_inst :args ((:= J tptp.c) (:= A tptp.b)))
% 9.13/9.34 (step t89.t2 (cl (not (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J))))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule or :premises (t89.t1))
% 9.13/9.34 (step t89.t3 (cl (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t89.t2 t89.a0))
% 9.13/9.34 (step t89 (cl (not (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J))))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule subproof :discharge (t89.a0))
% 9.13/9.34 (step t90 (cl (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t88 t89))
% 9.13/9.34 (step t91 (cl (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) (not (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t92 (cl (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))))) :rule resolution :premises (t90 t91))
% 9.13/9.34 (step t93 (cl (=> (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J)))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c))))) :rule contraction :premises (t92))
% 9.13/9.34 (step t94 (cl (not (forall ((J $$unsorted) (A $$unsorted)) (or (tptp.k2 J J) (not (tptp.q1 A J J))))) (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule implies :premises (t93))
% 9.13/9.34 (step t95 (cl (or (tptp.k2 tptp.c tptp.c) (not (tptp.q1 tptp.b tptp.c tptp.c)))) :rule resolution :premises (t94 a166))
% 9.13/9.34 (step t96 (cl (tptp.k2 tptp.c tptp.c)) :rule resolution :premises (t76 t87 t95))
% 9.13/9.34 (step t97 (cl (not (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))) :rule or_pos)
% 9.13/9.34 (step t98 (cl (not (tptp.r0 tptp.e)) (not (tptp.p0 tptp.b tptp.c)) (tptp.m1 tptp.e tptp.c tptp.e) (not (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))))) :rule reordering :premises (t97))
% 9.13/9.34 (step t99 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t100)
% 9.13/9.34 (assume t100.a0 (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))))
% 9.13/9.34 (step t100.t1 (cl (or (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G))))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))))) :rule forall_inst :args ((:= G tptp.e) (:= H tptp.c) (:= I tptp.b)))
% 9.13/9.34 (step t100.t2 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G))))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule or :premises (t100.t1))
% 9.13/9.34 (step t100.t3 (cl (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule resolution :premises (t100.t2 t100.a0))
% 9.13/9.34 (step t100 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G))))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule subproof :discharge (t100.a0))
% 9.13/9.34 (step t101 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule resolution :premises (t99 t100))
% 9.13/9.34 (step t102 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) (not (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))))) :rule implies_neg2)
% 9.13/9.34 (step t103 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))))) :rule resolution :premises (t101 t102))
% 9.13/9.34 (step t104 (cl (=> (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G)))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e))))) :rule contraction :premises (t103))
% 9.13/9.34 (step t105 (cl (not (forall ((G $$unsorted) (H $$unsorted) (I $$unsorted)) (or (tptp.m1 G H G) (not (tptp.p0 I H)) (not (tptp.r0 G))))) (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule implies :premises (t104))
% 9.13/9.34 (step t106 (cl (or (tptp.m1 tptp.e tptp.c tptp.e) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.r0 tptp.e)))) :rule resolution :premises (t105 a44))
% 9.13/9.34 (step t107 (cl (tptp.m1 tptp.e tptp.c tptp.e)) :rule resolution :premises (t98 a12 a21 t106))
% 9.13/9.34 (step t108 (cl (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) (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))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t109)
% 9.13/9.34 (assume t109.a0 (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)))))
% 9.13/9.34 (step t109.t1 (cl (or (not (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))))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))))) :rule forall_inst :args ((:= C tptp.e) (:= D tptp.c) (:= E tptp.e) (:= F tptp.c)))
% 9.13/9.34 (step t109.t2 (cl (not (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))))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule or :premises (t109.t1))
% 9.13/9.34 (step t109.t3 (cl (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule resolution :premises (t109.t2 t109.a0))
% 9.13/9.34 (step t109 (cl (not (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))))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule subproof :discharge (t109.a0))
% 9.13/9.34 (step t110 (cl (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule resolution :premises (t108 t109))
% 9.13/9.34 (step t111 (cl (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) (not (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t112 (cl (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))))) :rule resolution :premises (t110 t111))
% 9.13/9.34 (step t113 (cl (=> (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)))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c))))) :rule contraction :premises (t112))
% 9.13/9.34 (step t114 (cl (not (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))))) (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule implies :premises (t113))
% 9.13/9.34 (step t115 (cl (or (tptp.k2 tptp.e tptp.c) (not (tptp.m1 tptp.e tptp.c tptp.e)) (not (tptp.k1 tptp.c)) (not (tptp.k2 tptp.c tptp.c)))) :rule resolution :premises (t114 a164))
% 9.13/9.34 (step t116 (cl (tptp.k2 tptp.e tptp.c)) :rule resolution :premises (t63 t74 t96 t107 t115))
% 9.13/9.34 (step t117 (cl (not (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))) :rule or_pos)
% 9.13/9.34 (step t118 (cl (not (tptp.s0 tptp.b)) (not (tptp.p0 tptp.b tptp.c)) (tptp.m1 tptp.b tptp.c tptp.b) (not (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))))) :rule reordering :premises (t117))
% 9.13/9.34 (step t119 (cl (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t120)
% 9.13/9.34 (assume t120.a0 (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))))
% 9.13/9.34 (step t120.t1 (cl (or (not (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H))))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))))) :rule forall_inst :args ((:= H tptp.b) (:= I tptp.c)))
% 9.13/9.34 (step t120.t2 (cl (not (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H))))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule or :premises (t120.t1))
% 9.13/9.34 (step t120.t3 (cl (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule resolution :premises (t120.t2 t120.a0))
% 9.13/9.34 (step t120 (cl (not (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H))))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule subproof :discharge (t120.a0))
% 9.13/9.34 (step t121 (cl (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule resolution :premises (t119 t120))
% 9.13/9.34 (step t122 (cl (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) (not (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))))) :rule implies_neg2)
% 9.13/9.34 (step t123 (cl (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))))) :rule resolution :premises (t121 t122))
% 9.13/9.34 (step t124 (cl (=> (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H)))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b))))) :rule contraction :premises (t123))
% 9.13/9.34 (step t125 (cl (not (forall ((H $$unsorted) (I $$unsorted)) (or (tptp.m1 H I H) (not (tptp.p0 H I)) (not (tptp.s0 H))))) (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule implies :premises (t124))
% 9.13/9.34 (step t126 (cl (or (tptp.m1 tptp.b tptp.c tptp.b) (not (tptp.p0 tptp.b tptp.c)) (not (tptp.s0 tptp.b)))) :rule resolution :premises (t125 a66))
% 9.13/9.34 (step t127 (cl (tptp.m1 tptp.b tptp.c tptp.b)) :rule resolution :premises (t118 a4 a21 t126))
% 9.13/9.34 (step t128 (cl (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) (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))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t129)
% 9.13/9.34 (assume t129.a0 (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)))))
% 9.13/9.34 (step t129.t1 (cl (or (not (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))))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))))) :rule forall_inst :args ((:= C tptp.b) (:= D tptp.c) (:= E tptp.b) (:= F tptp.e)))
% 9.13/9.34 (step t129.t2 (cl (not (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))))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule or :premises (t129.t1))
% 9.13/9.34 (step t129.t3 (cl (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule resolution :premises (t129.t2 t129.a0))
% 9.13/9.34 (step t129 (cl (not (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))))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule subproof :discharge (t129.a0))
% 9.13/9.34 (step t130 (cl (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule resolution :premises (t128 t129))
% 9.13/9.34 (step t131 (cl (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) (not (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t132 (cl (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))))) :rule resolution :premises (t130 t131))
% 9.13/9.34 (step t133 (cl (=> (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)))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c))))) :rule contraction :premises (t132))
% 9.13/9.34 (step t134 (cl (not (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))))) (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule implies :premises (t133))
% 9.13/9.34 (step t135 (cl (or (tptp.k2 tptp.b tptp.c) (not (tptp.m1 tptp.b tptp.c tptp.b)) (not (tptp.k1 tptp.e)) (not (tptp.k2 tptp.e tptp.c)))) :rule resolution :premises (t134 a164))
% 9.13/9.34 (step t136 (cl (tptp.k2 tptp.b tptp.c)) :rule resolution :premises (t50 t61 t116 t127 t135))
% 9.13/9.34 (step t137 (cl (not (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))) :rule or_pos)
% 9.13/9.34 (step t138 (cl (not (tptp.p2 tptp.c tptp.c tptp.c)) (tptp.r3 tptp.c tptp.c tptp.c) (not (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))))) :rule reordering :premises (t137))
% 9.13/9.34 (step t139 (cl (not (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))) :rule or_pos)
% 9.13/9.34 (step t140 (cl (not (tptp.m1 tptp.c tptp.c tptp.c)) (tptp.p2 tptp.c tptp.c tptp.c) (not (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))))) :rule reordering :premises (t139))
% 9.13/9.34 (step t141 (cl (tptp.m1 tptp.c tptp.c tptp.c) (not (tptp.l0 tptp.c))) :rule or :premises (a57))
% 9.13/9.34 (step t142 (cl (tptp.m1 tptp.c tptp.c tptp.c)) :rule resolution :premises (t141 a23))
% 9.13/9.34 (step t143 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t144)
% 9.13/9.34 (assume t144.a0 (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))))
% 9.13/9.34 (step t144.t1 (cl (or (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F))))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))))) :rule forall_inst :args ((:= F tptp.c) (:= G tptp.c)))
% 9.13/9.34 (step t144.t2 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F))))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule or :premises (t144.t1))
% 9.13/9.34 (step t144.t3 (cl (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t144.t2 t144.a0))
% 9.13/9.34 (step t144 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F))))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule subproof :discharge (t144.a0))
% 9.13/9.34 (step t145 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t143 t144))
% 9.13/9.34 (step t146 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) (not (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t147 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))))) :rule resolution :premises (t145 t146))
% 9.13/9.34 (step t148 (cl (=> (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F)))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c))))) :rule contraction :premises (t147))
% 9.13/9.34 (step t149 (cl (not (forall ((F $$unsorted) (G $$unsorted)) (or (tptp.p2 F F F) (not (tptp.m1 G G F))))) (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule implies :premises (t148))
% 9.13/9.34 (step t150 (cl (or (tptp.p2 tptp.c tptp.c tptp.c) (not (tptp.m1 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t149 a187))
% 9.13/9.34 (step t151 (cl (tptp.p2 tptp.c tptp.c tptp.c)) :rule resolution :premises (t140 t142 t150))
% 9.13/9.34 (step t152 (cl (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C))))) :rule implies_neg1)
% 9.13/9.34 (anchor :step t153)
% 9.13/9.34 (assume t153.a0 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))))
% 9.13/9.34 (step t153.t1 (cl (or (not (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C))))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))))) :rule forall_inst :args ((:= B tptp.c) (:= C tptp.c) (:= D tptp.c)))
% 9.13/9.34 (step t153.t2 (cl (not (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C))))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule or :premises (t153.t1))
% 9.13/9.34 (step t153.t3 (cl (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t153.t2 t153.a0))
% 9.13/9.34 (step t153 (cl (not (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C))))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule subproof :discharge (t153.a0))
% 9.13/9.34 (step t154 (cl (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t152 t153))
% 9.13/9.34 (step t155 (cl (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) (not (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))))) :rule implies_neg2)
% 9.13/9.34 (step t156 (cl (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))))) :rule resolution :premises (t154 t155))
% 9.13/9.34 (step t157 (cl (=> (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C)))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c))))) :rule contraction :premises (t156))
% 9.13/9.34 (step t158 (cl (not (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (tptp.r3 B C B) (not (tptp.p2 B D C))))) (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule implies :premises (t157))
% 9.13/9.34 (step t159 (cl (or (tptp.r3 tptp.c tptp.c tptp.c) (not (tptp.p2 tptp.c tptp.c tptp.c)))) :rule resolution :premises (t158 a304))
% 9.13/9.34 (step t160 (cl (tptp.r3 tptp.c tptp.c tptp.c)) :rule resolution :premises (t138 t151 t159))
% 9.13/9.34 (step t161 (cl (not (or (tptp.r3 tptp.c tptp.b tptp.c) (not (tptp.k2 tptp.b tptp.c)) (not (tptp.r2 tptp.c)) (not (tptp.r3 tptp.c tptp.c tptp.c))))) :rule resolution :premises (t9 t48 t136 a368 t160))
% 9.13/9.34 (step t162 (cl) :rule resolution :premises (t7 t161 a309))
% 9.13/9.34
% 9.13/9.35 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.vdqqYyhp7E/cvc5---1.0.5_22810.smt2
% 9.13/9.35 % cvc5---1.0.5 exiting
% 9.13/9.36 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------