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

View Problem - Process Solution

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

% Computer : n007.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:38 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GEO086+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.13/0.35  % Computer : n007.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 23:00:29 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.21/0.49  %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.53  ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.5hilwIMWDH/cvc5---1.0.5_25000.p...
% 0.21/0.53  ------- get file name : TPTP file name is GEO086+1
% 0.21/0.53  ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_25000.smt2...
% 0.21/0.53  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.53  % SZS status Theorem for GEO086+1
% 0.21/0.53  % SZS output start Proof for GEO086+1
% 0.21/0.53  (
% 0.21/0.53  (let ((_let_1 (not (forall ((C $$unsorted) (Cpp $$unsorted)) (=> (and (tptp.open C) (tptp.part_of Cpp C)) (tptp.open Cpp)))))) (let ((_let_2 (forall ((C $$unsorted) (C1 $$unsorted)) (=> (and (tptp.part_of C1 C) (not (= C1 C))) (tptp.open C1))))) (let ((_let_3 (tptp.open SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_4 (tptp.open SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_5 (= SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3))) (let ((_let_6 (tptp.part_of SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2))) (let ((_let_7 (not _let_6))) (let ((_let_8 (not _let_3))) (let ((_let_9 (or _let_8 _let_7 _let_4))) (let ((_let_10 (forall ((C $$unsorted) (Cpp $$unsorted)) (or (not (tptp.open C)) (not (tptp.part_of Cpp C)) (tptp.open Cpp))))) (let ((_let_11 (not _let_9))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_1)) (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_13 (or))) (let ((_let_14 (not _let_10))) (let ((_let_15 (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (IMPLIES_ELIM (SCOPE (SKOLEMIZE _let_12) :args (_let_14))) (CONG (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_10))) (REFL :args (_let_11)) :args _let_13)) _let_12 :args (_let_11 true _let_10)))) (let ((_let_16 (REFL :args (_let_9)))) (let ((_let_17 (not _let_4))) (let ((_let_18 (MACRO_RESOLUTION_TRUST (CNF_OR_NEG :args (_let_9 2)) _let_15 :args (_let_17 true _let_9)))) (let ((_let_19 (or _let_7 _let_5 _let_4))) (let ((_let_20 (forall ((C $$unsorted) (C1 $$unsorted)) (or (not (tptp.part_of C1 C)) (= C C1) (tptp.open C1))))) (let ((_let_21 (EQ_RESOLVE (ASSUME :args (_let_2)) (MACRO_SR_EQ_INTRO :args (_let_2 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_22 (ASSUME :args (_let_3)))) (let ((_let_23 (ASSUME :args (_let_5)))) (let ((_let_24 (ASSUME :args (_let_17)))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_22 _let_23 _let_24) :args (_let_3 _let_17 _let_5)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS (SYMM (FALSE_INTRO _let_24)) (CONG (SYMM _let_23) :args (APPLY_UF tptp.open)) (TRUE_INTRO _let_22))) :args (_let_3 _let_5 _let_17)) :args ((not (and _let_3 _let_17 _let_5)) SB_LITERAL))) (CONG (REFL :args (_let_8)) (MACRO_SR_PRED_INTRO :args ((= (not _let_17) _let_4))) (REFL :args ((not _let_5))) :args _let_13)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_19)) :args ((or _let_7 _let_4 _let_5 (not _let_19)))) (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 1)) (CONG _let_16 (MACRO_SR_PRED_INTRO :args ((= (not _let_7) _let_6))) :args _let_13)) :args ((or _let_6 _let_9))) _let_15 :args (_let_6 true _let_9)) _let_18 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_21 :args (SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_2 SKOLEM_FUN_QUANTIFIERS_SKOLEMIZE_3 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.part_of C1 C) false))))) :args (_let_20))) _let_21 :args (_let_19 false _let_20)) :args (_let_5 false _let_6 true _let_4 false _let_19)) _let_18 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (CNF_OR_NEG :args (_let_9 0)) (CONG _let_16 (MACRO_SR_PRED_INTRO :args ((= (not _let_8) _let_3))) :args _let_13)) :args ((or _let_3 _let_9))) _let_15 :args (_let_3 true _let_9)) :args (false false _let_5 true _let_4 false _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)))) _let_2 (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_1 true)))))))))))))))))))))))))))
% 0.21/0.54  )
% 0.21/0.54  % SZS output end Proof for GEO086+1
% 0.21/0.54  % cvc5---1.0.5 exiting
% 0.21/0.54  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------