%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN580-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 : art08.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   : Unsatisfiable 0.0s
% Output   : Assurance 0.0s
% 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/SYN580-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 9)
% (binary-unit 10 #f 2 9)
% (binary-double 16 #f 2 9)
% (binary 54 #t 2 9)
% (binary-order 27 #f 2 9)
% (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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(23,40,0,46,0,0)
% 
% 
% START OF PROOF
% 24 [] -p8(X,Y,Z) | p8(U,V,W) | -p2(Z,W) | -p4(Y,V) | -p7(X,U).
% 25 [] -p8(c12,f6(X),X) | p8(c12,Y,f3(X)) | -p9(c12,Y).
% 29 [] p8(c12,X,f3(Y)) | p9(c12,f6(Y)) | -p9(c12,X).
% 31 [] p8(c12,X,Y) | -p9(c12,X) | -p11(Y,c16).
% 32 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 39 [] p2(c14,f3(c15)).
% 40 [] p9(c12,c13).
% 41 [] p11(c15,c16).
% 42 [] p2(X,X).
% 43 [] p4(X,X).
% 44 [] p7(X,X).
% 46 [] -p8(c12,c13,c14).
% 63 [hyper:29,40] p8(c12,c13,f3(X)) | p9(c12,f6(X)).
% 74 [hyper:32,39,42] p2(f3(c15),c14).
% 185 [hyper:24,63,43,44,74,cut:46] p9(c12,f6(c15)).
% 213 [hyper:31,185,41] p8(c12,f6(c15),c15).
% 223 [hyper:25,213,40] p8(c12,c13,f3(c15)).
% 244 [hyper:24,223,43,44,74,cut:46] contradiction
% END OF PROOF
% 
% Proof found by the following strategy:
% 
% using hyperresolution
% not using sos strategy
% using positive unit paramodulation strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% clause length limited to 9
% clause depth limited to 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    28
%  derived clauses:   287
%  kept clauses:      27
%  kept size sum:     244
%  kept mid-nuclei:   157
%  kept new demods:   0
%  forw unit-subs:    44
%  forw double-subs: 14
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           49
%  length fails:    2
%  strength fails:  8
%  predlist fails:  37
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 2
%  full subs fail:  2
% 
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/SYN/SYN580-1+noeq.in")
% 
%------------------------------------------------------------------------------