%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : CSR019+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n011.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 Aug 30 21:04:30 EDT 2023

% Result   : Theorem 0.22s 0.58s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem    : CSR019+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.10/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n011.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Aug 28 10:45:55 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.22/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.22/0.58  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.I3JklcBgvz/cvc5---1.0.5_10306.p...
% 0.22/0.58  ------- get file name : TPTP file name is CSR019+1
% 0.22/0.58  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_10306.smt2...
% 0.22/0.58  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.22/0.58  % SZS status Theorem for CSR019+1
% 0.22/0.58  % SZS output start Proof for CSR019+1
% 0.22/0.58  (
% 0.22/0.58  (let ((_let_1 (tptp.holdsAt tptp.forwards tptp.n2))) (let ((_let_2 (not (not _let_1)))) (let ((_let_3 (tptp.plus tptp.n1 tptp.n1))) (let ((_let_4 (= _let_3 tptp.n2))) (let ((_let_5 (= tptp.forwards tptp.spinning))) (let ((_let_6 (= tptp.forwards tptp.backwards))) (let ((_let_7 (= tptp.push tptp.pull))) (let ((_let_8 (forall ((Event $$unsorted) (Time $$unsorted)) (let ((_let_1 (= Time tptp.n2))) (let ((_let_2 (= Event tptp.push))) (let ((_let_3 (= Event tptp.pull))) (= (tptp.happens Event Time) (or (and _let_2 (= Time tptp.n0)) (and _let_3 (= Time tptp.n1)) (and _let_3 _let_1) (and _let_2 _let_1))))))))) (let ((_let_9 (forall ((Event $$unsorted) (Fluent $$unsorted) (Time $$unsorted)) (let ((_let_1 (tptp.happens tptp.push Time))) (let ((_let_2 (not _let_1))) (let ((_let_3 (= Fluent tptp.spinning))) (let ((_let_4 (= Event tptp.pull))) (let ((_let_5 (not (tptp.happens tptp.pull Time)))) (let ((_let_6 (= Event tptp.push))) (let ((_let_7 (= Fluent tptp.backwards))) (let ((_let_8 (= Fluent tptp.forwards))) (= (tptp.terminates Event Fluent Time) (or (and _let_6 _let_7 _let_5) (and _let_4 _let_8 _let_2) (and _let_4 _let_8 _let_1) (and _let_4 _let_7 _let_1) (and _let_6 _let_3 _let_5) (and _let_4 _let_3 _let_2)))))))))))))) (let ((_let_10 (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted)) (=> (and (tptp.happens Event Time) (tptp.terminates Event Fluent Time)) (not (tptp.holdsAt Fluent (tptp.plus Time tptp.n1))))))) (let ((_let_11 (tptp.happens tptp.push tptp.n1))) (let ((_let_12 (not _let_11))) (let ((_let_13 (tptp.happens tptp.pull tptp.n1))) (let ((_let_14 (not _let_13))) (let ((_let_15 (or (and _let_7 _let_6 _let_14) _let_12 _let_11 (and _let_6 _let_11) (and _let_7 _let_5 _let_14) (and _let_5 _let_12)))) (let ((_let_16 (tptp.terminates tptp.pull tptp.forwards tptp.n1))) (let ((_let_17 (= _let_16 _let_15))) (let ((_let_18 (not _let_15))) (let ((_let_19 (forall ((Event $$unsorted) (Fluent $$unsorted) (Time $$unsorted)) (let ((_let_1 (tptp.happens tptp.push Time))) (let ((_let_2 (not _let_1))) (let ((_let_3 (= tptp.spinning Fluent))) (let ((_let_4 (= tptp.pull Event))) (let ((_let_5 (not (tptp.happens tptp.pull Time)))) (let ((_let_6 (= tptp.push Event))) (let ((_let_7 (= tptp.backwards Fluent))) (let ((_let_8 (= tptp.forwards Fluent))) (= (tptp.terminates Event Fluent Time) (or (and _let_6 _let_7 _let_5) (and _let_4 _let_8 _let_2) (and _let_4 _let_8 _let_1) (and _let_4 _let_7 _let_1) (and _let_6 _let_3 _let_5) (and _let_4 _let_3 _let_2)))))))))))))) (let ((_let_20 (EQ_RESOLVE (ASSUME :args (_let_9)) (MACRO_SR_EQ_INTRO :args (_let_9 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_21 (tptp.holdsAt tptp.forwards _let_3))) (let ((_let_22 (not _let_21))) (let ((_let_23 (not _let_16))) (let ((_let_24 (or _let_14 _let_23 _let_22))) (let ((_let_25 (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted)) (or (not (tptp.happens Event Time)) (not (tptp.terminates Event Fluent Time)) (not (tptp.holdsAt Fluent (tptp.plus Time tptp.n1))))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_10)) (MACRO_SR_EQ_INTRO :args (_let_10 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_27 (forall ((Event $$unsorted) (Time $$unsorted)) (let ((_let_1 (= tptp.n2 Time))) (let ((_let_2 (= tptp.push Event))) (let ((_let_3 (= tptp.pull Event))) (= (tptp.happens Event Time) (or (and _let_2 (= tptp.n0 Time)) (and _let_3 (= tptp.n1 Time)) (and _let_3 _let_1) (and _let_2 _let_1))))))))) (let ((_let_28 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_29 (= tptp.n2 _let_3))) (let ((_let_30 (SYMM (ASSUME :args (_let_4))))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_32 (and _let_1 _let_29))) (let ((_let_33 (_let_1 _let_29))) (let ((_let_34 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_17)) :args ((or _let_16 _let_18 (not _let_17)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_24)) :args ((or _let_22 _let_14 _let_23 (not _let_24)))) (MACRO_RESOLUTION_TRUST (RESOLUTION (CNF_AND_NEG :args (_let_32)) (IMPLIES_ELIM (SCOPE (MODUS_PONENS (AND_INTRO _let_31 _let_30) (SCOPE (TRUE_ELIM (TRANS (CONG (REFL :args (tptp.forwards)) (SYMM _let_30) :args (APPLY_UF tptp.holdsAt)) (TRUE_INTRO _let_31))) :args _let_33)) :args _let_33)) :args (true _let_32)) _let_31 _let_30 :args (_let_21 false _let_1 false _let_29)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_28 :args (tptp.pull tptp.n1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.happens Event Time)))) :args (_let_27)))) _let_28 :args (_let_13 false _let_27)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.pull tptp.n1 tptp.forwards QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.happens Event Time) false)) (not (= (tptp.holdsAt Fluent (tptp.plus Time tptp.n1)) false))))) :args (_let_25))) _let_26 :args (_let_24 false _let_25)) :args (_let_23 false _let_21 false _let_13 false _let_24)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_20 :args (tptp.pull tptp.forwards tptp.n1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.terminates Event Fluent Time)))) :args (_let_19)))) _let_20 :args (_let_17 false _let_19)) :args (_let_18 true _let_16 false _let_17)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_NEG :args (_let_15 2)) :args ((or _let_12 _let_15))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_15 1)) (CONG (REFL :args (_let_15)) (MACRO_SR_PRED_INTRO :args ((= (not _let_12) _let_11))) :args (or))) :args ((or _let_11 _let_15))) _let_34 :args (_let_11 true _let_15)) _let_34 :args (false false _let_11 true _let_15)) :args ((forall ((Time1 $$unsorted) (Fluent $$unsorted) (Time2 $$unsorted)) (= (tptp.stoppedIn Time1 Fluent Time2) (exists ((Event $$unsorted) (Time $$unsorted)) (and (tptp.happens Event Time) (tptp.less Time1 Time) (tptp.less Time Time2) (tptp.terminates Event Fluent Time))))) (forall ((Time1 $$unsorted) (Time2 $$unsorted) (Fluent $$unsorted)) (= (tptp.startedIn Time1 Fluent Time2) (exists ((Event $$unsorted) (Time $$unsorted)) (and (tptp.happens Event Time) (tptp.less Time1 Time) (tptp.less Time Time2) (tptp.initiates Event Fluent Time))))) (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted) (Fluent2 $$unsorted) (Offset $$unsorted)) (let ((_let_1 (tptp.plus Time Offset))) (=> (and (tptp.happens Event Time) (tptp.initiates Event Fluent Time) (tptp.less tptp.n0 Offset) (tptp.trajectory Fluent Time Fluent2 Offset) (not (tptp.stoppedIn Time Fluent _let_1))) (tptp.holdsAt Fluent2 _let_1)))) (forall ((Event $$unsorted) (Time1 $$unsorted) (Fluent1 $$unsorted) (Time2 $$unsorted) (Fluent2 $$unsorted)) (let ((_let_1 (tptp.plus Time1 Time2))) (=> (and (tptp.happens Event Time1) (tptp.terminates Event Fluent1 Time1) (tptp.less tptp.n0 Time2) (tptp.antitrajectory Fluent1 Time1 Fluent2 Time2) (not (tptp.startedIn Time1 Fluent1 _let_1))) (tptp.holdsAt Fluent2 _let_1)))) (forall ((Fluent $$unsorted) (Time $$unsorted)) (let ((_let_1 (tptp.plus Time tptp.n1))) (=> (and (tptp.holdsAt Fluent Time) (not (tptp.releasedAt Fluent _let_1)) (not (exists ((Event $$unsorted)) (and (tptp.happens Event Time) (tptp.terminates Event Fluent Time))))) (tptp.holdsAt Fluent _let_1)))) (forall ((Fluent $$unsorted) (Time $$unsorted)) (let ((_let_1 (tptp.plus Time tptp.n1))) (=> (and (not (tptp.holdsAt Fluent Time)) (not (tptp.releasedAt Fluent _let_1)) (not (exists ((Event $$unsorted)) (and (tptp.happens Event Time) (tptp.initiates Event Fluent Time))))) (not (tptp.holdsAt Fluent _let_1))))) (forall ((Fluent $$unsorted) (Time $$unsorted)) (=> (and (tptp.releasedAt Fluent Time) (not (exists ((Event $$unsorted)) (and (tptp.happens Event Time) (or (tptp.initiates Event Fluent Time) (tptp.terminates Event Fluent Time)))))) (tptp.releasedAt Fluent (tptp.plus Time tptp.n1)))) (forall ((Fluent $$unsorted) (Time $$unsorted)) (=> (and (not (tptp.releasedAt Fluent Time)) (not (exists ((Event $$unsorted)) (and (tptp.happens Event Time) (tptp.releases Event Fluent Time))))) (not (tptp.releasedAt Fluent (tptp.plus Time tptp.n1))))) (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted)) (=> (and (tptp.happens Event Time) (tptp.initiates Event Fluent Time)) (tptp.holdsAt Fluent (tptp.plus Time tptp.n1)))) _let_10 (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted)) (=> (and (tptp.happens Event Time) (tptp.releases Event Fluent Time)) (tptp.releasedAt Fluent (tptp.plus Time tptp.n1)))) (forall ((Event $$unsorted) (Time $$unsorted) (Fluent $$unsorted)) (=> (and (tptp.happens Event Time) (or (tptp.initiates Event Fluent Time) (tptp.terminates Event Fluent Time))) (not (tptp.releasedAt Fluent (tptp.plus Time tptp.n1))))) (forall ((Event $$unsorted) (Fluent $$unsorted) (Time $$unsorted)) (let ((_let_1 (tptp.happens tptp.push Time))) (let ((_let_2 (= Event tptp.pull))) (= (tptp.initiates Event Fluent Time) (or (and (= Event tptp.push) (= Fluent tptp.forwards) (not (tptp.happens tptp.pull Time))) (and _let_2 (= Fluent tptp.backwards) (not _let_1)) (and _let_2 (= Fluent tptp.spinning) _let_1)))))) _let_9 (forall ((Event $$unsorted) (Fluent $$unsorted) (Time $$unsorted)) (not (tptp.releases Event Fluent Time))) _let_8 (not _let_7) (not _let_6) (not _let_5) (not (= tptp.spinning tptp.backwards)) (= (tptp.plus tptp.n0 tptp.n0) tptp.n0) (= (tptp.plus tptp.n0 tptp.n1) tptp.n1) (= (tptp.plus tptp.n0 tptp.n2) tptp.n2) (= (tptp.plus tptp.n0 tptp.n3) tptp.n3) _let_4 (= (tptp.plus tptp.n1 tptp.n2) tptp.n3) (= (tptp.plus tptp.n1 tptp.n3) tptp.n4) (= (tptp.plus tptp.n2 tptp.n2) tptp.n4) (= (tptp.plus tptp.n2 tptp.n3) tptp.n5) (= (tptp.plus tptp.n3 tptp.n3) tptp.n6) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.plus X Y) (tptp.plus Y X))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.less_or_equal X Y) (or (tptp.less X Y) (= X Y)))) (not (exists ((X $$unsorted)) (tptp.less X tptp.n0))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n1) (tptp.less_or_equal X tptp.n0))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n2) (tptp.less_or_equal X tptp.n1))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n3) (tptp.less_or_equal X tptp.n2))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n4) (tptp.less_or_equal X tptp.n3))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n5) (tptp.less_or_equal X tptp.n4))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n6) (tptp.less_or_equal X tptp.n5))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n7) (tptp.less_or_equal X tptp.n6))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n8) (tptp.less_or_equal X tptp.n7))) (forall ((X $$unsorted)) (= (tptp.less X tptp.n9) (tptp.less_or_equal X tptp.n8))) (forall ((X $$unsorted) (Y $$unsorted)) (= (tptp.less X Y) (and (not (tptp.less Y X)) (not (= Y X))))) (not (tptp.holdsAt tptp.forwards tptp.n0)) (not (tptp.holdsAt tptp.backwards tptp.n0)) (not (tptp.holdsAt tptp.spinning tptp.n0)) (forall ((Fluent $$unsorted) (Time $$unsorted)) (not (tptp.releasedAt Fluent Time))) _let_2 true)))))))))))))))))))))))))))))))))))))
% 0.22/0.58  )
% 0.22/0.58  % SZS output end Proof for CSR019+1
% 0.22/0.58  % cvc5---1.0.5 exiting
% 0.22/0.59  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------