0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.12/0.33 % Computer : n006.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 180 0.12/0.33 % DateTime : Thu Aug 29 15:07:09 EDT 2019 0.12/0.33 % CPUTime : 0.43/1.06 ============================== Prover9 =============================== 0.43/1.06 Prover9 (32) version 2009-11A, November 2009. 0.43/1.06 Process 19257 was started by sandbox on n006.cluster.edu, 0.43/1.06 Thu Aug 29 15:07:10 2019 0.43/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_19104_n006.cluster.edu". 0.43/1.06 ============================== end of head =========================== 0.43/1.06 0.43/1.06 ============================== INPUT ================================= 0.43/1.06 0.43/1.06 % Reading from file /tmp/Prover9_19104_n006.cluster.edu 0.43/1.06 0.43/1.06 set(prolog_style_variables). 0.43/1.06 set(auto2). 0.43/1.06 % set(auto2) -> set(auto). 0.43/1.06 % set(auto) -> set(auto_inference). 0.43/1.06 % set(auto) -> set(auto_setup). 0.43/1.06 % set(auto_setup) -> set(predicate_elim). 0.43/1.06 % set(auto_setup) -> assign(eq_defs, unfold). 0.43/1.06 % set(auto) -> set(auto_limits). 0.43/1.06 % set(auto_limits) -> assign(max_weight, "100.000"). 0.43/1.06 % set(auto_limits) -> assign(sos_limit, 20000). 0.43/1.06 % set(auto) -> set(auto_denials). 0.43/1.06 % set(auto) -> set(auto_process). 0.43/1.06 % set(auto2) -> assign(new_constants, 1). 0.43/1.06 % set(auto2) -> assign(fold_denial_max, 3). 0.43/1.06 % set(auto2) -> assign(max_weight, "200.000"). 0.43/1.06 % set(auto2) -> assign(max_hours, 1). 0.43/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600). 0.43/1.06 % set(auto2) -> assign(max_seconds, 0). 0.43/1.06 % set(auto2) -> assign(max_minutes, 5). 0.43/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300). 0.43/1.06 % set(auto2) -> set(sort_initial_sos). 0.43/1.06 % set(auto2) -> assign(sos_limit, -1). 0.43/1.06 % set(auto2) -> assign(lrs_ticks, 3000). 0.43/1.06 % set(auto2) -> assign(max_megs, 400). 0.43/1.06 % set(auto2) -> assign(stats, some). 0.43/1.06 % set(auto2) -> clear(echo_input). 0.43/1.06 % set(auto2) -> set(quiet). 0.43/1.06 % set(auto2) -> clear(print_initial_clauses). 0.43/1.06 % set(auto2) -> clear(print_given). 0.43/1.06 assign(lrs_ticks,-1). 0.43/1.06 assign(sos_limit,10000). 0.43/1.06 assign(order,kbo). 0.43/1.06 set(lex_order_vars). 0.43/1.06 clear(print_given). 0.43/1.06 0.43/1.06 % formulas(sos). % not echoed (18 formulas) 0.43/1.06 0.43/1.06 ============================== end of input ========================== 0.43/1.06 0.43/1.06 % From the command line: assign(max_seconds, 180). 0.43/1.06 0.43/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 0.43/1.06 0.43/1.06 % Formulas that are not ordinary clauses: 0.43/1.06 1 (all V1 all V2 all P (vertex(V1) & vertex(V2) & (exists E (edge(E) & tail_of(E) = V1 & (P = path_cons(E,empty) & V2 = head_of(E) | (exists TP (path(head_of(E),V2,TP) & P = path_cons(E,TP)))))) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 2 (all V1 all V2 all P all E (path(V1,V2,P) & on_path(E,P) -> in_path(head_of(E),P) & in_path(tail_of(E),P) & edge(E))) # label(on_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 3 complete -> (all V1 all V2 (vertex(V2) & V1 != V2 & vertex(V1) -> (exists E (edge(E) & -(tail_of(E) = V1 & head_of(E) = V2 <-> tail_of(E) = V2 & head_of(E) = V1))))) # label(complete_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 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) | V = tail_of(E)))) & vertex(V))) # label(in_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 5 (all V1 all V2 all P (path(V1,V2,P) -> (exists E (edge(E) & V1 = tail_of(E) & -(V2 = head_of(E) & P = path_cons(E,empty) <-> (exists TP (path(head_of(E),V2,TP) & P = path_cons(E,TP)))))) & vertex(V2) & vertex(V1))) # label(path_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 6 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> -(sequential(E1,E2) <-> (exists E3 (precedes(E3,E2,P) & sequential(E1,E3)))) & on_path(E2,P) & on_path(E1,P))))) # label(precedes_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 7 (all E1 all E2 (edge(E1) & edge(E2) & E1 != E2 & tail_of(E2) = head_of(E1) <-> sequential(E1,E2))) # label(sequential_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 8 (all E (edge(E) -> vertex(tail_of(E)) & vertex(head_of(E)))) # label(edge_ends_are_vertices) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 9 (all V1 all V2 all SP (V1 != V2 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))) & path(V1,V2,SP) <-> shortest_path(V1,V2,SP))) # label(shortest_path_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 10 (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(E2) = head_of(E3) & tail_of(E1) = tail_of(E3))))) # label(shortest_path_properties) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 11 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (on_path(E1,P) & on_path(E2,P) & (sequential(E1,E2) | (exists E3 (precedes(E3,E2,P) & sequential(E1,E3)))) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 12 (all E (edge(E) -> tail_of(E) != head_of(E))) # label(no_loops) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 13 (all P all V1 all V2 (path(V1,V2,P) & (all E1 all E2 (on_path(E2,P) & sequential(E1,E2) & on_path(E1,P) -> (exists E3 triangle(E1,E2,E3)))) -> number_of_in(sequential_pairs,P) = number_of_in(triangles,P))) # label(sequential_pairs_and_triangles) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 14 (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.43/1.06 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.43/1.06 16 (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.43/1.06 17 (all E1 all E2 all E3 (triangle(E1,E2,E3) <-> edge(E2) & edge(E3) & sequential(E1,E2) & sequential(E2,E3) & sequential(E3,E1) & edge(E1))) # label(triangle_defn) # label(axiom) # label(non_clause). [assumption]. 0.43/1.06 18 -(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.43/1.06 0.43/1.06 ============================== end of process non-clausal formulas === 0.43/1.06 0.43/1.06 ============================== PROCESS INITIAL CLAUSES =============== 0.43/1.06 0.43/1.06 ============================== PREDICATE ELIMINATION ================= 0.43/1.06 19 A != B | -shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom). [clausify(9)]. 0.43/1.06 20 shortest_path(c2,c3,c1) # label(maximal_path_length) # label(negated_conjecture). [clausify(18)]. 0.43/1.06 Derived: c3 != c2. [resolve(19,b,20,a)]. 0.43/1.06 21 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom). [clausify(10)]. 0.43/1.06 Derived: -precedes(A,B,c1) | -precedes(B,A,c1). [resolve(21,a,20,a)]. 0.43/1.06 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(10)]. 0.43/1.06 Derived: -precedes(A,B,c1) | head_of(C) != head_of(B) | tail_of(C) != tail_of(A). [resolve(22,a,20,a)]. 0.43/1.06 23 path(A,B,C) | -shortest_path(A,B,C) # label(shortest_path_defn) # label(axiom). [clausify(9)]. 0.43/1.06 Derived: path(c2,c3,c1). [resolve(23,b,20,a)]. 0.43/1.06 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(9)]. 0.43/1.06 Derived: -path(c2,c3,A) | less_or_equal(length_of(c1),length_of(A)). [resolve(24,c,20,a)]. 0.43/1.06 25 A = B | path(B,A,f6(B,A,C)) | -path(B,A,C) | shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom). [clausify(9)]. 0.43/1.06 Derived: A = B | path(B,A,f6(B,A,C)) | -path(B,A,C) | -precedes(D,E,C) | -precedes(E,D,C). [resolve(25,d,21,a)]. 0.43/1.06 Derived: A = B | path(B,A,f6(B,A,C)) | -path(B,A,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D). [resolve(25,d,22,a)]. 0.43/1.06 Derived: A = B | path(B,A,f6(B,A,C)) | -path(B,A,C) | -path(B,A,D) | less_or_equal(length_of(C),length_of(D)). [resolve(25,d,24,c)]. 0.43/1.06 26 A = B | -less_or_equal(length_of(C),length_of(f6(B,A,C))) | -path(B,A,C) | shortest_path(B,A,C) # label(shortest_path_defn) # label(axiom). [clausify(9)]. 0.43/1.06 Derived: A = B | -less_or_equal(length_of(C),length_of(f6(B,A,C))) | -path(B,A,C) | -precedes(D,E,C) | -precedes(E,D,C). [resolve(26,d,21,a)]. 11.09/11.37 Derived: A = B | -less_or_equal(length_of(C),length_of(f6(B,A,C))) | -path(B,A,C) | -precedes(D,E,C) | head_of(F) != head_of(E) | tail_of(F) != tail_of(D). [resolve(26,d,22,a)]. 11.09/11.37 Derived: A = B | -less_or_equal(length_of(C),length_of(f6(B,A,C))) | -path(B,A,C) | -path(B,A,D) | less_or_equal(length_of(C),length_of(D)). [resolve(26,d,24,c)]. 11.09/11.37 27 -path(A,B,C) | -on_path(D,C) | in_path(head_of(D),C) # label(on_path_properties) # label(axiom). [clausify(2)]. 11.09/11.37 28 -in_path(A,B) | -path(C,D,B) | vertex(A) # label(in_path_properties) # label(axiom). [clausify(4)]. 11.09/11.37 Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(head_of(D)). [resolve(27,c,28,a)]. 11.09/11.37 29 -path(A,B,C) | -on_path(D,C) | in_path(tail_of(D),C) # label(on_path_properties) # label(axiom). [clausify(2)]. 11.09/11.37 Derived: -path(A,B,C) | -on_path(D,C) | -path(E,F,C) | vertex(tail_of(D)). [resolve(29,c,28,a)]. 11.09/11.37 30 -in_path(A,B) | -path(C,D,B) | on_path(f2(C,D,B,A),B) # label(in_path_properties) # label(axiom). [clausify(4)]. 11.09/11.37 Derived: -path(A,B,C) | on_path(f2(A,B,C,head_of(D)),C) | -path(E,F,C) | -on_path(D,C). [resolve(30,a,27,c)]. 11.09/11.37 Derived: -path(A,B,C) | on_path(f2(A,B,C,tail_of(D)),C) | -path(E,F,C) | -on_path(D,C). [resolve(30,a,29,c)]. 11.09/11.37 31 -in_path(A,B) | -path(C,D,B) | head_of(f2(C,D,B,A)) = A | tail_of(f2(C,D,B,A)) = A # label(in_path_properties) # label(axiom). [clausify(4)]. 11.09/11.37 Derived: -path(A,B,C) | head_of(f2(A,B,C,head_of(D))) = head_of(D) | tail_of(f2(A,B,C,head_of(D))) = head_of(D) | -path(E,F,C) | -on_path(D,C). [resolve(31,a,27,c)]. 11.09/11.37 Derived: -path(A,B,C) | head_of(f2(A,B,C,tail_of(D))) = tail_of(D) | tail_of(f2(A,B,C,tail_of(D))) = tail_of(D) | -path(E,F,C) | -on_path(D,C). [resolve(31,a,29,c)]. 11.09/11.37 11.09/11.37 ============================== end predicate elimination ============= 11.09/11.37 11.09/11.37 Auto_denials: (non-Horn, no changes). 11.09/11.37 11.09/11.37 Term ordering decisions: 11.09/11.37 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. f1=1. head_of=1. tail_of=1. length_of=1. f3=1. f4=1. f6=1. f7=1. f8=1. f2=1. f5=1. 11.09/11.37 11.09/11.37 ============================== end of process initial clauses ======== 11.09/11.37 11.09/11.37 ============================== CLAUSES FOR SEARCH ==================== 11.09/11.37 11.09/11.37 ============================== end of clauses for search ============= 11.09/11.37 11.09/11.37 ============================== SEARCH ================================ 11.09/11.37 11.09/11.37 % Starting search at 0.02 seconds. 11.09/11.37 11.09/11.37 Low Water (keep): wt=99.000, iters=3335 11.09/11.37 11.09/11.37 Low Water (keep): wt=90.000, iters=3414 11.09/11.37 11.09/11.37 Low Water (keep): wt=82.000, iters=3396 11.09/11.37 11.09/11.37 Low Water (keep): wt=76.000, iters=3408 11.09/11.37 11.09/11.37 Low Water (keep): wt=71.000, iters=3400 11.09/11.37 11.09/11.37 Low Water (keep): wt=69.000, iters=3378 11.09/11.37 11.09/11.37 Low Water (keep): wt=63.000, iters=3344 11.09/11.37 11.09/11.37 Low Water (keep): wt=62.000, iters=3542 11.09/11.37 11.09/11.37 Low Water (keep): wt=60.000, iters=3425 11.09/11.37 11.09/11.37 Low Water (keep): wt=59.000, iters=3420 11.09/11.37 11.09/11.37 Low Water (keep): wt=58.000, iters=3370 11.09/11.37 11.09/11.37 Low Water (keep): wt=48.000, iters=4403 11.09/11.37 11.09/11.37 Low Water (keep): wt=43.000, iters=3498 11.09/11.37 11.09/11.37 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 72 (0.00 of 2.15 sec). 11.09/11.37 11.09/11.37 Low Water (keep): wt=41.000, iters=3560 11.09/11.37 11.09/11.37 Low Water (keep): wt=40.000, iters=3395 11.09/11.37 11.09/11.37 Low Water (keep): wt=39.000, iters=3351 11.09/11.37 11.09/11.37 Low Water (displace): id=4630, wt=128.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4848, wt=124.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4631, wt=118.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4632, wt=117.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4849, wt=114.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5200, wt=113.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5198, wt=111.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4633, wt=107.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4634, wt=104.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4851, wt=103.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5788, wt=101.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4852, wt=100.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5786, wt=99.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4975, wt=97.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5112, wt=95.000 11.09/11.37 11.09/11.37 Low Water (displace): id=3312, wt=92.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4846, wt=91.000 11.09/11.37 11.09/11.37 Low Water (displace): id=5854, wt=90.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4854, wt=86.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4039, wt=85.000 11.09/11.37 11.09/11.37 Low Water (displace): id=4629, wt=83.000 11.09/11.37 11.09/11.37 Low Water Cputime limit exceeded (core dumped) 180.03/180.33 EOF