TSTP Solution File: SWV176+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV176+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n029.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:39 EDT 2024
% Result : Theorem 0.20s 0.57s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWV176+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.11/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 26 23:33:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.57 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.57 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.4QDNMe0LaZ/cvc5---1.0.5_30931.smt2
% 0.20/0.57 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.4QDNMe0LaZ/cvc5---1.0.5_30931.smt2
% 0.20/0.57 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))))
% 0.20/0.57 (assume a1 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))))
% 0.20/0.57 (assume a2 (forall ((X $$unsorted)) (not (tptp.gt X X))))
% 0.20/0.57 (assume a3 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.20/0.57 (assume a4 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.leq X Y) (tptp.leq Y Z)) (tptp.leq X Z))))
% 0.20/0.57 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))))
% 0.20/0.57 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))))
% 0.20/0.57 (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))))
% 0.20/0.57 (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))))
% 0.20/0.57 (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))))
% 0.20/0.57 (assume a10 (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)))
% 0.20/0.57 (assume a11 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))))
% 0.20/0.57 (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.20/0.57 (assume a13 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))))
% 0.20/0.57 (assume a14 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq tptp.n0 (tptp.uniform_int_rnd C X)))))
% 0.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (assume a25 (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)))
% 0.20/0.57 (assume a26 (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))))
% 0.20/0.57 (assume a27 (= (tptp.succ tptp.tptp_minus_1) tptp.n0))
% 0.20/0.57 (assume a28 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))))
% 0.20/0.57 (assume a29 (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))))
% 0.20/0.57 (assume a30 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))))
% 0.20/0.57 (assume a31 (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))))
% 0.20/0.57 (assume a32 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.20/0.57 (assume a33 (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.20/0.57 (assume a34 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.20/0.57 (assume a35 (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.20/0.57 (assume a36 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.20/0.57 (assume a37 (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.20/0.57 (assume a38 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.20/0.57 (assume a39 (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)))
% 0.20/0.57 (assume a40 (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)))
% 0.20/0.57 (assume a41 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))))
% 0.20/0.57 (assume a42 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))))
% 0.20/0.57 (assume a43 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))))
% 0.20/0.57 (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.20/0.57 (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.20/0.57 (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.20/0.57 (assume a47 (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)))
% 0.20/0.57 (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.20/0.57 (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.20/0.57 (assume a50 tptp.true)
% 0.20/0.57 (assume a51 (not (= tptp.def tptp.use)))
% 0.20/0.57 (assume a52 (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init))))))
% 0.20/0.57 (assume a53 (tptp.gt tptp.n5 tptp.n4))
% 0.20/0.57 (assume a54 (tptp.gt tptp.n135299 tptp.n4))
% 0.20/0.57 (assume a55 (tptp.gt tptp.n135299 tptp.n5))
% 0.20/0.57 (assume a56 (tptp.gt tptp.n4 tptp.tptp_minus_1))
% 0.20/0.57 (assume a57 (tptp.gt tptp.n5 tptp.tptp_minus_1))
% 0.20/0.57 (assume a58 (tptp.gt tptp.n135299 tptp.tptp_minus_1))
% 0.20/0.57 (assume a59 (tptp.gt tptp.n0 tptp.tptp_minus_1))
% 0.20/0.57 (assume a60 (tptp.gt tptp.n1 tptp.tptp_minus_1))
% 0.20/0.57 (assume a61 (tptp.gt tptp.n2 tptp.tptp_minus_1))
% 0.20/0.57 (assume a62 (tptp.gt tptp.n3 tptp.tptp_minus_1))
% 0.20/0.57 (assume a63 (tptp.gt tptp.n4 tptp.n0))
% 0.20/0.57 (assume a64 (tptp.gt tptp.n5 tptp.n0))
% 0.20/0.57 (assume a65 (tptp.gt tptp.n135299 tptp.n0))
% 0.20/0.57 (assume a66 (tptp.gt tptp.n1 tptp.n0))
% 0.20/0.57 (assume a67 (tptp.gt tptp.n2 tptp.n0))
% 0.20/0.57 (assume a68 (tptp.gt tptp.n3 tptp.n0))
% 0.20/0.57 (assume a69 (tptp.gt tptp.n4 tptp.n1))
% 0.20/0.57 (assume a70 (tptp.gt tptp.n5 tptp.n1))
% 0.20/0.57 (assume a71 (tptp.gt tptp.n135299 tptp.n1))
% 0.20/0.57 (assume a72 (tptp.gt tptp.n2 tptp.n1))
% 0.20/0.57 (assume a73 (tptp.gt tptp.n3 tptp.n1))
% 0.20/0.57 (assume a74 (tptp.gt tptp.n4 tptp.n2))
% 0.20/0.57 (assume a75 (tptp.gt tptp.n5 tptp.n2))
% 0.20/0.57 (assume a76 (tptp.gt tptp.n135299 tptp.n2))
% 0.20/0.57 (assume a77 (tptp.gt tptp.n3 tptp.n2))
% 0.20/0.57 (assume a78 (tptp.gt tptp.n4 tptp.n3))
% 0.20/0.57 (assume a79 (tptp.gt tptp.n5 tptp.n3))
% 0.20/0.57 (assume a80 (tptp.gt tptp.n135299 tptp.n3))
% 0.20/0.57 (assume a81 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n4)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3) (= X tptp.n4)))))
% 0.20/0.57 (assume a82 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n5)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3) (= X tptp.n4) (= X tptp.n5)))))
% 0.20/0.57 (assume a83 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))))
% 0.20/0.57 (assume a84 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))))
% 0.20/0.57 (assume a85 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n2)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2)))))
% 0.20/0.57 (assume a86 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n3)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2) (= X tptp.n3)))))
% 0.20/0.57 (assume a87 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4))
% 0.20/0.57 (assume a88 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5))
% 0.20/0.57 (assume a89 (= (tptp.succ tptp.n0) tptp.n1))
% 0.20/0.57 (assume a90 (= (tptp.succ (tptp.succ tptp.n0)) tptp.n2))
% 0.20/0.57 (assume a91 (= (tptp.succ (tptp.succ (tptp.succ tptp.n0))) tptp.n3))
% 0.20/0.57 (assume a92 true)
% 0.20/0.57 (step t1 (cl (not (= (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init))))) (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))))) (not (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init)))))) (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))))) :rule equiv_pos2)
% 0.20/0.57 (step t2 (cl (= (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv40))) :rule refl)
% 0.20/0.57 (step t3 (cl (= (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.n0 tptp.pv44))) :rule refl)
% 0.20/0.57 (step t4 (cl (= (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv40 tptp.n4))) :rule refl)
% 0.20/0.57 (step t5 (cl (= (tptp.leq tptp.pv44 tptp.n135299) (tptp.leq tptp.pv44 tptp.n135299))) :rule refl)
% 0.20/0.57 (step t6 (cl (= (tptp.gt tptp.loopcounter tptp.n1) (tptp.gt tptp.loopcounter tptp.n1))) :rule refl)
% 0.20/0.57 (anchor :step t7 :args ((A $$unsorted) (:= A A)))
% 0.20/0.57 (step t7.t1 (cl (= A A)) :rule refl)
% 0.20/0.57 (step t7.t2 (cl (= (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)))) :rule refl)
% 0.20/0.57 (anchor :step t7.t3 :args ((B $$unsorted) (:= B B)))
% 0.20/0.57 (step t7.t3.t1 (cl (= B B)) :rule refl)
% 0.20/0.57 (step t7.t3.t2 (cl (= (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)))) :rule refl)
% 0.20/0.57 (step t7.t3.t3 (cl (= (= (tptp.a_select3 tptp.q_init A B) tptp.init) (= tptp.init (tptp.a_select3 tptp.q_init A B)))) :rule all_simplify)
% 0.20/0.57 (step t7.t3.t4 (cl (= (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B))))) :rule cong :premises (t7.t3.t2 t7.t3.t3))
% 0.20/0.57 (step t7.t3 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) :rule bind)
% 0.20/0.57 (step t7.t4 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) :rule all_simplify)
% 0.20/0.57 (step t7.t5 (cl (= (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) :rule trans :premises (t7.t3 t7.t4))
% 0.20/0.57 (step t7.t6 (cl (= (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init)))) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B))))))) :rule cong :premises (t7.t2 t7.t5))
% 0.20/0.57 (step t7 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))))) :rule bind)
% 0.20/0.57 (step t8 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))))) :rule all_simplify)
% 0.20/0.57 (step t9 (cl (= (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153))))))) :rule all_simplify)
% 0.20/0.57 (anchor :step t10 :args ((A $$unsorted) (:= A A) (BOUND_VARIABLE_2153 $$unsorted) (:= BOUND_VARIABLE_2153 BOUND_VARIABLE_2153)))
% 0.20/0.57 (step t10.t1 (cl (= A A)) :rule refl)
% 0.20/0.57 (step t10.t2 (cl (= BOUND_VARIABLE_2153 BOUND_VARIABLE_2153)) :rule refl)
% 0.20/0.57 (step t10.t3 (cl (= (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153))))) :rule all_simplify)
% 0.20/0.57 (step t10 (cl (= (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))))) :rule bind)
% 0.20/0.57 (step t11 (cl (= (forall ((A $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))))) :rule trans :premises (t9 t10))
% 0.20/0.57 (step t12 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (or (not (tptp.leq tptp.n0 B)) (not (tptp.leq B tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A B)))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))))) :rule trans :premises (t8 t11))
% 0.20/0.57 (step t13 (cl (= (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))))) :rule trans :premises (t7 t12))
% 0.20/0.57 (anchor :step t14 :args ((C $$unsorted) (:= C C)))
% 0.20/0.57 (step t14.t1 (cl (= C C)) :rule refl)
% 0.20/0.57 (step t14.t2 (cl (= (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)))) :rule refl)
% 0.20/0.57 (step t14.t3 (cl (= (= (tptp.a_select2 tptp.rho_init C) tptp.init) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) :rule all_simplify)
% 0.20/0.57 (step t14.t4 (cl (= (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C))))) :rule cong :premises (t14.t2 t14.t3))
% 0.20/0.57 (step t14 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))))) :rule bind)
% 0.20/0.57 (step t15 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))))) :rule all_simplify)
% 0.20/0.57 (step t16 (cl (= (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))))) :rule trans :premises (t14 t15))
% 0.20/0.57 (anchor :step t17 :args ((D $$unsorted) (:= D D)))
% 0.20/0.57 (step t17.t1 (cl (= D D)) :rule refl)
% 0.20/0.57 (step t17.t2 (cl (= (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))))) :rule refl)
% 0.20/0.57 (step t17.t3 (cl (= (= (tptp.a_select2 tptp.mu_init D) tptp.init) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) :rule all_simplify)
% 0.20/0.57 (step t17.t4 (cl (= (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D))))) :rule cong :premises (t17.t2 t17.t3))
% 0.20/0.57 (step t17 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))))) :rule bind)
% 0.20/0.57 (step t18 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))))) :rule all_simplify)
% 0.20/0.57 (step t19 (cl (= (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))))) :rule trans :premises (t17 t18))
% 0.20/0.57 (anchor :step t20 :args ((E $$unsorted) (:= E E)))
% 0.20/0.57 (step t20.t1 (cl (= E E)) :rule refl)
% 0.20/0.57 (step t20.t2 (cl (= (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))))) :rule refl)
% 0.20/0.57 (step t20.t3 (cl (= (= (tptp.a_select2 tptp.sigma_init E) tptp.init) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) :rule all_simplify)
% 0.20/0.57 (step t20.t4 (cl (= (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E))))) :rule cong :premises (t20.t2 t20.t3))
% 0.20/0.57 (step t20 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))))) :rule bind)
% 0.20/0.57 (step t21 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))))) :rule all_simplify)
% 0.20/0.57 (step t22 (cl (= (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))))) :rule trans :premises (t20 t21))
% 0.20/0.57 (anchor :step t23 :args ((F $$unsorted) (:= F F)))
% 0.20/0.57 (step t23.t1 (cl (= F F)) :rule refl)
% 0.20/0.57 (step t23.t2 (cl (= (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)))) :rule refl)
% 0.20/0.57 (step t23.t3 (cl (= (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) :rule all_simplify)
% 0.20/0.57 (step t23.t4 (cl (= (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0))))) :rule cong :premises (t23.t2 t23.t3))
% 0.20/0.57 (step t23 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))))) :rule bind)
% 0.20/0.57 (step t24 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))))) :rule all_simplify)
% 0.20/0.57 (step t25 (cl (= (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))))) :rule trans :premises (t23 t24))
% 0.20/0.57 (anchor :step t26 :args ((G $$unsorted) (:= G G)))
% 0.20/0.57 (step t26.t1 (cl (= G G)) :rule refl)
% 0.20/0.57 (step t26.t2 (cl (= (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)))) :rule refl)
% 0.20/0.57 (step t26.t3 (cl (= (= (tptp.a_select2 tptp.muold_init G) tptp.init) (= tptp.init (tptp.a_select2 tptp.muold_init G)))) :rule all_simplify)
% 0.20/0.57 (step t26.t4 (cl (= (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) :rule cong :premises (t26.t2 t26.t3))
% 0.20/0.57 (step t26 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init))) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))))) :rule bind)
% 0.20/0.57 (step t27 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))))) :rule all_simplify)
% 0.20/0.57 (step t28 (cl (= (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init))) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))))) :rule trans :premises (t26 t27))
% 0.20/0.57 (step t29 (cl (= (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))))) :rule cong :premises (t6 t28))
% 0.20/0.57 (anchor :step t30 :args ((H $$unsorted) (:= H H)))
% 0.20/0.57 (step t30.t1 (cl (= H H)) :rule refl)
% 0.20/0.57 (step t30.t2 (cl (= (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)))) :rule refl)
% 0.20/0.57 (step t30.t3 (cl (= (= (tptp.a_select2 tptp.rhoold_init H) tptp.init) (= tptp.init (tptp.a_select2 tptp.rhoold_init H)))) :rule all_simplify)
% 0.20/0.57 (step t30.t4 (cl (= (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) :rule cong :premises (t30.t2 t30.t3))
% 0.20/0.57 (step t30 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init))) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H)))))) :rule bind)
% 0.20/0.57 (step t31 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H)))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H)))))) :rule all_simplify)
% 0.20/0.57 (step t32 (cl (= (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init))) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H)))))) :rule trans :premises (t30 t31))
% 0.20/0.57 (step t33 (cl (= (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))))) :rule cong :premises (t6 t32))
% 0.20/0.57 (anchor :step t34 :args ((I $$unsorted) (:= I I)))
% 0.20/0.57 (step t34.t1 (cl (= I I)) :rule refl)
% 0.20/0.57 (step t34.t2 (cl (= (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)))) :rule refl)
% 0.20/0.57 (step t34.t3 (cl (= (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))) :rule all_simplify)
% 0.20/0.57 (step t34.t4 (cl (= (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I))))) :rule cong :premises (t34.t2 t34.t3))
% 0.20/0.57 (step t34 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) :rule bind)
% 0.20/0.57 (step t35 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) :rule all_simplify)
% 0.20/0.57 (step t36 (cl (= (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) :rule trans :premises (t34 t35))
% 0.20/0.57 (step t37 (cl (= (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I))))))) :rule cong :premises (t6 t36))
% 0.20/0.57 (step t38 (cl (= (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))))) :rule cong :premises (t2 t3 t4 t5 t6 t13 t16 t19 t22 t25 t29 t33 t37))
% 0.20/0.57 (anchor :step t39 :args ((J $$unsorted) (:= J J)))
% 0.20/0.57 (step t39.t1 (cl (= J J)) :rule refl)
% 0.20/0.57 (step t39.t2 (cl (= (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)))) :rule refl)
% 0.20/0.57 (step t39.t3 (cl (= (= (tptp.a_select2 tptp.muold_init J) tptp.init) (= tptp.init (tptp.a_select2 tptp.muold_init J)))) :rule all_simplify)
% 0.20/0.57 (step t39.t4 (cl (= (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))) :rule cong :premises (t39.t2 t39.t3))
% 0.20/0.57 (step t39 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))) :rule bind)
% 0.20/0.57 (step t40 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))) :rule all_simplify)
% 0.20/0.57 (step t41 (cl (= (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))) :rule trans :premises (t39 t40))
% 0.20/0.57 (step t42 (cl (= (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init)))) (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))))) :rule cong :premises (t38 t41))
% 0.20/0.57 (step t43 (cl (= (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq A tptp.n135299)) (forall ((B $$unsorted)) (=> (and (tptp.leq tptp.n0 B) (tptp.leq B tptp.n4)) (= (tptp.a_select3 tptp.q_init A B) tptp.init))))) (forall ((C $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq C tptp.n4)) (= (tptp.a_select2 tptp.rho_init C) tptp.init))) (forall ((D $$unsorted)) (=> (and (tptp.leq tptp.n0 D) (tptp.leq D (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.mu_init D) tptp.init))) (forall ((E $$unsorted)) (=> (and (tptp.leq tptp.n0 E) (tptp.leq E (tptp.pred tptp.pv40))) (= (tptp.a_select2 tptp.sigma_init E) tptp.init))) (forall ((F $$unsorted)) (=> (and (tptp.leq tptp.n0 F) (tptp.leq F tptp.n4)) (= (tptp.a_select3 tptp.center_init F tptp.n0) tptp.init))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (=> (and (tptp.leq tptp.n0 G) (tptp.leq G tptp.n4)) (= (tptp.a_select2 tptp.muold_init G) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (=> (and (tptp.leq tptp.n0 H) (tptp.leq H tptp.n4)) (= (tptp.a_select2 tptp.rhoold_init H) tptp.init)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I tptp.n4)) (= (tptp.a_select2 tptp.sigmaold_init I) tptp.init))))) (forall ((J $$unsorted)) (=> (and (tptp.leq tptp.n0 J) (tptp.leq J tptp.n4)) (= (tptp.a_select2 tptp.muold_init J) tptp.init))))) (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))))) :rule cong :premises (t42))
% 0.20/0.57 (step t44 (cl (not (=> (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I)))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))))) :rule resolution :premises (t1 t43 a52))
% 0.20/0.57 (step t45 (cl (not (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))) :rule not_implies2 :premises (t44))
% 0.20/0.57 (step t46 (cl (= (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))))) :rule hole :args ((forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))) (= G J)))
% 0.20/0.57 (step t47 (cl (not (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))) :rule equiv1 :premises (t46))
% 0.20/0.57 (step t48 (cl (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J)))) (not (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))))) :rule reordering :premises (t47))
% 0.20/0.57 (step t49 (cl (and (tptp.leq tptp.n0 tptp.pv40) (tptp.leq tptp.n0 tptp.pv44) (tptp.leq tptp.pv40 tptp.n4) (tptp.leq tptp.pv44 tptp.n135299) (tptp.gt tptp.loopcounter tptp.n1) (forall ((A $$unsorted) (BOUND_VARIABLE_2153 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n135299)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2153)) (not (tptp.leq BOUND_VARIABLE_2153 tptp.n4)) (= tptp.init (tptp.a_select3 tptp.q_init A BOUND_VARIABLE_2153)))) (forall ((C $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq C tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rho_init C)))) (forall ((D $$unsorted)) (or (not (tptp.leq tptp.n0 D)) (not (tptp.leq D (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.mu_init D)))) (forall ((E $$unsorted)) (or (not (tptp.leq tptp.n0 E)) (not (tptp.leq E (tptp.pred tptp.pv40))) (= tptp.init (tptp.a_select2 tptp.sigma_init E)))) (forall ((F $$unsorted)) (or (not (tptp.leq tptp.n0 F)) (not (tptp.leq F tptp.n4)) (= tptp.init (tptp.a_select3 tptp.center_init F tptp.n0)))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((H $$unsorted)) (or (not (tptp.leq tptp.n0 H)) (not (tptp.leq H tptp.n4)) (= tptp.init (tptp.a_select2 tptp.rhoold_init H))))) (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((I $$unsorted)) (or (not (tptp.leq tptp.n0 I)) (not (tptp.leq I tptp.n4)) (= tptp.init (tptp.a_select2 tptp.sigmaold_init I))))))) :rule not_implies1 :premises (t44))
% 0.20/0.57 (step t50 (cl (=> (tptp.gt tptp.loopcounter tptp.n1) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))))) :rule and :premises (t49))
% 0.20/0.57 (step t51 (cl (not (tptp.gt tptp.loopcounter tptp.n1)) (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) :rule implies :premises (t50))
% 0.20/0.57 (step t52 (cl (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G)))) (not (tptp.gt tptp.loopcounter tptp.n1))) :rule reordering :premises (t51))
% 0.20/0.57 (step t53 (cl (tptp.gt tptp.loopcounter tptp.n1)) :rule and :premises (t49))
% 0.20/0.57 (step t54 (cl (forall ((G $$unsorted)) (or (not (tptp.leq tptp.n0 G)) (not (tptp.leq G tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init G))))) :rule resolution :premises (t52 t53))
% 0.20/0.57 (step t55 (cl (forall ((J $$unsorted)) (or (not (tptp.leq tptp.n0 J)) (not (tptp.leq J tptp.n4)) (= tptp.init (tptp.a_select2 tptp.muold_init J))))) :rule resolution :premises (t48 t54))
% 0.20/0.57 (step t56 (cl) :rule resolution :premises (t45 t55))
% 0.20/0.57
% 0.20/0.57 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.4QDNMe0LaZ/cvc5---1.0.5_30931.smt2
% 0.20/0.57 % cvc5---1.0.5 exiting
% 0.20/0.58 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------