0.02/0.09	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.09	% Command  : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer : n010.cluster.edu
0.09/0.29	% Model    : x86_64 x86_64
0.09/0.29	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory   : 8042.1875MB
0.09/0.29	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit : 960
0.09/0.29	% WCLimit  : 120
0.09/0.29	% DateTime : Tue Aug  9 03:17:50 EDT 2022
0.09/0.29	% CPUTime  : 
0.49/0.80	============================== Prover9 ===============================
0.49/0.80	Prover9 (32) version 2009-11A, November 2009.
0.49/0.80	Process 23657 was started by sandbox on n010.cluster.edu,
0.49/0.80	Tue Aug  9 03:17:50 2022
0.49/0.80	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_23503_n010.cluster.edu".
0.49/0.80	============================== end of head ===========================
0.49/0.80	
0.49/0.80	============================== INPUT =================================
0.49/0.80	
0.49/0.80	% Reading from file /tmp/Prover9_23503_n010.cluster.edu
0.49/0.80	
0.49/0.80	set(prolog_style_variables).
0.49/0.80	set(auto2).
0.49/0.80	    % set(auto2) -> set(auto).
0.49/0.80	    % set(auto) -> set(auto_inference).
0.49/0.80	    % set(auto) -> set(auto_setup).
0.49/0.80	    % set(auto_setup) -> set(predicate_elim).
0.49/0.80	    % set(auto_setup) -> assign(eq_defs, unfold).
0.49/0.80	    % set(auto) -> set(auto_limits).
0.49/0.80	    % set(auto_limits) -> assign(max_weight, "100.000").
0.49/0.80	    % set(auto_limits) -> assign(sos_limit, 20000).
0.49/0.80	    % set(auto) -> set(auto_denials).
0.49/0.80	    % set(auto) -> set(auto_process).
0.49/0.80	    % set(auto2) -> assign(new_constants, 1).
0.49/0.80	    % set(auto2) -> assign(fold_denial_max, 3).
0.49/0.80	    % set(auto2) -> assign(max_weight, "200.000").
0.49/0.80	    % set(auto2) -> assign(max_hours, 1).
0.49/0.80	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.49/0.80	    % set(auto2) -> assign(max_seconds, 0).
0.49/0.80	    % set(auto2) -> assign(max_minutes, 5).
0.49/0.80	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.49/0.80	    % set(auto2) -> set(sort_initial_sos).
0.49/0.80	    % set(auto2) -> assign(sos_limit, -1).
0.49/0.80	    % set(auto2) -> assign(lrs_ticks, 3000).
0.49/0.80	    % set(auto2) -> assign(max_megs, 400).
0.49/0.80	    % set(auto2) -> assign(stats, some).
0.49/0.80	    % set(auto2) -> clear(echo_input).
0.49/0.80	    % set(auto2) -> set(quiet).
0.49/0.80	    % set(auto2) -> clear(print_initial_clauses).
0.49/0.80	    % set(auto2) -> clear(print_given).
0.49/0.80	assign(lrs_ticks,-1).
0.49/0.80	assign(sos_limit,10000).
0.49/0.80	assign(order,kbo).
0.49/0.80	set(lex_order_vars).
0.49/0.80	clear(print_given).
0.49/0.80	
0.49/0.80	% formulas(sos).  % not echoed (17 formulas)
0.49/0.80	
0.49/0.80	============================== end of input ==========================
0.49/0.80	
0.49/0.80	% From the command line: assign(max_seconds, 960).
0.49/0.80	
0.49/0.80	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.49/0.80	
0.49/0.80	% Formulas that are not ordinary clauses:
0.49/0.80	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.49/0.80	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.49/0.80	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.49/0.80	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.49/0.80	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.49/0.80	6 (all C ((exists P end_point(P,C)) <-> open(C))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.49/0.80	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.49/0.80	8 (all C (closed(C) <-> -(exists P end_point(P,C)))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.49/0.80	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.49/0.80	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.49/0.80	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.49/0.80	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].
0.49/0.82	13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.49/0.82	14 (all C all C1 (part_of(C1,C) & C != C1 -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.49/0.82	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].
0.49/0.82	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].
0.49/0.82	17 -(all C all C1 all C2 all P (meet(P,C1,C2) & part_of(C2,C) & part_of(C1,C) -> -end_point(P,C))) # label(proposition_2_14_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.49/0.82	
0.49/0.82	============================== end of process non-clausal formulas ===
0.49/0.82	
0.49/0.82	============================== PROCESS INITIAL CLAUSES ===============
0.49/0.82	
0.49/0.82	============================== PREDICATE ELIMINATION =================
0.49/0.82	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
0.49/0.82	19 inner_point(f9(A),A) # label(c3) # label(axiom).  [clausify(13)].
0.49/0.82	Derived: -end_point(f9(A),A).  [resolve(18,a,19,a)].
0.49/0.82	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
0.49/0.82	Derived: incident_c(f9(A),A).  [resolve(20,a,19,a)].
0.49/0.82	21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
0.49/0.82	22 -inner_point(A,B) | meet(A,f10(B,A),f11(B,A)) # label(c4) # label(axiom).  [clausify(15)].
0.49/0.82	Derived: meet(f9(A),f10(A,f9(A)),f11(A,f9(A))).  [resolve(22,a,19,a)].
0.49/0.82	Derived: meet(A,f10(B,A),f11(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(22,a,21,a)].
0.49/0.82	23 -inner_point(A,B) | sum(f10(B,A),f11(B,A)) = B # label(c4) # label(axiom).  [clausify(15)].
0.49/0.82	Derived: sum(f10(A,f9(A)),f11(A,f9(A))) = A.  [resolve(23,a,19,a)].
0.49/0.82	Derived: sum(f10(A,B),f11(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(23,a,21,a)].
0.49/0.82	24 -closed(A) | -end_point(B,A) # label(closed_defn) # label(axiom).  [clausify(8)].
0.49/0.82	25 closed(A) | end_point(f5(A),A) # label(closed_defn) # label(axiom).  [clausify(8)].
0.49/0.82	Derived: -end_point(A,B) | end_point(f5(B),B).  [resolve(24,a,25,a)].
0.49/0.82	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)].
0.49/0.82	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)].
0.49/0.82	27 end_point(f3(A),A) | -open(A) # label(open_defn) # label(axiom).  [clausify(6)].
0.49/0.82	28 -end_point(A,B) | open(B) # label(open_defn) # label(axiom).  [clausify(6)].
0.49/0.82	Derived: end_point(f3(A),A) | -end_point(B,A).  [resolve(27,b,28,b)].
0.49/0.82	29 -part_of(A,B) | A = B | open(A) # label(c1) # label(axiom).  [clausify(14)].
0.49/0.82	Derived: -part_of(A,B) | A = B | end_point(f3(A),A).  [resolve(29,c,27,b)].
0.49/0.82	
0.49/0.82	============================== end predicate elimination =============
0.49/0.82	
0.49/0.82	Auto_denials:  (non-Horn, no changes).
0.49/0.82	
0.49/0.82	Term ordering decisions:
0.49/0.82	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.
0.49/0.82	
0.49/0.82	============================== end of process initial clauses ========
0.49/0.82	
0.49/0.82	============================== CLAUSES FOR SEARCH ====================
0.49/0.82	
0.49/0.82	============================== end of clauses for search =============
0.49/0.82	
0.49/0.82	============================== SEARCH ================================
0.49/0.82	
0.49/0.82	% Starting search at 0.01 seconds.
0.49/0.82	
0.49/0.82	============================== PROOF =================================
0.49/0.82	% SZS status Theorem
0.49/0.82	% SZS output start Refutation
0.49/0.82	
0.49/0.82	% Proof 1 at 0.02 (+ 0.00) seconds.
0.49/0.82	% Length of proof is 28.
0.49/0.82	% Level of proof is 5.
0.49/0.82	% Maximum clause weight is 21.000.
0.49/0.82	% Given clauses 64.
0.49/0.82	
0.49/0.82	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.49/0.82	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.49/0.82	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.49/0.82	13 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.49/0.82	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].
0.49/0.82	17 -(all C all C1 all C2 all P (meet(P,C1,C2) & part_of(C2,C) & part_of(C1,C) -> -end_point(P,C))) # label(proposition_2_14_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.49/0.82	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
0.49/0.82	19 inner_point(f9(A),A) # label(c3) # label(axiom).  [clausify(13)].
0.49/0.82	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(3)].
0.49/0.82	30 part_of(c12,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.49/0.82	31 part_of(c11,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.49/0.82	32 end_point(c13,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.49/0.82	33 meet(c13,c11,c12) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.49/0.82	39 -meet(A,B,C) | incident_c(A,B) # label(meet_defn) # label(axiom).  [clausify(9)].
0.49/0.82	40 -meet(A,B,C) | incident_c(A,C) # label(meet_defn) # label(axiom).  [clausify(9)].
0.49/0.82	43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(1)].
0.49/0.82	53 -meet(A,B,C) | -incident_c(D,B) | -incident_c(D,C) | end_point(D,C) # label(meet_defn) # label(axiom).  [clausify(9)].
0.49/0.82	54 -meet(A,B,C) | -incident_c(D,B) | -incident_c(D,C) | end_point(D,B) # label(meet_defn) # label(axiom).  [clausify(9)].
0.49/0.82	63 -part_of(A,B) | -incident_c(C,D) | -incident_c(C,A) | -part_of(D,B) | part_of(D,A) | part_of(A,D) | -end_point(C,B) # label(end_point_defn) # label(axiom).  [clausify(16)].
0.49/0.82	66 -end_point(f9(A),A).  [resolve(18,a,19,a)].
0.49/0.82	67 incident_c(f9(A),A).  [resolve(20,a,19,a)].
0.49/0.82	91 incident_c(c13,c11).  [resolve(39,a,33,a)].
0.49/0.82	92 incident_c(c13,c12).  [resolve(40,a,33,a)].
0.49/0.82	284 -incident_c(f9(c11),c12).  [ur(54,a,33,a,b,67,a,d,66,a)].
0.49/0.82	285 -incident_c(f9(c12),c11).  [ur(53,a,33,a,c,67,a,d,66,a)].
0.49/0.82	386 -part_of(c11,c12).  [ur(43,a,67,a,b,284,a)].
0.49/0.82	397 -part_of(c12,c11).  [ur(43,a,67,a,b,285,a)].
0.49/0.82	446 $F.  [ur(63,b,91,a,c,92,a,d,31,a,e,386,a,f,397,a,g,32,a),unit_del(a,30)].
0.49/0.82	
0.49/0.82	% SZS output end Refutation
0.49/0.82	============================== end of proof ==========================
0.49/0.82	
0.49/0.82	============================== STATISTICS ============================
0.49/0.82	
0.49/0.82	Given=64. Generated=768. Kept=415. proofs=1.
0.49/0.82	Usable=62. Sos=304. Demods=3. Limbo=1, Disabled=105. Hints=0.
0.49/0.82	Megabytes=0.46.
0.49/0.82	User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
0.49/0.82	
0.49/0.82	============================== end of statistics =====================
0.49/0.82	
0.49/0.82	============================== end of search =========================
0.49/0.82	
0.49/0.82	THEOREM PROVED
0.49/0.82	% SZS status Theorem
0.49/0.82	
0.49/0.82	Exiting with 1 proof.
0.49/0.82	
0.49/0.82	Process 23657 exit (max_proofs) Tue Aug  9 03:17:50 2022
0.49/0.82	Prover9 interrupted
0.49/0.82	EOF