%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN666-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 : art03.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/SYN666-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 6 9)
% (binary-unit 10 #f 6 9)
% (binary-double 16 #f 6 9)
% (binary 54 #t 6 9)
% (binary-order 27 #f 6 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(54,40,1,108,0,1)
% 
% 
% START OF PROOF
% 59 [] p2(f11(f4(X),c34),f11(f4(c32),c34)) | -p25(X,c36) | -p25(c32,X).
% 70 [] p2(f11(f4(c32),c34),f18(f11(f4(c33),c34),f9(f17(c31)))).
% 78 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 93 [] p25(c32,c33).
% 95 [] p25(c33,c36).
% 100 [] p2(X,X).
% 107 [] -p2(X,f18(X,f9(f17(c31)))).
% 143 [hyper:59,93,cut:95] p2(f11(f4(c33),c34),f11(f4(c32),c34)).
% 735 [hyper:78,143,100] p2(f11(f4(c32),c34),f11(f4(c33),c34)).
% 2635 [hyper:78,70,735,cut:107] 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 6
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    90
%  derived clauses:   4820
%  kept clauses:      1810
%  kept size sum:     34575
%  kept mid-nuclei:   689
%  kept new demods:   0
%  forw unit-subs:    2273
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  2
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.7
%  process. runtime:  0.7
% specific non-discr-tree subsumption statistics: 
%  tried:           84
%  length fails:    0
%  strength fails:  9
%  predlist fails:  75
%  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/SYN666-1+noeq.in")
% 
%------------------------------------------------------------------------------