TSTP Solution File: GEO112+1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n005.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:46 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : GEO112+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n005.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   : Tue Aug 29 20:27:07 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.54  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.OTM1KVJcfq/cvc5---1.0.5_29062.p...
% 0.21/0.54  ------- get file name : TPTP file name is GEO112+1
% 0.21/0.54  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_29062.smt2...
% 0.21/0.54  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.54  % SZS status Theorem for GEO112+1
% 0.21/0.54  % SZS output start Proof for GEO112+1
% 0.21/0.54  (
% 0.21/0.54  (let ((_let_1 (not (forall ((C $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (=> (tptp.between_c C P Q R) (tptp.between_c C R Q P)))))) (let ((_let_2 (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_3 (forall ((Cpp $$unsorted)) (or (not (tptp.part_of Cpp SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)) (not (tptp.end_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 Cpp)) (not (tptp.end_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 Cpp)) (not (tptp.inner_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 Cpp)))))) (let ((_let_4 (forall ((Cpp $$unsorted)) (or (not (tptp.part_of Cpp SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2)) (not (tptp.end_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 Cpp)) (not (tptp.end_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 Cpp)) (not (tptp.inner_point SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 Cpp)))))) (let ((_let_5 (not _let_3))) (let ((_let_6 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_7 (not _let_6))) (let ((_let_8 (and _let_7 _let_5))) (let ((_let_9 (tptp.between_c SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5))) (let ((_let_10 (= _let_9 _let_8))) (let ((_let_11 (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_12 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (_let_11))) (let ((_let_14 ((tptp.between_c C P Q R)))) (let ((_let_15 (tptp.between_c SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_16 (not _let_9))) (let ((_let_17 (or _let_16 _let_15))) (let ((_let_18 (forall ((C $$unsorted) (P $$unsorted) (Q $$unsorted) (R $$unsorted)) (or (not (tptp.between_c C P Q R)) (tptp.between_c C R Q P))))) (let ((_let_19 (not _let_17))) (let ((_let_20 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_21 (or))) (let ((_let_22 (not _let_18))) (let ((_let_23 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_20) :args (_let_22))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_22) _let_18))) (REFL :args (_let_19)) :args _let_21)) _let_20 :args (_let_19 true _let_18)))) (let ((_let_24 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS1 :args (_let_10)) :args ((or _let_16 _let_8 (not _let_10)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_17 0)) (CONG (REFL :args (_let_17)) (MACRO_SR_PRED_INTRO :args ((= (not _let_16) _let_9))) :args _let_21)) :args ((or _let_9 _let_17))) _let_23 :args (_let_9 true _let_17)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_12 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_14)) :args _let_13)) _let_12 :args (_let_10 false _let_11)) :args (_let_8 false _let_9 false _let_10)))) (let ((_let_25 (not _let_8))) (let ((_let_26 (not _let_4))) (let ((_let_27 (and _let_7 _let_26))) (let ((_let_28 (= _let_15 _let_27))) (let ((_let_29 (not _let_27))) (let ((_let_30 (_let_27))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 (MACRO_SR_PRED_INTRO :args ((= _let_3 _let_4) SB_DEFAULT SBA_SEQUENTIAL RW_EXT_REWRITE))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_AND_NEG :args _let_30) (CONG (REFL :args _let_30) (MACRO_SR_PRED_INTRO :args ((= (not _let_7) _let_6))) (MACRO_SR_PRED_INTRO :args ((= (not _let_26) _let_4))) :args _let_21)) :args ((or _let_6 _let_4 _let_27))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_8 0)) :args ((or _let_7 _let_25))) _let_24 :args (_let_7 false _let_8)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args (_let_28)) :args ((or _let_15 _let_29 (not _let_28)))) (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_17 1)) _let_23 :args ((not _let_15) true _let_17)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_12 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_5 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_4 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE _let_14)) :args _let_13))) _let_12 :args (_let_28 false _let_11)) :args (_let_29 true _let_15 false _let_28)) :args (_let_4 true _let_6 true _let_27)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_AND_POS :args (_let_8 1)) :args ((or _let_5 _let_25))) _let_24 :args (_let_5 false _let_8)) :args (false false _let_4 true _let_3)) :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_2 _let_1 true)))))))))))))))))))))))))))))))))
% 0.21/0.54  )
% 0.21/0.54  % SZS output end Proof for GEO112+1
% 0.21/0.54  % cvc5---1.0.5 exiting
% 0.21/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------