0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n159.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.24 % CPULimit : 300 0.02/0.24 % DateTime : Sat Jul 14 04:24:26 CDT 2018 0.02/0.24 % CPUTime : 0.07/0.46 ============================== Prover9 =============================== 0.07/0.46 Prover9 (32) version 2009-11A, November 2009. 0.07/0.46 Process 47174 was started by sandbox2 on n159.star.cs.uiowa.edu, 0.07/0.46 Sat Jul 14 04:24:26 2018 0.07/0.46 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_47113_n159.star.cs.uiowa.edu". 0.07/0.46 ============================== end of head =========================== 0.07/0.46 0.07/0.46 ============================== INPUT ================================= 0.07/0.46 0.07/0.46 % Reading from file /tmp/Prover9_47113_n159.star.cs.uiowa.edu 0.07/0.46 0.07/0.46 set(prolog_style_variables). 0.07/0.46 set(auto2). 0.07/0.46 % set(auto2) -> set(auto). 0.07/0.46 % set(auto) -> set(auto_inference). 0.07/0.46 % set(auto) -> set(auto_setup). 0.07/0.46 % set(auto_setup) -> set(predicate_elim). 0.07/0.46 % set(auto_setup) -> assign(eq_defs, unfold). 0.07/0.46 % set(auto) -> set(auto_limits). 0.07/0.46 % set(auto_limits) -> assign(max_weight, "100.000"). 0.07/0.46 % set(auto_limits) -> assign(sos_limit, 20000). 0.07/0.46 % set(auto) -> set(auto_denials). 0.07/0.46 % set(auto) -> set(auto_process). 0.07/0.46 % set(auto2) -> assign(new_constants, 1). 0.07/0.46 % set(auto2) -> assign(fold_denial_max, 3). 0.07/0.46 % set(auto2) -> assign(max_weight, "200.000"). 0.07/0.46 % set(auto2) -> assign(max_hours, 1). 0.07/0.46 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.07/0.46 % set(auto2) -> assign(max_seconds, 0). 0.07/0.46 % set(auto2) -> assign(max_minutes, 5). 0.07/0.46 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.07/0.46 % set(auto2) -> set(sort_initial_sos). 0.07/0.46 % set(auto2) -> assign(sos_limit, -1). 0.07/0.46 % set(auto2) -> assign(lrs_ticks, 3000). 0.07/0.46 % set(auto2) -> assign(max_megs, 400). 0.07/0.46 % set(auto2) -> assign(stats, some). 0.07/0.46 % set(auto2) -> clear(echo_input). 0.07/0.46 % set(auto2) -> set(quiet). 0.07/0.46 % set(auto2) -> clear(print_initial_clauses). 0.07/0.46 % set(auto2) -> clear(print_given). 0.07/0.46 assign(lrs_ticks,-1). 0.07/0.46 assign(sos_limit,10000). 0.07/0.46 assign(order,kbo). 0.07/0.46 set(lex_order_vars). 0.07/0.46 clear(print_given). 0.07/0.46 0.07/0.46 % formulas(sos). % not echoed (19 formulas) 0.07/0.46 0.07/0.46 ============================== end of input ========================== 0.07/0.46 0.07/0.46 % From the command line: assign(max_seconds, 300). 0.07/0.46 0.07/0.46 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.07/0.46 0.07/0.46 % Formulas that are not ordinary clauses: 0.07/0.46 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.46 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.46 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.46 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.46 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.46 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.46 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.46 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.46 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.46 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.46 11 (all E (edge(E) -> head_of(E) != tail_of(E))) # label(no_loops) # label(axiom) # label(non_clause). [assumption]. 0.07/0.46 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.46 13 (all E1 all E2 all E3 (edge(E1) & sequential(E2,E3) & sequential(E3,E1) & sequential(E1,E2) & edge(E3) & edge(E2) <-> triangle(E1,E2,E3))) # label(triangle_defn) # label(axiom) # label(non_clause). [assumption]. 0.07/0.46 14 (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.46 15 (all P all V1 all V2 ((all E1 all E2 (on_path(E1,P) & sequential(E1,E2) & on_path(E2,P) -> (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.46 16 complete -> (all V1 all V2 all E1 all E2 all P (sequential(E1,E2) & precedes(E1,E2,P) & shortest_path(V1,V2,P) -> (exists E3 triangle(E1,E2,E3)))) # label(sequential_is_triangle) # label(lemma) # label(non_clause). [assumption]. 0.07/0.46 17 (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.46 18 (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.46 19 -(complete -> (all P all V1 all V2 (shortest_path(V1,V2,P) -> less_or_equal(minus(length_of(P),n1),number_of_in(triangles,graph))))) # label(maximal_path_length) # label(negated_conjecture) # label(non_clause). [assumption]. 0.07/0.46 0.07/0.46 ============================== end of process non-clausal formulas === 0.07/0.46 0.07/0.46 ============================== PROCESS INITIAL CLAUSES =============== 0.07/0.46 0.07/0.46 ============================== PREDICATE ELIMINATION ================= 0.07/0.46 20 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 0.07/0.46 21 shortest_path(c2,c3,c1) # label(maximal_path_length) # label(negated_conjecture). [clausify(19)]. 0.07/0.46 Derived: c3 != c2. [resolve(20,b,21,a)]. 0.07/0.46 22 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom). [clausify(4)]. 0.07/0.46 Derived: -precedes(A,B,c1) | -precedes(B,A,c1). [resolve(22,a,21,a)]. 0.07/0.46 23 -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.46 Derived: -precedes(A,B,c1) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A). [resolve(23,a,21,a)]. 0.07/0.46 24 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). [clausify(6)]. 0.07/0.46 Derived: path(c2,c3,c1). [resolve(24,b,21,a)]. 0.07/0.46 25 -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.46 Derived: -path(c2,c3,A) | less_or_equal(length_of(c1),length_of(A)). [resolve(25,c,21,a)]. 0.07/0.46 26 -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.46 Derived: -path(A,B,C) | B = A | path(A,B,f5(A,B,C)) | -precedes(D,E,C) | -precedes(E,D,C). [resolve(26,d,22,a)]. 0.07/0.46 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(26,d,23,a)]. 0.07/0.46 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(26,d,25,c)]. 12.11/12.34 27 -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). [clausify(6)]. 12.11/12.34 Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f5(A,B,C))) | -precedes(D,E,C) | -precedes(E,D,C). [resolve(27,d,22,a)]. 12.11/12.34 Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f5(A,B,C))) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D). [resolve(27,d,23,a)]. 12.11/12.34 Derived: -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f5(A,B,C))) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)). [resolve(27,d,25,c)]. 12.11/12.34 28 -complete | -sequential(A,B) | -precedes(A,B,C) | -shortest_path(D,E,C) | triangle(A,B,f9(D,E,A,B,C)) # label(sequential_is_triangle) # label(lemma). [clausify(16)]. 12.11/12.34 Derived: -complete | -sequential(A,B) | -precedes(A,B,c1) | triangle(A,B,f9(c2,c3,A,B,c1)). [resolve(28,d,21,a)]. 12.11/12.34 Derived: -complete | -sequential(A,B) | -precedes(A,B,C) | triangle(A,B,f9(D,E,A,B,C)) | -path(D,E,C) | E = D | path(D,E,f5(D,E,C)). [resolve(28,d,26,d)]. 12.11/12.34 Derived: -complete | -sequential(A,B) | -precedes(A,B,C) | triangle(A,B,f9(D,E,A,B,C)) | -path(D,E,C) | E = D | -less_or_equal(length_of(C),length_of(f5(D,E,C))). [resolve(28,d,27,d)]. 12.11/12.34 29 -path(A,B,C) | -on_path(D,C) | in_path(head_of(D),C) # label(on_path_properties) # label(axiom). [clausify(8)]. 12.11/12.34 30 -in_path(A,B) | -path(C,D,B) | vertex(A) # label(in_path_properties) # label(axiom). [clausify(1)]. 12.11/12.34 Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(head_of(D)). [resolve(29,c,30,a)]. 12.11/12.34 31 -path(A,B,C) | -on_path(D,C) | in_path(tail_of(D),C) # label(on_path_properties) # label(axiom). [clausify(8)]. 12.11/12.34 Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(tail_of(D)). [resolve(31,c,30,a)]. 12.11/12.34 32 -in_path(A,B) | -path(C,D,B) | on_path(f1(C,D,B,A),B) # label(in_path_properties) # label(axiom). [clausify(1)]. 12.11/12.34 Derived: -path(A,B,C) | on_path(f1(A,B,C,head_of(D)),C) | -path(E,F,C) | -on_path(D,C). [resolve(32,a,29,c)]. 12.11/12.34 Derived: -path(A,B,C) | on_path(f1(A,B,C,tail_of(D)),C) | -path(E,F,C) | -on_path(D,C). [resolve(32,a,31,c)]. 12.11/12.34 33 -in_path(A,B) | -path(C,D,B) | tail_of(f1(C,D,B,A)) = A | head_of(f1(C,D,B,A)) = A # label(in_path_properties) # label(axiom). [clausify(1)]. 12.11/12.34 Derived: -path(A,B,C) | tail_of(f1(A,B,C,head_of(D))) = head_of(D) | head_of(f1(A,B,C,head_of(D))) = head_of(D) | -path(E,F,C) | -on_path(D,C). [resolve(33,a,29,c)]. 12.11/12.34 Derived: -path(A,B,C) | tail_of(f1(A,B,C,tail_of(D))) = tail_of(D) | head_of(f1(A,B,C,tail_of(D))) = tail_of(D) | -path(E,F,C) | -on_path(D,C). [resolve(33,a,31,c)]. 12.11/12.34 12.11/12.34 ============================== end predicate elimination ============= 12.11/12.34 12.11/12.34 Auto_denials: (non-Horn, no changes). 12.11/12.34 12.11/12.34 Term ordering decisions: 12.11/12.34 Function symbol KB weights: sequential_pairs=1. triangles=1. empty=1. edges=1. graph=1. n1=1. c1=1. c2=1. c3=1. number_of_in=1. path_cons=1. minus=1. f4=1. head_of=1. tail_of=1. length_of=1. f2=1. f3=1. f5=1. f7=1. f8=1. f1=1. f6=1. f9=1. 12.11/12.34 12.11/12.34 ============================== end of process initial clauses ======== 12.11/12.34 12.11/12.34 ============================== CLAUSES FOR SEARCH ==================== 12.11/12.34 12.11/12.34 ============================== end of clauses for search ============= 12.11/12.34 12.11/12.34 ============================== SEARCH ================================ 12.11/12.34 12.11/12.34 % Starting search at 0.01 seconds. 12.11/12.34 12.11/12.34 Low Water (keep): wt=99.000, iters=3347 12.11/12.34 12.11/12.34 Low Water (keep): wt=90.000, iters=3421 12.11/12.34 12.11/12.34 Low Water (keep): wt=82.000, iters=3403 12.11/12.34 12.11/12.34 Low Water (keep): wt=76.000, iters=3416 12.11/12.34 12.11/12.34 Low Water (keep): wt=72.000, iters=3338 12.11/12.34 12.11/12.34 Low Water (keep): wt=71.000, iters=3408 12.11/12.34 12.11/12.34 Low Water (keep): wt=69.000, iters=3387 12.11/12.34 12.11/12.34 Low Water (keep): wt=63.000, iters=3352 12.11/12.34 12.11/12.34 Low Water (keep): wt=62.000, iters=3550 12.11/12.34 12.11/12.34 Low Water (keep): wt=60.000, iters=3428 12.11/12.34 12.11/12.34 Low Water (keep): wt=58.000, iters=3336 12.11/12.34 12.11/12.34 Low Water (keep): wt=48.000, iters=4416 12.11/12.34 12.11/12.34 Low Water (keep): wt=43.000, iters=3513 12.11/12.34 12.11/12.34 Low Water (keep): wt=42.000, iters=3337 12.11/12.34 12.11/12.34 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 81 (0.00 of 2.77 sec). 12.11/12.34 12.11/12.34 Low Water (keep): wt=40.000, iters=3336 12.11/12.34 12.11/12.34 Low Water (keep): wt=39.000, iters=3364 12.11/12.34 12.11/12.34 Low Water (displace)Cputime limit exceeded (core dumped) 300.08/300.31 EOF