%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT003-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/MGT003-1+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: medium
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 19)
% (binary-unit 28 #f 2 19)
% (binary-double 28 #f)
% (binary-posweight-order 28 #f 2 19)
% (binary 28 #t 2 19)
% (hyper 28 #t)
% (hyper 159 #f)
% (binary-posweight-order 85 #f)
% (binary-weightorder 39 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 47 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(12,40,0,24,0,0)
% 
% 
% START OF PROOF
% 13 [] -reorganization_free(X,Y,Z) | reorganization_free(X,Y,Y).
% 14 [] -reorganization_free(X,Y,Z) | reorganization_free(X,Z,Z).
% 15 [] inertia(X,sk1(Y,X),Y) | -organization(X,Y).
% 16 [] -survival_chance(X,Y,Z) | -survival_chance(U,V,W) | -inertia(X,X2,Z) | -inertia(U,X1,W) | -reorganization_free(X,Z,Z) | -reorganization_free(U,W,W) | -greater(X2,X1) | -organization(U,W) | -organization(X,Z) | greater(Y,V).
% 17 [] -inertia(X,U,V) | -inertia(X,Y,Z) | -reorganization_free(X,V,Z) | -greater(Z,V) | -organization(X,Z) | -organization(X,V) | greater(Y,U).
% 18 [] organization(sk2,sk5).
% 19 [] organization(sk2,sk6).
% 20 [] reorganization_free(sk2,sk5,sk6).
% 21 [] survival_chance(sk2,sk3,sk5).
% 22 [] survival_chance(sk2,sk4,sk6).
% 23 [] greater(sk6,sk5).
% 24 [] -greater(sk4,sk3).
% 29 [hyper:15,18] inertia(sk2,sk1(sk5,sk2),sk5).
% 34 [hyper:15,19] inertia(sk2,sk1(sk6,sk2),sk6).
% 38 [hyper:13,20] reorganization_free(sk2,sk5,sk5).
% 39 [hyper:14,20] reorganization_free(sk2,sk6,sk6).
% 100 [hyper:17,34,29,cut:19,cut:20,cut:23,cut:18] greater(sk1(sk6,sk2),sk1(sk5,sk2)).
% 131 [hyper:16,100,29,34,22,21,cut:38,cut:18,cut:39,cut:19,cut:24] 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 19
% clause depth limited to 2
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    14
%  derived clauses:   114
%  kept clauses:      5
%  kept size sum:     27
%  kept mid-nuclei:   99
%  kept new demods:   0
%  forw unit-subs:    7
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  76
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.1
% specific non-discr-tree subsumption statistics: 
%  tried:           43
%  length fails:    0
%  strength fails:  26
%  predlist fails:  9
%  aux str. fails:  8
%  by-lit fails:    0
%  full subs tried: 0
%  full subs fail:  0
% 
% ; 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/MGT003-1+noeq.in")
% 
%------------------------------------------------------------------------------