%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN613-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 : art05.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/SYN613-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 5 9)
% (binary-unit 10 #f 5 9)
% (binary-double 16 #f 5 9)
% (binary 54 #t 5 9)
% (binary-order 27 #f 5 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(31,40,2,62,0,2)
% 
% 
% START OF PROOF
% 34 [] -p17(X,Y,Z) | p17(U,V,W) | -p16(X,U) | -p3(Y,V) | -p11(Z,W).
% 41 [] p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c24).
% 47 [] -p11(X,Y) | -p11(X,Z) | p11(Y,Z).
% 54 [] p11(c24,f12(f9(c21))).
% 55 [] p11(c23,f12(f9(c21))).
% 56 [] p16(X,X).
% 58 [] p3(X,X).
% 61 [] p11(X,X).
% 62 [] -p17(c19,f4(f7(f10(c20),f8(f9(c21),c22))),c23).
% 96 [hyper:47,54,61] p11(f12(f9(c21)),c24).
% 113 [hyper:47,55,61] p11(f12(f9(c21)),c23).
% 150 [hyper:47,113,96] p11(c24,c23).
% 1744 [hyper:34,41,58,56,150,cut:62] 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 5
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    60
%  derived clauses:   3229
%  kept clauses:      1303
%  kept size sum:     17059
%  kept mid-nuclei:   360
%  kept new demods:   0
%  forw unit-subs:    1534
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.3
%  process. runtime:  0.3
% specific non-discr-tree subsumption statistics: 
%  tried:           104
%  length fails:    0
%  strength fails:  11
%  predlist fails:  93
%  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/SYN613-1+noeq.in")
% 
%------------------------------------------------------------------------------