%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN656-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/SYN656-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 7)
% (binary-unit 10 #f 6 7)
% (binary-double 16 #f 6 7)
% (binary 54 #t 6 7)
% (binary-order 27 #f 6 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(49,40,0,98,0,0)
% 
% 
% START OF PROOF
% 50 [] p25(f5(f7(c28,c29),f13(c31,f15(f17(c33,c34),X))),f13(c31,c34)) | p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X))).
% 53 [] -p25(f5(f7(c28,X),Y),Z) | p25(f5(f7(c28,X),U),Z) | -p25(f5(X,U),Y).
% 63 [] -p25(X,Y) | -p3(Y,Z) | -p4(X,U) | p25(U,Z).
% 65 [] p25(f5(f7(c28,X),Y),Z) | -p25(f5(X,Y),Z).
% 67 [] p25(f5(c29,f13(c31,f15(c32,X))),f13(c31,X)).
% 76 [] -p3(X,Z) | -p3(X,Y) | p3(Z,Y).
% 91 [] p3(X,X).
% 92 [] p4(X,X).
% 98 [] -p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),c35)))),f13(c31,c34)).
% 189 [hyper:53,67,50] p25(f5(f7(c28,c29),f13(c31,f15(c32,f15(f17(c33,c34),X)))),f13(c31,c34)) | p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),X))).
% 194 [hyper:65,67] p25(f5(f7(c28,c29),f13(c31,f15(c32,X))),f13(c31,X)).
% 671 [hyper:98,189] p3(f13(c31,c34),f13(c31,f15(f17(c33,c34),c35))).
% 824 [hyper:76,671,91] p3(f13(c31,f15(f17(c33,c34),c35)),f13(c31,c34)).
% 880 [hyper:63,824,92,194,cut:98] 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 6
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    68
%  derived clauses:   1491
%  kept clauses:      190
%  kept size sum:     7528
%  kept mid-nuclei:   554
%  kept new demods:   0
%  forw unit-subs:    177
%  forw double-subs: 214
%  forw overdouble-subs: 145
%  backward subs:     1
%  fast unit cutoff:  1
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.4
%  process. runtime:  0.4
% specific non-discr-tree subsumption statistics: 
%  tried:           791
%  length fails:    67
%  strength fails:  30
%  predlist fails:  177
%  aux str. fails:  11
%  by-lit fails:    12
%  full subs tried: 481
%  full subs fail:  336
% 
% ; 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/SYN656-1+noeq.in")
% 
%------------------------------------------------------------------------------