↑ Up

cvc5---1.3.4.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cvc5---1.3.4
% Problem  : COM002-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n026.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:10:21 AM UTC 2026

% Result   : Unsatisfiable 0.36s 0.58s
% Output   : Proof 0.36s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : COM002-2 : TPTP v9.2.1. Released v1.0.0.
% 0.12/0.14  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.35  % Computer : n026.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 : Mon Jun  1 20:27:55 EDT 2026
% 0.17/0.35  % CPUTime  : 
% 0.28/0.51  %----Proving TF0_NAR, FOF, or CNF
% 0.28/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.36/0.58  % SZS status Unsatisfiable
% 0.36/0.58  % SZS output start Proof
% 0.36/0.59  (
% 0.36/0.59  (declare-sort $$unsorted 0)
% 0.36/0.59  (declare-const tptp.p8 $$unsorted)
% 0.36/0.59  (declare-const tptp.plus (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.p7 $$unsorted)
% 0.36/0.59  (declare-const tptp.p6 $$unsorted)
% 0.36/0.59  (declare-const tptp.out $$unsorted)
% 0.36/0.59  (declare-const tptp.equal_function (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.n $$unsorted)
% 0.36/0.59  (declare-const tptp.p4 $$unsorted)
% 0.36/0.59  (declare-const tptp.loop $$unsorted)
% 0.36/0.59  (declare-const tptp.p3 $$unsorted)
% 0.36/0.59  (declare-const tptp.follows (-> $$unsorted $$unsorted Bool))
% 0.36/0.59  (declare-const tptp.p2 $$unsorted)
% 0.36/0.59  (declare-const tptp.p5 $$unsorted)
% 0.36/0.59  (declare-const tptp.fails (-> $$unsorted $$unsorted Bool))
% 0.36/0.59  (declare-const tptp.ifthen (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.labels (-> $$unsorted $$unsorted Bool))
% 0.36/0.59  (declare-const tptp.n0 $$unsorted)
% 0.36/0.59  (declare-const tptp.times (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.register_j $$unsorted)
% 0.36/0.59  (declare-const tptp.assign (-> $$unsorted $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.n2 $$unsorted)
% 0.36/0.59  (declare-const tptp.p1 $$unsorted)
% 0.36/0.59  (declare-const tptp.has (-> $$unsorted $$unsorted Bool))
% 0.36/0.59  (declare-const tptp.n1 $$unsorted)
% 0.36/0.59  (declare-const tptp.goto (-> $$unsorted $$unsorted))
% 0.36/0.59  (declare-const tptp.register_k $$unsorted)
% 0.36/0.59  (define @t1 () (@var "Start_state" $$unsorted))
% 0.36/0.59  (define @t2 () (@var "Goal_state" $$unsorted))
% 0.36/0.59  (define @t3 () (not (tptp.fails @t2 @t1)))
% 0.36/0.59  (define @t4 () (@var "Intermediate_state" $$unsorted))
% 0.36/0.59  (define @t5 () (@var "Label" $$unsorted))
% 0.36/0.59  (define @t6 () (forall (@list @t2 @t1 @t5) (or @t3 (not (tptp.has @t1 (tptp.goto @t5))) (not (tptp.labels @t5 @t2)))))
% 0.36/0.59  (define @t7 () (@var "Condition" $$unsorted))
% 0.36/0.59  (define @t8 () (tptp.labels tptp.loop tptp.p3))
% 0.36/0.59  (define @t9 () (tptp.follows tptp.p6 tptp.p3))
% 0.36/0.59  (define @t10 () (tptp.follows tptp.p7 tptp.p6))
% 0.36/0.59  (define @t11 () (tptp.follows tptp.p8 tptp.p7))
% 0.36/0.59  (define @t12 () (tptp.has tptp.p8 (tptp.goto tptp.loop)))
% 0.36/0.59  (define @t13 () (tptp.fails tptp.p3 tptp.p3))
% 0.36/0.59  (define @t14 () (not @t9))
% 0.36/0.59  (define @t15 () (tptp.fails tptp.p6 tptp.p3))
% 0.36/0.59  (define @t16 () (not @t15))
% 0.36/0.59  (define @t17 () (or @t16 @t14))
% 0.36/0.59  (define @t18 () (@list false false))
% 0.36/0.59  (define @t19 () (tptp.fails tptp.p3 tptp.p6))
% 0.36/0.59  (define @t20 () (not @t13))
% 0.36/0.59  (define @t21 () (or @t20 @t19 @t15))
% 0.36/0.59  (define @t22 () (not @t10))
% 0.36/0.59  (define @t23 () (tptp.fails tptp.p7 tptp.p6))
% 0.36/0.59  (define @t24 () (not @t23))
% 0.36/0.59  (define @t25 () (or @t24 @t22))
% 0.36/0.59  (define @t26 () (tptp.fails tptp.p3 tptp.p7))
% 0.36/0.59  (define @t27 () (not @t19))
% 0.36/0.59  (define @t28 () (or @t27 @t26 @t23))
% 0.36/0.59  (define @t29 () (@list true false false))
% 0.36/0.59  (define @t30 () (not @t11))
% 0.36/0.59  (define @t31 () (tptp.fails tptp.p8 tptp.p7))
% 0.36/0.59  (define @t32 () (not @t31))
% 0.36/0.59  (define @t33 () (or @t32 @t30))
% 0.36/0.59  (define @t34 () (tptp.fails tptp.p3 tptp.p8))
% 0.36/0.59  (define @t35 () (not @t26))
% 0.36/0.59  (define @t36 () (or @t35 @t34 @t31))
% 0.36/0.59  (define @t37 () (not @t8))
% 0.36/0.59  (define @t38 () (not @t12))
% 0.36/0.59  (define @t39 () (not @t34))
% 0.36/0.59  (define @t40 () (or @t39 @t38 @t37))
% 0.36/0.59  (define @t41 () (not @t40))
% 0.36/0.59  (assume @p1 (forall (@list @t2 @t1) (or @t3 (not (tptp.follows @t2 @t1)))))
% 0.36/0.59  (assume @p2 (forall (@list @t2 @t1 @t4) (or @t3 (tptp.fails @t2 @t4) (tptp.fails @t4 @t1))))
% 0.36/0.59  (assume @p3 @t6)
% 0.36/0.59  (assume @p4 (forall (@list @t2 @t1 @t7) (or @t3 (not (tptp.has @t1 (tptp.ifthen @t7 @t2))))))
% 0.36/0.59  (assume @p5 (tptp.has tptp.p1 (tptp.assign tptp.register_j tptp.n0)))
% 0.36/0.59  (assume @p6 (tptp.follows tptp.p2 tptp.p1))
% 0.36/0.59  (assume @p7 (tptp.has tptp.p2 (tptp.assign tptp.register_k tptp.n1)))
% 0.36/0.59  (assume @p8 @t8)
% 0.36/0.59  (assume @p9 (tptp.follows tptp.p3 tptp.p2))
% 0.36/0.59  (assume @p10 (tptp.has tptp.p3 (tptp.ifthen (tptp.equal_function tptp.register_j tptp.n) tptp.p4)))
% 0.36/0.59  (assume @p11 (tptp.has tptp.p4 (tptp.goto tptp.out)))
% 0.36/0.59  (assume @p12 (tptp.follows tptp.p5 tptp.p4))
% 0.36/0.59  (assume @p13 @t9)
% 0.36/0.59  (assume @p14 (tptp.has tptp.p6 (tptp.assign tptp.register_k (tptp.times tptp.n2 tptp.register_k))))
% 0.36/0.59  (assume @p15 @t10)
% 0.36/0.59  (assume @p16 (tptp.has tptp.p7 (tptp.assign tptp.register_j (tptp.plus tptp.register_j tptp.n1))))
% 0.36/0.59  (assume @p17 @t11)
% 0.36/0.59  (assume @p18 @t12)
% 0.36/0.59  (assume @p19 @t13)
% 0.36/0.59  (step @p20 :rule instantiate :premises (@p2) :args ((@list tptp.p3 tptp.p7 tptp.p8)))
% 0.36/0.59  (step @p21 :rule instantiate :premises (@p2) :args ((@list tptp.p3 tptp.p6 tptp.p7)))
% 0.36/0.59  (step @p22 :rule instantiate :premises (@p2) :args ((@list tptp.p3 tptp.p3 tptp.p6)))
% 0.36/0.59  (step @p23 :rule instantiate :premises (@p1) :args ((@list tptp.p6 tptp.p3)))
% 0.36/0.59  (step @p24 :rule cnf_or_pos :args (@t17))
% 0.36/0.59  (step @p25 :rule reordering :premises (@p24) :args ((or @t14 @t16 (not @t17))))
% 0.36/0.59  (step @p26 :rule chain_m_resolution :premises (@p25 @p13 @p23) :args (@t16 @t18 (@list @t9 @t17)))
% 0.36/0.59  (step @p27 :rule cnf_or_pos :args (@t21))
% 0.36/0.59  (step @p28 :rule reordering :premises (@p27) :args ((or @t20 @t15 @t19 (not @t21))))
% 0.36/0.59  (step @p29 :rule chain_m_resolution :premises (@p28 @p19 @p26 @p22) :args (@t19 (@list false true false) (@list @t13 @t15 @t21)))
% 0.36/0.59  (step @p30 :rule instantiate :premises (@p1) :args ((@list tptp.p7 tptp.p6)))
% 0.36/0.59  (step @p31 :rule cnf_or_pos :args (@t25))
% 0.36/0.59  (step @p32 :rule reordering :premises (@p31) :args ((or @t22 @t24 (not @t25))))
% 0.36/0.59  (step @p33 :rule chain_m_resolution :premises (@p32 @p15 @p30) :args (@t24 @t18 (@list @t10 @t25)))
% 0.36/0.59  (step @p34 :rule cnf_or_pos :args (@t28))
% 0.36/0.59  (step @p35 :rule reordering :premises (@p34) :args ((or @t23 @t27 @t26 (not @t28))))
% 0.36/0.59  (step @p36 :rule chain_m_resolution :premises (@p35 @p33 @p29 @p21) :args (@t26 @t29 (@list @t23 @t19 @t28)))
% 0.36/0.59  (step @p37 :rule instantiate :premises (@p1) :args ((@list tptp.p8 tptp.p7)))
% 0.36/0.59  (step @p38 :rule cnf_or_pos :args (@t33))
% 0.36/0.59  (step @p39 :rule reordering :premises (@p38) :args ((or @t30 @t32 (not @t33))))
% 0.36/0.59  (step @p40 :rule chain_m_resolution :premises (@p39 @p17 @p37) :args (@t32 @t18 (@list @t11 @t33)))
% 0.36/0.59  (step @p41 :rule cnf_or_pos :args (@t36))
% 0.36/0.59  (step @p42 :rule reordering :premises (@p41) :args ((or @t31 @t35 @t34 (not @t36))))
% 0.36/0.59  (step @p43 :rule chain_m_resolution :premises (@p42 @p40 @p36 @p20) :args (@t34 @t29 (@list @t31 @t26 @t36)))
% 0.36/0.59  (step @p44 :rule cnf_or_pos :args (@t40))
% 0.36/0.59  (step @p45 :rule reordering :premises (@p44) :args ((or @t37 @t38 @t39 @t41)))
% 0.36/0.59  (step @p46 :rule chain_m_resolution :premises (@p45 @p8 @p18 @p43) :args (@t41 (@list false false false) (@list @t8 @t12 @t34)))
% 0.36/0.59  (assume-push @p53 @t6)
% 0.36/0.59  (step @p48 :rule instantiate :premises (@p3) :args ((@list tptp.p3 tptp.p8 tptp.loop)))
% 0.36/0.59  (step-pop @p54 :rule scope :premises (@p48))
% 0.36/0.59  (step @p49 :rule process_scope :premises (@p54) :args (@t40))
% 0.36/0.59  (step @p51 :rule implies_elim :premises (@p49))
% 0.36/0.59  (step @p52 false :rule chain_m_resolution :premises (@p51 @p46 @p3) :args (false (@list true false) (@list @t40 @t6)))
% 0.36/0.59  )
% 0.36/0.59  % SZS output end Proof
% 0.36/0.59  % cvc5 exiting
%------------------------------------------------------------------------------