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

% Computer : art02.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.0s
% 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/SYN/SYN615-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 9 7)
% (binary-unit 28 #f 9 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 9 7)
% (binary 28 #t 9 7)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% SOS clause 
% -p19(X,f3(f4(f5(c22)))) | -p20(Y,f6(f3(f4(f5(c22))),c21)) | -p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))).
% was split for some strategies as: 
% -p19(X,f3(f4(f5(c22)))) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))) | -p20(Y,f6(f3(f4(f5(c22))),c21)).
% -p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)).
% 
% 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: 
% -p19(X,f3(f4(f5(c22)))) | -p20(Y,f6(f3(f4(f5(c22))),c21)) | -p2(f14(f16(c28,f17(c21,c27)),c25),f3(c22)) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))).
% Split part used next: -p19(X,f3(f4(f5(c22)))) | -p7(c25,f8(f10(f12(f11(f3(f5(c22)))),X),f8(f10(f11(f3(f4(f5(c22)))),f14(f16(c28,f17(c21,c27)),c25)),f9(f11(Y),f10(f11(f3(f4(f5(c22)))),c27))))) | -p20(Y,f6(f3(f4(f5(c22))),c21)).
% Wow, gandalf-wrapper got a signal XCPU
% END OF PROOFPARTXcpu signal caught by Gandalf: stopping
% 
%------------------------------------------------------------------------------