0.10/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.12	% Command    : tptp2X_and_run_prover9 %d %s
0.13/0.34	% Computer   : n007.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   : 180
0.13/0.34	% DateTime   : Thu Aug 29 10:54:51 EDT 2019
0.13/0.34	% CPUTime    : 
0.73/1.02	============================== Prover9 ===============================
0.73/1.02	Prover9 (32) version 2009-11A, November 2009.
0.73/1.02	Process 18815 was started by sandbox2 on n007.cluster.edu,
0.73/1.02	Thu Aug 29 10:54:52 2019
0.73/1.02	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_18661_n007.cluster.edu".
0.73/1.02	============================== end of head ===========================
0.73/1.02	
0.73/1.02	============================== INPUT =================================
0.73/1.02	
0.73/1.02	% Reading from file /tmp/Prover9_18661_n007.cluster.edu
0.73/1.02	
0.73/1.02	set(prolog_style_variables).
0.73/1.02	set(auto2).
0.73/1.02	    % set(auto2) -> set(auto).
0.73/1.02	    % set(auto) -> set(auto_inference).
0.73/1.02	    % set(auto) -> set(auto_setup).
0.73/1.02	    % set(auto_setup) -> set(predicate_elim).
0.73/1.02	    % set(auto_setup) -> assign(eq_defs, unfold).
0.73/1.02	    % set(auto) -> set(auto_limits).
0.73/1.02	    % set(auto_limits) -> assign(max_weight, "100.000").
0.73/1.02	    % set(auto_limits) -> assign(sos_limit, 20000).
0.73/1.02	    % set(auto) -> set(auto_denials).
0.73/1.02	    % set(auto) -> set(auto_process).
0.73/1.02	    % set(auto2) -> assign(new_constants, 1).
0.73/1.02	    % set(auto2) -> assign(fold_denial_max, 3).
0.73/1.02	    % set(auto2) -> assign(max_weight, "200.000").
0.73/1.02	    % set(auto2) -> assign(max_hours, 1).
0.73/1.02	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.73/1.02	    % set(auto2) -> assign(max_seconds, 0).
0.73/1.02	    % set(auto2) -> assign(max_minutes, 5).
0.73/1.02	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.73/1.02	    % set(auto2) -> set(sort_initial_sos).
0.73/1.02	    % set(auto2) -> assign(sos_limit, -1).
0.73/1.02	    % set(auto2) -> assign(lrs_ticks, 3000).
0.73/1.02	    % set(auto2) -> assign(max_megs, 400).
0.73/1.02	    % set(auto2) -> assign(stats, some).
0.73/1.02	    % set(auto2) -> clear(echo_input).
0.73/1.02	    % set(auto2) -> set(quiet).
0.73/1.02	    % set(auto2) -> clear(print_initial_clauses).
0.73/1.02	    % set(auto2) -> clear(print_given).
0.73/1.02	assign(lrs_ticks,-1).
0.73/1.02	assign(sos_limit,10000).
0.73/1.02	assign(order,kbo).
0.73/1.02	set(lex_order_vars).
0.73/1.02	clear(print_given).
0.73/1.02	
0.73/1.02	% formulas(sos).  % not echoed (17 formulas)
0.73/1.02	
0.73/1.02	============================== end of input ==========================
0.73/1.02	
0.73/1.02	% From the command line: assign(max_seconds, 180).
0.73/1.02	
0.73/1.02	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.73/1.02	
0.73/1.02	% Formulas that are not ordinary clauses:
0.73/1.02	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.73/1.02	2 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	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.73/1.02	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.73/1.02	5 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	6 (all C all C1 (C != C1 & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	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.73/1.02	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.73/1.02	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.73/1.02	10 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.73/1.02	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.73/1.02	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.73/1.02	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].
4.77/5.08	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].
4.77/5.08	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].
4.77/5.08	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].
4.77/5.08	17 -(all C1 all C2 all C3 all P (meet(P,C1,C2) & meet(P,C1,C3) & part_of(C2,C3) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause).  [assumption].
4.77/5.08	
4.77/5.08	============================== end of process non-clausal formulas ===
4.77/5.08	
4.77/5.08	============================== PROCESS INITIAL CLAUSES ===============
4.77/5.08	
4.77/5.08	============================== PREDICATE ELIMINATION =================
4.77/5.08	18 -end_point(A,B) | -inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
4.77/5.08	19 inner_point(f7(A),A) # label(c3) # label(axiom).  [clausify(10)].
4.77/5.08	Derived: -end_point(f7(A),A).  [resolve(18,b,19,a)].
4.77/5.08	20 incident_c(A,B) | -inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
4.77/5.08	Derived: incident_c(f7(A),A).  [resolve(20,b,19,a)].
4.77/5.08	21 -incident_c(A,B) | end_point(A,B) | inner_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(15)].
4.77/5.08	22 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom).  [clausify(13)].
4.77/5.08	Derived: meet(f7(A),f9(A,f7(A)),f10(A,f7(A))).  [resolve(22,a,19,a)].
4.77/5.08	Derived: meet(A,f9(B,A),f10(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,c)].
4.77/5.08	23 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom).  [clausify(13)].
4.77/5.08	Derived: sum(f9(A,f7(A)),f10(A,f7(A))) = A.  [resolve(23,a,19,a)].
4.77/5.08	Derived: sum(f9(A,B),f10(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,c)].
4.77/5.08	24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(5)].
4.77/5.08	25 end_point(f4(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(5)].
4.77/5.08	Derived: -end_point(A,B) | end_point(f4(B),B).  [resolve(24,b,25,b)].
4.77/5.08	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)].
4.77/5.08	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)].
4.77/5.08	27 end_point(f1(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(2)].
4.77/5.08	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(2)].
4.77/5.08	Derived: end_point(f1(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
4.77/5.08	29 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom).  [clausify(6)].
4.77/5.08	Derived: A = B | -part_of(A,B) | end_point(f1(A),A).  [resolve(29,c,27,b)].
4.77/5.08	
4.77/5.08	============================== end predicate elimination =============
4.77/5.08	
4.77/5.08	Auto_denials:  (non-Horn, no changes).
4.77/5.08	
4.77/5.08	Term ordering decisions:
4.77/5.08	Function symbol KB weights:  c10=1. c11=1. c12=1. c13=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.
4.77/5.08	
4.77/5.08	============================== end of process initial clauses ========
4.77/5.08	
4.77/5.08	============================== CLAUSES FOR SEARCH ====================
4.77/5.08	
4.77/5.08	============================== end of clauses for search =============
4.77/5.08	
4.77/5.08	============================== SEARCH ================================
4.77/5.08	
4.77/5.08	% Starting search at 0.02 seconds.
4.77/5.08	
4.77/5.08	Low Water (keep): wt=32.000, iters=3398
4.77/5.08	
4.77/5.08	Low Water (keep): wt=31.000, iters=3376
4.77/5.08	
4.77/5.08	Low Water (keep): wt=29.000, iters=3337
4.77/5.08	
4.77/5.08	Low Water (keep): wt=26.000, iters=3342
4.77/5.08	
4.77/5.08	Low Water (keep): wt=25.000, iters=3517
4.77/5.08	
4.77/5.08	Low Water (keep): wt=24.000, iters=3368
4.77/5.08	
4.77/5.08	Low Water (keep): wt=23.000, iters=3340
4.77/5.08	
4.77/5.08	Low Water (keep): wt=15.000, iters=3393
4.77/5.08	
4.77/5.08	Low Water (keep): wt=14.000, iters=3400
4.77/5.08	
4.77/5.08	Low Water (keep): wt=13.000, iters=3384
4.77/5.08	
4.77/5.08	============================== PROOF =================================
4.77/5.08	% SZS status Theorem
4.77/5.08	% SZS output start Refutation
4.77/5.08	
4.77/5.08	% Proof 1 at 4.03 (+ 0.05) seconds.
4.77/5.08	% Length of proof is 19.
4.77/5.08	% Level of proof is 5.
4.77/5.08	% Maximum clause weight is 25.000.
4.77/5.08	% Given clauses 1851.
4.77/5.08	
4.77/5.08	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].
4.77/5.08	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].
4.77/5.08	17 -(all C1 all C2 all C3 all P (meet(P,C1,C2) & meet(P,C1,C3) & part_of(C2,C3) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause).  [assumption].
4.77/5.08	30 part_of(c11,c12) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
4.77/5.08	33 incident_c(f8(A,B),B) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(12)].
4.77/5.08	36 -part_of(sum(c10,c11),sum(c10,c12)) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
4.77/5.08	42 -incident_c(f8(A,B),A) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(12)].
4.77/5.08	43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(12)].
4.77/5.08	50 incident_c(A,B) | -incident_c(A,C) | sum(C,D) != B # label(sum_defn) # label(axiom).  [clausify(16)].
4.77/5.08	51 incident_c(A,B) | -incident_c(A,C) | sum(D,C) != B # label(sum_defn) # label(axiom).  [clausify(16)].
4.77/5.08	57 -incident_c(A,B) | incident_c(A,C) | incident_c(A,D) | sum(C,D) != B # label(sum_defn) # label(axiom).  [clausify(16)].
4.77/5.08	89 incident_c(f8(sum(c10,c12),sum(c10,c11)),sum(c10,c11)).  [resolve(36,a,33,b)].
4.77/5.08	93 -incident_c(f8(sum(c10,c12),sum(c10,c11)),sum(c10,c12)).  [ur(42,b,36,a)].
4.77/5.08	95 -incident_c(A,c11) | incident_c(A,c12).  [resolve(43,c,30,a)].
4.77/5.08	383 incident_c(f8(sum(c10,c12),sum(c10,c11)),A) | incident_c(f8(sum(c10,c12),sum(c10,c11)),B) | sum(c10,c11) != sum(A,B).  [resolve(89,a,57,a),flip(c)].
4.77/5.08	473 -incident_c(f8(sum(c10,c12),sum(c10,c11)),c12).  [ur(51,a,93,a,c,xx)].
4.77/5.08	476 -incident_c(f8(sum(c10,c12),sum(c10,c11)),c10).  [ur(50,a,93,a,c,xx)].
4.77/5.08	14243 incident_c(f8(sum(c10,c12),sum(c10,c11)),c11).  [xx_res(383,c),unit_del(a,476)].
4.77/5.08	14284 $F.  [resolve(14243,a,95,a),unit_del(a,473)].
4.77/5.08	
4.77/5.08	% SZS output end Refutation
4.77/5.08	============================== end of proof ==========================
4.77/5.08	
4.77/5.08	============================== STATISTICS ============================
4.77/5.08	
4.77/5.08	Given=1851. Generated=52634. Kept=14253. proofs=1.
4.77/5.08	Usable=1630. Sos=8656. Demods=18. Limbo=6, Disabled=4018. Hints=0.
4.77/5.08	Megabytes=11.18.
4.77/5.08	User_CPU=4.03, System_CPU=0.05, Wall_clock=4.
4.77/5.08	
4.77/5.08	============================== end of statistics =====================
4.77/5.08	
4.77/5.08	============================== end of search =========================
4.77/5.08	
4.77/5.08	THEOREM PROVED
4.77/5.08	% SZS status Theorem
4.77/5.08	
4.77/5.08	Exiting with 1 proof.
4.77/5.08	
4.77/5.08	Process 18815 exit (max_proofs) Thu Aug 29 10:54:56 2019
4.77/5.08	Prover9 interrupted
4.77/5.08	EOF