0.07/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.14/0.33	% Computer : n015.cluster.edu
0.14/0.33	% Model    : x86_64 x86_64
0.14/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.33	% Memory   : 8042.1875MB
0.14/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.33	% CPULimit : 960
0.14/0.33	% WCLimit  : 120
0.14/0.33	% DateTime : Tue Aug  9 05:20:41 EDT 2022
0.14/0.33	% CPUTime  : 
0.45/1.03	============================== Prover9 ===============================
0.45/1.03	Prover9 (32) version 2009-11A, November 2009.
0.45/1.03	Process 14767 was started by sandbox on n015.cluster.edu,
0.45/1.03	Tue Aug  9 05:20:42 2022
0.45/1.03	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_14360_n015.cluster.edu".
0.45/1.03	============================== end of head ===========================
0.45/1.03	
0.45/1.03	============================== INPUT =================================
0.45/1.03	
0.45/1.03	% Reading from file /tmp/Prover9_14360_n015.cluster.edu
0.45/1.03	
0.45/1.03	set(prolog_style_variables).
0.45/1.03	set(auto2).
0.45/1.03	    % set(auto2) -> set(auto).
0.45/1.03	    % set(auto) -> set(auto_inference).
0.45/1.03	    % set(auto) -> set(auto_setup).
0.45/1.03	    % set(auto_setup) -> set(predicate_elim).
0.45/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.45/1.03	    % set(auto) -> set(auto_limits).
0.45/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.45/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.45/1.03	    % set(auto) -> set(auto_denials).
0.45/1.03	    % set(auto) -> set(auto_process).
0.45/1.03	    % set(auto2) -> assign(new_constants, 1).
0.45/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.45/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.45/1.03	    % set(auto2) -> assign(max_hours, 1).
0.45/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.45/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.45/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.45/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.45/1.03	    % set(auto2) -> set(sort_initial_sos).
0.45/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.45/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.45/1.03	    % set(auto2) -> assign(max_megs, 400).
0.45/1.03	    % set(auto2) -> assign(stats, some).
0.45/1.03	    % set(auto2) -> clear(echo_input).
0.45/1.03	    % set(auto2) -> set(quiet).
0.45/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.45/1.03	    % set(auto2) -> clear(print_given).
0.45/1.03	assign(lrs_ticks,-1).
0.45/1.03	assign(sos_limit,10000).
0.45/1.03	assign(order,kbo).
0.45/1.03	set(lex_order_vars).
0.45/1.03	clear(print_given).
0.45/1.03	
0.45/1.03	% formulas(sos).  % not echoed (17 formulas)
0.45/1.03	
0.45/1.03	============================== end of input ==========================
0.45/1.03	
0.45/1.03	% From the command line: assign(max_seconds, 960).
0.45/1.03	
0.45/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.45/1.03	
0.45/1.03	% Formulas that are not ordinary clauses:
0.45/1.03	1 (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.45/1.03	2 (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.45/1.03	3 (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.45/1.03	4 (all C all P all Q all R (end_point(Q,C) & end_point(R,C) & end_point(P,C) -> P = R | R = Q | Q = P)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	5 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C3,C) & (exists P (end_point(P,C3) & end_point(P,C2) & end_point(P,C1))) & part_of(C2,C) -> part_of(C3,C2) | part_of(C1,C2) | part_of(C2,C1) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	7 (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.45/1.03	8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	9 (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,C1) & end_point(Q,C))))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	10 (all C all C1 all C2 all P (meet(P,C1,C2) & sum(C1,C2) = C & closed(C) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	11 (all C all P (end_point(P,C) -> (exists Q (end_point(Q,C) & P != Q)))) # label(c6) # label(axiom) # label(non_clause).  [assumption].
0.45/1.03	12 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))))) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
2.14/2.45	13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
2.14/2.45	14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
2.14/2.45	15 (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].
2.14/2.45	16 (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(C2,C1) | part_of(C1,C2))) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause).  [assumption].
2.14/2.45	17 -(all C all Cpp all P (part_of(Cpp,C) & end_point(P,C) & incident_c(P,Cpp) -> end_point(P,Cpp))) # label(theorem_2_10) # label(negated_conjecture) # label(non_clause).  [assumption].
2.14/2.45	
2.14/2.45	============================== end of process non-clausal formulas ===
2.14/2.45	
2.14/2.45	============================== PROCESS INITIAL CLAUSES ===============
2.14/2.45	
2.14/2.45	============================== PREDICATE ELIMINATION =================
2.14/2.45	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.14/2.45	19 inner_point(f9(A),A) # label(c3) # label(axiom).  [clausify(13)].
2.14/2.45	Derived: -end_point(f9(A),A).  [resolve(18,a,19,a)].
2.14/2.45	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.14/2.45	Derived: incident_c(f9(A),A).  [resolve(20,a,19,a)].
2.14/2.45	21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.14/2.45	22 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom).  [clausify(15)].
2.14/2.45	Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))).  [resolve(22,a,19,a)].
2.14/2.45	Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(22,a,21,a)].
2.14/2.45	23 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom).  [clausify(15)].
2.14/2.45	Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A.  [resolve(23,a,19,a)].
2.14/2.45	Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(23,a,21,a)].
2.14/2.45	24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(8)].
2.14/2.45	25 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom).  [clausify(8)].
2.14/2.45	Derived: -end_point(A,B) | end_point(f5(B),B).  [resolve(24,a,25,a)].
2.14/2.45	26 -meet(A,B,C) | sum(B,C) != D | -closed(D) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom).  [clausify(10)].
2.14/2.45	Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f5(D),D).  [resolve(26,c,25,a)].
2.14/2.45	27 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(6)].
2.14/2.45	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(6)].
2.14/2.45	Derived: end_point(f3(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
2.14/2.45	29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(14)].
2.14/2.45	Derived: -part_of(A,B) | A = B | end_point(f3(A),A).  [resolve(29,c,27,b)].
2.14/2.45	
2.14/2.45	============================== end predicate elimination =============
2.14/2.45	
2.14/2.45	Auto_denials:  (non-Horn, no changes).
2.14/2.45	
2.14/2.45	Term ordering decisions:
2.14/2.45	Function symbol KB weights:  c10=1. c11=1. c12=1. sum=1. f1=1. f2=1. f4=1. f7=1. f10=1. f11=1. f12=1. f13=1. f3=1. f5=1. f9=1. f6=1. f8=1.
2.14/2.45	
2.14/2.45	============================== end of process initial clauses ========
2.14/2.45	
2.14/2.45	============================== CLAUSES FOR SEARCH ====================
2.14/2.45	
2.14/2.45	============================== end of clauses for search =============
2.14/2.45	
2.14/2.45	============================== SEARCH ================================
2.14/2.45	
2.14/2.45	% Starting search at 0.02 seconds.
2.14/2.45	
2.14/2.45	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 57 (0.00 of 0.69 sec).
2.14/2.45	
2.14/2.45	Low Water (keep): wt=49.000, iters=3362
2.14/2.45	
2.14/2.45	Low Water (keep): wt=39.000, iters=3349
2.14/2.45	
2.14/2.45	Low Water (keep): wt=36.000, iters=3350
2.14/2.45	
2.14/2.45	Low Water (keep): wt=34.000, iters=3348
2.14/2.45	
2.14/2.45	Low Water (keep): wt=33.000, iters=3335
2.14/2.45	
2.14/2.45	Low Water (keep): wt=30.000, iters=3334
2.14/2.45	
2.14/2.45	Low Water (keep): wt=29.000, iters=3343
2.14/2.45	
2.14/2.45	Low Water (keep): wt=28.000, iters=3468
2.14/2.45	
2.14/2.45	Low Water (keep): wt=27.000, iters=3372
2.14/2.45	
2.14/2.45	Low Water (keep): wt=26.000, iters=3411
2.14/2.45	
2.14/2.45	Low Water (keepAlarm clock 
119.69/120.03	Prover9 interrupted
119.69/120.03	EOF