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

% Computer : n010.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:47 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : GEO117+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14  % Command    : do_cvc5 %s %d
% 0.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Tue Aug 29 23:13:48 EDT 2023
% 0.15/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.63  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.vJQj386pVn/cvc5---1.0.5_24412.p...
% 0.21/0.63  ------- get file name : TPTP file name is GEO117+1
% 0.21/0.63  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24412.smt2...
% 0.21/0.63  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.63  % SZS status Theorem for GEO117+1
% 0.21/0.63  % SZS output start Proof for GEO117+1
% 0.21/0.63  (
% 0.21/0.63  (let ((_let_1 (forall ((O $$unsorted) (P $$unsorted)) (not (tptp.ordered_by O P P))))) (let ((_let_2 (not _let_1))) (let ((_let_3 (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))))))) (let ((_let_4 (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))))))) (let ((_let_5 (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)))))))) (let ((_let_6 (forall ((C $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (= (tptp.between_c C P Q R) (and (not (= P R)) (not (forall ((Cpp $$unsorted)) (or (not (tptp.part_of Cpp C)) (not (tptp.end_point P Cpp)) (not (tptp.end_point R Cpp)) (not (tptp.inner_point Q Cpp)))))))))) (let ((_let_7 (tptp.between_c SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_20 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_8 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_9 (not _let_7))) (let ((_let_10 (or (not (forall ((P $$unsorted)) (= (tptp.incident_o P SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2) (tptp.incident_c P SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_20)))) _let_9))) (let ((_let_11 (forall ((C $$unsorted)) (or (not (forall ((P $$unsorted)) (= (tptp.incident_c P C) (tptp.incident_o P SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)))) (not (tptp.between_c C SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3)))))) (let ((_let_12 (not _let_10))) (let ((_let_13 (not _let_11))) (let ((_let_14 (tptp.between_o SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_15 (= _let_14 _let_13))) (let ((_let_16 (forall ((P $$unsorted) (Q $$unsorted) (R $$unsorted) (O $$unsorted)) (= (tptp.between_o O P Q R) (not (forall ((C $$unsorted)) (or (not (forall ((P $$unsorted)) (= (tptp.incident_o P O) (tptp.incident_c P C)))) (not (tptp.between_c C P Q R))))))))) (let ((_let_17 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_18 (tptp.ordered_by SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_19 (= _let_18 _let_14))) (let ((_let_20 (_let_4))) (let ((_let_21 (ASSUME :args _let_20))) (let ((_let_22 (_let_2))) (let ((_let_23 (ASSUME :args _let_22))) (let ((_let_24 (or))) (let ((_let_25 (not _let_18))) (let ((_let_26 (_let_13))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_8 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_20 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.between_c C P Q R)))) :args (_let_6)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_10 1)) (CONG (REFL :args (_let_10)) (MACRO_SR_PRED_INTRO :args ((= (not _let_9) _let_7))) :args _let_24)) :args ((or _let_7 _let_10))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE (ASSUME :args _let_26)) :args _let_26) (REWRITE :args ((=> _let_13 (not (or (not (forall ((P $$unsorted)) (= (tptp.incident_c P SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_20) (tptp.incident_o P SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)))) _let_9))))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_13) _let_11))) (REFL :args (_let_12)) :args _let_24)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_15)) :args ((or (not _let_14) _let_13 (not _let_15)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_19)) :args ((or _let_25 _let_14 (not _let_19)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (SKOLEMIZE _let_23) :args _let_22) (REWRITE :args ((=> _let_2 (not _let_25)))))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_18)) :args _let_24)) _let_23 :args (_let_18 true _let_1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_21 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 QUANTIFIERS_INST_E_MATCHING ((tptp.ordered_by O Q R) (tptp.ordered_by O P Q)))) :args _let_20))) _let_21 :args (_let_19 false _let_4)) :args (_let_14 false _let_18 false _let_19)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_17 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.between_o O P Q R)))) :args (_let_16)))) _let_17 :args (_let_15 false _let_16)) :args (_let_13 false _let_14 false _let_15)) :args (_let_12 true _let_11)) :args (_let_7 true _let_10)) _let_8 :args (false false _let_7 false _let_6)) :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))) _let_5 _let_4 (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)))))) _let_3 (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_2 true)))))))))))))))))))))))))))))
% 0.21/0.64  )
% 0.21/0.64  % SZS output end Proof for GEO117+1
% 0.21/0.64  % cvc5---1.0.5 exiting
% 0.21/0.64  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------