TSTP Solution File: SWV023+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV023+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n003.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:19 EDT 2024
% Result : Theorem 0.22s 0.58s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SWV023+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.11/0.15 % Command : do_cvc5 %s %d
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 26 22:17:09 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.53 %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.58 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.58 % SZS status Theorem for /export/starexec/sandbox/tmp/tmp.vVQxps7xFA/cvc5---1.0.5_21271.smt2
% 0.22/0.58 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.vVQxps7xFA/cvc5---1.0.5_21271.smt2
% 0.22/0.58 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))))
% 0.22/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.22/0.58 (assume a2 (forall ((X $$unsorted)) (not (tptp.gt X X))))
% 0.22/0.58 (assume a3 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.22/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.22/0.58 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))))
% 0.22/0.58 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))))
% 0.22/0.58 (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))))
% 0.22/0.58 (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))))
% 0.22/0.58 (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))))
% 0.22/0.58 (assume a10 (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)))
% 0.22/0.58 (assume a11 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))))
% 0.22/0.58 (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.22/0.58 (assume a13 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))))
% 0.22/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.22/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.22/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.22/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.22/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.22/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.22/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.22/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.22/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.22/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.22/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.22/0.58 (assume a25 (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)))
% 0.22/0.58 (assume a26 (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))))
% 0.22/0.58 (assume a27 (= (tptp.succ tptp.tptp_minus_1) tptp.n0))
% 0.22/0.58 (assume a28 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))))
% 0.22/0.58 (assume a29 (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))))
% 0.22/0.58 (assume a30 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))))
% 0.22/0.58 (assume a31 (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))))
% 0.22/0.58 (assume a32 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.22/0.58 (assume a33 (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.22/0.58 (assume a34 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.22/0.58 (assume a35 (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.22/0.58 (assume a36 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.22/0.58 (assume a37 (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.22/0.58 (assume a38 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.22/0.58 (assume a39 (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)))
% 0.22/0.58 (assume a40 (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)))
% 0.22/0.58 (assume a41 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))))
% 0.22/0.58 (assume a42 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))))
% 0.22/0.58 (assume a43 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))))
% 0.22/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.22/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.22/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.22/0.58 (assume a47 (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)))
% 0.22/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.22/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.22/0.58 (assume a50 tptp.true)
% 0.22/0.58 (assume a51 (not (= tptp.def tptp.use)))
% 0.22/0.58 (assume a52 (not (=> (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) tptp.true)))
% 0.22/0.58 (assume a53 (tptp.gt tptp.n5 tptp.n4))
% 0.22/0.58 (assume a54 (tptp.gt tptp.n4 tptp.tptp_minus_1))
% 0.22/0.58 (assume a55 (tptp.gt tptp.n5 tptp.tptp_minus_1))
% 0.22/0.58 (assume a56 (tptp.gt tptp.n0 tptp.tptp_minus_1))
% 0.22/0.58 (assume a57 (tptp.gt tptp.n1 tptp.tptp_minus_1))
% 0.22/0.58 (assume a58 (tptp.gt tptp.n2 tptp.tptp_minus_1))
% 0.22/0.58 (assume a59 (tptp.gt tptp.n3 tptp.tptp_minus_1))
% 0.22/0.58 (assume a60 (tptp.gt tptp.n4 tptp.n0))
% 0.22/0.58 (assume a61 (tptp.gt tptp.n5 tptp.n0))
% 0.22/0.58 (assume a62 (tptp.gt tptp.n1 tptp.n0))
% 0.22/0.58 (assume a63 (tptp.gt tptp.n2 tptp.n0))
% 0.22/0.58 (assume a64 (tptp.gt tptp.n3 tptp.n0))
% 0.22/0.58 (assume a65 (tptp.gt tptp.n4 tptp.n1))
% 0.22/0.58 (assume a66 (tptp.gt tptp.n5 tptp.n1))
% 0.22/0.58 (assume a67 (tptp.gt tptp.n2 tptp.n1))
% 0.22/0.58 (assume a68 (tptp.gt tptp.n3 tptp.n1))
% 0.22/0.58 (assume a69 (tptp.gt tptp.n4 tptp.n2))
% 0.22/0.58 (assume a70 (tptp.gt tptp.n5 tptp.n2))
% 0.22/0.58 (assume a71 (tptp.gt tptp.n3 tptp.n2))
% 0.22/0.58 (assume a72 (tptp.gt tptp.n4 tptp.n3))
% 0.22/0.58 (assume a73 (tptp.gt tptp.n5 tptp.n3))
% 0.22/0.58 (assume a74 (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.22/0.58 (assume a75 (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.22/0.58 (assume a76 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))))
% 0.22/0.58 (assume a77 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))))
% 0.22/0.58 (assume a78 (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.22/0.58 (assume a79 (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.22/0.58 (assume a80 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4))
% 0.22/0.58 (assume a81 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5))
% 0.22/0.58 (assume a82 (= (tptp.succ tptp.n0) tptp.n1))
% 0.22/0.58 (assume a83 (= (tptp.succ (tptp.succ tptp.n0)) tptp.n2))
% 0.22/0.58 (assume a84 (= (tptp.succ (tptp.succ (tptp.succ tptp.n0))) tptp.n3))
% 0.22/0.58 (assume a85 true)
% 0.22/0.58 (step t1 (cl (not (= (not (=> (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) tptp.true)) (not (=> (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))) tptp.true)))) (not (not (=> (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) tptp.true))) (not (=> (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))) tptp.true))) :rule equiv_pos2)
% 0.22/0.58 (step t2 (cl (= (= tptp.i0_init tptp.init) (= tptp.init tptp.i0_init))) :rule all_simplify)
% 0.22/0.58 (step t3 (cl (= (= tptp.sigma_init tptp.init) (= tptp.init tptp.sigma_init))) :rule all_simplify)
% 0.22/0.58 (anchor :step t4 :args ((A $$unsorted) (:= A A)))
% 0.22/0.58 (step t4.t1 (cl (= A A)) :rule refl)
% 0.22/0.58 (step t4.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.22/0.58 (anchor :step t4.t3 :args ((B $$unsorted) (:= B B)))
% 0.22/0.58 (step t4.t3.t1 (cl (= B B)) :rule refl)
% 0.22/0.58 (step t4.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.22/0.58 (step t4.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.22/0.58 (step t4.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 (t4.t3.t2 t4.t3.t3))
% 0.22/0.58 (step t4.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.22/0.58 (step t4.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.22/0.58 (step t4.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 (t4.t3 t4.t4))
% 0.22/0.58 (step t4.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 (t4.t2 t4.t5))
% 0.22/0.58 (step t4 (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.22/0.58 (step t5 (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.22/0.58 (step t6 (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_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A))))))) :rule all_simplify)
% 0.22/0.58 (anchor :step t7 :args ((A $$unsorted) (:= A A) (BOUND_VARIABLE_2070 $$unsorted) (:= BOUND_VARIABLE_2070 BOUND_VARIABLE_2070)))
% 0.22/0.58 (step t7.t1 (cl (= A A)) :rule refl)
% 0.22/0.58 (step t7.t2 (cl (= BOUND_VARIABLE_2070 BOUND_VARIABLE_2070)) :rule refl)
% 0.22/0.58 (step t7.t3 (cl (= (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A)))) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A))))) :rule all_simplify)
% 0.22/0.58 (step t7 (cl (= (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (or (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A))))) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A)))))) :rule bind)
% 0.22/0.58 (step t8 (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_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A)))))) :rule trans :premises (t6 t7))
% 0.22/0.58 (step t9 (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_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A)))))) :rule trans :premises (t5 t8))
% 0.22/0.58 (step t10 (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_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 A)))))) :rule trans :premises (t4 t9))
% 0.22/0.58 (anchor :step t11 :args ((C $$unsorted) (:= C C)))
% 0.22/0.58 (step t11.t1 (cl (= C C)) :rule refl)
% 0.22/0.58 (step t11.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.22/0.58 (step t11.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.22/0.58 (step t11.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 (t11.t2 t11.t3))
% 0.22/0.58 (step t11 (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.22/0.58 (step t12 (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.22/0.58 (step t13 (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 (t11 t12))
% 0.22/0.58 (step t14 (cl (= (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))))) :rule cong :premises (t2 t3 t10 t13))
% 0.22/0.58 (step t15 (cl (= tptp.true tptp.true)) :rule refl)
% 0.22/0.58 (step t16 (cl (= (=> (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) tptp.true) (=> (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))) tptp.true))) :rule cong :premises (t14 t15))
% 0.22/0.58 (step t17 (cl (= (not (=> (and (= tptp.i0_init tptp.init) (= tptp.sigma_init tptp.init) (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)))) tptp.true)) (not (=> (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))) tptp.true)))) :rule cong :premises (t16))
% 0.22/0.58 (step t18 (cl (not (=> (and (= tptp.init tptp.i0_init) (= tptp.init tptp.sigma_init) (forall ((A $$unsorted) (BOUND_VARIABLE_2070 $$unsorted)) (or (not (tptp.leq tptp.n0 A)) (not (tptp.leq A tptp.n2)) (not (tptp.leq tptp.n0 BOUND_VARIABLE_2070)) (not (tptp.leq BOUND_VARIABLE_2070 tptp.n3)) (= tptp.init (tptp.a_select3 tptp.simplex7_init BOUND_VARIABLE_2070 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))))) tptp.true))) :rule resolution :premises (t1 t17 a52))
% 0.22/0.58 (step t19 (cl (not tptp.true)) :rule not_implies2 :premises (t18))
% 0.22/0.58 (step t20 (cl) :rule resolution :premises (t19 a50))
% 0.22/0.58
% 0.22/0.58 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.vVQxps7xFA/cvc5---1.0.5_21271.smt2
% 0.22/0.58 % cvc5---1.0.5 exiting
% 0.22/0.59 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------