%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : ARI045_1 : TPTP v9.2.1. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n013.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.41s 0.57s % Output : Proof 0.41s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.13 % Problem : ARI045_1 : TPTP v9.2.1. Released v5.0.0. % 0.12/0.14 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.35 % Computer : n013.cluster.edu % 0.17/0.35 % Model : x86_64 x86_64 % 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.35 % Memory : 8042.1875MB % 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.35 % CPULimit : 300 % 0.17/0.35 % WCLimit : 300 % 0.17/0.35 % DateTime : Wed Jun 3 02:25:00 EDT 2026 % 0.17/0.35 % CPUTime : % 0.29/0.51 %----Proving TF0_ARI % 0.41/0.57 --- Run --finite-model-find --decision=internal at 45... % 0.41/0.57 % SZS status Theorem % 0.41/0.57 % SZS output start Proof % 0.41/0.57 ( % 0.41/0.57 (define @t1 () (@var "X" Int)) % 0.41/0.57 (define @t2 () (>= 15 @t1)) % 0.41/0.57 (define @t3 () (@list @t1)) % 0.41/0.57 (define @t4 () (exists @t3 @t2)) % 0.41/0.57 (define @t5 () (not @t4)) % 0.41/0.57 (define @t6 () (>= @t1 16)) % 0.41/0.57 (define @t7 () (+ (* -1 -16) -1)) % 0.41/0.57 (define @t8 () (not @t6)) % 0.41/0.57 (define @t9 () (forall @t3 (not @t8))) % 0.41/0.57 (define @t10 () (not @t9)) % 0.41/0.57 (define @t11 () (+ @t1 1)) % 0.41/0.57 (assume @p1 @t5) % 0.41/0.57 (assume @p2 true) % 0.41/0.57 (step @p3 :rule evaluate :args ((not true))) % 0.41/0.57 (step @p4 :rule evaluate :args ((not false))) % 0.41/0.57 (assume-push @p29 (forall @t3 @t6)) % 0.41/0.57 (step @p6 :rule evaluate :args ((>= @t7 16))) % 0.41/0.57 (step @p7 :rule instantiate :premises (@p29) :args ((@list @t7))) % 0.41/0.57 (step @p8 false :rule eq_resolve :premises (@p7 @p6)) % 0.41/0.57 (step-pop @p30 :rule scope :premises (@p8)) % 0.41/0.57 (step @p9 :rule process_scope :premises (@p30) :args (false)) % 0.41/0.57 (step @p11 :rule false_intro :premises (@p9)) % 0.41/0.57 (step @p12 :rule bool-double-not-elim :args (@t6)) % 0.41/0.57 (step @p13 :rule cong :premises (@p12) :args (@t9)) % 0.41/0.57 (step @p14 :rule trans :premises (@p13 @p11)) % 0.41/0.57 (step @p15 :rule cong :premises (@p14) :args (@t10)) % 0.41/0.57 (step @p16 :rule trans :premises (@p15 @p4)) % 0.41/0.57 (step @p17 :rule exists-elim :args ((= (exists @t3 @t8) @t10))) % 0.41/0.57 (step @p18 :rule trans :premises (@p17 @p16)) % 0.41/0.57 (step @p19 :rule arith_poly_norm :args ((= (* 15 (- 16 @t11)) (* 15 (- 15 @t1))))) % 0.41/0.57 (step @p20 :rule arith_poly_norm_rel :premises (@p19) :args ((= (>= 16 @t11) @t2))) % 0.41/0.57 (step @p21 :rule arith-geq-tighten :args (@t1 16)) % 0.41/0.57 (step @p22 :rule trans :premises (@p21 @p20)) % 0.41/0.57 (step @p23 :rule symm :premises (@p22)) % 0.41/0.57 (step @p24 :rule cong :premises (@p23) :args (@t4)) % 0.41/0.57 (step @p25 :rule trans :premises (@p24 @p18)) % 0.41/0.57 (step @p26 :rule cong :premises (@p25) :args (@t5)) % 0.41/0.57 (step @p27 :rule trans :premises (@p26 @p3)) % 0.41/0.57 (step @p28 false :rule eq_resolve :premises (@p1 @p27)) % 0.41/0.57 ) % 0.41/0.57 % SZS output end Proof % 0.41/0.57 % cvc5 exiting %------------------------------------------------------------------------------