TSTP Solution File: GEO147-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : GEO147-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% 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 : 600s
% DateTime : Sat Jul 16 05:54:22 EDT 2022
% Result : Unsatisfiable 0.74s 1.11s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO147-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n027.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 : Fri Jun 17 20:44:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 18120 was started by sandbox2 on n027.cluster.edu,
% 0.74/1.00 Fri Jun 17 20:44:52 2022
% 0.74/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17966_n027.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_17966_n027.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (112 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 1 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn_23) # label(axiom). [assumption].
% 0.74/1.00 2 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn_21) # label(axiom). [assumption].
% 0.74/1.00 3 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn_22) # label(axiom). [assumption].
% 0.74/1.00 4 inner_point(ax0_sk8(A),A) # label(c3_37) # label(axiom). [assumption].
% 0.74/1.00 Derived: incident_c(ax0_sk8(A),A). [resolve(4,a,2,a)].
% 0.74/1.00 Derived: -end_point(ax0_sk8(A),A). [resolve(4,a,3,a)].
% 0.74/1.00 5 -inner_point(A,B) | meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_38) # label(axiom). [assumption].
% 0.74/1.00 Derived: meet(A,ax0_sk9(A,B),ax0_sk10(A,B)) | -incident_c(A,B) | end_point(A,B). [resolve(5,a,1,c)].
% 0.74/1.00 Derived: meet(ax0_sk8(A),ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(5,a,4,a)].
% 0.74/1.00 6 -inner_point(A,B) | B = sum(ax0_sk9(A,B),ax0_sk10(A,B)) # label(c4_39) # label(axiom). [assumption].
% 0.74/1.00 Derived: A = sum(ax0_sk9(B,A),ax0_sk10(B,A)) | -incident_c(B,A) | end_point(B,A). [resolve(6,a,1,c)].
% 0.74/1.00 Derived: A = sum(ax0_sk9(ax0_sk8(A),A),ax0_sk10(ax0_sk8(A),A)). [resolve(6,a,4,a)].
% 0.74/1.00 7 -between_c(A,B,C,D) | inner_point(C,ax1_sk1(D,C,B,A)) # label(between_c_defn_5) # label(axiom). [assumption].
% 0.74/1.00 Derived: -between_c(A,B,C,D) | incident_c(C,ax1_sk1(D,C,B,A)). [resolve(7,b,2,a)].
% 0.74/1.00 Derived: -between_c(A,B,C,D) | -end_point(C,ax1_sk1(D,C,B,A)). [resolve(7,b,3,a)].
% 0.74/1.00 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(7,b,5,a)].
% 0.74/1.00 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(7,b,6,a)].
% 0.74/1.00 8 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.74/1.01 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(8,e,1,c)].
% 0.74/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(8,e,4,a)].
% 0.74/1.01 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(8,e,7,b)].
% 0.74/1.01 9 end_point(ax0_sk6(A),A) | closed(A) # label(closed_defn_32) # label(axiom). [assumption].
% 0.74/1.01 10 -closed(A) | -end_point(B,A) # label(closed_defn_31) # label(axiom). [assumption].
% 0.74/1.01 Derived: end_point(ax0_sk6(A),A) | -end_point(B,A). [resolve(9,b,10,a)].
% 0.74/1.01 11 -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.01 Derived: -meet(A,B,C) | D != sum(B,C) | -end_point(E,B) | meet(E,B,C) | end_point(ax0_sk6(D),D). [resolve(11,a,9,b)].
% 0.74/1.01 12 -end_point(A,B) | open(B) # label(open_defn_34) # label(axiom). [assumption].
% 0.74/1.01 13 -open(A) | end_point(ax0_sk7(A),A) # label(open_defn_33) # label(axiom). [assumption].
% 0.74/1.01 Derived: -end_point(A,B) | end_point(ax0_sk7(B),B). [resolve(12,b,13,a)].
% 0.74/1.01 14 -part_of(A,B) | A = B | open(A) # label(c1_35) # label(axiom). [assumption].
% 0.74/1.01 Derived: -part_of(A,B) | A = B | end_point(ax0_sk7(A),A). [resolve(14,c,13,a)].
% 0.74/1.01 15 open(ax2_sk3(A)) # label(o2_19) # label(axiom). [assumption].
% 0.74/1.01 Derived: end_point(ax0_sk7(ax2_sk3(A)),ax2_sk3(A)). [resolve(15,a,13,a)].
% 0.74/1.01 16 -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.74/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(16,a,12,b)].
% 0.74/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(16,a,14,c)].
% 0.74/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(16,a,15,a)].
% 0.74/1.01 17 -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.74/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(17,a,12,b)].
% 0.74/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(17,a,14,c)].
% 0.74/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(17,a,15,a)].
% 0.74/1.01 18 -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.74/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(18,a,12,b)].
% 0.74/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(18,a,14,c)].
% 0.74/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(18,a,15,a)].
% 0.74/1.01 19 -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.01 20 -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.01 21 -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.01 22 -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.01 23 -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.01 24 -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.01 25 -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.01 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(25,a,19,c)].
% 0.74/1.01 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(25,a,24,c)].
% 0.74/1.01 26 -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.01 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(26,a,19,c)].
% 0.74/1.01 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(26,a,24,c)].
% 0.74/1.01 27 -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.01 Derived: between_c(ax2_sk4(A,B,C,D),D,C,B) | -ordered_by(A,D,C) | -ordered_by(A,C,B). [resolve(27,a,19,c)].
% 0.74/1.01 Derived: between_c(ax2_sk4(A,B,C,D),D,C,B) | -ordered_by(A,B,C) | -ordered_by(A,C,D). [resolve(27,a,24,c)].
% 0.74/1.01 28 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.01 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(28,d,20,a)].
% 0.74/1.01 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(28,d,21,a)].
% 0.74/1.01 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(28,d,22,a)].
% 0.74/1.01 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(28,d,23,a)].
% 0.74/1.01 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(28,d,25,a)].
% 0.74/1.01 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(28,d,26,a)].
% 0.74/1.01 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(28,d,27,a)].
% 0.74/1.01 29 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].
% 0.74/1.01 30 -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].
% 0.74/1.01 31 -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].
% 0.74/1.01 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(31,d,20,a)].
% 0.74/1.01 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(31,d,21,a)].
% 0.74/1.01 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(31,d,22,a)].
% 0.74/1.01 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(31,d,23,a)].
% 0.74/1.01 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(31,d,25,a)].
% 0.74/1.01 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(31,d,26,a)].
% 0.74/1.01 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(31,d,27,a)].
% 0.74/1.01 32 -incident_o(A,B) | A != ax2_sk1(B,A) | start_point(A,B) # label(start_point_defn_9) # label(axiom). [assumption].
% 0.74/1.01 33 -start_point(A,B) | incident_o(A,B) # label(start_point_defn_7) # label(axiom). [assumption].
% 0.74/1.11 34 -start_point(A,B) | A = C | -incident_o(C,B) | ordered_by(B,A,C) # label(start_point_defn_8) # label(axiom). [assumption].
% 0.74/1.11 Derived: -incident_o(A,B) | A != ax2_sk1(B,A) | A = C | -incident_o(C,B) | ordered_by(B,A,C). [resolve(32,c,34,a)].
% 0.74/1.11 35 -incident_o(A,B) | incident_o(ax2_sk1(B,A),B) | start_point(A,B) # label(start_point_defn_10) # label(axiom). [assumption].
% 0.74/1.11 Derived: -incident_o(A,B) | incident_o(ax2_sk1(B,A),B) | A = C | -incident_o(C,B) | ordered_by(B,A,C). [resolve(35,c,34,a)].
% 0.74/1.11 36 -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.74/1.11 Derived: -incident_o(A,B) | -ordered_by(B,A,ax2_sk1(B,A)) | A = C | -incident_o(C,B) | ordered_by(B,A,C). [resolve(36,c,34,a)].
% 0.74/1.11 37 start_point(ax2_sk6(A),A) # label(o4_29) # label(axiom). [assumption].
% 0.74/1.11 Derived: incident_o(ax2_sk6(A),A). [resolve(37,a,33,a)].
% 0.74/1.11 Derived: ax2_sk6(A) = B | -incident_o(B,A) | ordered_by(A,ax2_sk6(A),B). [resolve(37,a,34,a)].
% 0.74/1.11 38 -incident_o(A,B) | A != ax2_sk2(B,A) | finish_point(A,B) # label(finish_point_defn_14) # label(axiom). [assumption].
% 0.74/1.11 39 -finish_point(A,B) | incident_o(A,B) # label(finish_point_defn_12) # label(axiom). [assumption].
% 0.74/1.11 40 -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.11 Derived: -incident_o(A,B) | A != ax2_sk2(B,A) | A = C | -incident_o(C,B) | ordered_by(B,C,A). [resolve(38,c,40,a)].
% 0.74/1.11 41 -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.11 Derived: -incident_o(A,B) | incident_o(ax2_sk2(B,A),B) | A = C | -incident_o(C,B) | ordered_by(B,C,A). [resolve(41,c,40,a)].
% 0.74/1.11 42 -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.11 Derived: -incident_o(A,B) | -ordered_by(B,ax2_sk2(B,A),A) | A = C | -incident_o(C,B) | ordered_by(B,C,A). [resolve(42,c,40,a)].
% 0.74/1.11 43 -once(at_the_same_time(at(A,B),at(C,B))) | connect(A,C,B) # label(connect_defn_2) # label(axiom). [assumption].
% 0.74/1.11 44 -connect(A,B,C) | once(at_the_same_time(at(A,C),at(B,C))) # label(connect_defn_1) # label(axiom). [assumption].
% 0.74/1.11 45 connect(sk28,sk29,sk27) # label(t13_156) # label(negated_conjecture). [assumption].
% 0.74/1.11 Derived: once(at_the_same_time(at(sk28,sk27),at(sk29,sk27))). [resolve(45,a,44,a)].
% 0.74/1.11
% 0.74/1.11 ============================== end predicate elimination =============
% 0.74/1.11
% 0.74/1.11 Auto_denials: (non-Horn, no changes).
% 0.74/1.11
% 0.74/1.11 Term ordering decisions:
% 0.74/1.11 Function symbol KB weights: sk27=1. sk28=1. sk29=1. at_the_same_time=1. sum=1. ax0_sk13=1. ax2_sk10=1. ax2_sk8=1. ax2_sk9=1. ax0_sk10=1. ax0_sk9=1. at=1. ax0_sk3=1. ax0_sk4=1. ax2_sk1=1. ax2_sk2=1. ax0_sk1=1. ax0_sk11=1. ax0_sk12=1. ax3_sk2=1. ax2_sk3=1. ax0_sk8=1. underlying_curve=1. ax0_sk7=1. ax2_sk6=1. trajectory_of=1. ax0_sk6=1. ax3_sk1=1. ax0_sk2=1. ax2_sk7=1. ax0_sk5=1. ax1_sk1=1. ax2_sk4=1. ax2_sk5=1.
% 0.74/1.11
% 0.74/1.11 ============================== end of process initial clauses ========
% 0.74/1.11
% 0.74/1.11 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.11
% 0.74/1.11 ============================== end of clauses for search =============
% 0.74/1.11
% 0.74/1.11 ============================== SEARCH ================================
% 0.74/1.11
% 0.74/1.11 % Starting search at 0.05 seconds.
% 0.74/1.11
% 0.74/1.11 ============================== PROOF =================================
% 0.74/1.11 % SZS status Unsatisfiable
% 0.74/1.11 % SZS output start Refutation
% 0.74/1.11
% 0.74/1.11 % Proof 1 at 0.12 (+ 0.01) seconds.
% 0.74/1.11 % Length of proof is 15.
% 0.74/1.11 % Level of proof is 5.
% 0.74/1.11 % Maximum clause weight is 8.000.
% 0.74/1.11 % Given clauses 155.
% 0.74/1.11
% 0.74/1.11 44 -connect(A,B,C) | once(at_the_same_time(at(A,C),at(B,C))) # label(connect_defn_1) # label(axiom). [assumption].
% 0.74/1.11 45 connect(sk28,sk29,sk27) # label(t13_156) # label(negated_conjecture). [assumption].
% 0.74/1.11 111 -once(at_the_same_time(A,B)) | once(A) # label(conjunction_at_the_same_time_8) # label(axiom). [assumption].
% 0.74/1.11 112 -once(at_the_same_time(A,B)) | once(B) # label(conjunction_at_the_same_time_9) # label(axiom). [assumption].
% 0.74/1.11 113 -once(at(A,B)) | incident_o(B,trajectory_of(A)) # label(at_on_trajectory_10) # label(axiom). [assumption].
% 0.74/1.11 115 trajectory_of(A) = ax3_sk1(A) # label(trajectories_are_oriented_curves_12) # label(axiom). [assumption].
% 0.74/1.11 119 -incident_o(sk27,trajectory_of(sk28)) | -incident_o(sk27,trajectory_of(sk29)) # label(t13_157) # label(negated_conjecture). [assumption].
% 0.74/1.11 120 -incident_o(sk27,ax3_sk1(sk28)) | -incident_o(sk27,ax3_sk1(sk29)). [copy(119),rewrite([115(3),115(7)])].
% 0.74/1.11 182 once(at_the_same_time(at(sk28,sk27),at(sk29,sk27))). [resolve(45,a,44,a)].
% 0.74/1.11 196 -once(at(A,B)) | incident_o(B,ax3_sk1(A)). [back_rewrite(113),rewrite([115(3)])].
% 0.74/1.11 582 once(at(sk29,sk27)). [resolve(182,a,112,a)].
% 0.74/1.11 583 once(at(sk28,sk27)). [resolve(182,a,111,a)].
% 0.74/1.11 733 incident_o(sk27,ax3_sk1(sk29)). [resolve(582,a,196,a)].
% 0.74/1.11 736 -incident_o(sk27,ax3_sk1(sk28)). [back_unit_del(120),unit_del(b,733)].
% 0.74/1.11 737 $F. [resolve(583,a,196,a),unit_del(a,736)].
% 0.74/1.11
% 0.74/1.11 % SZS output end Refutation
% 0.74/1.11 ============================== end of proof ==========================
% 0.74/1.11
% 0.74/1.11 ============================== STATISTICS ============================
% 0.74/1.11
% 0.74/1.11 Given=155. Generated=1087. Kept=667. proofs=1.
% 0.74/1.11 Usable=152. Sos=450. Demods=3. Limbo=0, Disabled=233. Hints=0.
% 0.74/1.11 Megabytes=1.02.
% 0.74/1.11 User_CPU=0.12, System_CPU=0.01, Wall_clock=0.
% 0.74/1.11
% 0.74/1.11 ============================== end of statistics =====================
% 0.74/1.11
% 0.74/1.11 ============================== end of search =========================
% 0.74/1.11
% 0.74/1.11 THEOREM PROVED
% 0.74/1.11 % SZS status Unsatisfiable
% 0.74/1.11
% 0.74/1.11 Exiting with 1 proof.
% 0.74/1.11
% 0.74/1.11 Process 18120 exit (max_proofs) Fri Jun 17 20:44:52 2022
% 0.74/1.11 Prover9 interrupted
%------------------------------------------------------------------------------