0.04/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n004.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit : 1440
0.13/0.34	% WCLimit  : 180
0.13/0.34	% DateTime : Mon Jul  3 03:16:45 EDT 2023
0.13/0.34	% CPUTime  : 
0.48/1.04	============================== Prover9 ===============================
0.48/1.04	Prover9 (32) version 2009-11A, November 2009.
0.48/1.04	Process 22032 was started by sandbox on n004.cluster.edu,
0.48/1.04	Mon Jul  3 03:16:46 2023
0.48/1.04	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 1440 -f /tmp/Prover9_21668_n004.cluster.edu".
0.48/1.04	============================== end of head ===========================
0.48/1.04	
0.48/1.04	============================== INPUT =================================
0.48/1.04	
0.48/1.04	% Reading from file /tmp/Prover9_21668_n004.cluster.edu
0.48/1.04	
0.48/1.04	set(prolog_style_variables).
0.48/1.04	set(auto2).
0.48/1.04	    % set(auto2) -> set(auto).
0.48/1.04	    % set(auto) -> set(auto_inference).
0.48/1.04	    % set(auto) -> set(auto_setup).
0.48/1.04	    % set(auto_setup) -> set(predicate_elim).
0.48/1.04	    % set(auto_setup) -> assign(eq_defs, unfold).
0.48/1.04	    % set(auto) -> set(auto_limits).
0.48/1.04	    % set(auto_limits) -> assign(max_weight, "100.000").
0.48/1.04	    % set(auto_limits) -> assign(sos_limit, 20000).
0.48/1.04	    % set(auto) -> set(auto_denials).
0.48/1.04	    % set(auto) -> set(auto_process).
0.48/1.04	    % set(auto2) -> assign(new_constants, 1).
0.48/1.04	    % set(auto2) -> assign(fold_denial_max, 3).
0.48/1.04	    % set(auto2) -> assign(max_weight, "200.000").
0.48/1.04	    % set(auto2) -> assign(max_hours, 1).
0.48/1.04	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.48/1.04	    % set(auto2) -> assign(max_seconds, 0).
0.48/1.04	    % set(auto2) -> assign(max_minutes, 5).
0.48/1.04	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.48/1.04	    % set(auto2) -> set(sort_initial_sos).
0.48/1.04	    % set(auto2) -> assign(sos_limit, -1).
0.48/1.04	    % set(auto2) -> assign(lrs_ticks, 3000).
0.48/1.04	    % set(auto2) -> assign(max_megs, 400).
0.48/1.04	    % set(auto2) -> assign(stats, some).
0.48/1.04	    % set(auto2) -> clear(echo_input).
0.48/1.04	    % set(auto2) -> set(quiet).
0.48/1.04	    % set(auto2) -> clear(print_initial_clauses).
0.48/1.04	    % set(auto2) -> clear(print_given).
0.48/1.04	assign(lrs_ticks,-1).
0.48/1.04	assign(sos_limit,10000).
0.48/1.04	assign(order,kbo).
0.48/1.04	set(lex_order_vars).
0.48/1.04	clear(print_given).
0.48/1.04	
0.48/1.04	% formulas(sos).  % not echoed (18 formulas)
0.48/1.04	
0.48/1.04	============================== end of input ==========================
0.48/1.04	
0.48/1.04	% From the command line: assign(max_seconds, 1440).
0.48/1.04	
0.48/1.04	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.48/1.04	
0.48/1.04	% Formulas that are not ordinary clauses:
0.48/1.04	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.48/1.04	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.48/1.04	3 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.48/1.04	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.48/1.04	5 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.48/1.04	6 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.48/1.04	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.48/1.04	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.48/1.04	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.48/1.04	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.48/1.04	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.48/1.04	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.48/1.04	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.48/1.05	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.48/1.05	15 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.48/1.05	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.48/1.05	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.48/1.05	18 -(all C all P all Q all R (between_c(C,P,Q,R) -> incident_c(P,C) & incident_c(R,C) & P != Q & Q != R & P != R & incident_c(Q,C))) # label(theorem_3_8_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.48/1.05	
0.48/1.05	============================== end of process non-clausal formulas ===
0.48/1.05	
0.48/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.48/1.05	
0.48/1.05	============================== PREDICATE ELIMINATION =================
0.48/1.05	19 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
0.48/1.05	20 inner_point(f2(A),A) # label(c3) # label(axiom).  [clausify(3)].
0.48/1.05	Derived: -end_point(f2(A),A).  [resolve(19,a,20,a)].
0.48/1.05	21 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
0.48/1.05	Derived: incident_c(f2(A),A).  [resolve(21,a,20,a)].
0.48/1.05	22 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
0.48/1.05	23 -inner_point(A,B) | meet(A,f11(B,A),f12(B,A)) # label(c4) # label(axiom).  [clausify(14)].
0.48/1.05	Derived: meet(f2(A),f11(A,f2(A)),f12(A,f2(A))).  [resolve(23,a,20,a)].
0.48/1.05	Derived: meet(A,f11(B,A),f12(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(23,a,22,a)].
0.48/1.05	24 -inner_point(A,B) | sum(f11(B,A),f12(B,A)) = B # label(c4) # label(axiom).  [clausify(14)].
0.48/1.05	Derived: sum(f11(A,f2(A)),f12(A,f2(A))) = A.  [resolve(24,a,20,a)].
0.48/1.05	Derived: sum(f11(A,B),f12(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(24,a,22,a)].
0.48/1.05	25 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.48/1.05	Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(25,a,19,a)].
0.48/1.05	Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(25,a,21,a)].
0.48/1.05	Derived: -between_c(A,B,C,D) | meet(C,f11(f14(A,B,C,D),C),f12(f14(A,B,C,D),C)).  [resolve(25,a,23,a)].
0.48/1.05	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(25,a,24,a)].
0.48/1.05	26 -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.48/1.05	Derived: -end_point(A,B) | -end_point(C,B) | -part_of(B,D) | C = A | between_c(D,A,f2(B),C).  [resolve(26,b,20,a)].
0.48/1.05	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(26,b,22,a)].
0.48/1.05	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(26,b,25,a)].
0.48/1.05	27 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(15)].
0.48/1.05	28 end_point(f13(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(15)].
0.48/1.05	Derived: -end_point(A,B) | end_point(f13(B),B).  [resolve(27,b,28,b)].
0.48/1.05	29 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.48/1.05	Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f13(C),C).  [resolve(29,c,28,b)].
0.48/1.05	30 end_point(f4(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(5)].
0.48/1.05	31 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(5)].
0.96/1.25	Derived: end_point(f4(A),A) | -end_point(B,A).  [resolve(30,b,31,b)].
0.96/1.25	32 -part_of(A,B) | B = A | open(A) # label(c1) # label(axiom).  [clausify(6)].
0.96/1.25	Derived: -part_of(A,B) | B = A | end_point(f4(A),A).  [resolve(32,c,30,b)].
0.96/1.25	
0.96/1.25	============================== end predicate elimination =============
0.96/1.25	
0.96/1.25	Auto_denials:  (non-Horn, no changes).
0.96/1.25	
0.96/1.25	Term ordering decisions:
0.96/1.25	Function symbol KB weights:  c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f3=1. f5=1. f7=1. f8=1. f9=1. f11=1. f12=1. f2=1. f4=1. f13=1. f6=1. f10=1. f14=1.
0.96/1.25	
0.96/1.25	============================== end of process initial clauses ========
0.96/1.25	
0.96/1.25	============================== CLAUSES FOR SEARCH ====================
0.96/1.25	
0.96/1.25	============================== end of clauses for search =============
0.96/1.25	
0.96/1.25	============================== SEARCH ================================
0.96/1.25	
0.96/1.25	% Starting search at 0.02 seconds.
0.96/1.25	
0.96/1.25	============================== PROOF =================================
0.96/1.25	% SZS status Theorem
0.96/1.25	% SZS output start Refutation
0.96/1.25	
0.96/1.25	% Proof 1 at 0.22 (+ 0.01) seconds.
0.96/1.25	% Length of proof is 35.
0.96/1.25	% Level of proof is 8.
0.96/1.25	% Maximum clause weight is 18.000.
0.96/1.25	% Given clauses 150.
0.96/1.25	
0.96/1.25	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.96/1.25	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.96/1.25	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.96/1.25	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.96/1.25	18 -(all C all P all Q all R (between_c(C,P,Q,R) -> incident_c(P,C) & incident_c(R,C) & P != Q & Q != R & P != R & incident_c(Q,C))) # label(theorem_3_8_1) # label(negated_conjecture) # label(non_clause).  [assumption].
0.96/1.25	19 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
0.96/1.25	21 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
0.96/1.25	25 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.96/1.25	33 between_c(c10,c11,c12,c13) # label(theorem_3_8_1) # label(negated_conjecture).  [clausify(18)].
0.96/1.25	38 A != B | -between_c(C,B,D,A) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.96/1.25	39 incident_c(A,B) | -end_point(A,B) # label(end_point_defn) # label(axiom).  [clausify(11)].
0.96/1.25	44 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(4)].
0.96/1.25	53 end_point(A,f14(B,A,C,D)) | -between_c(B,A,C,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.96/1.25	54 end_point(A,f14(B,C,D,A)) | -between_c(B,C,D,A) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.96/1.25	55 part_of(f14(A,B,C,D),A) | -between_c(A,B,C,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.96/1.25	67 -incident_c(c11,c10) | -incident_c(c13,c10) | c12 = c11 | c13 = c12 | c13 = c11 | -incident_c(c12,c10) # label(theorem_3_8_1) # label(negated_conjecture).  [clausify(18)].
0.96/1.25	77 -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(25,a,19,a)].
0.96/1.25	78 -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(25,a,21,a)].
0.96/1.25	101 c13 != c11.  [resolve(38,b,33,a)].
0.96/1.25	103 -incident_c(c11,c10) | -incident_c(c13,c10) | c12 = c11 | c13 = c12 | -incident_c(c12,c10).  [back_unit_del(67),unit_del(e,101)].
0.96/1.25	175 end_point(c11,f14(c10,c11,c12,c13)).  [resolve(53,b,33,a)].
0.96/1.25	176 end_point(c13,f14(c10,c11,c12,c13)).  [resolve(54,b,33,a)].
0.96/1.25	177 part_of(f14(c10,c11,c12,c13),c10).  [resolve(55,b,33,a)].
0.96/1.25	307 -end_point(c12,f14(c10,c11,c12,c13)).  [resolve(77,a,33,a)].
0.96/1.25	308 incident_c(c12,f14(c10,c11,c12,c13)).  [resolve(78,a,33,a)].
0.96/1.25	399 incident_c(c11,f14(c10,c11,c12,c13)).  [resolve(175,a,39,b)].
0.96/1.25	403 incident_c(c13,f14(c10,c11,c12,c13)).  [resolve(176,a,39,b)].
0.96/1.25	414 -incident_c(A,f14(c10,c11,c12,c13)) | incident_c(A,c10).  [resolve(177,a,44,c)].
0.96/1.25	1091 incident_c(c13,c10).  [resolve(414,a,403,a)].
0.96/1.25	1092 incident_c(c11,c10).  [resolve(414,a,399,a)].
0.96/1.25	1093 incident_c(c12,c10).  [resolve(414,a,308,a)].
0.96/1.25	1102 c12 = c11 | c13 = c12.  [back_unit_del(103),unit_del(a,1092),unit_del(b,1091),unit_del(e,1093)].
0.96/1.25	1173 c12 = c11.  [para(1102(b,1),176(a,1)),unit_del(b,307)].
0.96/1.25	1294 -end_point(c11,f14(c10,c11,c11,c13)).  [back_rewrite(307),rewrite([1173(1),1173(4)])].
0.96/1.25	1297 $F.  [back_rewrite(175),rewrite([1173(4)]),unit_del(a,1294)].
0.96/1.25	
0.96/1.25	% SZS output end Refutation
0.96/1.25	============================== end of proof ==========================
0.96/1.25	
0.96/1.25	============================== STATISTICS ============================
0.96/1.25	
0.96/1.25	Given=150. Generated=2124. Kept=1263. proofs=1.
0.96/1.25	Usable=133. Sos=800. Demods=6. Limbo=124, Disabled=274. Hints=0.
0.96/1.25	Megabytes=1.50.
0.96/1.25	User_CPU=0.22, System_CPU=0.01, Wall_clock=0.
0.96/1.25	
0.96/1.25	============================== end of statistics =====================
0.96/1.25	
0.96/1.25	============================== end of search =========================
0.96/1.25	
0.96/1.25	THEOREM PROVED
0.96/1.25	% SZS status Theorem
0.96/1.25	
0.96/1.25	Exiting with 1 proof.
0.96/1.25	
0.96/1.25	Process 22032 exit (max_proofs) Mon Jul  3 03:16:46 2023
0.96/1.25	Prover9 interrupted
0.96/1.25	EOF