↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Result   : Theorem 0.15s 0.39s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem  : ARI085_1 : TPTP v9.2.1. Released v5.0.0.
% 0.00/0.07  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/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:33 EDT 2026
% 0.08/0.26  % CPUTime  : 
% 0.15/0.33  %----Proving TF0_ARI
% 0.15/0.39  --- Run --finite-model-find --decision=internal at 45...
% 0.15/0.39  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 60...
% 0.15/0.39  % SZS status Theorem
% 0.15/0.39  % SZS output start Proof
% 0.15/0.39  (
% 0.15/0.39  (declare-const tptp.p (-> Int Int Bool))
% 0.15/0.39  (define @t1 () (@var "Y" Int))
% 0.15/0.39  (define @t2 () (@var "X" Int))
% 0.15/0.39  (define @t3 () (+ @t2 @t1))
% 0.15/0.39  (define @t4 () (= @t3 7))
% 0.15/0.39  (define @t5 () (tptp.p @t2 @t1))
% 0.15/0.39  (define @t6 () (and @t5 @t4))
% 0.15/0.39  (define @t7 () (@list @t2 @t1))
% 0.15/0.39  (define @t8 () (exists @t7 @t6))
% 0.15/0.39  (define @t9 () (tptp.p 3 4))
% 0.15/0.39  (define @t10 () (and @t9 (not (tptp.p 1 6))))
% 0.15/0.39  (define @t11 () (=> @t10 @t8))
% 0.15/0.39  (define @t12 () (not @t11))
% 0.15/0.39  (define @t13 () (+ 7 (* -1 @t1)))
% 0.15/0.39  (define @t14 () (not (tptp.p @t13 @t1)))
% 0.15/0.39  (define @t15 () (not (= @t13 @t13)))
% 0.15/0.39  (define @t16 () (or @t14 @t15))
% 0.15/0.39  (define @t17 () (@list @t1))
% 0.15/0.39  (define @t18 () (= @t2 @t13))
% 0.15/0.39  (define @t19 () (not @t18))
% 0.15/0.39  (define @t20 () (not @t5))
% 0.15/0.39  (define @t21 () (or @t19 @t20 @t19))
% 0.15/0.39  (define @t22 () (@list @t2))
% 0.15/0.39  (define @t23 () (or @t20 @t19))
% 0.15/0.39  (define @t24 () (forall @t22 @t23))
% 0.15/0.39  (define @t25 () (forall @t17 @t24))
% 0.15/0.39  (define @t26 () (forall (@list @t1 @t2) @t23))
% 0.15/0.39  (define @t27 () (and @t5 @t18))
% 0.15/0.39  (define @t28 () (forall @t7 (not @t27)))
% 0.15/0.39  (define @t29 () (not @t28))
% 0.15/0.39  (define @t30 () (* -1 4))
% 0.15/0.39  (define @t31 () (+ 7 @t30))
% 0.15/0.39  (define @t32 () (tptp.p @t31 4))
% 0.15/0.39  (define @t33 () (not @t32))
% 0.15/0.39  (define @t34 () (forall @t17 @t14))
% 0.15/0.39  (assume @p1 @t12)
% 0.15/0.39  (assume @p2 true)
% 0.15/0.39  (step @p3 :rule aci_norm :args ((= (or @t14 false) @t14)))
% 0.15/0.39  (step @p4 :rule evaluate :args ((not true)))
% 0.15/0.39  (step @p5 :rule eq-refl :args (@t13))
% 0.15/0.39  (step @p6 :rule cong :premises (@p5) :args (@t15))
% 0.15/0.39  (step @p7 :rule trans :premises (@p6 @p4))
% 0.15/0.39  (step @p8 :rule refl :args (@t14))
% 0.15/0.39  (step @p9 :rule nary_cong :premises (@p8 @p7) :args (@t16))
% 0.15/0.39  (step @p10 :rule trans :premises (@p9 @p3))
% 0.15/0.39  (step @p11 :rule cong :premises (@p10) :args ((forall @t17 @t16)))
% 0.15/0.39  (step @p12 :rule quant-var-elim-eq :args ((= (forall @t22 @t21) @t16)))
% 0.15/0.39  (step @p13 :rule aci_norm :args ((= @t23 @t21)))
% 0.15/0.39  (step @p14 :rule cong :premises (@p13) :args (@t24))
% 0.15/0.39  (step @p15 :rule trans :premises (@p14 @p12))
% 0.15/0.39  (step @p16 :rule cong :premises (@p15) :args (@t25))
% 0.15/0.39  (step @p17 :rule quant-merge-prenex :args ((= @t25 @t26)))
% 0.15/0.39  (step @p18 :rule symm :premises (@p17))
% 0.15/0.39  (step @p19 :rule quant_var_reordering :args ((= (forall @t7 @t23) @t26)))
% 0.15/0.39  (step @p20 :rule trans :premises (@p19 @p18 @p16))
% 0.15/0.39  (step @p21 :rule trans :premises (@p20 @p11))
% 0.15/0.39  (step @p22 :rule bool-and-de-morgan :args (@t5 @t18 true))
% 0.15/0.39  (step @p23 :rule cong :premises (@p22) :args (@t28))
% 0.15/0.39  (step @p24 :rule trans :premises (@p23 @p21))
% 0.15/0.39  (step @p25 :rule cong :premises (@p24) :args (@t29))
% 0.15/0.39  (step @p26 :rule exists-elim :args ((= (exists @t7 @t27) @t29)))
% 0.15/0.39  (step @p27 :rule trans :premises (@p26 @p25))
% 0.15/0.39  (step @p28 :rule arith_poly_norm :args ((= (* -7 (- @t3 7)) (* -7 (- @t2 @t13)))))
% 0.15/0.39  (step @p29 :rule arith_poly_norm_rel :premises (@p28) :args ((= @t4 @t18)))
% 0.15/0.39  (step @p30 :rule refl :args (@t5))
% 0.15/0.39  (step @p31 :rule nary_cong :premises (@p30 @p29) :args (@t6))
% 0.15/0.39  (step @p32 :rule cong :premises (@p31) :args (@t8))
% 0.15/0.39  (step @p33 :rule trans :premises (@p32 @p27))
% 0.15/0.39  (step @p34 :rule refl :args (@t10))
% 0.15/0.39  (step @p35 :rule cong :premises (@p34 @p33) :args (@t11))
% 0.15/0.39  (step @p36 :rule cong :premises (@p35) :args (@t12))
% 0.15/0.39  (step @p37 :rule eq_resolve :premises (@p1 @p36))
% 0.15/0.39  (step @p38 :rule not_implies_elim1 :premises (@p37))
% 0.15/0.39  (step @p39 :rule and_elim :premises (@p38) :args (0))
% 0.15/0.39  (step @p40 :rule not_implies_elim2 :premises (@p37))
% 0.15/0.39  (step @p41 :rule not_not_elim :premises (@p40))
% 0.15/0.39  (step @p42 :rule refl :args (4))
% 0.15/0.39  (step @p43 :rule evaluate :args ((+ 7 -4)))
% 0.15/0.39  (step @p44 :rule evaluate :args (@t30))
% 0.15/0.39  (step @p45 :rule refl :args (7))
% 0.15/0.39  (step @p46 :rule nary_cong :premises (@p45 @p44) :args (@t31))
% 0.15/0.39  (step @p47 :rule trans :premises (@p46 @p43))
% 0.15/0.39  (step @p48 :rule cong :premises (@p47 @p42) :args (@t32))
% 0.15/0.39  (step @p49 :rule cong :premises (@p48) :args (@t33))
% 0.15/0.39  (step @p50 :rule refl :args (@t34))
% 0.15/0.39  (step @p51 :rule cong :premises (@p50 @p49) :args ((=> @t34 @t33)))
% 0.15/0.39  (assume-push @p59 @t34)
% 0.15/0.39  (step @p53 :rule instantiate :premises (@p41) :args ((@list 4)))
% 0.15/0.39  (step-pop @p60 :rule scope :premises (@p53))
% 0.15/0.39  (step @p54 :rule process_scope :premises (@p60) :args (@t33))
% 0.15/0.39  (step @p56 :rule eq_resolve :premises (@p54 @p51))
% 0.15/0.39  (step @p57 :rule implies_elim :premises (@p56))
% 0.15/0.39  (step @p58 false :rule chain_m_resolution :premises (@p57 @p41 @p39) :args (false (@list false false) (@list @t34 @t9)))
% 0.15/0.39  )
% 0.15/0.39  % SZS output end Proof
% 0.15/0.39  % cvc5 exiting
%------------------------------------------------------------------------------