%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT013-1 : TPTP v3.4.2. Released v2.4.0.
% Transfm  : add_equality:r
% Format   : otter:hypothesis:set(auto),clear(print_given)
% Command  : gandalf-wrapper -time %d %s

% Computer : art09.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/MGT/MGT013-1+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: neq
% detected subclass: medium
% 
% strategies selected: 
% (hyper 25 #f 1 13)
% (binary-unit 9 #f 1 13)
% (binary-double 9 #f 1 13)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 1 13)
% (binary-order 25 #f 1 13)
% (binary-posweight-order 101 #f)
% (binary-posweight-lex-big-order 25 #f)
% (binary-posweight-lex-small-order 9 #f)
% (binary-order-sos 50 #t)
% (binary-unit-uniteq 25 #f)
% (binary-weightorder 50 #f)
% (binary-order 50 #f)
% (hyper-order 30 #f)
% (binary 112 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(18,40,0,36,0,0)
% 
% 
% START OF PROOF
% 20 [] -greater(X,Y) | -equal(X,Y).
% 22 [] -organization(X,Y) | time(Y).
% 23 [] greater(X,Y) | greater(Y,X) | equal(Y,X) | -time(Y) | -time(X).
% 24 [] -reorganization_free(X,Y,Z) | reorganization_free(X,Z,Y).
% 25 [] -complexity(X,Y,Z) | -complexity(X,U,V) | -organization(X,Z) | -organization(X,V) | -equal(V,Z) | equal(U,Y).
% 26 [] -size(X,U,V) | -size(X,Y,Z) | -reorganization_free(X,V,Z) | -organization(X,Z) | -organization(X,V) | -greater(Z,V) | -greater(U,Y).
% 27 [] -complexity(X,U,V) | -complexity(X,Y,Z) | -reorganization_free(X,V,Z) | -organization(X,Z) | -organization(X,V) | -greater(Z,V) | -greater(U,Y).
% 28 [] organization(sk1,sk6).
% 29 [] organization(sk1,sk7).
% 30 [] reorganization_free(sk1,sk6,sk7).
% 31 [] complexity(sk1,sk2,sk6).
% 32 [] complexity(sk1,sk3,sk7).
% 33 [] size(sk1,sk4,sk6).
% 34 [] size(sk1,sk5,sk7).
% 35 [] greater(sk3,sk2).
% 36 [] greater(sk4,sk5).
% 43 [hyper:22,28] time(sk6).
% 52 [hyper:22,29] time(sk7).
% 56 [hyper:23,52,43] greater(sk7,sk6) | greater(sk6,sk7) | equal(sk7,sk6).
% 80 [hyper:24,30] reorganization_free(sk1,sk7,sk6).
% 164 [hyper:26,56,30,34,33,cut:28,cut:29,cut:36] greater(sk6,sk7) | equal(sk7,sk6).
% 215 [hyper:27,164,80,35,cut:29,cut:28,cut:32,cut:31] equal(sk7,sk6).
% 230 [hyper:25,215,31,32,cut:29,cut:28] equal(sk3,sk2).
% 235 [hyper:20,230,cut:35] 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 13
% clause depth limited to 1
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    23
%  derived clauses:   260
%  kept clauses:      14
%  kept size sum:     71
%  kept mid-nuclei:   176
%  kept new demods:   2
%  forw unit-subs:    32
%  forw double-subs: 17
%  forw overdouble-subs: 0
%  backward subs:     2
%  fast unit cutoff:  95
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           144
%  length fails:    1
%  strength fails:  95
%  predlist fails:  30
%  aux str. fails:  0
%  by-lit fails:    10
%  full subs tried: 4
%  full subs fail:  4
% 
% ; 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/MGT/MGT013-1+eq_r.in")
% 
%------------------------------------------------------------------------------