TSTP Solution File: MGT013-1 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 09:06:44 EDT 2023

% Result   : Unsatisfiable 0.20s 0.61s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Aug 28 06:15:32 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.54  start to proof:theBenchmark
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  % File        :CSE---1.6
% 0.20/0.60  % Problem     :theBenchmark
% 0.20/0.60  % Transform   :cnf
% 0.20/0.60  % Format      :tptp:raw
% 0.20/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.60  
% 0.20/0.60  % Result      :Theorem 0.000000s
% 0.20/0.60  % Output      :CNFRefutation 0.000000s
% 0.20/0.60  %-------------------------------------------
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  % File     : MGT013-1 : TPTP v8.1.2. Released v2.4.0.
% 0.20/0.60  % Domain   : Management (Organisation Theory)
% 0.20/0.60  % Problem  : If organization complexity increases, its size cannot decrease
% 0.20/0.60  % Version  : [PB+94] axioms.
% 0.20/0.60  % English  : If the complexity of an organization gets bigger, its size
% 0.20/0.60  %            cannot get smaller (in lack of reorganization).
% 0.20/0.60  
% 0.20/0.60  % Refs     : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 0.20/0.60  %          : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 0.20/0.60  %          : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 0.20/0.60  % Source   : [TPTP]
% 0.20/0.60  % Names    :
% 0.20/0.60  
% 0.20/0.60  % Status   : Unsatisfiable
% 0.20/0.60  % Rating   : 0.00 v2.6.0, 0.11 v2.5.0, 0.00 v2.4.0
% 0.20/0.60  % Syntax   : Number of clauses     :   17 (   9 unt;   1 nHn;  17 RR)
% 0.20/0.60  %            Number of literals    :   42 (   4 equ;  27 neg)
% 0.20/0.60  %            Maximal clause size   :    7 (   2 avg)
% 0.20/0.60  %            Maximal term depth    :    1 (   1 avg)
% 0.20/0.60  %            Number of predicates  :    7 (   6 usr;   0 prp; 1-3 aty)
% 0.20/0.60  %            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
% 0.20/0.60  %            Number of variables   :   26 (   1 sgn)
% 0.20/0.60  % SPC      : CNF_UNS_EPR_SEQ_NHN
% 0.20/0.60  
% 0.20/0.60  % Comments : "Not published due to publication constraints." [Kam95].
% 0.20/0.60  %          : Created with tptp2X -f tptp -t clausify:otter MGT013+1.p
% 0.20/0.60  %--------------------------------------------------------------------------
% 0.20/0.60  cnf(mp6_1_18,axiom,
% 0.20/0.60      ( ~ greater(A,B)
% 0.20/0.60      | A != B ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(mp6_2_19,axiom,
% 0.20/0.60      ( ~ greater(A,B)
% 0.20/0.60      | ~ greater(B,A) ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(mp15_20,axiom,
% 0.20/0.60      ( ~ organization(A,B)
% 0.20/0.60      | time(B) ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(mp16_21,axiom,
% 0.20/0.60      ( ~ time(A)
% 0.20/0.60      | ~ time(B)
% 0.20/0.60      | greater(A,B)
% 0.20/0.60      | A = B
% 0.20/0.60      | greater(B,A) ) ).
% 0.20/0.60  
% 0.20/0.60  cnf(mp17_22,axiom,
% 0.20/0.60      ( ~ reorganization_free(A,B,C)
% 0.20/0.60      | reorganization_free(A,C,B) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(mp18_23,axiom,
% 0.20/0.61      ( ~ organization(A,B)
% 0.20/0.61      | ~ organization(A,C)
% 0.20/0.61      | ~ complexity(A,D,B)
% 0.20/0.61      | ~ complexity(A,E,C)
% 0.20/0.61      | B != C
% 0.20/0.61      | D = E ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t11_FOL_24,hypothesis,
% 0.20/0.61      ( ~ organization(A,B)
% 0.20/0.61      | ~ organization(A,C)
% 0.20/0.61      | ~ reorganization_free(A,B,C)
% 0.20/0.61      | ~ size(A,D,B)
% 0.20/0.61      | ~ size(A,E,C)
% 0.20/0.61      | ~ greater(C,B)
% 0.20/0.61      | ~ greater(D,E) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t12_FOL_25,hypothesis,
% 0.20/0.61      ( ~ organization(A,B)
% 0.20/0.61      | ~ organization(A,C)
% 0.20/0.61      | ~ reorganization_free(A,B,C)
% 0.20/0.61      | ~ complexity(A,D,B)
% 0.20/0.61      | ~ complexity(A,E,C)
% 0.20/0.61      | ~ greater(C,B)
% 0.20/0.61      | ~ greater(D,E) ) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_26,negated_conjecture,
% 0.20/0.61      organization(sk1,sk6) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_27,negated_conjecture,
% 0.20/0.61      organization(sk1,sk7) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_28,negated_conjecture,
% 0.20/0.61      reorganization_free(sk1,sk6,sk7) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_29,negated_conjecture,
% 0.20/0.61      complexity(sk1,sk2,sk6) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_30,negated_conjecture,
% 0.20/0.61      complexity(sk1,sk3,sk7) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_31,negated_conjecture,
% 0.20/0.61      size(sk1,sk4,sk6) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_32,negated_conjecture,
% 0.20/0.61      size(sk1,sk5,sk7) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_33,negated_conjecture,
% 0.20/0.61      greater(sk3,sk2) ).
% 0.20/0.61  
% 0.20/0.61  cnf(t13_FOL_34,negated_conjecture,
% 0.20/0.61      greater(sk4,sk5) ).
% 0.20/0.61  
% 0.20/0.61  %--------------------------------------------------------------------------
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  % Proof found
% 0.20/0.61  % SZS status Theorem for theBenchmark
% 0.20/0.61  % SZS output start Proof
% 0.20/0.61  %ClaNum:34(EqnAxiom:17)
% 0.20/0.61  %VarNum:73(SingletonVarNum:26)
% 0.20/0.61  %MaxLitNum:7
% 0.20/0.61  %MaxfuncDepth:0
% 0.20/0.61  %SharedTerms:16
% 0.20/0.61  %goalClause: 18 19 20 21 22 23 24 25 26
% 0.20/0.61  %singleGoalClaCount:9
% 0.20/0.61  [18]P1(a1,a2)
% 0.20/0.61  [19]P1(a4,a5)
% 0.20/0.61  [20]P3(a3,a6)
% 0.20/0.61  [21]P3(a3,a7)
% 0.20/0.61  [22]P4(a3,a6,a7)
% 0.20/0.61  [23]P2(a3,a2,a6)
% 0.20/0.61  [24]P2(a3,a1,a7)
% 0.20/0.61  [25]P5(a3,a4,a6)
% 0.20/0.61  [26]P5(a3,a5,a7)
% 0.20/0.61  [27]~P1(x271,x272)+~E(x271,x272)
% 0.20/0.61  [28]P6(x281)+~P3(x282,x281)
% 0.20/0.61  [29]~P1(x292,x291)+~P1(x291,x292)
% 0.20/0.61  [31]~P4(x311,x313,x312)+P4(x311,x312,x313)
% 0.20/0.61  [30]P1(x302,x301)+P1(x301,x302)+~P6(x302)+~P6(x301)+E(x301,x302)
% 0.20/0.61  [32]~P3(x325,x323)+~P2(x325,x322,x324)+~P2(x325,x321,x323)+E(x321,x322)+~E(x323,x324)+~P3(x325,x324)
% 0.20/0.61  [33]~P3(x335,x334)+~P4(x335,x334,x333)+~P2(x335,x332,x333)+~P2(x335,x331,x334)+~P1(x331,x332)+~P1(x333,x334)+~P3(x335,x333)
% 0.20/0.61  [34]~P3(x345,x344)+~P4(x345,x344,x343)+~P5(x345,x342,x343)+~P5(x345,x341,x344)+~P1(x341,x342)+~P1(x343,x344)+~P3(x345,x343)
% 0.20/0.61  %EqnAxiom
% 0.20/0.61  [1]E(x11,x11)
% 0.20/0.61  [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.61  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.61  [4]P1(x42,x43)+~E(x41,x42)+~P1(x41,x43)
% 0.20/0.61  [5]P1(x53,x52)+~E(x51,x52)+~P1(x53,x51)
% 0.20/0.61  [6]P5(x62,x63,x64)+~E(x61,x62)+~P5(x61,x63,x64)
% 0.20/0.61  [7]P5(x73,x72,x74)+~E(x71,x72)+~P5(x73,x71,x74)
% 0.20/0.61  [8]P5(x83,x84,x82)+~E(x81,x82)+~P5(x83,x84,x81)
% 0.20/0.61  [9]P3(x92,x93)+~E(x91,x92)+~P3(x91,x93)
% 0.20/0.61  [10]P3(x103,x102)+~E(x101,x102)+~P3(x103,x101)
% 0.20/0.61  [11]P2(x112,x113,x114)+~E(x111,x112)+~P2(x111,x113,x114)
% 0.20/0.61  [12]P2(x123,x122,x124)+~E(x121,x122)+~P2(x123,x121,x124)
% 0.20/0.61  [13]P2(x133,x134,x132)+~E(x131,x132)+~P2(x133,x134,x131)
% 0.20/0.61  [14]P4(x142,x143,x144)+~E(x141,x142)+~P4(x141,x143,x144)
% 0.20/0.61  [15]P4(x153,x152,x154)+~E(x151,x152)+~P4(x153,x151,x154)
% 0.20/0.61  [16]P4(x163,x164,x162)+~E(x161,x162)+~P4(x163,x164,x161)
% 0.20/0.61  [17]~P6(x171)+P6(x172)+~E(x171,x172)
% 0.20/0.61  
% 0.20/0.61  %-------------------------------------------
% 0.20/0.61  cnf(35,plain,
% 0.20/0.61     (~P1(a2,a1)),
% 0.20/0.61     inference(scs_inference,[],[18,29])).
% 0.20/0.61  cnf(36,plain,
% 0.20/0.61     (P4(a3,a7,a6)),
% 0.20/0.61     inference(scs_inference,[],[18,22,29,31])).
% 0.20/0.61  cnf(37,plain,
% 0.20/0.61     (P6(a6)),
% 0.20/0.61     inference(scs_inference,[],[18,20,22,29,31,28])).
% 0.20/0.61  cnf(39,plain,
% 0.20/0.61     (~E(a1,a2)),
% 0.20/0.61     inference(scs_inference,[],[18,20,22,29,31,28,27])).
% 0.20/0.61  cnf(53,plain,
% 0.20/0.61     (~P6(a7)),
% 0.20/0.61     inference(scs_inference,[],[18,19,23,24,25,26,21,22,20,35,36,37,39,2,32,34,33,29,5,30])).
% 0.20/0.61  cnf(57,plain,
% 0.20/0.61     ($false),
% 0.20/0.61     inference(scs_inference,[],[21,53,28]),
% 0.20/0.61     ['proof']).
% 0.20/0.61  % SZS output end Proof
% 0.20/0.61  % Total time :0.000000s
%------------------------------------------------------------------------------