%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT046-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/MGT046-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 11)
% (binary-unit 9 #f 2 11)
% (binary-double 9 #f 2 11)
% (binary-double 15 #f)
% (binary-double 15 #t)
% (binary 50 #t 2 11)
% (binary-order 25 #f 2 11)
% (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(28,40,1,56,0,1)
%
%
% START OF PROOF
% 32 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 34 [] -greater(X,Y) | greater_or_equal(X,Y).
% 41 [] -has_immunity(X,Y) | -organization(X) | has_endowment(X).
% 43 [] -greater(position(X,Y),position(X,Z)) | -greater_or_equal(capability(X,Y),capability(X,Z)) | smaller(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 45 [] -greater(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -smaller_or_equal(internal_friction(X,Y),internal_friction(X,Z)) | greater(capability(X,Y),capability(X,Z)) | -organization(X).
% 48 [] -greater(external_ties(X,Y),external_ties(X,Z)) | greater(position(X,Y),position(X,Z)) | -organization(X).
% 50 [] -greater(age(X,Y),age(X,Z)) | greater(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -organization(X).
% 51 [] -greater(age(X,Y),age(X,Z)) | greater(external_ties(X,Y),external_ties(X,Z)) | -organization(X).
% 52 [] equal(internal_friction(X,Y),internal_friction(X,Z)) | -organization(X).
% 53 [] organization(sk1).
% 54 [] -has_endowment(sk1).
% 55 [] greater(age(sk1,sk3),age(sk1,sk2)).
% 56 [] -smaller(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 68 [hyper:52,53] equal(internal_friction(sk1,X),internal_friction(sk1,Y)).
% 81 [hyper:50,55,cut:53] greater(stock_of_knowledge(sk1,sk3),stock_of_knowledge(sk1,sk2)).
% 82 [hyper:51,55,cut:53] greater(external_ties(sk1,sk3),external_ties(sk1,sk2)).
% 87 [hyper:32,68] smaller_or_equal(internal_friction(sk1,X),internal_friction(sk1,Y)).
% 105 [hyper:45,81,cut:87,cut:53] greater(capability(sk1,sk3),capability(sk1,sk2)).
% 114 [hyper:48,82,cut:53] greater(position(sk1,sk3),position(sk1,sk2)).
% 119 [hyper:34,105] greater_or_equal(capability(sk1,sk3),capability(sk1,sk2)).
% 510 [hyper:43,114,cut:119,cut:53,cut:56] has_immunity(sk1,sk2) | has_immunity(sk1,sk3).
% 513 [hyper:41,510,cut:53,cut:54] has_immunity(sk1,sk3).
% 514 [hyper:41,513,cut:53] has_endowment(sk1).
% 516 [hyper:54,514] 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 11
% clause depth limited to 2
% seconds given: 25
%
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 57
% derived clauses: 1005
% kept clauses: 121
% kept size sum: 1616
% kept mid-nuclei: 310
% kept new demods: 0
% forw unit-subs: 220
% forw double-subs: 102
% forw overdouble-subs: 226
% backward subs: 0
% fast unit cutoff: 86
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 505
% length fails: 0
% strength fails: 23
% predlist fails: 203
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 230
% full subs fail: 53
%
% ; 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/MGT046-1+eq_r.in")
%
%------------------------------------------------------------------------------