TSTP Solution File: MGT050-1 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : MGT050-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 : art03.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/MGT050-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,0,56,0,0)
%
%
% START OF PROOF
% 32 [] -equal(X,Y) | smaller_or_equal(X,Y).
% 35 [] -equal(X,Y) | greater_or_equal(X,Y).
% 36 [] -smaller(X,Y) | greater(Y,X).
% 41 [] -has_immunity(X,Y) | -organization(X) | has_endowment(X).
% 42 [] -greater(capability(X,Y),capability(X,Z)) | -greater_or_equal(position(X,Y),position(X,Z)) | smaller(hazard_of_mortality(X,Y),hazard_of_mortality(X,Z)) | has_immunity(X,Z) | has_immunity(X,Y) | -organization(X).
% 46 [] -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).
% 49 [] -equal(external_ties(X,Y),external_ties(X,Z)) | equal(position(X,Y),position(X,Z)) | -organization(X).
% 50 [] equal(stock_of_knowledge(X,Y),stock_of_knowledge(X,Z)) | -organization(X).
% 51 [] equal(external_ties(X,Y),external_ties(X,Z)) | -organization(X).
% 52 [] -greater(age(X,Y),age(X,Z)) | greater(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 [] -greater(hazard_of_mortality(sk1,sk3),hazard_of_mortality(sk1,sk2)).
% 66 [hyper:50,53] equal(stock_of_knowledge(sk1,X),stock_of_knowledge(sk1,Y)).
% 67 [hyper:51,53] equal(external_ties(sk1,X),external_ties(sk1,Y)).
% 81 [hyper:52,55,cut:53] greater(internal_friction(sk1,sk3),internal_friction(sk1,sk2)).
% 86 [hyper:32,66] smaller_or_equal(stock_of_knowledge(sk1,X),stock_of_knowledge(sk1,Y)).
% 97 [hyper:49,67,cut:53] equal(position(sk1,X),position(sk1,Y)).
% 101 [hyper:35,97] greater_or_equal(position(sk1,X),position(sk1,Y)).
% 112 [hyper:46,81,cut:86,cut:53] smaller(capability(sk1,sk3),capability(sk1,sk2)).
% 122 [hyper:36,112] greater(capability(sk1,sk2),capability(sk1,sk3)).
% 379 [hyper:42,122,cut:101,cut:53] smaller(hazard_of_mortality(sk1,sk2),hazard_of_mortality(sk1,sk3)) | has_immunity(sk1,sk3) | has_immunity(sk1,sk2).
% 416 [hyper:36,379,cut:56] has_immunity(sk1,sk3) | has_immunity(sk1,sk2).
% 422 [hyper:41,416,cut:53,cut:54] has_immunity(sk1,sk2).
% 423 [hyper:41,422,cut:53] has_endowment(sk1).
% 425 [hyper:54,423] 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: 58
% derived clauses: 842
% kept clauses: 83
% kept size sum: 881
% kept mid-nuclei: 254
% kept new demods: 0
% forw unit-subs: 307
% forw double-subs: 83
% forw overdouble-subs: 86
% backward subs: 1
% fast unit cutoff: 47
% full unit cutoff: 0
% dbl unit cutoff: 3
% real runtime : 0.3
% process. runtime: 0.3
% specific non-discr-tree subsumption statistics:
% tried: 207
% length fails: 0
% strength fails: 19
% predlist fails: 60
% aux str. fails: 0
% by-lit fails: 0
% full subs tried: 123
% full subs fail: 42
%
% ; 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/MGT050-1+eq_r.in")
%
%------------------------------------------------------------------------------