TSTP Solution File: NLP008-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : NLP008-1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n142.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:59:08 EST 2017
% Result : Satisfiable 0.66s
% Output : FiniteModel 0.66s
% 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.18 % Problem : NLP008-1 : TPTP v6.4.0. Released v2.4.0.
% 0.03/0.18 % Command : mace4 -t %d -f %s
% 0.05/0.60 % Computer : n142.star.cs.uiowa.edu
% 0.05/0.60 % Model : x86_64 x86_64
% 0.05/0.60 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.05/0.60 % Memory : 32218.75MB
% 0.05/0.60 % OS : Linux 3.10.0-327.36.3.el7.x86_64
% 0.05/0.60 % CPULimit : 300
% 0.05/0.60 % DateTime : Tue Feb 7 20:09:18 CST 2017
% 0.05/0.60 % CPUTime :
% 0.66/2.09 % SZS status Satisfiable
% 0.66/2.09 ============================== Mace4 =================================
% 0.66/2.09 Mace4 (32) version 2009-11A, November 2009.
% 0.66/2.09 Process 60594 was started by sandbox2 on n142.star.cs.uiowa.edu,
% 0.66/2.09 Tue Feb 7 20:09:19 2017
% 0.66/2.09 The command was "/export/starexec/sandbox2/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_60561_n142.star.cs.uiowa.edu".
% 0.66/2.09 ============================== end of head ===========================
% 0.66/2.09
% 0.66/2.09 ============================== INPUT =================================
% 0.66/2.09
% 0.66/2.09 % Reading from file /tmp/Mace4_input_60561_n142.star.cs.uiowa.edu
% 0.66/2.09
% 0.66/2.09 set(prolog_style_variables).
% 0.66/2.09 set(print_models_tabular).
% 0.66/2.09 % set(print_models_tabular) -> clear(print_models).
% 0.66/2.09
% 0.66/2.09 formulas(sos).
% 0.66/2.09 city(skc29) # label(clause1) # label(negated_conjecture).
% 0.66/2.09 event(skc28) # label(clause2) # label(negated_conjecture).
% 0.66/2.09 lonely(skc27) # label(clause3) # label(negated_conjecture).
% 0.66/2.09 chevy(skc26) # label(clause4) # label(negated_conjecture).
% 0.66/2.09 seat(skc25) # label(clause5) # label(negated_conjecture).
% 0.66/2.09 young(skc24) # label(clause6) # label(negated_conjecture).
% 0.66/2.09 fellow(skc23) # label(clause7) # label(negated_conjecture).
% 0.66/2.09 city(skc22) # label(clause8) # label(negated_conjecture).
% 0.66/2.09 event(skc21) # label(clause9) # label(negated_conjecture).
% 0.66/2.09 old(skc20) # label(clause10) # label(negated_conjecture).
% 0.66/2.09 street(skc19) # label(clause11) # label(negated_conjecture).
% 0.66/2.09 seat(skc18) # label(clause12) # label(negated_conjecture).
% 0.66/2.09 front(skc17) # label(clause13) # label(negated_conjecture).
% 0.66/2.09 fellow(skc16) # label(clause14) # label(negated_conjecture).
% 0.66/2.09 young(skc15) # label(clause15) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | old(skc26) # label(clause16) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | dirty(skc26) # label(clause17) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | white(skc26) # label(clause18) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | car(skc26) # label(clause19) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | street(skc27) # label(clause20) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | way(skc27) # label(clause21) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | hollywood(skc29) # label(clause22) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | young(skc23) # label(clause23) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | man(skc23) # label(clause24) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | fellow(skc24) # label(clause25) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | man(skc24) # label(clause26) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | front(skc25) # label(clause27) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | furniture(skc25) # label(clause28) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | lonely(skc19) # label(clause29) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | way(skc19) # label(clause30) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | chevy(skc20) # label(clause31) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | car(skc20) # label(clause32) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | white(skc20) # label(clause33) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | dirty(skc20) # label(clause34) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | hollywood(skc22) # label(clause35) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | fellow(skc15) # label(clause36) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | man(skc15) # label(clause37) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | front(skc18) # label(clause38) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | furniture(skc18) # label(clause39) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | young(skc16) # label(clause40) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | man(skc16) # label(clause41) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | seat(skc17) # label(clause42) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | furniture(skc17) # label(clause43) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | down(skc28,skc27) # label(clause44) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | barrel(skc28,skc26) # label(clause45) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | in(skc28,skc29) # label(clause46) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | in(skc23,skc25) # label(clause47) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | in(skc24,skc25) # label(clause48) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | down(skc21,skc19) # label(clause49) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | barrel(skc21,skc20) # label(clause50) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | in(skc21,skc22) # label(clause51) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | in(skc15,skc18) # label(clause52) # label(negated_conjecture).
% 0.66/2.09 -ssSkC0 | in(skc16,skc17) # label(clause53) # label(negated_conjecture).
% 0.66/2.09 skc24 != skc23 | ssSkC0 # label(clause54) # label(negated_conjecture).
% 0.66/2.09 skc16 != skc15 | -ssSkC0 # label(clause55) # label(negated_conjecture).
% 0.66/2.09 -old(U) | -dirty(U) | -white(U) | -car(U) | -chevy(U) | -street(V) | -way(V) | -lonely(V) | -down(W,V) | -barrel(W,U) | -event(W) | -hollywood(X) | -city(X) | -in(W,X) | -young(Y) | -man(Y) | -fellow(Y) | -fellow(Z) | -man(Z) | -young(Z) | -in(Y,X1) | -in(Z,X1) | -front(X1) | -furniture(X1) | -seat(X1) | -ssSkC0 | Z = Y # label(clause56) # label(negated_conjecture).
% 0.66/2.09 -lonely(U) | -way(U) | -street(U) | -chevy(V) | -car(V) | -white(V) | -dirty(V) | -old(V) | -down(W,U) | -barrel(W,V) | -event(W) | -hollywood(X) | -city(X) | -in(W,X) | -fellow(Y) | -man(Y) | -young(Y) | -in(Y,Z) | -front(Z) | -furniture(Z) | -seat(Z) | -young(X1) | -man(X1) | -fellow(X1) | -seat(X2) | -furniture(X2) | -front(X2) | -in(X1,X2) | ssSkC0 | X1 = Y # label(clause57) # label(negated_conjecture).
% 0.66/2.09 end_of_list.
% 0.66/2.09
% 0.66/2.09 % From the command line: assign(max_seconds, 300).
% 0.66/2.09
% 0.66/2.09 ============================== end of input ==========================
% 0.66/2.09
% 0.66/2.09 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/2.09
% 0.66/2.09 % Formulas that are not ordinary clauses:
% 0.66/2.09
% 0.66/2.09 ============================== end of process non-clausal formulas ===
% 0.66/2.09
% 0.66/2.09 ============================== CLAUSES FOR SEARCH ====================
% 0.66/2.09
% 0.66/2.09 formulas(mace4_clauses).
% 0.66/2.09 city(skc29) # label(clause1) # label(negated_conjecture).
% 0.66/2.09 event(skc28) # label(clause2) # label(negated_conjecture).
% 0.66/2.09 lonely(skc27) # label(clause3) # label(negated_conjecture).
% 0.66/2.09 chevy(skc26) # label(clause4) # label(negated_conjecture).
% 0.66/2.09 seat(skc25) # label(clause5) # label(negated_conjecture).
% 0.66/2.09 young(skc24) # label(clause6) # label(negated_conjecture).
% 0.66/2.09 fellow(skc23) # label(clause7) # label(negated_conjecture).
% 0.66/2.09 city(skc22) # label(clause8) # label(negated_conjecture).
% 0.66/2.09 event(skc21) # label(clause9) # label(negated_conjecture).
% 0.66/2.09 old(skc20) # label(clause10) # label(negated_conjecture).
% 0.66/2.09 street(skc19) # label(clause11) # label(negated_conjecture).
% 0.66/2.09 seat(skc18) # label(clause12) # label(negated_conjecture).
% 0.66/2.09 front(skc17) # label(clause13) # label(negated_conjecture).
% 0.66/2.09 fellow(skc16) # label(clause14) # label(negated_conjecture).
% 0.66/2.09 young(skc15) # label(clause15) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | old(skc26) # label(clause16) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | dirty(skc26) # label(clause17) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | white(skc26) # label(clause18) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | car(skc26) # label(clause19) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | street(skc27) # label(clause20) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | way(skc27) # label(clause21) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | hollywood(skc29) # label(clause22) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | young(skc23) # label(clause23) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | man(skc23) # label(clause24) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | fellow(skc24) # label(clause25) # label(negated_conjecture).
% 0.66/2.09 ssSkC0 | man(skc24) # label(clause26) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | front(skc25) # label(clause27) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | furniture(skc25) # label(clause28) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | lonely(skc19) # label(clause29) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | way(skc19) # label(clause30) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | chevy(skc20) # label(clause31) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | car(skc20) # label(clause32) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | white(skc20) # label(clause33) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | dirty(skc20) # label(clause34) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | hollywood(skc22) # label(clause35) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | fellow(skc15) # label(clause36) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | man(skc15) # label(clause37) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | front(skc18) # label(clause38) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | furniture(skc18) # label(clause39) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | young(skc16) # label(clause40) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | man(skc16) # label(clause41) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | seat(skc17) # label(clause42) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | furniture(skc17) # label(clause43) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | down(skc28,skc27) # label(clause44) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | barrel(skc28,skc26) # label(clause45) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | in(skc28,skc29) # label(clause46) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | in(skc23,skc25) # label(clause47) # label(negated_conjecture).
% 0.66/2.10 ssSkC0 | in(skc24,skc25) # label(clause48) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | down(skc21,skc19) # label(clause49) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | barrel(skc21,skc20) # label(clause50) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | in(skc21,skc22) # label(clause51) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | in(skc15,skc18) # label(clause52) # label(negated_conjecture).
% 0.66/2.10 -ssSkC0 | in(skc16,skc17) # label(clause53) # label(negated_conjecture).
% 0.66/2.10 skc24 != skc23 | ssSkC0 # label(clause54) # label(negated_conjecture).
% 0.66/2.10 skc16 != skc15 | -ssSkC0 # label(clause55) # label(negated_conjecture).
% 0.66/2.10 -old(A) | -dirty(A) | -white(A) | -car(A) | -chevy(A) | -street(B) | -way(B) | -lonely(B) | -down(C,B) | -barrel(C,A) | -event(C) | -hollywood(D) | -city(D) | -in(C,D) | -young(E) | -man(E) | -fellow(E) | -fellow(F) | -man(F) | -young(F) | -in(E,V6) | -in(F,V6) | -front(V6) | -furniture(V6) | -seat(V6) | -ssSkC0 | F = E # label(clause56) # label(negated_conjecture).
% 0.66/2.10 -lonely(A) | -way(A) | -street(A) | -chevy(B) | -car(B) | -white(B) | -dirty(B) | -old(B) | -down(C,A) | -barrel(C,B) | -event(C) | -hollywood(D) | -city(D) | -in(C,D) | -fellow(E) | -man(E) | -young(E) | -in(E,F) | -front(F) | -furniture(F) | -seat(F) | -young(V6) | -man(V6) | -fellow(V6) | -seat(V7) | -furniture(V7) | -front(V7) | -in(V6,V7) | ssSkC0 | V6 = E # label(clause57) # label(negated_conjecture).
% 0.66/2.10 end_of_list.
% 0.66/2.10
% 0.66/2.10 ============================== end of clauses for search =============
% 0.66/2.10 % SZS output start FiniteModel
% 0.66/2.10
% 0.66/2.10 % There are no natural numbers in the input.
% 0.66/2.10
% 0.66/2.10 skc15 : 0
% 0.66/2.10
% 0.66/2.10 skc16 : 1
% 0.66/2.10
% 0.66/2.10 skc17 : 0
% 0.66/2.10
% 0.66/2.10 skc18 : 1
% 0.66/2.10
% 0.66/2.10 skc19 : 0
% 0.66/2.10
% 0.66/2.10 skc20 : 0
% 0.66/2.10
% 0.66/2.10 skc21 : 0
% 0.66/2.10
% 0.66/2.10 skc22 : 1
% 0.66/2.10
% 0.66/2.10 skc23 : 0
% 0.66/2.10
% 0.66/2.10 skc24 : 0
% 0.66/2.10
% 0.66/2.10 skc25 : 0
% 0.66/2.10
% 0.66/2.10 skc26 : 0
% 0.66/2.10
% 0.66/2.10 skc27 : 0
% 0.66/2.10
% 0.66/2.10 skc28 : 0
% 0.66/2.10
% 0.66/2.10 skc29 : 0
% 0.66/2.10
% 0.66/2.10 ssSkC0 : 1
% 0.66/2.10
% 0.66/2.10 car :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 chevy :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 city :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 dirty :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 event :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 fellow :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 front :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 furniture :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 hollywood :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 0 1
% 0.66/2.10
% 0.66/2.10 lonely :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 man :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 old :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 seat :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 street :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 way :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 white :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 0
% 0.66/2.10
% 0.66/2.10 young :
% 0.66/2.10 0 1
% 0.66/2.10 -------
% 0.66/2.10 1 1
% 0.66/2.10
% 0.66/2.10 barrel :
% 0.66/2.10 | 0 1
% 0.66/2.10 --+----
% 0.66/2.10 0 | 1 0
% 0.66/2.10 1 | 0 0
% 0.66/2.10
% 0.66/2.10 down :
% 0.66/2.10 | 0 1
% 0.66/2.10 --+----
% 0.66/2.10 0 | 1 0
% 0.66/2.10 1 | 0 0
% 0.66/2.10
% 0.66/2.10 in :
% 0.66/2.10 | 0 1
% 0.66/2.10 --+----
% 0.66/2.10 0 | 0 1
% 0.66/2.10 1 | 1 0
% 0.66/2.10
% 0.66/2.10 % SZS output end FiniteModel
% 0.66/2.10 ------ process 60594 exit (max_models) ------
% 0.66/2.10
% 0.66/2.10 User_CPU=0.42, System_CPU=0.00, Wall_clock=0.
% 0.66/2.10
% 0.66/2.10 Exiting with 1 model.
% 0.66/2.10
% 0.66/2.10 Process 60594 exit (max_models) Tue Feb 7 20:09:19 2017
% 0.66/2.10 The process finished Tue Feb 7 20:09:19 2017
% 0.66/2.10 Mace4 ended
%------------------------------------------------------------------------------