%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN554-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/SYN554-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: nne
% detected subclass: small
% 
% strategies selected: 
% (hyper 27 #f 2 7)
% (binary-unit 10 #f 2 7)
% (binary-double 16 #f)
% (binary 16 #t 2 7)
% (binary-posweight-order 181 #f)
% (binary-order-sos 54 #t)
% (binary-unit-uniteq 54 #f)
% (binary-order 27 #f 2 7)
% (binary-weightorder 71 #f)
% (binary-order 27 #f)
% (hyper-order 54 #f)
% (binary 63 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(9,40,0,18,0,0)
% 
% 
% START OF PROOF
% 11 [] -p4(X,Y) | -p2(X,U) | -p2(Y,Z) | p4(U,Z).
% 12 [] p4(f3(c5,X),f3(c5,Y)) | -p4(X,Y).
% 13 [] -p2(X,Z) | -p2(X,Y) | p2(Y,Z).
% 14 [] p4(Y,X) | p4(X,Y) | p2(Y,X).
% 15 [] p2(f3(c5,c6),f3(c5,c7)).
% 16 [] p2(X,X).
% 17 [] -p4(X,X).
% 18 [] -p2(c6,c7).
% 28 [hyper:13,15,16] p2(f3(c5,c7),f3(c5,c6)).
% 43 [hyper:18,14] p4(c7,c6) | p4(c6,c7).
% 163 [hyper:12,43] p4(f3(c5,c7),f3(c5,c6)) | p4(c6,c7).
% 177 [hyper:11,163,14,28,factor:cut:17] p4(c6,c7).
% 221 [hyper:12,177] p4(f3(c5,c6),f3(c5,c7)).
% 236 [hyper:11,221,14,15,factor:cut:17] 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 2
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    14
%  derived clauses:   498
%  kept clauses:      58
%  kept size sum:     873
%  kept mid-nuclei:   117
%  kept new demods:   0
%  forw unit-subs:    139
%  forw double-subs: 11
%  forw overdouble-subs: 98
%  backward subs:     2
%  fast unit cutoff:  51
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.2
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           1537
%  length fails:    2
%  strength fails:  460
%  predlist fails:  247
%  aux str. fails:  38
%  by-lit fails:    19
%  full subs tried: 749
%  full subs fail:  626
% 
% ; 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/SYN554-1+noeq.in")
% 
%------------------------------------------------------------------------------