%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT013-1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n013.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 : Unsatisfiable 4.36s 4.56s % 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.4.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.08/0.35 % Computer : n013.cluster.edu % 0.08/0.35 % Model : x86_64 x86_64 % 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.35 % Memory : 8046.5625MB % 0.08/0.35 % OS : Linux 6.8.0-71-generic % 0.08/0.35 % CPULimit : 300 % 0.08/0.35 % WCLimit : 300 % 0.08/0.35 % DateTime : Mon Sep 7 11:51:35 UTC 2026 % 0.08/0.35 % CPUTime : % 0.24/0.52 start to proof:theBenchmark % 4.36/4.55 %------------------------------------------- % 4.36/4.55 % File :CSE---1.7 % 4.36/4.55 % Problem :theBenchmark % 4.36/4.55 % Transform :cnf % 4.36/4.55 % Format :tptp:raw % 4.36/4.55 % Command :java -jar mcs_scs.jar %d %s % 4.36/4.55 % 4.36/4.55 % Result :Theorem 4.058395s % 4.36/4.55 % Output :CNFRefutation 4.058395s % 4.36/4.55 %------------------------------------------- % 4.36/4.55 %-------------------------------------------------------------------------- % 4.36/4.55 % File : MGT013-1 : TPTP v9.3.0. Released v2.4.0. % 4.36/4.55 % Domain : Management (Organisation Theory) % 4.36/4.55 % Problem : If organization complexity increases, its size cannot decrease % 4.36/4.55 % Version : [PB+94] axioms. % 4.36/4.55 % English : If the complexity of an organization gets bigger, its size % 4.36/4.55 % cannot get smaller (in lack of reorganization). % 4.36/4.56 % 4.36/4.56 % Refs : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 4.36/4.56 % : [Kam94] Kamps (1994), Email to G. Sutcliffe % 4.36/4.56 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 4.36/4.56 % Source : [TPTP] % 4.36/4.56 % Names : % 4.36/4.56 % 4.36/4.56 % Status : Unsatisfiable % 4.36/4.56 % Rating : 0.12 v9.1.0, 0.11 v9.0.0, 0.20 v8.2.0, 0.00 v2.6.0, 0.11 v2.5.0, 0.00 v2.4.0 % 4.36/4.56 % Syntax : Number of clauses : 17 ( 9 unt; 1 nHn; 17 RR) % 4.36/4.56 % Number of literals : 42 ( 4 equ; 27 neg) % 4.36/4.56 % Maximal clause size : 7 ( 2 avg) % 4.36/4.56 % Maximal term depth : 1 ( 1 avg) % 4.36/4.56 % Number of predicates : 7 ( 6 usr; 0 prp; 1-3 aty) % 4.36/4.56 % Number of functors : 7 ( 7 usr; 7 con; 0-0 aty) % 4.36/4.56 % Number of variables : 26 ( 1 sgn) % 4.36/4.56 % SPC : CNF_UNS_EPR_SEQ_NHN % 4.36/4.56 % 4.36/4.56 % Comments : "Not published due to publication constraints." [Kam95]. % 4.36/4.56 % : Created with tptp2X -f tptp -t clausify:otter MGT013+1.p % 4.36/4.56 %-------------------------------------------------------------------------- % 4.36/4.56 cnf(mp6_1_18,axiom, % 4.36/4.56 ( ~ greater(A,B) % 4.36/4.56 | A != B ) ). % 4.36/4.56 % 4.36/4.56 cnf(mp6_2_19,axiom, % 4.36/4.56 ( ~ greater(A,B) % 4.36/4.56 | ~ greater(B,A) ) ). % 4.36/4.56 % 4.36/4.56 cnf(mp15_20,axiom, % 4.36/4.56 ( ~ organization(A,B) % 4.36/4.56 | time(B) ) ). % 4.36/4.56 % 4.36/4.56 cnf(mp16_21,axiom, % 4.36/4.56 ( ~ time(A) % 4.36/4.56 | ~ time(B) % 4.36/4.56 | greater(A,B) % 4.36/4.56 | A = B % 4.36/4.56 | greater(B,A) ) ). % 4.36/4.56 % 4.36/4.56 cnf(mp17_22,axiom, % 4.36/4.56 ( ~ reorganization_free(A,B,C) % 4.36/4.56 | reorganization_free(A,C,B) ) ). % 4.36/4.56 % 4.36/4.56 cnf(mp18_23,axiom, % 4.36/4.56 ( ~ organization(A,B) % 4.36/4.56 | ~ organization(A,C) % 4.36/4.56 | ~ complexity(A,D,B) % 4.36/4.56 | ~ complexity(A,E,C) % 4.36/4.56 | B != C % 4.36/4.56 | D = E ) ). % 4.36/4.56 % 4.36/4.56 cnf(t11_FOL_24,hypothesis, % 4.36/4.56 ( ~ organization(A,B) % 4.36/4.56 | ~ organization(A,C) % 4.36/4.56 | ~ reorganization_free(A,B,C) % 4.36/4.56 | ~ size(A,D,B) % 4.36/4.56 | ~ size(A,E,C) % 4.36/4.56 | ~ greater(C,B) % 4.36/4.56 | ~ greater(D,E) ) ). % 4.36/4.56 % 4.36/4.56 cnf(t12_FOL_25,hypothesis, % 4.36/4.56 ( ~ organization(A,B) % 4.36/4.56 | ~ organization(A,C) % 4.36/4.56 | ~ reorganization_free(A,B,C) % 4.36/4.56 | ~ complexity(A,D,B) % 4.36/4.56 | ~ complexity(A,E,C) % 4.36/4.56 | ~ greater(C,B) % 4.36/4.56 | ~ greater(D,E) ) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_26,negated_conjecture, % 4.36/4.56 organization(sk1,sk6) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_27,negated_conjecture, % 4.36/4.56 organization(sk1,sk7) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_28,negated_conjecture, % 4.36/4.56 reorganization_free(sk1,sk6,sk7) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_29,negated_conjecture, % 4.36/4.56 complexity(sk1,sk2,sk6) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_30,negated_conjecture, % 4.36/4.56 complexity(sk1,sk3,sk7) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_31,negated_conjecture, % 4.36/4.56 size(sk1,sk4,sk6) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_32,negated_conjecture, % 4.36/4.56 size(sk1,sk5,sk7) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_33,negated_conjecture, % 4.36/4.56 greater(sk3,sk2) ). % 4.36/4.56 % 4.36/4.56 cnf(t13_FOL_34,negated_conjecture, % 4.36/4.56 greater(sk4,sk5) ). % 4.36/4.56 % 4.36/4.56 %-------------------------------------------------------------------------- % 4.36/4.56 %------------------------------------------- % 4.36/4.56 % Proof found % 4.36/4.56 % SZS status Theorem for theBenchmark % 4.36/4.56 % SZS output start Proof % 4.36/4.56 %ClaNum:34(EqnAxiom:17) % 4.36/4.56 %VarNum:73(SingletonVarNum:26) % 4.36/4.56 %MaxLitNum:7 % 4.36/4.56 %MaxfuncDepth:0 % 4.36/4.56 %SharedTerms:16 % 4.36/4.56 %goalClause: 18 19 20 21 22 23 24 25 26 % 4.36/4.56 %singleGoalClaCount:9 % 4.36/4.56 [18]P1(a1,a2) % 4.36/4.56 [19]P1(a4,a5) % 4.36/4.56 [20]P3(a3,a6) % 4.36/4.56 [21]P3(a3,a7) % 4.36/4.56 [22]P4(a3,a6,a7) % 4.36/4.56 [23]P2(a3,a2,a6) % 4.36/4.56 [24]P2(a3,a1,a7) % 4.36/4.56 [25]P5(a3,a4,a6) % 4.36/4.56 [26]P5(a3,a5,a7) % 4.36/4.56 [27]~P1(x271,x272)+~E(x271,x272) % 4.36/4.56 [28]P6(x281)+~P3(x282,x281) % 4.36/4.56 [29]~P1(x292,x291)+~P1(x291,x292) % 4.36/4.56 [31]~P4(x311,x313,x312)+P4(x311,x312,x313) % 4.36/4.56 [30]P1(x302,x301)+P1(x301,x302)+~P6(x302)+~P6(x301)+E(x301,x302) % 4.36/4.56 [32]~P3(x325,x323)+~P2(x325,x322,x324)+~P2(x325,x321,x323)+E(x321,x322)+~E(x323,x324)+~P3(x325,x324) % 4.36/4.56 [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.36/4.56 [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.36/4.56 %EqnAxiom % 4.36/4.56 [1]E(x11,x11) % 4.36/4.56 [2]E(x22,x21)+~E(x21,x22) % 4.36/4.56 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 4.36/4.56 [4]P1(x42,x43)+~E(x41,x42)+~P1(x41,x43) % 4.36/4.56 [5]P1(x53,x52)+~E(x51,x52)+~P1(x53,x51) % 4.36/4.56 [6]P5(x62,x63,x64)+~E(x61,x62)+~P5(x61,x63,x64) % 4.36/4.56 [7]P5(x73,x72,x74)+~E(x71,x72)+~P5(x73,x71,x74) % 4.36/4.56 [8]P5(x83,x84,x82)+~E(x81,x82)+~P5(x83,x84,x81) % 4.36/4.56 [9]P3(x92,x93)+~E(x91,x92)+~P3(x91,x93) % 4.36/4.56 [10]P3(x103,x102)+~E(x101,x102)+~P3(x103,x101) % 4.36/4.56 [11]P2(x112,x113,x114)+~E(x111,x112)+~P2(x111,x113,x114) % 4.36/4.56 [12]P2(x123,x122,x124)+~E(x121,x122)+~P2(x123,x121,x124) % 4.36/4.56 [13]P2(x133,x134,x132)+~E(x131,x132)+~P2(x133,x134,x131) % 4.36/4.56 [14]P4(x142,x143,x144)+~E(x141,x142)+~P4(x141,x143,x144) % 4.36/4.56 [15]P4(x153,x152,x154)+~E(x151,x152)+~P4(x153,x151,x154) % 4.36/4.56 [16]P4(x163,x164,x162)+~E(x161,x162)+~P4(x163,x164,x161) % 4.36/4.56 [17]~P6(x171)+P6(x172)+~E(x171,x172) % 4.36/4.56 % 4.36/4.56 %------------------------------------------- % 4.36/4.56 cnf(35,plain, % 4.36/4.56 (~P1(x351,x351)), % 4.36/4.56 inference(equality_inference,[],[27])). % 4.36/4.56 cnf(39,plain, % 4.36/4.56 (~E(a1,a2)), % 4.36/4.56 inference(scs_inference,[],[18,35,29,4])). % 4.36/4.56 cnf(40,plain, % 4.36/4.56 (~P1(x401,x401)), % 4.36/4.56 inference(rename_variables,[],[35])). % 4.36/4.56 cnf(46,plain, % 4.36/4.56 (P3(x461,a6)+~E(a3,x461)), % 4.36/4.56 inference(scs_inference,[],[18,35,40,20,25,29,4,5,6,7,8,9])). % 4.36/4.56 cnf(81,plain, % 4.36/4.56 (P2(a3,a2,x811)+~E(a6,x811)), % 4.36/4.56 inference(scs_inference,[],[23,26,22,15,6,12,8,13])). % 4.36/4.56 cnf(94,plain, % 4.36/4.56 (~P2(a3,a2,a7)), % 4.36/4.56 inference(scs_inference,[],[21,24,39,32])). % 4.36/4.56 cnf(97,plain, % 4.36/4.56 (~E(a6,a7)), % 4.36/4.56 inference(scs_inference,[],[94,81])). % 4.36/4.56 cnf(111,plain, % 4.36/4.56 (~E(a7,x1111)+P6(x1111)), % 4.36/4.56 inference(scs_inference,[],[21,28,17])). % 4.36/4.56 cnf(112,plain, % 4.36/4.56 (P6(a7)), % 4.36/4.56 inference(equality_inference,[],[111])). % 4.36/4.57 cnf(145,plain, % 4.36/4.57 (~P1(a6,a7)), % 4.36/4.57 inference(scs_inference,[],[22,18,20,21,23,24,31,33])). % 4.36/4.57 cnf(146,plain, % 4.36/4.57 (~P6(a6)+P1(a7,a6)), % 4.36/4.57 inference(scs_inference,[],[145,97,112,30])). % 4.36/4.57 cnf(720,plain, % 4.36/4.57 (P6(a6)+~E(a3,x7201)), % 4.36/4.57 inference(scs_inference,[],[28,46])). % 4.36/4.57 cnf(721,plain, % 4.36/4.57 (P6(a6)), % 4.36/4.57 inference(equality_inference,[],[720])). % 4.36/4.57 cnf(722,plain, % 4.36/4.57 (P1(a7,a6)), % 4.36/4.57 inference(scs_inference,[],[721,146])). % 4.36/4.57 cnf(1378,plain, % 4.36/4.57 ($false), % 4.36/4.57 inference(scs_inference,[],[20,21,26,25,22,19,722,34]), % 4.36/4.57 ['proof']). % 4.36/4.57 % SZS output end Proof % 4.36/4.57 % Total time :4.058395s %------------------------------------------------------------------------------