%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : NLP221-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.cs.miami.edu
% Model    : i686 unknown
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 1000MB
% OS       : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s

% Result   : Timeout 605.8s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/NLP/NLP221-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: medium
% 
% strategies selected: 
% (hyper 27 #f 2 47)
% (binary-unit 10 #f 2 47)
% (binary-double 16 #f 2 47)
% (binary 54 #t 2 47)
% (binary-order 27 #f 2 47)
% (binary-posweight-order 125 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 27 #f)
% (binary-weightorder 54 #f)
% (binary-order 54 #f)
% (hyper-order 43 #f)
% (binary 109 #t)
% 
% 
% SOS clause 
% -state(X,Y) | -man(X,Z) | -smoke(U,V) | -present(U,V) | -agent(U,V,skf7(U)) | -event(U,V) | -accessible_world(X,U) | -proposition(X,U) | -theme(X,W,U) | -event(X,W) | -present(X,W) | -think_believe_consider(X,W) | -forename(X,X1) | -vincent_forename(X,X1) | -of(X,X1,X2) | -man(X,X2) | -agent(X,W,X2) | -be(X,Y,X2,Z) | -forename(X,X3) | -jules_forename(X,X3) | -of(X,X3,X2) | -actual_world(X) | -ss^sk^c0(0).
% was split for some strategies as: 
% -state(X,Y) | -man(X,Z) | -accessible_world(X,U) | -smoke(U,V) | -present(U,V) | -agent(U,V,skf7(U)) | -event(U,V) | -proposition(X,U) | -theme(X,W,U) | -event(X,W) | -present(X,W) | -think_believe_consider(X,W) | -forename(X,X1) | -vincent_forename(X,X1) | -of(X,X1,X2) | -man(X,X2) | -agent(X,W,X2) | -be(X,Y,X2,Z) | -forename(X,X3) | -jules_forename(X,X3) | -of(X,X3,X2) | -actual_world(X).
% -ss^sk^c0(0).
% 
% Starting a split proof attempt with 2 components.
% 
% Split component 1 started.
% 
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split: 
% -state(X,Y) | -man(X,Z) | -smoke(U,V) | -present(U,V) | -agent(U,V,skf7(U)) | -event(U,V) | -accessible_world(X,U) | -proposition(X,U) | -theme(X,W,U) | -event(X,W) | -present(X,W) | -think_believe_consider(X,W) | -forename(X,X1) | -vincent_forename(X,X1) | -of(X,X1,X2) | -man(X,X2) | -agent(X,W,X2) | -be(X,Y,X2,Z) | -forename(X,X3) | -jules_forename(X,X3) | -of(X,X3,X2) | -actual_world(X) | -ss^sk^c0(0).
% Split part used next: -state(X,Y) | -man(X,Z) | -accessible_world(X,U) | -smoke(U,V) | -present(U,V) | -agent(U,V,skf7(U)) | -event(U,V) | -proposition(X,U) | -theme(X,W,U) | -event(X,W) | -present(X,W) | -think_believe_consider(X,W) | -forename(X,X1) | -vincent_forename(X,X1) | -of(X,X1,X2) | -man(X,X2) | -agent(X,W,X2) | -be(X,Y,X2,Z) | -forename(X,X3) | -jules_forename(X,X3) | -of(X,X3,X2) | -actual_world(X).
% Wow, gandalf-wrapper got a signal XCPU
% END OF PROOFPARTXcpu signal caught by Gandalf: stopping
% 
%------------------------------------------------------------------------------