TSTP Solution File: GRA075+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : GRA075+1 : TPTP v6.4.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n100.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.75MB
% OS : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Feb 8 09:54:11 EST 2017
% Result : Satisfiable 0.07s
% Output : FiniteModel 0.07s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRA075+1 : TPTP v6.4.0. Released v6.4.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.23 % Computer : n100.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.75MB
% 0.03/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.23 % CPULimit : 300
% 0.03/0.23 % DateTime : Tue Feb 7 17:01:31 CST 2017
% 0.03/0.23 % CPUTime :
% 0.07/0.50 % SZS status Satisfiable
% 0.07/0.50 ============================== Mace4 =================================
% 0.07/0.50 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.50 Process 6603 was started by sandbox2 on n100.star.cs.uiowa.edu,
% 0.07/0.50 Tue Feb 7 17:01:32 2017
% 0.07/0.50 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_6570_n100.star.cs.uiowa.edu".
% 0.07/0.50 ============================== end of head ===========================
% 0.07/0.50
% 0.07/0.50 ============================== INPUT =================================
% 0.07/0.50
% 0.07/0.50 % Reading from file /tmp/Mace4_input_6570_n100.star.cs.uiowa.edu
% 0.07/0.50
% 0.07/0.50 set(prolog_style_variables).
% 0.07/0.50 set(print_models_tabular).
% 0.07/0.50 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.50
% 0.07/0.50 formulas(sos).
% 0.07/0.50 (all E (edge(E) -> head_of(E) != tail_of(E))) # label(no_loops) # label(axiom).
% 0.07/0.50 (all E (edge(E) -> vertex(head_of(E)) & vertex(tail_of(E)))) # label(edge_ends_are_vertices) # label(axiom).
% 0.07/0.50 complete -> (all V1 all V2 (vertex(V1) & vertex(V2) & V1 != V2 -> (exists E (edge(E) & -(V1 = head_of(E) & V2 = tail_of(E) <-> V2 = head_of(E) & V1 = tail_of(E)))))) # label(complete_properties) # label(axiom).
% 0.07/0.50 (all V1 all V2 all P (vertex(V1) & vertex(V2) & (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)))))) -> path(V1,V2,P))) # label(path_defn) # label(axiom).
% 0.07/0.50 (all V1 all V2 all P (path(V1,V2,P) -> vertex(V1) & vertex(V2) & (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)))))))) # label(path_properties) # label(axiom).
% 0.07/0.50 (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).
% 0.07/0.50 (all V1 all V2 all P all V (path(V1,V2,P) & in_path(V,P) -> vertex(V) & (exists E (on_path(E,P) & (V = head_of(E) | V = tail_of(E)))))) # label(in_path_properties) # label(axiom).
% 0.07/0.50 (all E1 all E2 (sequential(E1,E2) <-> edge(E1) & edge(E2) & E1 != E2 & head_of(E1) = tail_of(E2))) # label(sequential_defn) # label(axiom).
% 0.07/0.50 (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 (sequential(E1,E3) & precedes(E3,E2,P)))) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom).
% 0.07/0.50 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E1,P) & on_path(E2,P) & -(sequential(E1,E2) <-> (exists E3 (sequential(E1,E3) & precedes(E3,E2,P)))))))) # label(precedes_properties) # label(axiom).
% 0.07/0.50 (all V1 all V2 all SP (shortest_path(V1,V2,SP) <-> path(V1,V2,SP) & V1 != V2 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))))) # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -(exists E3 (tail_of(E3) = tail_of(E1) & head_of(E3) = head_of(E2))) & -precedes(E2,E1,P))) # label(shortest_path_properties) # label(axiom).
% 0.07/0.50 end_of_list.
% 0.07/0.50
% 0.07/0.50 % From the command line: assign(max_seconds, 300).
% 0.07/0.50
% 0.07/0.50 ============================== end of input ==========================
% 0.07/0.50
% 0.07/0.50 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.50
% 0.07/0.50 % Formulas that are not ordinary clauses:
% 0.07/0.50 1 (all E (edge(E) -> head_of(E) != tail_of(E))) # label(no_loops) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 2 (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.50 3 complete -> (all V1 all V2 (vertex(V1) & vertex(V2) & V1 != V2 -> (exists E (edge(E) & -(V1 = head_of(E) & V2 = tail_of(E) <-> V2 = head_of(E) & V1 = tail_of(E)))))) # label(complete_properties) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 4 (all V1 all V2 all P (vertex(V1) & vertex(V2) & (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)))))) -> path(V1,V2,P))) # label(path_defn) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 5 (all V1 all V2 all P (path(V1,V2,P) -> vertex(V1) & vertex(V2) & (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)))))))) # label(path_properties) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 6 (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.50 7 (all V1 all V2 all P all V (path(V1,V2,P) & in_path(V,P) -> vertex(V) & (exists E (on_path(E,P) & (V = head_of(E) | V = tail_of(E)))))) # label(in_path_properties) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 8 (all E1 all E2 (sequential(E1,E2) <-> edge(E1) & edge(E2) & E1 != E2 & head_of(E1) = tail_of(E2))) # label(sequential_defn) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 9 (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 (sequential(E1,E3) & precedes(E3,E2,P)))) -> precedes(E1,E2,P))))) # label(precedes_defn) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 10 (all P all V1 all V2 (path(V1,V2,P) -> (all E1 all E2 (precedes(E1,E2,P) -> on_path(E1,P) & on_path(E2,P) & -(sequential(E1,E2) <-> (exists E3 (sequential(E1,E3) & precedes(E3,E2,P)))))))) # label(precedes_properties) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 11 (all V1 all V2 all SP (shortest_path(V1,V2,SP) <-> path(V1,V2,SP) & V1 != V2 & (all P (path(V1,V2,P) -> less_or_equal(length_of(SP),length_of(P)))))) # label(shortest_path_defn) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50 12 (all V1 all V2 all E1 all E2 all P (shortest_path(V1,V2,P) & precedes(E1,E2,P) -> -(exists E3 (tail_of(E3) = tail_of(E1) & head_of(E3) = head_of(E2))) & -precedes(E2,E1,P))) # label(shortest_path_properties) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.50
% 0.07/0.50 ============================== end of process non-clausal formulas ===
% 0.07/0.50
% 0.07/0.50 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.50
% 0.07/0.50 formulas(mace4_clauses).
% 0.07/0.50 -edge(A) | tail_of(A) != head_of(A) # label(no_loops) # label(axiom).
% 0.07/0.50 -edge(A) | vertex(head_of(A)) # label(edge_ends_are_vertices) # label(axiom).
% 0.07/0.50 -edge(A) | vertex(tail_of(A)) # label(edge_ends_are_vertices) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | edge(f1(A,B)) # label(complete_properties) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | head_of(f1(A,B)) = A | head_of(f1(A,B)) = B # label(complete_properties) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | head_of(f1(A,B)) = A | tail_of(f1(A,B)) = A # label(complete_properties) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | tail_of(f1(A,B)) = B | head_of(f1(A,B)) = B # label(complete_properties) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | tail_of(f1(A,B)) = B | tail_of(f1(A,B)) = A # label(complete_properties) # label(axiom).
% 0.07/0.50 -complete | -vertex(A) | -vertex(B) | B = A | head_of(f1(A,B)) != A | tail_of(f1(A,B)) != B | head_of(f1(A,B)) != B | tail_of(f1(A,B)) != A # label(complete_properties) # label(axiom).
% 0.07/0.50 -vertex(A) | -vertex(B) | -edge(C) | tail_of(C) != A | head_of(C) != B | path_cons(C,empty) != D | path(A,B,D) # label(path_defn) # label(axiom).
% 0.07/0.50 -vertex(A) | -vertex(B) | -edge(C) | tail_of(C) != A | -path(head_of(C),B,D) | path_cons(C,D) != E | path(A,B,E) # label(path_defn) # label(axiom).
% 0.07/0.50 -path(A,B,C) | vertex(A) # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | vertex(B) # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | edge(f2(A,B,C)) # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | tail_of(f2(A,B,C)) = A # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | head_of(f2(A,B,C)) = B | path(head_of(f2(A,B,C)),B,f3(A,B,C)) # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | head_of(f2(A,B,C)) = B | path_cons(f2(A,B,C),f3(A,B,C)) = C # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | path_cons(f2(A,B,C),empty) = C | path(head_of(f2(A,B,C)),B,f3(A,B,C)) # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | path_cons(f2(A,B,C),empty) = C | path_cons(f2(A,B,C),f3(A,B,C)) = C # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | head_of(f2(A,B,C)) != B | path_cons(f2(A,B,C),empty) != C | -path(head_of(f2(A,B,C)),B,D) | path_cons(f2(A,B,C),D) != C # label(path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -on_path(D,C) | edge(D) # label(on_path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -on_path(D,C) | in_path(head_of(D),C) # label(on_path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -on_path(D,C) | in_path(tail_of(D),C) # label(on_path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -in_path(D,C) | vertex(D) # label(in_path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -in_path(D,C) | on_path(f4(A,B,C,D),C) # label(in_path_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -in_path(D,C) | head_of(f4(A,B,C,D)) = D | tail_of(f4(A,B,C,D)) = D # label(in_path_properties) # label(axiom).
% 0.07/0.50 -sequential(A,B) | edge(A) # label(sequential_defn) # label(axiom).
% 0.07/0.50 -sequential(A,B) | edge(B) # label(sequential_defn) # label(axiom).
% 0.07/0.50 -sequential(A,B) | B != A # label(sequential_defn) # label(axiom).
% 0.07/0.50 -sequential(A,B) | tail_of(B) = head_of(A) # label(sequential_defn) # label(axiom).
% 0.07/0.50 sequential(A,B) | -edge(A) | -edge(B) | B = A | tail_of(B) != head_of(A) # label(sequential_defn) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -on_path(D,C) | -on_path(E,C) | -sequential(D,E) | precedes(D,E,C) # label(precedes_defn) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -on_path(D,C) | -on_path(E,C) | -sequential(D,F) | -precedes(F,E,C) | precedes(D,E,C) # label(precedes_defn) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -precedes(D,E,C) | on_path(D,C) # label(precedes_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -precedes(D,E,C) | on_path(E,C) # label(precedes_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -precedes(D,E,C) | sequential(D,E) | sequential(D,f5(C,A,B,D,E)) # label(precedes_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -precedes(D,E,C) | sequential(D,E) | precedes(f5(C,A,B,D,E),E,C) # label(precedes_properties) # label(axiom).
% 0.07/0.50 -path(A,B,C) | -precedes(D,E,C) | -sequential(D,E) | -sequential(D,F) | -precedes(F,E,C) # label(precedes_properties) # label(axiom).
% 0.07/0.50 -shortest_path(A,B,C) | path(A,B,C) # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 -shortest_path(A,B,C) | B != A # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 -shortest_path(A,B,C) | -path(A,B,D) | less_or_equal(length_of(C),length_of(D)) # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 shortest_path(A,B,C) | -path(A,B,C) | B = A | path(A,B,f6(A,B,C)) # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 shortest_path(A,B,C) | -path(A,B,C) | B = A | -less_or_equal(length_of(C),length_of(f6(A,B,C))) # label(shortest_path_defn) # label(axiom).
% 0.07/0.50 -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).
% 0.07/0.50 -shortest_path(A,B,C) | -precedes(D,E,C) | -precedes(E,D,C) # label(shortest_path_properties) # label(axiom).
% 0.07/0.50 end_of_list.
% 0.07/0.50
% 0.07/0.50 ============================== end of clauses for search =============
% 0.07/0.50 % SZS output start FiniteModel
% 0.07/0.50
% 0.07/0.50 % There are no natural numbers in the input.
% 0.07/0.50
% 0.07/0.50 empty : 0
% 0.07/0.50
% 0.07/0.50 head_of :
% 0.07/0.50 0 1
% 0.07/0.50 -------
% 0.07/0.50 0 0
% 0.07/0.50
% 0.07/0.50 length_of :
% 0.07/0.50 0 1
% 0.07/0.50 -------
% 0.07/0.50 0 0
% 0.07/0.50
% 0.07/0.50 tail_of :
% 0.07/0.50 0 1
% 0.07/0.50 -------
% 0.07/0.50 0 0
% 0.07/0.50
% 0.07/0.50 path_cons :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50
% 0.07/0.50 f1 :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50 f2(0,0,0) = 0.
% 0.07/0.50 f2(0,0,1) = 0.
% 0.07/0.50 f2(0,1,0) = 0.
% 0.07/0.50 f2(0,1,1) = 0.
% 0.07/0.50 f2(1,0,0) = 0.
% 0.07/0.50 f2(1,0,1) = 0.
% 0.07/0.50 f2(1,1,0) = 0.
% 0.07/0.50 f2(1,1,1) = 0.
% 0.07/0.50 f3(0,0,0) = 0.
% 0.07/0.50 f3(0,0,1) = 0.
% 0.07/0.50 f3(0,1,0) = 0.
% 0.07/0.50 f3(0,1,1) = 0.
% 0.07/0.50 f3(1,0,0) = 0.
% 0.07/0.50 f3(1,0,1) = 0.
% 0.07/0.50 f3(1,1,0) = 0.
% 0.07/0.50 f3(1,1,1) = 0.
% 0.07/0.50 f6(0,0,0) = 0.
% 0.07/0.50 f6(0,0,1) = 0.
% 0.07/0.50 f6(0,1,0) = 0.
% 0.07/0.50 f6(0,1,1) = 0.
% 0.07/0.50 f6(1,0,0) = 0.
% 0.07/0.50 f6(1,0,1) = 0.
% 0.07/0.50 f6(1,1,0) = 0.
% 0.07/0.50 f6(1,1,1) = 0.
% 0.07/0.50 f4(0,0,0,0) = 0.
% 0.07/0.50 f4(0,0,0,1) = 0.
% 0.07/0.50 f4(0,0,1,0) = 0.
% 0.07/0.50 f4(0,0,1,1) = 0.
% 0.07/0.50 f4(0,1,0,0) = 0.
% 0.07/0.50 f4(0,1,0,1) = 0.
% 0.07/0.50 f4(0,1,1,0) = 0.
% 0.07/0.50 f4(0,1,1,1) = 0.
% 0.07/0.50 f4(1,0,0,0) = 0.
% 0.07/0.50 f4(1,0,0,1) = 0.
% 0.07/0.50 f4(1,0,1,0) = 0.
% 0.07/0.50 f4(1,0,1,1) = 0.
% 0.07/0.50 f4(1,1,0,0) = 0.
% 0.07/0.50 f4(1,1,0,1) = 0.
% 0.07/0.50 f4(1,1,1,0) = 0.
% 0.07/0.50 f4(1,1,1,1) = 0.
% 0.07/0.50 f5(0,0,0,0,0) = 0.
% 0.07/0.50 f5(0,0,0,0,1) = 0.
% 0.07/0.50 f5(0,0,0,1,0) = 0.
% 0.07/0.50 f5(0,0,0,1,1) = 0.
% 0.07/0.50 f5(0,0,1,0,0) = 0.
% 0.07/0.50 f5(0,0,1,0,1) = 0.
% 0.07/0.50 f5(0,0,1,1,0) = 0.
% 0.07/0.50 f5(0,0,1,1,1) = 0.
% 0.07/0.50 f5(0,1,0,0,0) = 0.
% 0.07/0.50 f5(0,1,0,0,1) = 0.
% 0.07/0.50 f5(0,1,0,1,0) = 0.
% 0.07/0.50 f5(0,1,0,1,1) = 0.
% 0.07/0.50 f5(0,1,1,0,0) = 0.
% 0.07/0.50 f5(0,1,1,0,1) = 0.
% 0.07/0.50 f5(0,1,1,1,0) = 0.
% 0.07/0.50 f5(0,1,1,1,1) = 0.
% 0.07/0.50 f5(1,0,0,0,0) = 0.
% 0.07/0.50 f5(1,0,0,0,1) = 0.
% 0.07/0.50 f5(1,0,0,1,0) = 0.
% 0.07/0.50 f5(1,0,0,1,1) = 0.
% 0.07/0.50 f5(1,0,1,0,0) = 0.
% 0.07/0.50 f5(1,0,1,0,1) = 0.
% 0.07/0.50 f5(1,0,1,1,0) = 0.
% 0.07/0.50 f5(1,0,1,1,1) = 0.
% 0.07/0.50 f5(1,1,0,0,0) = 0.
% 0.07/0.50 f5(1,1,0,0,1) = 0.
% 0.07/0.50 f5(1,1,0,1,0) = 0.
% 0.07/0.50 f5(1,1,0,1,1) = 0.
% 0.07/0.50 f5(1,1,1,0,0) = 0.
% 0.07/0.50 f5(1,1,1,0,1) = 0.
% 0.07/0.50 f5(1,1,1,1,0) = 0.
% 0.07/0.50 f5(1,1,1,1,1) = 0.
% 0.07/0.50
% 0.07/0.50 complete : 0
% 0.07/0.50
% 0.07/0.50 edge :
% 0.07/0.50 0 1
% 0.07/0.50 -------
% 0.07/0.50 0 0
% 0.07/0.50
% 0.07/0.50 vertex :
% 0.07/0.50 0 1
% 0.07/0.50 -------
% 0.07/0.50 0 0
% 0.07/0.50
% 0.07/0.50 in_path :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50
% 0.07/0.50 less_or_equal :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50
% 0.07/0.50 on_path :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50
% 0.07/0.50 sequential :
% 0.07/0.50 | 0 1
% 0.07/0.50 --+----
% 0.07/0.50 0 | 0 0
% 0.07/0.50 1 | 0 0
% 0.07/0.50 path(0,0,0) = 0.
% 0.07/0.50 path(0,0,1) = 0.
% 0.07/0.50 path(0,1,0) = 0.
% 0.07/0.50 path(0,1,1) = 0.
% 0.07/0.50 path(1,0,0) = 0.
% 0.07/0.50 path(1,0,1) = 0.
% 0.07/0.50 path(1,1,0) = 0.
% 0.07/0.50 path(1,1,1) = 0.
% 0.07/0.50 precedes(0,0,0) = 0.
% 0.07/0.50 precedes(0,0,1) = 0.
% 0.07/0.50 precedes(0,1,0) = 0.
% 0.07/0.50 precedes(0,1,1) = 0.
% 0.07/0.50 precedes(1,0,0) = 0.
% 0.07/0.50 precedes(1,0,1) = 0.
% 0.07/0.50 precedes(1,1,0) = 0.
% 0.07/0.50 precedes(1,1,1) = 0.
% 0.07/0.50 shortest_path(0,0,0) = 0.
% 0.07/0.50 shortest_path(0,0,1) = 0.
% 0.07/0.50 shortest_path(0,1,0) = 0.
% 0.07/0.50 shortest_path(0,1,1) = 0.
% 0.07/0.50 shortest_path(1,0,0) = 0.
% 0.07/0.50 shortest_path(1,0,1) = 0.
% 0.07/0.50 shortest_path(1,1,0) = 0.
% 0.07/0.50 shortest_path(1,1,1) = 0.
% 0.07/0.50
% 0.07/0.50 % SZS output end FiniteModel
% 0.07/0.50 ------ process 6603 exit (max_models) ------
% 0.07/0.50
% 0.07/0.50 User_CPU=0.01, System_CPU=0.00, Wall_clock=1.
% 0.07/0.50
% 0.07/0.50 Exiting with 1 model.
% 0.07/0.50
% 0.07/0.50 Process 6603 exit (max_models) Tue Feb 7 17:01:32 2017
% 0.07/0.50 The process finished Tue Feb 7 17:01:32 2017
% 0.07/0.50 Mace4 ended
%------------------------------------------------------------------------------