%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN560-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/SYN560-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 5 7)
% (binary-unit 10 #f 5 7)
% (binary-double 16 #f 5 7)
% (binary 54 #t 5 7)
% (binary-order 27 #f 5 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(15,40,0,30,0,0)
% 
% 
% START OF PROOF
% 16 [] p8(f6(X,Y),f6(X,f5(Y,f3(f7(c10))))) | p2(X,f3(c10)).
% 17 [] p2(f6(X,Y),f6(Z,U)) | -p2(Y,U) | -p2(X,Z).
% 19 [] -p8(X,Y) | -p2(X,U) | -p2(Y,Z) | p8(U,Z).
% 20 [] p8(f6(c9,f4(c12)),f6(c9,f4(f5(c12,c14)))).
% 21 [] -p8(Z,X) | -p8(X,Y) | p8(Z,Y).
% 22 [] -p2(X,Z) | -p2(X,Y) | p2(Z,Y).
% 26 [] p2(f4(X),f5(X,f3(f7(c10)))).
% 28 [] p2(X,X).
% 29 [] -p2(c9,f3(c10)).
% 30 [] -p8(f6(c9,f4(c12)),f6(c9,f4(f4(f5(c12,c14))))).
% 101 [hyper:22,26,28] p2(f5(X,f3(f7(c10))),f4(X)).
% 109 [hyper:17,101,28] p2(f6(X,f5(Y,f3(f7(c10)))),f6(X,f4(Y))).
% 173 [hyper:29,16] p8(f6(c9,X),f6(c9,f5(X,f3(f7(c10))))).
% 3539 [hyper:19,109,173,28] p8(f6(c9,X),f6(c9,f4(X))).
% 3587 [hyper:21,3539,20,cut:30] 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 5
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    83
%  derived clauses:   10107
%  kept clauses:      2621
%  kept size sum:     54407
%  kept mid-nuclei:   926
%  kept new demods:   0
%  forw unit-subs:    3307
%  forw double-subs: 307
%  forw overdouble-subs: 11
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime:  0.14
%  process. runtime:  0.12
% specific non-discr-tree subsumption statistics: 
%  tried:           148
%  length fails:    0
%  strength fails:  2
%  predlist fails:  130
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 16
%  full subs fail:  5
% 
% ; 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/SYN560-1+noeq.in")
% 
%------------------------------------------------------------------------------