%------------------------------------------------------------------------------ % File : cvc5---1.3.4 % Problem : ARI605_1 : TPTP v9.2.1. Released v5.1.0. % Transfm : none % Format : tptp:raw % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % Computer : n028.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:57 AM UTC 2026 % Result : Theorem 0.40s 0.61s % Output : Proof 0.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : ARI605_1 : TPTP v9.2.1. Released v5.1.0. % 0.12/0.13 % Command : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM % 0.17/0.34 % Computer : n028.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Wed Jun 3 02:30:05 EDT 2026 % 0.17/0.34 % CPUTime : % 0.30/0.48 %----Proving TF0_ARI % 0.40/0.61 --- Run --finite-model-find --decision=internal at 45... % 0.40/0.61 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60... % 0.40/0.61 % SZS status Theorem % 0.40/0.61 % SZS output start Proof % 0.40/0.61 ( % 0.40/0.61 (declare-const tptp.a Int) % 0.40/0.61 (declare-const tptp.f (-> Int Int)) % 0.40/0.61 (declare-const tptp.b Int) % 0.40/0.61 (define @t1 () (tptp.f tptp.b)) % 0.40/0.61 (define @t2 () (tptp.f tptp.a)) % 0.40/0.61 (define @t3 () (+ @t2 @t1)) % 0.40/0.61 (define @t4 () (@var "Y" Int)) % 0.40/0.61 (define @t5 () (+ tptp.a tptp.b)) % 0.40/0.61 (define @t6 () (and (< @t5 @t4) (< @t4 @t3))) % 0.40/0.61 (define @t7 () (@list @t4)) % 0.40/0.61 (define @t8 () (exists @t7 @t6)) % 0.40/0.61 (define @t9 () (@var "X" Int)) % 0.40/0.61 (define @t10 () (tptp.f @t9)) % 0.40/0.61 (define @t11 () (forall (@list @t9) (> @t10 @t9))) % 0.40/0.61 (define @t12 () (=> @t11 @t8)) % 0.40/0.61 (define @t13 () (not @t12)) % 0.40/0.61 (define @t14 () (* -1 @t1)) % 0.40/0.61 (define @t15 () (* -1 @t2)) % 0.40/0.61 (define @t16 () (+ @t4 @t15 @t14)) % 0.40/0.61 (define @t17 () (>= @t16 0)) % 0.40/0.61 (define @t18 () (+ tptp.a tptp.b (* -1 @t4))) % 0.40/0.61 (define @t19 () (>= @t18 0)) % 0.40/0.61 (define @t20 () (not @t17)) % 0.40/0.61 (define @t21 () (not @t19)) % 0.40/0.61 (define @t22 () (and @t21 @t20)) % 0.40/0.61 (define @t23 () (forall @t7 (not @t22))) % 0.40/0.61 (define @t24 () (not @t23)) % 0.40/0.61 (define @t25 () (>= @t4 @t3)) % 0.40/0.61 (define @t26 () (>= @t5 @t4)) % 0.40/0.61 (define @t27 () (+ @t9 (* -1 @t10))) % 0.40/0.61 (define @t28 () (>= @t9 @t10)) % 0.40/0.61 (define @t29 () (+ tptp.a tptp.b @t15 @t14)) % 0.40/0.61 (define @t30 () (>= @t29 -1)) % 0.40/0.61 (define @t31 () (+ @t14 @t15 @t1 @t2 -1)) % 0.40/0.61 (define @t32 () (+ -1 @t2 @t1)) % 0.40/0.61 (define @t33 () (+ @t32 @t15 @t14)) % 0.40/0.61 (define @t34 () (>= @t33 0)) % 0.40/0.61 (define @t35 () (+ 1 tptp.a tptp.b @t15 @t14)) % 0.40/0.61 (define @t36 () (+ 1 @t15 @t14)) % 0.40/0.61 (define @t37 () (* -1 @t32)) % 0.40/0.61 (define @t38 () (+ tptp.a tptp.b @t37)) % 0.40/0.61 (define @t39 () (>= @t38 0)) % 0.40/0.61 (define @t40 () (or @t39 @t34)) % 0.40/0.61 (define @t41 () (forall @t7 (or @t19 @t17))) % 0.40/0.61 (define @t42 () (not @t30)) % 0.40/0.61 (define @t43 () (+ tptp.b @t14)) % 0.40/0.61 (define @t44 () (>= @t43 0)) % 0.40/0.61 (define @t45 () (+ tptp.a @t15)) % 0.40/0.61 (define @t46 () (>= @t45 0)) % 0.40/0.61 (define @t47 () (not @t44)) % 0.40/0.61 (define @t48 () (not @t46)) % 0.40/0.61 (define @t49 () (+ -1 1)) % 0.40/0.61 (define @t50 () (>= @t45 @t49)) % 0.40/0.61 (define @t51 () (<= @t45 -1)) % 0.40/0.61 (define @t52 () (* -1 -1)) % 0.40/0.61 (define @t53 () (+ -1 0 @t52)) % 0.40/0.61 (define @t54 () (* 0 tptp.a)) % 0.40/0.61 (define @t55 () (* 0 tptp.b)) % 0.40/0.61 (define @t56 () (* 0 @t2)) % 0.40/0.61 (define @t57 () (* 0 @t1)) % 0.40/0.61 (define @t58 () (+ @t57 @t56 @t55 @t54)) % 0.40/0.61 (define @t59 () (+ @t45 @t43 (* -1 @t29))) % 0.40/0.61 (define @t60 () (>= @t59 @t53)) % 0.40/0.61 (define @t61 () (and @t30 @t47 @t48)) % 0.40/0.61 (assume @p1 @t13) % 0.40/0.61 (assume @p2 true) % 0.40/0.61 (step @p3 :rule bool-double-not-elim :args (@t17)) % 0.40/0.61 (step @p4 :rule bool-double-not-elim :args (@t19)) % 0.40/0.61 (step @p5 :rule nary_cong :premises (@p4 @p3) :args ((or (not @t21) (not @t20)))) % 0.40/0.61 (step @p6 :rule bool-and-de-morgan :args (@t21 @t20 true)) % 0.40/0.61 (step @p7 :rule trans :premises (@p6 @p5)) % 0.40/0.61 (step @p8 :rule cong :premises (@p7) :args (@t23)) % 0.40/0.61 (step @p9 :rule cong :premises (@p8) :args (@t24)) % 0.40/0.61 (step @p10 :rule exists-elim :args ((= (exists @t7 @t22) @t24))) % 0.40/0.61 (step @p11 :rule trans :premises (@p10 @p9)) % 0.40/0.61 (step @p12 :rule arith_poly_norm :args ((= (* 1 (- @t4 @t3)) (* 1 (- @t16 0))))) % 0.40/0.61 (step @p13 :rule arith_poly_norm_rel :premises (@p12) :args ((= @t25 @t17))) % 0.40/0.61 (step @p14 :rule cong :premises (@p13) :args ((not @t25))) % 0.40/0.61 (step @p15 :rule arith-elim-lt :args (@t4 @t3)) % 0.40/0.61 (step @p16 :rule trans :premises (@p15 @p14)) % 0.40/0.61 (step @p17 :rule arith_poly_norm :args ((= (* 1 (- @t5 @t4)) (* 1 (- @t18 0))))) % 0.40/0.61 (step @p18 :rule arith_poly_norm_rel :premises (@p17) :args ((= @t26 @t19))) % 0.40/0.61 (step @p19 :rule cong :premises (@p18) :args ((not @t26))) % 0.40/0.61 (step @p20 :rule arith-elim-lt :args (@t5 @t4)) % 0.40/0.61 (step @p21 :rule trans :premises (@p20 @p19)) % 0.40/0.61 (step @p22 :rule nary_cong :premises (@p21 @p16) :args (@t6)) % 0.40/0.61 (step @p23 :rule cong :premises (@p22) :args (@t8)) % 0.40/0.61 (step @p24 :rule trans :premises (@p23 @p11)) % 0.40/0.61 (step @p25 :rule arith_poly_norm :args ((= (* 1 (- @t9 @t10)) (* 1 (- @t27 0))))) % 0.40/0.61 (step @p26 :rule arith_poly_norm_rel :premises (@p25) :args ((= @t28 (>= @t27 0)))) % 0.40/0.61 (step @p27 :rule arith-elim-leq :args (@t10 @t9)) % 0.40/0.61 (step @p28 :rule trans :premises (@p27 @p26)) % 0.40/0.61 (step @p29 :rule cong :premises (@p28) :args ((not (<= @t10 @t9)))) % 0.40/0.61 (step @p30 :rule symm :premises (@p27)) % 0.40/0.61 (step @p31 :rule cong :premises (@p30) :args ((not @t28))) % 0.40/0.61 (step @p32 :rule arith-elim-gt :args (@t10 @t9)) % 0.40/0.61 (step @p33 :rule trans :premises (@p32 @p31)) % 0.40/0.61 (step @p34 :rule trans :premises (@p33 @p29)) % 0.40/0.61 (step @p35 :rule cong :premises (@p34) :args (@t11)) % 0.40/0.61 (step @p36 :rule cong :premises (@p35 @p24) :args (@t12)) % 0.40/0.61 (step @p37 :rule cong :premises (@p36) :args (@t13)) % 0.40/0.61 (step @p38 :rule eq_resolve :premises (@p1 @p37)) % 0.40/0.61 (step @p39 :rule not_implies_elim1 :premises (@p38)) % 0.40/0.61 (step @p40 :rule instantiate :premises (@p39) :args ((@list tptp.a))) % 0.40/0.61 (step @p41 :rule instantiate :premises (@p39) :args ((@list tptp.b))) % 0.40/0.61 (step @p42 :rule not_implies_elim2 :premises (@p38)) % 0.40/0.61 (step @p43 :rule not_not_elim :premises (@p42)) % 0.40/0.61 (step @p44 :rule aci_norm :args ((= (or @t30 false) @t30))) % 0.40/0.61 (step @p45 :rule evaluate :args ((>= -1 0))) % 0.40/0.61 (step @p46 :rule refl :args (0)) % 0.40/0.61 (step @p47 :rule arith_poly_norm :args ((= @t31 -1))) % 0.40/0.61 (step @p48 :rule arith_poly_norm :args ((= @t33 @t31))) % 0.40/0.61 (step @p49 :rule trans :premises (@p48 @p47)) % 0.40/0.61 (step @p50 :rule cong :premises (@p49 @p46) :args (@t34)) % 0.40/0.61 (step @p51 :rule trans :premises (@p50 @p45)) % 0.40/0.61 (step @p52 :rule arith_poly_norm :args ((= (* 1 (- @t35 0)) (* 1 (- @t29 -1))))) % 0.40/0.61 (step @p53 :rule arith_poly_norm_rel :premises (@p52) :args ((= (>= @t35 0) @t30))) % 0.40/0.61 (step @p54 :rule arith_poly_norm :args ((= (+ tptp.a tptp.b @t36) @t35))) % 0.40/0.61 (step @p55 :rule arith_poly_norm :args ((= @t37 @t36))) % 0.40/0.61 (step @p56 :rule refl :args (tptp.b)) % 0.40/0.61 (step @p57 :rule refl :args (tptp.a)) % 0.40/0.61 (step @p58 :rule nary_cong :premises (@p57 @p56 @p55) :args (@t38)) % 0.40/0.61 (step @p59 :rule trans :premises (@p58 @p54)) % 0.40/0.61 (step @p60 :rule cong :premises (@p59 @p46) :args (@t39)) % 0.40/0.61 (step @p61 :rule trans :premises (@p60 @p53)) % 0.40/0.61 (step @p62 :rule nary_cong :premises (@p61 @p51) :args (@t40)) % 0.40/0.61 (step @p63 :rule trans :premises (@p62 @p44)) % 0.40/0.61 (step @p64 :rule refl :args (@t41)) % 0.40/0.61 (step @p65 :rule cong :premises (@p64 @p63) :args ((=> @t41 @t40))) % 0.40/0.61 (assume-push @p156 @t41) % 0.40/0.61 (step @p67 :rule instantiate :premises (@p43) :args ((@list @t32))) % 0.40/0.61 (step-pop @p157 :rule scope :premises (@p67)) % 0.40/0.61 (step @p68 :rule process_scope :premises (@p157) :args (@t40)) % 0.40/0.61 (step @p70 :rule eq_resolve :premises (@p68 @p65)) % 0.40/0.61 (step @p71 :rule implies_elim :premises (@p70)) % 0.40/0.61 (step @p72 :rule chain_m_resolution :premises (@p71 @p43) :args (@t30 (@list false) (@list @t41))) % 0.40/0.61 (step @p73 :rule refl :args (@t42)) % 0.40/0.61 (step @p74 :rule bool-double-not-elim :args (@t44)) % 0.40/0.61 (step @p75 :rule bool-double-not-elim :args (@t46)) % 0.40/0.61 (step @p76 :rule nary_cong :premises (@p75 @p74 @p73) :args ((or (not @t48) (not @t47) @t42))) % 0.40/0.61 (assume-push @p158 @t30) % 0.40/0.61 (assume-push @p159 @t47) % 0.40/0.61 (assume-push @p160 @t48) % 0.40/0.61 (step @p80 :rule arith-elim-leq :args (@t45 -1)) % 0.40/0.61 (step @p81 :rule symm :premises (@p80)) % 0.40/0.61 (step @p82 :rule cong :premises (@p81) :args ((not (>= -1 @t45)))) % 0.40/0.61 (step @p83 :rule arith-elim-gt :args (@t45 -1)) % 0.40/0.61 (step @p84 :rule trans :premises (@p83 @p82)) % 0.40/0.61 (step @p85 :rule evaluate :args (@t49)) % 0.40/0.61 (step @p86 :rule refl :args (@t45)) % 0.40/0.61 (step @p87 :rule cong :premises (@p86 @p85) :args (@t50)) % 0.40/0.61 (step @p88 :rule cong :premises (@p87) :args ((not @t50))) % 0.40/0.61 (step @p89 :rule arith-leq-norm :args (@t45 -1)) % 0.40/0.61 (step @p90 :rule trans :premises (@p89 @p88)) % 0.40/0.61 (step @p91 :rule cong :premises (@p90) :args ((not @t51))) % 0.40/0.61 (step @p92 :rule trans :premises (@p91 @p75)) % 0.40/0.61 (step @p93 :rule trans :premises (@p84 @p92)) % 0.40/0.61 (step @p94 :rule symm :premises (@p93)) % 0.40/0.61 (step @p95 :rule trans :premises (@p92 @p94)) % 0.40/0.61 (assume-push @p161 @t51) % 0.40/0.61 (step @p97 :rule evaluate :args ((not true))) % 0.40/0.61 (step @p98 :rule evaluate :args ((>= 0 0))) % 0.40/0.61 (step @p99 :rule evaluate :args ((+ -1 0 1))) % 0.40/0.61 (step @p100 :rule evaluate :args (@t52)) % 0.40/0.61 (step @p101 :rule refl :args (-1)) % 0.40/0.61 (step @p102 :rule nary_cong :premises (@p101 @p46 @p100) :args (@t53)) % 0.40/0.61 (step @p103 :rule trans :premises (@p102 @p99)) % 0.40/0.61 (step @p104 :rule evaluate :args ((+ 0 0 0 0))) % 0.40/0.61 (step @p105 :rule arith_poly_norm :args ((= @t54 0))) % 0.40/0.61 (step @p106 :rule arith_poly_norm :args ((= @t55 0))) % 0.40/0.61 (step @p107 :rule arith_poly_norm :args ((= @t56 0))) % 0.40/0.61 (step @p108 :rule arith_poly_norm :args ((= @t57 0))) % 0.40/0.61 (step @p109 :rule nary_cong :premises (@p108 @p107 @p106 @p105) :args (@t58)) % 0.40/0.61 (step @p110 :rule trans :premises (@p109 @p104)) % 0.40/0.61 (step @p111 :rule arith_poly_norm :args ((= @t59 @t58))) % 0.40/0.61 (step @p112 :rule trans :premises (@p111 @p110)) % 0.40/0.61 (step @p113 :rule cong :premises (@p112 @p103) :args (@t60)) % 0.40/0.61 (step @p114 :rule trans :premises (@p113 @p98)) % 0.40/0.61 (step @p115 :rule cong :premises (@p114) :args ((not @t60))) % 0.40/0.61 (step @p116 :rule trans :premises (@p115 @p97)) % 0.40/0.61 (step @p117 :rule arith-elim-lt :args (@t59 @t53)) % 0.40/0.61 (step @p118 :rule trans :premises (@p117 @p116)) % 0.40/0.61 (step @p119 :rule arith_mult_neg :args (-1 @t30)) % 0.40/0.61 (step @p120 :rule evaluate :args ((< -1 0))) % 0.40/0.61 (step @p121 :rule true_elim :premises (@p120)) % 0.40/0.61 (step @p122 :rule and_intro :premises (@p121 @p72)) % 0.40/0.61 (step @p123 :rule modus_ponens :premises (@p122 @p119)) % 0.40/0.61 (step @p124 :rule arith-elim-lt :args (@t43 0)) % 0.40/0.61 (step @p125 :rule symm :premises (@p124)) % 0.40/0.61 (step @p126 :rule eq_resolve :premises (@p41 @p125)) % 0.40/0.61 (step @p127 :rule arith-elim-lt :args (@t45 0)) % 0.40/0.61 (step @p128 :rule symm :premises (@p127)) % 0.40/0.61 (step @p129 :rule eq_resolve :premises (@p40 @p128)) % 0.40/0.61 (step @p130 :rule int_tight_ub :premises (@p129)) % 0.40/0.61 (step @p131 :rule arith_sum_ub :premises (@p130 @p126 @p123)) % 0.40/0.61 (step @p132 false :rule eq_resolve :premises (@p131 @p118)) % 0.40/0.61 (step-pop @p162 :rule scope :premises (@p132)) % 0.40/0.61 (step @p133 :rule process_scope :premises (@p162) :args (false)) % 0.40/0.61 (step @p135 :rule eq_resolve :premises (@p133 @p95)) % 0.40/0.61 (step @p136 :rule eq_resolve :premises (@p135 @p84)) % 0.40/0.61 (step @p127 :rule arith-elim-lt :args (@t45 0)) % 0.40/0.61 (step @p128 :rule symm :premises (@p127)) % 0.40/0.61 (step @p129 :rule eq_resolve :premises (@p40 @p128)) % 0.40/0.61 (step @p137 :rule int_tight_ub :premises (@p129)) % 0.40/0.61 (step @p138 false :rule contra :premises (@p137 @p136)) % 0.40/0.61 (step-pop @p163 :rule scope :premises (@p138)) % 0.40/0.61 (step-pop @p164 :rule scope :premises (@p163)) % 0.40/0.61 (step-pop @p165 :rule scope :premises (@p164)) % 0.40/0.61 (step @p139 :rule process_scope :premises (@p165) :args (false)) % 0.40/0.61 (assume-push @p166 @t48) % 0.40/0.61 (assume-push @p167 @t47) % 0.40/0.61 (assume-push @p168 @t30) % 0.40/0.61 (step @p146 :rule and_intro :premises (@p72 @p41 @p40)) % 0.40/0.61 (step-pop @p169 :rule scope :premises (@p146)) % 0.40/0.61 (step-pop @p170 :rule scope :premises (@p169)) % 0.40/0.61 (step-pop @p171 :rule scope :premises (@p170)) % 0.40/0.61 (step @p147 :rule process_scope :premises (@p171) :args (@t61)) % 0.40/0.61 (step @p151 :rule implies_elim :premises (@p147)) % 0.40/0.61 (step @p152 :rule resolution :premises (@p151 @p139) :args (true @t61)) % 0.40/0.61 (step @p153 :rule not_and :premises (@p152)) % 0.40/0.61 (step @p154 :rule eq_resolve :premises (@p153 @p76)) % 0.40/0.61 (step @p155 false :rule chain_m_resolution :premises (@p154 @p72 @p41 @p40) :args (false (@list false true true) (@list @t30 @t44 @t46))) % 0.40/0.61 ) % 0.40/0.61 % SZS output end Proof % 0.40/0.61 % cvc5 exiting %------------------------------------------------------------------------------