↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : ARI571_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 : n002.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:53 AM UTC 2026

% Result   : Theorem 0.30s 0.54s
% Output   : Proof 0.30s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : ARI571_1 : TPTP v9.2.1. Released v5.1.0.
% 0.00/0.13  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n002.cluster.edu
% 0.18/0.34  % Model    : x86_64 x86_64
% 0.18/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.34  % Memory   : 8042.1875MB
% 0.18/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.34  % CPULimit : 300
% 0.18/0.34  % WCLimit  : 300
% 0.18/0.34  % DateTime : Wed Jun  3 02:29:48 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.30/0.48  %----Proving TF0_ARI
% 0.30/0.54  --- Run --finite-model-find --decision=internal at 45...
% 0.30/0.54  % SZS status Theorem
% 0.30/0.54  % SZS output start Proof
% 0.30/0.54  (
% 0.30/0.54  (define @t1 () (@var "Y" Int))
% 0.30/0.54  (define @t2 () (- 5 @t1))
% 0.30/0.54  (define @t3 () (@var "X" Int))
% 0.30/0.54  (define @t4 () (- 2 @t3))
% 0.30/0.54  (define @t5 () (=> (< @t1 @t3) (< @t4 @t2)))
% 0.30/0.54  (define @t6 () (@list @t3 @t1))
% 0.30/0.54  (define @t7 () (forall @t6 @t5))
% 0.30/0.54  (define @t8 () (not @t7))
% 0.30/0.54  (define @t9 () (* -1 1))
% 0.30/0.54  (define @t10 () (+ -3 @t9))
% 0.30/0.54  (define @t11 () (* -1 @t1))
% 0.30/0.54  (define @t12 () (+ @t3 @t11))
% 0.30/0.54  (define @t13 () (>= @t12 -2))
% 0.30/0.54  (define @t14 () (>= @t12 1))
% 0.30/0.54  (define @t15 () (forall @t6 (or (not @t14) @t13)))
% 0.30/0.54  (define @t16 () (@quantifiers_skolemize @t15 0))
% 0.30/0.54  (define @t17 () (* 0 @t16))
% 0.30/0.54  (define @t18 () (@quantifiers_skolemize @t15 1))
% 0.30/0.54  (define @t19 () (* 0 @t18))
% 0.30/0.54  (define @t20 () (+ @t19 @t17))
% 0.30/0.54  (define @t21 () (+ @t16 (* -1 @t18)))
% 0.30/0.54  (define @t22 () (+ @t21 (* -1 @t21)))
% 0.30/0.54  (define @t23 () (>= @t21 1))
% 0.30/0.54  (define @t24 () (+ 5 @t11))
% 0.30/0.54  (define @t25 () (+ 2 (* -1 @t3)))
% 0.30/0.54  (define @t26 () (+ @t12 1))
% 0.30/0.54  (define @t27 () (>= @t4 @t2))
% 0.30/0.54  (define @t28 () (>= @t1 @t3))
% 0.30/0.54  (define @t29 () (>= @t21 -2))
% 0.30/0.54  (define @t30 () (not @t23))
% 0.30/0.54  (define @t31 () (or @t30 @t29))
% 0.30/0.54  (define @t32 () (@list true))
% 0.30/0.54  (define @t33 () (@list @t31))
% 0.30/0.54  (assume @p1 @t8)
% 0.30/0.54  (assume @p2 true)
% 0.30/0.54  (step @p3 :rule evaluate :args ((<= 0 -4)))
% 0.30/0.54  (step @p4 :rule evaluate :args ((+ -3 -1)))
% 0.30/0.54  (step @p5 :rule evaluate :args (@t9))
% 0.30/0.54  (step @p6 :rule refl :args (-3))
% 0.30/0.54  (step @p7 :rule nary_cong :premises (@p6 @p5) :args (@t10))
% 0.30/0.54  (step @p8 :rule trans :premises (@p7 @p4))
% 0.30/0.54  (step @p9 :rule evaluate :args ((+ 0 0)))
% 0.30/0.54  (step @p10 :rule arith_poly_norm :args ((= @t17 0)))
% 0.30/0.54  (step @p11 :rule arith_poly_norm :args ((= @t19 0)))
% 0.30/0.54  (step @p12 :rule nary_cong :premises (@p11 @p10) :args (@t20))
% 0.30/0.54  (step @p13 :rule trans :premises (@p12 @p9))
% 0.30/0.54  (step @p14 :rule arith_poly_norm :args ((= @t22 @t20)))
% 0.30/0.54  (step @p15 :rule trans :premises (@p14 @p13))
% 0.30/0.54  (step @p16 :rule cong :premises (@p15 @p8) :args ((<= @t22 @t10)))
% 0.30/0.54  (step @p17 :rule trans :premises (@p16 @p3))
% 0.30/0.54  (step @p18 :rule arith_mult_neg :args (-1 @t23))
% 0.30/0.54  (step @p19 :rule bool-impl-elim :args (@t14 @t13))
% 0.30/0.54  (step @p20 :rule cong :premises (@p19) :args ((forall @t6 (=> @t14 @t13))))
% 0.30/0.54  (step @p21 :rule bool-double-not-elim :args (@t13))
% 0.30/0.54  (step @p22 :rule arith_poly_norm :args ((= (* -3 (- -2 @t26)) (* -3 (- @t25 @t24)))))
% 0.30/0.54  (step @p23 :rule arith_poly_norm_rel :premises (@p22) :args ((= (>= -2 @t26) (>= @t25 @t24))))
% 0.30/0.54  (step @p24 :rule arith-geq-tighten :args (@t12 -2))
% 0.30/0.54  (step @p25 :rule trans :premises (@p24 @p23))
% 0.30/0.54  (step @p26 :rule symm :premises (@p25))
% 0.30/0.54  (step @p27 :rule arith_poly_norm :args ((= @t2 @t24)))
% 0.30/0.54  (step @p28 :rule arith_poly_norm :args ((= @t4 @t25)))
% 0.30/0.54  (step @p29 :rule cong :premises (@p28 @p27) :args (@t27))
% 0.30/0.54  (step @p30 :rule trans :premises (@p29 @p26))
% 0.30/0.54  (step @p31 :rule cong :premises (@p30) :args ((not @t27)))
% 0.30/0.54  (step @p32 :rule trans :premises (@p31 @p21))
% 0.30/0.54  (step @p33 :rule arith-elim-lt :args (@t4 @t2))
% 0.30/0.54  (step @p34 :rule trans :premises (@p33 @p32))
% 0.30/0.54  (step @p35 :rule bool-double-not-elim :args (@t14))
% 0.30/0.54  (step @p36 :rule arith_poly_norm :args ((= (* -1 (- 1 @t26)) (* -1 (- @t1 @t3)))))
% 0.30/0.54  (step @p37 :rule arith_poly_norm_rel :premises (@p36) :args ((= (>= 1 @t26) @t28)))
% 0.30/0.54  (step @p38 :rule arith-geq-tighten :args (@t12 1))
% 0.30/0.54  (step @p39 :rule trans :premises (@p38 @p37))
% 0.30/0.54  (step @p40 :rule symm :premises (@p39))
% 0.30/0.54  (step @p41 :rule cong :premises (@p40) :args ((not @t28)))
% 0.30/0.54  (step @p42 :rule trans :premises (@p41 @p35))
% 0.30/0.54  (step @p43 :rule arith-elim-lt :args (@t1 @t3))
% 0.30/0.54  (step @p44 :rule trans :premises (@p43 @p42))
% 0.30/0.54  (step @p45 :rule cong :premises (@p44 @p34) :args (@t5))
% 0.30/0.54  (step @p46 :rule cong :premises (@p45) :args (@t7))
% 0.30/0.54  (step @p47 :rule trans :premises (@p46 @p20))
% 0.30/0.54  (step @p48 :rule cong :premises (@p47) :args (@t8))
% 0.30/0.54  (step @p49 :rule eq_resolve :premises (@p1 @p48))
% 0.30/0.54  (step @p50 :rule skolemize :premises (@p49))
% 0.30/0.54  (step @p51 :rule bool-double-not-elim :args (@t23))
% 0.30/0.54  (step @p52 :rule refl :args (@t31))
% 0.30/0.54  (step @p53 :rule nary_cong :premises (@p52 @p51) :args ((or @t31 (not @t30))))
% 0.30/0.54  (step @p54 :rule cnf_or_neg :args (@t31 0))
% 0.30/0.54  (step @p55 :rule eq_resolve :premises (@p54 @p53))
% 0.30/0.54  (step @p56 :rule reordering :premises (@p55) :args ((or @t23 @t31)))
% 0.30/0.54  (step @p57 :rule chain_m_resolution :premises (@p56 @p50) :args (@t23 @t32 @t33))
% 0.30/0.55  (step @p58 :rule evaluate :args ((< -1 0)))
% 0.30/0.55  (step @p59 :rule true_elim :premises (@p58))
% 0.30/0.55  (step @p60 :rule and_intro :premises (@p59 @p57))
% 0.30/0.55  (step @p61 :rule modus_ponens :premises (@p60 @p18))
% 0.30/0.55  (step @p62 :rule arith-elim-lt :args (@t21 -2))
% 0.30/0.55  (step @p63 :rule symm :premises (@p62))
% 0.30/0.55  (step @p64 :rule cnf_or_neg :args (@t31 1))
% 0.30/0.55  (step @p65 :rule chain_m_resolution :premises (@p64 @p50) :args ((not @t29) @t32 @t33))
% 0.30/0.55  (step @p66 :rule eq_resolve :premises (@p65 @p63))
% 0.30/0.55  (step @p67 :rule int_tight_ub :premises (@p66))
% 0.30/0.55  (step @p68 :rule arith_sum_ub :premises (@p67 @p61))
% 0.30/0.55  (step @p69 false :rule eq_resolve :premises (@p68 @p17))
% 0.30/0.55  )
% 0.30/0.55  % SZS output end Proof
% 0.30/0.55  % cvc5 exiting
%------------------------------------------------------------------------------