0.03/0.12	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command  : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer : n006.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 11:02:06 EDT 2023
0.13/0.34	% CPUTime  : 
0.82/1.13	============================== Prover9 ===============================
0.82/1.13	Prover9 (32) version 2009-11A, November 2009.
0.82/1.13	Process 29548 was started by sandbox2 on n006.cluster.edu,
0.82/1.13	Mon Jul  3 11:02:07 2023
0.82/1.13	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1440 -f /tmp/Prover9_29390_n006.cluster.edu".
0.82/1.13	============================== end of head ===========================
0.82/1.13	
0.82/1.13	============================== INPUT =================================
0.82/1.13	
0.82/1.13	% Reading from file /tmp/Prover9_29390_n006.cluster.edu
0.82/1.13	
0.82/1.13	set(prolog_style_variables).
0.82/1.13	set(auto2).
0.82/1.13	    % set(auto2) -> set(auto).
0.82/1.13	    % set(auto) -> set(auto_inference).
0.82/1.13	    % set(auto) -> set(auto_setup).
0.82/1.13	    % set(auto_setup) -> set(predicate_elim).
0.82/1.13	    % set(auto_setup) -> assign(eq_defs, unfold).
0.82/1.13	    % set(auto) -> set(auto_limits).
0.82/1.13	    % set(auto_limits) -> assign(max_weight, "100.000").
0.82/1.13	    % set(auto_limits) -> assign(sos_limit, 20000).
0.82/1.13	    % set(auto) -> set(auto_denials).
0.82/1.13	    % set(auto) -> set(auto_process).
0.82/1.13	    % set(auto2) -> assign(new_constants, 1).
0.82/1.13	    % set(auto2) -> assign(fold_denial_max, 3).
0.82/1.13	    % set(auto2) -> assign(max_weight, "200.000").
0.82/1.13	    % set(auto2) -> assign(max_hours, 1).
0.82/1.13	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.82/1.13	    % set(auto2) -> assign(max_seconds, 0).
0.82/1.13	    % set(auto2) -> assign(max_minutes, 5).
0.82/1.13	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.82/1.13	    % set(auto2) -> set(sort_initial_sos).
0.82/1.13	    % set(auto2) -> assign(sos_limit, -1).
0.82/1.13	    % set(auto2) -> assign(lrs_ticks, 3000).
0.82/1.13	    % set(auto2) -> assign(max_megs, 400).
0.82/1.13	    % set(auto2) -> assign(stats, some).
0.82/1.13	    % set(auto2) -> clear(echo_input).
0.82/1.13	    % set(auto2) -> set(quiet).
0.82/1.13	    % set(auto2) -> clear(print_initial_clauses).
0.82/1.13	    % set(auto2) -> clear(print_given).
0.82/1.13	assign(lrs_ticks,-1).
0.82/1.13	assign(sos_limit,10000).
0.82/1.13	assign(order,kbo).
0.82/1.13	set(lex_order_vars).
0.82/1.13	clear(print_given).
0.82/1.13	
0.82/1.13	% formulas(sos).  % not echoed (17 formulas)
0.82/1.13	
0.82/1.13	============================== end of input ==========================
0.82/1.13	
0.82/1.13	% From the command line: assign(max_seconds, 1440).
0.82/1.13	
0.82/1.13	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.82/1.13	
0.82/1.13	% Formulas that are not ordinary clauses:
0.82/1.13	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.82/1.13	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.82/1.13	3 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	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.82/1.13	5 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	6 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.82/1.13	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.82/1.13	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.82/1.13	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.82/1.13	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.82/1.13	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.82/1.13	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.82/1.13	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].
8.67/8.98	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].
8.67/8.98	15 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
8.67/8.98	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].
8.67/8.98	17 -(all C1 all C2 all Cpp all P (part_of(C2,C1) & incident_c(P,C2) & meet(P,C1,Cpp) -> meet(P,C2,Cpp))) # label(corollary_2_12) # label(negated_conjecture) # label(non_clause).  [assumption].
8.67/8.98	
8.67/8.98	============================== end of process non-clausal formulas ===
8.67/8.98	
8.67/8.98	============================== PROCESS INITIAL CLAUSES ===============
8.67/8.98	
8.67/8.98	============================== PREDICATE ELIMINATION =================
8.67/8.98	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
8.67/8.98	19 inner_point(f2(A),A) # label(c3) # label(axiom).  [clausify(3)].
8.67/8.98	Derived: -end_point(f2(A),A).  [resolve(18,a,19,a)].
8.67/8.98	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
8.67/8.98	Derived: incident_c(f2(A),A).  [resolve(20,a,19,a)].
8.67/8.98	21 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(7)].
8.67/8.98	22 -inner_point(A,B) | meet(A,f11(B,A),f12(B,A)) # label(c4) # label(axiom).  [clausify(14)].
8.67/8.98	Derived: meet(f2(A),f11(A,f2(A)),f12(A,f2(A))).  [resolve(22,a,19,a)].
8.67/8.98	Derived: meet(A,f11(B,A),f12(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,a)].
8.67/8.98	23 -inner_point(A,B) | sum(f11(B,A),f12(B,A)) = B # label(c4) # label(axiom).  [clausify(14)].
8.67/8.98	Derived: sum(f11(A,f2(A)),f12(A,f2(A))) = A.  [resolve(23,a,19,a)].
8.67/8.98	Derived: sum(f11(A,B),f12(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,a)].
8.67/8.98	24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(15)].
8.67/8.98	25 end_point(f13(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(15)].
8.67/8.98	Derived: -end_point(A,B) | end_point(f13(B),B).  [resolve(24,b,25,b)].
8.67/8.98	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)].
8.67/8.98	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)].
8.67/8.98	27 end_point(f4(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(5)].
8.67/8.98	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(5)].
8.67/8.98	Derived: end_point(f4(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
8.67/8.98	29 -part_of(A,B) | B = A | open(A) # label(c1) # label(axiom).  [clausify(6)].
8.67/8.98	Derived: -part_of(A,B) | B = A | end_point(f4(A),A).  [resolve(29,c,27,b)].
8.67/8.98	
8.67/8.98	============================== end predicate elimination =============
8.67/8.98	
8.67/8.98	Auto_denials:  (non-Horn, no changes).
8.67/8.98	
8.67/8.98	Term ordering decisions:
8.67/8.98	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.
8.67/8.98	
8.67/8.98	============================== end of process initial clauses ========
8.67/8.98	
8.67/8.98	============================== CLAUSES FOR SEARCH ====================
8.67/8.98	
8.67/8.98	============================== end of clauses for search =============
8.67/8.98	
8.67/8.98	============================== SEARCH ================================
8.67/8.98	
8.67/8.98	% Starting search at 0.01 seconds.
8.67/8.98	
8.67/8.98	Low Water (keep): wt=52.000, iters=3336
8.67/8.98	
8.67/8.98	Low Water (keep): wt=30.000, iters=3351
8.67/8.98	
8.67/8.98	Low Water (keep): wt=29.000, iters=3430
8.67/8.98	
8.67/8.98	Low Water (keep): wt=27.000, iters=3409
8.67/8.98	
8.67/8.98	Low Water (keep): wt=26.000, iters=3384
8.67/8.98	
8.67/8.98	Low Water (keep): wt=25.000, iters=3344
8.67/8.98	
8.67/8.98	Low Water (keep): wt=15.000, iters=3441
8.67/8.98	
8.67/8.98	Low Water (keep): wt=14.000, iters=3384
8.67/8.98	
8.67/8.98	Low Water (keep): wt=13.000, iters=3357
8.67/8.98	
8.67/8.98	Low Water (keep): wt=12.000, iters=3345
8.67/8.98	
8.67/8.98	Low Water (displace): id=2939, wt=81.000
8.67/8.98	
8.67/8.98	Low Water (displace): id=12599, wt=28.000
8.67/8.98	
8.67/8.98	LAlarm clock 
179.78/180.04	Prover9 interrupted
179.78/180.04	EOF