↑ Up

cvc5---1.3.4.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : ARI119_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 : n014.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:10 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  : ARI119_1 : TPTP v9.2.1. Released v5.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.34  % Computer : n014.cluster.edu
% 0.16/0.34  % Model    : x86_64 x86_64
% 0.16/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34  % Memory   : 8042.1875MB
% 0.16/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34  % CPULimit : 300
% 0.16/0.34  % WCLimit  : 300
% 0.16/0.34  % DateTime : Wed Jun  3 02:26:13 EDT 2026
% 0.16/0.34  % CPUTime  : 
% 0.30/0.49  %----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 () (= @t1 4))
% 0.30/0.54  (define @t3 () (@var "X" Int))
% 0.30/0.54  (define @t4 () (= @t3 4))
% 0.30/0.54  (define @t5 () (* @t3 @t1))
% 0.30/0.54  (define @t6 () (= @t5 16))
% 0.30/0.54  (define @t7 () (and @t6 @t4 @t2))
% 0.30/0.54  (define @t8 () (@list @t3 @t1))
% 0.30/0.54  (define @t9 () (exists @t8 @t7))
% 0.30/0.54  (define @t10 () (not @t9))
% 0.30/0.54  (define @t11 () (= 4 4))
% 0.30/0.54  (define @t12 () (not @t11))
% 0.30/0.54  (define @t13 () (not @t2))
% 0.30/0.54  (define @t14 () (or @t13 @t13))
% 0.30/0.54  (define @t15 () (@list @t1))
% 0.30/0.54  (define @t16 () (* 4 @t1))
% 0.30/0.54  (define @t17 () (* 4 @t1))
% 0.30/0.54  (define @t18 () (= @t17 16))
% 0.30/0.54  (define @t19 () (not @t18))
% 0.30/0.54  (define @t20 () (or @t19 @t12 @t13))
% 0.30/0.54  (define @t21 () (not @t4))
% 0.30/0.54  (define @t22 () (* @t3 @t1))
% 0.30/0.54  (define @t23 () (= @t22 16))
% 0.30/0.54  (define @t24 () (not @t23))
% 0.30/0.54  (define @t25 () (or @t21 @t24 @t21 @t13))
% 0.30/0.54  (define @t26 () (@list @t3))
% 0.30/0.54  (define @t27 () (or @t24 @t21 @t13))
% 0.30/0.54  (define @t28 () (forall @t26 @t27))
% 0.30/0.54  (define @t29 () (forall @t15 @t28))
% 0.30/0.54  (define @t30 () (forall (@list @t1 @t3) @t27))
% 0.30/0.54  (define @t31 () (and @t23 @t4 @t2))
% 0.30/0.54  (define @t32 () (forall @t8 (not @t31)))
% 0.30/0.54  (define @t33 () (not @t32))
% 0.30/0.54  (assume @p1 @t10)
% 0.30/0.54  (assume @p2 true)
% 0.30/0.54  (step @p3 :rule evaluate :args ((not true)))
% 0.30/0.54  (step @p4 :rule evaluate :args ((not false)))
% 0.30/0.54  (step @p5 :rule evaluate :args (@t11))
% 0.30/0.54  (step @p6 :rule cong :premises (@p5) :args (@t12))
% 0.30/0.54  (step @p7 :rule trans :premises (@p6 @p3))
% 0.30/0.54  (step @p8 :rule quant-var-elim-eq :args ((= (forall @t15 @t14) @t12)))
% 0.30/0.54  (step @p9 :rule aci_norm :args ((= @t13 @t14)))
% 0.30/0.54  (step @p10 :rule cong :premises (@p9) :args ((forall @t15 @t13)))
% 0.30/0.54  (step @p11 :rule trans :premises (@p10 @p8))
% 0.30/0.54  (step @p12 :rule trans :premises (@p11 @p7))
% 0.30/0.54  (step @p13 :rule aci_norm :args ((= (or @t13 false @t13) @t13)))
% 0.30/0.54  (step @p14 :rule refl :args (@t13))
% 0.30/0.54  (step @p15 :rule arith_poly_norm :args ((= (* -4 (- @t16 16)) (* -16 (- @t1 4)))))
% 0.30/0.54  (step @p16 :rule arith_poly_norm_rel :premises (@p15) :args ((= (= @t16 16) @t2)))
% 0.30/0.54  (step @p17 :rule refl :args (16))
% 0.30/0.54  (step @p18 :rule arith_poly_norm :args ((= @t17 @t16)))
% 0.30/0.54  (step @p19 :rule cong :premises (@p18 @p17) :args (@t18))
% 0.30/0.54  (step @p20 :rule trans :premises (@p19 @p16))
% 0.30/0.54  (step @p21 :rule cong :premises (@p20) :args (@t19))
% 0.30/0.54  (step @p22 :rule nary_cong :premises (@p21 @p7 @p14) :args (@t20))
% 0.30/0.54  (step @p23 :rule trans :premises (@p22 @p13))
% 0.30/0.54  (step @p24 :rule cong :premises (@p23) :args ((forall @t15 @t20)))
% 0.30/0.54  (step @p25 :rule trans :premises (@p24 @p12))
% 0.30/0.54  (step @p26 :rule quant-var-elim-eq :args ((= (forall @t26 @t25) @t20)))
% 0.30/0.54  (step @p27 :rule aci_norm :args ((= @t27 @t25)))
% 0.30/0.54  (step @p28 :rule cong :premises (@p27) :args (@t28))
% 0.30/0.54  (step @p29 :rule trans :premises (@p28 @p26))
% 0.30/0.54  (step @p30 :rule cong :premises (@p29) :args (@t29))
% 0.30/0.54  (step @p31 :rule quant-merge-prenex :args ((= @t29 @t30)))
% 0.30/0.54  (step @p32 :rule symm :premises (@p31))
% 0.30/0.54  (step @p33 :rule quant_var_reordering :args ((= (forall @t8 @t27) @t30)))
% 0.30/0.54  (step @p34 :rule trans :premises (@p33 @p32 @p30))
% 0.30/0.54  (step @p35 :rule trans :premises (@p34 @p25))
% 0.30/0.54  (step @p36 :rule aci_norm :args ((= (or @t24 (or @t21 @t13)) @t27)))
% 0.30/0.54  (step @p37 :rule bool-and-de-morgan :args (@t4 @t2 true))
% 0.30/0.54  (step @p38 :rule refl :args (@t24))
% 0.30/0.54  (step @p39 :rule nary_cong :premises (@p38 @p37) :args ((or @t24 (not (and @t4 @t2)))))
% 0.30/0.54  (step @p40 :rule bool-and-de-morgan :args (@t23 @t4 (and @t2)))
% 0.30/0.54  (step @p41 :rule trans :premises (@p40 @p39))
% 0.30/0.54  (step @p42 :rule trans :premises (@p41 @p36))
% 0.30/0.54  (step @p43 :rule cong :premises (@p42) :args (@t32))
% 0.30/0.54  (step @p44 :rule trans :premises (@p43 @p35))
% 0.30/0.54  (step @p45 :rule cong :premises (@p44) :args (@t33))
% 0.30/0.54  (step @p46 :rule trans :premises (@p45 @p4))
% 0.30/0.54  (step @p47 :rule exists-elim :args ((= (exists @t8 @t31) @t33)))
% 0.30/0.54  (step @p48 :rule trans :premises (@p47 @p46))
% 0.30/0.54  (step @p49 :rule refl :args (@t2))
% 0.30/0.54  (step @p50 :rule refl :args (@t4))
% 0.30/0.54  (step @p51 :rule arith_poly_norm :args ((= @t5 @t22)))
% 0.30/0.54  (step @p52 :rule cong :premises (@p51 @p17) :args (@t6))
% 0.30/0.54  (step @p53 :rule nary_cong :premises (@p52 @p50 @p49) :args (@t7))
% 0.30/0.54  (step @p54 :rule cong :premises (@p53) :args (@t9))
% 0.30/0.54  (step @p55 :rule trans :premises (@p54 @p48))
% 0.30/0.54  (step @p56 :rule cong :premises (@p55) :args (@t10))
% 0.30/0.54  (step @p57 :rule trans :premises (@p56 @p3))
% 0.30/0.54  (step @p58 false :rule eq_resolve :premises (@p1 @p57))
% 0.30/0.54  )
% 0.30/0.54  % SZS output end Proof
% 0.30/0.54  % cvc5 exiting
%------------------------------------------------------------------------------