%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN563-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 : art10.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/SYN563-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 3 7)
% (binary-unit 28 #f 3 7)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 3 7)
% (binary 28 #t 3 7)
% (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(17,40,0,34,0,0)
% 
% 
% START OF PROOF
% 19 [] -p6(X,Y) | -p2(Y,U) | -p2(X,Z) | p6(Z,U).
% 20 [] -p5(X,Y) | -p6(Z,X) | p5(Z,Y).
% 24 [] p2(f3(X),f3(Y)) | -p2(X,Y).
% 25 [] p6(f4(X),Y) | -p5(X,Y).
% 26 [] p6(c7,f3(X)) | -p6(c7,X).
% 28 [] p5(f3(f3(X)),f3(f4(X))).
% 30 [] p2(f4(c7),f4(c8)).
% 31 [] p6(X,X).
% 32 [] p2(X,X).
% 34 [] -p6(f4(c7),f3(f4(c8))).
% 36 [hyper:26,31] p6(c7,f3(c7)).
% 67 [hyper:26,36] p6(c7,f3(f3(c7))).
% 102 [hyper:24,30] p2(f3(f4(c7)),f3(f4(c8))).
% 484 [hyper:20,28,67] p5(c7,f3(f4(c7))).
% 494 [hyper:25,484] p6(f4(c7),f3(f4(c7))).
% 622 [hyper:19,102,32,494,cut:34] 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: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    54
%  derived clauses:   1323
%  kept clauses:      47
%  kept size sum:     256
%  kept mid-nuclei:   529
%  kept new demods:   0
%  forw unit-subs:    526
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           19
%  length fails:    0
%  strength fails:  4
%  predlist fails:  15
%  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/SYN563-1+noeq.in")
% 
%------------------------------------------------------------------------------