0.05/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.09	% Command    : tptp2X_and_run_prover9 %d %s
0.09/0.29	% Computer   : n025.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   : 1200
0.09/0.29	% DateTime   : Tue Jul 13 12:49:57 EDT 2021
0.09/0.29	% CPUTime    : 
0.69/1.01	============================== Prover9 ===============================
0.69/1.01	Prover9 (32) version 2009-11A, November 2009.
0.69/1.01	Process 8787 was started by sandbox2 on n025.cluster.edu,
0.69/1.01	Tue Jul 13 12:49:57 2021
0.69/1.01	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_8634_n025.cluster.edu".
0.69/1.01	============================== end of head ===========================
0.69/1.01	
0.69/1.01	============================== INPUT =================================
0.69/1.01	
0.69/1.01	% Reading from file /tmp/Prover9_8634_n025.cluster.edu
0.69/1.01	
0.69/1.01	set(prolog_style_variables).
0.69/1.01	set(auto2).
0.69/1.01	    % set(auto2) -> set(auto).
0.69/1.01	    % set(auto) -> set(auto_inference).
0.69/1.01	    % set(auto) -> set(auto_setup).
0.69/1.01	    % set(auto_setup) -> set(predicate_elim).
0.69/1.01	    % set(auto_setup) -> assign(eq_defs, unfold).
0.69/1.01	    % set(auto) -> set(auto_limits).
0.69/1.01	    % set(auto_limits) -> assign(max_weight, "100.000").
0.69/1.01	    % set(auto_limits) -> assign(sos_limit, 20000).
0.69/1.01	    % set(auto) -> set(auto_denials).
0.69/1.01	    % set(auto) -> set(auto_process).
0.69/1.01	    % set(auto2) -> assign(new_constants, 1).
0.69/1.01	    % set(auto2) -> assign(fold_denial_max, 3).
0.69/1.01	    % set(auto2) -> assign(max_weight, "200.000").
0.69/1.01	    % set(auto2) -> assign(max_hours, 1).
0.69/1.01	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.69/1.01	    % set(auto2) -> assign(max_seconds, 0).
0.69/1.01	    % set(auto2) -> assign(max_minutes, 5).
0.69/1.01	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.69/1.01	    % set(auto2) -> set(sort_initial_sos).
0.69/1.01	    % set(auto2) -> assign(sos_limit, -1).
0.69/1.01	    % set(auto2) -> assign(lrs_ticks, 3000).
0.69/1.01	    % set(auto2) -> assign(max_megs, 400).
0.69/1.01	    % set(auto2) -> assign(stats, some).
0.69/1.01	    % set(auto2) -> clear(echo_input).
0.69/1.01	    % set(auto2) -> set(quiet).
0.69/1.01	    % set(auto2) -> clear(print_initial_clauses).
0.69/1.01	    % set(auto2) -> clear(print_given).
0.69/1.01	assign(lrs_ticks,-1).
0.69/1.01	assign(sos_limit,10000).
0.69/1.01	assign(order,kbo).
0.69/1.01	set(lex_order_vars).
0.69/1.01	clear(print_given).
0.69/1.01	
0.69/1.01	% formulas(sos).  % not echoed (17 formulas)
0.69/1.01	
0.69/1.01	============================== end of input ==========================
0.69/1.01	
0.69/1.01	% From the command line: assign(max_seconds, 1200).
0.69/1.01	
0.69/1.01	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.69/1.01	
0.69/1.01	% Formulas that are not ordinary clauses:
0.69/1.01	1 (all C all C1 all C2 all C3 (part_of(C1,C) & (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,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.69/1.01	2 (all P all C ((all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> 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.69/1.01	3 (all C all C1 (C1 != C & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	4 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	5 (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.69/1.01	6 (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.69/1.01	7 (all C all C1 all C2 all P (closed(C) & C = sum(C1,C2) & meet(P,C1,C2) -> (all Q (end_point(Q,C1) -> meet(Q,C1,C2))))) # label(c7) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	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.69/1.01	9 (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.69/1.01	10 (all C all P all Q all R (end_point(R,C) & end_point(Q,C) & end_point(P,C) -> Q = P | Q = R | P = R)) # label(c5) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	11 (all C all C1 all C2 ((all Q (incident_c(Q,C) <-> incident_c(Q,C2) | incident_c(Q,C1))) <-> C = sum(C1,C2))) # label(sum_defn) # label(axiom) # label(non_clause).  [assumption].
0.69/1.01	12 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.73/1.05	13 (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.73/1.05	14 (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.73/1.05	15 (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,C) & end_point(Q,C1))))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.73/1.05	16 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.73/1.05	17 -(all C all C1 all C2 all P (meet(P,C1,C2) & part_of(C1,C) & part_of(C2,C) -> -end_point(P,C))) # label(proposition_2_14_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.05	
0.73/1.05	============================== end of process non-clausal formulas ===
0.73/1.05	
0.73/1.05	============================== PROCESS INITIAL CLAUSES ===============
0.73/1.05	
0.73/1.05	============================== PREDICATE ELIMINATION =================
0.73/1.05	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.73/1.05	19 inner_point(f8(A),A) # label(c3) # label(axiom).  [clausify(12)].
0.73/1.05	Derived: -end_point(f8(A),A).  [resolve(18,a,19,a)].
0.73/1.05	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.73/1.05	Derived: incident_c(f8(A),A).  [resolve(20,a,19,a)].
0.73/1.05	21 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.73/1.05	22 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom).  [clausify(13)].
0.73/1.05	Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))).  [resolve(22,a,19,a)].
0.73/1.05	Derived: meet(A,f9(B,A),f10(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(22,a,21,a)].
0.73/1.05	23 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom).  [clausify(13)].
0.73/1.05	Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A.  [resolve(23,a,19,a)].
0.73/1.05	Derived: sum(f9(A,B),f10(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(23,a,21,a)].
0.73/1.05	24 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(4)].
0.73/1.05	25 end_point(f3(A),A) | closed(A) # label(closed_defn) # label(axiom).  [clausify(4)].
0.73/1.05	Derived: -end_point(A,B) | end_point(f3(B),B).  [resolve(24,b,25,b)].
0.73/1.05	26 -closed(A) | sum(B,C) != A | -meet(D,B,C) | -end_point(E,B) | meet(E,B,C) # label(c7) # label(axiom).  [clausify(7)].
0.73/1.05	Derived: sum(A,B) != C | -meet(D,A,B) | -end_point(E,A) | meet(E,A,B) | end_point(f3(C),C).  [resolve(26,a,25,b)].
0.73/1.05	27 -open(A) | end_point(f13(A),A) # label(open_defn) # label(axiom).  [clausify(16)].
0.73/1.05	28 open(A) | -end_point(B,A) # label(open_defn) # label(axiom).  [clausify(16)].
0.73/1.05	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(27,a,28,a)].
0.73/1.05	29 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom).  [clausify(3)].
0.73/1.05	Derived: A = B | -part_of(A,B) | end_point(f13(A),A).  [resolve(29,c,27,a)].
0.73/1.05	
0.73/1.05	============================== end predicate elimination =============
0.73/1.05	
0.73/1.05	Auto_denials:  (non-Horn, no changes).
0.73/1.05	
0.73/1.05	Term ordering decisions:
0.73/1.05	Function symbol KB weights:  c10=1. c11=1. c12=1. c13=1. sum=1. f1=1. f2=1. f4=1. f5=1. f6=1. f9=1. f10=1. f11=1. f3=1. f8=1. f13=1. f7=1. f12=1.
0.73/1.05	
0.73/1.05	============================== end of process initial clauses ========
0.73/1.05	
0.73/1.05	============================== CLAUSES FOR SEARCH ====================
0.73/1.05	
0.73/1.05	============================== end of clauses for search =============
0.73/1.05	
0.73/1.05	============================== SEARCH ================================
0.73/1.05	
0.73/1.05	% Starting search at 0.01 seconds.
0.73/1.05	
0.73/1.05	============================== PROOF =================================
0.73/1.05	% SZS status Theorem
0.73/1.05	% SZS output start Refutation
0.73/1.05	
0.73/1.05	% Proof 1 at 0.05 (+ 0.00) seconds.
0.73/1.05	% Length of proof is 28.
0.73/1.05	% Level of proof is 5.
0.73/1.05	% Maximum clause weight is 21.000.
0.73/1.05	% Given clauses 64.
0.73/1.05	
0.73/1.05	2 (all P all C ((all C1 all C2 (part_of(C1,C) & part_of(C2,C) & incident_c(P,C1) & incident_c(P,C2) -> 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.73/1.05	6 (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.73/1.05	9 (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.05	12 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.73/1.05	15 (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,C) & end_point(Q,C1))))) # label(meet_defn) # label(axiom) # label(non_clause).  [assumption].
0.73/1.05	17 -(all C all C1 all C2 all P (meet(P,C1,C2) & part_of(C1,C) & part_of(C2,C) -> -end_point(P,C))) # label(proposition_2_14_3) # label(negated_conjecture) # label(non_clause).  [assumption].
0.73/1.05	18 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.73/1.05	19 inner_point(f8(A),A) # label(c3) # label(axiom).  [clausify(12)].
0.73/1.05	20 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.73/1.05	30 part_of(c11,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.73/1.05	31 part_of(c12,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.73/1.05	32 end_point(c13,c10) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.73/1.05	33 meet(c13,c11,c12) # label(proposition_2_14_3) # label(negated_conjecture).  [clausify(17)].
0.73/1.05	39 -meet(A,B,C) | incident_c(A,B) # label(meet_defn) # label(axiom).  [clausify(15)].
0.73/1.05	40 -meet(A,B,C) | incident_c(A,C) # label(meet_defn) # label(axiom).  [clausify(15)].
0.73/1.05	43 -incident_c(A,B) | incident_c(A,C) | -part_of(B,C) # label(part_of_defn) # label(axiom).  [clausify(9)].
0.73/1.05	55 -meet(A,B,C) | -incident_c(D,B) | -incident_c(D,C) | end_point(D,B) # label(meet_defn) # label(axiom).  [clausify(15)].
0.73/1.05	56 -meet(A,B,C) | -incident_c(D,B) | -incident_c(D,C) | end_point(D,C) # label(meet_defn) # label(axiom).  [clausify(15)].
0.73/1.05	63 -part_of(A,B) | -part_of(C,B) | -incident_c(D,A) | -incident_c(D,C) | part_of(C,A) | part_of(A,C) | -end_point(D,B) # label(end_point_defn) # label(axiom).  [clausify(2)].
0.73/1.05	66 -end_point(f8(A),A).  [resolve(18,a,19,a)].
0.73/1.05	67 incident_c(f8(A),A).  [resolve(20,a,19,a)].
0.73/1.05	91 incident_c(c13,c11).  [resolve(39,a,33,a)].
0.73/1.05	92 incident_c(c13,c12).  [resolve(40,a,33,a)].
0.73/1.05	282 -incident_c(f8(c12),c11).  [ur(56,a,33,a,c,67,a,d,66,a)].
0.73/1.05	283 -incident_c(f8(c11),c12).  [ur(55,a,33,a,b,67,a,d,66,a)].
0.73/1.05	386 -part_of(c12,c11).  [ur(43,a,67,a,b,282,a)].
0.73/1.05	397 -part_of(c11,c12).  [ur(43,a,67,a,b,283,a)].
0.73/1.05	446 $F.  [ur(63,b,31,a,c,91,a,d,92,a,e,386,a,f,397,a,g,32,a),unit_del(a,30)].
0.73/1.05	
0.73/1.05	% SZS output end Refutation
0.73/1.05	============================== end of proof ==========================
0.73/1.05	
0.73/1.05	============================== STATISTICS ============================
0.73/1.05	
0.73/1.05	Given=64. Generated=768. Kept=415. proofs=1.
0.73/1.05	Usable=62. Sos=304. Demods=3. Limbo=1, Disabled=105. Hints=0.
0.73/1.05	Megabytes=0.46.
0.73/1.05	User_CPU=0.05, System_CPU=0.00, Wall_clock=1.
0.73/1.05	
0.73/1.05	============================== end of statistics =====================
0.73/1.05	
0.73/1.05	============================== end of search =========================
0.73/1.05	
0.73/1.05	THEOREM PROVED
0.73/1.05	% SZS status Theorem
0.73/1.05	
0.73/1.05	Exiting with 1 proof.
0.73/1.05	
0.73/1.05	Process 8787 exit (max_proofs) Tue Jul 13 12:49:58 2021
0.73/1.05	Prover9 interrupted
0.73/1.05	EOF