%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT032-2 : 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 : art05.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/MGT032-2+noeq.in
% Using automatic strategy selection.
% Time limit in seconds: 600
% 
% prove-all-passes started
% 
% detected problem class: hne
% detected subclass: small
% detected subclass: long
% 
% strategies selected: 
% (hyper 57 #f 2 9)
% (binary-unit 28 #f 2 9)
% (binary-double 28 #f 2 9)
% (binary-posweight-order 28 #f 2 9)
% (binary-unit 62 #f)
% (hyper 159 #f)
% (binary-posweight-order 154 #f)
% (binary-weightorder 28 #f)
% (binary-order 28 #f)
% (binary 28 #t)
% 
% 
% ********* EMPTY CLAUSE DERIVED *********
% 
% 
% timer checkpoints: c(8,40,0,16,0,0,26,50,0,34,0,0,47,50,0,55,0,0)
% 
% 
% START OF PROOF
% 48 [] -greater(growth_rate(X,Y),growth_rate(Z,Y)) | -subpopulations(Z,X,U,Y) | selection_favors(X,Z,Y) | -environment(U).
% 49 [] in_environment(X,sk1(X)) | -stable(X) | -environment(X).
% 50 [] greater(growth_rate(efficient_producers,X),growth_rate(first_movers,X)) | -greater_or_equal(X,sk1(Y)) | -subpopulations(first_movers,efficient_producers,Y,X) | -stable(Y) | -environment(Y).
% 51 [] environment(sk2).
% 52 [] stable(sk2).
% 53 [] subpopulations(first_movers,efficient_producers,sk2,sk3(X)) | -in_environment(sk2,X).
% 54 [] greater_or_equal(sk3(X),X) | -in_environment(sk2,X).
% 55 [] -selection_favors(efficient_producers,first_movers,sk3(X)) | -in_environment(sk2,X).
% 56 [hyper:49,51,cut:52] in_environment(sk2,sk1(sk2)).
% 60 [hyper:53,56] subpopulations(first_movers,efficient_producers,sk2,sk3(sk1(sk2))).
% 61 [hyper:54,56] greater_or_equal(sk3(sk1(sk2)),sk1(sk2)).
% 63 [hyper:50,61,cut:60,cut:52,cut:51] greater(growth_rate(efficient_producers,sk3(sk1(sk2))),growth_rate(first_movers,sk3(sk1(sk2)))).
% 66 [hyper:48,60,cut:63,cut:51] selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))).
% 67 [hyper:55,66,cut:56] 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 4
% seconds given: 57
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    28
%  derived clauses:   54
%  kept clauses:      9
%  kept size sum:     55
%  kept mid-nuclei:   11
%  kept new demods:   0
%  forw unit-subs:    10
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  12
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.0
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           9
%  length fails:    0
%  strength fails:  9
%  predlist fails:  0
%  aux str. fails:  0
%  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/MGT032-2+noeq.in")
% 
%------------------------------------------------------------------------------