%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN564-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 : art01.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/SYN564-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 4 7)
% (binary-unit 28 #f 4 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 4 7)
% (binary 28 #t 4 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(18,40,0,36,0,0)
% 
% 
% START OF PROOF
% 20 [] p2(f9(X,Y),f9(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 23 [] -p10(X,Y) | -p2(Y,U) | -p2(X,Z) | p10(Z,U).
% 24 [] -p10(X,f3(Y,Z)) | p10(f9(X,Z),Y).
% 26 [] p10(f5(X),f3(f5(f6(X,Y)),f5(Y))).
% 27 [] -p4(X,Z) | -p4(X,Y) | p4(Z,Y).
% 30 [] p2(f5(X),f5(Y)) | -p4(X,Y).
% 32 [] p4(f8(X,Y),f6(X,f7(Y))).
% 33 [] p2(f5(f7(X)),f5(X)).
% 34 [] p4(X,X).
% 35 [] p2(X,X).
% 36 [] -p10(f9(f5(c11),f5(c12)),f5(f8(c11,c12))).
% 53 [hyper:20,33,35] p2(f9(X,f5(f7(Y))),f9(X,f5(Y))).
% 124 [hyper:27,32,34] p4(f6(X,f7(Y)),f8(X,Y)).
% 186 [hyper:30,124] p2(f5(f6(X,f7(Y))),f5(f8(X,Y))).
% 293 [hyper:24,26] p10(f9(f5(X),f5(Y)),f5(f6(X,Y))).
% 519 [hyper:23,293,186,53,slowcut:36] 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:    50
%  derived clauses:   1505
%  kept clauses:      167
%  kept size sum:     2378
%  kept mid-nuclei:   303
%  kept new demods:   0
%  forw unit-subs:    579
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.3
%  process. runtime:  0.2
% specific non-discr-tree subsumption statistics: 
%  tried:           28
%  length fails:    0
%  strength fails:  2
%  predlist fails:  26
%  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/SYN564-1+noeq.in")
% 
%------------------------------------------------------------------------------