%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SWC396-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 : art06.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 607.3s
% 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/SWC/SWC396-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: big
% 
% strategies selected: 
% (hyper 28 #f 5 21)
% (binary-unit 28 #f 5 21)
% (binary-double 11 #f 5 21)
% (binary-double 17 #f)
% (binary-double 17 #t)
% (binary 87 #t 5 21)
% (binary-order 28 #f 5 21)
% (binary-posweight-order 58 #f)
% (binary-posweight-lex-big-order 28 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order-sos 28 #t)
% (binary-unit-uniteq 28 #f)
% (binary-weightorder 28 #f)
% (binary-weightorder-sos 17 #f)
% (binary-order 28 #f)
% (hyper-order 17 #f)
% (binary 141 #t)
% 
% 
% SOS clause 
% -neq(sk4,nil) | -ss^list(X) | equal(sk4,X) | -ss^list(Y) | -ss^list(Z) | -equal(tl(sk3),Y) | -equal(app(Y,Z),X) | -ss^item(U) | -equal(cons(U,nil),Z) | -equal(hd(sk3),U) | -neq(nil,sk3) | -neq(nil,sk3).
% was split for some strategies as: 
% -ss^list(X) | equal(sk4,X) | -equal(app(Y,Z),X) | -ss^list(Y) | -ss^list(Z) | -equal(tl(sk3),Y) | -equal(cons(U,nil),Z) | -ss^item(U) | -equal(hd(sk3),U).
% -neq(sk4,nil).
% -neq(nil,sk3).
% -neq(nil,sk3).
% 
% Starting a split proof attempt with 4 components.
% 
% Split component 1 started.
% 
% START OF PROOFPART
% Making new sos for split:
% Original clause to be split: 
% -neq(sk4,nil) | -ss^list(X) | equal(sk4,X) | -ss^list(Y) | -ss^list(Z) | -equal(tl(sk3),Y) | -equal(app(Y,Z),X) | -ss^item(U) | -equal(cons(U,nil),Z) | -equal(hd(sk3),U) | -neq(nil,sk3) | -neq(nil,sk3).
% Split part used next: -ss^list(X) | equal(sk4,X) | -equal(app(Y,Z),X) | -ss^list(Y) | -ss^list(Z) | -equal(tl(sk3),Y) | -equal(cons(U,nil),Z) | -ss^item(U) | -equal(hd(sk3),U).
% Wow, gandalf-wrapper got a signal XCPU
% END OF PROOFPARTXcpu signal caught by Gandalf: stopping
% 
%------------------------------------------------------------------------------