%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN657-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/SYN657-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 7 7)
% (binary-unit 10 #f 7 7)
% (binary-double 16 #f 7 7)
% (binary 54 #t 7 7)
% (binary-order 27 #f 7 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(50,40,1,100,0,1)
% 
% 
% START OF PROOF
% 52 [] -p24(f19(f20(X,Y)),f19(f20(X,f22(Z,X,Y)))) | p4(f5(Z,c36,X),f5(Z,c36,Y)) | p6(f21(Z),f10(c33)).
% 53 [] p4(f5(X,c36,Y),f5(X,c36,Z)) | p25(f22(X,Y,Z),f18(X)) | p6(f21(X),f10(c33)).
% 56 [] -p25(X,f18(f8(c27,f9(c28,c29)))) | p24(f19(f20(c31,c34)),f19(f20(c31,X))).
% 74 [] -p6(X,Z) | -p6(X,Y) | p6(Z,Y).
% 84 [] p6(f21(f8(X,f9(Y,Z))),Y).
% 98 [] -p6(c28,f10(c33)).
% 100 [] -p4(f5(f8(c27,f9(c28,c29)),c36,c31),f5(f8(c27,f9(c28,c29)),c36,c34)).
% 229 [hyper:100,53] p25(f22(f8(c27,f9(c28,c29)),c31,c34),f18(f8(c27,f9(c28,c29)))) | p6(f21(f8(c27,f9(c28,c29))),f10(c33)).
% 322 [hyper:56,229] p24(f19(f20(c31,c34)),f19(f20(c31,f22(f8(c27,f9(c28,c29)),c31,c34)))) | p6(f21(f8(c27,f9(c28,c29))),f10(c33)).
% 475 [hyper:52,322,cut:100] p6(f21(f8(c27,f9(c28,c29))),f10(c33)).
% 524 [hyper:74,475,84,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 7
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    45
%  derived clauses:   637
%  kept clauses:      179
%  kept size sum:     4170
%  kept mid-nuclei:   221
%  kept new demods:   0
%  forw unit-subs:    151
%  forw double-subs: 8
%  forw overdouble-subs: 30
%  backward subs:     2
%  fast unit cutoff:  6
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           228
%  length fails:    3
%  strength fails:  36
%  predlist fails:  97
%  aux str. fails:  2
%  by-lit fails:    5
%  full subs tried: 76
%  full subs fail:  42
% 
% ; 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/SYN657-1+noeq.in")
% 
%------------------------------------------------------------------------------