0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.10	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.30	% Computer   : n031.cluster.edu
0.09/0.30	% Model      : x86_64 x86_64
0.09/0.30	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory     : 8042.1875MB
0.09/0.30	% OS         : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% DateTime   : Thu Jul  2 07:58:47 EDT 2020
0.09/0.31	% CPUTime    : 
0.77/1.11	============================== Prover9 ===============================
0.77/1.11	Prover9 (32) version 2009-11A, November 2009.
0.77/1.11	Process 21385 was started by sandbox2 on n031.cluster.edu,
0.77/1.11	Thu Jul  2 07:58:48 2020
0.77/1.11	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 960 -f /tmp/Prover9_21231_n031.cluster.edu".
0.77/1.11	============================== end of head ===========================
0.77/1.11	
0.77/1.11	============================== INPUT =================================
0.77/1.11	
0.77/1.11	% Reading from file /tmp/Prover9_21231_n031.cluster.edu
0.77/1.11	
0.77/1.11	set(prolog_style_variables).
0.77/1.11	set(auto2).
0.77/1.11	    % set(auto2) -> set(auto).
0.77/1.11	    % set(auto) -> set(auto_inference).
0.77/1.11	    % set(auto) -> set(auto_setup).
0.77/1.11	    % set(auto_setup) -> set(predicate_elim).
0.77/1.11	    % set(auto_setup) -> assign(eq_defs, unfold).
0.77/1.11	    % set(auto) -> set(auto_limits).
0.77/1.11	    % set(auto_limits) -> assign(max_weight, "100.000").
0.77/1.11	    % set(auto_limits) -> assign(sos_limit, 20000).
0.77/1.11	    % set(auto) -> set(auto_denials).
0.77/1.11	    % set(auto) -> set(auto_process).
0.77/1.11	    % set(auto2) -> assign(new_constants, 1).
0.77/1.11	    % set(auto2) -> assign(fold_denial_max, 3).
0.77/1.11	    % set(auto2) -> assign(max_weight, "200.000").
0.77/1.11	    % set(auto2) -> assign(max_hours, 1).
0.77/1.11	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.77/1.11	    % set(auto2) -> assign(max_seconds, 0).
0.77/1.11	    % set(auto2) -> assign(max_minutes, 5).
0.77/1.11	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.77/1.11	    % set(auto2) -> set(sort_initial_sos).
0.77/1.11	    % set(auto2) -> assign(sos_limit, -1).
0.77/1.11	    % set(auto2) -> assign(lrs_ticks, 3000).
0.77/1.11	    % set(auto2) -> assign(max_megs, 400).
0.77/1.11	    % set(auto2) -> assign(stats, some).
0.77/1.11	    % set(auto2) -> clear(echo_input).
0.77/1.11	    % set(auto2) -> set(quiet).
0.77/1.11	    % set(auto2) -> clear(print_initial_clauses).
0.77/1.11	    % set(auto2) -> clear(print_given).
0.77/1.11	assign(lrs_ticks,-1).
0.77/1.11	assign(sos_limit,10000).
0.77/1.11	assign(order,kbo).
0.77/1.11	set(lex_order_vars).
0.77/1.11	clear(print_given).
0.77/1.11	
0.77/1.11	% formulas(sos).  % not echoed (17 formulas)
0.77/1.11	
0.77/1.11	============================== end of input ==========================
0.77/1.11	
0.77/1.11	% From the command line: assign(max_seconds, 960).
0.77/1.11	
0.77/1.11	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.77/1.11	
0.77/1.11	% Formulas that are not ordinary clauses:
0.77/1.11	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.77/1.11	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.77/1.11	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.77/1.11	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.77/1.11	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.77/1.11	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.77/1.11	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.77/1.11	8 (all C all C1 (part_of(C1,C) & C1 != C -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.77/1.11	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.77/1.11	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.77/1.11	11 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.77/1.11	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].
11.68/11.99	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].
11.68/11.99	14 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
11.68/11.99	15 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
11.68/11.99	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].
11.68/11.99	17 -(all C1 all C2 all C3 all P (part_of(C2,C3) & meet(P,C1,C3) & meet(P,C1,C2) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause).  [assumption].
11.68/11.99	
11.68/11.99	============================== end of process non-clausal formulas ===
11.68/11.99	
11.68/11.99	============================== PROCESS INITIAL CLAUSES ===============
11.68/11.99	
11.68/11.99	============================== PREDICATE ELIMINATION =================
11.68/11.99	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
11.68/11.99	19 inner_point(f12(A),A) # label(c3) # label(axiom).  [clausify(14)].
11.68/11.99	Derived: -end_point(f12(A),A).  [resolve(18,a,19,a)].
11.68/11.99	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
11.68/11.99	Derived: incident_c(f12(A),A).  [resolve(20,a,19,a)].
11.68/11.99	21 inner_point(A,B) | -incident_c(A,B) | end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(16)].
11.68/11.99	22 -inner_point(A,B) | meet(A,f4(B,A),f5(B,A)) # label(c4) # label(axiom).  [clausify(4)].
11.68/11.99	Derived: meet(f12(A),f4(A,f12(A)),f5(A,f12(A))).  [resolve(22,a,19,a)].
11.68/11.99	Derived: meet(A,f4(B,A),f5(B,A)) | -incident_c(A,B) | end_point(A,B).  [resolve(22,a,21,a)].
11.68/11.99	23 -inner_point(A,B) | sum(f4(B,A),f5(B,A)) = B # label(c4) # label(axiom).  [clausify(4)].
11.68/11.99	Derived: sum(f4(A,f12(A)),f5(A,f12(A))) = A.  [resolve(23,a,19,a)].
11.68/11.99	Derived: sum(f4(A,B),f5(A,B)) = A | -incident_c(B,A) | end_point(B,A).  [resolve(23,a,21,a)].
11.68/11.99	24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(11)].
11.68/11.99	25 closed(A) | end_point(f9(A),A) # label(closed_defn) # label(axiom).  [clausify(11)].
11.68/11.99	Derived: -end_point(A,B) | end_point(f9(B),B).  [resolve(24,a,25,a)].
11.68/11.99	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)].
11.68/11.99	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)].
11.68/11.99	27 end_point(f13(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(15)].
11.68/11.99	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(15)].
11.68/11.99	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
11.68/11.99	29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(8)].
11.68/11.99	Derived: -part_of(A,B) | A = B | end_point(f13(A),A).  [resolve(29,c,27,b)].
11.68/11.99	
11.68/11.99	============================== end predicate elimination =============
11.68/11.99	
11.68/11.99	Auto_denials:  (non-Horn, no changes).
11.68/11.99	
11.68/11.99	Term ordering decisions:
11.68/11.99	Function symbol KB weights:  c10=1. c11=1. c12=1. c13=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.
11.68/11.99	
11.68/11.99	============================== end of process initial clauses ========
11.68/11.99	
11.68/11.99	============================== CLAUSES FOR SEARCH ====================
11.68/11.99	
11.68/11.99	============================== end of clauses for search =============
11.68/11.99	
11.68/11.99	============================== SEARCH ================================
11.68/11.99	
11.68/11.99	% Starting search at 0.01 seconds.
11.68/11.99	
11.68/11.99	Low Water (keep): wt=32.000, iters=3394
11.68/11.99	
11.68/11.99	Low Water (keep): wt=31.000, iters=3371
11.68/11.99	
11.68/11.99	Low Water (keep): wt=29.000, iters=3333
11.68/11.99	
11.68/11.99	Low Water (keep): wt=26.000, iters=3335
11.68/11.99	
11.68/11.99	Low Water (keep): wt=25.000, iters=3506
11.68/11.99	
11.68/11.99	Low Water (keep): wt=24.000, iters=3379
11.68/11.99	
11.68/11.99	Low Water (keep): wt=23.000, iters=3353
11.68/11.99	
11.68/11.99	Low Water (keep): wt=22.000, iters=3497
11.68/11.99	
11.68/11.99	Low Water (keep): wt=15.000, iters=3393
11.68/11.99	
11.68/11.99	Low Water (keep): wt=14.000, iters=3400
11.68/11.99	
11.68/11.99	Low Water (keep): wt=13.000, iters=3384
11.68/11.99	
11.68/11.99	============================== PROOF =================================
11.68/11.99	% SZS status Theorem
11.68/11.99	% SZS output start Refutation
11.68/11.99	
11.68/11.99	% Proof 1 at 10.83 (+ 0.05) seconds.
11.68/11.99	% Length of proof is 19.
11.68/11.99	% Level of proof is 5.
11.68/11.99	% Maximum clause weight is 25.000.
11.68/11.99	% Given clauses 1851.
11.68/11.99	
11.68/11.99	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].
11.68/11.99	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].
11.68/11.99	17 -(all C1 all C2 all C3 all P (part_of(C2,C3) & meet(P,C1,C3) & meet(P,C1,C2) -> part_of(sum(C1,C2),sum(C1,C3)))) # label(corollary_2_6_1) # label(negated_conjecture) # label(non_clause).  [assumption].
11.68/11.99	30 part_of(c11,c12) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
11.68/11.99	33 incident_c(f10(A,B),B) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(12)].
11.68/11.99	36 -part_of(sum(c10,c11),sum(c10,c12)) # label(corollary_2_6_1) # label(negated_conjecture).  [clausify(17)].
11.68/11.99	42 -incident_c(f10(A,B),A) | part_of(B,A) # label(part_of_defn) # label(axiom).  [clausify(12)].
11.68/11.99	43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(12)].
11.68/11.99	50 -incident_c(A,B) | incident_c(A,C) | sum(B,D) != C # label(sum_defn) # label(axiom).  [clausify(13)].
11.68/11.99	51 -incident_c(A,B) | incident_c(A,C) | sum(D,B) != C # label(sum_defn) # label(axiom).  [clausify(13)].
11.68/11.99	57 incident_c(A,B) | incident_c(A,C) | -incident_c(A,D) | sum(B,C) != D # label(sum_defn) # label(axiom).  [clausify(13)].
11.68/11.99	89 incident_c(f10(sum(c10,c12),sum(c10,c11)),sum(c10,c11)).  [resolve(36,a,33,b)].
11.68/11.99	93 -incident_c(f10(sum(c10,c12),sum(c10,c11)),sum(c10,c12)).  [ur(42,b,36,a)].
11.68/11.99	95 -incident_c(A,c11) | incident_c(A,c12).  [resolve(43,c,30,a)].
11.68/11.99	383 incident_c(f10(sum(c10,c12),sum(c10,c11)),A) | incident_c(f10(sum(c10,c12),sum(c10,c11)),B) | sum(c10,c11) != sum(A,B).  [resolve(89,a,57,c),flip(c)].
11.68/11.99	471 -incident_c(f10(sum(c10,c12),sum(c10,c11)),c12).  [ur(51,b,93,a,c,xx)].
11.68/11.99	474 -incident_c(f10(sum(c10,c12),sum(c10,c11)),c10).  [ur(50,b,93,a,c,xx)].
11.68/11.99	14233 incident_c(f10(sum(c10,c12),sum(c10,c11)),c11).  [xx_res(383,c),unit_del(a,474)].
11.68/11.99	14274 $F.  [resolve(14233,a,95,a),unit_del(a,471)].
11.68/11.99	
11.68/11.99	% SZS output end Refutation
11.68/11.99	============================== end of proof ==========================
11.68/11.99	
11.68/11.99	============================== STATISTICS ============================
11.68/11.99	
11.68/11.99	Given=1851. Generated=52624. Kept=14243. proofs=1.
11.68/11.99	Usable=1630. Sos=8657. Demods=18. Limbo=6, Disabled=4007. Hints=0.
11.68/11.99	Megabytes=11.17.
11.68/11.99	User_CPU=10.83, System_CPU=0.05, Wall_clock=11.
11.68/11.99	
11.68/11.99	============================== end of statistics =====================
11.68/11.99	
11.68/11.99	============================== end of search =========================
11.68/11.99	
11.68/11.99	THEOREM PROVED
11.68/11.99	% SZS status Theorem
11.68/11.99	
11.68/11.99	Exiting with 1 proof.
11.68/11.99	
11.68/11.99	Process 21385 exit (max_proofs) Thu Jul  2 07:58:59 2020
11.68/11.99	Prover9 interrupted
11.68/11.99	EOF