%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT016+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.37s 58.57s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT016+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.07/0.34 % Computer : n016.cluster.edu % 0.07/0.34 % Model : x86_64 x86_64 % 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.34 % Memory : 8046.5625MB % 0.07/0.34 % OS : Linux 6.8.0-71-generic % 0.07/0.34 % CPULimit : 300 % 0.07/0.34 % WCLimit : 300 % 0.07/0.34 % DateTime : Mon Sep 7 12:00:02 UTC 2026 % 0.07/0.35 % CPUTime : % 0.24/0.52 start to proof:theBenchmark % 58.37/58.56 %------------------------------------------- % 58.37/58.56 % File :CSE---1.7 % 58.37/58.56 % Problem :theBenchmark % 58.37/58.56 % Transform :cnf % 58.37/58.56 % Format :tptp:raw % 58.37/58.56 % Command :java -jar mcs_scs.jar %d %s % 58.37/58.56 % 58.37/58.56 % Result :Theorem 58.017850s % 58.37/58.56 % Output :CNFRefutation 58.017850s % 58.37/58.56 %------------------------------------------- % 58.37/58.57 %-------------------------------------------------------------------------- % 58.37/58.57 % File : MGT016+1 : TPTP v9.3.0. Released v2.0.0. % 58.37/58.57 % Domain : Management (Organisation Theory) % 58.37/58.57 % Problem : More complex organizations have shorter reorganization % 58.37/58.57 % Version : [PB+94] axioms. % 58.37/58.57 % English : The more complex an organization is at the beginning of % 58.37/58.57 % reorganization, the sooner disbanding due to reorganization % 58.37/58.57 % (possibly) happens - i.e., the shorter is the reorganization. % 58.37/58.57 % 58.37/58.57 % Refs : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 58.37/58.57 % : [Kam94] Kamps (1994), Email to G. Sutcliffe % 58.37/58.57 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 58.37/58.57 % Source : [Kam94] % 58.37/58.57 % Names : % 58.37/58.57 % 58.37/58.57 % Status : Theorem % 58.37/58.57 % Rating : 0.00 v9.3.0, 0.10 v9.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.1.0, 0.08 v6.0.0, 0.50 v5.5.0, 0.12 v5.4.0, 0.13 v5.3.0, 0.22 v5.2.0, 0.00 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.1.0 % 58.37/58.57 % Syntax : Number of formulae : 4 ( 0 unt; 0 def) % 58.37/58.57 % Number of atoms : 38 ( 0 equ) % 58.37/58.57 % Maximal formula atoms : 13 ( 9 avg) % 58.37/58.57 % Number of connectives : 36 ( 2 ~; 0 |; 30 &) % 58.37/58.57 % ( 0 <=>; 4 =>; 0 <=; 0 <~>) % 58.37/58.57 % Maximal formula depth : 22 ( 17 avg) % 58.37/58.57 % Maximal term depth : 1 ( 1 avg) % 58.37/58.57 % Number of predicates : 7 ( 7 usr; 0 prp; 2-3 aty) % 58.37/58.57 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 58.37/58.57 % Number of variables : 30 ( 29 !; 1 ?) % 58.37/58.57 % SPC : FOF_THM_RFO_NEQ % 58.37/58.57 % 58.37/58.57 % Comments : "Not published due to publication constraints." [Kam95]. % 58.37/58.57 %-------------------------------------------------------------------------- % 58.37/58.57 fof(mp5,axiom, % 58.37/58.57 ! [X,T] : % 58.37/58.57 ( organization(X,T) % 58.37/58.57 => ? [I] : inertia(X,I,T) ) ). % 58.37/58.57 % 58.37/58.57 fof(a12_FOL,hypothesis, % 58.37/58.57 ! [X,Y,C,C1,C2,I1,I2,T1,T2] : % 58.37/58.57 ( ( organization(X,T1) % 58.37/58.57 & organization(Y,T2) % 58.37/58.57 & class(X,C,T1) % 58.37/58.57 & class(Y,C,T2) % 58.37/58.57 & complexity(X,C1,T1) % 58.37/58.57 & complexity(Y,C2,T2) % 58.37/58.57 & inertia(X,I1,T1) % 58.37/58.57 & inertia(Y,I2,T2) % 58.37/58.57 & greater(C2,C1) ) % 58.37/58.57 => greater(I2,I1) ) ). % 58.37/58.57 % 58.37/58.57 %----The higher inertia an organization has at the beginning of % 58.37/58.57 %----reorganization, the sooner disbending due to reorganization % 58.37/58.57 %----(possibly) happens - i.e., the shorter is the reorganization. % 58.37/58.57 fof(a14_FOL,hypothesis, % 58.37/58.57 ! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] : % 58.37/58.57 ( ( organization(X,Ta) % 58.37/58.57 & organization(Y,Ta) % 58.37/58.57 & ~ organization(Y,Tc) % 58.37/58.57 & class(X,C,Ta) % 58.37/58.57 & class(Y,C,Ta) % 58.37/58.57 & reorganization(X,Ta,Tb) % 58.37/58.57 & reorganization(Y,Ta,Tc) % 58.37/58.57 & reorganization_type(X,Rt,Ta) % 58.37/58.57 & reorganization_type(Y,Rt,Ta) % 58.37/58.57 & inertia(X,I1,Ta) % 58.37/58.57 & inertia(Y,I2,Ta) % 58.37/58.57 & greater(I2,I1) ) % 58.37/58.57 => greater(Tb,Tc) ) ). % 58.37/58.57 % 58.37/58.57 fof(t16_FOL,conjecture, % 58.37/58.57 ! [X,Y,Rt,C,C1,C2,Ta,Tb,Tc] : % 58.37/58.57 ( ( organization(X,Ta) % 58.37/58.57 & organization(Y,Ta) % 58.37/58.57 & ~ organization(Y,Tc) % 58.37/58.57 & class(X,C,Ta) % 58.37/58.57 & class(Y,C,Ta) % 58.37/58.57 & reorganization(X,Ta,Tb) % 58.37/58.57 & reorganization(Y,Ta,Tc) % 58.37/58.57 & reorganization_type(X,Rt,Ta) % 58.37/58.57 & reorganization_type(Y,Rt,Ta) % 58.37/58.57 & complexity(X,C1,Ta) % 58.37/58.57 & complexity(Y,C2,Ta) % 58.37/58.57 & greater(C2,C1) ) % 58.37/58.57 => greater(Tb,Tc) ) ). % 58.37/58.57 % 58.37/58.57 %-------------------------------------------------------------------------- % 58.37/58.57 %------------------------------------------- % 58.37/58.57 % Proof found % 58.37/58.57 % SZS status Theorem for theBenchmark % 58.37/58.57 % SZS output start Proof % 58.37/58.57 %ClaNum:16(EqnAxiom:0) % 58.37/58.57 %VarNum:66(SingletonVarNum:20) % 58.37/58.57 %MaxLitNum:13 % 58.37/58.57 %MaxfuncDepth:1 % 58.37/58.57 %SharedTerms:22 % 58.37/58.57 %goalClause: 1 2 3 4 5 6 7 8 9 10 11 12 13 % 58.37/58.57 %singleGoalClaCount:13 % 58.37/58.57 [1]P1(a1,a4) % 58.37/58.57 [2]P1(a5,a4) % 58.37/58.57 [3]P2(a6,a7) % 58.37/58.57 [4]P3(a1,a8,a4) % 58.37/58.57 [5]P3(a5,a8,a4) % 58.37/58.57 [6]P4(a1,a7,a4) % 58.37/58.57 [7]P4(a5,a6,a4) % 58.37/58.57 [8]P6(a1,a4,a10) % 58.37/58.57 [9]P6(a5,a4,a2) % 58.37/58.57 [10]P7(a1,a9,a4) % 58.37/58.57 [11]P7(a5,a9,a4) % 58.37/58.57 [12]~P1(a5,a2) % 58.37/58.57 [13]~P2(a10,a2) % 58.37/58.57 [14]~P1(x141,x142)+P5(x141,f3(x141,x142),x142) % 58.37/58.57 [15]~P5(x153,x151,x154)+~P5(x155,x152,x156)+~P3(x155,x159,x156)+~P4(x153,x157,x154)+~P4(x155,x158,x156)+P2(x151,x152)+~P1(x153,x154)+~P3(x153,x159,x154)+~P1(x155,x156)+~P2(x157,x158) % 58.37/58.57 [16]~P5(x161,x166,x164)+~P5(x165,x167,x164)+~P3(x165,x168,x164)+~P6(x161,x164,x162)+~P6(x165,x164,x163)+~P7(x165,x169,x164)+P1(x161,x162)+P2(x163,x162)+~P1(x161,x164)+~P1(x165,x164)+~P3(x161,x168,x164)+~P7(x161,x169,x164)+~P2(x166,x167) % 58.37/58.57 %EqnAxiom % 58.37/58.57 % 58.37/58.57 %------------------------------------------- % 58.60/58.73 cnf(151775,plain, % 58.60/58.73 (P5(a1,f3(a1,a4),a4)), % 58.60/58.73 inference(scs_inference,[],[1,14])). % 58.60/58.73 cnf(151779,plain, % 58.60/58.73 (P5(a5,f3(a5,a4),a4)), % 58.60/58.73 inference(scs_inference,[],[2,14])). % 58.60/58.73 cnf(151791,plain, % 58.60/58.73 (~P2(f3(a5,a4),f3(a1,a4))), % 58.60/58.73 inference(scs_inference,[],[1,151779,151775,8,10,9,11,12,6,5,4,2,13,3,15,16])). % 58.60/58.73 cnf(151804,plain, % 58.60/58.73 ($false), % 58.60/58.73 inference(scs_inference,[],[1,151791,151779,151775,6,4,5,2,7,3,15]), % 58.60/58.73 ['proof']). % 58.60/58.78 % SZS output end Proof % 58.60/58.78 % Total time :58.017850s %------------------------------------------------------------------------------