%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT013+1 : TPTP v9.3.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n017.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 4.90s 5.13s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT013+1 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.07/0.35 % Computer : n017.cluster.edu % 0.07/0.35 % Model : x86_64 x86_64 % 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.35 % Memory : 8046.5625MB % 0.07/0.35 % OS : Linux 6.8.0-71-generic % 0.07/0.35 % CPULimit : 300 % 0.07/0.35 % WCLimit : 300 % 0.07/0.35 % DateTime : Mon Sep 7 11:46:39 UTC 2026 % 0.07/0.35 % CPUTime : % 0.26/0.52 start to proof:theBenchmark % 4.90/5.12 %------------------------------------------- % 4.90/5.12 % File :CSE---1.7 % 4.90/5.12 % Problem :theBenchmark % 4.90/5.12 % Transform :cnf % 4.90/5.12 % Format :tptp:raw % 4.90/5.12 % Command :java -jar mcs_scs.jar %d %s % 4.90/5.12 % 4.90/5.12 % Result :Theorem 4.612569s % 4.90/5.12 % Output :CNFRefutation 4.612569s % 4.90/5.12 %------------------------------------------- % 4.90/5.12 %-------------------------------------------------------------------------- % 4.90/5.12 % File : MGT013+1 : TPTP v9.3.0. Released v2.0.0. % 4.90/5.12 % Domain : Management (Organisation Theory) % 4.90/5.12 % Problem : If organization complexity increases, its size cannot decrease % 4.90/5.12 % Version : [PB+94] axioms. % 4.90/5.12 % English : If the complexity of an organization gets bigger, its size % 4.90/5.12 % cannot get smaller (in lack of reorganization). % 4.90/5.12 % 4.90/5.12 % Refs : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 4.90/5.12 % : [Kam94] Kamps (1994), Email to G. Sutcliffe % 4.90/5.12 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 4.90/5.12 % Source : [Kam94] % 4.90/5.12 % Names : % 4.90/5.12 % 4.90/5.12 % Status : Theorem % 4.90/5.12 % Rating : 0.17 v9.3.0, 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.04 v3.7.0, 0.00 v2.1.0 % 4.90/5.12 % Syntax : Number of formulae : 9 ( 0 unt; 0 def) % 4.90/5.12 % Number of atoms : 42 ( 4 equ) % 4.90/5.12 % Maximal formula atoms : 9 ( 4 avg) % 4.90/5.12 % Number of connectives : 38 ( 5 ~; 2 |; 24 &) % 4.90/5.12 % ( 0 <=>; 7 =>; 0 <=; 0 <~>) % 4.90/5.12 % Maximal formula depth : 16 ( 8 avg) % 4.90/5.12 % Maximal term depth : 1 ( 1 avg) % 4.90/5.12 % Number of predicates : 7 ( 6 usr; 0 prp; 1-3 aty) % 4.90/5.12 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 4.90/5.12 % Number of variables : 33 ( 33 !; 0 ?) % 4.90/5.12 % SPC : FOF_THM_RFO_SEQ % 4.90/5.12 % 4.90/5.12 % Comments : "Not published due to publication constraints." [Kam95]. % 4.90/5.12 %-------------------------------------------------------------------------- % 4.90/5.12 %----Subsitution axioms % 4.90/5.12 %----Problem axioms % 4.90/5.12 fof(mp6_1,axiom, % 4.90/5.12 ! [X,Y] : % 4.90/5.12 ~ ( greater(X,Y) % 4.90/5.12 & X = Y ) ). % 4.90/5.12 % 4.90/5.12 fof(mp6_2,axiom, % 4.90/5.12 ! [X,Y] : % 4.90/5.12 ~ ( greater(X,Y) % 4.90/5.12 & greater(Y,X) ) ). % 4.90/5.12 % 4.90/5.12 %----Labelling the time variable. % 4.90/5.12 fof(mp15,axiom, % 4.90/5.12 ! [X,T] : % 4.90/5.12 ( organization(X,T) % 4.90/5.12 => time(T) ) ). % 4.90/5.12 % 4.90/5.12 %----On time. % 4.90/5.12 fof(mp16,axiom, % 4.90/5.12 ! [T1,T2] : % 4.90/5.12 ( ( time(T1) % 4.90/5.12 & time(T2) ) % 4.90/5.12 => ( greater(T1,T2) % 4.90/5.12 | T1 = T2 % 4.90/5.12 | greater(T2,T1) ) ) ). % 4.90/5.12 % 4.90/5.12 %----On the notation of of reorganization-free periods. % 4.90/5.12 fof(mp17,axiom, % 4.90/5.12 ! [X,T1,T2] : % 4.90/5.12 ( reorganization_free(X,T1,T2) % 4.90/5.12 => reorganization_free(X,T2,T1) ) ). % 4.90/5.12 % 4.90/5.12 %----Every organization can have only one complexity value at a time. % 4.90/5.12 fof(mp18,axiom, % 4.90/5.12 ! [X,C1,C2,T1,T2] : % 4.90/5.12 ( ( organization(X,T1) % 4.90/5.12 & organization(X,T2) % 4.90/5.12 & complexity(X,C1,T1) % 4.90/5.12 & complexity(X,C2,T2) % 4.90/5.12 & T1 = T2 ) % 4.90/5.12 => C1 = C2 ) ). % 4.90/5.12 % 4.90/5.12 fof(t11_FOL,hypothesis, % 4.90/5.12 ! [X,S1,S2,T1,T2] : % 4.90/5.12 ( ( organization(X,T1) % 4.90/5.12 & organization(X,T2) % 4.90/5.12 & reorganization_free(X,T1,T2) % 4.90/5.12 & size(X,S1,T1) % 4.90/5.12 & size(X,S2,T2) % 4.90/5.12 & greater(T2,T1) ) % 4.90/5.12 => ~ greater(S1,S2) ) ). % 4.90/5.12 % 4.90/5.12 fof(t12_FOL,hypothesis, % 4.90/5.12 ! [X,C1,C2,T1,T2] : % 4.90/5.12 ( ( organization(X,T1) % 4.90/5.12 & organization(X,T2) % 4.90/5.12 & reorganization_free(X,T1,T2) % 4.90/5.12 & complexity(X,C1,T1) % 4.90/5.12 & complexity(X,C2,T2) % 4.90/5.13 & greater(T2,T1) ) % 4.90/5.13 => ~ greater(C1,C2) ) ). % 4.90/5.13 % 4.90/5.13 fof(t13_FOL,conjecture, % 4.90/5.13 ! [X,C1,C2,S1,S2,T1,T2] : % 4.90/5.13 ( ( organization(X,T1) % 4.90/5.13 & organization(X,T2) % 4.90/5.13 & reorganization_free(X,T1,T2) % 4.90/5.13 & complexity(X,C1,T1) % 4.90/5.13 & complexity(X,C2,T2) % 4.90/5.13 & size(X,S1,T1) % 4.90/5.13 & size(X,S2,T2) % 4.90/5.13 & greater(C2,C1) ) % 4.90/5.13 => ~ greater(S1,S2) ) ). % 4.90/5.13 % 4.90/5.13 %-------------------------------------------------------------------------- % 4.90/5.13 %------------------------------------------- % 4.90/5.13 % Proof found % 4.90/5.13 % SZS status Theorem for theBenchmark % 4.90/5.13 % SZS output start Proof % 4.90/5.13 %ClaNum:34(EqnAxiom:17) % 4.90/5.13 %VarNum:73(SingletonVarNum:26) % 4.90/5.13 %MaxLitNum:7 % 4.90/5.13 %MaxfuncDepth:0 % 4.90/5.13 %SharedTerms:16 % 4.90/5.13 %goalClause: 18 19 20 21 22 23 24 25 26 % 4.90/5.13 %singleGoalClaCount:9 % 4.90/5.13 [18]P1(a1,a2) % 4.90/5.13 [19]P1(a4,a5) % 4.90/5.13 [20]P3(a3,a6) % 4.90/5.13 [21]P3(a3,a7) % 4.90/5.13 [22]P4(a3,a6,a7) % 4.90/5.13 [23]P2(a3,a2,a6) % 4.90/5.13 [24]P2(a3,a1,a7) % 4.90/5.13 [25]P5(a3,a4,a6) % 4.90/5.13 [26]P5(a3,a5,a7) % 4.90/5.13 [27]~P1(x271,x272)+~E(x271,x272) % 4.90/5.13 [28]P6(x281)+~P3(x282,x281) % 4.90/5.13 [29]~P1(x292,x291)+~P1(x291,x292) % 4.90/5.13 [31]~P4(x311,x313,x312)+P4(x311,x312,x313) % 4.90/5.13 [30]P1(x302,x301)+P1(x301,x302)+~P6(x302)+~P6(x301)+E(x301,x302) % 4.90/5.13 [32]~P3(x325,x323)+~P2(x325,x322,x324)+~P2(x325,x321,x323)+E(x321,x322)+~E(x323,x324)+~P3(x325,x324) % 4.90/5.13 [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) % 4.90/5.13 [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) % 4.90/5.13 %EqnAxiom % 4.90/5.13 [1]E(x11,x11) % 4.90/5.13 [2]E(x22,x21)+~E(x21,x22) % 4.90/5.13 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 4.90/5.13 [4]P1(x42,x43)+~E(x41,x42)+~P1(x41,x43) % 4.90/5.13 [5]P1(x53,x52)+~E(x51,x52)+~P1(x53,x51) % 4.90/5.13 [6]P5(x62,x63,x64)+~E(x61,x62)+~P5(x61,x63,x64) % 4.90/5.13 [7]P5(x73,x72,x74)+~E(x71,x72)+~P5(x73,x71,x74) % 4.90/5.13 [8]P5(x83,x84,x82)+~E(x81,x82)+~P5(x83,x84,x81) % 4.90/5.13 [9]P3(x92,x93)+~E(x91,x92)+~P3(x91,x93) % 4.90/5.13 [10]P3(x103,x102)+~E(x101,x102)+~P3(x103,x101) % 4.90/5.13 [11]P2(x112,x113,x114)+~E(x111,x112)+~P2(x111,x113,x114) % 4.90/5.13 [12]P2(x123,x122,x124)+~E(x121,x122)+~P2(x123,x121,x124) % 4.90/5.13 [13]P2(x133,x134,x132)+~E(x131,x132)+~P2(x133,x134,x131) % 4.90/5.13 [14]P4(x142,x143,x144)+~E(x141,x142)+~P4(x141,x143,x144) % 4.90/5.13 [15]P4(x153,x152,x154)+~E(x151,x152)+~P4(x153,x151,x154) % 4.90/5.13 [16]P4(x163,x164,x162)+~E(x161,x162)+~P4(x163,x164,x161) % 4.90/5.13 [17]~P6(x171)+P6(x172)+~E(x171,x172) % 4.90/5.13 % 4.90/5.13 %------------------------------------------- % 4.90/5.13 cnf(35,plain, % 4.90/5.13 (~P1(x351,x351)), % 4.90/5.13 inference(equality_inference,[],[27])). % 4.90/5.13 cnf(39,plain, % 4.90/5.13 (~E(a1,a2)), % 4.90/5.13 inference(scs_inference,[],[18,35,29,4])). % 4.90/5.13 cnf(70,plain, % 4.90/5.13 (P2(a3,a2,x701)+~E(a6,x701)), % 4.90/5.13 inference(scs_inference,[],[23,26,24,22,6,12,11,16,8,13])). % 4.90/5.13 cnf(77,plain, % 4.90/5.13 (P3(a3,x771)+~E(a7,x771)), % 4.90/5.13 inference(scs_inference,[],[21,10])). % 4.90/5.13 cnf(94,plain, % 4.90/5.13 (~P2(a3,a2,a7)), % 4.90/5.13 inference(scs_inference,[],[24,21,39,32])). % 4.90/5.13 cnf(97,plain, % 4.90/5.13 (~E(a6,a7)), % 4.90/5.13 inference(scs_inference,[],[94,70])). % 4.90/5.13 cnf(110,plain, % 4.90/5.13 (~E(a6,x1101)+P6(x1101)), % 4.90/5.13 inference(scs_inference,[],[20,28,17])). % 4.90/5.13 cnf(111,plain, % 4.90/5.13 (P6(a6)), % 4.90/5.13 inference(equality_inference,[],[110])). % 4.90/5.13 cnf(144,plain, % 4.90/5.13 (~P1(a6,a7)), % 4.90/5.13 inference(scs_inference,[],[22,18,20,21,23,24,31,33])). % 4.90/5.13 cnf(145,plain, % 4.90/5.13 (~P6(a7)+P1(a7,a6)), % 4.90/5.13 inference(scs_inference,[],[144,97,111,30])). % 4.90/5.13 cnf(719,plain, % 4.90/5.13 (P6(x7191)+~E(a7,x7191)), % 4.90/5.13 inference(scs_inference,[],[28,77])). % 4.90/5.13 cnf(720,plain, % 4.90/5.13 (P6(a7)), % 4.90/5.13 inference(equality_inference,[],[719])). % 4.90/5.13 cnf(721,plain, % 4.90/5.13 (P1(a7,a6)), % 4.90/5.13 inference(scs_inference,[],[720,145])). % 4.90/5.13 cnf(1519,plain, % 4.90/5.13 ($false), % 4.90/5.13 inference(scs_inference,[],[22,25,26,20,21,19,721,34]), % 4.90/5.13 ['proof']). % 5.04/5.13 % SZS output end Proof % 5.04/5.13 % Total time :4.612569s %------------------------------------------------------------------------------