↑ Up

cvc5---1.3.4.UNS-Prf.s

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

% Computer : n013.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:23 AM UTC 2026

% Result   : Unsatisfiable 0.32s 0.57s
% Output   : Proof 0.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : NUM025-1 : TPTP v9.2.1. Bugfixed v4.0.0.
% 0.13/0.14  % Command  : /export/starexec/sandbox/solver/bin/do_cvc5 /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.35  % Computer : n013.cluster.edu
% 0.16/0.35  % Model    : x86_64 x86_64
% 0.16/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35  % Memory   : 8042.1875MB
% 0.16/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35  % CPULimit : 300
% 0.16/0.35  % WCLimit  : 300
% 0.16/0.35  % DateTime : Tue Jun  2 10:20:00 EDT 2026
% 0.16/0.35  % CPUTime  : 
% 0.32/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.32/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.32/0.57  % SZS status Unsatisfiable
% 0.32/0.57  % SZS output start Proof
% 0.32/0.57  (
% 0.32/0.57  (declare-sort $$unsorted 0)
% 0.32/0.57  (declare-const tptp.b $$unsorted)
% 0.32/0.57  (declare-const tptp.predecessor_of_1st_minus_2nd (-> $$unsorted $$unsorted $$unsorted))
% 0.32/0.57  (declare-const tptp.less (-> $$unsorted $$unsorted Bool))
% 0.32/0.57  (declare-const tptp.successor (-> $$unsorted $$unsorted))
% 0.32/0.57  (declare-const tptp.equalish (-> $$unsorted $$unsorted Bool))
% 0.32/0.57  (declare-const tptp.a $$unsorted)
% 0.32/0.57  (declare-const tptp.multiply (-> $$unsorted $$unsorted $$unsorted))
% 0.32/0.57  (declare-const tptp.add (-> $$unsorted $$unsorted $$unsorted))
% 0.32/0.57  (declare-const tptp.n0 $$unsorted)
% 0.32/0.57  (define @t1 () (@var "A" $$unsorted))
% 0.32/0.57  (define @t2 () (@list @t1))
% 0.32/0.57  (define @t3 () (@var "B" $$unsorted))
% 0.32/0.57  (define @t4 () (tptp.successor @t3))
% 0.32/0.57  (define @t5 () (@list @t1 @t3))
% 0.32/0.57  (define @t6 () (tptp.equalish @t1 @t3))
% 0.32/0.57  (define @t7 () (tptp.successor @t1))
% 0.32/0.57  (define @t8 () (tptp.equalish @t7 @t4))
% 0.32/0.57  (define @t9 () (@var "C" $$unsorted))
% 0.32/0.57  (define @t10 () (not (tptp.less @t1 @t3)))
% 0.32/0.57  (define @t11 () (@list @t1 @t3 @t9))
% 0.32/0.57  (define @t12 () (@var "X" $$unsorted))
% 0.32/0.57  (define @t13 () (@var "Y" $$unsorted))
% 0.32/0.57  (define @t14 () (not (tptp.equalish @t12 @t13)))
% 0.32/0.57  (define @t15 () (@var "Z" $$unsorted))
% 0.32/0.57  (define @t16 () (forall @t2 (not (tptp.less @t1 @t1))))
% 0.32/0.57  (define @t17 () (tptp.less tptp.a tptp.b))
% 0.32/0.57  (define @t18 () (tptp.less tptp.b tptp.a))
% 0.32/0.57  (define @t19 () (tptp.less tptp.a tptp.a))
% 0.32/0.57  (define @t20 () (not @t17))
% 0.32/0.57  (define @t21 () (not @t18))
% 0.32/0.57  (define @t22 () (or @t21 @t20 @t19))
% 0.32/0.57  (assume @p1 (forall @t2 (tptp.equalish (tptp.add @t1 tptp.n0) @t1)))
% 0.32/0.57  (assume @p2 (forall @t5 (tptp.equalish (tptp.add @t1 @t4) (tptp.successor (tptp.add @t1 @t3)))))
% 0.32/0.57  (assume @p3 (forall @t2 (tptp.equalish (tptp.multiply @t1 tptp.n0) tptp.n0)))
% 0.32/0.57  (assume @p4 (forall @t5 (tptp.equalish (tptp.multiply @t1 @t4) (tptp.add (tptp.multiply @t1 @t3) @t1))))
% 0.32/0.57  (assume @p5 (forall @t5 (or (not @t8) @t6)))
% 0.32/0.57  (assume @p6 (forall @t5 (or (not @t6) @t8)))
% 0.32/0.57  (assume @p7 (forall @t11 (or @t10 (not (tptp.less @t9 @t1)) (tptp.less @t9 @t3))))
% 0.32/0.57  (assume @p8 (forall @t11 (or (not (tptp.equalish (tptp.add @t7 @t3) @t9)) (tptp.less @t3 @t9))))
% 0.32/0.57  (assume @p9 (forall @t5 (or @t10 (tptp.equalish (tptp.add (tptp.successor (tptp.predecessor_of_1st_minus_2nd @t3 @t1)) @t1) @t3))))
% 0.32/0.57  (assume @p10 (forall (@list @t12) (tptp.equalish @t12 @t12)))
% 0.32/0.57  (assume @p11 (forall (@list @t12 @t13) (or @t14 (tptp.equalish @t13 @t12))))
% 0.32/0.57  (assume @p12 (forall (@list @t12 @t13 @t15) (or @t14 (not (tptp.equalish @t13 @t15)) (tptp.equalish @t12 @t15))))
% 0.32/0.57  (assume @p13 (forall @t2 (not (tptp.equalish @t7 tptp.n0))))
% 0.32/0.57  (assume @p14 @t16)
% 0.32/0.57  (assume @p15 @t17)
% 0.32/0.57  (assume @p16 @t18)
% 0.32/0.57  (step @p17 :rule instantiate :premises (@p7) :args ((@list tptp.b tptp.a tptp.a)))
% 0.32/0.57  (step @p18 :rule cnf_or_pos :args (@t22))
% 0.32/0.57  (step @p19 :rule reordering :premises (@p18) :args ((or @t20 @t21 @t19 (not @t22))))
% 0.32/0.57  (step @p20 :rule chain_m_resolution :premises (@p19 @p15 @p16 @p17) :args (@t19 (@list false false false) (@list @t17 @t18 @t22)))
% 0.32/0.57  (assume-push @p27 @t16)
% 0.32/0.57  (step @p22 :rule instantiate :premises (@p14) :args ((@list tptp.a)))
% 0.32/0.57  (step-pop @p28 :rule scope :premises (@p22))
% 0.32/0.57  (step @p23 :rule process_scope :premises (@p28) :args ((not @t19)))
% 0.32/0.57  (step @p25 :rule implies_elim :premises (@p23))
% 0.32/0.57  (step @p26 false :rule chain_m_resolution :premises (@p25 @p20 @p14) :args (false (@list false false) (@list @t19 @t16)))
% 0.32/0.57  )
% 0.32/0.57  % SZS output end Proof
% 0.34/0.57  % cvc5 exiting
%------------------------------------------------------------------------------