%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN585-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 : art07.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/SYN585-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 3 7)
% (binary-unit 10 #f 3 7)
% (binary-double 16 #f 3 7)
% (binary 54 #t 3 7)
% (binary-order 27 #f 3 7)
% (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(26,40,0,52,0,0)
% 
% 
% START OF PROOF
% 27 [] p11(f9(X,Y),f9(X,Z)) | p2(X,f3(c13)) | -p11(Y,Z).
% 37 [] -p11(Z,X) | -p11(X,Y) | p11(Z,Y).
% 40 [] p11(X,f8(Y,Z)) | -p11(X,Z).
% 44 [] p11(c18,f9(c12,c14)).
% 47 [] p11(X,X).
% 50 [] -p2(c12,f3(c13)).
% 52 [] -p11(c18,f9(c12,f8(c16,c14))).
% 54 [hyper:40,47] p11(X,f8(Y,X)).
% 78 [hyper:27,54] p11(f9(X,Y),f9(X,f8(Z,Y))) | p2(X,f3(c13)).
% 1387 [hyper:37,78,44,cut:50,slowcut:52] 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 3
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    66
%  derived clauses:   3393
%  kept clauses:      323
%  kept size sum:     4230
%  kept mid-nuclei:   995
%  kept new demods:   0
%  forw unit-subs:    1058
%  forw double-subs: 42
%  forw overdouble-subs: 6
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.4
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           88
%  length fails:    0
%  strength fails:  4
%  predlist fails:  72
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 12
%  full subs fail:  6
% 
% ; 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/SYN585-1+noeq.in")
% 
%------------------------------------------------------------------------------