↑ Up

CSE---1.7.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : MGT012+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:15 AM UTC 2026

% Result   : Theorem 58.39s 58.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : MGT012+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.03  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.09/0.33  % Computer : n016.cluster.edu
% 0.09/0.33  % Model    : x86_64 x86_64
% 0.09/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33  % Memory   : 8046.5625MB
% 0.09/0.33  % OS       : Linux 6.8.0-71-generic
% 0.09/0.33  % CPULimit   : 300
% 0.09/0.33  % WCLimit    : 300
% 0.09/0.33  % DateTime   : Mon Sep  7 11:54:32 UTC 2026
% 0.09/0.34  % CPUTime    : 
% 0.24/0.50  start to proof:theBenchmark
% 58.39/58.56  %-------------------------------------------
% 58.39/58.56  % File        :CSE---1.7
% 58.39/58.56  % Problem     :theBenchmark
% 58.39/58.56  % Transform   :cnf
% 58.39/58.56  % Format      :tptp:raw
% 58.39/58.56  % Command     :java -jar mcs_scs.jar %d %s
% 58.39/58.56  
% 58.39/58.56  % Result      :Theorem 58.075890s
% 58.39/58.56  % Output      :CNFRefutation 58.075890s
% 58.39/58.56  %-------------------------------------------
% 58.39/58.57  %--------------------------------------------------------------------------
% 58.39/58.57  % File     : MGT012+1 : TPTP v9.3.0. Released v2.0.0.
% 58.39/58.57  % Domain   : Management (Organisation Theory)
% 58.39/58.57  % Problem  : Complexity of an organization cannot get smaller by age
% 58.39/58.57  % Version  : [PB+94] axioms.
% 58.39/58.57  % English  : Complexity of an organization cannot get smaller by age in
% 58.39/58.57  %            lack of reorganization.
% 58.39/58.57  
% 58.39/58.57  % Refs     : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 58.39/58.57  %          : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 58.39/58.57  %          : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 58.39/58.57  % Source   : [Kam94]
% 58.39/58.57  % Names    :
% 58.39/58.57  
% 58.39/58.57  % Status   : Theorem
% 58.39/58.57  % Rating   : 0.26 v9.3.0, 0.15 v9.1.0, 0.12 v9.0.0, 0.14 v7.5.0, 0.16 v7.4.0, 0.07 v7.3.0, 0.03 v7.1.0, 0.04 v7.0.0, 0.03 v6.4.0, 0.08 v6.2.0, 0.12 v6.1.0, 0.27 v6.0.0, 0.26 v5.5.0, 0.19 v5.4.0, 0.18 v5.3.0, 0.22 v5.2.0, 0.05 v5.0.0, 0.17 v3.7.0, 0.00 v3.4.0, 0.08 v3.3.0, 0.11 v3.2.0, 0.22 v3.1.0, 0.17 v2.7.0, 0.00 v2.1.0
% 58.39/58.57  % Syntax   : Number of formulae    :    8 (   0 unt;   0 def)
% 58.39/58.57  %            Number of atoms       :   38 (   2 equ)
% 58.39/58.57  %            Maximal formula atoms :   10 (   4 avg)
% 58.39/58.57  %            Number of connectives :   33 (   3   ~;   0   |;  24   &)
% 58.39/58.57  %                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
% 58.39/58.57  %            Maximal formula depth :   19 (   9 avg)
% 58.39/58.57  %            Maximal term depth    :    1 (   1 avg)
% 58.39/58.57  %            Number of predicates  :    7 (   6 usr;   0 prp; 2-3 aty)
% 58.39/58.57  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 58.39/58.57  %            Number of variables   :   34 (  32   !;   2   ?)
% 58.39/58.57  % SPC      : FOF_THM_RFO_SEQ
% 58.39/58.57  
% 58.39/58.57  % Comments : "Not published due to publication constraints." [Kam95].
% 58.39/58.57  %--------------------------------------------------------------------------
% 58.39/58.57  %----Subsitution axioms
% 58.39/58.57  %----Problem axioms
% 58.39/58.57  fof(mp5,axiom,
% 58.39/58.57      ! [X,T] :
% 58.39/58.57        ( organization(X,T)
% 58.39/58.57       => ? [I] : inertia(X,I,T) ) ).
% 58.39/58.57  
% 58.39/58.57  fof(mp6_1,axiom,
% 58.39/58.57      ! [X,Y] :
% 58.39/58.57        ~ ( greater(X,Y)
% 58.39/58.57          & X = Y ) ).
% 58.39/58.57  
% 58.39/58.57  fof(mp6_2,axiom,
% 58.39/58.57      ! [X,Y] :
% 58.39/58.57        ~ ( greater(X,Y)
% 58.39/58.57          & greater(Y,X) ) ).
% 58.39/58.57  
% 58.39/58.57  fof(mp9,axiom,
% 58.39/58.57      ! [X,T] :
% 58.39/58.57        ( organization(X,T)
% 58.39/58.57       => ? [C] : class(X,C,T) ) ).
% 58.39/58.57  
% 58.39/58.57  %----Class cannot change without reorganization.
% 58.39/58.57  fof(mp10,axiom,
% 58.39/58.57      ! [X,T1,T2,C1,C2] :
% 58.39/58.57        ( ( organization(X,T1)
% 58.39/58.57          & organization(X,T2)
% 58.39/58.57          & reorganization_free(X,T1,T2)
% 58.39/58.57          & class(X,C1,T1)
% 58.39/58.57          & class(X,C2,T2) )
% 58.39/58.57       => C1 = C2 ) ).
% 58.39/58.57  
% 58.39/58.57  fof(a12_FOL,hypothesis,
% 58.39/58.57      ! [X,Y,C,C1,C2,I1,I2,T1,T2] :
% 58.39/58.57        ( ( organization(X,T1)
% 58.39/58.57          & organization(Y,T2)
% 58.39/58.57          & class(X,C,T1)
% 58.39/58.57          & class(Y,C,T2)
% 58.39/58.57          & complexity(X,C1,T1)
% 58.39/58.57          & complexity(Y,C2,T2)
% 58.39/58.57          & inertia(X,I1,T1)
% 58.39/58.57          & inertia(Y,I2,T2)
% 58.39/58.57          & greater(C2,C1) )
% 58.39/58.57       => greater(I2,I1) ) ).
% 58.39/58.57  
% 58.39/58.57  fof(t2_FOL,hypothesis,
% 58.39/58.57      ! [X,I1,I2,T1,T2] :
% 58.39/58.57        ( ( organization(X,T1)
% 58.39/58.57          & organization(X,T2)
% 58.39/58.57          & reorganization_free(X,T1,T2)
% 58.39/58.57          & inertia(X,I1,T1)
% 58.39/58.57          & inertia(X,I2,T2)
% 58.39/58.57          & greater(T2,T1) )
% 58.39/58.57       => greater(I2,I1) ) ).
% 58.39/58.57  
% 58.39/58.57  fof(t12_FOL,conjecture,
% 58.39/58.57      ! [X,C1,C2,T1,T2] :
% 58.39/58.57        ( ( organization(X,T1)
% 58.39/58.57          & organization(X,T2)
% 58.39/58.57          & reorganization_free(X,T1,T2)
% 58.39/58.57          & complexity(X,C1,T1)
% 58.39/58.57          & complexity(X,C2,T2)
% 58.39/58.57          & greater(T2,T1) )
% 58.39/58.57       => ~ greater(C1,C2) ) ).
% 58.39/58.57  
% 58.39/58.57  %--------------------------------------------------------------------------
% 58.39/58.57  %-------------------------------------------
% 58.39/58.57  % Proof found
% 58.39/58.57  % SZS status Theorem for theBenchmark
% 58.39/58.57  % SZS output start Proof
% 58.39/58.57  %ClaNum:37(EqnAxiom:23)
% 58.39/58.57  %VarNum:78(SingletonVarNum:27)
% 58.39/58.57  %MaxLitNum:10
% 58.39/58.57  %MaxfuncDepth:1
% 58.39/58.57  %SharedTerms:12
% 58.39/58.57  %goalClause: 24 25 26 27 28 29 30
% 58.39/58.57  %singleGoalClaCount:7
% 58.39/58.57  [24]P1(a1,a4)
% 58.39/58.57  [25]P1(a1,a7)
% 58.39/58.57  [26]P2(a5,a6)
% 58.39/58.57  [27]P2(a7,a4)
% 58.39/58.57  [28]P6(a1,a4,a7)
% 58.39/58.57  [29]P3(a1,a5,a4)
% 58.39/58.57  [30]P3(a1,a6,a7)
% 58.39/58.57  [31]~P2(x311,x312)+~E(x311,x312)
% 58.39/58.57  [32]~P2(x322,x321)+~P2(x321,x322)
% 58.39/58.57  [33]~P1(x331,x332)+P5(x331,f2(x331,x332),x332)
% 58.39/58.57  [34]~P1(x341,x342)+P4(x341,f3(x341,x342),x342)
% 58.39/58.57  [35]~P4(x353,x352,x354)+~P4(x353,x351,x355)+~P6(x353,x355,x354)+E(x351,x352)+~P1(x353,x354)+~P1(x353,x355)
% 58.39/58.57  [36]~P2(x364,x365)+~P5(x363,x361,x364)+~P5(x363,x362,x365)+~P6(x363,x365,x364)+P2(x361,x362)+~P1(x363,x364)+~P1(x363,x365)
% 58.39/58.57  [37]~P5(x373,x371,x374)+~P5(x375,x372,x376)+~P4(x375,x379,x376)+~P3(x373,x377,x374)+~P3(x375,x378,x376)+P2(x371,x372)+~P1(x373,x374)+~P4(x373,x379,x374)+~P1(x375,x376)+~P2(x377,x378)
% 58.39/58.57  %EqnAxiom
% 58.39/58.57  [1]E(x11,x11)
% 58.39/58.57  [2]E(x22,x21)+~E(x21,x22)
% 58.39/58.57  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 58.39/58.57  [4]~E(x41,x42)+E(f2(x41,x43),f2(x42,x43))
% 58.39/58.57  [5]~E(x51,x52)+E(f2(x53,x51),f2(x53,x52))
% 58.39/58.57  [6]~E(x61,x62)+E(f3(x61,x63),f3(x62,x63))
% 58.39/58.57  [7]~E(x71,x72)+E(f3(x73,x71),f3(x73,x72))
% 58.39/58.57  [8]P1(x82,x83)+~E(x81,x82)+~P1(x81,x83)
% 58.39/58.57  [9]P1(x93,x92)+~E(x91,x92)+~P1(x93,x91)
% 58.39/58.57  [10]P3(x102,x103,x104)+~E(x101,x102)+~P3(x101,x103,x104)
% 58.39/58.57  [11]P3(x113,x112,x114)+~E(x111,x112)+~P3(x113,x111,x114)
% 58.39/58.57  [12]P3(x123,x124,x122)+~E(x121,x122)+~P3(x123,x124,x121)
% 58.39/58.57  [13]P2(x132,x133)+~E(x131,x132)+~P2(x131,x133)
% 58.39/58.57  [14]P2(x143,x142)+~E(x141,x142)+~P2(x143,x141)
% 58.39/58.57  [15]P5(x152,x153,x154)+~E(x151,x152)+~P5(x151,x153,x154)
% 58.39/58.57  [16]P5(x163,x162,x164)+~E(x161,x162)+~P5(x163,x161,x164)
% 58.39/58.57  [17]P5(x173,x174,x172)+~E(x171,x172)+~P5(x173,x174,x171)
% 58.39/58.57  [18]P6(x182,x183,x184)+~E(x181,x182)+~P6(x181,x183,x184)
% 58.39/58.57  [19]P6(x193,x192,x194)+~E(x191,x192)+~P6(x193,x191,x194)
% 58.39/58.58  [20]P6(x203,x204,x202)+~E(x201,x202)+~P6(x203,x204,x201)
% 58.39/58.58  [21]P4(x212,x213,x214)+~E(x211,x212)+~P4(x211,x213,x214)
% 58.39/58.58  [22]P4(x223,x222,x224)+~E(x221,x222)+~P4(x223,x221,x224)
% 58.39/58.58  [23]P4(x233,x234,x232)+~E(x231,x232)+~P4(x233,x234,x231)
% 58.39/58.58  
% 58.39/58.58  %-------------------------------------------
% 58.39/58.58  cnf(38,plain,
% 58.39/58.58     (~P2(x381,x381)),
% 58.39/58.58     inference(equality_inference,[],[31])).
% 58.39/58.58  cnf(42,plain,
% 58.39/58.58     (~P2(x421,x421)),
% 58.39/58.58     inference(rename_variables,[],[38])).
% 58.39/58.58  cnf(45,plain,
% 58.39/58.58     (P1(x451,a4)+~E(a1,x451)),
% 58.39/58.58     inference(scs_inference,[],[24,26,38,42,32,13,14,8])).
% 58.39/58.58  cnf(70,plain,
% 58.39/58.58     (P1(a1,x701)+~E(a7,x701)),
% 58.39/58.58     inference(scs_inference,[],[25,9])).
% 58.39/58.58  cnf(241,plain,
% 58.39/58.58     (P4(x2411,f3(x2411,a4),a4)+~E(a1,x2411)),
% 58.39/58.58     inference(scs_inference,[],[34,45])).
% 58.39/58.58  cnf(242,plain,
% 58.39/58.58     (P4(a1,f3(a1,a4),a4)),
% 58.39/58.58     inference(equality_inference,[],[241])).
% 58.39/58.58  cnf(1279,plain,
% 58.39/58.58     (P5(x12791,f2(x12791,a4),a4)+~E(a1,x12791)),
% 58.39/58.58     inference(scs_inference,[],[45,33])).
% 58.39/58.58  cnf(1280,plain,
% 58.39/58.58     (P5(a1,f2(a1,a4),a4)),
% 58.39/58.58     inference(equality_inference,[],[1279])).
% 58.39/58.58  cnf(1815,plain,
% 58.39/58.58     (P5(a1,f2(a1,x18151),x18151)+~E(a7,x18151)),
% 58.39/58.58     inference(scs_inference,[],[70,33])).
% 58.39/58.58  cnf(1816,plain,
% 58.39/58.58     (P5(a1,f2(a1,a7),a7)),
% 58.39/58.58     inference(equality_inference,[],[1815])).
% 58.39/58.58  cnf(2089,plain,
% 58.39/58.58     (P4(a1,f3(a1,x20891),x20891)+~E(a7,x20891)),
% 58.39/58.58     inference(scs_inference,[],[70,34])).
% 58.39/58.58  cnf(2090,plain,
% 58.39/58.58     (P4(a1,f3(a1,a7),a7)),
% 58.39/58.58     inference(equality_inference,[],[2089])).
% 58.39/58.58  cnf(7259,plain,
% 58.39/58.58     (E(f3(a1,a4),f3(a1,a7))),
% 58.39/58.58     inference(scs_inference,[],[24,25,28,2090,242,35])).
% 58.39/58.58  cnf(7352,plain,
% 58.39/58.58     (P4(a1,f3(a1,a7),a4)),
% 58.39/58.58     inference(scs_inference,[],[7259,242,22])).
% 58.39/58.58  cnf(7812,plain,
% 58.39/58.58     (~P2(f2(a1,a4),f2(a1,a7))),
% 58.39/58.58     inference(scs_inference,[],[24,1816,1280,25,27,28,36,32])).
% 58.39/58.58  cnf(7831,plain,
% 58.39/58.58     ($false),
% 58.39/58.58     inference(scs_inference,[],[24,7812,7352,1816,1280,25,26,30,29,2090,37]),
% 58.39/58.58     ['proof']).
% 58.39/58.58  % SZS output end Proof
% 58.39/58.58  % Total time :58.075890s
%------------------------------------------------------------------------------