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.12/0.33	% Computer   : n004.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   : 180
0.12/0.33	% DateTime   : Thu Aug 29 13:27:23 EDT 2019
0.12/0.33	% CPUTime    : 
0.41/1.03	============================== Prover9 ===============================
0.41/1.03	Prover9 (32) version 2009-11A, November 2009.
0.41/1.03	Process 9547 was started by sandbox2 on n004.cluster.edu,
0.41/1.03	Thu Aug 29 13:27:23 2019
0.41/1.03	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_9377_n004.cluster.edu".
0.41/1.03	============================== end of head ===========================
0.41/1.03	
0.41/1.03	============================== INPUT =================================
0.41/1.03	
0.41/1.03	% Reading from file /tmp/Prover9_9377_n004.cluster.edu
0.41/1.03	
0.41/1.03	set(prolog_style_variables).
0.41/1.03	set(auto2).
0.41/1.03	    % set(auto2) -> set(auto).
0.41/1.03	    % set(auto) -> set(auto_inference).
0.41/1.03	    % set(auto) -> set(auto_setup).
0.41/1.03	    % set(auto_setup) -> set(predicate_elim).
0.41/1.03	    % set(auto_setup) -> assign(eq_defs, unfold).
0.41/1.03	    % set(auto) -> set(auto_limits).
0.41/1.03	    % set(auto_limits) -> assign(max_weight, "100.000").
0.41/1.03	    % set(auto_limits) -> assign(sos_limit, 20000).
0.41/1.03	    % set(auto) -> set(auto_denials).
0.41/1.03	    % set(auto) -> set(auto_process).
0.41/1.03	    % set(auto2) -> assign(new_constants, 1).
0.41/1.03	    % set(auto2) -> assign(fold_denial_max, 3).
0.41/1.03	    % set(auto2) -> assign(max_weight, "200.000").
0.41/1.03	    % set(auto2) -> assign(max_hours, 1).
0.41/1.03	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.41/1.03	    % set(auto2) -> assign(max_seconds, 0).
0.41/1.03	    % set(auto2) -> assign(max_minutes, 5).
0.41/1.03	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.41/1.03	    % set(auto2) -> set(sort_initial_sos).
0.41/1.03	    % set(auto2) -> assign(sos_limit, -1).
0.41/1.03	    % set(auto2) -> assign(lrs_ticks, 3000).
0.41/1.03	    % set(auto2) -> assign(max_megs, 400).
0.41/1.03	    % set(auto2) -> assign(stats, some).
0.41/1.03	    % set(auto2) -> clear(echo_input).
0.41/1.03	    % set(auto2) -> set(quiet).
0.41/1.03	    % set(auto2) -> clear(print_initial_clauses).
0.41/1.03	    % set(auto2) -> clear(print_given).
0.41/1.03	assign(lrs_ticks,-1).
0.41/1.03	assign(sos_limit,10000).
0.41/1.03	assign(order,kbo).
0.41/1.03	set(lex_order_vars).
0.41/1.03	clear(print_given).
0.41/1.03	
0.41/1.03	% formulas(sos).  % not echoed (17 formulas)
0.41/1.03	
0.41/1.03	============================== end of input ==========================
0.41/1.03	
0.41/1.03	% From the command line: assign(max_seconds, 180).
0.41/1.03	
0.41/1.03	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.41/1.03	
0.41/1.03	% Formulas that are not ordinary clauses:
0.41/1.03	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.41/1.03	2 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.41/1.03	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.41/1.03	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.41/1.03	5 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.41/1.03	6 (all C all C1 (C != C1 & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.41/1.03	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.41/1.03	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.41/1.03	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.41/1.03	10 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.41/1.03	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.41/1.03	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.41/1.03	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].
1.88/2.19	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].
1.88/2.19	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].
1.88/2.19	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].
1.88/2.19	17 -(all C all Cpp all P (incident_c(P,Cpp) & end_point(P,C) & part_of(Cpp,C) -> end_point(P,Cpp))) # label(theorem_2_10) # label(negated_conjecture) # label(non_clause).  [assumption].
1.88/2.19	
1.88/2.19	============================== end of process non-clausal formulas ===
1.88/2.19	
1.88/2.19	============================== PROCESS INITIAL CLAUSES ===============
1.88/2.19	
1.88/2.19	============================== PREDICATE ELIMINATION =================
1.88/2.19	18 -end_point(A,B) | -inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
1.88/2.19	19 inner_point(f7(A),A) # label(c3) # label(axiom).  [clausify(10)].
1.88/2.19	Derived: -end_point(f7(A),A).  [resolve(18,b,19,a)].
1.88/2.19	20 incident_c(A,B) | -inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
1.88/2.19	Derived: incident_c(f7(A),A).  [resolve(20,b,19,a)].
1.88/2.19	21 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
1.88/2.19	22 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom).  [clausify(13)].
1.88/2.19	Derived: meet(f7(A),f9(A,f7(A)),f10(A,f7(A))).  [resolve(22,a,19,a)].
1.88/2.19	Derived: meet(A,f9(B,A),f10(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,c)].
1.88/2.19	23 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom).  [clausify(13)].
1.88/2.19	Derived: sum(f9(A,f7(A)),f10(A,f7(A))) = A.  [resolve(23,a,19,a)].
1.88/2.19	Derived: sum(f9(A,B),f10(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,c)].
1.88/2.19	24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(5)].
1.88/2.19	25 end_point(f4(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(5)].
1.88/2.19	Derived: -end_point(A,B) | end_point(f4(B),B).  [resolve(24,b,25,b)].
1.88/2.19	26 sum(A,B) != C | -meet(D,A,B) | -closed(C) | -end_point(E,A) | meet(E,A,B) # label(c7) # label(axiom).  [clausify(11)].
1.88/2.19	Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f4(C),C).  [resolve(26,c,25,b)].
1.88/2.19	27 end_point(f1(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(2)].
1.88/2.19	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(2)].
1.88/2.19	Derived: end_point(f1(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
1.88/2.19	29 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom).  [clausify(6)].
1.88/2.19	Derived: A = B | -part_of(A,B) | end_point(f1(A),A).  [resolve(29,c,27,b)].
1.88/2.19	
1.88/2.19	============================== end predicate elimination =============
1.88/2.19	
1.88/2.19	Auto_denials:  (non-Horn, no changes).
1.88/2.19	
1.88/2.19	Term ordering decisions:
1.88/2.19	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. f1=1. f4=1. f7=1. f2=1. f13=1.
1.88/2.19	
1.88/2.19	============================== end of process initial clauses ========
1.88/2.19	
1.88/2.19	============================== CLAUSES FOR SEARCH ====================
1.88/2.19	
1.88/2.19	============================== end of clauses for search =============
1.88/2.19	
1.88/2.19	============================== SEARCH ================================
1.88/2.19	
1.88/2.19	% Starting search at 0.02 seconds.
1.88/2.19	
1.88/2.19	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 47 (0.00 of 0.52 sec).
1.88/2.19	
1.88/2.19	Low Water (keep): wt=39.000, iters=3441
1.88/2.19	
1.88/2.19	Low Water (keep): wt=34.000, iters=3349
1.88/2.19	
1.88/2.19	Low Water (keep): wt=33.000, iters=3335
1.88/2.19	
1.88/2.19	Low Water (keep): wt=30.000, iters=3339
1.88/2.19	
1.88/2.19	Low Water (keep): wt=29.000, iters=3335
1.88/2.19	
1.88/2.19	Low Water (keep): wt=27.000, iters=3364
1.88/2.19	
1.88/2.19	Low Water (keep): wt=26.000, iters=3371
1.88/2.19	
1.88/2.19	Low Water (keep): wt=25.000, iters=3340
1.88/2.19	
1.88/2.19	Low Water (keep): wt=24.000, iters=3386
1.88/2.19	
1.88/2.19	Low Water (keep): wt=23.000, iters=3358
1.88/2.19	
1.88/2.19	Low Water (keep): wtCputime limit exceeded (core dumped)
180.04/180.33	EOF