TSTP Solution File: NLP231-1 by Mace4---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Mace4---1109a
% Problem : NLP231-1 : TPTP v6.4.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : mace4 -t %d -f %s
% Computer : n017.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 10:00:02 EST 2017
% Result : Satisfiable 100.11s
% Output : FiniteModel 100.11s
% 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 : NLP231-1 : TPTP v6.4.0. Released v2.4.0.
% 0.00/0.04 % Command : mace4 -t %d -f %s
% 0.02/0.23 % Computer : n017.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 20:17:01 CST 2017
% 0.02/0.23 % CPUTime :
% 100.11/100.32 % SZS status Satisfiable
% 100.11/100.32 ============================== Mace4 =================================
% 100.11/100.32 Mace4 (32) version 2009-11A, November 2009.
% 100.11/100.32 Process 2829 was started by sandbox on n017.star.cs.uiowa.edu,
% 100.11/100.32 Tue Feb 7 20:17:01 2017
% 100.11/100.32 The command was "/export/starexec/sandbox/solver/bin/mace4 -t 300 -f /tmp/Mace4_input_2796_n017.star.cs.uiowa.edu".
% 100.11/100.32 ============================== end of head ===========================
% 100.11/100.32
% 100.11/100.32 ============================== INPUT =================================
% 100.11/100.32
% 100.11/100.32 % Reading from file /tmp/Mace4_input_2796_n017.star.cs.uiowa.edu
% 100.11/100.32
% 100.11/100.32 set(prolog_style_variables).
% 100.11/100.32 set(print_models_tabular).
% 100.11/100.32 % set(print_models_tabular) -> clear(print_models).
% 100.11/100.32
% 100.11/100.32 formulas(sos).
% 100.11/100.32 actual_world(skc45) # label(clause1) # label(negated_conjecture).
% 100.11/100.32 actual_world(skc28) # label(clause2) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | accessible_world(skc45,skc55) # label(clause3) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | proposition(skc45,skc55) # label(clause4) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc45,skc56) # label(clause5) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc45,skc56) # label(clause6) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | think_believe_consider(skc45,skc56) # label(clause7) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc57) # label(clause8) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | vincent_forename(skc45,skc57) # label(clause9) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc58) # label(clause10) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | state(skc45,skc50) # label(clause11) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc54) # label(clause12) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | jules_forename(skc45,skc54) # label(clause13) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | smoke(skc46,skc53) # label(clause14) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc46,skc53) # label(clause15) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc46,skc53) # label(clause16) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc51) # label(clause17) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | jules_forename(skc45,skc52) # label(clause18) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc52) # label(clause19) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | proposition(skc45,skc46) # label(clause20) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | accessible_world(skc45,skc46) # label(clause21) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | think_believe_consider(skc45,skc47) # label(clause22) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc45,skc47) # label(clause23) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc45,skc47) # label(clause24) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | vincent_forename(skc45,skc48) # label(clause25) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc48) # label(clause26) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc49) # label(clause27) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | accessible_world(skc28,skc38) # label(clause28) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | proposition(skc28,skc38) # label(clause29) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc28,skc39) # label(clause30) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc28,skc39) # label(clause31) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | think_believe_consider(skc28,skc39) # label(clause32) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc40) # label(clause33) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | vincent_forename(skc28,skc40) # label(clause34) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc41) # label(clause35) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | state(skc28,skc35) # label(clause36) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc36) # label(clause37) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | jules_forename(skc28,skc37) # label(clause38) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc37) # label(clause39) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | proposition(skc28,skc29) # label(clause40) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | accessible_world(skc28,skc29) # label(clause41) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc31) # label(clause42) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | vincent_forename(skc28,skc31) # label(clause43) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc32) # label(clause44) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | smoke(skc29,skc34) # label(clause45) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc29,skc34) # label(clause46) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc29,skc34) # label(clause47) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc33) # label(clause48) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | jules_forename(skc28,skc33) # label(clause49) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | think_believe_consider(skc28,skc30) # label(clause50) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc28,skc30) # label(clause51) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc28,skc30) # label(clause52) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | theme(skc45,skc56,skc55) # label(clause53) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc57,skc58) # label(clause54) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc45,skc56,skc58) # label(clause55) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc54,skc51) # label(clause56) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc46,skc53,skc51) # label(clause57) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc52,skc51) # label(clause58) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | theme(skc45,skc47,skc46) # label(clause59) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc45,skc47,skc49) # label(clause60) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc48,skc49) # label(clause61) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | theme(skc28,skc39,skc38) # label(clause62) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc40,skc41) # label(clause63) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc28,skc39,skc41) # label(clause64) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc37,skc36) # label(clause65) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc31,skc32) # label(clause66) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc28,skc30,skc32) # label(clause67) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc29,skc34,skc32) # label(clause68) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc33,skc32) # label(clause69) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | theme(skc28,skc30,skc29) # label(clause70) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | be(skc45,skc50,skc51,skc51) # label(clause71) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | be(skc28,skc35,skc36,skc36) # label(clause72) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,U) | ssSkC0 | event(skc55,skf9(V)) # label(clause73) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,U) | ssSkC0 | present(skc55,skf9(V)) # label(clause74) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,U) | ssSkC0 | smoke(skc55,skf9(V)) # label(clause75) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,U) | -ssSkC0 | event(skc38,skf5(V)) # label(clause76) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,U) | -ssSkC0 | present(skc38,skf5(V)) # label(clause77) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,U) | -ssSkC0 | smoke(skc38,skf5(V)) # label(clause78) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,U) | ssSkC0 | agent(skc55,skf9(U),U) # label(clause79) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,U) | -ssSkC0 | agent(skc38,skf5(U),U) # label(clause80) # label(negated_conjecture).
% 100.11/100.32 -accessible_world(U,V) | -proposition(U,V) | -theme(U,W,V) | -event(U,W) | -present(U,W) | -think_believe_consider(U,W) | -forename(U,X) | -vincent_forename(U,X) | -of(U,X,Y) | -man(U,Y) | -agent(U,W,Y) | -state(U,Z) | -smoke(X1,X2) | -present(X1,X2) | -agent(X1,X2,X3) | -event(X1,X2) | -be(U,Z,X3,X3) | -man(U,X3) | -of(U,X4,X3) | -jules_forename(U,X4) | -forename(U,X4) | -proposition(U,X1) | -accessible_world(U,X1) | -think_believe_consider(U,X5) | -present(U,X5) | -event(U,X5) | -theme(U,X5,X1) | -vincent_forename(U,X6) | -forename(U,X6) | -agent(U,X5,X7) | -man(U,X7) | -of(U,X6,X7) | -actual_world(U) | -ssSkC0 | man(V,skf7(V)) # label(clause81) # label(negated_conjecture).
% 100.11/100.32 -accessible_world(U,V) | -proposition(U,V) | -theme(U,W,V) | -event(U,W) | -present(U,W) | -think_believe_consider(U,W) | -forename(U,X) | -vincent_forename(U,X) | -of(U,X,Y) | -man(U,Y) | -agent(U,W,Y) | -state(U,Z) | -be(U,Z,X1,X1) | -man(U,X1) | -of(U,X2,X1) | -jules_forename(U,X2) | -forename(U,X2) | -proposition(U,X3) | -accessible_world(U,X3) | -forename(U,X4) | -vincent_forename(U,X4) | -of(U,X4,X5) | -man(U,X5) | -agent(U,X6,X5) | -smoke(X3,X7) | -present(X3,X7) | -agent(X3,X7,X5) | -event(X3,X7) | -forename(U,X8) | -jules_forename(U,X8) | -of(U,X8,X5) | -think_believe_consider(U,X6) | -present(U,X6) | -event(U,X6) | -theme(U,X6,X3) | -actual_world(U) | ssSkC0 | man(V,skf11(V)) # label(clause82) # label(negated_conjecture).
% 100.11/100.32 -smoke(U,V) | -present(U,V) | -agent(U,V,skf7(U)) | -event(U,V) | -accessible_world(W,U) | -proposition(W,U) | -theme(W,X,U) | -event(W,X) | -present(W,X) | -think_believe_consider(W,X) | -forename(W,Y) | -vincent_forename(W,Y) | -of(W,Y,Z) | -man(W,Z) | -agent(W,X,Z) | -state(W,X1) | -smoke(X2,X3) | -present(X2,X3) | -agent(X2,X3,X4) | -event(X2,X3) | -be(W,X1,X4,X4) | -man(W,X4) | -of(W,X5,X4) | -jules_forename(W,X5) | -forename(W,X5) | -proposition(W,X2) | -accessible_world(W,X2) | -think_believe_consider(W,X6) | -present(W,X6) | -event(W,X6) | -theme(W,X6,X2) | -vincent_forename(W,X7) | -forename(W,X7) | -agent(W,X6,X8) | -man(W,X8) | -of(W,X7,X8) | -actual_world(W) | -ssSkC0 # label(clause83) # label(negated_conjecture).
% 100.11/100.32 -smoke(U,V) | -present(U,V) | -agent(U,V,skf11(U)) | -event(U,V) | -accessible_world(W,U) | -proposition(W,U) | -theme(W,X,U) | -event(W,X) | -present(W,X) | -think_believe_consider(W,X) | -forename(W,Y) | -vincent_forename(W,Y) | -of(W,Y,Z) | -man(W,Z) | -agent(W,X,Z) | -state(W,X1) | -be(W,X1,X2,X2) | -man(W,X2) | -of(W,X3,X2) | -jules_forename(W,X3) | -forename(W,X3) | -proposition(W,X4) | -accessible_world(W,X4) | -forename(W,X5) | -vincent_forename(W,X5) | -of(W,X5,X6) | -man(W,X6) | -agent(W,X7,X6) | -smoke(X4,X8) | -present(X4,X8) | -agent(X4,X8,X6) | -event(X4,X8) | -forename(W,X9) | -jules_forename(W,X9) | -of(W,X9,X6) | -think_believe_consider(W,X7) | -present(W,X7) | -event(W,X7) | -theme(W,X7,X4) | -actual_world(W) | ssSkC0 # label(clause84) # label(negated_conjecture).
% 100.11/100.32 end_of_list.
% 100.11/100.32
% 100.11/100.32 % From the command line: assign(max_seconds, 300).
% 100.11/100.32
% 100.11/100.32 ============================== end of input ==========================
% 100.11/100.32
% 100.11/100.32 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 100.11/100.32
% 100.11/100.32 % Formulas that are not ordinary clauses:
% 100.11/100.32
% 100.11/100.32 ============================== end of process non-clausal formulas ===
% 100.11/100.32
% 100.11/100.32 ============================== CLAUSES FOR SEARCH ====================
% 100.11/100.32
% 100.11/100.32 formulas(mace4_clauses).
% 100.11/100.32 actual_world(skc45) # label(clause1) # label(negated_conjecture).
% 100.11/100.32 actual_world(skc28) # label(clause2) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | accessible_world(skc45,skc55) # label(clause3) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | proposition(skc45,skc55) # label(clause4) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc45,skc56) # label(clause5) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc45,skc56) # label(clause6) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | think_believe_consider(skc45,skc56) # label(clause7) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc57) # label(clause8) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | vincent_forename(skc45,skc57) # label(clause9) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc58) # label(clause10) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | state(skc45,skc50) # label(clause11) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc54) # label(clause12) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | jules_forename(skc45,skc54) # label(clause13) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | smoke(skc46,skc53) # label(clause14) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc46,skc53) # label(clause15) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc46,skc53) # label(clause16) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc51) # label(clause17) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | jules_forename(skc45,skc52) # label(clause18) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc52) # label(clause19) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | proposition(skc45,skc46) # label(clause20) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | accessible_world(skc45,skc46) # label(clause21) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | think_believe_consider(skc45,skc47) # label(clause22) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | present(skc45,skc47) # label(clause23) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | event(skc45,skc47) # label(clause24) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | vincent_forename(skc45,skc48) # label(clause25) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | forename(skc45,skc48) # label(clause26) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | man(skc45,skc49) # label(clause27) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | accessible_world(skc28,skc38) # label(clause28) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | proposition(skc28,skc38) # label(clause29) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc28,skc39) # label(clause30) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc28,skc39) # label(clause31) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | think_believe_consider(skc28,skc39) # label(clause32) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc40) # label(clause33) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | vincent_forename(skc28,skc40) # label(clause34) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc41) # label(clause35) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | state(skc28,skc35) # label(clause36) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc36) # label(clause37) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | jules_forename(skc28,skc37) # label(clause38) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc37) # label(clause39) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | proposition(skc28,skc29) # label(clause40) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | accessible_world(skc28,skc29) # label(clause41) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc31) # label(clause42) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | vincent_forename(skc28,skc31) # label(clause43) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | man(skc28,skc32) # label(clause44) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | smoke(skc29,skc34) # label(clause45) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc29,skc34) # label(clause46) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc29,skc34) # label(clause47) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | forename(skc28,skc33) # label(clause48) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | jules_forename(skc28,skc33) # label(clause49) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | think_believe_consider(skc28,skc30) # label(clause50) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | present(skc28,skc30) # label(clause51) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | event(skc28,skc30) # label(clause52) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | theme(skc45,skc56,skc55) # label(clause53) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc57,skc58) # label(clause54) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc45,skc56,skc58) # label(clause55) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc54,skc51) # label(clause56) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc46,skc53,skc51) # label(clause57) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc52,skc51) # label(clause58) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | theme(skc45,skc47,skc46) # label(clause59) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | agent(skc45,skc47,skc49) # label(clause60) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | of(skc45,skc48,skc49) # label(clause61) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | theme(skc28,skc39,skc38) # label(clause62) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc40,skc41) # label(clause63) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc28,skc39,skc41) # label(clause64) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc37,skc36) # label(clause65) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc31,skc32) # label(clause66) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc28,skc30,skc32) # label(clause67) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | agent(skc29,skc34,skc32) # label(clause68) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | of(skc28,skc33,skc32) # label(clause69) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | theme(skc28,skc30,skc29) # label(clause70) # label(negated_conjecture).
% 100.11/100.32 ssSkC0 | be(skc45,skc50,skc51,skc51) # label(clause71) # label(negated_conjecture).
% 100.11/100.32 -ssSkC0 | be(skc28,skc35,skc36,skc36) # label(clause72) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,A) | ssSkC0 | event(skc55,skf9(B)) # label(clause73) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,A) | ssSkC0 | present(skc55,skf9(B)) # label(clause74) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,A) | ssSkC0 | smoke(skc55,skf9(B)) # label(clause75) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,A) | -ssSkC0 | event(skc38,skf5(B)) # label(clause76) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,A) | -ssSkC0 | present(skc38,skf5(B)) # label(clause77) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,A) | -ssSkC0 | smoke(skc38,skf5(B)) # label(clause78) # label(negated_conjecture).
% 100.11/100.32 -man(skc55,A) | ssSkC0 | agent(skc55,skf9(A),A) # label(clause79) # label(negated_conjecture).
% 100.11/100.32 -man(skc38,A) | -ssSkC0 | agent(skc38,skf5(A),A) # label(clause80) # label(negated_conjecture).
% 100.11/100.32 -accessible_world(A,B) | -proposition(A,B) | -theme(A,C,B) | -event(A,C) | -present(A,C) | -think_believe_consider(A,C) | -forename(A,D) | -vincent_forename(A,D) | -of(A,D,E) | -man(A,E) | -agent(A,C,E) | -state(A,F) | -smoke(V6,V7) | -present(V6,V7) | -agent(V6,V7,V8) | -event(V6,V7) | -be(A,F,V8,V8) | -man(A,V8) | -of(A,V9,V8) | -jules_forename(A,V9) | -forename(A,V9) | -proposition(A,V6) | -accessible_world(A,V6) | -think_believe_consider(A,V10) | -present(A,V10) | -event(A,V10) | -theme(A,V10,V6) | -vincent_forename(A,V11) | -forename(A,V11) | -agent(A,V10,V12) | -man(A,V12) | -of(A,V11,V12) | -actual_world(A) | -ssSkC0 | man(B,skf7(B)) # label(clause81) # label(negated_conjecture).
% 100.11/100.32 -accessible_world(A,B) | -proposition(A,B) | -theme(A,C,B) | -event(A,C) | -present(A,C) | -think_believe_consider(A,C) | -forename(A,D) | -vincent_forename(A,D) | -of(A,D,E) | -man(A,E) | -agent(A,C,E) | -state(A,F) | -be(A,F,V6,V6) | -man(A,V6) | -of(A,V7,V6) | -jules_forename(A,V7) | -forename(A,V7) | -proposition(A,V8) | -accessible_world(A,V8) | -forename(A,V9) | -vincent_forename(A,V9) | -of(A,V9,V10) | -man(A,V10) | -agent(A,V11,V10) | -smoke(V8,V12) | -present(V8,V12) | -agent(V8,V12,V10) | -event(V8,V12) | -forename(A,V13) | -jules_forename(A,V13) | -of(A,V13,V10) | -think_believe_consider(A,V11) | -present(A,V11) | -event(A,V11) | -theme(A,V11,V8) | -actual_world(A) | ssSkC0 | man(B,skf11(B)) # label(clause82) # label(negated_conjecture).
% 100.11/100.32 -smoke(A,B) | -present(A,B) | -agent(A,B,skf7(A)) | -event(A,B) | -accessible_world(C,A) | -proposition(C,A) | -theme(C,D,A) | -event(C,D) | -present(C,D) | -think_believe_consider(C,D) | -forename(C,E) | -vincent_forename(C,E) | -of(C,E,F) | -man(C,F) | -agent(C,D,F) | -state(C,V6) | -smoke(V7,V8) | -present(V7,V8) | -agent(V7,V8,V9) | -event(V7,V8) | -be(C,V6,V9,V9) | -man(C,V9) | -of(C,V10,V9) | -jules_forename(C,V10) | -forename(C,V10) | -proposition(C,V7) | -accessible_world(C,V7) | -think_believe_consider(C,V11) | -present(C,V11) | -event(C,V11) | -theme(C,V11,V7) | -vincent_forename(C,V12) | -forename(C,V12) | -agent(C,V11,V13) | -man(C,V13) | -of(C,V12,V13) | -actual_world(C) | -ssSkC0 # label(clause83) # label(negated_conjecture).
% 100.11/100.32 -smoke(A,B) | -present(A,B) | -agent(A,B,skf11(A)) | -event(A,B) | -accessible_world(C,A) | -proposition(C,A) | -theme(C,D,A) | -event(C,D) | -present(C,D) | -think_believe_consider(C,D) | -forename(C,E) | -vincent_forename(C,E) | -of(C,E,F) | -man(C,F) | -agent(C,D,F) | -state(C,V6) | -be(C,V6,V7,V7) | -man(C,V7) | -of(C,V8,V7) | -jules_forename(C,V8) | -forename(C,V8) | -proposition(C,V9) | -accessible_world(C,V9) | -forename(C,V10) | -vincent_forename(C,V10) | -of(C,V10,V11) | -man(C,V11) | -agent(C,V12,V11) | -smoke(V9,V13) | -present(V9,V13) | -agent(V9,V13,V11) | -event(V9,V13) | -forename(C,V14) | -jules_forename(C,V14) | -of(C,V14,V11) | -think_believe_consider(C,V12) | -present(C,V12) | -event(C,V12) | -theme(C,V12,V9) | -actual_world(C) | ssSkC0 # label(clause84) # label(negated_conjecture).
% 100.11/100.32 end_of_list.
% 100.11/100.32
% 100.11/100.32 ============================== end of clauses for search =============
% 100.11/100.32 % SZS output start FiniteModel
% 100.11/100.32
% 100.11/100.32 % There are no natural numbers in the input.
% 100.11/100.32
% 100.11/100.32 skc28 : 0
% 100.11/100.32
% 100.11/100.32 skc29 : 0
% 100.11/100.32
% 100.11/100.32 skc30 : 0
% 100.11/100.32
% 100.11/100.32 skc31 : 0
% 100.11/100.32
% 100.11/100.32 skc32 : 0
% 100.11/100.32
% 100.11/100.32 skc33 : 0
% 100.11/100.32
% 100.11/100.32 skc34 : 0
% 100.11/100.32
% 100.11/100.32 skc35 : 0
% 100.11/100.32
% 100.11/100.32 skc36 : 0
% 100.11/100.32
% 100.11/100.32 skc37 : 0
% 100.11/100.32
% 100.11/100.32 skc38 : 0
% 100.11/100.32
% 100.11/100.32 skc39 : 0
% 100.11/100.32
% 100.11/100.32 skc40 : 0
% 100.11/100.32
% 100.11/100.32 skc41 : 0
% 100.11/100.32
% 100.11/100.32 skc45 : 0
% 100.11/100.32
% 100.11/100.32 skc46 : 0
% 100.11/100.32
% 100.11/100.32 skc47 : 0
% 100.11/100.32
% 100.11/100.32 skc48 : 0
% 100.11/100.32
% 100.11/100.32 skc49 : 0
% 100.11/100.32
% 100.11/100.32 skc50 : 0
% 100.11/100.32
% 100.11/100.32 skc51 : 1
% 100.11/100.32
% 100.11/100.32 skc52 : 0
% 100.11/100.32
% 100.11/100.32 skc53 : 1
% 100.11/100.32
% 100.11/100.32 skc54 : 0
% 100.11/100.32
% 100.11/100.32 skc55 : 1
% 100.11/100.32
% 100.11/100.32 skc56 : 0
% 100.11/100.32
% 100.11/100.32 skc57 : 0
% 100.11/100.32
% 100.11/100.32 skc58 : 0
% 100.11/100.32
% 100.11/100.32 skf11 :
% 100.11/100.32 0 1
% 100.11/100.32 -------
% 100.11/100.32 0 0
% 100.11/100.32
% 100.11/100.32 skf5 :
% 100.11/100.32 0 1
% 100.11/100.32 -------
% 100.11/100.32 0 0
% 100.11/100.32
% 100.11/100.32 skf7 :
% 100.11/100.32 0 1
% 100.11/100.32 -------
% 100.11/100.32 0 0
% 100.11/100.32
% 100.11/100.32 skf9 :
% 100.11/100.32 0 1
% 100.11/100.32 -------
% 100.11/100.32 0 0
% 100.11/100.32
% 100.11/100.32 ssSkC0 : 0
% 100.11/100.32
% 100.11/100.32 actual_world :
% 100.11/100.32 0 1
% 100.11/100.32 -------
% 100.11/100.32 1 0
% 100.11/100.32
% 100.11/100.32 accessible_world :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 event :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 forename :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 0
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 jules_forename :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 0
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 man :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 present :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 proposition :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 smoke :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 0 1
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 state :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 0
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 think_believe_consider :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 0
% 100.11/100.32 1 | 0 0
% 100.11/100.32
% 100.11/100.32 vincent_forename :
% 100.11/100.32 | 0 1
% 100.11/100.32 --+----
% 100.11/100.32 0 | 1 0
% 100.11/100.32 1 | 0 0
% 100.11/100.32 agent(0,0,0) = 1.
% 100.11/100.32 agent(0,0,1) = 0.
% 100.11/100.32 agent(0,1,0) = 0.
% 100.11/100.32 agent(0,1,1) = 1.
% 100.11/100.32 agent(1,0,0) = 0.
% 100.11/100.32 agent(1,0,1) = 0.
% 100.11/100.32 agent(1,1,0) = 0.
% 100.11/100.32 agent(1,1,1) = 0.
% 100.11/100.32 of(0,0,0) = 1.
% 100.11/100.32 of(0,0,1) = 1.
% 100.11/100.32 of(0,1,0) = 0.
% 100.11/100.32 of(0,1,1) = 0.
% 100.11/100.32 of(1,0,0) = 0.
% 100.11/100.32 of(1,0,1) = 0.
% 100.11/100.32 of(1,1,0) = 0.
% 100.11/100.32 of(1,1,1) = 0.
% 100.11/100.32 theme(0,0,0) = 1.
% 100.11/100.32 theme(0,0,1) = 1.
% 100.11/100.32 theme(0,1,0) = 0.
% 100.11/100.32 theme(0,1,1) = 0.
% 100.11/100.32 theme(1,0,0) = 0.
% 100.11/100.32 theme(1,0,1) = 0.
% 100.11/100.32 theme(1,1,0) = 0.
% 100.11/100.32 theme(1,1,1) = 0.
% 100.11/100.32 be(0,0,0,0) = 0.
% 100.11/100.32 be(0,0,0,1) = 0.
% 100.11/100.32 be(0,0,1,0) = 0.
% 100.11/100.32 be(0,0,1,1) = 1.
% 100.11/100.32 be(0,1,0,0) = 0.
% 100.11/100.32 be(0,1,0,1) = 0.
% 100.11/100.32 be(0,1,1,0) = 0.
% 100.11/100.32 be(0,1,1,1) = 0.
% 100.11/100.32 be(1,0,0,0) = 0.
% 100.11/100.32 be(1,0,0,1) = 0.
% 100.11/100.32 be(1,0,1,0) = 0.
% 100.11/100.32 be(1,0,1,1) = 0.
% 100.11/100.32 be(1,1,0,0) = 0.
% 100.11/100.32 be(1,1,0,1) = 0.
% 100.11/100.32 be(1,1,1,0) = 0.
% 100.11/100.32 be(1,1,1,1) = 0.
% 100.11/100.32
% 100.11/100.32 % SZS output end FiniteModel
% 100.11/100.32 ------ process 2829 exit (max_models) ------
% 100.11/100.32
% 100.11/100.32 User_CPU=99.88, System_CPU=0.05, Wall_clock=100.
% 100.11/100.32
% 100.11/100.32 Exiting with 1 model.
% 100.11/100.32
% 100.11/100.32 Process 2829 exit (max_models) Tue Feb 7 20:18:41 2017
% 100.11/100.32 The process finished Tue Feb 7 20:18:41 2017
% 100.11/100.32 Mace4 ended
%------------------------------------------------------------------------------