%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN591-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 : art02.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/SYN591-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(27,40,1,54,0,1)
% 
% 
% START OF PROOF
% 28 [] p11(c13,f4(f5(X),c17)) | p11(c13,f4(c17,f5(X))) | -p12(c14,f4(X,c17)).
% 29 [] p3(f4(X,Y),f4(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 30 [] -p11(X,Y) | -p3(Y,Z) | -p7(X,U) | p11(U,Z).
% 33 [] -p12(c14,f4(X,c17)) | p2(f6(X),f5(X)).
% 35 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 42 [] p12(c14,f4(c18,c17)).
% 48 [] p2(X,X).
% 49 [] p7(X,X).
% 53 [] -p11(c13,f4(c17,f6(c18))).
% 54 [] -p11(c13,f4(f6(c18),c17)).
% 82 [hyper:28,42] p11(c13,f4(c17,f5(c18))) | p11(c13,f4(f5(c18),c17)).
% 86 [hyper:33,42] p2(f6(c18),f5(c18)).
% 96 [hyper:35,86,48] p2(f5(c18),f6(c18)).
% 101 [hyper:29,96,48] p3(f4(f5(c18),X),f4(f6(c18),X)).
% 105 [hyper:29,96,48] p3(f4(X,f5(c18)),f4(X,f6(c18))).
% 269 [hyper:30,82,49,105,cut:53] p11(c13,f4(f5(c18),c17)).
% 279 [hyper:30,269,49,101,cut:54] 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:    43
%  derived clauses:   445
%  kept clauses:      20
%  kept size sum:     157
%  kept mid-nuclei:   187
%  kept new demods:   0
%  forw unit-subs:    171
%  forw double-subs: 2
%  forw overdouble-subs: 0
%  backward subs:     1
%  fast unit cutoff:  3
%  full unit cutoff:  2
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           6
%  length fails:    0
%  strength fails:  6
%  predlist fails:  0
%  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/SYN591-1+noeq.in")
% 
%------------------------------------------------------------------------------