0.06/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command  : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer : n021.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	% WCLimit  : 120
0.11/0.32	% DateTime : Tue Aug  9 04:10:20 EDT 2022
0.11/0.32	% CPUTime  : 
0.42/0.97	============================== Prover9 ===============================
0.42/0.97	Prover9 (32) version 2009-11A, November 2009.
0.42/0.97	Process 4243 was started by sandbox2 on n021.cluster.edu,
0.42/0.97	Tue Aug  9 04:10:21 2022
0.42/0.97	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_3887_n021.cluster.edu".
0.42/0.97	============================== end of head ===========================
0.42/0.97	
0.42/0.97	============================== INPUT =================================
0.42/0.97	
0.42/0.97	% Reading from file /tmp/Prover9_3887_n021.cluster.edu
0.42/0.97	
0.42/0.97	set(prolog_style_variables).
0.42/0.97	set(auto2).
0.42/0.97	    % set(auto2) -> set(auto).
0.42/0.97	    % set(auto) -> set(auto_inference).
0.42/0.97	    % set(auto) -> set(auto_setup).
0.42/0.97	    % set(auto_setup) -> set(predicate_elim).
0.42/0.97	    % set(auto_setup) -> assign(eq_defs, unfold).
0.42/0.97	    % set(auto) -> set(auto_limits).
0.42/0.97	    % set(auto_limits) -> assign(max_weight, "100.000").
0.42/0.97	    % set(auto_limits) -> assign(sos_limit, 20000).
0.42/0.97	    % set(auto) -> set(auto_denials).
0.42/0.97	    % set(auto) -> set(auto_process).
0.42/0.97	    % set(auto2) -> assign(new_constants, 1).
0.42/0.97	    % set(auto2) -> assign(fold_denial_max, 3).
0.42/0.97	    % set(auto2) -> assign(max_weight, "200.000").
0.42/0.97	    % set(auto2) -> assign(max_hours, 1).
0.42/0.97	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.42/0.97	    % set(auto2) -> assign(max_seconds, 0).
0.42/0.97	    % set(auto2) -> assign(max_minutes, 5).
0.42/0.97	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.42/0.97	    % set(auto2) -> set(sort_initial_sos).
0.42/0.97	    % set(auto2) -> assign(sos_limit, -1).
0.42/0.97	    % set(auto2) -> assign(lrs_ticks, 3000).
0.42/0.97	    % set(auto2) -> assign(max_megs, 400).
0.42/0.97	    % set(auto2) -> assign(stats, some).
0.42/0.97	    % set(auto2) -> clear(echo_input).
0.42/0.97	    % set(auto2) -> set(quiet).
0.42/0.97	    % set(auto2) -> clear(print_initial_clauses).
0.42/0.97	    % set(auto2) -> clear(print_given).
0.42/0.97	assign(lrs_ticks,-1).
0.42/0.97	assign(sos_limit,10000).
0.42/0.97	assign(order,kbo).
0.42/0.97	set(lex_order_vars).
0.42/0.97	clear(print_given).
0.42/0.97	
0.42/0.97	% formulas(sos).  % not echoed (17 formulas)
0.42/0.97	
0.42/0.97	============================== end of input ==========================
0.42/0.97	
0.42/0.97	% From the command line: assign(max_seconds, 960).
0.42/0.97	
0.42/0.97	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.42/0.97	
0.42/0.97	% Formulas that are not ordinary clauses:
0.42/0.97	1 (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.42/0.97	2 (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.42/0.97	3 (all P all C (inner_point(P,C) <-> -end_point(P,C) & incident_c(P,C))) # label(inner_point_defn) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	4 (all C all P all Q all R (end_point(Q,C) & end_point(R,C) & end_point(P,C) -> P = R | R = Q | Q = P)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	5 (all C all C1 all C2 all C3 (part_of(C1,C) & part_of(C3,C) & (exists P (end_point(P,C3) & end_point(P,C2) & end_point(P,C1))) & part_of(C2,C) -> part_of(C3,C2) | part_of(C1,C2) | part_of(C2,C1) | part_of(C1,C3) | part_of(C3,C1) | part_of(C2,C3))) # label(c2) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	7 (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.42/0.97	8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	9 (all P all C all C1 (meet(P,C,C1) <-> incident_c(P,C) & incident_c(P,C1) & (all Q (incident_c(Q,C) & incident_c(Q,C1) -> end_point(Q,C1) & end_point(Q,C))))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	10 (all C all C1 all C2 all P (meet(P,C1,C2) & sum(C1,C2) = C & closed(C) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	11 (all C all P (end_point(P,C) -> (exists Q (end_point(Q,C) & P != Q)))) # label(c6) # label(axiom) # label(non_clause).  [assumption].
0.42/0.97	12 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))))) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
2.01/2.35	13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
2.01/2.35	14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
2.01/2.35	15 (all C all P (inner_point(P,C) -> (exists C1 exists C2 (meet(P,C1,C2) & sum(C1,C2) = C)))) # label(c4) # label(axiom) # label(non_clause).  [assumption].
2.01/2.35	16 (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(C2,C1) | part_of(C1,C2))) <-> end_point(P,C))) # label(end_point_defn) # label(axiom) # label(non_clause).  [assumption].
2.01/2.35	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].
2.01/2.35	
2.01/2.35	============================== end of process non-clausal formulas ===
2.01/2.35	
2.01/2.35	============================== PROCESS INITIAL CLAUSES ===============
2.01/2.35	
2.01/2.35	============================== PREDICATE ELIMINATION =================
2.01/2.35	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.01/2.35	19 inner_point(f9(A),A) # label(c3) # label(axiom).  [clausify(13)].
2.01/2.35	Derived: -end_point(f9(A),A).  [resolve(18,a,19,a)].
2.01/2.35	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.01/2.35	Derived: incident_c(f9(A),A).  [resolve(20,a,19,a)].
2.01/2.35	21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
2.01/2.35	22 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom).  [clausify(15)].
2.01/2.35	Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))).  [resolve(22,a,19,a)].
2.01/2.35	Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(22,a,21,a)].
2.01/2.35	23 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom).  [clausify(15)].
2.01/2.35	Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A.  [resolve(23,a,19,a)].
2.01/2.35	Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(23,a,21,a)].
2.01/2.35	24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(8)].
2.01/2.35	25 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom).  [clausify(8)].
2.01/2.35	Derived: -end_point(A,B) | end_point(f5(B),B).  [resolve(24,a,25,a)].
2.01/2.35	26 -meet(A,B,C) | sum(B,C) != D | -closed(D) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom).  [clausify(10)].
2.01/2.35	Derived: -meet(A,B,C) | sum(B,C) != D | -end_point(E,B) | meet(E,B,C) | end_point(f5(D),D).  [resolve(26,c,25,a)].
2.01/2.35	27 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(6)].
2.01/2.35	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(6)].
2.01/2.35	Derived: end_point(f3(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
2.01/2.35	29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(14)].
2.01/2.35	Derived: -part_of(A,B) | A = B | end_point(f3(A),A).  [resolve(29,c,27,b)].
2.01/2.35	
2.01/2.35	============================== end predicate elimination =============
2.01/2.35	
2.01/2.35	Auto_denials:  (non-Horn, no changes).
2.01/2.35	
2.01/2.35	Term ordering decisions:
2.01/2.35	Function symbol KB weights:  c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f2=1. f4=1. f7=1. f10=1. f11=1. f12=1. f13=1. f3=1. f5=1. f9=1. f6=1. f8=1.
2.01/2.35	
2.01/2.35	============================== end of process initial clauses ========
2.01/2.35	
2.01/2.35	============================== CLAUSES FOR SEARCH ====================
2.01/2.35	
2.01/2.35	============================== end of clauses for search =============
2.01/2.35	
2.01/2.35	============================== SEARCH ================================
2.01/2.35	
2.01/2.35	% Starting search at 0.01 seconds.
2.01/2.35	
2.01/2.35	Low Water (keep): wt=43.000, iters=3385
2.01/2.35	
2.01/2.35	Low Water (keep): wt=33.000, iters=3369
2.01/2.35	
2.01/2.35	Low Water (keep): wt=32.000, iters=3362
2.01/2.35	
2.01/2.35	Low Water (keep): wt=31.000, iters=3335
2.01/2.35	
2.01/2.35	Low Water (keep): wt=29.000, iters=3406
2.01/2.35	
2.01/2.35	Low Water (keep): wt=28.000, iters=3385
2.01/2.35	
2.01/2.35	Low Water (keep): wt=26.000, iters=3334
2.01/2.35	
2.01/2.35	Low Water (keep): wt=25.000, iters=3504
2.01/2.35	
2.01/2.35	Low Water (keep): wt=24.000, iters=3355
2.01/2.35	
2.01/2.35	Low Water (keep): wt=23.000, iters=3343
2.01/2.35	
2.01/2.35	Low Water (keep): wt=22.000, iters=3507
2.01/2.35	
2.01/2.35	Low Water (keep): wt=15.000, iters=3417
8.18/8.56	
8.18/8.56	Low Water (keep): wt=14.000, iters=3403
8.18/8.56	
8.18/8.56	Low Water (keep): wt=13.000, iters=3363
8.18/8.56	
8.18/8.56	============================== PROOF =================================
8.18/8.56	% SZS status Theorem
8.18/8.56	% SZS output start Refutation
8.18/8.56	
8.18/8.56	% Proof 1 at 7.47 (+ 0.05) seconds.
8.18/8.56	% Length of proof is 19.
8.18/8.56	% Level of proof is 5.
8.18/8.56	% Maximum clause weight is 25.000.
8.18/8.56	% Given clauses 1851.
8.18/8.56	
8.18/8.56	1 (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].
8.18/8.56	12 (all C all C1 all C2 (C = sum(C1,C2) <-> (all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))))) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
8.18/8.56	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].
8.18/8.56	30 part_of(c11,c12) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
8.18/8.56	33 incident_c(f1(A,B),B) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(1)].
8.18/8.56	36 -part_of(sum(c10,c11),sum(c10,c12)) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
8.18/8.56	41 -incident_c(f1(A,B),A) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(1)].
8.18/8.56	43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(1)].
8.18/8.56	46 sum(A,B) != C | incident_c(D,C) | -incident_c(D,B) # label(sum_defn) # label(axiom).  [clausify(12)].
8.18/8.56	47 sum(A,B) != C | incident_c(D,C) | -incident_c(D,A) # label(sum_defn) # label(axiom).  [clausify(12)].
8.18/8.56	57 sum(A,B) != C | -incident_c(D,C) | incident_c(D,B) | incident_c(D,A) # label(sum_defn) # label(axiom).  [clausify(12)].
8.18/8.56	89 incident_c(f1(sum(c10,c12),sum(c10,c11)),sum(c10,c11)).  [resolve(36,a,33,b)].
8.18/8.56	93 -incident_c(f1(sum(c10,c12),sum(c10,c11)),sum(c10,c12)).  [ur(41,b,36,a)].
8.18/8.56	95 -incident_c(A,c11) | incident_c(A,c12).  [resolve(43,c,30,a)].
8.18/8.56	383 sum(c10,c11) != sum(A,B) | incident_c(f1(sum(c10,c12),sum(c10,c11)),B) | incident_c(f1(sum(c10,c12),sum(c10,c11)),A).  [resolve(89,a,57,b),flip(a)].
8.18/8.56	476 -incident_c(f1(sum(c10,c12),sum(c10,c11)),c10).  [ur(47,a,xx,b,93,a)].
8.18/8.56	479 -incident_c(f1(sum(c10,c12),sum(c10,c11)),c12).  [ur(46,a,xx,b,93,a)].
8.18/8.56	14264 incident_c(f1(sum(c10,c12),sum(c10,c11)),c11).  [xx_res(383,a),unit_del(b,476)].
8.18/8.56	14305 $F.  [resolve(14264,a,95,a),unit_del(a,479)].
8.18/8.56	
8.18/8.56	% SZS output end Refutation
8.18/8.56	============================== end of proof ==========================
8.18/8.56	
8.18/8.56	============================== STATISTICS ============================
8.18/8.56	
8.18/8.56	Given=1851. Generated=52486. Kept=14274. proofs=1.
8.18/8.56	Usable=1630. Sos=8669. Demods=18. Limbo=6, Disabled=4026. Hints=0.
8.18/8.56	Megabytes=11.22.
8.18/8.56	User_CPU=7.47, System_CPU=0.05, Wall_clock=7.
8.18/8.56	
8.18/8.56	============================== end of statistics =====================
8.18/8.56	
8.18/8.56	============================== end of search =========================
8.18/8.56	
8.18/8.56	THEOREM PROVED
8.18/8.56	% SZS status Theorem
8.18/8.56	
8.18/8.56	Exiting with 1 proof.
8.18/8.56	
8.18/8.56	Process 4243 exit (max_proofs) Tue Aug  9 04:10:28 2022
8.18/8.56	Prover9 interrupted
8.18/8.56	EOF