%------------------------------------------------------------------------------
% File     : Gandalf---c-2.6
% Problem  : MGT048-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 : art07.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/MGT048-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 7)
% (binary-unit 9 #f 2 7)
% (binary-double 9 #f 2 7)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 7)
% (binary-order 25 #f 2 7)
% (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(20,40,1,40,0,1)
% 
% 
% START OF PROOF
% 24 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 34 [] -greater(internal_friction(X,Y),internal_friction(X,Z)) | -smaller_or_equal(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | smaller(capability(X,Y),capability(X,Z)) | -organization(X).
% 36 [] equal(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -organization(X).
% 37 [] -greater(age(X,Y),age(X,Z)) | greater(internal_friction(X,Y),internal_friction(X,Z)) | -organization(X).
% 38 [] organization(sk1).
% 39 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 40 [] -smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 44 [hyper:36,38] equal(stock_of_knowledge(sk1,X),stock_of_knowledge(sk1,Y)).
% 57 [hyper:37,39,cut:38] greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 62 [hyper:24,44] smaller_or_equal(stock_of_knowledge(sk1,X),stock_of_knowledge(sk1,Y)).
% 78 [hyper:34,57,cut:62,cut:38] smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 83 [hyper:40,78] 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 7
% clause depth limited to 2
% seconds given: 25
% 
% 
% ***GANDALF_FOUND_A_REFUTATION***
% 
% Global statistics over all passes: 
% 
%  given clauses:    25
%  derived clauses:   90
%  kept clauses:      13
%  kept size sum:     83
%  kept mid-nuclei:   20
%  kept new demods:   0
%  forw unit-subs:    47
%  forw double-subs: 0
%  forw overdouble-subs: 0
%  backward subs:     0
%  fast unit cutoff:  4
%  full unit cutoff:  0
%  dbl  unit cutoff:  0
%  real runtime  :  0.1
%  process. runtime:  0.0
% specific non-discr-tree subsumption statistics: 
%  tried:           3
%  length fails:    0
%  strength fails:  3
%  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/MGT048-1+eq_r.in")
% 
%------------------------------------------------------------------------------