0.00/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.33	% Computer : n029.cluster.edu
0.13/0.33	% Model    : x86_64 x86_64
0.13/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.33	% Memory   : 8042.1875MB
0.13/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.33	% CPULimit : 1440
0.13/0.33	% WCLimit  : 180
0.13/0.33	% DateTime : Mon Jul  3 09:12:57 EDT 2023
0.13/0.34	% CPUTime  : 
0.75/1.02	============================== Prover9 ===============================
0.75/1.02	Prover9 (32) version 2009-11A, November 2009.
0.75/1.02	Process 20856 was started by sandbox2 on n029.cluster.edu,
0.75/1.02	Mon Jul  3 09:12:58 2023
0.75/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_20701_n029.cluster.edu".
0.75/1.02	============================== end of head ===========================
0.75/1.02	
0.75/1.02	============================== INPUT =================================
0.75/1.02	
0.75/1.02	% Reading from file /tmp/Prover9_20701_n029.cluster.edu
0.75/1.02	
0.75/1.02	set(prolog_style_variables).
0.75/1.02	set(auto2).
0.75/1.02	    % set(auto2) -> set(auto).
0.75/1.02	    % set(auto) -> set(auto_inference).
0.75/1.02	    % set(auto) -> set(auto_setup).
0.75/1.02	    % set(auto_setup) -> set(predicate_elim).
0.75/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.02	    % set(auto) -> set(auto_limits).
0.75/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.02	    % set(auto) -> set(auto_denials).
0.75/1.02	    % set(auto) -> set(auto_process).
0.75/1.02	    % set(auto2) -> assign(new_constants, 1).
0.75/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.02	    % set(auto2) -> assign(max_hours, 1).
0.75/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.02	    % set(auto2) -> set(sort_initial_sos).
0.75/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.02	    % set(auto2) -> assign(max_megs, 400).
0.75/1.02	    % set(auto2) -> assign(stats, some).
0.75/1.02	    % set(auto2) -> clear(echo_input).
0.75/1.02	    % set(auto2) -> set(quiet).
0.75/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.02	    % set(auto2) -> clear(print_given).
0.75/1.02	assign(lrs_ticks,-1).
0.75/1.02	assign(sos_limit,10000).
0.75/1.02	assign(order,kbo).
0.75/1.02	set(lex_order_vars).
0.75/1.02	clear(print_given).
0.75/1.02	
0.75/1.02	% formulas(sos).  % not echoed (17 formulas)
0.75/1.02	
0.75/1.02	============================== end of input ==========================
0.75/1.02	
0.75/1.02	% From the command line: assign(max_seconds, 1440).
0.75/1.02	
0.75/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.02	
0.75/1.02	% Formulas that are not ordinary clauses:
0.75/1.02	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.75/1.02	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.75/1.02	3 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	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.75/1.02	5 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	6 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.75/1.02	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.75/1.02	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.75/1.02	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.75/1.02	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.75/1.02	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.75/1.02	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.75/1.02	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].
2.43/2.71	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].
2.43/2.71	15 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
2.43/2.71	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].
2.43/2.71	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].
2.43/2.71	
2.43/2.71	============================== end of process non-clausal formulas ===
2.43/2.71	
2.43/2.71	============================== PROCESS INITIAL CLAUSES ===============
2.43/2.71	
2.43/2.71	============================== PREDICATE ELIMINATION =================
2.43/2.71	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
2.43/2.71	19 inner_point(f2(A),A) # label(c3) # label(axiom).  [clausify(3)].
2.43/2.71	Derived: -end_point(f2(A),A).  [resolve(18,a,19,a)].
2.43/2.71	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
2.43/2.71	Derived: incident_c(f2(A),A).  [resolve(20,a,19,a)].
2.43/2.71	21 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
2.43/2.71	22 -inner_point(A,B) | meet(A,f11(B,A),f12(B,A)) # label(c4) # label(axiom).  [clausify(14)].
2.43/2.71	Derived: meet(f2(A),f11(A,f2(A)),f12(A,f2(A))).  [resolve(22,a,19,a)].
2.43/2.71	Derived: meet(A,f11(B,A),f12(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,a)].
2.43/2.71	23 -inner_point(A,B) | sum(f11(B,A),f12(B,A)) = B # label(c4) # label(axiom).  [clausify(14)].
2.43/2.71	Derived: sum(f11(A,f2(A)),f12(A,f2(A))) = A.  [resolve(23,a,19,a)].
2.43/2.71	Derived: sum(f11(A,B),f12(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,a)].
2.43/2.71	24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(15)].
2.43/2.71	25 end_point(f13(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(15)].
2.43/2.71	Derived: -end_point(A,B) | end_point(f13(B),B).  [resolve(24,b,25,b)].
2.43/2.71	26 sum(A,B) != C | -meet(D,A,B) | -closed(C) | -end_point(E,A) | meet(E,A,B) # label(c7) # label(axiom).  [clausify(2)].
2.43/2.71	Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f13(C),C).  [resolve(26,c,25,b)].
2.43/2.71	27 end_point(f4(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(5)].
2.43/2.71	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(5)].
2.43/2.71	Derived: end_point(f4(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
2.43/2.71	29 -part_of(A,B) | B = A | open(A) # label(c1) # label(axiom).  [clausify(6)].
2.43/2.71	Derived: -part_of(A,B) | B = A | end_point(f4(A),A).  [resolve(29,c,27,b)].
2.43/2.71	
2.43/2.71	============================== end predicate elimination =============
2.43/2.71	
2.43/2.71	Auto_denials:  (non-Horn, no changes).
2.43/2.71	
2.43/2.71	Term ordering decisions:
2.43/2.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. f2=1. f4=1. f13=1. f6=1. f10=1.
2.43/2.71	
2.43/2.71	============================== end of process initial clauses ========
2.43/2.71	
2.43/2.71	============================== CLAUSES FOR SEARCH ====================
2.43/2.71	
2.43/2.71	============================== end of clauses for search =============
2.43/2.71	
2.43/2.71	============================== SEARCH ================================
2.43/2.71	
2.43/2.71	% Starting search at 0.02 seconds.
2.43/2.71	
2.43/2.71	NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 47 (0.00 of 0.67 sec).
2.43/2.71	
2.43/2.71	Low Water (keep): wt=39.000, iters=3441
2.43/2.71	
2.43/2.71	Low Water (keep): wt=34.000, iters=3349
2.43/2.71	
2.43/2.71	Low Water (keep): wt=33.000, iters=3335
2.43/2.71	
2.43/2.71	Low Water (keep): wt=30.000, iters=3339
2.43/2.71	
2.43/2.71	Low Water (keep): wt=29.000, iters=3335
2.43/2.71	
2.43/2.71	Low Water (keep): wt=27.000, iters=3364
2.43/2.71	
2.43/2.71	Low Water (keep): wt=26.000, iters=3371
2.43/2.71	
2.43/2.71	Low Water (keep): wt=25.000, iters=3340
2.43/2.71	
2.43/2.71	Low Water (keep): wt=24.000, iters=3344
2.43/2.71	
2.43/2.71	Low Water (keep): wt=23.000, iters=3358
2.43/2.71	
2.43/2.71	Low WaterAlarm clock 
179.75/180.02	Prover9 interrupted
179.75/180.03	EOF