↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n021.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:38:22 AM UTC 2026

% Result   : Unsatisfiable 0.38s 0.56s
% Output   : Proof 0.38s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM023-1 : TPTP v9.2.1. Bugfixed v4.0.0.
% 0.12/0.13  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.34  % Computer : n021.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 : Tue Jun  2 10:21:20 EDT 2026
% 0.18/0.34  % CPUTime  : 
% 0.31/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.31/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.38/0.56  % SZS status Unsatisfiable
% 0.38/0.56  % SZS output start Proof
% 0.38/0.57  (
% 0.38/0.57  (declare-sort $$unsorted 0)
% 0.38/0.57  (declare-const tptp.a $$unsorted)
% 0.38/0.57  (declare-const tptp.predecessor_of_1st_minus_2nd (-> $$unsorted $$unsorted $$unsorted))
% 0.38/0.57  (declare-const tptp.less (-> $$unsorted $$unsorted Bool))
% 0.38/0.57  (declare-const tptp.successor (-> $$unsorted $$unsorted))
% 0.38/0.57  (declare-const tptp.equalish (-> $$unsorted $$unsorted Bool))
% 0.38/0.57  (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted))
% 0.38/0.57  (declare-const tptp.add (-> $$unsorted $$unsorted $$unsorted))
% 0.38/0.57  (declare-const tptp.n0 $$unsorted)
% 0.38/0.57  (define @t1 () (@var "A" $$unsorted))
% 0.38/0.57  (define @t2 () (@list @t1))
% 0.38/0.57  (define @t3 () (forall @t2 (tptp.equalish (tptp.add @t1 tptp.n0) @t1)))
% 0.38/0.57  (define @t4 () (@var "B" $$unsorted))
% 0.38/0.57  (define @t5 () (tptp.successor @t4))
% 0.38/0.57  (define @t6 () (@list @t1 @t4))
% 0.38/0.57  (define @t7 () (tptp.equalish @t1 @t4))
% 0.38/0.57  (define @t8 () (tptp.successor @t1))
% 0.38/0.57  (define @t9 () (tptp.equalish @t8 @t5))
% 0.38/0.57  (define @t10 () (@var "C" $$unsorted))
% 0.38/0.57  (define @t11 () (not (tptp.less @t1 @t4)))
% 0.38/0.57  (define @t12 () (@list @t1 @t4 @t10))
% 0.38/0.57  (define @t13 () (@var "X" $$unsorted))
% 0.38/0.57  (define @t14 () (@var "Y" $$unsorted))
% 0.38/0.57  (define @t15 () (not (tptp.equalish @t13 @t14)))
% 0.38/0.57  (define @t16 () (@var "Z" $$unsorted))
% 0.38/0.57  (define @t17 () (tptp.successor tptp.a))
% 0.38/0.57  (define @t18 () (tptp.less tptp.n0 @t17))
% 0.38/0.57  (define @t19 () (tptp.equalish (tptp.add @t17 tptp.n0) @t17))
% 0.38/0.57  (define @t20 () (not @t19))
% 0.38/0.57  (define @t21 () (or @t20 @t18))
% 0.38/0.57  (define @t22 () (@list true false))
% 0.38/0.57  (assume @p1 @t3)
% 0.38/0.57  (assume @p2 (forall @t6 (tptp.equalish (tptp.add @t1 @t5) (tptp.successor (tptp.add @t1 @t4)))))
% 0.38/0.57  (assume @p3 (forall @t2 (tptp.equalish (tptp.multiply @t1 tptp.n0) tptp.n0)))
% 0.38/0.57  (assume @p4 (forall @t6 (tptp.equalish (tptp.multiply @t1 @t5) (tptp.add (tptp.multiply @t1 @t4) @t1))))
% 0.38/0.57  (assume @p5 (forall @t6 (or (not @t9) @t7)))
% 0.38/0.57  (assume @p6 (forall @t6 (or (not @t7) @t9)))
% 0.38/0.57  (assume @p7 (forall @t12 (or @t11 (not (tptp.less @t10 @t1)) (tptp.less @t10 @t4))))
% 0.38/0.57  (assume @p8 (forall @t12 (or (not (tptp.equalish (tptp.add @t8 @t4) @t10)) (tptp.less @t4 @t10))))
% 0.38/0.57  (assume @p9 (forall @t6 (or @t11 (tptp.equalish (tptp.add (tptp.successor (tptp.predecessor_of_1st_minus_2nd @t4 @t1)) @t1) @t4))))
% 0.38/0.57  (assume @p10 (forall (@list @t13) (tptp.equalish @t13 @t13)))
% 0.38/0.57  (assume @p11 (forall (@list @t13 @t14) (or @t15 (tptp.equalish @t14 @t13))))
% 0.38/0.57  (assume @p12 (forall (@list @t13 @t14 @t16) (or @t15 (not (tptp.equalish @t14 @t16)) (tptp.equalish @t13 @t16))))
% 0.38/0.57  (assume @p13 (forall @t2 (not (tptp.equalish @t8 tptp.n0))))
% 0.38/0.57  (assume @p14 (forall @t2 (tptp.less @t1 @t8)))
% 0.38/0.57  (assume @p15 (not @t18))
% 0.38/0.57  (step @p16 :rule instantiate :premises (@p8) :args ((@list tptp.a tptp.n0 @t17)))
% 0.38/0.57  (step @p17 :rule cnf_or_pos :args (@t21))
% 0.38/0.57  (step @p18 :rule reordering :premises (@p17) :args ((or @t18 @t20 (not @t21))))
% 0.38/0.57  (step @p19 :rule chain_m_resolution :premises (@p18 @p15 @p16) :args (@t20 @t22 (@list @t18 @t21)))
% 0.38/0.57  (assume-push @p26 @t3)
% 0.38/0.57  (step @p21 :rule instantiate :premises (@p1) :args ((@list @t17)))
% 0.38/0.57  (step-pop @p27 :rule scope :premises (@p21))
% 0.38/0.57  (step @p22 :rule process_scope :premises (@p27) :args (@t19))
% 0.38/0.57  (step @p24 :rule implies_elim :premises (@p22))
% 0.38/0.57  (step @p25 false :rule chain_m_resolution :premises (@p24 @p19 @p1) :args (false @t22 (@list @t19 @t3)))
% 0.38/0.57  )
% 0.38/0.57  % SZS output end Proof
% 0.38/0.57  % cvc5 exiting
%------------------------------------------------------------------------------