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