TSTP Solution File: SWV099+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV099+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n018.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 : Thu Aug 31 21:49:18 EDT 2023
% Result : Theorem 0.20s 0.56s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV099+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 10:18:48 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.56 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.ZmRjOB6Zgy/cvc5---1.0.5_14053.p...
% 0.20/0.56 ------- get file name : TPTP file name is SWV099+1
% 0.20/0.56 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_14053.smt2...
% 0.20/0.56 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.56 % SZS status Theorem for SWV099+1
% 0.20/0.56 % SZS output start Proof for SWV099+1
% 0.20/0.56 (
% 0.20/0.56 (let ((_let_1 (tptp.succ tptp.n0))) (let ((_let_2 (tptp.succ _let_1))) (let ((_let_3 (tptp.succ _let_2))) (let ((_let_4 (tptp.succ _let_3))) (let ((_let_5 (tptp.leq tptp.pv5 (tptp.minus tptp.n999 tptp.n1)))) (let ((_let_6 (tptp.leq tptp.n0 tptp.pv5))) (let ((_let_7 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n5))) (let ((_let_8 (= _let_7 tptp.use))) (let ((_let_9 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n4))) (let ((_let_10 (= _let_9 tptp.use))) (let ((_let_11 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n3))) (let ((_let_12 (= _let_11 tptp.use))) (let ((_let_13 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n2))) (let ((_let_14 (= _let_13 tptp.use))) (let ((_let_15 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n1))) (let ((_let_16 (= _let_15 tptp.use))) (let ((_let_17 (tptp.a_select2 tptp.xinit_noise_defuse tptp.n0))) (let ((_let_18 (= _let_17 tptp.use))) (let ((_let_19 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n5))) (let ((_let_20 (= _let_19 tptp.use))) (let ((_let_21 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n4))) (let ((_let_22 (= _let_21 tptp.use))) (let ((_let_23 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n3))) (let ((_let_24 (= _let_23 tptp.use))) (let ((_let_25 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n2))) (let ((_let_26 (= _let_25 tptp.use))) (let ((_let_27 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n1))) (let ((_let_28 (= _let_27 tptp.use))) (let ((_let_29 (tptp.a_select2 tptp.xinit_mean_defuse tptp.n0))) (let ((_let_30 (= _let_29 tptp.use))) (let ((_let_31 (tptp.a_select2 tptp.xinit_defuse tptp.n5))) (let ((_let_32 (= _let_31 tptp.use))) (let ((_let_33 (tptp.a_select2 tptp.xinit_defuse tptp.n4))) (let ((_let_34 (= _let_33 tptp.use))) (let ((_let_35 (tptp.a_select2 tptp.xinit_defuse tptp.n3))) (let ((_let_36 (= _let_35 tptp.use))) (let ((_let_37 (tptp.a_select3 tptp.u_defuse tptp.n2 tptp.n0))) (let ((_let_38 (= _let_37 tptp.use))) (let ((_let_39 (tptp.a_select3 tptp.u_defuse tptp.n1 tptp.n0))) (let ((_let_40 (= _let_39 tptp.use))) (let ((_let_41 (tptp.a_select3 tptp.u_defuse tptp.n0 tptp.n0))) (let ((_let_42 (= _let_41 tptp.use))) (let ((_let_43 (tptp.a_select2 tptp.sigma_defuse tptp.n5))) (let ((_let_44 (= _let_43 tptp.use))) (let ((_let_45 (tptp.a_select2 tptp.sigma_defuse tptp.n4))) (let ((_let_46 (= _let_45 tptp.use))) (let ((_let_47 (tptp.a_select2 tptp.sigma_defuse tptp.n3))) (let ((_let_48 (= _let_47 tptp.use))) (let ((_let_49 (tptp.a_select2 tptp.sigma_defuse tptp.n2))) (let ((_let_50 (= _let_49 tptp.use))) (let ((_let_51 (tptp.a_select2 tptp.sigma_defuse tptp.n1))) (let ((_let_52 (= _let_51 tptp.use))) (let ((_let_53 (tptp.a_select2 tptp.sigma_defuse tptp.n0))) (let ((_let_54 (= _let_53 tptp.use))) (let ((_let_55 (tptp.a_select2 tptp.rho_defuse tptp.n2))) (let ((_let_56 (= _let_55 tptp.use))) (let ((_let_57 (tptp.a_select2 tptp.rho_defuse tptp.n1))) (let ((_let_58 (= _let_57 tptp.use))) (let ((_let_59 (tptp.a_select2 tptp.rho_defuse tptp.n0))) (let ((_let_60 (= _let_59 tptp.use))) (let ((_let_61 (not (=> (and _let_60 _let_58 _let_56 _let_54 _let_52 _let_50 _let_48 _let_46 _let_44 _let_42 _let_40 _let_38 _let_36 _let_34 _let_32 _let_30 _let_28 _let_26 _let_24 _let_22 _let_20 _let_18 _let_16 _let_14 _let_12 _let_10 _let_8 _let_6 _let_5 (forall ((A $$unsorted) (B $$unsorted)) (=> (and (tptp.leq tptp.n0 A) (tptp.leq tptp.n0 B) (tptp.leq A tptp.n2) (tptp.leq B (tptp.minus tptp.pv5 tptp.n1))) (and (= (tptp.a_select3 tptp.u_defuse A B) tptp.use) (= (tptp.a_select3 tptp.z_defuse A B) tptp.use))))) (and _let_60 _let_58 _let_56 _let_54 _let_52 _let_50 _let_48 _let_46 _let_44 _let_42 _let_40 _let_38 _let_36 _let_34 _let_32 _let_30 _let_28 _let_26 _let_24 _let_22 _let_20 _let_18 _let_16 _let_14 _let_12 _let_10 _let_8 _let_6 _let_5 (forall ((C $$unsorted) (D $$unsorted)) (=> (and (tptp.leq tptp.n0 C) (tptp.leq tptp.n0 D) (tptp.leq C tptp.n2) (tptp.leq D (tptp.minus tptp.pv5 tptp.n1))) (and (= (tptp.a_select3 tptp.u_defuse C D) tptp.use) (= (tptp.a_select3 tptp.z_defuse C D) tptp.use))))))))) (let ((_let_62 (forall ((C $$unsorted) (D $$unsorted)) (or (not (tptp.leq tptp.n0 C)) (not (tptp.leq tptp.n0 D)) (not (tptp.leq C tptp.n2)) (not (tptp.leq D (tptp.minus tptp.pv5 tptp.n1))) (and (= tptp.use (tptp.a_select3 tptp.u_defuse C D)) (= tptp.use (tptp.a_select3 tptp.z_defuse C D))))))) (let ((_let_63 (EQ_RESOLVE (ASSUME :args (_let_61)) (MACRO_SR_EQ_INTRO :args (_let_61 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_64 (NOT_IMPLIES_ELIM1 _let_63))) (let ((_let_65 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq tptp.n0 B)) (not (tptp.leq A tptp.n2)) (not (tptp.leq B (tptp.minus tptp.pv5 tptp.n1))) (and (= tptp.use (tptp.a_select3 tptp.u_defuse A B)) (= tptp.use (tptp.a_select3 tptp.z_defuse A B))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (NOT_AND (NOT_IMPLIES_ELIM2 _let_63)) (MACRO_RESOLUTION_TRUST (REORDERING (EQUIV_ELIM1 (ALPHA_EQUIV :args (_let_65 (= A C) (= B D)))) :args ((or _let_62 (not _let_65)))) (AND_ELIM _let_64 :args (29)) :args (_let_62 false _let_65)) (AND_ELIM _let_64 :args (28)) (AND_ELIM _let_64 :args (27)) (AND_ELIM _let_64 :args (26)) (AND_ELIM _let_64 :args (25)) (AND_ELIM _let_64 :args (24)) (AND_ELIM _let_64 :args (23)) (AND_ELIM _let_64 :args (22)) (AND_ELIM _let_64 :args (21)) (AND_ELIM _let_64 :args (20)) (AND_ELIM _let_64 :args (19)) (AND_ELIM _let_64 :args (18)) (AND_ELIM _let_64 :args (17)) (AND_ELIM _let_64 :args (16)) (AND_ELIM _let_64 :args (15)) (AND_ELIM _let_64 :args (14)) (AND_ELIM _let_64 :args (13)) (AND_ELIM _let_64 :args (12)) (AND_ELIM _let_64 :args (11)) (AND_ELIM _let_64 :args (10)) (AND_ELIM _let_64 :args (9)) (AND_ELIM _let_64 :args (8)) (AND_ELIM _let_64 :args (7)) (AND_ELIM _let_64 :args (6)) (AND_ELIM _let_64 :args (5)) (AND_ELIM _let_64 :args (4)) (AND_ELIM _let_64 :args (3)) (AND_ELIM _let_64 :args (2)) (AND_ELIM _let_64 :args (1)) (AND_ELIM _let_64 :args (0)) :args (false false _let_62 false _let_5 false _let_6 false (= tptp.use _let_7) false (= tptp.use _let_9) false (= tptp.use _let_11) false (= tptp.use _let_13) false (= tptp.use _let_15) false (= tptp.use _let_17) false (= tptp.use _let_19) false (= tptp.use _let_21) false (= tptp.use _let_23) false (= tptp.use _let_25) false (= tptp.use _let_27) false (= tptp.use _let_29) false (= tptp.use _let_31) false (= tptp.use _let_33) false (= tptp.use _let_35) false (= tptp.use _let_37) false (= tptp.use _let_39) false (= tptp.use _let_41) false (= tptp.use _let_43) false (= tptp.use _let_45) false (= tptp.use _let_47) false (= tptp.use _let_49) false (= tptp.use _let_51) false (= tptp.use _let_53) false (= tptp.use _let_55) false (= tptp.use _let_57) false (= tptp.use _let_59))) :args ((forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))) (forall ((X $$unsorted)) (not (tptp.gt X X))) (forall ((X $$unsorted)) (tptp.leq X X)) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.leq X Y) (tptp.leq Y Z)) (tptp.leq X Z))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))) (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)) (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))) (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq tptp.n0 (tptp.uniform_int_rnd C X)))) (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))) (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))) (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)) (let ((_let_1 (tptp.trans A))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.inv A))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.tptp_update3 A K K VAL))) (=> (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 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.tptp_madd A B))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.tptp_msub A B))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (tptp.tptp_mmul A (tptp.tptp_mmul B (tptp.trans A))))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (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)) (let ((_let_1 (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)))))) (=> (and (tptp.leq tptp.n0 I) (tptp.leq I N) (tptp.leq tptp.n0 J) (tptp.leq J N)) (= (tptp.a_select3 _let_1 I J) (tptp.a_select3 _let_1 J I))))))) (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)) (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))) (= (tptp.succ tptp.tptp_minus_1) tptp.n0) (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))) (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))) (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))) (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))) (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))) (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))) (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))) (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))) (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))) (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))) (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))) (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)) (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))) (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))) (forall ((X $$unsorted) (U $$unsorted) (V $$unsorted) (VAL $$unsorted)) (= (tptp.a_select3 (tptp.tptp_update3 X U V VAL) U V) VAL)) (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))) (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))) (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)) (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))) (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))) tptp.true (not (= tptp.def tptp.use)) _let_61 (tptp.gt tptp.n5 tptp.n4) (tptp.gt tptp.n999 tptp.n4) (tptp.gt tptp.n999 tptp.n5) (tptp.gt tptp.n4 tptp.tptp_minus_1) (tptp.gt tptp.n5 tptp.tptp_minus_1) (tptp.gt tptp.n999 tptp.tptp_minus_1) (tptp.gt tptp.n0 tptp.tptp_minus_1) (tptp.gt tptp.n1 tptp.tptp_minus_1) (tptp.gt tptp.n2 tptp.tptp_minus_1) (tptp.gt tptp.n3 tptp.tptp_minus_1) (tptp.gt tptp.n4 tptp.n0) (tptp.gt tptp.n5 tptp.n0) (tptp.gt tptp.n999 tptp.n0) (tptp.gt tptp.n1 tptp.n0) (tptp.gt tptp.n2 tptp.n0) (tptp.gt tptp.n3 tptp.n0) (tptp.gt tptp.n4 tptp.n1) (tptp.gt tptp.n5 tptp.n1) (tptp.gt tptp.n999 tptp.n1) (tptp.gt tptp.n2 tptp.n1) (tptp.gt tptp.n3 tptp.n1) (tptp.gt tptp.n4 tptp.n2) (tptp.gt tptp.n5 tptp.n2) (tptp.gt tptp.n999 tptp.n2) (tptp.gt tptp.n3 tptp.n2) (tptp.gt tptp.n4 tptp.n3) (tptp.gt tptp.n5 tptp.n3) (tptp.gt tptp.n999 tptp.n3) (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)))) (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)))) (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))) (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))) (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n2)) (or (= X tptp.n0) (= X tptp.n1) (= X tptp.n2)))) (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)))) (= _let_4 tptp.n4) (= (tptp.succ _let_4) tptp.n5) (= _let_1 tptp.n1) (= _let_2 tptp.n2) (= _let_3 tptp.n3) true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.20/0.57 )
% 0.20/0.57 % SZS output end Proof for SWV099+1
% 0.20/0.57 % cvc5---1.0.5 exiting
% 0.20/0.57 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------