0.03/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n028.cluster.edu
0.11/0.32	% Model      : x86_64 x86_64
0.11/0.32	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory     : 8042.1875MB
0.11/0.32	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 960
0.11/0.32	% DateTime   : Thu Jul  2 13:01:36 EDT 2020
0.11/0.32	% CPUTime    : 
0.39/1.07	============================== Prover9 ===============================
0.39/1.07	Prover9 (32) version 2009-11A, November 2009.
0.39/1.07	Process 10360 was started by sandbox2 on n028.cluster.edu,
0.39/1.07	Thu Jul  2 13:01:37 2020
0.39/1.07	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_10207_n028.cluster.edu".
0.39/1.07	============================== end of head ===========================
0.39/1.07	
0.39/1.07	============================== INPUT =================================
0.39/1.07	
0.39/1.07	% Reading from file /tmp/Prover9_10207_n028.cluster.edu
0.39/1.07	
0.39/1.07	set(prolog_style_variables).
0.39/1.07	set(auto2).
0.39/1.07	    % set(auto2) -> set(auto).
0.39/1.07	    % set(auto) -> set(auto_inference).
0.39/1.07	    % set(auto) -> set(auto_setup).
0.39/1.07	    % set(auto_setup) -> set(predicate_elim).
0.39/1.07	    % set(auto_setup) -> assign(eq_defs, unfold).
0.39/1.07	    % set(auto) -> set(auto_limits).
0.39/1.07	    % set(auto_limits) -> assign(max_weight, "100.000").
0.39/1.07	    % set(auto_limits) -> assign(sos_limit, 20000).
0.39/1.07	    % set(auto) -> set(auto_denials).
0.39/1.07	    % set(auto) -> set(auto_process).
0.39/1.07	    % set(auto2) -> assign(new_constants, 1).
0.39/1.07	    % set(auto2) -> assign(fold_denial_max, 3).
0.39/1.07	    % set(auto2) -> assign(max_weight, "200.000").
0.39/1.07	    % set(auto2) -> assign(max_hours, 1).
0.39/1.07	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.39/1.07	    % set(auto2) -> assign(max_seconds, 0).
0.39/1.07	    % set(auto2) -> assign(max_minutes, 5).
0.39/1.07	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.39/1.07	    % set(auto2) -> set(sort_initial_sos).
0.39/1.07	    % set(auto2) -> assign(sos_limit, -1).
0.39/1.07	    % set(auto2) -> assign(lrs_ticks, 3000).
0.39/1.07	    % set(auto2) -> assign(max_megs, 400).
0.39/1.07	    % set(auto2) -> assign(stats, some).
0.39/1.07	    % set(auto2) -> clear(echo_input).
0.39/1.07	    % set(auto2) -> set(quiet).
0.39/1.07	    % set(auto2) -> clear(print_initial_clauses).
0.39/1.07	    % set(auto2) -> clear(print_given).
0.39/1.07	assign(lrs_ticks,-1).
0.39/1.07	assign(sos_limit,10000).
0.39/1.07	assign(order,kbo).
0.39/1.07	set(lex_order_vars).
0.39/1.07	clear(print_given).
0.39/1.07	
0.39/1.07	% formulas(sos).  % not echoed (17 formulas)
0.39/1.07	
0.39/1.07	============================== end of input ==========================
0.39/1.07	
0.39/1.07	% From the command line: assign(max_seconds, 960).
0.39/1.07	
0.39/1.07	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.39/1.07	
0.39/1.07	% Formulas that are not ordinary clauses:
0.39/1.07	1 (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.39/1.07	2 (all P all C all C1 (incident_c(P,C1) & (all Q (incident_c(Q,C1) & incident_c(Q,C) -> end_point(Q,C) & end_point(Q,C1))) & incident_c(P,C) <-> meet(P,C,C1))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	3 (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.39/1.07	4 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (sum(C1,C2) = C & meet(P,C1,C2))))) # label(c4) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	5 (all P all C ((all C1 all C2 (part_of(C1,C) & incident_c(P,C2) & part_of(C2,C) & incident_c(P,C1) -> part_of(C2,C1) | part_of(C1,C2))) & incident_c(P,C) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	6 (all C all C1 all C2 all C3 ((exists P (end_point(P,C1) & end_point(P,C2) & end_point(P,C3))) & part_of(C3,C) & part_of(C2,C) & part_of(C1,C) -> part_of(C1,C2) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C1) | part_of(C3,C2) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	7 (all C all P all Q all R (end_point(P,C) & end_point(Q,C) & end_point(R,C) -> Q = R | P = R | Q = P)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	9 (all C all C1 all C2 all P (closed(C) & meet(P,C1,C2) & sum(C1,C2) = C -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	10 (all C all P (end_point(P,C) -> (exists Q (Q != P & end_point(Q,C))))) # label(c6) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	11 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.39/1.07	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].
3.22/3.51	13 (all C all C1 all C2 ((all Q (incident_c(Q,C1) | incident_c(Q,C2) <-> incident_c(Q,C))) <-> sum(C1,C2) = C)) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
3.22/3.51	14 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
3.22/3.51	15 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
3.22/3.51	16 (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].
3.22/3.51	17 -(all C all Cpp all P (end_point(P,C) & incident_c(P,Cpp) & part_of(Cpp,C) -> end_point(P,Cpp))) # label(theorem_2_10) # label(negated_conjecture) # label(non_clause).  [assumption].
3.22/3.51	
3.22/3.51	============================== end of process non-clausal formulas ===
3.22/3.51	
3.22/3.51	============================== PROCESS INITIAL CLAUSES ===============
3.22/3.51	
3.22/3.51	============================== PREDICATE ELIMINATION =================
3.22/3.51	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
3.22/3.51	19 inner_point(f12(A),A) # label(c3) # label(axiom).  [clausify(14)].
3.22/3.51	Derived: -end_point(f12(A),A).  [resolve(18,a,19,a)].
3.22/3.51	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
3.22/3.51	Derived: incident_c(f12(A),A).  [resolve(20,a,19,a)].
3.22/3.51	21 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
3.22/3.51	22 -inner_point(A,B) | meet(A,f4(B,A),f5(B,A)) # label(c4) # label(axiom).  [clausify(4)].
3.22/3.51	Derived: meet(f12(A),f4(A,f12(A)),f5(A,f12(A))).  [resolve(22,a,19,a)].
3.22/3.51	Derived: meet(A,f4(B,A),f5(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,a)].
3.22/3.51	23 -inner_point(A,B) | sum(f4(B,A),f5(B,A)) = B # label(c4) # label(axiom).  [clausify(4)].
3.22/3.51	Derived: sum(f4(A,f12(A)),f5(A,f12(A))) = A.  [resolve(23,a,19,a)].
3.22/3.51	Derived: sum(f4(A,B),f5(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,a)].
3.22/3.51	24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(11)].
3.22/3.51	25 closed(A) | end_point(f9(A),A) # label(closed_defn) # label(axiom).  [clausify(11)].
3.22/3.51	Derived: -end_point(A,B) | end_point(f9(B),B).  [resolve(24,a,25,a)].
3.22/3.51	26 -closed(A) | -meet(B,C,D) | sum(C,D) != A | -end_point(E,C) | meet(E,C,D) # label(c7) # label(axiom).  [clausify(9)].
3.22/3.51	Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f9(D),D).  [resolve(26,a,25,a)].
3.22/3.51	27 end_point(f13(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(15)].
3.22/3.51	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(15)].
3.22/3.51	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
3.22/3.51	29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(8)].
3.22/3.51	Derived: -part_of(A,B) | A = B | end_point(f13(A),A).  [resolve(29,c,27,b)].
3.22/3.51	
3.22/3.51	============================== end predicate elimination =============
3.22/3.51	
3.22/3.51	Auto_denials:  (non-Horn, no changes).
3.22/3.51	
3.22/3.51	Term ordering decisions:
3.22/3.51	Function symbol KB weights:  c10=1. c11=1. c12=1. sum=1. f1=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f10=1. f9=1. f12=1. f13=1. f2=1. f11=1.
3.22/3.51	
3.22/3.51	============================== end of process initial clauses ========
3.22/3.51	
3.22/3.51	============================== CLAUSES FOR SEARCH ====================
3.22/3.51	
3.22/3.51	============================== end of clauses for search =============
3.22/3.51	
3.22/3.51	============================== SEARCH ================================
3.22/3.51	
3.22/3.51	% Starting search at 0.01 seconds.
3.22/3.51	
3.22/3.51	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 47 (0.00 of 0.86 sec).
3.22/3.51	
3.22/3.51	Low Water (keep): wt=39.000, iters=3441
3.22/3.51	
3.22/3.51	Low Water (keep): wt=34.000, iters=3349
3.22/3.51	
3.22/3.51	Low Water (keep): wt=33.000, iters=3335
3.22/3.51	
3.22/3.51	Low Water (keep): wt=30.000, iters=3339
3.22/3.51	
3.22/3.51	Low Water (keep): wt=29.000, iters=3335
3.22/3.51	
3.22/3.51	Low Water (keep): wt=27.000, iters=3364
3.22/3.51	
3.22/3.51	Low Water (keep): wt=26.000, iters=3371
3.22/3.51	
3.22/3.51	Low Water (keep): wt=25.000, iters=3340
3.22/3.51	
3.22/3.51	Low Water (keep): wt=24.000, iters=3344
3.22/3.51	
3.22/3.51	Low Water (keep): wt=23.000, iters=3358
3.22/3.51	
3.22/3.51	Low Water (Alarm clock 
119.50/120.06	Prover9 interrupted
119.50/120.07	EOF