TSTP Solution File: KRS009-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : KRS009-1 : TPTP v6.4.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n136.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:15 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 : KRS009-1 : TPTP v6.4.0. Released v2.0.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.03/0.25 % Computer : n136.star.cs.uiowa.edu
% 0.03/0.25 % Model : x86_64 x86_64
% 0.03/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.25 % Memory : 32218.75MB
% 0.03/0.25 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.25 % CPULimit : 300
% 0.03/0.25 % DateTime : Tue Feb 7 19:39:16 CST 2017
% 0.03/0.25 % CPUTime :
% 0.06/0.46 % SZS status Satisfiable
% 0.06/0.46 ============================== Mace4 =================================
% 0.06/0.46 Mace4 (32) version 2009-11A, November 2009.
% 0.06/0.46 Process 35769 was started by sandbox2 on n136.star.cs.uiowa.edu,
% 0.06/0.46 Tue Feb 7 19:39:16 2017
% 0.06/0.46 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_35736_n136.star.cs.uiowa.edu".
% 0.06/0.46 ============================== end of head ===========================
% 0.06/0.46
% 0.06/0.46 ============================== INPUT =================================
% 0.06/0.46
% 0.06/0.46 % Reading from file /tmp/Mace4_input_35736_n136.star.cs.uiowa.edu
% 0.06/0.46
% 0.06/0.46 set(prolog_style_variables).
% 0.06/0.46 set(print_models_tabular).
% 0.06/0.46 % set(print_models_tabular) -> clear(print_models).
% 0.06/0.46
% 0.06/0.46 formulas(sos).
% 0.06/0.46 e(exist) # label(clause_1) # label(negated_conjecture).
% 0.06/0.46 p2least(X1) | -c(X1) # label(clause_2) # label(axiom).
% 0.06/0.46 c(X1) | -p2least(X1) # label(clause_3) # label(axiom).
% 0.06/0.46 -p2least(X1) | -equalish(u1r2(X1),u1r1(X1)) # label(clause_4) # label(axiom).
% 0.06/0.46 p(X1,u1r1(X1)) | -p2least(X1) # label(clause_5) # label(axiom).
% 0.06/0.46 p(X1,u1r2(X1)) | -p2least(X1) # label(clause_6) # label(axiom).
% 0.06/0.46 p2least(X1) | equalish(X3,X2) | -p(X1,X3) | -p(X1,X2) # label(clause_7) # label(axiom).
% 0.06/0.46 p1most(X1) | -d(X1) # label(clause_8) # label(axiom).
% 0.06/0.46 d(X1) | -p1most(X1) # label(clause_9) # label(axiom).
% 0.06/0.46 equalish(X3,X2) | -p1most(X1) | -p(X1,X3) | -p(X1,X2) # label(clause_10) # label(axiom).
% 0.06/0.46 p1most(X1) | -equalish(u3r2(X1),u3r1(X1)) # label(clause_11) # label(axiom).
% 0.06/0.46 p1most(X1) | p(X1,u3r1(X1)) # label(clause_12) # label(axiom).
% 0.06/0.46 p1most(X1) | p(X1,u3r2(X1)) # label(clause_13) # label(axiom).
% 0.06/0.46 c(X1) | d(X1) | -a(X1) # label(clause_14) # label(axiom).
% 0.06/0.46 a(X1) | -d(X1) # label(clause_15) # label(axiom).
% 0.06/0.46 a(X1) | -c(X1) # label(clause_16) # label(axiom).
% 0.06/0.46 c(X2) | -r(X1,X2) # label(clause_17) # label(axiom).
% 0.06/0.46 t(X1,X2) | -r(X1,X2) # label(clause_18) # label(axiom).
% 0.06/0.46 d(X2) | -s(X1,X2) # label(clause_19) # label(axiom).
% 0.06/0.46 t(X1,X2) | -s(X1,X2) # label(clause_20) # label(axiom).
% 0.06/0.46 s1most(X1) | -e(X1) # label(clause_21) # label(axiom).
% 0.06/0.46 r1most(X1) | -e(X1) # label(clause_22) # label(axiom).
% 0.06/0.46 t3least(X1) | -e(X1) # label(clause_23) # label(axiom).
% 0.06/0.46 a(X2) | -e(X1) | -t(X1,X2) # label(clause_24) # label(axiom).
% 0.06/0.46 e(X1) | -a(u7r1(X1)) | -t3least(X1) | -r1most(X1) | -s1most(X1) # label(clause_25) # label(axiom).
% 0.06/0.46 e(X1) | t(X1,u7r1(X1)) | -t3least(X1) | -r1most(X1) | -s1most(X1) # label(clause_26) # label(axiom).
% 0.06/0.46 -t3least(X1) | -equalish(u8r2(X1),u8r1(X1)) # label(clause_27) # label(axiom).
% 0.06/0.46 -t3least(X1) | -equalish(u8r3(X1),u8r1(X1)) # label(clause_28) # label(axiom).
% 0.06/0.46 -t3least(X1) | -equalish(u8r3(X1),u8r2(X1)) # label(clause_29) # label(axiom).
% 0.06/0.46 t(X1,u8r1(X1)) | -t3least(X1) # label(clause_30) # label(axiom).
% 0.06/0.46 t(X1,u8r2(X1)) | -t3least(X1) # label(clause_31) # label(axiom).
% 0.06/0.46 t(X1,u8r3(X1)) | -t3least(X1) # label(clause_32) # label(axiom).
% 0.06/0.46 t3least(X1) | equalish(X4,X3) | equalish(X4,X2) | equalish(X3,X2) | -t(X1,X4) | -t(X1,X3) | -t(X1,X2) # label(clause_33) # label(axiom).
% 0.06/0.46 equalish(X3,X2) | -r1most(X1) | -r(X1,X3) | -r(X1,X2) # label(clause_34) # label(axiom).
% 0.06/0.46 r1most(X1) | -equalish(u9r2(X1),u9r1(X1)) # label(clause_35) # label(axiom).
% 0.06/0.46 r1most(X1) | r(X1,u9r1(X1)) # label(clause_36) # label(axiom).
% 0.06/0.46 r1most(X1) | r(X1,u9r2(X1)) # label(clause_37) # label(axiom).
% 0.06/0.46 equalish(X3,X2) | -s1most(X1) | -s(X1,X3) | -s(X1,X2) # label(clause_38) # label(axiom).
% 0.06/0.46 s1most(X1) | -equalish(u10r2(X1),u10r1(X1)) # label(clause_39) # label(axiom).
% 0.06/0.46 s1most(X1) | s(X1,u10r1(X1)) # label(clause_40) # label(axiom).
% 0.06/0.46 s1most(X1) | s(X1,u10r2(X1)) # label(clause_41) # label(axiom).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 % From the command line: assign(max_seconds, 300).
% 0.06/0.46
% 0.06/0.46 ============================== end of input ==========================
% 0.06/0.46
% 0.06/0.46 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.06/0.46
% 0.06/0.46 % Formulas that are not ordinary clauses:
% 0.06/0.46
% 0.06/0.46 ============================== end of process non-clausal formulas ===
% 0.06/0.46
% 0.06/0.46 ============================== CLAUSES FOR SEARCH ====================
% 0.06/0.46
% 0.06/0.46 formulas(mace4_clauses).
% 0.06/0.46 e(exist) # label(clause_1) # label(negated_conjecture).
% 0.06/0.46 p2least(A) | -c(A) # label(clause_2) # label(axiom).
% 0.06/0.46 c(A) | -p2least(A) # label(clause_3) # label(axiom).
% 0.06/0.46 -p2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_4) # label(axiom).
% 0.06/0.46 p(A,u1r1(A)) | -p2least(A) # label(clause_5) # label(axiom).
% 0.06/0.46 p(A,u1r2(A)) | -p2least(A) # label(clause_6) # label(axiom).
% 0.06/0.46 p2least(A) | equalish(B,C) | -p(A,B) | -p(A,C) # label(clause_7) # label(axiom).
% 0.06/0.46 p1most(A) | -d(A) # label(clause_8) # label(axiom).
% 0.06/0.46 d(A) | -p1most(A) # label(clause_9) # label(axiom).
% 0.06/0.46 equalish(A,B) | -p1most(C) | -p(C,A) | -p(C,B) # label(clause_10) # label(axiom).
% 0.06/0.46 p1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_11) # label(axiom).
% 0.06/0.46 p1most(A) | p(A,u3r1(A)) # label(clause_12) # label(axiom).
% 0.06/0.46 p1most(A) | p(A,u3r2(A)) # label(clause_13) # label(axiom).
% 0.06/0.46 c(A) | d(A) | -a(A) # label(clause_14) # label(axiom).
% 0.06/0.46 a(A) | -d(A) # label(clause_15) # label(axiom).
% 0.06/0.46 a(A) | -c(A) # label(clause_16) # label(axiom).
% 0.06/0.46 c(A) | -r(B,A) # label(clause_17) # label(axiom).
% 0.06/0.46 t(A,B) | -r(A,B) # label(clause_18) # label(axiom).
% 0.06/0.46 d(A) | -s(B,A) # label(clause_19) # label(axiom).
% 0.06/0.46 t(A,B) | -s(A,B) # label(clause_20) # label(axiom).
% 0.06/0.46 s1most(A) | -e(A) # label(clause_21) # label(axiom).
% 0.06/0.46 r1most(A) | -e(A) # label(clause_22) # label(axiom).
% 0.06/0.46 t3least(A) | -e(A) # label(clause_23) # label(axiom).
% 0.06/0.46 a(A) | -e(B) | -t(B,A) # label(clause_24) # label(axiom).
% 0.06/0.46 e(A) | -a(u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) # label(clause_25) # label(axiom).
% 0.06/0.46 e(A) | t(A,u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) # label(clause_26) # label(axiom).
% 0.06/0.46 -t3least(A) | -equalish(u8r2(A),u8r1(A)) # label(clause_27) # label(axiom).
% 0.06/0.46 -t3least(A) | -equalish(u8r3(A),u8r1(A)) # label(clause_28) # label(axiom).
% 0.06/0.46 -t3least(A) | -equalish(u8r3(A),u8r2(A)) # label(clause_29) # label(axiom).
% 0.06/0.46 t(A,u8r1(A)) | -t3least(A) # label(clause_30) # label(axiom).
% 0.06/0.46 t(A,u8r2(A)) | -t3least(A) # label(clause_31) # label(axiom).
% 0.06/0.46 t(A,u8r3(A)) | -t3least(A) # label(clause_32) # label(axiom).
% 0.06/0.46 t3least(A) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(A,B) | -t(A,C) | -t(A,D) # label(clause_33) # label(axiom).
% 0.06/0.46 equalish(A,B) | -r1most(C) | -r(C,A) | -r(C,B) # label(clause_34) # label(axiom).
% 0.06/0.46 r1most(A) | -equalish(u9r2(A),u9r1(A)) # label(clause_35) # label(axiom).
% 0.06/0.46 r1most(A) | r(A,u9r1(A)) # label(clause_36) # label(axiom).
% 0.06/0.46 r1most(A) | r(A,u9r2(A)) # label(clause_37) # label(axiom).
% 0.06/0.46 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_38) # label(axiom).
% 0.06/0.46 s1most(A) | -equalish(u10r2(A),u10r1(A)) # label(clause_39) # label(axiom).
% 0.06/0.46 s1most(A) | s(A,u10r1(A)) # label(clause_40) # label(axiom).
% 0.06/0.46 s1most(A) | s(A,u10r2(A)) # label(clause_41) # label(axiom).
% 0.06/0.46 end_of_list.
% 0.06/0.46
% 0.06/0.46 ============================== end of clauses for search =============
% 0.06/0.46 % SZS output start FiniteModel
% 0.06/0.46
% 0.06/0.46 % There are no natural numbers in the input.
% 0.06/0.46
% 0.06/0.46 exist : 0
% 0.06/0.46
% 0.06/0.46 u10r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u10r2 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u1r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u1r2 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u3r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u3r2 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u7r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u8r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u8r2 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u8r3 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u9r1 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 u9r2 :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 a :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 c :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 d :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 e :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 0
% 0.06/0.46
% 0.06/0.46 p1most :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 p2least :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 0 0
% 0.06/0.46
% 0.06/0.46 r1most :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 s1most :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 0
% 0.06/0.46
% 0.06/0.46 t3least :
% 0.06/0.46 0 1
% 0.06/0.46 -------
% 0.06/0.46 1 1
% 0.06/0.46
% 0.06/0.46 equalish :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 p :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 r :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 0 0
% 0.06/0.46
% 0.06/0.46 s :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 0 0
% 0.06/0.46 1 | 1 0
% 0.06/0.46
% 0.06/0.46 t :
% 0.06/0.46 | 0 1
% 0.06/0.46 --+----
% 0.06/0.46 0 | 1 0
% 0.06/0.46 1 | 1 0
% 0.06/0.46
% 0.06/0.46 % SZS output end FiniteModel
% 0.06/0.46 ------ process 35769 exit (max_models) ------
% 0.06/0.46
% 0.06/0.46 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.06/0.46
% 0.06/0.46 Exiting with 1 model.
% 0.06/0.46
% 0.06/0.46 Process 35769 exit (max_models) Tue Feb 7 19:39:16 2017
% 0.06/0.46 The process finished Tue Feb 7 19:39:16 2017
% 0.06/0.46 Mace4 ended
%------------------------------------------------------------------------------