%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT059-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 : art06.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/MGT059-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 2 9)
% (binary-unit 9 #f 2 9)
% (binary-double 9 #f 2 9)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 9)
% (binary-order 25 #f 2 9)
% (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(21,40,0,42,0,0)
% 
% 
% START OF PROOF
% 29 [] -smaller(X,Y) | greater(Y,X).
% 30 [] -greater(X,Y) | smaller(Y,X).
% 31 [] -greater(X,Y) | -greater(Y,X).
% 33 [] greater(X,Y) | smaller(X,Y) | equal(X,Y).
% 34 [] equal(hazard_of_mortality(X,Y),very_low) | -has_immunity(X,Y) | -organization(X).
% 39 [] organization(sk1).
% 40 [] has_immunity(sk1,sk2).
% 41 [] has_immunity(sk1,sk3).
% 42 [] -equal(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)).
% 50 [hyper:34,40,cut:39] equal(hazard_of_mortality(sk1,sk2),very_low).
% 51 [hyper:34,41,cut:39] equal(hazard_of_mortality(sk1,sk3),very_low).
% 64 [hyper:42,33,demod:51,50,binarycut:30] smaller(very_low,very_low).
% 76 [hyper:29,64] greater(very_low,very_low).
% 77 [hyper:31,76,cut:76] 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 9
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    22
%  derived clauses:   75
%  kept clauses:      12
%  kept size sum:     81
%  kept mid-nuclei:   8
%  kept new demods:   2
%  forw unit-subs:    28
%  forw double-subs: 10
%  forw overdouble-subs: 5
%  backward subs:     0
%  fast unit cutoff:  3
%  full unit cutoff:  0
%  dbl  unit cutoff:  3
%  real runtime  :  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           11
%  length fails:    0
%  strength fails:  6
%  predlist fails:  0
%  aux str. fails:  0
%  by-lit fails:    0
%  full subs tried: 5
%  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/MGT059-1+eq_r.in")
% 
%------------------------------------------------------------------------------