0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer   : n026.cluster.edu
0.09/0.29	% Model      : x86_64 x86_64
0.09/0.29	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory     : 8042.1875MB
0.09/0.29	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1200
0.09/0.29	% DateTime   : Tue Jul 13 12:55:14 EDT 2021
0.09/0.29	% CPUTime    : 
0.69/1.01	============================== Prover9 ===============================
0.69/1.01	Prover9 (32) version 2009-11A, November 2009.
0.69/1.01	Process 22327 was started by sandbox2 on n026.cluster.edu,
0.69/1.01	Tue Jul 13 12:55:14 2021
0.69/1.01	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_22174_n026.cluster.edu".
0.69/1.01	============================== end of head ===========================
0.69/1.01	
0.69/1.01	============================== INPUT =================================
0.69/1.01	
0.69/1.01	% Reading from file /tmp/Prover9_22174_n026.cluster.edu
0.69/1.01	
0.69/1.01	set(prolog_style_variables).
0.69/1.01	set(auto2).
0.69/1.01	    % set(auto2) -> set(auto).
0.69/1.01	    % set(auto) -> set(auto_inference).
0.69/1.01	    % set(auto) -> set(auto_setup).
0.69/1.01	    % set(auto_setup) -> set(predicate_elim).
0.69/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/1.01	    % set(auto) -> set(auto_limits).
0.69/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/1.01	    % set(auto) -> set(auto_denials).
0.69/1.01	    % set(auto) -> set(auto_process).
0.69/1.01	    % set(auto2) -> assign(new_constants, 1).
0.69/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.69/1.01	    % set(auto2) -> assign(max_hours, 1).
0.69/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.69/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.69/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/1.01	    % set(auto2) -> set(sort_initial_sos).
0.69/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.69/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/1.01	    % set(auto2) -> assign(max_megs, 400).
0.69/1.01	    % set(auto2) -> assign(stats, some).
0.69/1.01	    % set(auto2) -> clear(echo_input).
0.69/1.01	    % set(auto2) -> set(quiet).
0.69/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.69/1.01	    % set(auto2) -> clear(print_given).
0.69/1.01	assign(lrs_ticks,-1).
0.69/1.01	assign(sos_limit,10000).
0.69/1.01	assign(order,kbo).
0.69/1.01	set(lex_order_vars).
0.69/1.01	clear(print_given).
0.69/1.01	
0.69/1.01	% formulas(sos).  % not echoed (28 formulas)
0.69/1.01	
0.69/1.01	============================== end of input ==========================
0.69/1.01	
0.69/1.01	% From the command line: assign(max_seconds, 1200).
0.69/1.01	
0.69/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/1.01	
0.69/1.01	% Formulas that are not ordinary clauses:
0.69/1.01	1 (all C all C1 all C2 all C3 (part_of(C1,C) & (exists P (end_point(P,C2) & end_point(P,C3) & end_point(P,C1))) & part_of(C3,C) & part_of(C2,C) -> part_of(C1,C2) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C1) | part_of(C3,C2) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	2 (all P all C ((all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> part_of(C2,C1) | part_of(C1,C2))) & incident_c(P,C) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	3 (all C all C1 (C1 != C & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	4 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	5 (all C1 all C2 ((exists P meet(P,C1,C2)) -> (exists C C = sum(C1,C2)))) # label(c8) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	6 (all P all C (inner_point(P,C) <-> -end_point(P,C) & incident_c(P,C))) # label(inner_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	7 (all C all C1 all C2 all P (closed(C) & C = sum(C1,C2) & meet(P,C1,C2) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	8 (all C all P (end_point(P,C) -> (exists Q (P != Q & end_point(Q,C))))) # label(c6) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	9 (all C all C1 ((all P (incident_c(P,C1) -> incident_c(P,C))) <-> part_of(C1,C))) # label(part_of_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	10 (all C all P all Q all R (end_point(R,C) & end_point(Q,C) & end_point(P,C) -> Q = P | Q = R | P = R)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	11 (all C all C1 all C2 ((all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))) <-> C = sum(C1,C2))) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	12 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	13 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (meet(P,C1,C2) & sum(C1,C2) = C)))) # label(c4) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	14 (all C all C1 ((all P (incident_c(P,C) <-> incident_c(P,C1))) -> C1 = C)) # label(c9) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	15 (all P all C all C1 (meet(P,C,C1) <-> incident_c(P,C) & incident_c(P,C1) & (all Q (incident_c(Q,C) & incident_c(Q,C1) -> end_point(Q,C) & end_point(Q,C1))))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	16 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	17 (all C all P all Q all R ((exists Cpp (part_of(Cpp,C) & inner_point(Q,Cpp) & end_point(R,Cpp) & end_point(P,Cpp))) & P != R <-> between_c(C,P,Q,R))) # label(between_c_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	18 (all P all Q all R all O ((exists C (between_c(C,P,Q,R) & (all P (incident_o(P,O) <-> incident_c(P,C))))) <-> between_o(O,P,Q,R))) # label(o3) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	19 (all O1 all O2 ((all P all Q (ordered_by(O2,P,Q) <-> ordered_by(O1,P,Q))) -> O1 = O2)) # label(o6) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	20 (all O exists P start_point(P,O)) # label(o4) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	21 (all O all P all Q (ordered_by(O,P,Q) -> incident_o(Q,O) & incident_o(P,O))) # label(o1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	22 (all O exists C ((all P (incident_o(P,O) <-> incident_c(P,C))) & open(C))) # label(o2) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	23 (all P all O (start_point(P,O) <-> (all Q (incident_o(Q,O) & Q != P -> ordered_by(O,P,Q))) & incident_o(P,O))) # label(start_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	24 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,Q,P) & ordered_by(O,R,Q) | ordered_by(O,Q,R) & ordered_by(O,P,Q))) # label(between_o_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	25 (all P all Q all C (open(C) & incident_c(P,C) & incident_c(Q,C) & P != Q -> (exists O ((all R (incident_c(R,C) <-> incident_o(R,O))) & ordered_by(O,P,Q))))) # label(o5) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	26 (all P all O (incident_o(P,O) & (all Q (Q != P & incident_o(Q,O) -> ordered_by(O,Q,P))) <-> finish_point(P,O))) # label(finish_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	27 (all C all O (underlying_curve(O) = C <-> (all P (incident_o(P,O) <-> incident_c(P,C))))) # label(underlying_curve_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	28 -(all O all P all Q (finish_point(P,O) & finish_point(Q,O) -> Q = P)) # label(corollary_4_10_2) # label(negated_conjecture) # label(non_clause).  [assumption].
0.69/1.01	
0.69/1.01	============================== end of process non-clausal formulas ===
0.69/1.01	
0.69/1.01	============================== PROCESS INITIAL CLAUSES ===============
0.69/1.01	
0.69/1.01	============================== PREDICATE ELIMINATION =================
0.69/1.01	29 -open(A) | end_point(f13(A),A) # label(open_defn) # label(axiom).  [clausify(16)].
0.69/1.01	30 open(f20(A)) # label(o2) # label(axiom).  [clausify(22)].
0.69/1.01	31 open(A) | -end_point(B,A) # label(open_defn) # label(axiom).  [clausify(16)].
0.69/1.01	Derived: end_point(f13(f20(A)),f20(A)).  [resolve(29,a,30,a)].
0.69/1.01	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(29,a,31,a)].
0.69/1.01	32 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom).  [clausify(3)].
0.69/1.01	Derived: A = B | -part_of(A,B) | end_point(f13(A),A).  [resolve(32,c,29,a)].
0.69/1.01	33 -open(A) | -incident_c(B,A) | -incident_c(C,A) | C = B | ordered_by(f22(B,C,A),B,C) # label(o5) # label(axiom).  [clausify(25)].
0.69/1.01	Derived: -incident_c(A,f20(B)) | -incident_c(C,f20(B)) | C = A | ordered_by(f22(A,C,f20(B)),A,C).  [resolve(33,a,30,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | ordered_by(f22(A,C,B),A,C) | -end_point(D,B).  [resolve(33,a,31,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | ordered_by(f22(A,C,B),A,C) | B = D | -part_of(B,D).  [resolve(33,a,32,c)].
0.69/1.01	34 -open(A) | -incident_c(B,A) | -incident_c(C,A) | C = B | -incident_c(D,A) | incident_o(D,f22(B,C,A)) # label(o5) # label(axiom).  [clausify(25)].
0.69/1.01	Derived: -incident_c(A,f20(B)) | -incident_c(C,f20(B)) | C = A | -incident_c(D,f20(B)) | incident_o(D,f22(A,C,f20(B))).  [resolve(34,a,30,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | -incident_c(D,B) | incident_o(D,f22(A,C,B)) | -end_point(E,B).  [resolve(34,a,31,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | -incident_c(D,B) | incident_o(D,f22(A,C,B)) | B = E | -part_of(B,E).  [resolve(34,a,32,c)].
0.69/1.01	35 -open(A) | -incident_c(B,A) | -incident_c(C,A) | C = B | incident_c(D,A) | -incident_o(D,f22(B,C,A)) # label(o5) # label(axiom).  [clausify(25)].
0.69/1.01	Derived: -incident_c(A,f20(B)) | -incident_c(C,f20(B)) | C = A | incident_c(D,f20(B)) | -incident_o(D,f22(A,C,f20(B))).  [resolve(35,a,30,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | incident_c(D,B) | -incident_o(D,f22(A,C,B)) | -end_point(E,B).  [resolve(35,a,31,a)].
0.69/1.01	Derived: -incident_c(A,B) | -incident_c(C,B) | C = A | incident_c(D,B) | -incident_o(D,f22(A,C,B)) | B = E | -part_of(B,E).  [resolve(35,a,32,c)].
0.69/1.01	36 incident_o(A,B) | -finish_point(A,B) # label(finish_point_defn) # label(axiom).  [clausify(26)].
0.69/1.01	37 finish_point(c11,c10) # label(corollary_4_10_2) # label(negated_conjecture).  [clausify(28)].
0.69/1.01	38 finish_point(c12,c10) # label(corollary_4_10_2) # label(negated_conjecture).  [clausify(28)].
0.69/1.01	Derived: incident_o(c11,c10).  [resolve(36,b,37,a)].
0.69/1.01	Derived: incident_o(c12,c10).  [resolve(36,b,38,a)].
0.69/1.01	39 -incident_o(A,B) | f23(A,B) != A | finish_point(A,B) # label(finish_point_defn) # label(axiom).  [clausify(26)].
0.69/1.01	40 -incident_o(A,B) | incident_o(f23(A,B),B) | finish_point(A,B) # label(finish_point_defn) # label(axiom).  [clausify(26)].
0.69/1.01	41 -incident_o(A,B) | -ordered_by(B,f23(A,B),A) | finish_point(A,B) # label(finish_point_defn) # label(axiom).  [clausify(26)].
0.69/1.01	42 A = B | -incident_o(A,C) | ordered_by(C,A,B) | -finish_point(B,C) # label(finish_point_defn) # label(axiom).  [clausify(26)].
0.69/1.01	Derived: A = c11 | -incident_o(A,c10) | ordered_by(c10,A,c11).  [resolve(42,d,37,a)].
0.69/1.01	Derived: A = c12 | -incident_o(A,c10) | ordered_by(c10,A,c12).  [resolve(42,d,38,a)].
0.69/1.01	Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | f23(B,C) != B.  [resolve(42,d,39,c)].
0.69/1.01	Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | incident_o(f23(B,C),C).  [resolve(42,d,40,c)].
0.69/1.01	Derived: A = B | -incident_o(A,C) | ordered_by(C,A,B) | -incident_o(B,C) | -ordered_by(C,f23(B,C),B).  [resolve(42,d,41,c)].
0.69/1.01	43 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.69/1.01	44 inner_point(f8(A),A) # label(c3) # label(axiom).  [clausify(12)].
0.69/1.01	Derived: -end_point(f8(A),A).  [resolve(43,a,44,a)].
0.69/1.01	45 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.69/1.01	Derived: incident_c(f8(A),A).  [resolve(45,a,44,a)].
0.69/1.01	46 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.69/1.01	47 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom).  [clausify(13)].
0.69/1.01	Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))).  [resolve(47,a,44,a)].
0.69/1.01	Derived: meet(A,f9(B,A),f10(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(47,a,46,a)].
0.69/1.01	48 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom).  [clausify(13)].
0.69/1.01	Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A.  [resolve(48,a,44,a)].
0.69/1.01	Derived: sum(f9(A,B),f10(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(48,a,46,a)].
0.69/1.01	49 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.69/1.01	Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(49,a,43,a)].
0.69/1.01	Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(49,a,45,a)].
0.69/1.01	Derived: -between_c(A,B,C,D) | meet(C,f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)).  [resolve(49,a,47,a)].
0.69/1.01	Derived: -between_c(A,B,C,D) | sum(f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)) = f14(A,B,C,D).  [resolve(49,a,48,a)].
0.69/1.01	50 -part_of(A,B) | -inner_point(C,A) | -end_point(D,A) | -end_point(E,A) | D = E | between_c(B,E,C,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.69/1.01	Derived: -part_of(A,B) | -end_point(C,A) | -end_point(D,A) | C = D | between_c(B,D,f8(A),C).  [resolve(50,b,44,a)].
0.69/1.01	Derived: -part_of(A,B) | -end_point(C,A) | -end_point(D,A) | C = D | between_c(B,D,E,C) | end_point(E,A) | -incident_c(E,A).  [resolve(50,b,46,a)].
0.69/1.01	Derived: -part_of(f14(A,B,C,D),E) | -end_point(F,f14(A,B,C,D)) | -end_point(V6,f14(A,B,C,D)) | F = V6 | between_c(E,V6,C,F) | -between_c(A,B,C,D).  [resolve(50,b,49,a)].
0.69/1.01	51 -start_point(A,B) | incident_o(A,B) # label(start_point_defn) # label(axiom).  [clausify(23)].
0.69/1.01	52 start_point(f19(A),A) # label(o4) # label(axiom).  [clausify(20)].
0.69/1.01	Derived: incident_o(f19(A),A).  [resolve(51,a,52,a)].
0.69/1.01	53 start_point(A,B) | incident_o(f21(A,B),B) | -incident_o(A,B) # label(start_point_defn) # label(axiom).  [clausify(23)].
0.69/1.01	54 start_point(A,B) | f21(A,B) != A | -incident_o(A,B) # label(start_point_defn) # label(axiom).  [clausify(23)].
0.69/1.01	55 start_point(A,B) | -ordered_by(B,A,f21(A,B)) | -incident_o(A,B) # label(start_point_defn) # label(axiom).  [clausify(23)].
0.69/1.01	56 -start_point(A,B) | -incident_o(C,B) | C = A | ordered_by(B,A,C) # label(start_point_defn) # label(axiom).  [clausify(23)].
0.69/1.01	Derived: -incident_o(A,B) | A = f19(B) | ordered_by(B,f19(B),A).  [resolve(56,a,52,a)].
0.69/1.01	Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | incident_o(f21(C,B),B) | -incident_o(C,B).  [resolve(56,a,53,a)].
0.69/1.01	Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | f21(C,B) != C | -incident_o(C,B).  [resolve(56,a,54,a)].
0.69/1.01	Derived: -incident_o(A,B) | A = C | ordered_by(B,C,A) | -ordered_by(B,C,f21(C,B)) | -incident_o(C,B).  [resolve(56,a,55,a)].
0.69/1.01	57 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(4)].
0.69/1.01	58 end_point(f3(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(4)].
0.69/1.01	Derived: -end_point(A,B) | end_point(f3(B),B).  [resolve(57,b,58,b)].
0.69/1.01	59 -closed(A) | sum(B,C) != A | -meet(D,B,C) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom).  [clausify(7)].
0.69/1.01	Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f3(C),C).  [resolve(59,a,58,b)].
0.69/1.01	60 between_o(A,B,C,D) | -ordered_by(A,C,B) | -ordered_by(A,D,C) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	61 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	62 -between_o(A,B,C,D) | ordered_by(A,C,B) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	63 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,C,D) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	64 -between_o(A,B,C,D) | ordered_by(A,D,C) | ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	65 between_o(A,B,C,D) | -ordered_by(A,C,D) | -ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(24)].
0.69/1.01	66 between_c(f16(A,B,C,D),A,B,C) | -between_o(D,A,B,C) # label(o3) # label(axiom).  [clausify(18)].
0.69/1.01	Derived: between_c(f16(A,B,C,D),A,B,C) | -ordered_by(D,B,A) | -ordered_by(D,C,B).  [resolve(66,b,60,a)].
0.69/1.01	Derived: between_c(f16(A,B,C,D),A,B,C) | -ordered_by(D,B,C) | -ordered_by(D,A,B).  [resolve(66,b,65,a)].
0.69/1.01	67 -incident_o(A,B) | incident_c(A,f16(C,D,E,B)) | -between_o(B,C,D,E) # label(o3) # label(axiom).  [clausify(18)].
0.69/1.01	Derived: -incident_o(A,B) | incident_c(A,f16(C,D,E,B)) | -ordered_by(B,D,C) | -ordered_by(B,E,D).  [resolve(67,c,60,a)].
0.69/1.01	Derived: -incident_o(A,B) | incident_c(A,f16(C,D,E,B)) | -ordered_by(B,D,E) | -ordered_by(B,C,D).  [resolve(67,c,65,a)].
0.69/1.01	68 incident_o(A,B) | -incident_c(A,f16(C,D,E,B)) | -between_o(B,C,D,E) # label(o3) # label(axiom).  [clausify(18)].
0.69/1.01	Derived: incident_o(A,B) | -incident_c(A,f16(C,D,E,B)) | -ordered_by(B,D,C) | -ordered_by(B,E,D).  [resolve(68,c,60,a)].
0.69/1.01	Derived: incident_o(A,B) | -incident_c(A,f16(C,D,E,B)) | -ordered_by(B,D,E) | -ordered_by(B,C,D).  [resolve(68,c,65,a)].
0.69/1.01	69 -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | between_o(E,B,C,D) # label(o3) # label(axiom).  [clausify(18)].
0.69/1.01	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | ordered_by(E,C,B) | ordered_by(E,C,D).  [resolve(69,d,61,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | ordered_by(E,C,B) | ordered_by(E,B,C).  [resolve(69,d,62,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | ordered_by(E,D,C) | ordered_by(E,C,D).  [resolve(69,d,63,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | ordered_by(E,D,C) | ordered_by(E,B,C).  [resolve(69,d,64,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | between_c(f16(B,C,D,E),B,C,D).  [resolve(69,d,66,b)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | -incident_o(F,E) | incident_c(F,f16(B,C,D,E)).  [resolve(69,d,67,c)].
1.70/2.07	Derived: -between_c(A,B,C,D) | incident_o(f15(B,C,D,E,A),E) | incident_c(f15(B,C,D,E,A),A) | incident_o(F,E) | -incident_c(F,f16(B,C,D,E)).  [resolve(69,d,68,c)].
1.70/2.07	70 -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | between_o(E,B,C,D) # label(o3) # label(axiom).  [clausify(18)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | ordered_by(E,C,B) | ordered_by(E,C,D).  [resolve(70,d,61,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | ordered_by(E,C,B) | ordered_by(E,B,C).  [resolve(70,d,62,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | ordered_by(E,D,C) | ordered_by(E,C,D).  [resolve(70,d,63,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | ordered_by(E,D,C) | ordered_by(E,B,C).  [resolve(70,d,64,a)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | between_c(f16(B,C,D,E),B,C,D).  [resolve(70,d,66,b)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | -incident_o(F,E) | incident_c(F,f16(B,C,D,E)).  [resolve(70,d,67,c)].
1.70/2.07	Derived: -between_c(A,B,C,D) | -incident_o(f15(B,C,D,E,A),E) | -incident_c(f15(B,C,D,E,A),A) | incident_o(F,E) | -incident_c(F,f16(B,C,D,E)).  [resolve(70,d,68,c)].
1.70/2.07	
1.70/2.07	============================== end predicate elimination =============
1.70/2.07	
1.70/2.07	Auto_denials:  (non-Horn, no changes).
1.70/2.07	
1.70/2.07	Term ordering decisions:
1.70/2.07	Function symbol KB weights:  c10=1. c11=1. c12=1. sum=1. f1=1. f2=1. f4=1. f5=1. f6=1. f9=1. f10=1. f11=1. f17=1. f18=1. f21=1. f23=1. f24=1. underlying_curve=1. f3=1. f8=1. f13=1. f19=1. f20=1. f7=1. f12=1. f22=1. f14=1. f16=1. f15=1.
1.70/2.07	
1.70/2.07	============================== end of process initial clauses ========
1.70/2.07	
1.70/2.07	============================== CLAUSES FOR SEARCH ====================
1.70/2.07	
1.70/2.07	============================== end of clauses for search =============
1.70/2.07	
1.70/2.07	============================== SEARCH ================================
1.70/2.07	
1.70/2.07	% Starting search at 0.02 seconds.
1.70/2.07	
1.70/2.07	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 32 (0.00 of 0.63 sec).
1.70/2.07	
1.70/2.07	Low Water (keep): wt=35.000, iters=3814
1.70/2.07	
1.70/2.07	============================== PROOF =================================
1.70/2.07	% SZS status Theorem
1.70/2.07	% SZS output start Refutation
1.70/2.07	
1.70/2.07	% Proof 1 at 1.05 (+ 0.02) seconds.
1.70/2.07	% Length of proof is 25.
1.70/2.07	% Level of proof is 7.
1.70/2.07	% Maximum clause weight is 17.000.
1.70/2.07	% Given clauses 765.
1.70/2.07	
1.70/2.07	17 (all C all P all Q all R ((exists Cpp (part_of(Cpp,C) & inner_point(Q,Cpp) & end_point(R,Cpp) & end_point(P,Cpp))) & P != R <-> between_c(C,P,Q,R))) # label(between_c_defn) # label(axiom) # label(non_clause).  [assumption].
1.70/2.07	18 (all P all Q all R all O ((exists C (between_c(C,P,Q,R) & (all P (incident_o(P,O) <-> incident_c(P,C))))) <-> between_o(O,P,Q,R))) # label(o3) # label(axiom) # label(non_clause).  [assumption].
1.70/2.07	24 (all O all P all Q all R (between_o(O,P,Q,R) <-> ordered_by(O,Q,P) & ordered_by(O,R,Q) | ordered_by(O,Q,R) & ordered_by(O,P,Q))) # label(between_o_defn) # label(axiom) # label(non_clause).  [assumption].
1.70/2.07	26 (all P all O (incident_o(P,O) & (all Q (Q != P & incident_o(Q,O) -> ordered_by(O,Q,P))) <-> finish_point(P,O))) # label(finish_point_defn) # label(axiom) # label(non_clause).  [assumption].
1.70/2.07	28 -(all O all P all Q (finish_point(P,O) & finish_point(Q,O) -> Q = P)) # label(corollary_4_10_2) # label(negated_conjecture) # label(non_clause).  [assumption].
1.70/2.07	36 incident_o(A,B) | -finish_point(A,B) # label(finish_point_defn) # label(axiom).  [clausify(26)].
1.70/2.07	37 finish_point(c11,c10) # label(corollary_4_10_2) # label(negated_conjecture).  [clausify(28)].
1.70/2.07	38 finish_point(c12,c10) # label(corollary_4_10_2) # label(negated_conjecture).  [clausify(28)].
1.70/2.07	42 A = B | -incident_o(A,C) | ordered_by(C,A,B) | -finish_point(B,C) # label(finish_point_defn) # label(axiom).  [clausify(26)].
1.70/2.07	65 between_o(A,B,C,D) | -ordered_by(A,C,D) | -ordered_by(A,B,C) # label(between_o_defn) # label(axiom).  [clausify(24)].
1.70/2.07	66 between_c(f16(A,B,C,D),A,B,C) | -between_o(D,A,B,C) # label(o3) # label(axiom).  [clausify(18)].
1.70/2.07	76 c12 != c11 # label(corollary_4_10_2) # label(negated_conjecture).  [clausify(28)].
1.70/2.07	78 A != B | -between_c(C,B,D,A) # label(between_c_defn) # label(axiom).  [clausify(17)].
1.70/2.07	130 incident_o(c11,c10).  [resolve(36,b,37,a)].
1.70/2.07	131 incident_o(c12,c10).  [resolve(36,b,38,a)].
1.70/2.07	132 A = c11 | -incident_o(A,c10) | ordered_by(c10,A,c11).  [resolve(42,d,37,a)].
1.70/2.07	133 c11 = A | -incident_o(A,c10) | ordered_by(c10,A,c11).  [copy(132),flip(a)].
1.70/2.07	134 A = c12 | -incident_o(A,c10) | ordered_by(c10,A,c12).  [resolve(42,d,38,a)].
1.70/2.07	135 c12 = A | -incident_o(A,c10) | ordered_by(c10,A,c12).  [copy(134),flip(a)].
1.70/2.07	161 between_c(f16(A,B,C,D),A,B,C) | -ordered_by(D,B,C) | -ordered_by(D,A,B).  [resolve(66,b,65,a)].
1.70/2.07	487 ordered_by(c10,c12,c11).  [resolve(133,b,131,a),flip(a),unit_del(a,76)].
1.70/2.07	489 ordered_by(c10,c11,c12).  [resolve(135,b,130,a),unit_del(a,76)].
1.70/2.07	782 between_c(f16(c12,c11,A,c10),c12,c11,A) | -ordered_by(c10,c11,A).  [resolve(487,a,161,c)].
1.70/2.07	7157 between_c(f16(c12,c11,c12,c10),c12,c11,c12).  [resolve(782,b,489,a)].
1.70/2.07	7177 $F.  [resolve(7157,a,78,b),xx(a)].
1.70/2.07	
1.70/2.07	% SZS output end Refutation
1.70/2.07	============================== end of proof ==========================
1.70/2.07	
1.70/2.07	============================== STATISTICS ============================
1.70/2.07	
1.70/2.07	Given=765. Generated=14388. Kept=7102. proofs=1.
1.70/2.07	Usable=555. Sos=4050. Demods=5. Limbo=19, Disabled=2625. Hints=0.
1.70/2.07	Megabytes=8.42.
1.70/2.07	User_CPU=1.05, System_CPU=0.02, Wall_clock=2.
1.70/2.07	
1.70/2.07	============================== end of statistics =====================
1.70/2.07	
1.70/2.07	============================== end of search =========================
1.70/2.07	
1.70/2.07	THEOREM PROVED
1.70/2.07	% SZS status Theorem
1.70/2.07	
1.70/2.07	Exiting with 1 proof.
1.70/2.07	
1.70/2.07	Process 22327 exit (max_proofs) Tue Jul 13 12:55:16 2021
1.70/2.07	Prover9 interrupted
1.70/2.07	EOF