0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.04	% Command    : tptp2X_and_run_prover9 %d %s
0.03/0.23	% Computer   : n008.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sat Jul 14 05:42:55 CDT 2018
0.03/0.23	% CPUTime    : 
0.07/0.45	============================== Prover9 ===============================
0.07/0.45	Prover9 (32) version 2009-11A, November 2009.
0.07/0.45	Process 56238 was started by sandbox on n008.star.cs.uiowa.edu,
0.07/0.45	Sat Jul 14 05:42:55 2018
0.07/0.45	The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_56206_n008.star.cs.uiowa.edu".
0.07/0.45	============================== end of head ===========================
0.07/0.45	
0.07/0.45	============================== INPUT =================================
0.07/0.45	
0.07/0.45	% Reading from file /tmp/Prover9_56206_n008.star.cs.uiowa.edu
0.07/0.45	
0.07/0.45	set(prolog_style_variables).
0.07/0.45	set(auto2).
0.07/0.45	    % set(auto2) -> set(auto).
0.07/0.45	    % set(auto) -> set(auto_inference).
0.07/0.45	    % set(auto) -> set(auto_setup).
0.07/0.45	    % set(auto_setup) -> set(predicate_elim).
0.07/0.45	    % set(auto_setup) -> assign(eq_defs, unfold).
0.07/0.45	    % set(auto) -> set(auto_limits).
0.07/0.45	    % set(auto_limits) -> assign(max_weight, "100.000").
0.07/0.45	    % set(auto_limits) -> assign(sos_limit, 20000).
0.07/0.45	    % set(auto) -> set(auto_denials).
0.07/0.45	    % set(auto) -> set(auto_process).
0.07/0.45	    % set(auto2) -> assign(new_constants, 1).
0.07/0.45	    % set(auto2) -> assign(fold_denial_max, 3).
0.07/0.45	    % set(auto2) -> assign(max_weight, "200.000").
0.07/0.45	    % set(auto2) -> assign(max_hours, 1).
0.07/0.45	    % assign(max_hours, 1) -> assign(max_seconds, 3600).
0.07/0.45	    % set(auto2) -> assign(max_seconds, 0).
0.07/0.45	    % set(auto2) -> assign(max_minutes, 5).
0.07/0.45	    % assign(max_minutes, 5) -> assign(max_seconds, 300).
0.07/0.45	    % set(auto2) -> set(sort_initial_sos).
0.07/0.45	    % set(auto2) -> assign(sos_limit, -1).
0.07/0.45	    % set(auto2) -> assign(lrs_ticks, 3000).
0.07/0.45	    % set(auto2) -> assign(max_megs, 400).
0.07/0.45	    % set(auto2) -> assign(stats, some).
0.07/0.45	    % set(auto2) -> clear(echo_input).
0.07/0.45	    % set(auto2) -> set(quiet).
0.07/0.45	    % set(auto2) -> clear(print_initial_clauses).
0.07/0.45	    % set(auto2) -> clear(print_given).
0.07/0.45	assign(lrs_ticks,-1).
0.07/0.45	assign(sos_limit,10000).
0.07/0.45	assign(order,kbo).
0.07/0.45	set(lex_order_vars).
0.07/0.45	clear(print_given).
0.07/0.45	
0.07/0.45	% formulas(sos).  % not echoed (18 formulas)
0.07/0.45	
0.07/0.45	============================== end of input ==========================
0.07/0.45	
0.07/0.45	% From the command line: assign(max_seconds, 300).
0.07/0.45	
0.07/0.45	============================== PROCESS NON-CLAUSAL FORMULAS ==========
0.07/0.45	
0.07/0.45	% Formulas that are not ordinary clauses:
0.07/0.45	1 (all V1 all V2 all P all V (in_path(V,P) & path(V1,V2,P) -> (exists E (on_path(E,P) & (V = tail_of(E) | V = head_of(E)))) & vertex(V))) # label(in_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	2 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E2,P) & (sequential(E1,E2) | (exists E3 (sequential(E1,E3) & precedes(E3,E2,P)))) & on_path(E1,P) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	3 (all V1 all V2 all P (path(V1,V2,P) -> (exists E (-(path_cons(E,empty) = P & V2 = head_of(E) <-> (exists TP (path(head_of(E),V2,TP) & path_cons(E,TP) = P))) & V1 = tail_of(E) & edge(E))) & vertex(V2) & vertex(V1))) # label(path_properties) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	4 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -precedes(E2,E1,P) & -(exists E3 (head_of(E3) = head_of(E2) & tail_of(E3) = tail_of(E1))))) # label(shortest_path_properties) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	5 complete -> (all V1 all V2 (V1 != V2 & vertex(V2) & vertex(V1) -> (exists E (-(head_of(E) = V1 & tail_of(E) = V2 <-> V2 = head_of(E) & V1 = tail_of(E)) & edge(E))))) # label(complete_properties) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	6 (all V1 all V2 all SP (path(V1,V2,SP) & V2 != V1 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	7 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> -((exists E3 (sequential(E1,E3) & precedes(E3,E2,P))) <-> sequential(E1,E2)) & on_path(E2,P) & on_path(E1,P))))) # label(precedes_properties) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	8 (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.07/0.45	9 (all V1 all V2 all P (vertex(V1) & vertex(V2) & (exists E (edge(E) & tail_of(E) = V1 & ((exists TP (path_cons(E,TP) = P & path(head_of(E),V2,TP))) | head_of(E) = V2 & P = path_cons(E,empty)))) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	10 (all E (edge(E) -> vertex(head_of(E)) & vertex(tail_of(E)))) # label(edge_ends_are_vertices) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	11 (all E (edge(E) -> head_of(E) != tail_of(E))) # label(no_loops) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	12 (all E1 all E2 (sequential(E1,E2) <-> edge(E1) & head_of(E1) = tail_of(E2) & E1 != E2 & edge(E2))) # label(sequential_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	13 (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.07/0.45	14 (all V1 all V2 all P (path(V1,V2,P) -> minus(length_of(P),n1) = number_of_in(sequential_pairs,P))) # label(path_length_sequential_pairs) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	15 (all V1 all V2 all P (path(V1,V2,P) -> number_of_in(edges,P) = length_of(P))) # label(length_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	16 (all E1 all E2 all E3 (triangle(E1,E2,E3) <-> sequential(E3,E1) & sequential(E2,E3) & sequential(E1,E2) & edge(E3) & edge(E2) & edge(E1))) # label(triangle_defn) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	17 (all P all V1 all V2 ((all E1 all E2 (on_path(E1,P) & on_path(E2,P) & sequential(E1,E2) -> (exists E3 triangle(E1,E2,E3)))) & path(V1,V2,P) -> number_of_in(triangles,P) = number_of_in(sequential_pairs,P))) # label(sequential_pairs_and_triangles) # label(axiom) # label(non_clause).  [assumption].
0.07/0.45	18 -(complete -> (all P all V1 all V2 (shortest_path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & sequential(E1,E2) & on_path(E2,P) -> (exists E3 triangle(E1,E2,E3))))))) # label(complete_means_path_means_stuff_means_triangles) # label(negated_conjecture) # label(non_clause).  [assumption].
0.07/0.45	
0.07/0.45	============================== end of process non-clausal formulas ===
0.07/0.45	
0.07/0.45	============================== PROCESS INITIAL CLAUSES ===============
0.07/0.45	
0.07/0.45	============================== PREDICATE ELIMINATION =================
0.07/0.45	19 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.07/0.45	20 shortest_path(c2,c3,c1) # label(complete_means_path_means_stuff_means_triangles) # label(negated_conjecture).  [clausify(18)].
0.07/0.45	Derived: c3 != c2.  [resolve(19,b,20,a)].
0.07/0.45	21 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom).  [clausify(4)].
0.07/0.45	Derived: -precedes(A,B,c1) | -precedes(B,A,c1).  [resolve(21,a,20,a)].
0.07/0.45	22 -shortest_path(A,B,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D) # label(shortest_path_properties) # label(axiom).  [clausify(4)].
0.07/0.45	Derived: -precedes(A,B,c1) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A).  [resolve(22,a,20,a)].
0.07/0.45	23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.07/0.45	Derived: path(c2,c3,c1).  [resolve(23,b,20,a)].
0.07/0.45	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.07/0.45	Derived: -path(c2,c3,A) | less_or_equal(length_of(c1),length_of(A)).  [resolve(24,c,20,a)].
0.07/0.45	25 -path(A,B,C) | B = A | path(A,B,f5(A,B,C)) | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom).  [clausify(6)].
0.07/0.45	Derived: -path(A,B,C) | B = A | path(A,B,f5(A,B,C)) | -precedes(D,E,C) | -precedes(E,D,C).  [resolve(25,d,21,a)].
0.07/0.45	Derived: -path(A,B,C) | B = A | path(A,B,f5(A,B,C)) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D).  [resolve(25,d,22,a)].
0.07/0.45	Derived: -path(A,B,C) | B = A | path(A,B,f5(A,B,C)) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)).  [resolve(25,d,24,c)].
0.07/0.45	26 -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f5(A,B,C))) | shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). Cputime limit exceeded (core dumped)
300.05/300.22	EOF