TSTP Solution File: KRS035+1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KRS035+1 : TPTP v6.4.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n034.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:18 EST 2017
% Result : Satisfiable 0.06s
% Output : FiniteModel 0.06s
% 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 : KRS035+1 : TPTP v6.4.0. Released v3.1.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n034.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.75MB
% 0.02/0.23 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Tue Feb 7 19:39:31 CST 2017
% 0.02/0.23 % CPUTime :
% 0.06/0.45 % SZS status Satisfiable
% 0.06/0.45 ============================== Mace4 =================================
% 0.06/0.45 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.45 Process 52914 was started by sandbox on n034.star.cs.uiowa.edu,
% 0.06/0.45 Tue Feb 7 19:39:31 2017
% 0.06/0.45 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_52881_n034.star.cs.uiowa.edu".
% 0.06/0.45 ============================== end of head ===========================
% 0.06/0.45
% 0.06/0.45 ============================== INPUT =================================
% 0.06/0.45
% 0.06/0.45 % Reading from file /tmp/Mace4_input_52881_n034.star.cs.uiowa.edu
% 0.06/0.45
% 0.06/0.45 set(prolog_style_variables).
% 0.06/0.45 set(print_models_tabular).
% 0.06/0.45 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.45
% 0.06/0.45 formulas(sos).
% 0.06/0.45 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B (A = B & ca(A) -> ca(B))) # label(ca_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom).
% 0.06/0.45 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom).
% 0.06/0.45 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom).
% 0.06/0.45 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom).
% 0.06/0.45 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom).
% 0.06/0.45 (all X (cSatisfiable(X) <-> -ca(X) & (exists Y (rinvR(X,Y) & (exists Z (rinvF(Y,Z) & ca(Z))))) & (exists Y (rinvF(X,Y) & ca(Y))))) # label(axiom_2) # label(axiom).
% 0.06/0.45 (all X (cowlThing(X) -> (all Y0 all Y1 (rf(X,Y0) & rf(X,Y1) -> Y0 = Y1)))) # label(axiom_3) # label(axiom).
% 0.06/0.45 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_4) # label(axiom).
% 0.06/0.45 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom).
% 0.06/0.45 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom).
% 0.06/0.45 cSatisfiable(i2003_11_14_17_15_44810) # label(axiom_7) # label(axiom).
% 0.06/0.45 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_8) # label(axiom).
% 0.06/0.45 end_of_list.
% 0.06/0.45
% 0.06/0.45 % From the command line: assign(max_seconds, 300).
% 0.06/0.45
% 0.06/0.45 ============================== end of input ==========================
% 0.06/0.45
% 0.06/0.45 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.45
% 0.06/0.45 % Formulas that are not ordinary clauses:
% 0.06/0.45 1 (all A all B (A = B & cSatisfiable(A) -> cSatisfiable(B))) # label(cSatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 2 (all A all B (A = B & ca(A) -> ca(B))) # label(ca_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 3 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 4 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 5 (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.06/0.45 6 (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.06/0.45 7 (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.06/0.45 8 (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.06/0.45 9 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 10 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 11 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 12 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 13 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 14 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 17 (all X (cSatisfiable(X) <-> -ca(X) & (exists Y (rinvR(X,Y) & (exists Z (rinvF(Y,Z) & ca(Z))))) & (exists Y (rinvF(X,Y) & ca(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 18 (all X (cowlThing(X) -> (all Y0 all Y1 (rf(X,Y0) & rf(X,Y1) -> Y0 = Y1)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 19 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 20 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 21 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45 22 (all X all Y (rf(X,Y) -> rr(X,Y))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.06/0.45
% 0.06/0.45 ============================== end of process non-clausal formulas ===
% 0.06/0.45
% 0.06/0.45 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.45
% 0.06/0.45 formulas(mace4_clauses).
% 0.06/0.45 A != B | -cSatisfiable(B) | cSatisfiable(A) # label(cSatisfiable_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -ca(B) | ca(A) # label(ca_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -cowlNothing(B) | cowlNothing(A) # label(cowlNothing_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -cowlThing(B) | cowlThing(A) # label(cowlThing_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -rf(B,C) | rf(A,C) # label(rf_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -rf(C,B) | rf(C,A) # label(rf_substitution_2) # label(axiom).
% 0.06/0.45 A != B | -rinvF(B,C) | rinvF(A,C) # label(rinvF_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -rinvF(C,B) | rinvF(C,A) # label(rinvF_substitution_2) # label(axiom).
% 0.06/0.45 A != B | -rinvR(B,C) | rinvR(A,C) # label(rinvR_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -rinvR(C,B) | rinvR(C,A) # label(rinvR_substitution_2) # label(axiom).
% 0.06/0.45 A != B | -rr(B,C) | rr(A,C) # label(rr_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -rr(C,B) | rr(C,A) # label(rr_substitution_2) # label(axiom).
% 0.06/0.45 A != B | -xsd_integer(B) | xsd_integer(A) # label(xsd_integer_substitution_1) # label(axiom).
% 0.06/0.45 A != B | -xsd_string(B) | xsd_string(A) # label(xsd_string_substitution_1) # label(axiom).
% 0.06/0.45 cowlThing(A) # label(axiom_0) # label(axiom).
% 0.06/0.45 -cowlNothing(A) # label(axiom_0) # label(axiom).
% 0.06/0.45 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom).
% 0.06/0.45 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | -ca(A) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | rinvR(A,f1(A)) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | rinvF(f1(A),f2(A)) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | ca(f2(A)) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | rinvF(A,f3(A)) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cSatisfiable(A) | ca(f3(A)) # label(axiom_2) # label(axiom).
% 0.06/0.45 cSatisfiable(A) | ca(A) | -rinvR(A,B) | -rinvF(B,C) | -ca(C) | -rinvF(A,D) | -ca(D) # label(axiom_2) # label(axiom).
% 0.06/0.45 -cowlThing(A) | -rf(A,B) | -rf(A,C) | C = B # label(axiom_3) # label(axiom).
% 0.06/0.45 -rinvF(A,B) | rf(B,A) # label(axiom_4) # label(axiom).
% 0.06/0.45 rinvF(A,B) | -rf(B,A) # label(axiom_4) # label(axiom).
% 0.06/0.45 -rinvR(A,B) | rr(B,A) # label(axiom_5) # label(axiom).
% 0.06/0.45 rinvR(A,B) | -rr(B,A) # label(axiom_5) # label(axiom).
% 0.06/0.45 -rr(A,B) | -rr(B,C) | rr(A,C) # label(axiom_6) # label(axiom).
% 0.06/0.45 cSatisfiable(i2003_11_14_17_15_44810) # label(axiom_7) # label(axiom).
% 0.06/0.45 -rf(A,B) | rr(A,B) # label(axiom_8) # label(axiom).
% 0.06/0.45 end_of_list.
% 0.06/0.45
% 0.06/0.45 ============================== end of clauses for search =============
% 0.06/0.45 % SZS output start FiniteModel
% 0.06/0.45
% 0.06/0.45 % There are no natural numbers in the input.
% 0.06/0.45
% 0.06/0.45 i2003_11_14_17_15_44810 : 0
% 0.06/0.45
% 0.06/0.45 f1 :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 0
% 0.06/0.45
% 0.06/0.45 f2 :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 0
% 0.06/0.45
% 0.06/0.45 f3 :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 0
% 0.06/0.45
% 0.06/0.45 cSatisfiable :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 0
% 0.06/0.45
% 0.06/0.45 ca :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 1
% 0.06/0.45
% 0.06/0.45 cowlNothing :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 0
% 0.06/0.45
% 0.06/0.45 cowlThing :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 1
% 0.06/0.45
% 0.06/0.45 xsd_integer :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 0 0
% 0.06/0.45
% 0.06/0.45 xsd_string :
% 0.06/0.45 0 1
% 0.06/0.45 -------
% 0.06/0.45 1 1
% 0.06/0.45
% 0.06/0.45 rf :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 0 0
% 0.06/0.45 1 | 1 0
% 0.06/0.45
% 0.06/0.45 rinvF :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 0 1
% 0.06/0.45 1 | 0 0
% 0.06/0.45
% 0.06/0.45 rinvR :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 1 1
% 0.06/0.45 1 | 0 0
% 0.06/0.45
% 0.06/0.45 rr :
% 0.06/0.45 | 0 1
% 0.06/0.45 --+----
% 0.06/0.45 0 | 1 0
% 0.06/0.45 1 | 1 0
% 0.06/0.45
% 0.06/0.45 % SZS output end FiniteModel
% 0.06/0.45 ------ process 52914 exit (max_models) ------
% 0.06/0.45
% 0.06/0.45 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.45
% 0.06/0.45 Exiting with 1 model.
% 0.06/0.45
% 0.06/0.45 Process 52914 exit (max_models) Tue Feb 7 19:39:31 2017
% 0.06/0.45 The process finished Tue Feb 7 19:39:31 2017
% 0.06/0.45 Mace4 ended
%------------------------------------------------------------------------------