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