%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN553-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/SYN553-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: short
% 
% strategies selected: 
% (hyper 29 #f 4 5)
% (binary-unit 11 #f 4 5)
% (binary-double 17 #f 4 5)
% (hyper 29 #f)
% (binary-unit 34 #f)
% (binary-weightorder 40 #f)
% (binary 17 #t)
% (binary-order 29 #f)
% (binary-posweight-order 111 #f 4 5)
% (binary-posweight-order 283 #f)
% 
% 
% **** EMPTY CLAUSE DERIVED ****
% 
% 
% timer checkpoints: c(9,40,0,18,0,0)
% 
% 
% START OF PROOF
% 10 [] p2(f8(X,Y),f8(Z,U)) | -p2(X,Z) | -p2(Y,U).
% 11 [] p2(f8(X,f8(Y,Z)),f8(f8(X,Y),Z)).
% 12 [] -p2(Z,X) | -p2(X,Y) | p2(Z,Y).
% 13 [] p2(f8(X,Y),f8(Y,X)).
% 15 [] p2(X,X).
% 18 [] -p2(f8(f8(f9(c4),c4),f9(c3)),f8(f9(c4),f8(f9(c3),c4))).
% 29 [hyper:10,13,15] p2(f8(f8(X,Y),Z),f8(f8(Y,X),Z)).
% 166 [hyper:12,11,13] p2(f8(X,f8(Y,Z)),f8(Z,f8(X,Y))).
% 200 [hyper:12,29,13] p2(f8(f8(X,Y),Z),f8(Z,f8(Y,X))).
% 397 [hyper:12,200,166,slowcut:18] 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 5
% clause depth limited to 4
% seconds given: 29
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    20
%  derived clauses:   787
%  kept clauses:      264
%  kept size sum:     4444
%  kept mid-nuclei:   111
%  kept new demods:   0
%  forw unit-subs:    405
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  0
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           0
%  length fails:    0
%  strength fails:  0
%  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/SYN553-1+noeq.in")
% 
%------------------------------------------------------------------------------