%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : GEO147+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : do_cvc5 %s %d

% Computer : n008.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 22:49:57 EDT 2023

% Result   : Theorem 0.21s 0.51s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : GEO147+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 29 21:57:17 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.21/0.47  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.51  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.dxBXak5BR8/cvc5---1.0.5_5107.p...
% 0.21/0.51  ------- get file name : TPTP file name is GEO147+1
% 0.21/0.51  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_5107.smt2...
% 0.21/0.51  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.51  % SZS status Theorem for GEO147+1
% 0.21/0.51  % SZS output start Proof for GEO147+1
% 0.21/0.51  (
% 0.21/0.51  (let ((_let_1 (not (forall ((P $$unsorted) (X $$unsorted) (Y $$unsorted)) (=> (tptp.connect X Y P) (and (tptp.incident_o P (tptp.trajectory_of X)) (tptp.incident_o P (tptp.trajectory_of Y)))))))) (let ((_let_2 (forall ((X $$unsorted) (P $$unsorted)) (= (tptp.once (tptp.at X P)) (tptp.incident_o P (tptp.trajectory_of X)))))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted)) (=> (tptp.once (tptp.at_the_same_time A B)) (and (tptp.once A) (tptp.once B)))))) (let ((_let_4 (forall ((X $$unsorted) (Y $$unsorted) (P $$unsorted)) (= (tptp.connect X Y P) (tptp.once (tptp.at_the_same_time (tptp.at X P) (tptp.at Y P))))))) (let ((_let_5 (tptp.incident_o SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 (tptp.trajectory_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4)))) (let ((_let_6 (tptp.incident_o SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 (tptp.trajectory_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3)))) (let ((_let_7 (and _let_6 _let_5))) (let ((_let_8 (tptp.connect SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_9 (not _let_8))) (let ((_let_10 (or _let_9 _let_7))) (let ((_let_11 (forall ((P $$unsorted) (X $$unsorted) (Y $$unsorted)) (or (not (tptp.connect X Y P)) (and (tptp.incident_o P (tptp.trajectory_of X)) (tptp.incident_o P (tptp.trajectory_of Y))))))) (let ((_let_12 (not _let_10))) (let ((_let_13 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_14 (or))) (let ((_let_15 (not _let_11))) (let ((_let_16 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_13) :args (_let_15))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_15) _let_11))) (REFL :args (_let_12)) :args _let_14)) _let_13 :args (_let_12 true _let_11)))) (let ((_let_17 (tptp.at SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_18 (tptp.once _let_17))) (let ((_let_19 (= _let_6 _let_18))) (let ((_let_20 (_let_2))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 ((tptp.incident_o P (tptp.trajectory_of X))))) (let ((_let_23 (tptp.at SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_24 (tptp.once _let_23))) (let ((_let_25 (and _let_18 _let_24))) (let ((_let_26 (tptp.once (tptp.at_the_same_time _let_17 _let_23)))) (let ((_let_27 (not _let_26))) (let ((_let_28 (or _let_27 _let_25))) (let ((_let_29 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.once (tptp.at_the_same_time A B))) (and (tptp.once A) (tptp.once B)))))) (let ((_let_30 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_31 (= _let_8 _let_26))) (let ((_let_32 (_let_4))) (let ((_let_33 (ASSUME :args _let_32))) (let ((_let_34 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_28)) :args ((or _let_27 _let_25 (not _let_28)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_31)) :args ((or _let_9 _let_26 (not _let_31)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_10 0)) (CONG (REFL :args (_let_10)) (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_8))) :args _let_14)) :args ((or _let_8 _let_10))) _let_16 :args (_let_8 true _let_10)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_33 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.connect X Y P)))) :args _let_32)) _let_33 :args (_let_31 false _let_4)) :args (_let_26 false _let_8 false _let_31)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_30 :args (_let_17 _let_23 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.at_the_same_time A B)))) :args (_let_29))) _let_30 :args (_let_28 false _let_29)) :args (_let_25 false _let_26 false _let_28)))) (let ((_let_35 (not _let_25))) (let ((_let_36 (= _let_5 _let_24))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (CNF_AND_NEG :args (_let_7)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_36)) :args ((or _let_5 (not _let_24) (not _let_36)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_25 1)) :args ((or _let_24 _let_35))) _let_34 :args (_let_24 false _let_25)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_21 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING _let_22)) :args _let_20))) _let_21 :args (_let_36 false _let_2)) :args (_let_5 false _let_24 false _let_36)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_19)) :args ((or _let_6 (not _let_18) (not _let_19)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_25 0)) :args ((or _let_18 _let_35))) _let_34 :args (_let_18 false _let_25)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_21 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING _let_22)) :args _let_20))) _let_21 :args (_let_19 false _let_2)) :args (_let_6 false _let_18 false _let_19)) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_10 1)) _let_16 :args ((not _let_7) true _let_10)) :args (false false _let_5 false _let_6 true _let_7)) :args ((forall ((C $$unsorted) (C1 $$unsorted)) (= (tptp.part_of C1 C) (forall ((P $$unsorted)) (=> (tptp.incident_c P C1) (tptp.incident_c P C))))) (forall ((C $$unsorted) (C1 $$unsorted) (C2 $$unsorted)) (= (= C (tptp.sum C1 C2)) (forall ((Q $$unsorted)) (= (tptp.incident_c Q C) (or (tptp.incident_c Q C1) (tptp.incident_c Q C2)))))) (forall ((P $$unsorted) (C $$unsorted)) (= (tptp.end_point P C) (and (tptp.incident_c P C) (forall ((C1 $$unsorted) (C2 $$unsorted)) (=> (and (tptp.part_of C1 C) (tptp.part_of C2 C) (tptp.incident_c P C1) (tptp.incident_c P C2)) (or (tptp.part_of C1 C2) (tptp.part_of C2 C1))))))) (forall ((P $$unsorted) (C $$unsorted)) (= (tptp.inner_point P C) (and (tptp.incident_c P C) (not (tptp.end_point P C))))) (forall ((P $$unsorted) (C $$unsorted) (C1 $$unsorted)) (= (tptp.meet P C C1) (and (tptp.incident_c P C) (tptp.incident_c P C1) (forall ((Q $$unsorted)) (=> (and (tptp.incident_c Q C) (tptp.incident_c Q C1)) (and (tptp.end_point Q C) (tptp.end_point Q C1))))))) (forall ((C $$unsorted)) (= (tptp.closed C) (not (exists ((P $$unsorted)) (tptp.end_point P C))))) (forall ((C $$unsorted)) (= (tptp.open C) (exists ((P $$unsorted)) (tptp.end_point P C)))) (forall ((C $$unsorted) (C1 $$unsorted)) (=> (and (tptp.part_of C1 C) (not (= C1 C))) (tptp.open C1))) (forall ((C $$unsorted) (C1 $$unsorted) (C2 $$unsorted) (C3 $$unsorted)) (=> (and (tptp.part_of C1 C) (tptp.part_of C2 C) (tptp.part_of C3 C) (exists ((P $$unsorted)) (and (tptp.end_point P C1) (tptp.end_point P C2) (tptp.end_point P C3)))) (or (tptp.part_of C2 C3) (tptp.part_of C3 C2) (tptp.part_of C1 C2) (tptp.part_of C2 C1) (tptp.part_of C1 C3) (tptp.part_of C3 C1)))) (forall ((C $$unsorted)) (exists ((P $$unsorted)) (tptp.inner_point P C))) (forall ((C $$unsorted) (P $$unsorted)) (=> (tptp.inner_point P C) (exists ((C1 $$unsorted) (C2 $$unsorted)) (and (tptp.meet P C1 C2) (= C (tptp.sum C1 C2)))))) (forall ((C $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (=> (and (tptp.end_point P C) (tptp.end_point Q C) (tptp.end_point R C)) (or (= P Q) (= P R) (= Q R)))) (forall ((C $$unsorted) (P $$unsorted)) (=> (tptp.end_point P C) (exists ((Q $$unsorted)) (and (tptp.end_point Q C) (not (= P Q)))))) (forall ((C $$unsorted) (C1 $$unsorted) (C2 $$unsorted) (P $$unsorted)) (=> (and (tptp.closed C) (tptp.meet P C1 C2) (= C (tptp.sum C1 C2))) (forall ((Q $$unsorted)) (=> (tptp.end_point Q C1) (tptp.meet Q C1 C2))))) (forall ((C1 $$unsorted) (C2 $$unsorted)) (=> (exists ((P $$unsorted)) (tptp.meet P C1 C2)) (exists ((C $$unsorted)) (= C (tptp.sum C1 C2))))) (forall ((C $$unsorted) (C1 $$unsorted)) (=> (forall ((P $$unsorted)) (= (tptp.incident_c P C) (tptp.incident_c P C1))) (= C C1))) (forall ((C $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (= (tptp.between_c C P Q R) (and (not (= P R)) (exists ((Cpp $$unsorted)) (and (tptp.part_of Cpp C) (tptp.end_point P Cpp) (tptp.end_point R Cpp) (tptp.inner_point Q Cpp)))))) (forall ((O $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (= (tptp.between_o O P Q R) (or (and (tptp.ordered_by O P Q) (tptp.ordered_by O Q R)) (and (tptp.ordered_by O R Q) (tptp.ordered_by O Q P))))) (forall ((P $$unsorted) (O $$unsorted)) (= (tptp.start_point P O) (and (tptp.incident_o P O) (forall ((Q $$unsorted)) (=> (and (not (= P Q)) (tptp.incident_o Q O)) (tptp.ordered_by O P Q)))))) (forall ((P $$unsorted) (O $$unsorted)) (= (tptp.finish_point P O) (and (tptp.incident_o P O) (forall ((Q $$unsorted)) (=> (and (not (= P Q)) (tptp.incident_o Q O)) (tptp.ordered_by O Q P)))))) (forall ((O $$unsorted) (P $$unsorted) (Q $$unsorted)) (=> (tptp.ordered_by O P Q) (and (tptp.incident_o P O) (tptp.incident_o Q O)))) (forall ((O $$unsorted)) (exists ((C $$unsorted)) (and (tptp.open C) (forall ((P $$unsorted)) (= (tptp.incident_o P O) (tptp.incident_c P C)))))) (forall ((P $$unsorted) (Q $$unsorted) (R $$unsorted) (O $$unsorted)) (= (tptp.between_o O P Q R) (exists ((C $$unsorted)) (and (forall ((P $$unsorted)) (= (tptp.incident_o P O) (tptp.incident_c P C))) (tptp.between_c C P Q R))))) (forall ((O $$unsorted)) (exists ((P $$unsorted)) (tptp.start_point P O))) (forall ((P $$unsorted) (Q $$unsorted) (C $$unsorted)) (=> (and (tptp.open C) (not (= P Q)) (tptp.incident_c P C) (tptp.incident_c Q C)) (exists ((O $$unsorted)) (and (forall ((R $$unsorted)) (= (tptp.incident_o R O) (tptp.incident_c R C))) (tptp.ordered_by O P Q))))) (forall ((O1 $$unsorted) (O2 $$unsorted)) (=> (forall ((P $$unsorted) (Q $$unsorted)) (= (tptp.ordered_by O1 P Q) (tptp.ordered_by O2 P Q))) (= O1 O2))) (forall ((C $$unsorted) (O $$unsorted)) (= (= C (tptp.underlying_curve O)) (forall ((P $$unsorted)) (= (tptp.incident_o P O) (tptp.incident_c P C))))) _let_4 (forall ((A $$unsorted) (B $$unsorted)) (= (tptp.once (tptp.at_the_same_time A B)) (tptp.once (tptp.at_the_same_time B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (= (tptp.once (tptp.at_the_same_time (tptp.at_the_same_time A B) C)) (tptp.once (tptp.at_the_same_time A (tptp.at_the_same_time B C))))) (forall ((A $$unsorted)) (=> (tptp.once A) (tptp.once (tptp.at_the_same_time A A)))) _let_3 _let_2 (forall ((X $$unsorted)) (exists ((O $$unsorted)) (= (tptp.trajectory_of X) O))) (forall ((P1 $$unsorted) (P2 $$unsorted) (Q1 $$unsorted) (Q2 $$unsorted) (X $$unsorted) (Y $$unsorted)) (=> (and (tptp.once (tptp.at_the_same_time (tptp.at X P1) (tptp.at Y P2))) (tptp.once (tptp.at_the_same_time (tptp.at X Q1) (tptp.at Y Q2)))) (not (and (tptp.ordered_by (tptp.trajectory_of X) P1 Q1) (tptp.ordered_by (tptp.trajectory_of Y) Q2 P2))))) (forall ((A $$unsorted)) (=> (tptp.once A) (forall ((X $$unsorted)) (exists ((P $$unsorted)) (tptp.once (tptp.at_the_same_time A (tptp.at X P))))))) _let_1 true)))))))))))))))))))))))))))))))))))))))
% 0.21/0.51  )
% 0.21/0.51  % SZS output end Proof for GEO147+1
% 0.21/0.51  % cvc5---1.0.5 exiting
% 0.21/0.51  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------