0.09/0.11	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command  : tptp2X_and_run_prover9 %d %s
0.10/0.31	% Computer : n004.cluster.edu
0.10/0.31	% Model    : x86_64 x86_64
0.10/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.31	% Memory   : 8042.1875MB
0.10/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.31	% CPULimit : 960
0.10/0.31	% WCLimit  : 120
0.10/0.31	% DateTime : Tue Aug  9 06:20:20 EDT 2022
0.10/0.31	% CPUTime  : 
0.75/1.39	============================== Prover9 ===============================
0.75/1.39	Prover9 (32) version 2009-11A, November 2009.
0.75/1.39	Process 27390 was started by sandbox on n004.cluster.edu,
0.75/1.39	Tue Aug  9 06:20:21 2022
0.75/1.39	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 960 -f /tmp/Prover9_27237_n004.cluster.edu".
0.75/1.39	============================== end of head ===========================
0.75/1.39	
0.75/1.39	============================== INPUT =================================
0.75/1.39	
0.75/1.39	% Reading from file /tmp/Prover9_27237_n004.cluster.edu
0.75/1.39	
0.75/1.39	set(prolog_style_variables).
0.75/1.39	set(auto2).
0.75/1.39	    % set(auto2) -> set(auto).
0.75/1.39	    % set(auto) -> set(auto_inference).
0.75/1.39	    % set(auto) -> set(auto_setup).
0.75/1.39	    % set(auto_setup) -> set(predicate_elim).
0.75/1.39	    % set(auto_setup) -> assign(eq_defs, unfold).
0.75/1.39	    % set(auto) -> set(auto_limits).
0.75/1.39	    % set(auto_limits) -> assign(max_weight, "100.000").
0.75/1.39	    % set(auto_limits) -> assign(sos_limit, 20000).
0.75/1.39	    % set(auto) -> set(auto_denials).
0.75/1.39	    % set(auto) -> set(auto_process).
0.75/1.39	    % set(auto2) -> assign(new_constants, 1).
0.75/1.39	    % set(auto2) -> assign(fold_denial_max, 3).
0.75/1.39	    % set(auto2) -> assign(max_weight, "200.000").
0.75/1.39	    % set(auto2) -> assign(max_hours, 1).
0.75/1.39	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.75/1.39	    % set(auto2) -> assign(max_seconds, 0).
0.75/1.39	    % set(auto2) -> assign(max_minutes, 5).
0.75/1.39	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.75/1.39	    % set(auto2) -> set(sort_initial_sos).
0.75/1.39	    % set(auto2) -> assign(sos_limit, -1).
0.75/1.39	    % set(auto2) -> assign(lrs_ticks, 3000).
0.75/1.39	    % set(auto2) -> assign(max_megs, 400).
0.75/1.39	    % set(auto2) -> assign(stats, some).
0.75/1.39	    % set(auto2) -> clear(echo_input).
0.75/1.39	    % set(auto2) -> set(quiet).
0.75/1.39	    % set(auto2) -> clear(print_initial_clauses).
0.75/1.39	    % set(auto2) -> clear(print_given).
0.75/1.39	assign(lrs_ticks,-1).
0.75/1.39	assign(sos_limit,10000).
0.75/1.39	assign(order,kbo).
0.75/1.39	set(lex_order_vars).
0.75/1.39	clear(print_given).
0.75/1.39	
0.75/1.39	% formulas(sos).  % not echoed (18 formulas)
0.75/1.39	
0.75/1.39	============================== end of input ==========================
0.75/1.39	
0.75/1.39	% From the command line: assign(max_seconds, 960).
0.75/1.39	
0.75/1.39	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.75/1.39	
0.75/1.39	% Formulas that are not ordinary clauses:
0.75/1.39	1 (all E1 all E2 (edge(E1) & head_of(E1) = tail_of(E2) & E1 != E2 & edge(E2) <-> sequential(E1,E2))) # label(sequential_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	2 complete -> (all V1 all V2 (vertex(V2) & V1 != V2 & vertex(V1) -> (exists E (-(V1 = head_of(E) & tail_of(E) = V2 <-> head_of(E) = V2 & V1 = tail_of(E)) & edge(E))))) # label(complete_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	3 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E2,P) & ((exists E3 (precedes(E3,E2,P) & sequential(E1,E3))) | sequential(E1,E2)) & on_path(E1,P) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	4 (all V1 all V2 all P all V (in_path(V,P) & path(V1,V2,P) -> (exists E (on_path(E,P) & (V = head_of(E) | tail_of(E) = V))) & vertex(V))) # label(in_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	5 (all E (edge(E) -> vertex(head_of(E)) & vertex(tail_of(E)))) # label(edge_ends_are_vertices) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	6 (all V1 all V2 all SP (path(V1,V2,SP) & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) & V1 != V2 <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E2,P) & -(sequential(E1,E2) <-> (exists E3 (precedes(E3,E2,P) & sequential(E1,E3)))) & on_path(E1,P))))) # label(precedes_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	8 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	9 (all V1 all V2 all P (path(V1,V2,P) -> (exists E (-(P = path_cons(E,empty) & head_of(E) = V2 <-> (exists TP (P = path_cons(E,TP) & path(head_of(E),V2,TP)))) & V1 = tail_of(E) & edge(E))) & vertex(V2) & vertex(V1))) # label(path_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	10 (all V1 all V2 all P ((exists E (edge(E) & V1 = tail_of(E) & ((exists TP (path(head_of(E),V2,TP) & P = path_cons(E,TP))) | P = path_cons(E,empty) & head_of(E) = V2))) & vertex(V2) & vertex(V1) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	11 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -(exists E3 (tail_of(E1) = tail_of(E3) & head_of(E3) = head_of(E2))) & -precedes(E2,E1,P))) # label(shortest_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	12 (all V1 all V2 all P all E (path(V1,V2,P) & on_path(E,P) -> edge(E) & in_path(head_of(E),P) & in_path(tail_of(E),P))) # label(on_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	13 (all E1 all E2 all E3 (triangle(E1,E2,E3) <-> sequential(E1,E2) & sequential(E3,E1) & sequential(E2,E3) & edge(E3) & edge(E2) & edge(E1))) # label(triangle_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	14 (all Things all InThese less_or_equal(number_of_in(Things,InThese),number_of_in(Things,graph))) # label(graph_has_them_all) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	15 (all V1 all V2 all P (path(V1,V2,P) -> length_of(P) = number_of_in(edges,P))) # label(length_defn) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	16 (all V1 all V2 all P (path(V1,V2,P) -> number_of_in(sequential_pairs,P) = minus(length_of(P),n1))) # label(path_length_sequential_pairs) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	17 (all P all V1 all V2 ((all E1 all E2 (sequential(E1,E2) & on_path(E2,P) & on_path(E1,P) -> (exists E3 triangle(E1,E2,E3)))) & path(V1,V2,P) -> number_of_in(sequential_pairs,P) = number_of_in(triangles,P))) # label(sequential_pairs_and_triangles) # label(axiom) # label(non_clause).  [assumption].
0.75/1.39	18 -(complete -> (all P all V1 all V2 (shortest_path(V1,V2,P) -> number_of_in(triangles,P) = minus(length_of(P),n1)))) # label(triangles_on_a_path) # label(negated_conjecture) # label(non_clause).  [assumption].
0.75/1.39	
0.75/1.39	============================== end of process non-clausal formulas ===
0.75/1.39	
0.75/1.39	============================== PROCESS INITIAL CLAUSES ===============
0.75/1.39	
0.75/1.39	============================== PREDICATE ELIMINATION =================
0.75/1.39	19 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.75/1.39	20 shortest_path(c2,c3,c1) # label(triangles_on_a_path) # label(negated_conjecture).  [clausify(18)].
0.75/1.39	Derived: c3 != c2.  [resolve(19,b,20,a)].
0.75/1.39	21 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom).  [clausify(11)].
0.75/1.39	Derived: -precedes(A,B,c1) | -precedes(B,A,c1).  [resolve(21,a,20,a)].
0.75/1.39	22 -shortest_path(A,B,C) | -precedes(D,E,C) | tail_of(F) != tail_of(D) | head_of(F) != head_of(E) # label(shortest_path_properties) # label(axiom).  [clausify(11)].
0.75/1.39	Derived: -precedes(A,B,c1) | tail_of(C) != tail_of(A) | head_of(C) != head_of(B).  [resolve(22,a,20,a)].
0.75/1.39	23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.75/1.39	Derived: path(c2,c3,c1).  [resolve(23,b,20,a)].
0.75/1.39	24 -path(A,B,C) | less_or_equal(length_of(D),length_of(C)) | -shortest_path(A,B,D) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.75/1.39	Derived: -path(c2,c3,A) | less_or_equal(length_of(c1),length_of(A)).  [resolve(24,c,20,a)].
0.75/1.39	25 -path(A,B,C) | path(A,B,f3(A,B,C)) | B = A | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.75/1.39	Derived: -path(A,B,C) | path(A,B,f3(A,B,C)) | B = A | -precedes(D,E,C) | -precedes(E,D,C).  [resolve(25,d,21,a)].
0.75/1.39	Derived: -path(A,B,C) | path(A,B,f3(A,B,C)) | B = A | -precedes(D,E,C) | tail_of(F) != tail_of(D) | head_of(F) != head_of(E).  [resolve(25,d,22,a)].
0.75/1.39	Derived: -path(A,B,C) | path(A,B,f3(A,B,C)) | B = A | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)).  [resolve(25,d,24,c)].
0.75/1.39	26 -path(A,B,C) | -less_or_equal(length_of(C),length_of(f3(A,B,C))) | B = A | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.75/1.39	Derived: -path(A,B,C) | -less_or_equal(length_of(C),length_of(f3(A,B,C))) | B = A | -precedes(D,E,C) | -preAlarm clock 
117.82/120.04	Prover9 interrupted
117.82/120.04	EOF