%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT014-1 : TPTP v9.3.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n026.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 6.23s 6.45s % 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.4.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.35 % Computer : n026.cluster.edu % 0.09/0.35 % Model : x86_64 x86_64 % 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.35 % Memory : 8046.5625MB % 0.09/0.35 % OS : Linux 6.8.0-71-generic % 0.09/0.35 % CPULimit : 300 % 0.09/0.35 % WCLimit : 300 % 0.09/0.35 % DateTime : Mon Sep 7 11:55:57 UTC 2026 % 0.09/0.36 % CPUTime : % 0.27/0.46 start to proof:theBenchmark % 6.23/6.44 %------------------------------------------- % 6.23/6.44 % File :CSE---1.7 % 6.23/6.44 % Problem :theBenchmark % 6.23/6.44 % Transform :cnf % 6.23/6.44 % Format :tptp:raw % 6.23/6.44 % Command :java -jar mcs_scs.jar %d %s % 6.23/6.44 % 6.23/6.44 % Result :Theorem 5.973124s % 6.23/6.44 % Output :CNFRefutation 5.973124s % 6.23/6.44 %------------------------------------------- % 6.23/6.44 %-------------------------------------------------------------------------- % 6.23/6.44 % File : MGT014-1 : TPTP v9.3.0. Released v2.4.0. % 6.23/6.44 % Domain : Management (Organisation Theory) % 6.23/6.44 % Problem : If orgainzation size increases, its complexity cannot decrease % 6.23/6.44 % Version : [PB+94] axioms. % 6.23/6.44 % English : If the size of an organization gets bigger, its complexity % 6.23/6.44 % cannot get smaller (in lack of reorganization). % 6.23/6.44 % 6.23/6.44 % Refs : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 6.23/6.44 % : [Kam94] Kamps (1994), Email to G. Sutcliffe % 6.23/6.44 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 6.23/6.44 % Source : [TPTP] % 6.23/6.44 % Names : % 6.23/6.44 % 6.23/6.44 % Status : Unsatisfiable % 6.23/6.44 % 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 % 6.23/6.44 % Syntax : Number of clauses : 17 ( 9 unt; 1 nHn; 17 RR) % 6.23/6.45 % Number of literals : 42 ( 4 equ; 27 neg) % 6.23/6.45 % Maximal clause size : 7 ( 2 avg) % 6.23/6.45 % Maximal term depth : 1 ( 1 avg) % 6.23/6.45 % Number of predicates : 7 ( 6 usr; 0 prp; 1-3 aty) % 6.23/6.45 % Number of functors : 7 ( 7 usr; 7 con; 0-0 aty) % 6.23/6.45 % Number of variables : 26 ( 1 sgn) % 6.23/6.45 % SPC : CNF_UNS_EPR_SEQ_NHN % 6.23/6.45 % 6.23/6.45 % Comments : "Not published due to publication constraints." [Kam95]. % 6.23/6.45 % : Created with tptp2X -f tptp -t clausify:otter MGT014+1.p % 6.23/6.45 %-------------------------------------------------------------------------- % 6.23/6.45 cnf(mp6_1_18,axiom, % 6.23/6.45 ( ~ greater(A,B) % 6.23/6.45 | A != B ) ). % 6.23/6.45 % 6.23/6.45 cnf(mp6_2_19,axiom, % 6.23/6.45 ( ~ greater(A,B) % 6.23/6.45 | ~ greater(B,A) ) ). % 6.23/6.45 % 6.23/6.45 cnf(mp15_20,axiom, % 6.23/6.45 ( ~ organization(A,B) % 6.23/6.45 | time(B) ) ). % 6.23/6.45 % 6.23/6.45 cnf(mp16_21,axiom, % 6.23/6.45 ( ~ time(A) % 6.23/6.45 | ~ time(B) % 6.23/6.45 | greater(A,B) % 6.23/6.45 | A = B % 6.23/6.45 | greater(B,A) ) ). % 6.23/6.45 % 6.23/6.45 cnf(mp17_22,axiom, % 6.23/6.45 ( ~ reorganization_free(A,B,C) % 6.23/6.45 | reorganization_free(A,C,B) ) ). % 6.23/6.45 % 6.23/6.45 cnf(mp19_23,axiom, % 6.23/6.45 ( ~ organization(A,B) % 6.23/6.45 | ~ organization(A,C) % 6.23/6.45 | ~ size(A,D,B) % 6.23/6.45 | ~ size(A,E,C) % 6.23/6.45 | B != C % 6.23/6.45 | D = E ) ). % 6.23/6.45 % 6.23/6.45 cnf(t11_FOL_24,hypothesis, % 6.23/6.45 ( ~ organization(A,B) % 6.23/6.45 | ~ organization(A,C) % 6.23/6.45 | ~ reorganization_free(A,B,C) % 6.23/6.45 | ~ size(A,D,B) % 6.23/6.45 | ~ size(A,E,C) % 6.23/6.45 | ~ greater(C,B) % 6.23/6.45 | ~ greater(D,E) ) ). % 6.23/6.45 % 6.23/6.45 cnf(t12_FOL_25,hypothesis, % 6.23/6.45 ( ~ organization(A,B) % 6.23/6.45 | ~ organization(A,C) % 6.23/6.45 | ~ reorganization_free(A,B,C) % 6.23/6.45 | ~ complexity(A,D,B) % 6.23/6.45 | ~ complexity(A,E,C) % 6.23/6.45 | ~ greater(C,B) % 6.23/6.45 | ~ greater(D,E) ) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_26,negated_conjecture, % 6.23/6.45 organization(sk1,sk6) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_27,negated_conjecture, % 6.23/6.45 organization(sk1,sk7) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_28,negated_conjecture, % 6.23/6.45 reorganization_free(sk1,sk6,sk7) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_29,negated_conjecture, % 6.23/6.45 complexity(sk1,sk2,sk6) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_30,negated_conjecture, % 6.23/6.45 complexity(sk1,sk3,sk7) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_31,negated_conjecture, % 6.23/6.45 size(sk1,sk4,sk6) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_32,negated_conjecture, % 6.23/6.45 size(sk1,sk5,sk7) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_33,negated_conjecture, % 6.23/6.45 greater(sk5,sk4) ). % 6.23/6.45 % 6.23/6.45 cnf(t14_FOL_34,negated_conjecture, % 6.23/6.45 greater(sk2,sk3) ). % 6.23/6.45 % 6.23/6.45 %-------------------------------------------------------------------------- % 6.23/6.45 %------------------------------------------- % 6.23/6.45 % Proof found % 6.23/6.45 % SZS status Theorem for theBenchmark % 6.23/6.45 % SZS output start Proof % 6.23/6.45 %ClaNum:34(EqnAxiom:17) % 6.23/6.45 %VarNum:73(SingletonVarNum:26) % 6.23/6.45 %MaxLitNum:7 % 6.23/6.45 %MaxfuncDepth:0 % 6.23/6.45 %SharedTerms:16 % 6.23/6.45 %goalClause: 18 19 20 21 22 23 24 25 26 % 6.23/6.45 %singleGoalClaCount:9 % 6.23/6.45 [18]P1(a1,a3) % 6.23/6.45 [19]P1(a4,a5) % 6.23/6.45 [20]P3(a2,a6) % 6.23/6.45 [21]P3(a2,a7) % 6.23/6.45 [22]P4(a2,a6,a7) % 6.23/6.45 [23]P5(a2,a5,a6) % 6.23/6.45 [24]P5(a2,a4,a7) % 6.23/6.45 [25]P2(a2,a1,a6) % 6.23/6.45 [26]P2(a2,a3,a7) % 6.23/6.45 [27]~P1(x271,x272)+~E(x271,x272) % 6.23/6.45 [28]P6(x281)+~P3(x282,x281) % 6.23/6.45 [29]~P1(x292,x291)+~P1(x291,x292) % 6.23/6.45 [31]~P4(x311,x313,x312)+P4(x311,x312,x313) % 6.23/6.45 [30]P1(x302,x301)+P1(x301,x302)+~P6(x302)+~P6(x301)+E(x301,x302) % 6.23/6.45 [32]~P3(x325,x323)+~P5(x325,x322,x324)+~P5(x325,x321,x323)+E(x321,x322)+~E(x323,x324)+~P3(x325,x324) % 6.23/6.45 [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.23/6.45 [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.23/6.45 %EqnAxiom % 6.23/6.45 [1]E(x11,x11) % 6.23/6.45 [2]E(x22,x21)+~E(x21,x22) % 6.23/6.45 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 6.23/6.45 [4]P1(x42,x43)+~E(x41,x42)+~P1(x41,x43) % 6.23/6.45 [5]P1(x53,x52)+~E(x51,x52)+~P1(x53,x51) % 6.23/6.45 [6]P2(x62,x63,x64)+~E(x61,x62)+~P2(x61,x63,x64) % 6.23/6.45 [7]P2(x73,x72,x74)+~E(x71,x72)+~P2(x73,x71,x74) % 6.23/6.45 [8]P2(x83,x84,x82)+~E(x81,x82)+~P2(x83,x84,x81) % 6.23/6.45 [9]P3(x92,x93)+~E(x91,x92)+~P3(x91,x93) % 6.23/6.45 [10]P3(x103,x102)+~E(x101,x102)+~P3(x103,x101) % 6.23/6.45 [11]P5(x112,x113,x114)+~E(x111,x112)+~P5(x111,x113,x114) % 6.23/6.45 [12]P5(x123,x122,x124)+~E(x121,x122)+~P5(x123,x121,x124) % 6.23/6.45 [13]P5(x133,x134,x132)+~E(x131,x132)+~P5(x133,x134,x131) % 6.23/6.45 [14]P4(x142,x143,x144)+~E(x141,x142)+~P4(x141,x143,x144) % 6.23/6.45 [15]P4(x153,x152,x154)+~E(x151,x152)+~P4(x153,x151,x154) % 6.23/6.45 [16]P4(x163,x164,x162)+~E(x161,x162)+~P4(x163,x164,x161) % 6.23/6.45 [17]~P6(x171)+P6(x172)+~E(x171,x172) % 6.23/6.45 % 6.23/6.45 %------------------------------------------- % 6.23/6.45 cnf(35,plain, % 6.23/6.45 (~P1(x351,x351)), % 6.23/6.45 inference(equality_inference,[],[27])). % 6.23/6.45 cnf(58,plain, % 6.23/6.45 (~P1(x581,x581)), % 6.23/6.45 inference(rename_variables,[],[35])). % 6.23/6.45 cnf(59,plain, % 6.23/6.45 (~E(a4,a5)), % 6.23/6.45 inference(scs_inference,[],[19,35,58,29,5,4])). % 6.23/6.45 cnf(81,plain, % 6.23/6.45 (P3(x811,a7)+~E(a2,x811)), % 6.23/6.45 inference(scs_inference,[],[21,9])). % 6.23/6.45 cnf(91,plain, % 6.23/6.45 (~E(a7,a6)), % 6.23/6.45 inference(scs_inference,[],[20,24,23,59,13,32])). % 6.23/6.45 cnf(107,plain, % 6.23/6.45 (~E(a6,x1071)+P6(x1071)), % 6.23/6.45 inference(scs_inference,[],[20,28,17])). % 6.23/6.45 cnf(108,plain, % 6.23/6.45 (P6(a6)), % 6.23/6.45 inference(equality_inference,[],[107])). % 6.23/6.45 cnf(142,plain, % 6.23/6.45 (P4(x1421,a7,a6)+~E(a2,x1421)), % 6.23/6.45 inference(scs_inference,[],[22,31,14])). % 6.23/6.45 cnf(143,plain, % 6.23/6.45 (P4(a2,a7,a6)), % 6.23/6.45 inference(equality_inference,[],[142])). % 6.23/6.45 cnf(338,plain, % 6.23/6.45 (P6(a7)+~E(a2,x3381)), % 6.23/6.45 inference(scs_inference,[],[28,81])). % 6.23/6.45 cnf(339,plain, % 6.23/6.45 (P6(a7)), % 6.23/6.45 inference(equality_inference,[],[338])). % 6.23/6.45 cnf(1407,plain, % 6.23/6.45 (~P1(a7,a6)), % 6.23/6.45 inference(scs_inference,[],[18,20,22,26,25,81,34])). % 6.23/6.45 cnf(1408,plain, % 6.23/6.45 (P1(a6,a7)), % 6.23/6.45 inference(scs_inference,[],[1407,339,91,108,30])). % 6.23/6.45 cnf(1869,plain, % 6.23/6.45 ($false), % 6.23/6.45 inference(scs_inference,[],[19,1408,20,143,23,24,81,33]), % 6.23/6.45 ['proof']). % 6.23/6.45 % SZS output end Proof % 6.23/6.45 % Total time :5.973124s %------------------------------------------------------------------------------