%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MGT041-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 : 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:20 AM UTC 2026 % Result : Unsatisfiable 0.25s 0.51s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT041-2 : 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.07/0.34 % Computer : n026.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 13:05:42 UTC 2026 % 0.07/0.34 % CPUTime : % 0.25/0.51 start to proof:theBenchmark % 0.25/0.51 %------------------------------------------- % 0.25/0.51 % File :CSE---1.7 % 0.25/0.51 % Problem :theBenchmark % 0.25/0.51 % Transform :cnf % 0.25/0.51 % Format :tptp:raw % 0.25/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.25/0.51 % 0.25/0.51 % Result :Theorem 0.003589s % 0.25/0.51 % Output :CNFRefutation 0.003589s % 0.25/0.51 %------------------------------------------- % 0.25/0.51 %-------------------------------------------------------------------------- % 0.25/0.51 % File : MGT041-2 : TPTP v9.3.0. Released v2.4.0. % 0.25/0.51 % Domain : Management (Organisation Theory) % 0.25/0.51 % Problem : There are non-FM and non-EP organisations % 0.25/0.51 % Version : [PM93] axioms. % 0.25/0.51 % English : There are non-first mover and non-efficient producers % 0.25/0.51 % organisations. % 0.25/0.51 % 0.25/0.51 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg % 0.25/0.51 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg % 0.25/0.51 % : [Kam95] Kamps (1995), Email to G. Sutcliffe % 0.25/0.51 % Source : [TPTP] % 0.25/0.51 % Names : % 0.25/0.51 % 0.25/0.51 % Status : Unsatisfiable % 0.25/0.51 % Rating : 0.00 v2.4.0 % 0.25/0.51 % Syntax : Number of clauses : 8 ( 4 unt; 1 nHn; 8 RR) % 0.25/0.51 % Number of literals : 17 ( 0 equ; 10 neg) % 0.25/0.51 % Maximal clause size : 4 ( 2 avg) % 0.25/0.51 % Maximal term depth : 1 ( 1 avg) % 0.25/0.51 % Number of predicates : 6 ( 6 usr; 0 prp; 1-3 aty) % 0.25/0.51 % Number of functors : 4 ( 4 usr; 4 con; 0-0 aty) % 0.25/0.51 % Number of variables : 8 ( 1 sgn) % 0.25/0.51 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.25/0.51 % 0.25/0.51 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT041+2.p % 0.25/0.51 %-------------------------------------------------------------------------- % 0.25/0.51 cnf(mp_not_high_and_low_1,axiom, % 0.25/0.51 ( ~ number_of_routines(A,B,low) % 0.25/0.51 | ~ number_of_routines(A,B,high) ) ). % 0.25/0.51 % 0.25/0.51 cnf(a14_2,hypothesis, % 0.25/0.51 ( ~ organisation_at_time(A,B) % 0.25/0.51 | ~ efficient_producer(A) % 0.25/0.51 | ~ founding_time(A,B) % 0.25/0.51 | has_elaborated_routines(A,B) ) ). % 0.25/0.51 % 0.25/0.51 cnf(a15_3,hypothesis, % 0.25/0.51 ( ~ organisation_at_time(A,B) % 0.25/0.51 | ~ first_mover(A) % 0.25/0.51 | ~ founding_time(A,B) % 0.25/0.51 | number_of_routines(A,B,low) ) ). % 0.25/0.51 % 0.25/0.51 cnf(a16_4,hypothesis, % 0.25/0.51 organisation_at_time(sk1,sk2) ). % 0.25/0.51 % 0.25/0.51 cnf(a16_5,hypothesis, % 0.25/0.51 founding_time(sk1,sk2) ). % 0.25/0.51 % 0.25/0.51 cnf(a16_6,hypothesis, % 0.25/0.51 number_of_routines(sk1,sk2,high) ). % 0.25/0.51 % 0.25/0.51 cnf(a16_7,hypothesis, % 0.25/0.51 ~ has_elaborated_routines(sk1,sk2) ). % 0.25/0.51 % 0.25/0.51 cnf(prove_t10_8,negated_conjecture, % 0.25/0.51 ( ~ organisation_at_time(A,B) % 0.25/0.51 | first_mover(A) % 0.25/0.51 | efficient_producer(A) ) ). % 0.25/0.51 % 0.25/0.51 %-------------------------------------------------------------------------- % 0.25/0.51 %------------------------------------------- % 0.25/0.51 % Proof found % 0.25/0.51 % SZS status Theorem for theBenchmark % 0.25/0.51 % SZS output start Proof % 0.25/0.51 %ClaNum:8(EqnAxiom:0) % 0.25/0.51 %VarNum:22(SingletonVarNum:8) % 0.25/0.51 %MaxLitNum:4 % 0.25/0.51 %MaxfuncDepth:0 % 0.25/0.51 %SharedTerms:8 % 0.25/0.51 %goalClause: 5 % 0.25/0.51 [1]P1(a1,a4) % 0.25/0.51 [2]P2(a1,a4) % 0.25/0.51 [3]P5(a1,a4,a2) % 0.25/0.51 [4]~P6(a1,a4) % 0.25/0.51 [8]~P5(x81,x82,a2)+~P5(x81,x82,a3) % 0.25/0.51 [5]P4(x51)+P3(x51)+~P1(x51,x52) % 0.25/0.51 [6]~P3(x61)+~P1(x61,x62)+~P2(x61,x62)+P6(x61,x62) % 0.25/0.51 [7]~P4(x71)+~P1(x71,x72)+~P2(x71,x72)+P5(x71,x72,a3) % 0.25/0.51 %EqnAxiom % 0.25/0.51 % 0.25/0.51 %------------------------------------------- % 0.25/0.51 cnf(11,plain, % 0.25/0.51 (P4(a1)), % 0.25/0.51 inference(scs_inference,[],[1,2,4,6,5])). % 0.25/0.51 cnf(13,plain, % 0.25/0.51 ($false), % 0.25/0.51 inference(scs_inference,[],[3,2,11,1,8,7]), % 0.25/0.51 ['proof']). % 0.25/0.51 % SZS output end Proof % 0.25/0.51 % Total time :0.003589s %------------------------------------------------------------------------------