%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT036-2 : 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 : n027.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:18 AM UTC 2026 % Result : Unsatisfiable 0.47s 0.61s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.04 % Problem : MGT036-2 : TPTP v9.3.0. Released v2.4.0. % 0.00/0.04 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.15/0.41 % Computer : n027.cluster.edu % 0.15/0.41 % Model : x86_64 x86_64 % 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.41 % Memory : 8046.5625MB % 0.15/0.41 % OS : Linux 6.8.0-71-generic % 0.15/0.41 % CPULimit : 300 % 0.15/0.41 % WCLimit : 300 % 0.15/0.41 % DateTime : Mon Sep 7 12:44:30 UTC 2026 % 0.15/0.41 % CPUTime : % 0.29/0.57 start to proof:theBenchmark % 0.29/0.60 %------------------------------------------- % 0.29/0.60 % File :CSE---1.7 % 0.29/0.60 % Problem :theBenchmark % 0.29/0.60 % Transform :cnf % 0.29/0.60 % Format :tptp:raw % 0.29/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.29/0.60 % 0.29/0.60 % Result :Theorem 0.023309s % 0.29/0.60 % Output :CNFRefutation 0.023309s % 0.29/0.60 %------------------------------------------- % 0.29/0.60 %-------------------------------------------------------------------------- % 0.29/0.61 % File : MGT036-2 : TPTP v9.3.0. Released v2.4.0. % 0.29/0.61 % Domain : Management (Organisation Theory) % 0.29/0.61 % Problem : First movers never outcompete efficient producers. % 0.29/0.61 % Version : [PM93] axioms. % 0.29/0.61 % English : % 0.29/0.61 % 0.29/0.61 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg % 0.29/0.61 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg % 0.29/0.61 % : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing % 0.29/0.61 % Source : [TPTP] % 0.29/0.61 % Names : % 0.29/0.61 % 0.29/0.61 % Status : Unsatisfiable % 0.29/0.61 % Rating : 0.00 v9.3.0, 0.08 v9.1.0, 0.00 v6.1.0, 0.14 v5.5.0, 0.12 v5.4.0, 0.00 v2.4.0 % 0.29/0.61 % Syntax : Number of clauses : 14 ( 4 unt; 1 nHn; 12 RR) % 0.29/0.61 % Number of literals : 38 ( 0 equ; 24 neg) % 0.29/0.61 % Maximal clause size : 5 ( 2 avg) % 0.29/0.61 % Maximal term depth : 2 ( 1 avg) % 0.29/0.61 % Number of predicates : 6 ( 6 usr; 0 prp; 1-4 aty) % 0.29/0.61 % Number of functors : 7 ( 7 usr; 5 con; 0-2 aty) % 0.29/0.61 % Number of variables : 35 ( 6 sgn) % 0.29/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.29/0.61 % 0.29/0.61 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT036+2.p % 0.29/0.61 %-------------------------------------------------------------------------- % 0.29/0.61 cnf(mp_symmetry_of_subpopulations_1,axiom, % 0.29/0.61 ( ~ environment(A) % 0.29/0.61 | ~ subpopulations(B,C,A,D) % 0.29/0.61 | subpopulations(C,B,A,D) ) ). % 0.29/0.61 % 0.29/0.61 cnf(mp_time_point_occur_2,axiom, % 0.29/0.61 ( ~ environment(A) % 0.29/0.61 | ~ subpopulations(first_movers,efficient_producers,A,B) % 0.29/0.61 | in_environment(A,B) ) ). % 0.29/0.61 % 0.29/0.61 cnf(mp_growth_rate_relationships_3,axiom, % 0.29/0.61 ( environment(A) % 0.29/0.61 | ~ greater(zero,growth_rate(B,C)) ) ). % 0.29/0.61 % 0.29/0.61 cnf(mp_growth_rate_relationships_4,axiom, % 0.29/0.61 ( subpopulations(A,B,C,D) % 0.29/0.61 | ~ greater(zero,growth_rate(A,D)) ) ). % 0.29/0.61 % 0.47/0.61 cnf(mp_growth_rate_relationships_5,axiom, % 0.47/0.61 ( ~ greater_or_equal(growth_rate(A,B),zero) % 0.47/0.61 | ~ greater(zero,growth_rate(A,B)) ) ). % 0.47/0.61 % 0.47/0.61 cnf(mp_growth_rate_relationships_6,axiom, % 0.47/0.61 ( greater(zero,growth_rate(A,B)) % 0.47/0.61 | ~ environment(C) % 0.47/0.61 | ~ subpopulations(A,D,C,B) % 0.47/0.61 | greater_or_equal(growth_rate(A,B),zero) ) ). % 0.47/0.61 % 0.47/0.61 cnf(d2_7,hypothesis, % 0.47/0.61 ( ~ environment(A) % 0.47/0.61 | ~ subpopulations(B,C,A,D) % 0.47/0.61 | ~ greater_or_equal(growth_rate(C,D),zero) % 0.47/0.61 | ~ greater(zero,growth_rate(B,D)) % 0.47/0.61 | outcompetes(C,B,D) ) ). % 0.47/0.61 % 0.47/0.61 cnf(d2_8,hypothesis, % 0.47/0.61 ( ~ environment(A) % 0.47/0.61 | ~ subpopulations(B,C,A,D) % 0.47/0.61 | ~ outcompetes(C,B,D) % 0.47/0.61 | greater_or_equal(growth_rate(C,D),zero) ) ). % 0.47/0.61 % 0.47/0.61 cnf(d2_9,hypothesis, % 0.47/0.61 ( ~ environment(A) % 0.47/0.61 | ~ subpopulations(B,C,A,D) % 0.47/0.61 | ~ outcompetes(C,B,D) % 0.47/0.61 | greater(zero,growth_rate(B,D)) ) ). % 0.47/0.61 % 0.47/0.61 cnf(a2_10,hypothesis, % 0.47/0.61 greater(resilience(efficient_producers),resilience(first_movers)) ). % 0.47/0.61 % 0.47/0.61 cnf(a13_11,hypothesis, % 0.47/0.61 ( ~ environment(A) % 0.47/0.61 | ~ in_environment(A,B) % 0.47/0.61 | greater(zero,growth_rate(C,B)) % 0.47/0.61 | ~ greater(resilience(D),resilience(C)) % 0.47/0.61 | ~ greater(zero,growth_rate(D,B)) ) ). % 0.47/0.61 % 0.47/0.61 cnf(prove_t5_12,negated_conjecture, % 0.47/0.61 environment(sk1) ). % 0.47/0.61 % 0.47/0.61 cnf(prove_t5_13,negated_conjecture, % 0.47/0.61 subpopulations(first_movers,efficient_producers,sk1,sk2) ). % 0.47/0.61 % 0.47/0.61 cnf(prove_t5_14,negated_conjecture, % 0.47/0.61 outcompetes(first_movers,efficient_producers,sk2) ). % 0.47/0.61 % 0.47/0.61 %-------------------------------------------------------------------------- % 0.47/0.61 %------------------------------------------- % 0.47/0.61 % Proof found % 0.47/0.61 % SZS status Theorem for theBenchmark % 0.47/0.61 % SZS output start Proof % 0.47/0.61 %ClaNum:14(EqnAxiom:0) % 0.47/0.61 %VarNum:77(SingletonVarNum:35) % 0.47/0.61 %MaxLitNum:5 % 0.47/0.61 %MaxfuncDepth:1 % 0.47/0.61 %SharedTerms:11 % 0.47/0.61 %goalClause: 1 3 4 % 0.47/0.61 %singleGoalClaCount:3 % 0.47/0.61 [1]P1(a1) % 0.47/0.61 [3]P3(a4,a2,a6) % 0.47/0.61 [4]P6(a4,a2,a1,a6) % 0.47/0.61 [2]P2(f3(a2),f3(a4)) % 0.47/0.61 [6]~P2(a7,f5(x61,x62))+~P4(f5(x61,x62),a7) % 0.47/0.61 [5]P1(x51)+~P2(a7,f5(x52,x53)) % 0.47/0.61 [8]P6(x81,x82,x83,x84)+~P2(a7,f5(x81,x84)) % 0.47/0.61 [9]~P1(x91)+P5(x91,x92)+~P6(a4,a2,x91,x92) % 0.47/0.61 [14]~P1(x143)+~P6(x142,x141,x143,x144)+P6(x141,x142,x143,x144) % 0.47/0.61 [10]~P6(x101,x104,x103,x102)+~P1(x103)+P2(a7,f5(x101,x102))+P4(f5(x101,x102),a7) % 0.47/0.61 [11]~P6(x111,x114,x113,x112)+~P3(x114,x111,x112)+~P1(x113)+P2(a7,f5(x111,x112)) % 0.47/0.61 [12]~P6(x124,x121,x123,x122)+~P3(x121,x124,x122)+~P1(x123)+P4(f5(x121,x122),a7) % 0.47/0.61 [7]~P5(x73,x72)+~P1(x73)+~P2(f3(x74),f3(x71))+P2(a7,f5(x71,x72))+~P2(a7,f5(x74,x72)) % 0.47/0.61 [13]~P6(x132,x131,x134,x133)+P3(x131,x132,x133)+~P1(x134)+~P2(a7,f5(x132,x133))+~P4(f5(x131,x133),a7) % 0.47/0.61 %EqnAxiom % 0.47/0.61 % 0.47/0.61 %------------------------------------------- % 0.47/0.62 cnf(15,plain, % 0.47/0.62 (P5(a1,a6)), % 0.47/0.62 inference(scs_inference,[],[1,4,9])). % 0.47/0.62 cnf(22,plain, % 0.47/0.62 (P1(x221)+P4(f5(a4,a6),a7)), % 0.47/0.62 inference(scs_inference,[],[1,4,5,10])). % 0.47/0.62 cnf(23,plain, % 0.47/0.62 (P6(a2,a4,a1,a6)+P4(f5(a4,a6),a7)), % 0.47/0.62 inference(scs_inference,[],[4,22,14])). % 0.47/0.62 cnf(24,plain, % 0.47/0.62 (P4(f5(a4,a6),a7)), % 0.47/0.62 inference(scs_inference,[],[3,1,23,12])). % 0.47/0.62 cnf(25,plain, % 0.47/0.62 (P2(a7,f5(a4,a6))+~P2(a7,f5(a2,a6))+~P2(a7,f5(x251,x252))), % 0.47/0.62 inference(scs_inference,[],[2,15,5,7])). % 0.47/0.62 cnf(26,plain, % 0.47/0.62 (P2(a7,f5(a4,a6))+~P2(a7,f5(a2,a6))), % 0.47/0.62 inference(factoring_inference,[],[25])). % 0.47/0.62 cnf(27,plain, % 0.47/0.62 (~P2(a7,f5(a2,a6))), % 0.47/0.62 inference(scs_inference,[],[24,26,6])). % 0.47/0.62 cnf(30,plain, % 0.47/0.62 ($false), % 0.47/0.62 inference(scs_inference,[],[3,4,1,27,11,14]), % 0.47/0.62 ['proof']). % 0.47/0.62 % SZS output end Proof % 0.47/0.62 % Total time :0.023309s %------------------------------------------------------------------------------