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

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 29 18:04:20 EDT 2024

% Result   : Theorem 0.39s 0.58s
% Output   : Proof 0.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem    : SWV026+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.12/0.15  % Command    : do_cvc5 %s %d
% 0.16/0.36  % Computer : n013.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   : Sun May 26 22:40:09 EDT 2024
% 0.16/0.36  % CPUTime    : 
% 0.22/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.39/0.58  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.39/0.58  % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.AqNRTSNmKp/cvc5---1.0.5_30009.smt2
% 0.39/0.58  % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.AqNRTSNmKp/cvc5---1.0.5_30009.smt2
% 0.39/0.58  (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))))
% 0.39/0.58  (assume a1 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))))
% 0.39/0.58  (assume a2 (forall ((X $$unsorted)) (not (tptp.gt X X))))
% 0.39/0.58  (assume a3 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.39/0.58  (assume a4 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.leq X Y) (tptp.leq Y Z)) (tptp.leq X Z))))
% 0.39/0.58  (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))))
% 0.39/0.58  (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))))
% 0.39/0.58  (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))))
% 0.39/0.58  (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))))
% 0.39/0.58  (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))))
% 0.39/0.58  (assume a10 (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)))
% 0.39/0.58  (assume a11 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))))
% 0.39/0.58  (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.39/0.58  (assume a13 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))))
% 0.39/0.58  (assume a14 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq tptp.n0 (tptp.uniform_int_rnd C X)))))
% 0.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (assume a25 (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)))
% 0.39/0.58  (assume a26 (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))))
% 0.39/0.58  (assume a27 (= (tptp.succ tptp.tptp_minus_1) tptp.n0))
% 0.39/0.58  (assume a28 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))))
% 0.39/0.58  (assume a29 (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))))
% 0.39/0.58  (assume a30 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))))
% 0.39/0.58  (assume a31 (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))))
% 0.39/0.58  (assume a32 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.39/0.58  (assume a33 (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.39/0.58  (assume a34 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.39/0.58  (assume a35 (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.39/0.58  (assume a36 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.39/0.58  (assume a37 (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.39/0.58  (assume a38 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.39/0.58  (assume a39 (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)))
% 0.39/0.58  (assume a40 (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)))
% 0.39/0.58  (assume a41 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))))
% 0.39/0.58  (assume a42 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))))
% 0.39/0.58  (assume a43 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))))
% 0.39/0.58  (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.39/0.58  (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.39/0.58  (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.39/0.58  (assume a47 (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)))
% 0.39/0.58  (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.39/0.58  (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.39/0.58  (assume a50 tptp.true)
% 0.39/0.58  (assume a51 (not (= tptp.def tptp.use)))
% 0.39/0.58  (assume a52 (not (=> (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))))))
% 0.39/0.58  (assume a53 (tptp.gt tptp.n5 tptp.n4))
% 0.39/0.58  (assume a54 (tptp.gt tptp.n330 tptp.n4))
% 0.39/0.58  (assume a55 (tptp.gt tptp.n410 tptp.n4))
% 0.39/0.58  (assume a56 (tptp.gt tptp.n330 tptp.n5))
% 0.39/0.58  (assume a57 (tptp.gt tptp.n410 tptp.n5))
% 0.39/0.58  (assume a58 (tptp.gt tptp.n410 tptp.n330))
% 0.39/0.58  (assume a59 (tptp.gt tptp.n4 tptp.tptp_minus_1))
% 0.39/0.58  (assume a60 (tptp.gt tptp.n5 tptp.tptp_minus_1))
% 0.39/0.58  (assume a61 (tptp.gt tptp.n330 tptp.tptp_minus_1))
% 0.39/0.58  (assume a62 (tptp.gt tptp.n410 tptp.tptp_minus_1))
% 0.39/0.58  (assume a63 (tptp.gt tptp.n0 tptp.tptp_minus_1))
% 0.39/0.58  (assume a64 (tptp.gt tptp.n1 tptp.tptp_minus_1))
% 0.39/0.58  (assume a65 (tptp.gt tptp.n2 tptp.tptp_minus_1))
% 0.39/0.58  (assume a66 (tptp.gt tptp.n3 tptp.tptp_minus_1))
% 0.39/0.58  (assume a67 (tptp.gt tptp.n4 tptp.n0))
% 0.39/0.58  (assume a68 (tptp.gt tptp.n5 tptp.n0))
% 0.39/0.58  (assume a69 (tptp.gt tptp.n330 tptp.n0))
% 0.39/0.58  (assume a70 (tptp.gt tptp.n410 tptp.n0))
% 0.39/0.58  (assume a71 (tptp.gt tptp.n1 tptp.n0))
% 0.39/0.58  (assume a72 (tptp.gt tptp.n2 tptp.n0))
% 0.39/0.58  (assume a73 (tptp.gt tptp.n3 tptp.n0))
% 0.39/0.58  (assume a74 (tptp.gt tptp.n4 tptp.n1))
% 0.39/0.58  (assume a75 (tptp.gt tptp.n5 tptp.n1))
% 0.39/0.58  (assume a76 (tptp.gt tptp.n330 tptp.n1))
% 0.39/0.58  (assume a77 (tptp.gt tptp.n410 tptp.n1))
% 0.39/0.58  (assume a78 (tptp.gt tptp.n2 tptp.n1))
% 0.39/0.58  (assume a79 (tptp.gt tptp.n3 tptp.n1))
% 0.39/0.58  (assume a80 (tptp.gt tptp.n4 tptp.n2))
% 0.39/0.58  (assume a81 (tptp.gt tptp.n5 tptp.n2))
% 0.39/0.58  (assume a82 (tptp.gt tptp.n330 tptp.n2))
% 0.39/0.58  (assume a83 (tptp.gt tptp.n410 tptp.n2))
% 0.39/0.58  (assume a84 (tptp.gt tptp.n3 tptp.n2))
% 0.39/0.58  (assume a85 (tptp.gt tptp.n4 tptp.n3))
% 0.39/0.58  (assume a86 (tptp.gt tptp.n5 tptp.n3))
% 0.39/0.58  (assume a87 (tptp.gt tptp.n330 tptp.n3))
% 0.39/0.58  (assume a88 (tptp.gt tptp.n410 tptp.n3))
% 0.39/0.58  (assume a89 (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.39/0.58  (assume a90 (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.39/0.58  (assume a91 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))))
% 0.39/0.58  (assume a92 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))))
% 0.39/0.58  (assume a93 (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.39/0.58  (assume a94 (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.39/0.58  (assume a95 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4))
% 0.39/0.58  (assume a96 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5))
% 0.39/0.58  (assume a97 (= (tptp.succ tptp.n0) tptp.n1))
% 0.39/0.58  (assume a98 (= (tptp.succ (tptp.succ tptp.n0)) tptp.n2))
% 0.39/0.58  (assume a99 (= (tptp.succ (tptp.succ (tptp.succ tptp.n0))) tptp.n3))
% 0.39/0.58  (assume a100 true)
% 0.39/0.58  (step t1 (cl (not (= (not (=> (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))))) (not (=> (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))))) (not (not (=> (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init))))))) (not (=> (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))))) :rule equiv_pos2)
% 0.39/0.58  (step t2 (cl (= (= tptp.init tptp.init) true)) :rule all_simplify)
% 0.39/0.58  (step t3 (cl (= (= tptp.s_best7_init tptp.init) (= tptp.init tptp.s_best7_init))) :rule all_simplify)
% 0.39/0.58  (step t4 (cl (= (= tptp.s_sworst7_init tptp.init) (= tptp.init tptp.s_sworst7_init))) :rule all_simplify)
% 0.39/0.58  (step t5 (cl (= (= tptp.s_worst7_init tptp.init) (= tptp.init tptp.s_worst7_init))) :rule all_simplify)
% 0.39/0.58  (step t6 (cl (= (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_best7))) :rule refl)
% 0.39/0.58  (step t7 (cl (= (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_sworst7))) :rule refl)
% 0.39/0.58  (step t8 (cl (= (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.s_worst7))) :rule refl)
% 0.39/0.58  (step t9 (cl (= (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv9))) :rule refl)
% 0.39/0.58  (step t10 (cl (= (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv19))) :rule refl)
% 0.39/0.58  (step t11 (cl (= (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv20))) :rule refl)
% 0.39/0.58  (step t12 (cl (= (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.n0 tptp.pv1376))) :rule refl)
% 0.39/0.58  (step t13 (cl (= (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_best7 tptp.n3))) :rule refl)
% 0.39/0.58  (step t14 (cl (= (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3))) :rule refl)
% 0.39/0.58  (step t15 (cl (= (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3))) :rule refl)
% 0.39/0.58  (step t16 (cl (= (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)))) :rule refl)
% 0.39/0.58  (step t17 (cl (= (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)))) :rule refl)
% 0.39/0.58  (step t18 (cl (= (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)))) :rule refl)
% 0.39/0.58  (step t19 (cl (= (tptp.leq tptp.pv1376 tptp.n3) (tptp.leq tptp.pv1376 tptp.n3))) :rule refl)
% 0.39/0.58  (anchor :step t20 :args ((A $$unsorted) (:= A A)))
% 0.39/0.58  (step t20.t1 (cl (= A A)) :rule refl)
% 0.39/0.58  (step t20.t2 (cl (= (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)))) :rule refl)
% 0.39/0.58  (anchor :step t20.t3 :args ((B $$unsorted) (:= B B)))
% 0.39/0.58  (step t20.t3.t1 (cl (= B B)) :rule refl)
% 0.39/0.58  (step t20.t3.t2 (cl (= (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)))) :rule refl)
% 0.39/0.58  (step t20.t3.t3 (cl (= (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))) :rule all_simplify)
% 0.39/0.58  (step t20.t3.t4 (cl (= (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A))))) :rule cong :premises (t20.t3.t2 t20.t3.t3))
% 0.39/0.58  (step t20.t3 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) :rule bind)
% 0.39/0.58  (step t20.t4 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) :rule all_simplify)
% 0.39/0.58  (step t20.t5 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) :rule trans :premises (t20.t3 t20.t4))
% 0.39/0.58  (step t20.t6 (cl (= (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init)))) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A))))))) :rule cong :premises (t20.t2 t20.t5))
% 0.39/0.58  (step t20 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))))) :rule bind)
% 0.39/0.58  (step t21 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))))) :rule all_simplify)
% 0.39/0.58  (step t22 (cl (= (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A))))))) :rule all_simplify)
% 0.39/0.58  (anchor :step t23 :args ((A $$unsorted) (:= A A) (BOUND_VARIABLE_2189 $$unsorted) (:= BOUND_VARIABLE_2189 BOUND_VARIABLE_2189)))
% 0.39/0.58  (step t23.t1 (cl (= A A)) :rule refl)
% 0.39/0.58  (step t23.t2 (cl (= BOUND_VARIABLE_2189 BOUND_VARIABLE_2189)) :rule refl)
% 0.39/0.58  (step t23.t3 (cl (= (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A))))) :rule all_simplify)
% 0.39/0.58  (step t23 (cl (= (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))))) :rule bind)
% 0.39/0.58  (step t24 (cl (= (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))))) :rule trans :premises (t22 t23))
% 0.39/0.58  (step t25 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init B A)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))))) :rule trans :premises (t21 t24))
% 0.39/0.58  (step t26 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))))) :rule trans :premises (t20 t25))
% 0.39/0.58  (anchor :step t27 :args ((C $$unsorted) (:= C C)))
% 0.39/0.58  (step t27.t1 (cl (= C C)) :rule refl)
% 0.39/0.58  (step t27.t2 (cl (= (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)))) :rule refl)
% 0.39/0.58  (step t27.t3 (cl (= (= (tptp.a_select2 tptp.s_values7_init C) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) :rule all_simplify)
% 0.39/0.58  (step t27.t4 (cl (= (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C))))) :rule cong :premises (t27.t2 t27.t3))
% 0.39/0.58  (step t27 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))))) :rule bind)
% 0.39/0.58  (step t28 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))))) :rule all_simplify)
% 0.39/0.58  (step t29 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))))) :rule trans :premises (t27 t28))
% 0.39/0.58  (anchor :step t30 :args ((D $$unsorted) (:= D D)))
% 0.39/0.58  (step t30.t1 (cl (= D D)) :rule refl)
% 0.39/0.58  (step t30.t2 (cl (= (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)))) :rule refl)
% 0.39/0.58  (step t30.t3 (cl (= (= (tptp.a_select2 tptp.s_center7_init D) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) :rule all_simplify)
% 0.39/0.58  (step t30.t4 (cl (= (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D))))) :rule cong :premises (t30.t2 t30.t3))
% 0.39/0.58  (step t30 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))))) :rule bind)
% 0.39/0.58  (step t31 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))))) :rule all_simplify)
% 0.39/0.58  (step t32 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))))) :rule trans :premises (t30 t31))
% 0.39/0.58  (anchor :step t33 :args ((E $$unsorted) (:= E E)))
% 0.39/0.58  (step t33.t1 (cl (= E E)) :rule refl)
% 0.39/0.58  (step t33.t2 (cl (= (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))))) :rule refl)
% 0.39/0.58  (step t33.t3 (cl (= (= (tptp.a_select2 tptp.s_try7_init E) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) :rule all_simplify)
% 0.39/0.58  (step t33.t4 (cl (= (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E))))) :rule cong :premises (t33.t2 t33.t3))
% 0.39/0.58  (step t33 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))))) :rule bind)
% 0.39/0.58  (step t34 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))))) :rule all_simplify)
% 0.39/0.58  (step t35 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))))) :rule trans :premises (t33 t34))
% 0.39/0.58  (step t36 (cl (= (tptp.gt tptp.loopcounter tptp.n1) (tptp.gt tptp.loopcounter tptp.n1))) :rule refl)
% 0.39/0.58  (step t37 (cl (= (= tptp.pvar1400_init tptp.init) (= tptp.init tptp.pvar1400_init))) :rule all_simplify)
% 0.39/0.58  (step t38 (cl (= (= tptp.pvar1401_init tptp.init) (= tptp.init tptp.pvar1401_init))) :rule all_simplify)
% 0.39/0.58  (step t39 (cl (= (= tptp.pvar1402_init tptp.init) (= tptp.init tptp.pvar1402_init))) :rule all_simplify)
% 0.39/0.58  (step t40 (cl (= (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) :rule cong :premises (t37 t38 t39))
% 0.39/0.58  (step t41 (cl (= (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))) :rule cong :premises (t36 t40))
% 0.39/0.58  (step t42 (cl (= (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and true (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 t12 t13 t14 t15 t16 t17 t18 t19 t26 t29 t32 t35 t41))
% 0.39/0.58  (step t43 (cl (= (and true (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule all_simplify)
% 0.39/0.58  (step t44 (cl (= (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule trans :premises (t42 t43))
% 0.39/0.58  (anchor :step t45 :args ((F $$unsorted) (:= F F)))
% 0.39/0.58  (step t45.t1 (cl (= F F)) :rule refl)
% 0.39/0.58  (step t45.t2 (cl (= (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)))) :rule refl)
% 0.39/0.58  (anchor :step t45.t3 :args ((G $$unsorted) (:= G G)))
% 0.39/0.58  (step t45.t3.t1 (cl (= G G)) :rule refl)
% 0.39/0.58  (step t45.t3.t2 (cl (= (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)))) :rule refl)
% 0.39/0.58  (step t45.t3.t3 (cl (= (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))) :rule all_simplify)
% 0.39/0.58  (step t45.t3.t4 (cl (= (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F))))) :rule cong :premises (t45.t3.t2 t45.t3.t3))
% 0.39/0.58  (step t45.t3 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) :rule bind)
% 0.39/0.58  (step t45.t4 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) :rule all_simplify)
% 0.39/0.58  (step t45.t5 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) :rule trans :premises (t45.t3 t45.t4))
% 0.39/0.58  (step t45.t6 (cl (= (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init)))) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F))))))) :rule cong :premises (t45.t2 t45.t5))
% 0.39/0.58  (step t45 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))))) :rule bind)
% 0.39/0.58  (step t46 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))))) :rule all_simplify)
% 0.39/0.58  (step t47 (cl (= (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))))) :rule all_simplify)
% 0.39/0.58  (anchor :step t48 :args ((F $$unsorted) (:= F F) (BOUND_VARIABLE_2254 $$unsorted) (:= BOUND_VARIABLE_2254 BOUND_VARIABLE_2254)))
% 0.39/0.58  (step t48.t1 (cl (= F F)) :rule refl)
% 0.39/0.58  (step t48.t2 (cl (= BOUND_VARIABLE_2254 BOUND_VARIABLE_2254)) :rule refl)
% 0.39/0.58  (step t48.t3 (cl (= (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))) :rule all_simplify)
% 0.39/0.58  (step t48 (cl (= (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))))) :rule bind)
% 0.39/0.58  (step t49 (cl (= (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))))) :rule trans :premises (t47 t48))
% 0.39/0.58  (step t50 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init G F)))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))))) :rule trans :premises (t46 t49))
% 0.39/0.58  (step t51 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))))) :rule trans :premises (t45 t50))
% 0.39/0.58  (anchor :step t52 :args ((H $$unsorted) (:= H H)))
% 0.39/0.58  (step t52.t1 (cl (= H H)) :rule refl)
% 0.39/0.58  (step t52.t2 (cl (= (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)))) :rule refl)
% 0.39/0.58  (step t52.t3 (cl (= (= (tptp.a_select2 tptp.s_values7_init H) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) :rule all_simplify)
% 0.39/0.58  (step t52.t4 (cl (= (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H))))) :rule cong :premises (t52.t2 t52.t3))
% 0.39/0.58  (step t52 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))))) :rule bind)
% 0.39/0.58  (step t53 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))))) :rule all_simplify)
% 0.39/0.58  (step t54 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))))) :rule trans :premises (t52 t53))
% 0.39/0.58  (anchor :step t55 :args ((I $$unsorted) (:= I I)))
% 0.39/0.58  (step t55.t1 (cl (= I I)) :rule refl)
% 0.39/0.58  (step t55.t2 (cl (= (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)))) :rule refl)
% 0.39/0.58  (step t55.t3 (cl (= (= (tptp.a_select2 tptp.s_center7_init I) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) :rule all_simplify)
% 0.39/0.58  (step t55.t4 (cl (= (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I))))) :rule cong :premises (t55.t2 t55.t3))
% 0.39/0.58  (step t55 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))))) :rule bind)
% 0.39/0.58  (step t56 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))))) :rule all_simplify)
% 0.39/0.58  (step t57 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))))) :rule trans :premises (t55 t56))
% 0.39/0.58  (anchor :step t58 :args ((J $$unsorted) (:= J J)))
% 0.39/0.58  (step t58.t1 (cl (= J J)) :rule refl)
% 0.39/0.58  (step t58.t2 (cl (= (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))))) :rule refl)
% 0.39/0.58  (step t58.t3 (cl (= (= (tptp.a_select2 tptp.s_try7_init J) tptp.init) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) :rule all_simplify)
% 0.39/0.58  (step t58.t4 (cl (= (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J))))) :rule cong :premises (t58.t2 t58.t3))
% 0.39/0.58  (step t58 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))))) :rule bind)
% 0.39/0.58  (step t59 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))))) :rule all_simplify)
% 0.39/0.58  (step t60 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))))) :rule trans :premises (t58 t59))
% 0.39/0.58  (step t61 (cl (= (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and true (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule cong :premises (t2 t3 t4 t5 t6 t7 t8 t10 t11 t12 t13 t14 t15 t17 t18 t19 t51 t54 t57 t60 t41))
% 0.39/0.58  (step t62 (cl (= (and true (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule all_simplify)
% 0.39/0.58  (step t63 (cl (= (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule trans :premises (t61 t62))
% 0.39/0.58  (step t64 (cl (= (=> (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init))))) (=> (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))))) :rule cong :premises (t44 t63))
% 0.39/0.58  (step t65 (cl (= (not (=> (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n2)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init B A) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init E) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))) (and (= tptp.init tptp.init) (= tptp.s_best7_init tptp.init) (= tptp.s_sworst7_init tptp.init) (= tptp.s_worst7_init tptp.init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n2)) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n3)) (= (tptp.a_select3 tptp.simplex7_init G F) tptp.init))))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n3)) (= (tptp.a_select2 tptp.s_values7_init H) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n2)) (= (tptp.a_select2 tptp.s_center7_init I) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= (tptp.a_select2 tptp.s_try7_init J) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.pvar1400_init tptp.init) (= tptp.pvar1401_init tptp.init) (= tptp.pvar1402_init tptp.init)))))) (not (=> (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))))) :rule cong :premises (t64))
% 0.39/0.58  (step t66 (cl (not (=> (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))))) :rule resolution :premises (t1 t65 a52))
% 0.39/0.58  (step t67 (cl (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv9) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv9 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))) :rule not_implies1 :premises (t66))
% 0.39/0.58  (step t68 (cl (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) :rule and :premises (t67))
% 0.39/0.58  (step t69 (cl (not (tptp.gt tptp.loopcounter tptp.n1)) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))) :rule implies :premises (t68))
% 0.39/0.58  (step t70 (cl (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)) (not (tptp.gt tptp.loopcounter tptp.n1))) :rule reordering :premises (t69))
% 0.39/0.58  (step t71 (cl (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))) (not (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) :rule implies_neg2)
% 0.39/0.58  (step t72 (cl (not (and (= tptp.init tptp.s_best7_init) (= tptp.init tptp.s_sworst7_init) (= tptp.init tptp.s_worst7_init) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n0 tptp.pv19) (tptp.leq tptp.n0 tptp.pv20) (tptp.leq tptp.n0 tptp.pv1376) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1)) (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1)) (tptp.leq tptp.pv1376 tptp.n3) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))))) :rule not_implies2 :premises (t66))
% 0.39/0.58  (step t73 (cl (not (= tptp.init tptp.s_best7_init)) (not (= tptp.init tptp.s_sworst7_init)) (not (= tptp.init tptp.s_worst7_init)) (not (tptp.leq tptp.n0 tptp.s_best7)) (not (tptp.leq tptp.n0 tptp.s_sworst7)) (not (tptp.leq tptp.n0 tptp.s_worst7)) (not (tptp.leq tptp.n0 tptp.pv19)) (not (tptp.leq tptp.n0 tptp.pv20)) (not (tptp.leq tptp.n0 tptp.pv1376)) (not (tptp.leq tptp.s_best7 tptp.n3)) (not (tptp.leq tptp.s_sworst7 tptp.n3)) (not (tptp.leq tptp.s_worst7 tptp.n3)) (not (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1))) (not (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1))) (not (tptp.leq tptp.pv1376 tptp.n3)) (not (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))) (not (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H))))) (not (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I))))) (not (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J))))) (not (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))) :rule not_and :premises (t72))
% 0.39/0.58  (step t74 (cl (= tptp.init tptp.s_best7_init)) :rule and :premises (t67))
% 0.39/0.58  (step t75 (cl (= tptp.init tptp.s_sworst7_init)) :rule and :premises (t67))
% 0.39/0.58  (step t76 (cl (= tptp.init tptp.s_worst7_init)) :rule and :premises (t67))
% 0.39/0.58  (step t77 (cl (tptp.leq tptp.n0 tptp.s_best7)) :rule and :premises (t67))
% 0.39/0.58  (step t78 (cl (tptp.leq tptp.n0 tptp.s_sworst7)) :rule and :premises (t67))
% 0.39/0.58  (step t79 (cl (tptp.leq tptp.n0 tptp.s_worst7)) :rule and :premises (t67))
% 0.39/0.58  (step t80 (cl (tptp.leq tptp.n0 tptp.pv19)) :rule and :premises (t67))
% 0.39/0.58  (step t81 (cl (tptp.leq tptp.n0 tptp.pv20)) :rule and :premises (t67))
% 0.39/0.58  (step t82 (cl (tptp.leq tptp.n0 tptp.pv1376)) :rule and :premises (t67))
% 0.39/0.58  (step t83 (cl (tptp.leq tptp.s_best7 tptp.n3)) :rule and :premises (t67))
% 0.39/0.58  (step t84 (cl (tptp.leq tptp.s_sworst7 tptp.n3)) :rule and :premises (t67))
% 0.39/0.58  (step t85 (cl (tptp.leq tptp.s_worst7 tptp.n3)) :rule and :premises (t67))
% 0.39/0.58  (step t86 (cl (tptp.leq tptp.pv19 (tptp.minus tptp.n410 tptp.n1))) :rule and :premises (t67))
% 0.39/0.58  (step t87 (cl (tptp.leq tptp.pv20 (tptp.minus tptp.n330 tptp.n1))) :rule and :premises (t67))
% 0.39/0.58  (step t88 (cl (tptp.leq tptp.pv1376 tptp.n3)) :rule and :premises (t67))
% 0.39/0.58  (step t89 (cl (= (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))))) :rule hole :args ((forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))) (= BOUND_VARIABLE_2189 BOUND_VARIABLE_2254) (= A F)))
% 0.39/0.58  (step t90 (cl (not (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A))))) (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))) :rule equiv1 :premises (t89))
% 0.39/0.58  (step t91 (cl (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F)))) (not (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A)))))) :rule reordering :premises (t90))
% 0.39/0.58  (step t92 (cl (forall ((A $$unsorted) (BOUND_VARIABLE_2189 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2189)) (not (tptp.leq BOUND_VARIABLE_2189 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2189 A))))) :rule and :premises (t67))
% 0.39/0.58  (step t93 (cl (forall ((F $$unsorted) (BOUND_VARIABLE_2254 $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2254)) (not (tptp.leq BOUND_VARIABLE_2254 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2254 F))))) :rule resolution :premises (t91 t92))
% 0.39/0.58  (step t94 (cl (= (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))))) :rule hole :args ((forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))) (= C H)))
% 0.39/0.58  (step t95 (cl (not (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C))))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H))))) :rule equiv1 :premises (t94))
% 0.39/0.58  (step t96 (cl (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H)))) (not (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C)))))) :rule reordering :premises (t95))
% 0.39/0.58  (step t97 (cl (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init C))))) :rule and :premises (t67))
% 0.39/0.58  (step t98 (cl (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n3)) (= tptp.init (tptp.a_select2 tptp.s_values7_init H))))) :rule resolution :premises (t96 t97))
% 0.39/0.58  (step t99 (cl (= (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))))) :rule hole :args ((forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))) (= D I)))
% 0.39/0.58  (step t100 (cl (not (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D))))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I))))) :rule equiv1 :premises (t99))
% 0.39/0.58  (step t101 (cl (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I)))) (not (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D)))))) :rule reordering :premises (t100))
% 0.39/0.58  (step t102 (cl (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init D))))) :rule and :premises (t67))
% 0.39/0.58  (step t103 (cl (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n2)) (= tptp.init (tptp.a_select2 tptp.s_center7_init I))))) :rule resolution :premises (t101 t102))
% 0.39/0.58  (step t104 (cl (= (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))))) :rule hole :args ((forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))) (= E J)))
% 0.39/0.58  (step t105 (cl (not (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J))))) :rule equiv1 :premises (t104))
% 0.39/0.58  (step t106 (cl (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J)))) (not (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E)))))) :rule reordering :premises (t105))
% 0.39/0.58  (step t107 (cl (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init E))))) :rule and :premises (t67))
% 0.39/0.58  (step t108 (cl (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J (tptp.minus tptp.n3 tptp.n1))) (= tptp.init (tptp.a_select2 tptp.s_try7_init J))))) :rule resolution :premises (t106 t107))
% 0.39/0.58  (step t109 (cl (not (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))))) :rule resolution :premises (t73 t74 t75 t76 t77 t78 t79 t80 t81 t82 t83 t84 t85 t86 t87 t88 t93 t98 t103 t108))
% 0.39/0.58  (step t110 (cl (not (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) :rule resolution :premises (t71 t109))
% 0.39/0.58  (step t111 (cl (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init))) (tptp.gt tptp.loopcounter tptp.n1)) :rule implies_neg1)
% 0.39/0.58  (step t112 (cl (tptp.gt tptp.loopcounter tptp.n1) (=> (tptp.gt tptp.loopcounter tptp.n1) (and (= tptp.init tptp.pvar1400_init) (= tptp.init tptp.pvar1401_init) (= tptp.init tptp.pvar1402_init)))) :rule reordering :premises (t111))
% 0.39/0.58  (step t113 (cl (tptp.gt tptp.loopcounter tptp.n1)) :rule resolution :premises (t112 t109))
% 0.39/0.58  (step t114 (cl) :rule resolution :premises (t70 t110 t113))
% 0.39/0.58  
% 0.39/0.58  % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.AqNRTSNmKp/cvc5---1.0.5_30009.smt2
% 0.39/0.58  % cvc5---1.0.5 exiting
% 0.39/0.58  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------