TSTP Solution File: MGT036-3 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT036-3 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:06:56 EDT 2023
% Result : Unsatisfiable 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : MGT036-3 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 28 06:20:36 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof:theBenchmark
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % File :CSE---1.6
% 0.19/0.61 % Problem :theBenchmark
% 0.19/0.61 % Transform :cnf
% 0.19/0.61 % Format :tptp:raw
% 0.19/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.61
% 0.19/0.61 % Result :Theorem 0.000000s
% 0.19/0.61 % Output :CNFRefutation 0.000000s
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 % File : MGT036-3 : TPTP v8.1.2. Released v2.4.0.
% 0.19/0.61 % Domain : Management (Organisation Theory)
% 0.19/0.61 % Problem : First movers never outcompete efficient producers.
% 0.19/0.61 % Version : [PM93] axioms.
% 0.19/0.61 % English :
% 0.19/0.61
% 0.19/0.61 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg
% 0.19/0.61 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg
% 0.19/0.61 % Source : [TPTP]
% 0.19/0.61 % Names :
% 0.19/0.61
% 0.19/0.61 % Status : Unsatisfiable
% 0.19/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.4.0
% 0.19/0.61 % Syntax : Number of clauses : 9 ( 4 unt; 0 nHn; 9 RR)
% 0.19/0.61 % Number of literals : 23 ( 0 equ; 15 neg)
% 0.19/0.61 % Maximal clause size : 5 ( 2 avg)
% 0.19/0.61 % Maximal term depth : 2 ( 1 avg)
% 0.19/0.61 % Number of predicates : 5 ( 5 usr; 0 prp; 1-4 aty)
% 0.19/0.61 % Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% 0.19/0.61 % Number of variables : 18 ( 0 sgn)
% 0.19/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.61
% 0.19/0.61 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT036+3.p
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 cnf(mp_symmetry_of_subpopulations_1,axiom,
% 0.19/0.61 ( ~ environment(A)
% 0.19/0.61 | ~ subpopulations(B,C,A,D)
% 0.19/0.61 | subpopulations(C,B,A,D) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(d2_2,hypothesis,
% 0.19/0.61 ( ~ environment(A)
% 0.19/0.61 | ~ subpopulations(B,C,A,D)
% 0.19/0.61 | ~ greater_or_equal(growth_rate(C,D),zero)
% 0.19/0.61 | ~ greater(zero,growth_rate(B,D))
% 0.19/0.61 | outcompetes(C,B,D) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(d2_3,hypothesis,
% 0.19/0.61 ( ~ environment(A)
% 0.19/0.61 | ~ subpopulations(B,C,A,D)
% 0.19/0.61 | ~ outcompetes(C,B,D)
% 0.19/0.61 | greater_or_equal(growth_rate(C,D),zero) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(d2_4,hypothesis,
% 0.19/0.61 ( ~ environment(A)
% 0.19/0.61 | ~ subpopulations(B,C,A,D)
% 0.19/0.61 | ~ outcompetes(C,B,D)
% 0.19/0.61 | greater(zero,growth_rate(B,D)) ) ).
% 0.19/0.61
% 0.19/0.61 cnf(a13_star_5,hypothesis,
% 0.19/0.61 environment(sk1) ).
% 0.19/0.61
% 0.19/0.61 cnf(a13_star_6,hypothesis,
% 0.19/0.61 subpopulations(first_movers,efficient_producers,sk1,sk2) ).
% 0.19/0.61
% 0.19/0.61 cnf(a13_star_7,hypothesis,
% 0.19/0.61 greater_or_equal(growth_rate(first_movers,sk2),zero) ).
% 0.19/0.61
% 0.19/0.61 cnf(a13_star_8,hypothesis,
% 0.19/0.61 greater(zero,growth_rate(efficient_producers,sk2)) ).
% 0.19/0.61
% 0.19/0.61 cnf(prove_t5_star_9,negated_conjecture,
% 0.19/0.61 ( ~ environment(A)
% 0.19/0.61 | ~ subpopulations(first_movers,efficient_producers,A,B)
% 0.19/0.61 | ~ outcompetes(first_movers,efficient_producers,B) ) ).
% 0.19/0.61
% 0.19/0.61 %--------------------------------------------------------------------------
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark
% 0.19/0.61 % SZS output start Proof
% 0.19/0.61 %ClaNum:9(EqnAxiom:0)
% 0.19/0.61 %VarNum:45(SingletonVarNum:18)
% 0.19/0.61 %MaxLitNum:5
% 0.19/0.61 %MaxfuncDepth:1
% 0.19/0.61 %SharedTerms:11
% 0.19/0.61 %goalClause: 5
% 0.19/0.61 [1]P1(a1)
% 0.19/0.61 [4]P4(a4,a2,a1,a6)
% 0.19/0.61 [2]P2(a5,f3(a2,a6))
% 0.19/0.61 [3]P3(f3(a4,a6),a5)
% 0.19/0.61 [5]~P1(x51)+~P4(a4,a2,x51,x52)+~P5(a4,a2,x52)
% 0.19/0.61 [9]~P1(x93)+~P4(x92,x91,x93,x94)+P4(x91,x92,x93,x94)
% 0.19/0.61 [6]~P4(x61,x64,x63,x62)+~P5(x64,x61,x62)+~P1(x63)+P2(a5,f3(x61,x62))
% 0.19/0.61 [7]~P4(x74,x71,x73,x72)+~P5(x71,x74,x72)+~P1(x73)+P3(f3(x71,x72),a5)
% 0.19/0.61 [8]~P4(x82,x81,x84,x83)+P5(x81,x82,x83)+~P1(x84)+~P2(a5,f3(x82,x83))+~P3(f3(x81,x83),a5)
% 0.19/0.61 %EqnAxiom
% 0.19/0.61
% 0.19/0.61 %-------------------------------------------
% 0.19/0.62 cnf(12,plain,
% 0.19/0.62 ($false),
% 0.19/0.62 inference(scs_inference,[],[1,4,2,3,9,5,8]),
% 0.19/0.62 ['proof']).
% 0.19/0.62 % SZS output end Proof
% 0.19/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------