TSTP Solution File: KRS014-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KRS014-1 : TPTP v6.4.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n108.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:16 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 : KRS014-1 : TPTP v6.4.0. Released v2.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.29 % Computer : n108.star.cs.uiowa.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.29 % Memory : 32218.75MB
% 0.03/0.29 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % DateTime : Tue Feb 7 19:39:16 CST 2017
% 0.03/0.30 % CPUTime :
% 0.07/0.51 % SZS status Satisfiable
% 0.07/0.51 ============================== Mace4 =================================
% 0.07/0.51 Mace4 (32) version 2009-11A, November 2009.
% 0.07/0.51 Process 57131 was started by sandbox on n108.star.cs.uiowa.edu,
% 0.07/0.51 Tue Feb 7 19:39:16 2017
% 0.07/0.51 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_57098_n108.star.cs.uiowa.edu".
% 0.07/0.51 ============================== end of head ===========================
% 0.07/0.51
% 0.07/0.51 ============================== INPUT =================================
% 0.07/0.51
% 0.07/0.51 % Reading from file /tmp/Mace4_input_57098_n108.star.cs.uiowa.edu
% 0.07/0.51
% 0.07/0.51 set(prolog_style_variables).
% 0.07/0.51 set(print_models_tabular).
% 0.07/0.51 % set(print_models_tabular) -> clear(print_models).
% 0.07/0.51
% 0.07/0.51 formulas(sos).
% 0.07/0.51 e(exists) # label(clause_1) # label(negated_conjecture).
% 0.07/0.51 s(X1,X2) | -e(X1) | -r(X1,X2) # label(clause_2) # label(axiom).
% 0.07/0.51 r(X1,X2) | -e(X1) | -s(X1,X2) # label(clause_3) # label(axiom).
% 0.07/0.51 s2exact(X1) | -e(X1) # label(clause_4) # label(axiom).
% 0.07/0.51 r1exact(X1) | -e(X1) # label(clause_5) # label(axiom).
% 0.07/0.51 e(X1) | s(X1,u0r1(X1)) | r(X1,u0r1(X1)) | -r1exact(X1) | -s2exact(X1) # label(clause_6) # label(axiom).
% 0.07/0.51 e(X1) | -r1exact(X1) | -s2exact(X1) | -r(X1,u0r1(X1)) | -s(X1,u0r1(X1)) # label(clause_7) # label(axiom).
% 0.07/0.51 equalish(X3,u1r2(X1)) | -r1exact(X1) | -r(X1,X3) # label(clause_8) # label(axiom).
% 0.07/0.51 r(X1,u1r2(X1)) | -r1exact(X1) # label(clause_9) # label(axiom).
% 0.07/0.51 r1exact(X1) | -r(X1,X2) | -equalish(u1r1(X2,X1),X2) # label(clause_10) # label(axiom).
% 0.07/0.51 r1exact(X1) | r(X1,u1r1(X2,X1)) | -r(X1,X2) # label(clause_11) # label(axiom).
% 0.07/0.51 equalish(X4,u2r3(X1)) | equalish(X4,u2r2(X1)) | -s2exact(X1) | -s(X1,X4) # label(clause_12) # label(axiom).
% 0.07/0.51 -s2exact(X1) | -equalish(u2r3(X1),u2r2(X1)) # label(clause_13) # label(axiom).
% 0.07/0.51 s(X1,u2r2(X1)) | -s2exact(X1) # label(clause_14) # label(axiom).
% 0.07/0.51 s(X1,u2r3(X1)) | -s2exact(X1) # label(clause_15) # label(axiom).
% 0.07/0.51 s2exact(X1) | equalish(X3,X2) | -s(X1,X3) | -s(X1,X2) | -equalish(u2r1(X3,X2,X1),X2) # label(clause_16) # label(axiom).
% 0.07/0.51 s2exact(X1) | equalish(X3,X2) | -s(X1,X3) | -s(X1,X2) | -equalish(u2r1(X3,X2,X1),X3) # label(clause_17) # label(axiom).
% 0.07/0.51 s2exact(X1) | equalish(X3,X2) | s(X1,u2r1(X3,X2,X1)) | -s(X1,X3) | -s(X1,X2) # label(clause_18) # label(axiom).
% 0.07/0.51 end_of_list.
% 0.07/0.51
% 0.07/0.51 % From the command line: assign(max_seconds, 300).
% 0.07/0.51
% 0.07/0.51 ============================== end of input ==========================
% 0.07/0.51
% 0.07/0.51 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.07/0.51
% 0.07/0.51 % Formulas that are not ordinary clauses:
% 0.07/0.51
% 0.07/0.51 ============================== end of process non-clausal formulas ===
% 0.07/0.51
% 0.07/0.51 ============================== CLAUSES FOR SEARCH ====================
% 0.07/0.51
% 0.07/0.51 formulas(mace4_clauses).
% 0.07/0.51 e(exists) # label(clause_1) # label(negated_conjecture).
% 0.07/0.51 s(A,B) | -e(A) | -r(A,B) # label(clause_2) # label(axiom).
% 0.07/0.51 r(A,B) | -e(A) | -s(A,B) # label(clause_3) # label(axiom).
% 0.07/0.51 s2exact(A) | -e(A) # label(clause_4) # label(axiom).
% 0.07/0.51 r1exact(A) | -e(A) # label(clause_5) # label(axiom).
% 0.07/0.51 e(A) | s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) # label(clause_6) # label(axiom).
% 0.07/0.51 e(A) | -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) # label(clause_7) # label(axiom).
% 0.07/0.51 equalish(A,u1r2(B)) | -r1exact(B) | -r(B,A) # label(clause_8) # label(axiom).
% 0.07/0.51 r(A,u1r2(A)) | -r1exact(A) # label(clause_9) # label(axiom).
% 0.07/0.51 r1exact(A) | -r(A,B) | -equalish(u1r1(B,A),B) # label(clause_10) # label(axiom).
% 0.07/0.51 r1exact(A) | r(A,u1r1(B,A)) | -r(A,B) # label(clause_11) # label(axiom).
% 0.07/0.51 equalish(A,u2r3(B)) | equalish(A,u2r2(B)) | -s2exact(B) | -s(B,A) # label(clause_12) # label(axiom).
% 0.07/0.51 -s2exact(A) | -equalish(u2r3(A),u2r2(A)) # label(clause_13) # label(axiom).
% 0.07/0.51 s(A,u2r2(A)) | -s2exact(A) # label(clause_14) # label(axiom).
% 0.07/0.51 s(A,u2r3(A)) | -s2exact(A) # label(clause_15) # label(axiom).
% 0.07/0.51 s2exact(A) | equalish(B,C) | -s(A,B) | -s(A,C) | -equalish(u2r1(B,C,A),C) # label(clause_16) # label(axiom).
% 0.07/0.51 s2exact(A) | equalish(B,C) | -s(A,B) | -s(A,C) | -equalish(u2r1(B,C,A),B) # label(clause_17) # label(axiom).
% 0.07/0.51 s2exact(A) | equalish(B,C) | s(A,u2r1(B,C,A)) | -s(A,B) | -s(A,C) # label(clause_18) # label(axiom).
% 0.07/0.51 end_of_list.
% 0.07/0.51
% 0.07/0.51 ============================== end of clauses for search =============
% 0.07/0.51 % SZS output start FiniteModel
% 0.07/0.51
% 0.07/0.51 % There are no natural numbers in the input.
% 0.07/0.51
% 0.07/0.51 exists : 0
% 0.07/0.51
% 0.07/0.51 u0r1 :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 0 0
% 0.07/0.51
% 0.07/0.51 u1r2 :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 0 0
% 0.07/0.51
% 0.07/0.51 u2r2 :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 1 0
% 0.07/0.51
% 0.07/0.51 u2r3 :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 0 0
% 0.07/0.51
% 0.07/0.51 u1r1 :
% 0.07/0.51 | 0 1
% 0.07/0.51 --+----
% 0.07/0.51 0 | 0 0
% 0.07/0.51 1 | 0 0
% 0.07/0.51 u2r1(0,0,0) = 0.
% 0.07/0.51 u2r1(0,0,1) = 0.
% 0.07/0.51 u2r1(0,1,0) = 0.
% 0.07/0.51 u2r1(0,1,1) = 0.
% 0.07/0.51 u2r1(1,0,0) = 0.
% 0.07/0.51 u2r1(1,0,1) = 0.
% 0.07/0.51 u2r1(1,1,0) = 0.
% 0.07/0.51 u2r1(1,1,1) = 0.
% 0.07/0.51
% 0.07/0.51 e :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 1 0
% 0.07/0.51
% 0.07/0.51 r1exact :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 1 0
% 0.07/0.51
% 0.07/0.51 s2exact :
% 0.07/0.51 0 1
% 0.07/0.51 -------
% 0.07/0.51 1 0
% 0.07/0.51
% 0.07/0.51 equalish :
% 0.07/0.51 | 0 1
% 0.07/0.51 --+----
% 0.07/0.51 0 | 1 0
% 0.07/0.51 1 | 1 0
% 0.07/0.51
% 0.07/0.51 r :
% 0.07/0.51 | 0 1
% 0.07/0.51 --+----
% 0.07/0.51 0 | 1 1
% 0.07/0.51 1 | 0 0
% 0.07/0.51
% 0.07/0.51 s :
% 0.07/0.51 | 0 1
% 0.07/0.51 --+----
% 0.07/0.51 0 | 1 1
% 0.07/0.51 1 | 0 0
% 0.07/0.51
% 0.07/0.51 % SZS output end FiniteModel
% 0.07/0.51 ------ process 57131 exit (max_models) ------
% 0.07/0.51
% 0.07/0.51 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.07/0.51
% 0.07/0.51 Exiting with 1 model.
% 0.07/0.51
% 0.07/0.51 Process 57131 exit (max_models) Tue Feb 7 19:39:16 2017
% 0.07/0.51 The process finished Tue Feb 7 19:39:16 2017
% 0.07/0.51 Mace4 ended
%------------------------------------------------------------------------------