%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : ARI046_1 : TPTP v9.2.1. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % Computer : n012.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 Jun 3 08:07:02 AM UTC 2026 % Result : Theorem 0.15s 0.36s % Output : Proof 0.15s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.06 % Problem : ARI046_1 : TPTP v9.2.1. Released v5.0.0. % 0.00/0.07 % Command : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM % 0.08/0.25 % Computer : n012.cluster.edu % 0.08/0.25 % Model : x86_64 x86_64 % 0.08/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.25 % Memory : 8042.1875MB % 0.08/0.25 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.25 % CPULimit : 300 % 0.08/0.25 % WCLimit : 300 % 0.08/0.25 % DateTime : Wed Jun 3 02:25:03 EDT 2026 % 0.08/0.25 % CPUTime : % 0.15/0.33 %----Proving TF0_ARI % 0.15/0.36 --- Run --finite-model-find --decision=internal at 45... % 0.15/0.36 % SZS status Theorem % 0.15/0.36 % SZS output start Proof % 0.15/0.36 ( % 0.15/0.36 (define @t1 () (@var "Y" Int)) % 0.15/0.36 (define @t2 () (@var "X" Int)) % 0.15/0.36 (define @t3 () (>= @t2 @t1)) % 0.15/0.36 (define @t4 () (@list @t2 @t1)) % 0.15/0.36 (define @t5 () (exists @t4 @t3)) % 0.15/0.36 (define @t6 () (not @t5)) % 0.15/0.36 (define @t7 () (not true)) % 0.15/0.36 (define @t8 () (@list @t1)) % 0.15/0.36 (define @t9 () (* -1 @t1)) % 0.15/0.36 (define @t10 () (+ @t2 @t9)) % 0.15/0.36 (define @t11 () (>= @t10 0)) % 0.15/0.36 (define @t12 () (not @t11)) % 0.15/0.36 (define @t13 () (forall (@list @t2) @t12)) % 0.15/0.36 (define @t14 () (* -1 @t9)) % 0.15/0.36 (define @t15 () (+ @t14 @t9)) % 0.15/0.36 (define @t16 () (>= @t15 0)) % 0.15/0.36 (define @t17 () (forall @t8 @t13)) % 0.15/0.36 (define @t18 () (forall (@list @t1 @t2) @t12)) % 0.15/0.36 (define @t19 () (forall @t4 @t12)) % 0.15/0.36 (define @t20 () (not @t19)) % 0.15/0.36 (assume @p1 @t6) % 0.15/0.36 (assume @p2 true) % 0.15/0.36 (step @p3 :rule evaluate :args (@t7)) % 0.15/0.36 (step @p4 :rule evaluate :args ((not false))) % 0.15/0.36 (step @p5 :rule quant-unused-vars :args ((= (forall @t8 false) false))) % 0.15/0.36 (assume-push @p37 @t13) % 0.15/0.36 (step @p7 :rule evaluate :args (@t7)) % 0.15/0.36 (step @p8 :rule evaluate :args ((>= 0 0))) % 0.15/0.36 (step @p9 :rule refl :args (0)) % 0.15/0.36 (step @p10 :rule arith_poly_norm :args ((= @t15 0))) % 0.15/0.36 (step @p11 :rule cong :premises (@p10 @p9) :args (@t16)) % 0.15/0.36 (step @p12 :rule trans :premises (@p11 @p8)) % 0.15/0.36 (step @p13 :rule cong :premises (@p12) :args ((not @t16))) % 0.15/0.36 (step @p14 :rule trans :premises (@p13 @p7)) % 0.15/0.36 (step @p15 :rule instantiate :premises (@p37) :args ((@list @t14))) % 0.15/0.36 (step @p16 false :rule eq_resolve :premises (@p15 @p14)) % 0.15/0.36 (step-pop @p38 :rule scope :premises (@p16)) % 0.15/0.36 (step @p17 :rule process_scope :premises (@p38) :args (false)) % 0.15/0.36 (step @p19 :rule false_intro :premises (@p17)) % 0.15/0.36 (step @p20 :rule cong :premises (@p19) :args (@t17)) % 0.15/0.36 (step @p21 :rule quant-merge-prenex :args ((= @t17 @t18))) % 0.15/0.36 (step @p22 :rule symm :premises (@p21)) % 0.15/0.36 (step @p23 :rule quant_var_reordering :args ((= @t19 @t18))) % 0.15/0.36 (step @p24 :rule trans :premises (@p23 @p22 @p20)) % 0.15/0.36 (step @p25 :rule trans :premises (@p24 @p5)) % 0.15/0.36 (step @p26 :rule cong :premises (@p25) :args (@t20)) % 0.15/0.36 (step @p27 :rule trans :premises (@p26 @p4)) % 0.15/0.36 (step @p28 :rule exists-elim :args ((= (exists @t4 @t11) @t20))) % 0.15/0.36 (step @p29 :rule trans :premises (@p28 @p27)) % 0.15/0.36 (step @p30 :rule arith_poly_norm :args ((= (* 1 (- @t2 @t1)) (* 1 (- @t10 0))))) % 0.15/0.36 (step @p31 :rule arith_poly_norm_rel :premises (@p30) :args ((= @t3 @t11))) % 0.15/0.36 (step @p32 :rule cong :premises (@p31) :args (@t5)) % 0.15/0.36 (step @p33 :rule trans :premises (@p32 @p29)) % 0.15/0.36 (step @p34 :rule cong :premises (@p33) :args (@t6)) % 0.15/0.36 (step @p35 :rule trans :premises (@p34 @p3)) % 0.15/0.36 (step @p36 false :rule eq_resolve :premises (@p1 @p35)) % 0.15/0.36 ) % 0.15/0.36 % SZS output end Proof % 0.15/0.36 % cvc5 exiting %------------------------------------------------------------------------------