%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWV069+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n025.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:04:25 EDT 2024

% Result   : Theorem 0.40s 0.65s
% Output   : Proof 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : SWV069+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.07/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.36  % Computer : n025.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 300
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Mon May 27 00:07:39 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.38/0.54  %----Proving TF0_NAR, FOF, or CNF
% 0.40/0.65  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.40/0.65  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.KiFTavHO9o/cvc5---1.0.5_27201.smt2
% 0.40/0.65  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.KiFTavHO9o/cvc5---1.0.5_27201.smt2
% 0.40/0.65  (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))))
% 0.40/0.65  (assume a1 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))))
% 0.40/0.65  (assume a2 (forall ((X $$unsorted)) (not (tptp.gt X X))))
% 0.40/0.65  (assume a3 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.40/0.65  (assume a4 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.leq X Y) (tptp.leq Y Z)) (tptp.leq X Z))))
% 0.40/0.65  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))))
% 0.40/0.65  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))))
% 0.40/0.65  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))))
% 0.40/0.65  (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))))
% 0.40/0.65  (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))))
% 0.40/0.65  (assume a10 (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)))
% 0.40/0.65  (assume a11 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))))
% 0.40/0.65  (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.40/0.65  (assume a13 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))))
% 0.40/0.65  (assume a14 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq tptp.n0 (tptp.uniform_int_rnd C X)))))
% 0.40/0.65  (assume a15 (forall ((I $$unsorted) (L $$unsorted) (U $$unsorted) (Val $$unsorted)) (=> (and (tptp.leq L I) (tptp.leq I U)) (= (tptp.a_select2 (tptp.tptp_const_array1 (tptp.dim L U) Val) I) Val))))
% 0.40/0.65  (assume a16 (forall ((I $$unsorted) (L1 $$unsorted) (U1 $$unsorted) (J $$unsorted) (L2 $$unsorted) (U2 $$unsorted) (Val $$unsorted)) (=> (and (tptp.leq L1 I) (tptp.leq I U1) (tptp.leq L2 J) (tptp.leq J U2)) (= (tptp.a_select3 (tptp.tptp_const_array2 (tptp.dim L1 U1) (tptp.dim L2 U2) Val) I J) Val))))
% 0.40/0.65  (assume a17 (forall ((A $$unsorted) (N $$unsorted)) (=> (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.trans A) I J) (tptp.a_select3 (tptp.trans A) J I)))))))
% 0.40/0.65  (assume a18 (forall ((A $$unsorted) (N $$unsorted)) (=> (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.inv A) I J) (tptp.a_select3 (tptp.inv A) J I)))))))
% 0.40/0.65  (assume a19 (forall ((A $$unsorted) (N $$unsorted)) (=> (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted) (K $$unsorted) (VAL $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N) (tptp.leq tptp.n0 K) (tptp.leq K N)) (= (tptp.a_select3 (tptp.tptp_update3 A K K VAL) I J) (tptp.a_select3 (tptp.tptp_update3 A K K VAL) J I)))))))
% 0.40/0.65  (assume a20 (forall ((A $$unsorted) (B $$unsorted) (N $$unsorted)) (=> (and (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 B I J) (tptp.a_select3 B J I))))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.tptp_madd A B) I J) (tptp.a_select3 (tptp.tptp_madd A B) J I)))))))
% 0.40/0.65  (assume a21 (forall ((A $$unsorted) (B $$unsorted) (N $$unsorted)) (=> (and (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 B I J) (tptp.a_select3 B J I))))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.tptp_msub A B) I J) (tptp.a_select3 (tptp.tptp_msub A B) J I)))))))
% 0.40/0.65  (assume a22 (forall ((A $$unsorted) (B $$unsorted) (N $$unsorted)) (=> (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 B I J) (tptp.a_select3 B J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))) I J) (tptp.a_select3 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))) J I)))))))
% 0.40/0.65  (assume a23 (forall ((A $$unsorted) (B $$unsorted) (N $$unsorted) (M $$unsorted)) (=> (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I M) (tptp.leq tptp.n0 J) (tptp.leq J M)) (= (tptp.a_select3 B I J) (tptp.a_select3 B J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))) I J) (tptp.a_select3 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))) J I)))))))
% 0.40/0.65  (assume a24 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted) (F $$unsorted) (N $$unsorted) (M $$unsorted)) (=> (and (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I M) (tptp.leq tptp.n0 J) (tptp.leq J M)) (= (tptp.a_select3 D I J) (tptp.a_select3 D J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 A I J) (tptp.a_select3 A J I)))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 F I J) (tptp.a_select3 F J I))))) (forall ((I $$unsorted) (J $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 (tptp.tptp_madd A (tptp.tptp_mmul B (tptp.tptp_mmul (tptp.tptp_madd (tptp.tptp_mmul C (tptp.tptp_mmul D (tptp.trans C))) (tptp.tptp_mmul E (tptp.tptp_mmul F (tptp.trans E)))) (tptp.trans B)))) I J) (tptp.a_select3 (tptp.tptp_madd A (tptp.tptp_mmul B (tptp.tptp_mmul (tptp.tptp_madd (tptp.tptp_mmul C (tptp.tptp_mmul D (tptp.trans C))) (tptp.tptp_mmul E (tptp.tptp_mmul F (tptp.trans E)))) (tptp.trans B)))) J I)))))))
% 0.40/0.65  (assume a25 (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)))
% 0.40/0.65  (assume a26 (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))))
% 0.40/0.65  (assume a27 (= (tptp.succ tptp.tptp_minus_1) tptp.n0))
% 0.40/0.65  (assume a28 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))))
% 0.40/0.65  (assume a29 (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))))
% 0.40/0.65  (assume a30 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))))
% 0.40/0.65  (assume a31 (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))))
% 0.40/0.65  (assume a32 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.40/0.65  (assume a33 (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.40/0.65  (assume a34 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.40/0.65  (assume a35 (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.40/0.65  (assume a36 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.40/0.65  (assume a37 (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.40/0.65  (assume a38 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.40/0.65  (assume a39 (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)))
% 0.40/0.65  (assume a40 (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)))
% 0.40/0.65  (assume a41 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))))
% 0.40/0.65  (assume a42 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))))
% 0.40/0.65  (assume a43 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))))
% 0.40/0.65  (assume a44 (forall ((X $$unsorted) (U $$unsorted) (V $$unsorted) (VAL $$unsorted)) (= (tptp.a_select3 (tptp.tptp_update3 X U V VAL) U V) VAL)))
% 0.40/0.65  (assume a45 (forall ((I $$unsorted) (J $$unsorted) (U $$unsorted) (V $$unsorted) (X $$unsorted) (VAL $$unsorted) (VAL2 $$unsorted)) (=> (and (not (= I U)) (= J V) (= (tptp.a_select3 X U V) VAL)) (= (tptp.a_select3 (tptp.tptp_update3 X I J VAL2) U V) VAL))))
% 0.40/0.65  (assume a46 (forall ((I $$unsorted) (J $$unsorted) (U $$unsorted) (V $$unsorted) (X $$unsorted) (VAL $$unsorted)) (=> (and (forall ((I0 $$unsorted) (J0 $$unsorted)) (=> (and (tptp.leq tptp.n0 I0) (tptp.leq tptp.n0 J0) (tptp.leq I0 U) (tptp.leq J0 V)) (= (tptp.a_select3 X I0 J0) VAL))) (tptp.leq tptp.n0 I) (tptp.leq I U) (tptp.leq tptp.n0 J) (tptp.leq J V)) (= (tptp.a_select3 (tptp.tptp_update3 X U V VAL) I J) VAL))))
% 0.40/0.65  (assume a47 (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)))
% 0.40/0.65  (assume a48 (forall ((I $$unsorted) (U $$unsorted) (X $$unsorted) (VAL $$unsorted) (VAL2 $$unsorted)) (=> (and (not (= I U)) (= (tptp.a_select2 X U) VAL)) (= (tptp.a_select2 (tptp.tptp_update2 X I VAL2) U) VAL))))
% 0.40/0.65  (assume a49 (forall ((I $$unsorted) (U $$unsorted) (X $$unsorted) (VAL $$unsorted)) (=> (and (forall ((I0 $$unsorted)) (=> (and (tptp.leq tptp.n0 I0) (tptp.leq I0 U)) (= (tptp.a_select2 X I0) VAL))) (tptp.leq tptp.n0 I) (tptp.leq I U)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) I) VAL))))
% 0.40/0.65  (assume a50 tptp.true)
% 0.40/0.65  (assume a51 (not (= tptp.def tptp.use)))
% 0.40/0.65  (assume a52 (not (=> (and (tptp.leq tptp.n0 tptp.pv10) (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1))) (and (tptp.leq tptp.n0 tptp.n0) (tptp.leq tptp.n0 tptp.pv10) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)) (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1))))))
% 0.40/0.65  (assume a53 (tptp.gt tptp.n5 tptp.n4))
% 0.40/0.65  (assume a54 (tptp.gt tptp.n135300 tptp.n4))
% 0.40/0.65  (assume a55 (tptp.gt tptp.n135300 tptp.n5))
% 0.40/0.65  (assume a56 (tptp.gt tptp.n4 tptp.tptp_minus_1))
% 0.40/0.65  (assume a57 (tptp.gt tptp.n5 tptp.tptp_minus_1))
% 0.40/0.65  (assume a58 (tptp.gt tptp.n135300 tptp.tptp_minus_1))
% 0.40/0.65  (assume a59 (tptp.gt tptp.n0 tptp.tptp_minus_1))
% 0.40/0.65  (assume a60 (tptp.gt tptp.n1 tptp.tptp_minus_1))
% 0.40/0.65  (assume a61 (tptp.gt tptp.n2 tptp.tptp_minus_1))
% 0.40/0.65  (assume a62 (tptp.gt tptp.n3 tptp.tptp_minus_1))
% 0.40/0.65  (assume a63 (tptp.gt tptp.n4 tptp.n0))
% 0.40/0.65  (assume a64 (tptp.gt tptp.n5 tptp.n0))
% 0.40/0.65  (assume a65 (tptp.gt tptp.n135300 tptp.n0))
% 0.40/0.65  (assume a66 (tptp.gt tptp.n1 tptp.n0))
% 0.40/0.65  (assume a67 (tptp.gt tptp.n2 tptp.n0))
% 0.40/0.65  (assume a68 (tptp.gt tptp.n3 tptp.n0))
% 0.40/0.65  (assume a69 (tptp.gt tptp.n4 tptp.n1))
% 0.40/0.65  (assume a70 (tptp.gt tptp.n5 tptp.n1))
% 0.40/0.65  (assume a71 (tptp.gt tptp.n135300 tptp.n1))
% 0.40/0.65  (assume a72 (tptp.gt tptp.n2 tptp.n1))
% 0.40/0.65  (assume a73 (tptp.gt tptp.n3 tptp.n1))
% 0.40/0.65  (assume a74 (tptp.gt tptp.n4 tptp.n2))
% 0.40/0.65  (assume a75 (tptp.gt tptp.n5 tptp.n2))
% 0.40/0.65  (assume a76 (tptp.gt tptp.n135300 tptp.n2))
% 0.40/0.65  (assume a77 (tptp.gt tptp.n3 tptp.n2))
% 0.40/0.65  (assume a78 (tptp.gt tptp.n4 tptp.n3))
% 0.40/0.65  (assume a79 (tptp.gt tptp.n5 tptp.n3))
% 0.40/0.65  (assume a80 (tptp.gt tptp.n135300 tptp.n3))
% 0.40/0.65  (assume a81 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n4)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3) (= X tptp.n4)))))
% 0.40/0.65  (assume a82 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n5)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3) (= X tptp.n4) (= X tptp.n5)))))
% 0.40/0.65  (assume a83 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))))
% 0.40/0.65  (assume a84 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))))
% 0.40/0.65  (assume a85 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n2)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2)))))
% 0.40/0.65  (assume a86 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n3)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3)))))
% 0.40/0.65  (assume a87 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4))
% 0.40/0.65  (assume a88 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5))
% 0.40/0.65  (assume a89 (= (tptp.succ tptp.n0) tptp.n1))
% 0.40/0.65  (assume a90 (= (tptp.succ (tptp.succ tptp.n0)) tptp.n2))
% 0.40/0.65  (assume a91 (= (tptp.succ (tptp.succ (tptp.succ tptp.n0))) tptp.n3))
% 0.40/0.65  (assume a92 true)
% 0.40/0.65  (step t1 (cl (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule and_neg)
% 0.40/0.65  (step t2 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t3)
% 0.40/0.65  (assume t3.a0 (tptp.gt tptp.n4 tptp.n0))
% 0.40/0.65  (assume t3.a1 (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))
% 0.40/0.65  (assume t3.a2 (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))
% 0.40/0.65  (assume t3.a3 (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))
% 0.40/0.65  (assume t3.a4 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))
% 0.40/0.65  (step t3.t1 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t3.t2)
% 0.40/0.65  (assume t3.t2.a0 (tptp.gt tptp.n4 tptp.n0))
% 0.40/0.65  (assume t3.t2.a1 (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))
% 0.40/0.65  (assume t3.t2.a2 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))
% 0.40/0.65  (assume t3.t2.a3 (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))
% 0.40/0.65  (assume t3.t2.a4 (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))
% 0.40/0.65  (step t3.t2.t1 (cl (= (= (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) true) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule equiv_simplify)
% 0.40/0.65  (step t3.t2.t2 (cl (not (= (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) true)) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule equiv1 :premises (t3.t2.t1))
% 0.40/0.65  (step t3.t2.t3 (cl (= (tptp.pred tptp.n5) (tptp.minus tptp.n5 tptp.n1))) :rule symm :premises (t3.t2.a4))
% 0.40/0.65  (step t3.t2.t4 (cl (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule symm :premises (t3.t2.t3))
% 0.40/0.65  (step t3.t2.t5 (cl (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5)) :rule symm :premises (t3.t2.a3))
% 0.40/0.65  (step t3.t2.t6 (cl (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) :rule symm :premises (t3.t2.t5))
% 0.40/0.65  (step t3.t2.t7 (cl (= (tptp.pred tptp.n5) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule cong :premises (t3.t2.t6))
% 0.40/0.65  (step t3.t2.t8 (cl (= (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) :rule symm :premises (t3.t2.a2))
% 0.40/0.65  (step t3.t2.t9 (cl (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4)) :rule symm :premises (t3.t2.a1))
% 0.40/0.65  (step t3.t2.t10 (cl (= (tptp.minus tptp.n5 tptp.n1) tptp.n4)) :rule trans :premises (t3.t2.t4 t3.t2.t7 t3.t2.t8 t3.t2.t9))
% 0.40/0.65  (step t3.t2.t11 (cl (= tptp.n0 tptp.n0)) :rule refl)
% 0.40/0.65  (step t3.t2.t12 (cl (= (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) (tptp.gt tptp.n4 tptp.n0))) :rule cong :premises (t3.t2.t10 t3.t2.t11))
% 0.40/0.65  (step t3.t2.t13 (cl (= (= (tptp.gt tptp.n4 tptp.n0) true) (tptp.gt tptp.n4 tptp.n0))) :rule equiv_simplify)
% 0.40/0.65  (step t3.t2.t14 (cl (= (tptp.gt tptp.n4 tptp.n0) true) (not (tptp.gt tptp.n4 tptp.n0))) :rule equiv2 :premises (t3.t2.t13))
% 0.40/0.65  (step t3.t2.t15 (cl (= (tptp.gt tptp.n4 tptp.n0) true)) :rule resolution :premises (t3.t2.t14 t3.t2.a0))
% 0.40/0.65  (step t3.t2.t16 (cl (= (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) true)) :rule trans :premises (t3.t2.t12 t3.t2.t15))
% 0.40/0.65  (step t3.t2.t17 (cl (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule resolution :premises (t3.t2.t2 t3.t2.t16))
% 0.40/0.65  (step t3.t2 (cl (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule subproof :discharge (t3.t2.a0 t3.t2.a1 t3.t2.a2 t3.t2.a3 t3.t2.a4))
% 0.40/0.65  (step t3.t3 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (tptp.gt tptp.n4 tptp.n0)) :rule and_pos)
% 0.40/0.65  (step t3.t4 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) :rule and_pos)
% 0.40/0.65  (step t3.t5 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule and_pos)
% 0.40/0.65  (step t3.t6 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) :rule and_pos)
% 0.40/0.65  (step t3.t7 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule and_pos)
% 0.40/0.65  (step t3.t8 (cl (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))))) :rule resolution :premises (t3.t2 t3.t3 t3.t4 t3.t5 t3.t6 t3.t7))
% 0.40/0.65  (step t3.t9 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule reordering :premises (t3.t8))
% 0.40/0.65  (step t3.t10 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule contraction :premises (t3.t9))
% 0.40/0.65  (step t3.t11 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule resolution :premises (t3.t1 t3.t10))
% 0.40/0.65  (step t3.t12 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule implies_neg2)
% 0.40/0.65  (step t3.t13 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule resolution :premises (t3.t11 t3.t12))
% 0.40/0.65  (step t3.t14 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule contraction :premises (t3.t13))
% 0.40/0.65  (step t3.t15 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule implies :premises (t3.t14))
% 0.40/0.65  (step t3.t16 (cl (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule and_neg)
% 0.40/0.65  (step t3.t17 (cl (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule resolution :premises (t3.t16 t3.a0 t3.a1 t3.a4 t3.a2 t3.a3))
% 0.40/0.65  (step t3.t18 (cl (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule resolution :premises (t3.t15 t3.t17))
% 0.40/0.65  (step t3 (cl (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule subproof :discharge (t3.a0 t3.a1 t3.a2 t3.a3 t3.a4))
% 0.40/0.65  (step t4 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (tptp.gt tptp.n4 tptp.n0)) :rule and_pos)
% 0.40/0.65  (step t5 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) :rule and_pos)
% 0.40/0.65  (step t6 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) :rule and_pos)
% 0.40/0.65  (step t7 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule and_pos)
% 0.40/0.65  (step t8 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule and_pos)
% 0.40/0.65  (step t9 (cl (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))))) :rule resolution :premises (t3 t4 t5 t6 t7 t8))
% 0.40/0.65  (step t10 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule reordering :premises (t9))
% 0.40/0.65  (step t11 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule contraction :premises (t10))
% 0.40/0.65  (step t12 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule resolution :premises (t2 t11))
% 0.40/0.65  (step t13 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule implies_neg2)
% 0.40/0.65  (step t14 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule resolution :premises (t12 t13))
% 0.40/0.65  (step t15 (cl (=> (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule contraction :premises (t14))
% 0.40/0.65  (step t16 (cl (not (and (tptp.gt tptp.n4 tptp.n0) (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule implies :premises (t15))
% 0.40/0.65  (step t17 (cl (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) :rule resolution :premises (t1 t16))
% 0.40/0.65  (step t18 (cl (not (tptp.gt tptp.n4 tptp.n0)) (not (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) (not (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule reordering :premises (t17))
% 0.40/0.65  (step t19 (cl (not (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))) :rule or_pos)
% 0.40/0.65  (step t20 (cl (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)) (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (not (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))))) :rule reordering :premises (t19))
% 0.40/0.65  (step t21 (cl (not (and (tptp.leq tptp.n0 tptp.n0) (tptp.leq tptp.n0 tptp.pv10) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)) (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1))))) :rule not_implies2 :premises (a52))
% 0.40/0.65  (step t22 (cl (not (tptp.leq tptp.n0 tptp.n0)) (not (tptp.leq tptp.n0 tptp.pv10)) (not (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))) (not (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1)))) :rule not_and :premises (t21))
% 0.40/0.65  (step t23 (cl (not (tptp.leq tptp.n0 tptp.pv10)) (not (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1))) (not (tptp.leq tptp.n0 tptp.n0)) (not (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule reordering :premises (t22))
% 0.40/0.65  (step t24 (cl (and (tptp.leq tptp.n0 tptp.pv10) (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1)))) :rule not_implies1 :premises (a52))
% 0.40/0.65  (step t25 (cl (tptp.leq tptp.n0 tptp.pv10)) :rule and :premises (t24))
% 0.40/0.65  (step t26 (cl (tptp.leq tptp.pv10 (tptp.minus tptp.n135300 tptp.n1))) :rule and :premises (t24))
% 0.40/0.65  (step t27 (cl (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0)) (forall ((X $$unsorted)) (tptp.leq X X))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t28)
% 0.40/0.65  (assume t28.a0 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.40/0.65  (step t28.t1 (cl (or (not (forall ((X $$unsorted)) (tptp.leq X X))) (tptp.leq tptp.n0 tptp.n0))) :rule forall_inst :args ((:= X tptp.n0)))
% 0.40/0.65  (step t28.t2 (cl (not (forall ((X $$unsorted)) (tptp.leq X X))) (tptp.leq tptp.n0 tptp.n0)) :rule or :premises (t28.t1))
% 0.40/0.65  (step t28.t3 (cl (tptp.leq tptp.n0 tptp.n0)) :rule resolution :premises (t28.t2 t28.a0))
% 0.40/0.65  (step t28 (cl (not (forall ((X $$unsorted)) (tptp.leq X X))) (tptp.leq tptp.n0 tptp.n0)) :rule subproof :discharge (t28.a0))
% 0.40/0.65  (step t29 (cl (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0)) (tptp.leq tptp.n0 tptp.n0)) :rule resolution :premises (t27 t28))
% 0.40/0.65  (step t30 (cl (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0)) (not (tptp.leq tptp.n0 tptp.n0))) :rule implies_neg2)
% 0.40/0.65  (step t31 (cl (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0)) (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0))) :rule resolution :premises (t29 t30))
% 0.40/0.65  (step t32 (cl (=> (forall ((X $$unsorted)) (tptp.leq X X)) (tptp.leq tptp.n0 tptp.n0))) :rule contraction :premises (t31))
% 0.40/0.65  (step t33 (cl (not (forall ((X $$unsorted)) (tptp.leq X X))) (tptp.leq tptp.n0 tptp.n0)) :rule implies :premises (t32))
% 0.40/0.65  (step t34 (cl (tptp.leq tptp.n0 tptp.n0) (not (forall ((X $$unsorted)) (tptp.leq X X)))) :rule reordering :premises (t33))
% 0.40/0.65  (step t35 (cl (tptp.leq tptp.n0 tptp.n0)) :rule resolution :premises (t34 a3))
% 0.40/0.65  (step t36 (cl (not (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule resolution :premises (t23 t25 t26 t35))
% 0.40/0.65  (step t37 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t38)
% 0.40/0.65  (assume t38.a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))))
% 0.40/0.65  (step t38.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))))) :rule forall_inst :args ((:= X tptp.n0) (:= Y (tptp.minus tptp.n5 tptp.n1))))
% 0.40/0.65  (step t38.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule or :premises (t38.t1))
% 0.40/0.65  (step t38.t3 (cl (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule resolution :premises (t38.t2 t38.a0))
% 0.40/0.65  (step t38 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule subproof :discharge (t38.a0))
% 0.40/0.65  (step t39 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule resolution :premises (t37 t38))
% 0.40/0.65  (step t40 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) (not (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))))) :rule implies_neg2)
% 0.40/0.65  (step t41 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))))) :rule resolution :premises (t39 t40))
% 0.40/0.65  (step t42 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1))))) :rule contraction :premises (t41))
% 0.40/0.65  (step t43 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule implies :premises (t42))
% 0.40/0.65  (step t44 (cl (not (= (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))))) (not (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) :rule equiv_pos2)
% 0.40/0.65  (step t45 (cl (= (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y))))) :rule all_simplify)
% 0.40/0.65  (step t46 (cl (forall ((X $$unsorted) (Y $$unsorted)) (or (not (tptp.gt Y X)) (tptp.leq X Y)))) :rule resolution :premises (t44 t45 a7))
% 0.40/0.65  (step t47 (cl (or (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0)) (tptp.leq tptp.n0 (tptp.minus tptp.n5 tptp.n1)))) :rule resolution :premises (t43 t46))
% 0.40/0.65  (step t48 (cl (not (tptp.gt (tptp.minus tptp.n5 tptp.n1) tptp.n0))) :rule resolution :premises (t20 t36 t47))
% 0.40/0.65  (step t49 (cl (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t50)
% 0.40/0.65  (assume t50.a0 (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))))
% 0.40/0.65  (step t50.t1 (cl (or (not (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule forall_inst :args ((:= X (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))
% 0.40/0.65  (step t50.t2 (cl (not (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule or :premises (t50.t1))
% 0.40/0.65  (step t50.t3 (cl (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule resolution :premises (t50.t2 t50.a0))
% 0.40/0.65  (step t50 (cl (not (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule subproof :discharge (t50.a0))
% 0.40/0.65  (step t51 (cl (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule resolution :premises (t49 t50))
% 0.40/0.65  (step t52 (cl (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (not (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule implies_neg2)
% 0.40/0.65  (step t53 (cl (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule resolution :premises (t51 t52))
% 0.40/0.65  (step t54 (cl (=> (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))))) :rule contraction :premises (t53))
% 0.40/0.65  (step t55 (cl (not (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule implies :premises (t54))
% 0.40/0.65  (step t56 (cl (not (= (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)) (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))))) (not (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X))) (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) :rule equiv_pos2)
% 0.40/0.65  (anchor :step t57 :args ((X $$unsorted) (:= X X)))
% 0.40/0.65  (step t57.t1 (cl (= X X)) :rule refl)
% 0.40/0.65  (step t57.t2 (cl (= (= (tptp.pred (tptp.succ X)) X) (= X (tptp.pred (tptp.succ X))))) :rule all_simplify)
% 0.40/0.65  (step t57 (cl (= (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)) (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X)))))) :rule bind)
% 0.40/0.65  (step t58 (cl (forall ((X $$unsorted)) (= X (tptp.pred (tptp.succ X))))) :rule resolution :premises (t56 t57 a39))
% 0.40/0.65  (step t59 (cl (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) (tptp.pred (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))))) :rule resolution :premises (t55 t58))
% 0.40/0.65  (step t60 (cl (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X)))) :rule implies_neg1)
% 0.40/0.65  (anchor :step t61)
% 0.40/0.65  (assume t61.a0 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.40/0.65  (step t61.t1 (cl (or (not (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X)))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule forall_inst :args ((:= X tptp.n5)))
% 0.40/0.65  (step t61.t2 (cl (not (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X)))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule or :premises (t61.t1))
% 0.40/0.65  (step t61.t3 (cl (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule resolution :premises (t61.t2 t61.a0))
% 0.40/0.65  (step t61 (cl (not (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X)))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule subproof :discharge (t61.a0))
% 0.40/0.65  (step t62 (cl (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule resolution :premises (t60 t61))
% 0.40/0.65  (step t63 (cl (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (not (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule implies_neg2)
% 0.40/0.65  (step t64 (cl (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule resolution :premises (t62 t63))
% 0.40/0.65  (step t65 (cl (=> (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5)))) :rule contraction :premises (t64))
% 0.40/0.65  (step t66 (cl (not (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X)))) (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule implies :premises (t65))
% 0.40/0.65  (step t67 (cl (= (tptp.minus tptp.n5 tptp.n1) (tptp.pred tptp.n5))) :rule resolution :premises (t66 a38))
% 0.40/0.65  (step t68 (cl (= tptp.n5 (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))))) :rule symm :premises (a88))
% 0.40/0.65  (step t69 (cl (= tptp.n4 (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))))) :rule symm :premises (a87))
% 0.40/0.65  (step t70 (cl) :rule resolution :premises (t18 t48 t59 t67 t68 t69 a63))
% 0.40/0.65  
% 0.40/0.65  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.KiFTavHO9o/cvc5---1.0.5_27201.smt2
% 0.40/0.65  % cvc5---1.0.5 exiting
% 0.40/0.66  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------