TSTP Solution File: GEO124-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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 : 600s
% DateTime : Sat Jul 16 05:54:11 EDT 2022
% Result : Unsatisfiable 1.35s 1.65s
% Output : Refutation 1.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 02:03:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 4260 was started by sandbox on n024.cluster.edu,
% 0.43/1.01 Sat Jun 18 02:03:03 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_3913_n024.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_3913_n024.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (99 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 1 -open(A) | end_point(ax0_sk7(A),A) # label(open_defn_33) # label(axiom). [assumption].
% 0.43/1.01 2 open(ax2_sk3(A)) # label(o2_19) # label(axiom). [assumption].
% 0.43/1.01 3 -end_point(A,B) | open(B) # label(open_defn_34) # label(axiom). [assumption].
% 0.43/1.01 Derived: end_point(ax0_sk7(ax2_sk3(A)),ax2_sk3(A)). [resolve(1,a,2,a)].
% 0.43/1.01 Derived: end_point(ax0_sk7(A),A) | -end_point(B,A). [resolve(1,a,3,b)].
% 0.43/1.01 4 -part_of(A,B) | A = B | open(A) # label(c1_35) # label(axiom). [assumption].
% 0.43/1.01 Derived: -part_of(A,B) | A = B | end_point(ax0_sk7(A),A). [resolve(4,c,1,a)].
% 0.43/1.01 5 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | ordered_by(ax2_sk7(A,C,B),B,C) # label(o5_32) # label(axiom). [assumption].
% 0.43/1.01 Derived: A = B | -incident_c(A,ax2_sk3(C)) | -incident_c(B,ax2_sk3(C)) | ordered_by(ax2_sk7(ax2_sk3(C),B,A),A,B). [resolve(5,a,2,a)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | ordered_by(ax2_sk7(C,B,A),A,B) | -end_point(D,C). [resolve(5,a,3,b)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | ordered_by(ax2_sk7(C,B,A),A,B) | -part_of(C,D) | C = D. [resolve(5,a,4,c)].
% 0.43/1.01 6 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | -incident_o(D,ax2_sk7(A,C,B)) | incident_c(D,A) # label(o5_30) # label(axiom). [assumption].
% 0.43/1.01 Derived: A = B | -incident_c(A,ax2_sk3(C)) | -incident_c(B,ax2_sk3(C)) | -incident_o(D,ax2_sk7(ax2_sk3(C),B,A)) | incident_c(D,ax2_sk3(C)). [resolve(6,a,2,a)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_o(D,ax2_sk7(C,B,A)) | incident_c(D,C) | -end_point(E,C). [resolve(6,a,3,b)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_o(D,ax2_sk7(C,B,A)) | incident_c(D,C) | -part_of(C,E) | C = E. [resolve(6,a,4,c)].
% 0.43/1.01 7 -open(A) | B = C | -incident_c(B,A) | -incident_c(C,A) | -incident_c(D,A) | incident_o(D,ax2_sk7(A,C,B)) # label(o5_31) # label(axiom). [assumption].
% 0.43/1.01 Derived: A = B | -incident_c(A,ax2_sk3(C)) | -incident_c(B,ax2_sk3(C)) | -incident_c(D,ax2_sk3(C)) | incident_o(D,ax2_sk7(ax2_sk3(C),B,A)). [resolve(7,a,2,a)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_c(D,C) | incident_o(D,ax2_sk7(C,B,A)) | -end_point(E,C). [resolve(7,a,3,b)].
% 0.43/1.01 Derived: A = B | -incident_c(A,C) | -incident_c(B,C) | -incident_c(D,C) | incident_o(D,ax2_sk7(C,B,A)) | -part_of(C,E) | C = E. [resolve(7,a,4,c)].
% 0.43/1.01 8 -start_point(A,B) | incident_o(A,B) # label(start_point_defn_7) # label(axiom). [assumption].
% 0.43/1.01 9 start_point(sk26,sk25) # label(corollary_4_10_1_133) # label(negated_conjecture). [assumption].
% 0.43/1.01 10 start_point(sk27,sk25) # label(corollary_4_10_1_134) # label(negated_conjecture). [assumption].
% 0.43/1.01 11 start_point(ax2_sk6(A),A) # label(o4_29) # label(axiom). [assumption].
% 0.43/1.01 Derived: incident_o(sk26,sk25). [resolve(8,a,9,a)].
% 0.43/1.01 Derived: incident_o(sk27,sk25). [resolve(8,a,10,a)].
% 0.43/1.01 Derived: incident_o(ax2_sk6(A),A). [resolve(8,a,11,a)].
% 0.43/1.01 12 -incident_o(A,B) | A != ax2_sk1(B,A) | start_point(A,B) # label(start_point_defn_9) # label(axiom). [assumption].
% 0.43/1.01 13 -incident_o(A,B) | incident_o(ax2_sk1(B,A),B) | start_point(A,B) # label(start_point_defn_10) # label(axiom). [assumption].
% 0.43/1.01 14 -incident_o(A,B) | -ordered_by(B,A,ax2_sk1(B,A)) | start_point(A,B) # label(start_point_defn_11) # label(axiom). [assumption].
% 0.43/1.01 15 -start_point(A,B) | A = C | -incident_o(C,B) | ordered_by(B,A,C) # label(start_point_defn_8) # label(axiom). [assumption].
% 0.43/1.01 Derived: sk26 = A | -incident_o(A,sk25) | ordered_by(sk25,sk26,A). [resolve(15,a,9,a)].
% 0.43/1.01 Derived: sk27 = A | -incident_o(A,sk25) | ordered_by(sk25,sk27,A). [resolve(15,a,10,a)].
% 0.43/1.01 Derived: ax2_sk6(A) = B | -incident_o(B,A) | ordered_by(A,ax2_sk6(A),B). [resolve(15,a,11,a)].
% 0.43/1.01 Derived: A = B | -incident_o(B,C) | ordered_by(C,A,B) | -incident_o(A,C) | A != ax2_sk1(C,A). [resolve(15,a,12,c)].
% 0.43/1.01 Derived: A = B | -incident_o(B,C) | ordered_by(C,A,B) | -incident_o(A,C) | incident_o(ax2_sk1(C,A),C). [resolve(15,a,13,c)].
% 0.43/1.01 Derived: A = B | -incident_o(B,C) | ordered_by(C,A,B) | -incident_o(A,C) | -ordered_by(C,A,ax2_sk1(C,A)). [resolve(15,a,14,c)].
% 0.43/1.01 16 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom). [assumption].
% 0.43/1.01 17 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom). [assumption].
% 0.43/1.01 Derived: -end_point(ax0_sk8(A),A). [resolve(16,a,17,a)].
% 0.43/1.01 18 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom). [assumption].
% 0.43/1.01 Derived: incident_c(ax0_sk8(A),A). [resolve(18,a,17,a)].
% 0.43/1.01 19 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom). [assumption].
% 0.43/1.01 20 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom). [assumption].
% 0.43/1.01 Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(20,a,17,a)].
% 0.43/1.01 Derived: meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) | -incident_c(A,B) | end_point(A,B). [resolve(20,a,19,c)].
% 0.43/1.01 21 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom). [assumption].
% 0.43/1.01 Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(21,a,17,a)].
% 0.43/1.01 Derived: A = sum(ax0_sk9(B,A),ax0_sk10(B,A)) | -incident_c(B,A) | end_point(B,A). [resolve(21,a,19,c)].
% 0.43/1.01 22 -between_c(A,B,C,D) | inner_point(C,ax1_sk1(D,C,B,A)) # label(between_c_defn_5) # label(axiom). [assumption].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | -end_point(C,ax1_sk1(D,C,B,A)). [resolve(22,b,16,a)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | incident_c(C,ax1_sk1(D,C,B,A)). [resolve(22,b,18,a)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | meet(C,ax0_sk9(C,ax1_sk1(D,C,B,A)),ax0_sk10(C,ax1_sk1(D,C,B,A))). [resolve(22,b,20,a)].
% 0.43/1.01 Derived: -between_c(A,B,C,D) | ax1_sk1(D,C,B,A) = sum(ax0_sk9(C,ax1_sk1(D,C,B,A)),ax0_sk10(C,ax1_sk1(D,C,B,A))). [resolve(22,b,21,a)].
% 0.43/1.01 23 A = B | -part_of(C,D) | -end_point(A,C) | -end_point(B,C) | -inner_point(E,C) | between_c(D,A,E,B) # label(between_c_defn_6) # label(axiom). [assumption].
% 0.43/1.01 Derived: A = B | -part_of(C,D) | -end_point(A,C) | -end_point(B,C) | between_c(D,A,ax0_sk8(C),B). [resolve(23,e,17,a)].
% 0.74/1.02 Derived: A = B | -part_of(C,D) | -end_point(A,C) | -end_point(B,C) | between_c(D,A,E,B) | -incident_c(E,C) | end_point(E,C). [resolve(23,e,19,c)].
% 0.74/1.02 Derived: A = B | -part_of(ax1_sk1(C,D,E,F),V6) | -end_point(A,ax1_sk1(C,D,E,F)) | -end_point(B,ax1_sk1(C,D,E,F)) | between_c(V6,A,D,B) | -between_c(F,E,D,C). [resolve(23,e,22,b)].
% 0.74/1.02 24 -closed(A) | -end_point(B,A) # label(closed_defn_31) # label(axiom). [assumption].
% 0.74/1.02 25 end_point(ax0_sk6(A),A) | closed(A) # label(closed_defn_32) # label(axiom). [assumption].
% 0.74/1.02 Derived: -end_point(A,B) | end_point(ax0_sk6(B),B). [resolve(24,a,25,b)].
% 0.74/1.02 26 -closed(A) | -meet(B,C,D) | A != sum(C,D) | -end_point(E,C) | meet(E,C,D) # label(c7_43) # label(axiom). [assumption].
% 0.74/1.02 Derived: -meet(A,B,C) | D != sum(B,C) | -end_point(E,B) | meet(E,B,C) | end_point(ax0_sk6(D),D). [resolve(26,a,25,b)].
% 0.74/1.02 27 -incident_o(A,B) | A != ax2_sk2(B,A) | finish_point(A,B) # label(finish_point_defn_14) # label(axiom). [assumption].
% 0.74/1.02 28 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn_12) # label(axiom). [assumption].
% 0.74/1.02 29 -incident_o(A,B) | incident_o(ax2_sk2(B,A),B) | finish_point(A,B) # label(finish_point_defn_15) # label(axiom). [assumption].
% 0.74/1.02 30 -incident_o(A,B) | -ordered_by(B,ax2_sk2(B,A),A) | finish_point(A,B) # label(finish_point_defn_16) # label(axiom). [assumption].
% 0.74/1.02 31 -finish_point(A,B) | A = C | -incident_o(C,B) | ordered_by(B,C,A) # label(finish_point_defn_13) # label(axiom). [assumption].
% 0.74/1.02 Derived: A = B | -incident_o(B,C) | ordered_by(C,B,A) | -incident_o(A,C) | A != ax2_sk2(C,A). [resolve(31,a,27,c)].
% 0.74/1.02 Derived: A = B | -incident_o(B,C) | ordered_by(C,B,A) | -incident_o(A,C) | incident_o(ax2_sk2(C,A),C). [resolve(31,a,29,c)].
% 0.74/1.02 Derived: A = B | -incident_o(B,C) | ordered_by(C,B,A) | -incident_o(A,C) | -ordered_by(C,ax2_sk2(C,A),A). [resolve(31,a,30,c)].
% 0.74/1.02 32 -ordered_by(A,B,C) | -ordered_by(A,C,D) | between_o(A,B,C,D) # label(between_o_defn_5) # label(axiom). [assumption].
% 0.74/1.02 33 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,D,C) # label(between_o_defn_1) # label(axiom). [assumption].
% 0.74/1.02 34 -between_o(A,B,C,D) | ordered_by(A,B,C) | ordered_by(A,C,B) # label(between_o_defn_2) # label(axiom). [assumption].
% 0.74/1.02 35 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,D,C) # label(between_o_defn_3) # label(axiom). [assumption].
% 0.74/1.02 36 -between_o(A,B,C,D) | ordered_by(A,C,D) | ordered_by(A,C,B) # label(between_o_defn_4) # label(axiom). [assumption].
% 0.74/1.02 37 -ordered_by(A,B,C) | -ordered_by(A,C,D) | between_o(A,D,C,B) # label(between_o_defn_6) # label(axiom). [assumption].
% 0.74/1.02 38 -between_o(A,B,C,D) | between_c(ax2_sk4(A,D,C,B),B,C,D) # label(o3_24) # label(axiom). [assumption].
% 0.74/1.02 Derived: between_c(ax2_sk4(A,B,C,D),D,C,B) | -ordered_by(A,D,C) | -ordered_by(A,C,B). [resolve(38,a,32,c)].
% 0.74/1.02 Derived: between_c(ax2_sk4(A,B,C,D),D,C,B) | -ordered_by(A,B,C) | -ordered_by(A,C,D). [resolve(38,a,37,c)].
% 0.74/1.02 39 -between_o(A,B,C,D) | -incident_o(E,A) | incident_c(E,ax2_sk4(A,D,C,B)) # label(o3_22) # label(axiom). [assumption].
% 0.74/1.02 Derived: -incident_o(A,B) | incident_c(A,ax2_sk4(B,C,D,E)) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(39,a,32,c)].
% 0.74/1.02 Derived: -incident_o(A,B) | incident_c(A,ax2_sk4(B,C,D,E)) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(39,a,37,c)].
% 0.74/1.02 40 -between_o(A,B,C,D) | -incident_c(E,ax2_sk4(A,D,C,B)) | incident_o(E,A) # label(o3_23) # label(axiom). [assumption].
% 0.74/1.02 Derived: -incident_c(A,ax2_sk4(B,C,D,E)) | incident_o(A,B) | -ordered_by(B,E,D) | -ordered_by(B,D,C). [resolve(40,a,32,c)].
% 0.74/1.02 Derived: -incident_c(A,ax2_sk4(B,C,D,E)) | incident_o(A,B) | -ordered_by(B,C,D) | -ordered_by(B,D,E). [resolve(40,a,37,c)].
% 0.74/1.02 41 incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | between_o(B,E,D,C) # label(o3_25) # label(axiom). [assumption].
% 0.74/1.02 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | ordered_by(B,E,D) | ordered_by(B,C,D). [resolve(41,d,33,a)].
% 0.74/1.02 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | ordered_by(B,E,D) | ordered_by(B,D,E). [resolve(41,d,34,a)].
% 1.35/1.65 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | ordered_by(B,D,C) | ordered_by(B,C,D). [resolve(41,d,35,a)].
% 1.35/1.65 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | ordered_by(B,D,C) | ordered_by(B,D,E). [resolve(41,d,36,a)].
% 1.35/1.65 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | between_c(ax2_sk4(B,C,D,E),E,D,C). [resolve(41,d,38,a)].
% 1.35/1.65 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | -incident_o(F,B) | incident_c(F,ax2_sk4(B,C,D,E)). [resolve(41,d,39,a)].
% 1.35/1.65 Derived: incident_o(ax2_sk5(A,B,C,D,E),B) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | -incident_c(F,ax2_sk4(B,C,D,E)) | incident_o(F,B). [resolve(41,d,40,a)].
% 1.35/1.65 42 incident_o(ax2_sk5(A,B,C,D,E),B) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | between_o(B,E,D,C) # label(o3_26) # label(axiom). [assumption].
% 1.35/1.65 43 -incident_c(ax2_sk5(A,B,C,D,E),A) | incident_c(ax2_sk5(A,B,C,D,E),A) | -between_c(A,E,D,C) | between_o(B,E,D,C) # label(o3_27) # label(axiom). [assumption].
% 1.35/1.65 44 -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | between_o(B,E,D,C) # label(o3_28) # label(axiom). [assumption].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | ordered_by(B,E,D) | ordered_by(B,C,D). [resolve(44,d,33,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | ordered_by(B,E,D) | ordered_by(B,D,E). [resolve(44,d,34,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | ordered_by(B,D,C) | ordered_by(B,C,D). [resolve(44,d,35,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | ordered_by(B,D,C) | ordered_by(B,D,E). [resolve(44,d,36,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | between_c(ax2_sk4(B,C,D,E),E,D,C). [resolve(44,d,38,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | -incident_o(F,B) | incident_c(F,ax2_sk4(B,C,D,E)). [resolve(44,d,39,a)].
% 1.35/1.65 Derived: -incident_c(ax2_sk5(A,B,C,D,E),A) | -incident_o(ax2_sk5(A,B,C,D,E),B) | -between_c(A,E,D,C) | -incident_c(F,ax2_sk4(B,C,D,E)) | incident_o(F,B). [resolve(44,d,40,a)].
% 1.35/1.65
% 1.35/1.65 ============================== end predicate elimination =============
% 1.35/1.65
% 1.35/1.65 Auto_denials: (non-Horn, no changes).
% 1.35/1.65
% 1.35/1.65 Term ordering decisions:
% 1.35/1.65 Function symbol KB weights: sk25=1. sk26=1. sk27=1. sum=1. ax0_sk13=1. ax2_sk10=1. ax2_sk8=1. ax2_sk9=1. ax0_sk10=1. ax0_sk9=1. ax0_sk3=1. ax0_sk4=1. ax2_sk1=1. ax2_sk2=1. ax0_sk1=1. ax0_sk11=1. ax0_sk12=1. ax2_sk3=1. ax0_sk8=1. underlying_curve=1. ax0_sk7=1. ax2_sk6=1. ax0_sk6=1. ax0_sk2=1. ax2_sk7=1. ax0_sk5=1. ax1_sk1=1. ax2_sk4=1. ax2_sk5=1.
% 1.35/1.65
% 1.35/1.65 ============================== end of process initial clauses ========
% 1.35/1.65
% 1.35/1.65 ============================== CLAUSES FOR SEARCH ====================
% 1.35/1.65
% 1.35/1.65 ============================== end of clauses for search =============
% 1.35/1.65
% 1.35/1.65 ============================== SEARCH ================================
% 1.35/1.65
% 1.35/1.65 % Starting search at 0.04 seconds.
% 1.35/1.65
% 1.35/1.65 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 31 (0.00 of 0.48 sec).
% 1.35/1.65
% 1.35/1.65 Low Water (keep): wt=38.000, iters=3382
% 1.35/1.65
% 1.35/1.65 Low Water (keep): wt=31.000, iters=3333
% 1.35/1.65
% 1.35/1.65 ============================== PROOF =================================
% 1.35/1.65 % SZS status Unsatisfiable
% 1.35/1.65 % SZS output start Refutation
% 1.35/1.65
% 1.35/1.65 % Proof 1 at 0.64 (+ 0.01) seconds.
% 1.35/1.65 % Length of proof is 19.
% 1.35/1.65 % Level of proof is 5.
% 1.35/1.65 % Maximum clause weight is 17.000.
% 1.35/1.65 % Given clauses 726.
% 1.35/1.65
% 1.35/1.65 8 -start_point(A,B) | incident_o(A,B) # label(start_point_defn_7) # label(axiom). [assumption].
% 1.35/1.65 9 start_point(sk26,sk25) # label(corollary_4_10_1_133) # label(negated_conjecture). [assumption].
% 1.35/1.65 10 start_point(sk27,sk25) # label(corollary_4_10_1_134) # label(negated_conjecture). [assumption].
% 1.35/1.65 15 -start_point(A,B) | A = C | -incident_o(C,B) | ordered_by(B,A,C) # label(start_point_defn_8) # label(axiom). [assumption].
% 1.35/1.65 37 -ordered_by(A,B,C) | -ordered_by(A,C,D) | between_o(A,D,C,B) # label(between_o_defn_6) # label(axiom). [assumption].
% 1.35/1.65 38 -between_o(A,B,C,D) | between_c(ax2_sk4(A,D,C,B),B,C,D) # label(o3_24) # label(axiom). [assumption].
% 1.35/1.65 52 sk26 != sk27 # label(corollary_4_10_1_135) # label(negated_conjecture). [assumption].
% 1.35/1.65 53 sk27 != sk26. [copy(52),flip(a)].
% 1.35/1.65 56 -between_c(A,B,C,D) | B != D # label(between_c_defn_1) # label(axiom). [assumption].
% 1.35/1.65 120 incident_o(sk26,sk25). [resolve(8,a,9,a)].
% 1.35/1.65 121 incident_o(sk27,sk25). [resolve(8,a,10,a)].
% 1.35/1.65 123 sk26 = A | -incident_o(A,sk25) | ordered_by(sk25,sk26,A). [resolve(15,a,9,a)].
% 1.35/1.65 124 sk27 = A | -incident_o(A,sk25) | ordered_by(sk25,sk27,A). [resolve(15,a,10,a)].
% 1.35/1.65 154 between_c(ax2_sk4(A,B,C,D),D,C,B) | -ordered_by(A,B,C) | -ordered_by(A,C,D). [resolve(38,a,37,c)].
% 1.35/1.65 484 ordered_by(sk25,sk26,sk27). [resolve(123,b,121,a),flip(a),unit_del(a,53)].
% 1.35/1.65 487 ordered_by(sk25,sk27,sk26). [resolve(124,b,120,a),unit_del(a,53)].
% 1.35/1.65 777 between_c(ax2_sk4(sk25,A,sk26,sk27),sk27,sk26,A) | -ordered_by(sk25,A,sk26). [resolve(484,a,154,c)].
% 1.35/1.65 6556 between_c(ax2_sk4(sk25,sk27,sk26,sk27),sk27,sk26,sk27). [resolve(777,b,487,a)].
% 1.35/1.65 6576 $F. [resolve(6556,a,56,a),xx(a)].
% 1.35/1.65
% 1.35/1.65 % SZS output end Refutation
% 1.35/1.65 ============================== end of proof ==========================
% 1.35/1.65
% 1.35/1.65 ============================== STATISTICS ============================
% 1.35/1.65
% 1.35/1.65 Given=726. Generated=12969. Kept=6508. proofs=1.
% 1.35/1.65 Usable=536. Sos=4113. Demods=5. Limbo=19, Disabled=1998. Hints=0.
% 1.35/1.65 Megabytes=8.01.
% 1.35/1.65 User_CPU=0.64, System_CPU=0.01, Wall_clock=1.
% 1.35/1.65
% 1.35/1.65 ============================== end of statistics =====================
% 1.35/1.65
% 1.35/1.65 ============================== end of search =========================
% 1.35/1.65
% 1.35/1.65 THEOREM PROVED
% 1.35/1.65 % SZS status Unsatisfiable
% 1.35/1.65
% 1.35/1.65 Exiting with 1 proof.
% 1.35/1.65
% 1.35/1.65 Process 4260 exit (max_proofs) Sat Jun 18 02:03:04 2022
% 1.35/1.65 Prover9 interrupted
%------------------------------------------------------------------------------