%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT014+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 : n014.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 6.35s 6.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT014+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.08/0.36 % Computer : n014.cluster.edu % 0.08/0.36 % Model : x86_64 x86_64 % 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.36 % Memory : 8046.5625MB % 0.08/0.36 % OS : Linux 6.8.0-71-generic % 0.08/0.36 % CPULimit : 300 % 0.08/0.36 % WCLimit : 300 % 0.08/0.36 % DateTime : Mon Sep 7 11:52:56 UTC 2026 % 0.14/0.36 % CPUTime : % 0.24/0.53 start to proof:theBenchmark % 6.35/6.50 %------------------------------------------- % 6.35/6.50 % File :CSE---1.7 % 6.35/6.50 % Problem :theBenchmark % 6.35/6.50 % Transform :cnf % 6.35/6.50 % Format :tptp:raw % 6.35/6.50 % Command :java -jar mcs_scs.jar %d %s % 6.35/6.50 % 6.35/6.50 % Result :Theorem 5.993915s % 6.35/6.50 % Output :CNFRefutation 5.993915s % 6.35/6.50 %------------------------------------------- % 6.35/6.51 %-------------------------------------------------------------------------- % 6.35/6.51 % File : MGT014+1 : TPTP v9.3.0. Released v2.0.0. % 6.35/6.51 % Domain : Management (Organisation Theory) % 6.35/6.51 % Problem : If orgainzation size increases, its complexity cannot decrease % 6.35/6.51 % Version : [PB+94] axioms. % 6.35/6.51 % English : If the size of an organization gets bigger, its complexity % 6.35/6.51 % cannot get smaller (in lack of reorganization). % 6.35/6.51 % 6.35/6.51 % Refs : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 6.35/6.51 % : [Kam94] Kamps (1994), Email to G. Sutcliffe % 6.35/6.51 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 6.35/6.51 % Source : [Kam94] % 6.35/6.51 % Names : % 6.35/6.51 % 6.35/6.51 % Status : Theorem % 6.35/6.51 % Rating : 0.13 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 % 6.35/6.51 % Syntax : Number of formulae : 9 ( 0 unt; 0 def) % 6.35/6.51 % Number of atoms : 42 ( 4 equ) % 6.35/6.51 % Maximal formula atoms : 9 ( 4 avg) % 6.35/6.51 % Number of connectives : 38 ( 5 ~; 2 |; 24 &) % 6.35/6.51 % ( 0 <=>; 7 =>; 0 <=; 0 <~>) % 6.35/6.51 % Maximal formula depth : 16 ( 8 avg) % 6.35/6.51 % Maximal term depth : 1 ( 1 avg) % 6.35/6.51 % Number of predicates : 7 ( 6 usr; 0 prp; 1-3 aty) % 6.35/6.51 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 6.35/6.51 % Number of variables : 33 ( 33 !; 0 ?) % 6.35/6.51 % SPC : FOF_THM_RFO_SEQ % 6.35/6.51 % 6.35/6.51 % Comments : "Not published due to publication constraints." [Kam95]. % 6.35/6.51 %-------------------------------------------------------------------------- % 6.35/6.51 %----Subsitution axioms % 6.35/6.51 %----Problem axioms % 6.35/6.51 fof(mp6_1,axiom, % 6.35/6.51 ! [X,Y] : % 6.35/6.51 ~ ( greater(X,Y) % 6.35/6.51 & X = Y ) ). % 6.35/6.51 % 6.35/6.51 fof(mp6_2,axiom, % 6.35/6.51 ! [X,Y] : % 6.35/6.51 ~ ( greater(X,Y) % 6.35/6.51 & greater(Y,X) ) ). % 6.35/6.51 % 6.35/6.51 %----Labelling the time variable. % 6.35/6.51 fof(mp15,axiom, % 6.35/6.51 ! [X,T] : % 6.35/6.51 ( organization(X,T) % 6.35/6.51 => time(T) ) ). % 6.35/6.51 % 6.35/6.51 %----On time. % 6.35/6.51 fof(mp16,axiom, % 6.35/6.51 ! [T1,T2] : % 6.35/6.51 ( ( time(T1) % 6.35/6.51 & time(T2) ) % 6.35/6.51 => ( greater(T1,T2) % 6.35/6.51 | T1 = T2 % 6.35/6.51 | greater(T2,T1) ) ) ). % 6.35/6.51 % 6.35/6.51 %----On the notation of of reorganization-free periods. % 6.35/6.51 fof(mp17,axiom, % 6.35/6.51 ! [X,T1,T2] : % 6.35/6.51 ( reorganization_free(X,T1,T2) % 6.35/6.51 => reorganization_free(X,T2,T1) ) ). % 6.35/6.51 % 6.35/6.51 %----Every organization can have only one size at a time. % 6.35/6.51 fof(mp19,axiom, % 6.35/6.51 ! [X,S1,S2,T1,T2] : % 6.35/6.51 ( ( organization(X,T1) % 6.35/6.51 & organization(X,T2) % 6.35/6.51 & size(X,S1,T1) % 6.35/6.51 & size(X,S2,T2) % 6.35/6.51 & T1 = T2 ) % 6.35/6.51 => S1 = S2 ) ). % 6.35/6.51 % 6.35/6.51 fof(t11_FOL,hypothesis, % 6.35/6.51 ! [X,S1,S2,T1,T2] : % 6.35/6.51 ( ( organization(X,T1) % 6.35/6.51 & organization(X,T2) % 6.35/6.51 & reorganization_free(X,T1,T2) % 6.35/6.51 & size(X,S1,T1) % 6.35/6.51 & size(X,S2,T2) % 6.35/6.51 & greater(T2,T1) ) % 6.35/6.51 => ~ greater(S1,S2) ) ). % 6.35/6.51 % 6.35/6.51 fof(t12_FOL,hypothesis, % 6.35/6.51 ! [X,C1,C2,T1,T2] : % 6.35/6.51 ( ( organization(X,T1) % 6.35/6.51 & organization(X,T2) % 6.35/6.51 & reorganization_free(X,T1,T2) % 6.35/6.51 & complexity(X,C1,T1) % 6.35/6.51 & complexity(X,C2,T2) % 6.35/6.51 & greater(T2,T1) ) % 6.35/6.51 => ~ greater(C1,C2) ) ). % 6.35/6.51 % 6.35/6.51 fof(t14_FOL,conjecture, % 6.35/6.51 ! [X,C1,C2,S1,S2,T1,T2] : % 6.35/6.51 ( ( organization(X,T1) % 6.35/6.51 & organization(X,T2) % 6.35/6.51 & reorganization_free(X,T1,T2) % 6.35/6.51 & complexity(X,C1,T1) % 6.35/6.51 & complexity(X,C2,T2) % 6.35/6.51 & size(X,S1,T1) % 6.35/6.51 & size(X,S2,T2) % 6.35/6.51 & greater(S2,S1) ) % 6.35/6.51 => ~ greater(C1,C2) ) ). % 6.35/6.51 % 6.35/6.51 %-------------------------------------------------------------------------- % 6.35/6.51 %------------------------------------------- % 6.35/6.51 % Proof found % 6.35/6.51 % SZS status Theorem for theBenchmark % 6.35/6.51 % SZS output start Proof % 6.35/6.51 %ClaNum:34(EqnAxiom:17) % 6.35/6.51 %VarNum:73(SingletonVarNum:26) % 6.35/6.51 %MaxLitNum:7 % 6.35/6.51 %MaxfuncDepth:0 % 6.35/6.51 %SharedTerms:16 % 6.35/6.51 %goalClause: 18 19 20 21 22 23 24 25 26 % 6.35/6.51 %singleGoalClaCount:9 % 6.35/6.51 [18]P1(a1,a3) % 6.35/6.51 [19]P1(a4,a5) % 6.35/6.51 [20]P3(a2,a6) % 6.35/6.51 [21]P3(a2,a7) % 6.35/6.51 [22]P4(a2,a6,a7) % 6.35/6.51 [23]P5(a2,a5,a6) % 6.35/6.51 [24]P5(a2,a4,a7) % 6.35/6.51 [25]P2(a2,a1,a6) % 6.35/6.51 [26]P2(a2,a3,a7) % 6.35/6.51 [27]~P1(x271,x272)+~E(x271,x272) % 6.35/6.51 [28]P6(x281)+~P3(x282,x281) % 6.35/6.51 [29]~P1(x292,x291)+~P1(x291,x292) % 6.35/6.51 [31]~P4(x311,x313,x312)+P4(x311,x312,x313) % 6.35/6.51 [30]P1(x302,x301)+P1(x301,x302)+~P6(x302)+~P6(x301)+E(x301,x302) % 6.35/6.51 [32]~P3(x325,x323)+~P5(x325,x322,x324)+~P5(x325,x321,x323)+E(x321,x322)+~E(x323,x324)+~P3(x325,x324) % 6.35/6.51 [33]~P3(x335,x334)+~P4(x335,x334,x333)+~P5(x335,x332,x333)+~P5(x335,x331,x334)+~P1(x331,x332)+~P1(x333,x334)+~P3(x335,x333) % 6.35/6.51 [34]~P3(x345,x344)+~P4(x345,x344,x343)+~P2(x345,x342,x343)+~P2(x345,x341,x344)+~P1(x341,x342)+~P1(x343,x344)+~P3(x345,x343) % 6.35/6.51 %EqnAxiom % 6.35/6.51 [1]E(x11,x11) % 6.35/6.51 [2]E(x22,x21)+~E(x21,x22) % 6.35/6.51 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 6.35/6.51 [4]P1(x42,x43)+~E(x41,x42)+~P1(x41,x43) % 6.35/6.51 [5]P1(x53,x52)+~E(x51,x52)+~P1(x53,x51) % 6.35/6.51 [6]P2(x62,x63,x64)+~E(x61,x62)+~P2(x61,x63,x64) % 6.35/6.51 [7]P2(x73,x72,x74)+~E(x71,x72)+~P2(x73,x71,x74) % 6.35/6.51 [8]P2(x83,x84,x82)+~E(x81,x82)+~P2(x83,x84,x81) % 6.35/6.51 [9]P3(x92,x93)+~E(x91,x92)+~P3(x91,x93) % 6.35/6.51 [10]P3(x103,x102)+~E(x101,x102)+~P3(x103,x101) % 6.35/6.51 [11]P5(x112,x113,x114)+~E(x111,x112)+~P5(x111,x113,x114) % 6.35/6.51 [12]P5(x123,x122,x124)+~E(x121,x122)+~P5(x123,x121,x124) % 6.35/6.51 [13]P5(x133,x134,x132)+~E(x131,x132)+~P5(x133,x134,x131) % 6.35/6.51 [14]P4(x142,x143,x144)+~E(x141,x142)+~P4(x141,x143,x144) % 6.35/6.51 [15]P4(x153,x152,x154)+~E(x151,x152)+~P4(x153,x151,x154) % 6.35/6.51 [16]P4(x163,x164,x162)+~E(x161,x162)+~P4(x163,x164,x161) % 6.35/6.51 [17]~P6(x171)+P6(x172)+~E(x171,x172) % 6.35/6.51 % 6.35/6.51 %------------------------------------------- % 6.35/6.51 cnf(35,plain, % 6.35/6.51 (~P1(x351,x351)), % 6.35/6.52 inference(equality_inference,[],[27])). % 6.35/6.52 cnf(57,plain, % 6.35/6.52 (~E(a4,a5)), % 6.35/6.52 inference(scs_inference,[],[19,35,29,4])). % 6.35/6.52 cnf(72,plain, % 6.35/6.52 (P5(a2,a4,x721)+~E(a7,x721)), % 6.35/6.52 inference(scs_inference,[],[26,24,22,16,7,8,13])). % 6.35/6.52 cnf(81,plain, % 6.35/6.52 (P3(x811,a7)+~E(a2,x811)), % 6.35/6.52 inference(scs_inference,[],[21,9])). % 6.35/6.52 cnf(92,plain, % 6.35/6.52 (~P5(a2,a4,a6)), % 6.35/6.52 inference(scs_inference,[],[23,20,57,32])). % 6.35/6.52 cnf(95,plain, % 6.35/6.52 (~E(a7,a6)), % 6.35/6.52 inference(scs_inference,[],[92,72])). % 6.35/6.52 cnf(107,plain, % 6.35/6.52 (~E(a6,x1071)+P6(x1071)), % 6.35/6.52 inference(scs_inference,[],[20,28,17])). % 6.35/6.52 cnf(108,plain, % 6.35/6.52 (P6(a6)), % 6.35/6.52 inference(equality_inference,[],[107])). % 6.35/6.52 cnf(142,plain, % 6.35/6.52 (P4(x1421,a7,a6)+~E(a2,x1421)), % 6.35/6.52 inference(scs_inference,[],[22,31,14])). % 6.35/6.52 cnf(143,plain, % 6.35/6.52 (P4(a2,a7,a6)), % 6.35/6.52 inference(equality_inference,[],[142])). % 6.35/6.52 cnf(452,plain, % 6.35/6.52 (P6(a7)+~E(a2,x4521)), % 6.35/6.52 inference(scs_inference,[],[28,81])). % 6.35/6.52 cnf(453,plain, % 6.35/6.52 (P6(a7)), % 6.35/6.52 inference(equality_inference,[],[452])). % 6.35/6.52 cnf(1329,plain, % 6.35/6.52 (~P1(a7,a6)), % 6.35/6.52 inference(scs_inference,[],[18,20,22,26,25,81,34])). % 6.35/6.52 cnf(1330,plain, % 6.35/6.52 (P1(a6,a7)), % 6.35/6.52 inference(scs_inference,[],[1329,453,95,108,30])). % 6.35/6.52 cnf(1889,plain, % 6.35/6.52 ($false), % 6.35/6.52 inference(scs_inference,[],[19,1330,20,143,23,24,81,33]), % 6.35/6.52 ['proof']). % 6.35/6.52 % SZS output end Proof % 6.35/6.52 % Total time :5.993915s %------------------------------------------------------------------------------