%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : SYN642-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 : art07.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/SYN642-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 4 11)
% (binary-unit 10 #f 4 11)
% (binary-double 16 #f 4 11)
% (binary 54 #t 4 11)
% (binary-order 27 #f 4 11)
% (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(42,40,1,84,0,1)
% 
% 
% START OF PROOF
% 49 [] p6(f8(f10(X,Y)),f9(f8(X),f8(Y))) | -p15(X) | -p15(Y).
% 52 [] p6(f9(X,Y),f9(Z,U)) | -p6(Y,U) | -p6(X,Z).
% 61 [] -p6(X,Z) | -p6(X,Y) | p6(Z,Y).
% 70 [] p6(f8(f3(c18)),f8(c18)).
% 75 [] p6(f8(f3(c19)),f8(c19)).
% 80 [] p6(X,X).
% 82 [] p15(f3(c18)).
% 83 [] p15(f3(c19)).
% 84 [] -p6(f8(f10(f3(c19),f3(c18))),f9(f8(c19),f8(c18))).
% 140 [hyper:49,83,82] p6(f8(f10(f3(c19),f3(c18))),f9(f8(f3(c19)),f8(f3(c18)))).
% 207 [hyper:52,75,70] p6(f9(f8(f3(c19)),f8(f3(c18))),f9(f8(c19),f8(c18))).
% 1104 [hyper:61,140,80] p6(f9(f8(f3(c19)),f8(f3(c18))),f8(f10(f3(c19),f3(c18)))).
% 1936 [hyper:61,1104,207,cut:84] 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 11
% clause depth limited to 4
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    280
%  derived clauses:   8617
%  kept clauses:      369
%  kept size sum:     6022
%  kept mid-nuclei:   1431
%  kept new demods:   0
%  forw unit-subs:    3610
%  forw double-subs: 127
%  forw overdouble-subs: 271
%  backward subs:     20
%  fast unit cutoff:  145
%  full unit cutoff:  8
%  dbl  unit cutoff:  0
%  real runtime:  0.11
%  process. runtime:  0.10
% specific non-discr-tree subsumption statistics: 
%  tried:           2486
%  length fails:    0
%  strength fails:  3
%  predlist fails:  1634
%  aux str. fails:  4
%  by-lit fails:    86
%  full subs tried: 759
%  full subs fail:  488
% 
% ; 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/SYN642-1+noeq.in")
% 
%------------------------------------------------------------------------------