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