TSTP Solution File: KRS044+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KRS044+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n068.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:56:19 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.04 % Problem : KRS044+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.24 % Computer : n068.star.cs.uiowa.edu
% 0.03/0.24 % Model : x86_64 x86_64
% 0.03/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24 % Memory : 32218.75MB
% 0.03/0.24 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.24 % CPULimit : 300
% 0.03/0.24 % DateTime : Tue Feb 7 19:39:46 CST 2017
% 0.03/0.25 % CPUTime :
% 0.07/0.46 % SZS status Satisfiable
% 0.07/0.47 ============================== Mace4 =================================
% 0.07/0.47 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.47 Process 50700 was started by sandbox on n068.star.cs.uiowa.edu,
% 0.07/0.47 Tue Feb 7 19:39:46 2017
% 0.07/0.47 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_50636_n068.star.cs.uiowa.edu".
% 0.07/0.47 ============================== end of head ===========================
% 0.07/0.47
% 0.07/0.47 ============================== INPUT =================================
% 0.07/0.47
% 0.07/0.47 % Reading from file /tmp/Mace4_input_50636_n068.star.cs.uiowa.edu
% 0.07/0.47
% 0.07/0.47 set(prolog_style_variables).
% 0.07/0.47 set(print_models_tabular).
% 0.07/0.47 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.47
% 0.07/0.47 formulas(sos).
% 0.07/0.47 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rf1(A,C) -> rf1(B,C))) # label(rf1_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvF1(A,C) -> rinvF1(B,C))) # label(rinvF1_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvF1(C,A) -> rinvF1(C,B))) # label(rinvF1_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvS(A,C) -> rinvS(B,C))) # label(rinvS_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rinvS(C,A) -> rinvS(C,B))) # label(rinvS_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rs(A,C) -> rs(B,C))) # label(rs_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B all C (A = B & rs(C,A) -> rs(C,B))) # label(rs_substitution_2) # label(axiom).
% 0.07/0.47 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom).
% 0.07/0.47 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom).
% 0.07/0.47 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom).
% 0.07/0.47 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom).
% 0.07/0.47 (all X (cSatisfiable(X) <-> (exists Y (rf(X,Y) & cp(Y))) & (exists Y (rf1(X,Y) & cpxcomp(Y))))) # label(axiom_2) # label(axiom).
% 0.07/0.47 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom).
% 0.07/0.47 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom).
% 0.07/0.47 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom).
% 0.07/0.47 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom).
% 0.07/0.47 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_7) # label(axiom).
% 0.07/0.47 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_8) # label(axiom).
% 0.07/0.47 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_9) # label(axiom).
% 0.07/0.47 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_10) # label(axiom).
% 0.07/0.47 cSatisfiable(i2003_11_14_17_16_1832) # label(axiom_11) # label(axiom).
% 0.07/0.47 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_12) # label(axiom).
% 0.07/0.47 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_13) # label(axiom).
% 0.07/0.47 end_of_list.
% 0.07/0.47
% 0.07/0.47 % From the command line: assign(max_seconds, 300).
% 0.07/0.47
% 0.07/0.47 ============================== end of input ==========================
% 0.07/0.47
% 0.07/0.47 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.47
% 0.07/0.47 % Formulas that are not ordinary clauses:
% 0.07/0.47 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 5 (all A all B (A = B & cpxcomp(A) -> cpxcomp(B))) # label(cpxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 6 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 7 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 8 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 9 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 10 (all A all B all C (A = B & rf1(A,C) -> rf1(B,C))) # label(rf1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 11 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 12 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 13 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 14 (all A all B all C (A = B & rinvF1(A,C) -> rinvF1(B,C))) # label(rinvF1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 15 (all A all B all C (A = B & rinvF1(C,A) -> rinvF1(C,B))) # label(rinvF1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 16 (all A all B all C (A = B & rinvS(A,C) -> rinvS(B,C))) # label(rinvS_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 17 (all A all B all C (A = B & rinvS(C,A) -> rinvS(C,B))) # label(rinvS_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 18 (all A all B all C (A = B & rs(A,C) -> rs(B,C))) # label(rs_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 19 (all A all B all C (A = B & rs(C,A) -> rs(C,B))) # label(rs_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 20 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 21 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 22 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 23 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 24 (all X (cSatisfiable(X) <-> (exists Y (rf(X,Y) & cp(Y))) & (exists Y (rf1(X,Y) & cpxcomp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 25 (all X (cp(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 26 (all X (cpxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 27 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 28 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 29 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 30 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 31 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 32 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 33 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47 34 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_13) # label(axiom) # label(non_clause). [assumption].
% 0.07/0.47
% 0.07/0.47 ============================== end of process non-clausal formulas ===
% 0.07/0.47
% 0.07/0.47 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.47
% 0.07/0.47 formulas(mace4_clauses).
% 0.07/0.47 A != B | -cSatisfiable(B) | cSatisfiable(A) # label(cSatisfiable_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -cowlNothing(B) | cowlNothing(A) # label(cowlNothing_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -cowlThing(B) | cowlThing(A) # label(cowlThing_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -cp(B) | cp(A) # label(cp_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -cpxcomp(B) | cpxcomp(A) # label(cpxcomp_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -ra_Px1(B,C) | ra_Px1(A,C) # label(ra_Px1_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -ra_Px1(C,B) | ra_Px1(C,A) # label(ra_Px1_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rf(B,C) | rf(A,C) # label(rf_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rf(C,B) | rf(C,A) # label(rf_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rf1(B,C) | rf1(A,C) # label(rf1_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rf1(C,B) | rf1(C,A) # label(rf1_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rinvF(B,C) | rinvF(A,C) # label(rinvF_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rinvF(C,B) | rinvF(C,A) # label(rinvF_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rinvF1(B,C) | rinvF1(A,C) # label(rinvF1_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rinvF1(C,B) | rinvF1(C,A) # label(rinvF1_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rinvS(B,C) | rinvS(A,C) # label(rinvS_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rinvS(C,B) | rinvS(C,A) # label(rinvS_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -rs(B,C) | rs(A,C) # label(rs_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -rs(C,B) | rs(C,A) # label(rs_substitution_2) # label(axiom).
% 0.07/0.47 A != B | -xsd_integer(B) | xsd_integer(A) # label(xsd_integer_substitution_1) # label(axiom).
% 0.07/0.47 A != B | -xsd_string(B) | xsd_string(A) # label(xsd_string_substitution_1) # label(axiom).
% 0.07/0.47 cowlThing(A) # label(axiom_0) # label(axiom).
% 0.07/0.47 -cowlNothing(A) # label(axiom_0) # label(axiom).
% 0.07/0.47 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom).
% 0.07/0.47 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom).
% 0.07/0.47 -cSatisfiable(A) | rf(A,f1(A)) # label(axiom_2) # label(axiom).
% 0.07/0.47 -cSatisfiable(A) | cp(f1(A)) # label(axiom_2) # label(axiom).
% 0.07/0.47 -cSatisfiable(A) | rf1(A,f2(A)) # label(axiom_2) # label(axiom).
% 0.07/0.47 -cSatisfiable(A) | cpxcomp(f2(A)) # label(axiom_2) # label(axiom).
% 0.07/0.47 cSatisfiable(A) | -rf(A,B) | -cp(B) | -rf1(A,C) | -cpxcomp(C) # label(axiom_2) # label(axiom).
% 0.07/0.47 -cp(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom).
% 0.07/0.47 cp(A) | ra_Px1(A,f3(A)) # label(axiom_3) # label(axiom).
% 0.07/0.47 -cpxcomp(A) | ra_Px1(A,f4(A)) # label(axiom_4) # label(axiom).
% 0.07/0.47 cpxcomp(A) | -ra_Px1(A,B) # label(axiom_4) # label(axiom).
% 0.07/0.47 -rf(A,B) | -rf(A,C) | C = B # label(axiom_5) # label(axiom).
% 0.07/0.47 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_6) # label(axiom).
% 0.07/0.47 -rinvF(A,B) | rf(B,A) # label(axiom_7) # label(axiom).
% 0.07/0.47 rinvF(A,B) | -rf(B,A) # label(axiom_7) # label(axiom).
% 0.07/0.47 -rinvF1(A,B) | rf1(B,A) # label(axiom_8) # label(axiom).
% 0.07/0.47 rinvF1(A,B) | -rf1(B,A) # label(axiom_8) # label(axiom).
% 0.07/0.47 -rinvS(A,B) | rs(B,A) # label(axiom_9) # label(axiom).
% 0.07/0.47 rinvS(A,B) | -rs(B,A) # label(axiom_9) # label(axiom).
% 0.07/0.47 -rs(A,B) | -rs(A,C) | C = B # label(axiom_10) # label(axiom).
% 0.07/0.47 cSatisfiable(i2003_11_14_17_16_1832) # label(axiom_11) # label(axiom).
% 0.07/0.47 -rs(A,B) | rf(A,B) # label(axiom_12) # label(axiom).
% 0.07/0.47 -rs(A,B) | rf1(A,B) # label(axiom_13) # label(axiom).
% 0.07/0.47 end_of_list.
% 0.07/0.47
% 0.07/0.47 ============================== end of clauses for search =============
% 0.07/0.47 % SZS output start FiniteModel
% 0.07/0.47
% 0.07/0.47 % There are no natural numbers in the input.
% 0.07/0.47
% 0.07/0.47 i2003_11_14_17_16_1832 : 0
% 0.07/0.47
% 0.07/0.47 f1 :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 0
% 0.07/0.47
% 0.07/0.47 f2 :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 1 0
% 0.07/0.47
% 0.07/0.47 f3 :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 0
% 0.07/0.47
% 0.07/0.47 f4 :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 0
% 0.07/0.47
% 0.07/0.47 cSatisfiable :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 1 0
% 0.07/0.47
% 0.07/0.47 cowlNothing :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 0
% 0.07/0.47
% 0.07/0.47 cowlThing :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 1 1
% 0.07/0.47
% 0.07/0.47 cp :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 1 0
% 0.07/0.47
% 0.07/0.47 cpxcomp :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 1
% 0.07/0.47
% 0.07/0.47 xsd_integer :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 0 0
% 0.07/0.47
% 0.07/0.47 xsd_string :
% 0.07/0.47 0 1
% 0.07/0.47 -------
% 0.07/0.47 1 1
% 0.07/0.47
% 0.07/0.47 ra_Px1 :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 0 0
% 0.07/0.47 1 | 1 0
% 0.07/0.47
% 0.07/0.47 rf :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 1 0
% 0.07/0.47 1 | 0 0
% 0.07/0.47
% 0.07/0.47 rf1 :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 0 1
% 0.07/0.47 1 | 0 0
% 0.07/0.47
% 0.07/0.47 rinvF :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 1 0
% 0.07/0.47 1 | 0 0
% 0.07/0.47
% 0.07/0.47 rinvF1 :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 0 0
% 0.07/0.47 1 | 1 0
% 0.07/0.47
% 0.07/0.47 rinvS :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 0 0
% 0.07/0.47 1 | 0 0
% 0.07/0.47
% 0.07/0.47 rs :
% 0.07/0.47 | 0 1
% 0.07/0.47 --+----
% 0.07/0.47 0 | 0 0
% 0.07/0.47 1 | 0 0
% 0.07/0.47
% 0.07/0.47 % SZS output end FiniteModel
% 0.07/0.47 ------ process 50700 exit (max_models) ------
% 0.07/0.47
% 0.07/0.47 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.07/0.47
% 0.07/0.47 Exiting with 1 model.
% 0.07/0.47
% 0.07/0.47 Process 50700 exit (max_models) Tue Feb 7 19:39:46 2017
% 0.07/0.47 The process finished Tue Feb 7 19:39:46 2017
% 0.07/0.47 Mace4 ended
%------------------------------------------------------------------------------