↑ Up

cvc5---1.3.4.THM-Prf.s

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

% Computer : n024.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 09:15:39 AM UTC 2026

% Result   : Theorem 0.16s 0.36s
% Output   : Proof 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : TIM033_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.07  % Command  : /export/starexec/sandbox2/solver/bin/do_cvc5 /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.25  % Computer : n024.cluster.edu
% 0.07/0.25  % Model    : x86_64 x86_64
% 0.07/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25  % Memory   : 8042.1875MB
% 0.07/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25  % CPULimit : 300
% 0.07/0.25  % WCLimit  : 300
% 0.07/0.25  % DateTime : Tue Jun  2 20:13:30 EDT 2026
% 0.07/0.25  % CPUTime  : 
% 0.16/0.33  %----Proving TF0_NAR, FOF, or CNF
% 0.16/0.36  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 15...
% 0.16/0.36  % SZS status Theorem
% 0.16/0.36  % SZS output start Proof
% 0.16/0.36  (
% 0.16/0.36  (declare-sort tptp.interval 0)
% 0.16/0.36  (declare-const tptp.d tptp.interval)
% 0.16/0.36  (declare-const tptp.c tptp.interval)
% 0.16/0.36  (declare-const tptp.a tptp.interval)
% 0.16/0.36  (declare-const tptp.after (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.before (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.met_by (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.meets (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.overlapped_by (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.overlaps (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.started_by (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.b tptp.interval)
% 0.16/0.36  (declare-const tptp.starts (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.contains (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.during (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.finished_by (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (declare-const tptp.finishes (-> tptp.interval tptp.interval Bool))
% 0.16/0.36  (define @t1 () (@var "I" tptp.interval))
% 0.16/0.36  (define @t2 () (@var "J" tptp.interval))
% 0.16/0.36  (define @t3 () (tptp.before @t1 @t2))
% 0.16/0.36  (define @t4 () (@list @t1 @t2))
% 0.16/0.36  (define @t5 () (forall @t4 (= (tptp.finishes @t1 @t2) (tptp.finished_by @t2 @t1))))
% 0.16/0.36  (define @t6 () (@var "K" tptp.interval))
% 0.16/0.36  (define @t7 () (tptp.finishes tptp.d tptp.c))
% 0.16/0.36  (define @t8 () (tptp.finished_by tptp.c tptp.d))
% 0.16/0.36  (define @t9 () (= @t7 @t8))
% 0.16/0.36  (define @t10 () (not @t9))
% 0.16/0.36  (define @t11 () (@list true false))
% 0.16/0.36  (assume @p1 (forall @t4 (= @t3 (tptp.after @t2 @t1))))
% 0.16/0.36  (assume @p2 (forall @t4 (= (tptp.meets @t1 @t2) (tptp.met_by @t2 @t1))))
% 0.16/0.36  (assume @p3 (forall @t4 (= (tptp.overlaps @t1 @t2) (tptp.overlapped_by @t2 @t1))))
% 0.16/0.36  (assume @p4 (forall @t4 (= (tptp.starts @t1 @t2) (tptp.started_by @t2 @t1))))
% 0.16/0.36  (assume @p5 (forall @t4 (= (tptp.during @t1 @t2) (tptp.contains @t2 @t1))))
% 0.16/0.36  (assume @p6 @t5)
% 0.16/0.36  (assume @p7 (forall (@list @t1) (not (tptp.before @t1 @t1))))
% 0.16/0.36  (assume @p8 (forall (@list @t1 @t2 @t6) (=> (and @t3 (tptp.before @t2 @t6)) (tptp.before @t1 @t6))))
% 0.16/0.36  (assume @p9 (tptp.starts tptp.a tptp.b))
% 0.16/0.36  (assume @p10 (tptp.started_by tptp.c tptp.b))
% 0.16/0.36  (assume @p11 @t7)
% 0.16/0.36  (assume @p12 (not @t8))
% 0.16/0.36  (assume @p13 true)
% 0.16/0.36  (step @p14 :rule cnf_equiv_pos1 :args (@t9))
% 0.16/0.36  (step @p15 :rule reordering :premises (@p14) :args ((or @t8 (not @t7) @t10)))
% 0.16/0.36  (step @p16 :rule chain_m_resolution :premises (@p15 @p12 @p11) :args (@t10 @t11 (@list @t8 @t7)))
% 0.16/0.36  (assume-push @p23 @t5)
% 0.16/0.36  (step @p18 :rule instantiate :premises (@p6) :args ((@list tptp.d tptp.c)))
% 0.16/0.36  (step-pop @p24 :rule scope :premises (@p18))
% 0.16/0.36  (step @p19 :rule process_scope :premises (@p24) :args (@t9))
% 0.16/0.36  (step @p21 :rule implies_elim :premises (@p19))
% 0.16/0.36  (step @p22 false :rule chain_m_resolution :premises (@p21 @p16 @p6) :args (false @t11 (@list @t9 @t5)))
% 0.16/0.36  )
% 0.16/0.36  % SZS output end Proof
% 0.16/0.36  % cvc5 exiting
%------------------------------------------------------------------------------