TSTP Solution File: GEO083-1 by cvc5---1.0.5

View Problem - Process Solution

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

% Computer : n027.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:36 EDT 2023

% Result   : Unsatisfiable 0.20s 0.56s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : GEO083-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n027.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   : Wed Aug 30 00:16:23 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  %----Proving TF0_NAR, FOF, or CNF
% 0.20/0.49  ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.UgAfe6t81X/cvc5---1.0.5_20817.p...
% 0.20/0.50  ------- get file name : TPTP file name is GEO083-1
% 0.20/0.50  ------- cvc5-fof : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_20817.smt2...
% 0.20/0.50  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.20/0.56  % SZS status Unsatisfiable for GEO083-1
% 0.20/0.56  % SZS output start Proof for GEO083-1
% 0.20/0.56  (
% 0.20/0.56  (let ((_let_1 (tptp.sum tptp.sk14 tptp.sk16))) (let ((_let_2 (tptp.sum tptp.sk14 tptp.sk15))) (let ((_let_3 (tptp.part_of _let_2 _let_1))) (let ((_let_4 (not _let_3))) (let ((_let_5 (tptp.part_of tptp.sk15 tptp.sk16))) (let ((_let_6 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D C)) (tptp.incident_c D A))))) (let ((_let_7 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D B)) (tptp.incident_c D A))))) (let ((_let_8 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (= A (tptp.sum B C))) (not (tptp.incident_c D A)) (tptp.incident_c D B) (tptp.incident_c D C))))) (let ((_let_9 (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))))) (let ((_let_10 (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))))) (let ((_let_11 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.incident_c C A)) (tptp.incident_c C B))))) (let ((_let_12 (tptp.ax0_sk1 _let_2 _let_1))) (let ((_let_13 (tptp.incident_c _let_12 tptp.sk16))) (let ((_let_14 (tptp.incident_c _let_12 tptp.sk15))) (let ((_let_15 (not _let_14))) (let ((_let_16 (not _let_5))) (let ((_let_17 (or _let_16 _let_15 _let_13))) (let ((_let_18 (_let_11))) (let ((_let_19 (ASSUME :args _let_18))) (let ((_let_20 (not _let_17))) (let ((_let_21 (tptp.incident_c _let_12 tptp.sk14))) (let ((_let_22 (tptp.incident_c _let_12 _let_2))) (let ((_let_23 (not _let_22))) (let ((_let_24 (or _let_23 _let_21 _let_14))) (let ((_let_25 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.incident_c D (tptp.sum B C))) (tptp.incident_c D B) (tptp.incident_c D C))))) (let ((_let_26 (EQ_RESOLVE (ASSUME :args (_let_8)) (MACRO_SR_EQ_INTRO :args (_let_8 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_27 (tptp.incident_c _let_12 _let_1))) (let ((_let_28 (not _let_21))) (let ((_let_29 (or _let_28 _let_27))) (let ((_let_30 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.incident_c D B)) (tptp.incident_c D (tptp.sum B C)))))) (let ((_let_31 (EQ_RESOLVE (ASSUME :args (_let_7)) (MACRO_SR_EQ_INTRO :args (_let_7 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_32 (not _let_27))) (let ((_let_33 (or _let_32 _let_3))) (let ((_let_34 (_let_9))) (let ((_let_35 (ASSUME :args _let_34))) (let ((_let_36 (ASSUME :args (_let_4)))) (let ((_let_37 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_33)) :args ((or _let_3 _let_32 (not _let_33)))) _let_36 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_35 :args (_let_2 _let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.part_of A B) true))))) :args _let_34)) _let_35 :args (_let_33 false _let_9)) :args (_let_32 true _let_3 false _let_33)))) (let ((_let_38 (or _let_22 _let_3))) (let ((_let_39 (_let_10))) (let ((_let_40 (ASSUME :args _let_39))) (let ((_let_41 (not _let_13))) (let ((_let_42 (or _let_41 _let_27))) (let ((_let_43 (forall ((B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.incident_c D C)) (tptp.incident_c D (tptp.sum B C)))))) (let ((_let_44 (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_19 :args (tptp.sk15 tptp.sk16 _let_12 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.part_of A B) false)) (not (= (tptp.incident_c C A) false))))) :args _let_18)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_17)) :args ((or _let_16 _let_13 _let_15 _let_20))) (ASSUME :args (_let_5)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_42)) :args ((or _let_27 _let_41 (not _let_42)))) _let_37 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_44 :args (tptp.sk14 tptp.sk16 _let_12 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.incident_c D (tptp.sum B C)) true))))) :args (_let_43))) _let_44 :args (_let_42 false _let_43)) :args (_let_41 true _let_27 false _let_42)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_24)) :args ((or _let_23 _let_21 _let_14 (not _let_24)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_38)) :args ((or _let_3 _let_22 (not _let_38)))) _let_36 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_40 :args (_let_2 _let_1 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.part_of A B) true))))) :args _let_39)) _let_40 :args (_let_38 false _let_10)) :args (_let_22 true _let_3 false _let_38)) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_29)) :args ((or _let_27 _let_28 (not _let_29)))) _let_37 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_31 :args (tptp.sk14 tptp.sk16 _let_12 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.incident_c D (tptp.sum B C)) true))))) :args (_let_30))) _let_31 :args (_let_29 false _let_30)) :args (_let_28 true _let_27 false _let_29)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_26 :args (tptp.sk14 tptp.sk15 _let_12 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.incident_c D (tptp.sum B C)) false))))) :args (_let_25))) _let_26 :args (_let_24 false _let_25)) :args (_let_14 false _let_22 true _let_21 false _let_24)) :args (_let_20 false _let_5 true _let_13 false _let_14)) _let_19 :args (false true _let_17 false _let_11)) :args (_let_11 _let_10 _let_9 _let_8 _let_7 _let_6 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk2 A B C))) (or (tptp.incident_c _let_1 C) (tptp.incident_c _let_1 B) (tptp.incident_c _let_1 A) (= C (tptp.sum B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.incident_c (tptp.ax0_sk2 A B C) C))) (or _let_1 (not _let_1) (= C (tptp.sum B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk2 A B C))) (let ((_let_2 (tptp.incident_c _let_1 B))) (or (not _let_2) _let_2 (tptp.incident_c _let_1 A) (= C (tptp.sum B A)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk2 A B C))) (let ((_let_2 (tptp.incident_c _let_1 A))) (or (not _let_2) (tptp.incident_c _let_1 B) _let_2 (= C (tptp.sum B A)))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk2 A B C))) (or (not (tptp.incident_c _let_1 B)) (not (tptp.incident_c _let_1 C)) (= C (tptp.sum B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk2 A B C))) (or (not (tptp.incident_c _let_1 A)) (not (tptp.incident_c _let_1 C)) (= C (tptp.sum B A))))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.incident_c A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.incident_c A C)) (not (tptp.incident_c A D)) (tptp.part_of C D) (tptp.part_of D C))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk3 B A) B) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.part_of (tptp.ax0_sk4 B A) B) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk3 B A)) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.incident_c A (tptp.ax0_sk4 B A)) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk3 B A) (tptp.ax0_sk4 B A))) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.part_of (tptp.ax0_sk4 B A) (tptp.ax0_sk3 B A))) (tptp.end_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (tptp.incident_c A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (not (tptp.end_point A B)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A B)) (tptp.end_point A B) (tptp.inner_point A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (tptp.incident_c A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (tptp.incident_c A C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.meet A B C)) (not (tptp.incident_c D B)) (not (tptp.incident_c D C)) (tptp.end_point D B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.meet A B C)) (not (tptp.incident_c D B)) (not (tptp.incident_c D C)) (tptp.end_point D C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (tptp.incident_c (tptp.ax0_sk5 C B A) B) (tptp.meet A B C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (tptp.incident_c (tptp.ax0_sk5 C B A) C) (tptp.meet A B C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (let ((_let_1 (tptp.ax0_sk5 C B A))) (or (not (tptp.incident_c A B)) (not (tptp.incident_c A C)) (not (tptp.end_point _let_1 B)) (not (tptp.end_point _let_1 C)) (tptp.meet A B C)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.closed A)) (not (tptp.end_point B A)))) (forall ((A $$unsorted)) (or (tptp.end_point (tptp.ax0_sk6 A) A) (tptp.closed A))) (forall ((A $$unsorted)) (or (not (tptp.open A)) (tptp.end_point (tptp.ax0_sk7 A) A))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.open B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.part_of A B)) (= A B) (tptp.open A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.part_of A B)) (not (tptp.part_of C B)) (not (tptp.part_of D B)) (not (tptp.end_point E A)) (not (tptp.end_point E C)) (not (tptp.end_point E D)) (tptp.part_of C D) (tptp.part_of D C) (tptp.part_of A C) (tptp.part_of C A) (tptp.part_of A D) (tptp.part_of D A))) (forall ((A $$unsorted)) (tptp.inner_point (tptp.ax0_sk8 A) A)) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (tptp.meet A (tptp.ax0_sk9 A B) (tptp.ax0_sk10 A B)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.inner_point A B)) (= B (tptp.sum (tptp.ax0_sk9 A B) (tptp.ax0_sk10 A B))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.end_point A B)) (not (tptp.end_point C B)) (not (tptp.end_point D B)) (= A C) (= A D) (= C D))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (tptp.end_point (tptp.ax0_sk11 A B) B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.end_point A B)) (not (= A (tptp.ax0_sk11 A B))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.closed A)) (not (tptp.meet B C D)) (not (= A (tptp.sum C D))) (not (tptp.end_point E C)) (tptp.meet E C D))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.meet A B C)) (= (tptp.ax0_sk12 C B) (tptp.sum B C)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax0_sk13 A B))) (or (tptp.incident_c _let_1 B) (tptp.incident_c _let_1 A) (= B A)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.incident_c (tptp.ax0_sk13 A B) B))) (or _let_1 (not _let_1) (= B A)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.incident_c (tptp.ax0_sk13 A B) A))) (or (not _let_1) _let_1 (= B A)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax0_sk13 A B))) (or (not (tptp.incident_c _let_1 A)) (not (tptp.incident_c _let_1 B)) (= B A)))) _let_5 (tptp.meet tptp.sk17 tptp.sk14 tptp.sk15) (tptp.meet tptp.sk17 tptp.sk14 tptp.sk16) _let_4)))))))))))))))))))))))))))))))))))))))))))))))
% 0.20/0.56  )
% 0.20/0.57  % SZS output end Proof for GEO083-1
% 0.20/0.57  % cvc5---1.0.5 exiting
% 0.20/0.57  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------