0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.11	% Command    : tptp2X_and_run_prover9 %d %s
0.11/0.32	% Computer   : n014.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   : 1200
0.11/0.32	% DateTime   : Tue Jul 13 12:29:34 EDT 2021
0.11/0.32	% CPUTime    : 
0.72/1.00	============================== Prover9 ===============================
0.72/1.00	Prover9 (32) version 2009-11A, November 2009.
0.72/1.00	Process 12112 was started by sandbox2 on n014.cluster.edu,
0.72/1.00	Tue Jul 13 12:29:35 2021
0.72/1.00	The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 1200 -f /tmp/Prover9_11959_n014.cluster.edu".
0.72/1.00	============================== end of head ===========================
0.72/1.00	
0.72/1.00	============================== INPUT =================================
0.72/1.00	
0.72/1.00	% Reading from file /tmp/Prover9_11959_n014.cluster.edu
0.72/1.00	
0.72/1.00	set(prolog_style_variables).
0.72/1.00	set(auto2).
0.72/1.00	    % set(auto2) -> set(auto).
0.72/1.00	    % set(auto) -> set(auto_inference).
0.72/1.00	    % set(auto) -> set(auto_setup).
0.72/1.00	    % set(auto_setup) -> set(predicate_elim).
0.72/1.00	    % set(auto_setup) -> assign(eq_defs, unfold).
0.72/1.00	    % set(auto) -> set(auto_limits).
0.72/1.00	    % set(auto_limits) -> assign(max_weight, "100.000").
0.72/1.00	    % set(auto_limits) -> assign(sos_limit, 20000).
0.72/1.00	    % set(auto) -> set(auto_denials).
0.72/1.00	    % set(auto) -> set(auto_process).
0.72/1.00	    % set(auto2) -> assign(new_constants, 1).
0.72/1.00	    % set(auto2) -> assign(fold_denial_max, 3).
0.72/1.00	    % set(auto2) -> assign(max_weight, "200.000").
0.72/1.00	    % set(auto2) -> assign(max_hours, 1).
0.72/1.00	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.72/1.00	    % set(auto2) -> assign(max_seconds, 0).
0.72/1.00	    % set(auto2) -> assign(max_minutes, 5).
0.72/1.00	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.72/1.00	    % set(auto2) -> set(sort_initial_sos).
0.72/1.00	    % set(auto2) -> assign(sos_limit, -1).
0.72/1.00	    % set(auto2) -> assign(lrs_ticks, 3000).
0.72/1.00	    % set(auto2) -> assign(max_megs, 400).
0.72/1.00	    % set(auto2) -> assign(stats, some).
0.72/1.00	    % set(auto2) -> clear(echo_input).
0.72/1.00	    % set(auto2) -> set(quiet).
0.72/1.00	    % set(auto2) -> clear(print_initial_clauses).
0.72/1.00	    % set(auto2) -> clear(print_given).
0.72/1.00	assign(lrs_ticks,-1).
0.72/1.00	assign(sos_limit,10000).
0.72/1.00	assign(order,kbo).
0.72/1.00	set(lex_order_vars).
0.72/1.00	clear(print_given).
0.72/1.00	
0.72/1.00	% formulas(sos).  % not echoed (18 formulas)
0.72/1.00	
0.72/1.00	============================== end of input ==========================
0.72/1.00	
0.72/1.00	% From the command line: assign(max_seconds, 1200).
0.72/1.00	
0.72/1.00	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.72/1.00	
0.72/1.00	% Formulas that are not ordinary clauses:
0.72/1.00	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.72/1.00	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.72/1.00	3 (all C all C1 (C1 != C & part_of(C1,C) -> open(C1))) # label(c1) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	4 (all C (-(exists P end_point(P,C)) <-> closed(C))) # label(closed_defn) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	12 (all C exists P inner_point(P,C)) # label(c3) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	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.72/1.00	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.72/1.00	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.72/1.00	16 (all C (open(C) <-> (exists P end_point(P,C)))) # label(open_defn) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	17 (all C all P all Q all R ((exists Cpp (part_of(Cpp,C) & inner_point(Q,Cpp) & end_point(R,Cpp) & end_point(P,Cpp))) & P != R <-> between_c(C,P,Q,R))) # label(between_c_defn) # label(axiom) # label(non_clause).  [assumption].
0.72/1.00	18 -(all C all P (open(C) -> (end_point(P,C) <-> incident_c(P,C) & -(exists Q exists R between_c(C,Q,P,R))))) # label(theorem_3_6) # label(negated_conjecture) # label(non_clause).  [assumption].
0.72/1.00	
0.72/1.00	============================== end of process non-clausal formulas ===
0.72/1.00	
0.72/1.00	============================== PROCESS INITIAL CLAUSES ===============
0.72/1.00	
0.72/1.00	============================== PREDICATE ELIMINATION =================
0.72/1.00	19 -open(A) | end_point(f13(A),A) # label(open_defn) # label(axiom).  [clausify(16)].
0.72/1.00	20 open(c10) # label(theorem_3_6) # label(negated_conjecture).  [clausify(18)].
0.72/1.00	21 open(A) | -end_point(B,A) # label(open_defn) # label(axiom).  [clausify(16)].
0.72/1.00	Derived: end_point(f13(c10),c10).  [resolve(19,a,20,a)].
0.72/1.00	Derived: end_point(f13(A),A) | -end_point(B,A).  [resolve(19,a,21,a)].
0.72/1.00	22 A = B | -part_of(A,B) | open(A) # label(c1) # label(axiom).  [clausify(3)].
0.72/1.00	Derived: A = B | -part_of(A,B) | end_point(f13(A),A).  [resolve(22,c,19,a)].
0.72/1.00	23 -inner_point(A,B) | -end_point(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.72/1.00	24 inner_point(f8(A),A) # label(c3) # label(axiom).  [clausify(12)].
0.72/1.00	Derived: -end_point(f8(A),A).  [resolve(23,a,24,a)].
0.72/1.00	25 -inner_point(A,B) | incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.72/1.00	Derived: incident_c(f8(A),A).  [resolve(25,a,24,a)].
0.72/1.00	26 inner_point(A,B) | end_point(A,B) | -incident_c(A,B) # label(inner_point_defn) # label(axiom).  [clausify(6)].
0.72/1.00	27 -inner_point(A,B) | meet(A,f9(B,A),f10(B,A)) # label(c4) # label(axiom).  [clausify(13)].
0.72/1.00	Derived: meet(f8(A),f9(A,f8(A)),f10(A,f8(A))).  [resolve(27,a,24,a)].
0.72/1.00	Derived: meet(A,f9(B,A),f10(B,A)) | end_point(A,B) | -incident_c(A,B).  [resolve(27,a,26,a)].
0.72/1.00	28 -inner_point(A,B) | sum(f9(B,A),f10(B,A)) = B # label(c4) # label(axiom).  [clausify(13)].
0.72/1.00	Derived: sum(f9(A,f8(A)),f10(A,f8(A))) = A.  [resolve(28,a,24,a)].
0.72/1.00	Derived: sum(f9(A,B),f10(A,B)) = A | end_point(B,A) | -incident_c(B,A).  [resolve(28,a,26,a)].
0.72/1.00	29 inner_point(A,f14(B,C,A,D)) | -between_c(B,C,A,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.72/1.00	Derived: -between_c(A,B,C,D) | -end_point(C,f14(A,B,C,D)).  [resolve(29,a,23,a)].
0.72/1.00	Derived: -between_c(A,B,C,D) | incident_c(C,f14(A,B,C,D)).  [resolve(29,a,25,a)].
0.72/1.00	Derived: -between_c(A,B,C,D) | meet(C,f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)).  [resolve(29,a,27,a)].
0.72/1.00	Derived: -between_c(A,B,C,D) | sum(f9(f14(A,B,C,D),C),f10(f14(A,B,C,D),C)) = f14(A,B,C,D).  [resolve(29,a,28,a)].
0.72/1.00	30 -part_of(A,B) | -inner_point(C,A) | -end_point(D,A) | -end_point(E,A) | D = E | between_c(B,E,C,D) # label(between_c_defn) # label(axiom).  [clausify(17)].
0.72/1.00	Derived: -part_of(A,B) | -end_point(C,A) | -end_point(D,A) | C = D | between_c(B,D,f8(A),C).  [resolve(30,b,24,a)].
0.72/1.00	Derived: -part_of(A,B) | -end_point(C,A) | -end_point(D,A) | C = D | between_c(B,D,E,C) | end_point(E,A) | -incident_c(E,A).  [resolve(30,b,26,a)].
0.72/1.00	Derived: -part_of(f14(A,B,C,D),E) | -end_point(F,f14(A,B,C,D)) | -end_point(V6,f14(A,B,C,D)) | F = V6 | between_c(E,V6,C,F) | -between_c(A,B,C,D).  [resolve(30,b,29,a)].
0.72/1.00	31 -end_point(A,B) | -closed(B) # label(closed_defn) # label(axiom).  [clausify(4)].
0.72/1.00	32 end_point(f3(A),A) | closed(A) # label(closed_defn)Alarm clock 
119.78/120.07	Prover9 interrupted
119.78/120.07	EOF