TSTP Solution File: SWV133+1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SWV133+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : do_cvc5 %s %d
% Computer : n016.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:34 EDT 2024
% Result : Theorem 0.45s 0.64s
% Output : Proof 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV133+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n016.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 22:29:39 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.51 %----Proving TF0_NAR, FOF, or CNF
% 0.45/0.64 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.45/0.64 % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.xRQxuJqiZe/cvc5---1.0.5_31062.smt2
% 0.45/0.64 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.xRQxuJqiZe/cvc5---1.0.5_31062.smt2
% 0.45/0.64 (assume a0 (forall ((X $$unsorted) (Y $$unsorted)) (or (tptp.gt X Y) (tptp.gt Y X) (= X Y))))
% 0.45/0.64 (assume a1 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))))
% 0.45/0.64 (assume a2 (forall ((X $$unsorted)) (not (tptp.gt X X))))
% 0.45/0.64 (assume a3 (forall ((X $$unsorted)) (tptp.leq X X)))
% 0.45/0.64 (assume a4 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.leq X Y) (tptp.leq Y Z)) (tptp.leq X Z))))
% 0.45/0.64 (assume a5 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.lt X Y) (tptp.gt Y X))))
% 0.45/0.64 (assume a6 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.geq X Y) (tptp.leq Y X))))
% 0.45/0.64 (assume a7 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.gt Y X) (tptp.leq X Y))))
% 0.45/0.64 (assume a8 (forall ((X $$unsorted) (Y $$unsorted)) (=> (and (tptp.leq X Y) (not (= X Y))) (tptp.gt Y X))))
% 0.45/0.64 (assume a9 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X (tptp.pred Y)) (tptp.gt Y X))))
% 0.45/0.64 (assume a10 (forall ((X $$unsorted)) (tptp.gt (tptp.succ X) X)))
% 0.45/0.64 (assume a11 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq X Y) (tptp.leq X (tptp.succ Y)))))
% 0.45/0.64 (assume a12 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.45/0.64 (assume a13 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq (tptp.uniform_int_rnd C X) X))))
% 0.45/0.64 (assume a14 (forall ((X $$unsorted) (C $$unsorted)) (=> (tptp.leq tptp.n0 X) (tptp.leq tptp.n0 (tptp.uniform_int_rnd C X)))))
% 0.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (assume a25 (forall ((Body $$unsorted)) (= (tptp.sum tptp.n0 tptp.tptp_minus_1 Body) tptp.n0)))
% 0.45/0.64 (assume a26 (forall ((Body $$unsorted)) (= tptp.tptp_float_0_0 (tptp.sum tptp.n0 tptp.tptp_minus_1 Body))))
% 0.45/0.64 (assume a27 (= (tptp.succ tptp.tptp_minus_1) tptp.n0))
% 0.45/0.64 (assume a28 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n1) (tptp.succ X))))
% 0.45/0.64 (assume a29 (forall ((X $$unsorted)) (= (tptp.plus tptp.n1 X) (tptp.succ X))))
% 0.45/0.64 (assume a30 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n2) (tptp.succ (tptp.succ X)))))
% 0.45/0.64 (assume a31 (forall ((X $$unsorted)) (= (tptp.plus tptp.n2 X) (tptp.succ (tptp.succ X)))))
% 0.45/0.64 (assume a32 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n3) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.45/0.64 (assume a33 (forall ((X $$unsorted)) (= (tptp.plus tptp.n3 X) (tptp.succ (tptp.succ (tptp.succ X))))))
% 0.45/0.64 (assume a34 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n4) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.45/0.64 (assume a35 (forall ((X $$unsorted)) (= (tptp.plus tptp.n4 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ X)))))))
% 0.45/0.64 (assume a36 (forall ((X $$unsorted)) (= (tptp.plus X tptp.n5) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.45/0.64 (assume a37 (forall ((X $$unsorted)) (= (tptp.plus tptp.n5 X) (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ X))))))))
% 0.45/0.64 (assume a38 (forall ((X $$unsorted)) (= (tptp.minus X tptp.n1) (tptp.pred X))))
% 0.45/0.64 (assume a39 (forall ((X $$unsorted)) (= (tptp.pred (tptp.succ X)) X)))
% 0.45/0.64 (assume a40 (forall ((X $$unsorted)) (= (tptp.succ (tptp.pred X)) X)))
% 0.45/0.64 (assume a41 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq (tptp.succ X) (tptp.succ Y)) (tptp.leq X Y))))
% 0.45/0.64 (assume a42 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.succ X) Y) (tptp.gt Y X))))
% 0.45/0.64 (assume a43 (forall ((X $$unsorted) (Y $$unsorted)) (=> (tptp.leq (tptp.minus X Y) X) (tptp.leq tptp.n0 Y))))
% 0.45/0.64 (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.45/0.64 (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.45/0.64 (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.45/0.64 (assume a47 (forall ((X $$unsorted) (U $$unsorted) (VAL $$unsorted)) (= (tptp.a_select2 (tptp.tptp_update2 X U VAL) U) VAL)))
% 0.45/0.64 (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.45/0.64 (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.45/0.64 (assume a50 tptp.true)
% 0.45/0.64 (assume a51 (not (= tptp.def tptp.use)))
% 0.45/0.64 (assume a52 (not (=> (and (not (tptp.leq (tptp.a_select2 tptp.s_values7 tptp.pv1325) (tptp.a_select2 tptp.s_values7 tptp.s_worst7))) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n2 tptp.pv1325) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv1325 tptp.n3) (tptp.leq (tptp.a_select2 tptp.s_values7 tptp.pv1325) (tptp.a_select2 tptp.s_values7 tptp.s_best7))) (tptp.leq tptp.n0 tptp.pv1325))))
% 0.45/0.64 (assume a53 (tptp.gt tptp.n5 tptp.n4))
% 0.45/0.64 (assume a54 (tptp.gt tptp.n4 tptp.tptp_minus_1))
% 0.45/0.64 (assume a55 (tptp.gt tptp.n5 tptp.tptp_minus_1))
% 0.45/0.64 (assume a56 (tptp.gt tptp.n0 tptp.tptp_minus_1))
% 0.45/0.64 (assume a57 (tptp.gt tptp.n1 tptp.tptp_minus_1))
% 0.45/0.64 (assume a58 (tptp.gt tptp.n2 tptp.tptp_minus_1))
% 0.45/0.64 (assume a59 (tptp.gt tptp.n3 tptp.tptp_minus_1))
% 0.45/0.64 (assume a60 (tptp.gt tptp.n4 tptp.n0))
% 0.45/0.64 (assume a61 (tptp.gt tptp.n5 tptp.n0))
% 0.45/0.64 (assume a62 (tptp.gt tptp.n1 tptp.n0))
% 0.45/0.64 (assume a63 (tptp.gt tptp.n2 tptp.n0))
% 0.45/0.64 (assume a64 (tptp.gt tptp.n3 tptp.n0))
% 0.45/0.64 (assume a65 (tptp.gt tptp.n4 tptp.n1))
% 0.45/0.64 (assume a66 (tptp.gt tptp.n5 tptp.n1))
% 0.45/0.64 (assume a67 (tptp.gt tptp.n2 tptp.n1))
% 0.45/0.64 (assume a68 (tptp.gt tptp.n3 tptp.n1))
% 0.45/0.64 (assume a69 (tptp.gt tptp.n4 tptp.n2))
% 0.45/0.64 (assume a70 (tptp.gt tptp.n5 tptp.n2))
% 0.45/0.64 (assume a71 (tptp.gt tptp.n3 tptp.n2))
% 0.45/0.64 (assume a72 (tptp.gt tptp.n4 tptp.n3))
% 0.45/0.64 (assume a73 (tptp.gt tptp.n5 tptp.n3))
% 0.45/0.64 (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.45/0.64 (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.45/0.64 (assume a76 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n0)) (= X tptp.n0))))
% 0.45/0.64 (assume a77 (forall ((X $$unsorted)) (=> (and (tptp.leq tptp.n0 X) (tptp.leq X tptp.n1)) (or (= X tptp.n0) (= X tptp.n1)))))
% 0.45/0.64 (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.45/0.64 (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.45/0.64 (assume a80 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0)))) tptp.n4))
% 0.45/0.64 (assume a81 (= (tptp.succ (tptp.succ (tptp.succ (tptp.succ (tptp.succ tptp.n0))))) tptp.n5))
% 0.45/0.64 (assume a82 (= (tptp.succ tptp.n0) tptp.n1))
% 0.45/0.64 (assume a83 (= (tptp.succ (tptp.succ tptp.n0)) tptp.n2))
% 0.45/0.64 (assume a84 (= (tptp.succ (tptp.succ (tptp.succ tptp.n0))) tptp.n3))
% 0.45/0.64 (assume a85 true)
% 0.45/0.64 (step t1 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) :rule implies_neg1)
% 0.45/0.64 (anchor :step t2)
% 0.45/0.64 (assume t2.a0 (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))))
% 0.45/0.64 (step t2.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule forall_inst :args ((:= X (tptp.succ tptp.pv1325)) (:= Y tptp.n2) (:= Z tptp.n0)))
% 0.45/0.64 (step t2.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule or :premises (t2.t1))
% 0.45/0.64 (step t2.t3 (cl (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t2.t2 t2.a0))
% 0.45/0.64 (step t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule subproof :discharge (t2.a0))
% 0.45/0.64 (step t3 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t1 t2))
% 0.45/0.64 (step t4 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (not (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule implies_neg2)
% 0.45/0.64 (step t5 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule resolution :premises (t3 t4))
% 0.45/0.64 (step t6 (cl (=> (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule contraction :premises (t5))
% 0.45/0.64 (step t7 (cl (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule implies :premises (t6))
% 0.45/0.64 (step t8 (cl (not (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)) :rule or_pos)
% 0.45/0.64 (step t9 (cl (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0) (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule reordering :premises (t8))
% 0.45/0.64 (step t10 (cl (not (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (tptp.leq tptp.n0 tptp.pv1325) (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule equiv_pos1)
% 0.45/0.64 (step t11 (cl (tptp.leq tptp.n0 tptp.pv1325) (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)) (not (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule reordering :premises (t10))
% 0.45/0.64 (step t12 (cl (not (tptp.leq tptp.n0 tptp.pv1325))) :rule not_implies2 :premises (a52))
% 0.45/0.64 (step t13 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) :rule implies_neg1)
% 0.45/0.64 (anchor :step t14)
% 0.45/0.64 (assume t14.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.45/0.64 (step t14.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule forall_inst :args ((:= X tptp.n0) (:= Y tptp.pv1325)))
% 0.45/0.64 (step t14.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule or :premises (t14.t1))
% 0.45/0.64 (step t14.t3 (cl (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t14.t2 t14.a0))
% 0.45/0.64 (step t14 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule subproof :discharge (t14.a0))
% 0.45/0.64 (step t15 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t13 t14))
% 0.45/0.64 (step t16 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (not (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule implies_neg2)
% 0.45/0.64 (step t17 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule resolution :premises (t15 t16))
% 0.45/0.64 (step t18 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule contraction :premises (t17))
% 0.45/0.64 (step t19 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule implies :premises (t18))
% 0.45/0.64 (step t20 (cl (= (tptp.leq tptp.n0 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t19 a12))
% 0.45/0.64 (step t21 (cl (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n0))) :rule resolution :premises (t11 t12 t20))
% 0.45/0.64 (step t22 (cl (not (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) (not (tptp.leq tptp.n2 tptp.pv1325)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) :rule equiv_pos2)
% 0.45/0.64 (step t23 (cl (not (tptp.leq tptp.n2 tptp.pv1325)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2) (not (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)))) :rule reordering :premises (t22))
% 0.45/0.64 (step t24 (cl (and (not (tptp.leq (tptp.a_select2 tptp.s_values7 tptp.pv1325) (tptp.a_select2 tptp.s_values7 tptp.s_worst7))) (tptp.leq tptp.n0 tptp.s_best7) (tptp.leq tptp.n0 tptp.s_sworst7) (tptp.leq tptp.n0 tptp.s_worst7) (tptp.leq tptp.n2 tptp.pv1325) (tptp.leq tptp.s_best7 tptp.n3) (tptp.leq tptp.s_sworst7 tptp.n3) (tptp.leq tptp.s_worst7 tptp.n3) (tptp.leq tptp.pv1325 tptp.n3) (tptp.leq (tptp.a_select2 tptp.s_values7 tptp.pv1325) (tptp.a_select2 tptp.s_values7 tptp.s_best7)))) :rule not_implies1 :premises (a52))
% 0.45/0.64 (step t25 (cl (tptp.leq tptp.n2 tptp.pv1325)) :rule and :premises (t24))
% 0.45/0.64 (step t26 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) :rule implies_neg1)
% 0.45/0.64 (anchor :step t27)
% 0.45/0.64 (assume t27.a0 (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))))
% 0.45/0.64 (step t27.t1 (cl (or (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)))) :rule forall_inst :args ((:= X tptp.n2) (:= Y tptp.pv1325)))
% 0.45/0.64 (step t27.t2 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule or :premises (t27.t1))
% 0.45/0.64 (step t27.t3 (cl (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule resolution :premises (t27.t2 t27.a0))
% 0.45/0.64 (step t27 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule subproof :discharge (t27.a0))
% 0.45/0.64 (step t28 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule resolution :premises (t26 t27))
% 0.45/0.64 (step t29 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) (not (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)))) :rule implies_neg2)
% 0.45/0.64 (step t30 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)))) :rule resolution :premises (t28 t29))
% 0.45/0.64 (step t31 (cl (=> (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)))) :rule contraction :premises (t30))
% 0.45/0.64 (step t32 (cl (not (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.leq X Y) (tptp.gt (tptp.succ Y) X)))) (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule implies :premises (t31))
% 0.45/0.64 (step t33 (cl (= (tptp.leq tptp.n2 tptp.pv1325) (tptp.gt (tptp.succ tptp.pv1325) tptp.n2))) :rule resolution :premises (t32 a12))
% 0.45/0.64 (step t34 (cl (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) :rule resolution :premises (t23 t25 t33))
% 0.45/0.65 (step t35 (cl (not (or (not (tptp.gt (tptp.succ tptp.pv1325) tptp.n2)) (not (tptp.gt tptp.n2 tptp.n0)) (tptp.gt (tptp.succ tptp.pv1325) tptp.n0)))) :rule resolution :premises (t9 a63 t21 t34))
% 0.45/0.65 (step t36 (cl (not (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))))) (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z)))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) :rule equiv_pos2)
% 0.45/0.65 (step t37 (cl (= (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (=> (and (tptp.gt X Y) (tptp.gt Y Z)) (tptp.gt X Z))) (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z))))) :rule all_simplify)
% 0.45/0.65 (step t38 (cl (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (or (not (tptp.gt X Y)) (not (tptp.gt Y Z)) (tptp.gt X Z)))) :rule resolution :premises (t36 t37 a1))
% 0.45/0.65 (step t39 (cl) :rule resolution :premises (t7 t35 t38))
% 0.45/0.65
% 0.45/0.65 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.xRQxuJqiZe/cvc5---1.0.5_31062.smt2
% 0.45/0.65 % cvc5---1.0.5 exiting
% 0.45/0.65 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------