TPTP Problem File: MGT015-1.p

View Solutions - Solve Problem

%--------------------------------------------------------------------------
% File     : MGT015-1 : TPTP v8.2.0. Released v2.4.0.
% Domain   : Management (Organisation Theory)
% Problem  : Complexity increases the expected duration of reorganisation.
% Version  : [PB+94] axioms.
% English  :

% Refs     : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
%          : [Kam94] Kamps (1994), Email to G. Sutcliffe
%          : [Kam95] Kamps (1995), Email to G. Sutcliffe
% Source   : [TPTP]
% Names    :

% Status   : Unsatisfiable
% Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.4.0
% Syntax   : Number of clauses     :   16 (  13 unt;   0 nHn;  16 RR)
%            Number of literals    :   38 (   0 equ;  23 neg)
%            Maximal clause size   :   13 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   7 usr;   0 prp; 2-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)
% SPC      : CNF_UNS_RFO_NEQ_HRN

% Comments : "Not published due to publication constraints." [Kam95].
%          : Created with tptp2X -f tptp -t clausify:otter MGT015+1.p
%--------------------------------------------------------------------------
cnf(mp5_1,axiom,
    ( ~ organization(A,B)
    | inertia(A,sk1(B,A),B) ) ).

cnf(a12_FOL_2,hypothesis,
    ( ~ organization(A,B)
    | ~ organization(C,D)
    | ~ class(A,E,B)
    | ~ class(C,E,D)
    | ~ complexity(A,F,B)
    | ~ complexity(C,G,D)
    | ~ inertia(A,H,B)
    | ~ inertia(C,I,D)
    | ~ greater(G,F)
    | greater(I,H) ) ).

cnf(a13_FOL_3,hypothesis,
    ( ~ organization(A,B)
    | ~ organization(C,B)
    | ~ organization(C,D)
    | ~ class(A,E,B)
    | ~ class(C,E,B)
    | ~ reorganization(A,B,F)
    | ~ reorganization(C,B,D)
    | ~ reorganization_type(A,G,B)
    | ~ reorganization_type(C,G,B)
    | ~ inertia(A,H,B)
    | ~ inertia(C,I,B)
    | ~ greater(I,H)
    | greater(D,F) ) ).

cnf(t15_FOL_4,negated_conjecture,
    organization(sk2,sk8) ).

cnf(t15_FOL_5,negated_conjecture,
    organization(sk3,sk8) ).

cnf(t15_FOL_6,negated_conjecture,
    organization(sk3,sk10) ).

cnf(t15_FOL_7,negated_conjecture,
    class(sk2,sk5,sk8) ).

cnf(t15_FOL_8,negated_conjecture,
    class(sk3,sk5,sk8) ).

cnf(t15_FOL_9,negated_conjecture,
    reorganization(sk2,sk8,sk9) ).

cnf(t15_FOL_10,negated_conjecture,
    reorganization(sk3,sk8,sk10) ).

cnf(t15_FOL_11,negated_conjecture,
    reorganization_type(sk2,sk4,sk8) ).

cnf(t15_FOL_12,negated_conjecture,
    reorganization_type(sk3,sk4,sk8) ).

cnf(t15_FOL_13,negated_conjecture,
    complexity(sk2,sk6,sk8) ).

cnf(t15_FOL_14,negated_conjecture,
    complexity(sk3,sk7,sk8) ).

cnf(t15_FOL_15,negated_conjecture,
    greater(sk7,sk6) ).

cnf(t15_FOL_16,negated_conjecture,
    ~ greater(sk10,sk9) ).

%--------------------------------------------------------------------------