%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN558-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 : art01.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/SYN558-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 9)
% (binary-unit 28 #f 2 9)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 9)
% (binary 28 #t 2 9)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(14,40,1,28,0,1)
% 
% 
% START OF PROOF
% 15 [] -p5(X,Y,Z) | p5(U,V,W) | -p4(X,U) | -p2(Z,W) | -p2(Y,V).
% 16 [] -p5(c7,X,Y) | -p5(c7,X,Z) | -p6(c7,Z) | -p6(c7,Y) | p2(Z,Y).
% 18 [] -p5(X,Y,Z) | -p5(X,Z,U) | p5(X,Y,U).
% 22 [] p5(c7,X,f3(X)).
% 23 [] p5(c7,c10,c8).
% 24 [] p5(c7,c10,c9).
% 25 [] p6(c7,f3(X)).
% 26 [] p4(X,X).
% 27 [] p2(X,X).
% 28 [] -p5(c7,c8,X) | -p5(c7,c9,X).
% 80 [hyper:18,22,23] p5(c7,c10,f3(c8)).
% 81 [hyper:18,22,24] p5(c7,c10,f3(c9)).
% 98 [hyper:16,80,22,cut:25,cut:25] p2(f3(c8),f3(c10)).
% 123 [hyper:15,98,26,22,27] p5(c7,c8,f3(c10)).
% 149 [hyper:16,81,22,cut:25,cut:25] p2(f3(c9),f3(c10)).
% 303 [hyper:15,149,26,22,27] p5(c7,c9,f3(c10)).
% 362 [hyper:28,123,cut:303] 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 2
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    17
%  derived clauses:   500
%  kept clauses:      12
%  kept size sum:     60
%  kept mid-nuclei:   319
%  kept new demods:   0
%  forw unit-subs:    129
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  13
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           61
%  length fails:    0
%  strength fails:  9
%  predlist fails:  50
%  aux str. fails:  2
%  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/SYN558-1+noeq.in")
% 
%------------------------------------------------------------------------------