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