%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN590-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 : 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   : 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/SYN590-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 3 7)
% (binary-unit 28 #f 3 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 3 7)
% (binary 28 #t 3 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)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(27,40,0,54,0,0,443,50,1,470,0,1)
% 
% 
% START OF PROOF
% 445 [] -p10(X,Y) | -p3(Y,U) | -p3(X,Z) | p10(Z,U).
% 451 [] p10(f4(f9(X)),f4(X)) | -p11(X).
% 452 [] p3(f4(X),f6(f8(X))) | -p11(X).
% 459 [] -p10(f6(X),f6(Y)) | p12(X,Y).
% 461 [] p11(f9(X)) | -p11(X).
% 462 [] p3(f4(c16),f6(c15)).
% 467 [] p11(c16).
% 470 [] -p3(f4(X),f6(Y)) | -p12(Y,c15) | -p11(X).
% 473 [hyper:451,467] p10(f4(f9(c16)),f4(c16)).
% 476 [hyper:461,467] p11(f9(c16)).
% 500 [hyper:452,476] p3(f4(f9(c16)),f6(f8(f9(c16)))).
% 904 [hyper:445,500,462,cut:473] p10(f6(f8(f9(c16))),f6(c15)).
% 930 [hyper:459,904] p12(f8(f9(c16)),c15).
% 935 [hyper:470,930,500,cut:476] 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 7
% clause depth limited to 4
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    143
%  derived clauses:   1555
%  kept clauses:      103
%  kept size sum:     613
%  kept mid-nuclei:   714
%  kept new demods:   0
%  forw unit-subs:    595
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  25
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.4
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           60
%  length fails:    0
%  strength fails:  4
%  predlist fails:  56
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/SYN590-1+noeq.in")
% 
%------------------------------------------------------------------------------