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

% Computer : n012.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:35 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : GEO080+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13  % Command    : do_cvc5 %s %d
% 0.14/0.34  % Computer : n012.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 29 22:40:08 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.52  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.CvwkiibAxg/cvc5---1.0.5_14745.p...
% 0.21/0.52  ------- get file name : TPTP file name is GEO080+1
% 0.21/0.52  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_14745.smt2...
% 0.21/0.52  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.52  % SZS status Theorem for GEO080+1
% 0.21/0.52  % SZS output start Proof for GEO080+1
% 0.21/0.52  (
% 0.21/0.52  (let ((_let_1 (forall ((C $$unsorted)) (tptp.part_of C C)))) (let ((_let_2 (not _let_1))) (let ((_let_3 (forall ((C $$unsorted) (C1 $$unsorted)) (= (tptp.part_of C1 C) (forall ((P $$unsorted)) (=> (tptp.incident_c P C1) (tptp.incident_c P C))))))) (let ((_let_4 (forall ((C $$unsorted) (C1 $$unsorted)) (= (tptp.part_of C1 C) (forall ((P $$unsorted)) (or (not (tptp.incident_c P C1)) (tptp.incident_c P C))))))) (let ((_let_5 (tptp.part_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_6 (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_7 (not _let_5))) (let ((_let_8 (_let_2))) (let ((_let_9 (ASSUME :args _let_8))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (MACRO_SR_PRED_ELIM (SCOPE (INSTANTIATE _let_6 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((tptp.part_of C1 C)))) :args (_let_4)))) (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_9) :args _let_8)) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_2) _let_1))) (REFL :args (_let_7)) :args (or))) _let_9 :args (_let_7 true _let_1)) _let_6 :args (false true _let_5 false _let_4)) :args (_let_3 (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 true))))))))))))
% 0.21/0.52  )
% 0.21/0.52  % SZS output end Proof for GEO080+1
% 0.21/0.52  % cvc5---1.0.5 exiting
% 0.21/0.52  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------