TSTP Solution File: GEO118-1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : GEO118-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n008.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:48 EDT 2023
% Result : Unsatisfiable 0.21s 0.72s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO118-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.16/0.35 % Computer : n008.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Tue Aug 29 19:31:17 EDT 2023
% 0.16/0.35 % CPUTime :
% 0.21/0.49 %----Proving TF0_NAR, FOF, or CNF
% 0.21/0.50 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.bPmL3xEuFr/cvc5---1.0.5_31428.p...
% 0.21/0.51 ------- get file name : TPTP file name is GEO118-1
% 0.21/0.52 ------- cvc5-fof : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_31428.smt2...
% 0.21/0.52 --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.21/0.72 % SZS status Unsatisfiable for GEO118-1
% 0.21/0.72 % SZS output start Proof for GEO118-1
% 0.21/0.72 (
% 0.21/0.72 (let ((_let_1 (tptp.ordered_by tptp.sk25 tptp.sk27 tptp.sk26))) (let ((_let_2 (tptp.ordered_by tptp.sk25 tptp.sk26 tptp.sk27))) (let ((_let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_o A B C D)) (tptp.between_c (tptp.ax2_sk4 A D C B) B C D))))) (let ((_let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ordered_by A B C)) (not (tptp.ordered_by A C D)) (tptp.between_o A B C D))))) (let ((_let_5 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_c A B C D)) (not (= B D)))))) (let ((_let_6 (forall ((A $$unsorted) (C $$unsorted) (D $$unsorted)) (not (tptp.between_c A D C D))))) (let ((_let_7 (tptp.ax2_sk4 tptp.sk25 tptp.sk27 tptp.sk26 tptp.sk27))) (let ((_let_8 (tptp.between_c _let_7 tptp.sk27 tptp.sk26 tptp.sk27))) (let ((_let_9 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_10 (tptp.between_o tptp.sk25 tptp.sk27 tptp.sk26 tptp.sk27))) (let ((_let_11 (not _let_10))) (let ((_let_12 (or _let_11 _let_8))) (let ((_let_13 (_let_3))) (let ((_let_14 (ASSUME :args _let_13))) (let ((_let_15 (not _let_2))) (let ((_let_16 (not _let_1))) (let ((_let_17 (or _let_16 _let_15 _let_10))) (let ((_let_18 (_let_4))) (let ((_let_19 (ASSUME :args _let_18))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_9 :args (_let_7 tptp.sk26 tptp.sk27 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.between_c A D C D) false))))) :args (_let_6))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_12)) :args ((or _let_11 _let_8 (not _let_12)))) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_17)) :args ((or _let_15 _let_16 _let_10 (not _let_17)))) (ASSUME :args (_let_2)) (ASSUME :args (_let_1)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_19 :args (tptp.sk25 tptp.sk27 tptp.sk26 tptp.sk27 QUANTIFIERS_INST_E_MATCHING ((not (= (tptp.ordered_by A B C) false)) (not (= (tptp.ordered_by A C D) false))))) :args _let_18)) _let_19 :args (_let_17 false _let_4)) :args (_let_10 false _let_2 false _let_1 false _let_17)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_14 :args (tptp.sk25 tptp.sk27 tptp.sk26 tptp.sk27 QUANTIFIERS_INST_E_MATCHING_SIMPLE ((not (= (tptp.between_o A B C D) false))))) :args _let_13)) _let_14 :args (_let_12 false _let_3)) :args (_let_8 false _let_10 false _let_12)) _let_9 :args (false false _let_8 false _let_6)) :args ((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))) (forall ((A $$unsorted) (B $$unsorted)) (or (tptp.incident_c (tptp.ax0_sk1 A B) A) (tptp.part_of A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c (tptp.ax0_sk1 A B) B)) (tptp.part_of A B))) (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))) (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))) (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))) (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 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_c A B C D)) (tptp.part_of (tptp.ax1_sk1 D C B A) A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_c A B C D)) (tptp.end_point B (tptp.ax1_sk1 D C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_c A B C D)) (tptp.end_point D (tptp.ax1_sk1 D C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_c A B C D)) (tptp.inner_point C (tptp.ax1_sk1 D C B A)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (= A B) (not (tptp.part_of C D)) (not (tptp.end_point A C)) (not (tptp.end_point B C)) (not (tptp.inner_point E C)) (tptp.between_c D A E B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_o A B C D)) (tptp.ordered_by A B C) (tptp.ordered_by A D C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_o A B C D)) (tptp.ordered_by A B C) (tptp.ordered_by A C B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_o A B C D)) (tptp.ordered_by A C D) (tptp.ordered_by A D C))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.between_o A B C D)) (tptp.ordered_by A C D) (tptp.ordered_by A C B))) _let_4 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.ordered_by A B C)) (not (tptp.ordered_by A C D)) (tptp.between_o A D C B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.start_point A B)) (tptp.incident_o A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.start_point A B)) (= A C) (not (tptp.incident_o C B)) (tptp.ordered_by B A C))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (not (= A (tptp.ax2_sk1 B A))) (tptp.start_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (tptp.incident_o (tptp.ax2_sk1 B A) B) (tptp.start_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (not (tptp.ordered_by B A (tptp.ax2_sk1 B A))) (tptp.start_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.finish_point A B)) (tptp.incident_o A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.finish_point A B)) (= A C) (not (tptp.incident_o C B)) (tptp.ordered_by B C A))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (not (= A (tptp.ax2_sk2 B A))) (tptp.finish_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (tptp.incident_o (tptp.ax2_sk2 B A) B) (tptp.finish_point A B))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (not (tptp.ordered_by B (tptp.ax2_sk2 B A) A)) (tptp.finish_point A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ordered_by A B C)) (tptp.incident_o B A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.ordered_by A B C)) (tptp.incident_o C A))) (forall ((A $$unsorted)) (tptp.open (tptp.ax2_sk3 A))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_o A B)) (tptp.incident_c A (tptp.ax2_sk3 B)))) (forall ((A $$unsorted) (B $$unsorted)) (or (not (tptp.incident_c A (tptp.ax2_sk3 B))) (tptp.incident_o A B))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.between_o A B C D)) (not (tptp.incident_o E A)) (tptp.incident_c E (tptp.ax2_sk4 A D C B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (or (not (tptp.between_o A B C D)) (not (tptp.incident_c E (tptp.ax2_sk4 A D C B))) (tptp.incident_o E A))) _let_3 (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.ax2_sk5 A B C D E))) (or (tptp.incident_o _let_1 B) (tptp.incident_c _let_1 A) (not (tptp.between_c A E D C)) (tptp.between_o B E D C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.incident_o (tptp.ax2_sk5 A B C D E) B))) (or _let_1 (not _let_1) (not (tptp.between_c A E D C)) (tptp.between_o B E D C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.incident_c (tptp.ax2_sk5 A B C D E) A))) (or (not _let_1) _let_1 (not (tptp.between_c A E D C)) (tptp.between_o B E D C)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted) (E $$unsorted)) (let ((_let_1 (tptp.ax2_sk5 A B C D E))) (or (not (tptp.incident_c _let_1 A)) (not (tptp.incident_o _let_1 B)) (not (tptp.between_c A E D C)) (tptp.between_o B E D C)))) (forall ((A $$unsorted)) (tptp.start_point (tptp.ax2_sk6 A) A)) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.open A)) (= B C) (not (tptp.incident_c B A)) (not (tptp.incident_c C A)) (not (tptp.incident_o D (tptp.ax2_sk7 A C B))) (tptp.incident_c D A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted) (D $$unsorted)) (or (not (tptp.open A)) (= B C) (not (tptp.incident_c B A)) (not (tptp.incident_c C A)) (not (tptp.incident_c D A)) (tptp.incident_o D (tptp.ax2_sk7 A C B)))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (tptp.open A)) (= B C) (not (tptp.incident_c B A)) (not (tptp.incident_c C A)) (tptp.ordered_by (tptp.ax2_sk7 A C B) B C))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax2_sk9 B A))) (let ((_let_2 (tptp.ax2_sk8 B A))) (or (tptp.ordered_by A _let_2 _let_1) (tptp.ordered_by B _let_2 _let_1) (= A B))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ordered_by A (tptp.ax2_sk8 B A) (tptp.ax2_sk9 B A)))) (or _let_1 (not _let_1) (= A B)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ordered_by A (tptp.ax2_sk8 A B) (tptp.ax2_sk9 A B)))) (or (not _let_1) _let_1 (= B A)))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax2_sk9 A B))) (let ((_let_2 (tptp.ax2_sk8 A B))) (or (not (tptp.ordered_by A _let_2 _let_1)) (not (tptp.ordered_by B _let_2 _let_1)) (= B A))))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (= A (tptp.underlying_curve B))) (not (tptp.incident_o C B)) (tptp.incident_c C A))) (forall ((A $$unsorted) (B $$unsorted) (C $$unsorted)) (or (not (= A (tptp.underlying_curve B))) (not (tptp.incident_c C A)) (tptp.incident_o C B))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax2_sk10 A B))) (or (tptp.incident_o _let_1 A) (tptp.incident_c _let_1 B) (= B (tptp.underlying_curve A))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.incident_o (tptp.ax2_sk10 A B) A))) (or _let_1 (not _let_1) (= B (tptp.underlying_curve A))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.incident_c (tptp.ax2_sk10 A B) B))) (or (not _let_1) _let_1 (= B (tptp.underlying_curve A))))) (forall ((A $$unsorted) (B $$unsorted)) (let ((_let_1 (tptp.ax2_sk10 A B))) (or (not (tptp.incident_c _let_1 B)) (not (tptp.incident_o _let_1 A)) (= B (tptp.underlying_curve A))))) _let_2 _let_1))))))))))))))))))))))
% 0.21/0.73 )
% 0.21/0.73 % SZS output end Proof for GEO118-1
% 0.21/0.73 % cvc5---1.0.5 exiting
% 0.21/0.73 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------