%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MSC008-2.002 : TPTP v3.4.2. Released v1.0.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/MSC/MSC008-2.002+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 1 11)
% (binary-unit 10 #f 1 11)
% (binary-double 16 #f 1 11)
% (binary 54 #t 1 11)
% (binary-order 27 #f 1 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(16,40,0,32,0,0)
% 
% 
% START OF PROOF
% 17 [] -eq(p1,p2).
% 20 [] -latin(X,Y,U) | -latin(X,Y,Z) | eq(U,Z).
% 23 [] -greek(X,Y,Z) | -greek(X,Y,U) | eq(Z,U).
% 27 [] latin(X,p1,Y) | latin(X,p2,Y).
% 28 [] latin(p1,X,Y) | latin(p2,X,Y).
% 30 [] greek(X,p1,Y) | greek(X,p2,Y).
% 31 [] greek(p1,X,Y) | greek(p2,X,Y).
% 32 [] -greek(U,V,Z) | -greek(X,Y,Z) | -latin(U,V,W) | -latin(X,Y,W) | eq(V,Y) | eq(U,X).
% 1440 [hyper:32,31,28,30,27,factor:cut:17] greek(p2,p1,X) | latin(p2,p1,Y).
% 2749 [hyper:20,1440,1440,slowcut:17,factor] greek(p2,p1,X).
% 2812 [hyper:23,2749,cut:2749,slowcut: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 11
% clause depth limited to 1
% seconds given: 27
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    13
%  derived clauses:   5862
%  kept clauses:      1139
%  kept size sum:     21208
%  kept mid-nuclei:   1420
%  kept new demods:   0
%  forw unit-subs:    1307
%  forw double-subs: 162
%  forw overdouble-subs: 1752
%  backward subs:     1
%  fast unit cutoff:  826
%  full unit cutoff:  2
%  dbl  unit cutoff:  0
%  real runtime  :  0.23
%  process. runtime:  0.22
% specific non-discr-tree subsumption statistics: 
%  tried:           27029
%  length fails:    836
%  strength fails:  5779
%  predlist fails:  1831
%  aux str. fails:  456
%  by-lit fails:    454
%  full subs tried: 17277
%  full subs fail:  15374
% 
% ; 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/MSC/MSC008-2.002+noeq.in")
% 
%------------------------------------------------------------------------------