TSTP Solution File: MGT023-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT023-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n017.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:49 EDT 2023
% Result : Unsatisfiable 61.58s 61.64s
% Output : CNFRefutation 61.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : MGT023-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n017.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 05:53:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 61.58/61.63 %-------------------------------------------
% 61.58/61.63 % File :CSE---1.6
% 61.58/61.63 % Problem :theBenchmark
% 61.58/61.63 % Transform :cnf
% 61.58/61.63 % Format :tptp:raw
% 61.58/61.63 % Command :java -jar mcs_scs.jar %d %s
% 61.58/61.63
% 61.58/61.63 % Result :Theorem 61.000000s
% 61.58/61.63 % Output :CNFRefutation 61.000000s
% 61.58/61.63 %-------------------------------------------
% 61.58/61.64 %--------------------------------------------------------------------------
% 61.58/61.64 % File : MGT023-1 : TPTP v8.1.2. Released v2.4.0.
% 61.58/61.64 % Domain : Management (Organisation Theory)
% 61.58/61.64 % Problem : Stable environments have a critical point.
% 61.58/61.64 % Version : [PB+94] axioms : Reduced & Augmented > Complete.
% 61.58/61.64 % English :
% 61.58/61.64
% 61.58/61.64 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg
% 61.58/61.64 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg
% 61.58/61.64 % : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 61.58/61.64 % Source : [TPTP]
% 61.58/61.64 % Names :
% 61.58/61.64
% 61.58/61.64 % Status : Unsatisfiable
% 61.58/61.64 % Rating : 0.10 v8.1.0, 0.00 v7.5.0, 0.05 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.3.0, 0.09 v6.2.0, 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.05 v5.4.0, 0.10 v5.3.0, 0.06 v5.2.0, 0.00 v3.4.0, 0.08 v3.3.0, 0.14 v3.2.0, 0.15 v3.1.0, 0.18 v2.7.0, 0.17 v2.6.0, 0.11 v2.4.0
% 61.58/61.64 % Syntax : Number of clauses : 9 ( 3 unt; 3 nHn; 9 RR)
% 61.58/61.64 % Number of literals : 29 ( 3 equ; 17 neg)
% 61.58/61.64 % Maximal clause size : 5 ( 3 avg)
% 61.58/61.64 % Maximal term depth : 3 ( 1 avg)
% 61.58/61.64 % Number of predicates : 6 ( 5 usr; 0 prp; 1-4 aty)
% 61.58/61.64 % Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% 61.58/61.64 % Number of variables : 10 ( 0 sgn)
% 61.58/61.64 % SPC : CNF_UNS_RFO_SEQ_NHN
% 61.58/61.64
% 61.58/61.64 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT023+1.p
% 61.58/61.64 %--------------------------------------------------------------------------
% 61.58/61.64 cnf(d1_17,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
% 61.58/61.64 | ~ in_environment(A,B)
% 61.58/61.64 | subpopulations(first_movers,efficient_producers,A,sk1(B,A))
% 61.58/61.64 | B = critical_point(A) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(d1_18,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
% 61.58/61.64 | ~ in_environment(A,B)
% 61.58/61.64 | greater(sk1(B,A),B)
% 61.58/61.64 | B = critical_point(A) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(d1_19,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
% 61.58/61.64 | ~ in_environment(A,B)
% 61.58/61.64 | ~ greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A)))
% 61.58/61.64 | B = critical_point(A) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(l12_20,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | ~ stable(A)
% 61.58/61.64 | in_environment(A,sk2(A)) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(l12_21,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | ~ stable(A)
% 61.58/61.64 | ~ greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(l12_22,hypothesis,
% 61.58/61.64 ( ~ environment(A)
% 61.58/61.64 | ~ stable(A)
% 61.58/61.64 | ~ subpopulations(first_movers,efficient_producers,A,B)
% 61.58/61.64 | ~ greater(B,sk2(A))
% 61.58/61.64 | greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) ) ).
% 61.58/61.64
% 61.58/61.64 cnf(prove_l5_23,negated_conjecture,
% 61.58/61.64 environment(sk3) ).
% 61.58/61.64
% 61.58/61.64 cnf(prove_l5_24,negated_conjecture,
% 61.58/61.64 stable(sk3) ).
% 61.58/61.64
% 61.58/61.64 cnf(prove_l5_25,negated_conjecture,
% 61.58/61.64 ~ in_environment(sk3,critical_point(sk3)) ).
% 61.58/61.64
% 61.58/61.64 %--------------------------------------------------------------------------
% 61.58/61.64 %-------------------------------------------
% 61.58/61.64 % Proof found
% 61.58/61.64 % SZS status Theorem for theBenchmark
% 61.58/61.64 % SZS output start Proof
% 61.58/61.64 %ClaNum:28(EqnAxiom:19)
% 61.58/61.64 %VarNum:47(SingletonVarNum:10)
% 61.58/61.64 %MaxLitNum:5
% 61.58/61.64 %MaxfuncDepth:2
% 61.58/61.64 %SharedTerms:7
% 61.58/61.64 %goalClause: 20 21 22
% 61.58/61.64 %singleGoalClaCount:3
% 61.58/61.64 [20]P1(a1)
% 61.58/61.64 [21]P2(a1)
% 61.58/61.64 [22]~P3(a1,f2(a1))
% 61.58/61.64 [23]~P1(x231)+~P2(x231)+P3(x231,f3(x231))
% 61.58/61.64 [25]~P2(x251)+~P1(x251)+~P4(f6(a5,f3(x251)),f6(a7,f3(x251)))
% 61.58/61.64 [24]~P1(x242)+~P3(x242,x241)+P4(f4(x241,x242),x241)+E(x241,f2(x242))+P4(f6(a5,x241),f6(a7,x241))
% 61.58/61.64 [27]~P1(x272)+~P3(x272,x271)+E(x271,f2(x272))+P5(a7,a5,x272,f4(x271,x272))+P4(f6(a5,x271),f6(a7,x271))
% 61.58/61.64 [28]~P2(x282)+~P1(x282)+~P4(x281,f3(x282))+~P5(a7,a5,x282,x281)+P4(f6(a5,x281),f6(a7,x281))
% 61.58/61.64 [26]~P1(x262)+~P3(x262,x261)+E(x261,f2(x262))+P4(f6(a5,x261),f6(a7,x261))+~P4(f6(a5,f4(x261,x262)),f6(a7,f4(x261,x262)))
% 61.58/61.64 %EqnAxiom
% 61.58/61.64 [1]E(x11,x11)
% 61.58/61.64 [2]E(x22,x21)+~E(x21,x22)
% 61.58/61.64 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 61.58/61.64 [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 61.58/61.64 [5]~E(x51,x52)+E(f3(x51),f3(x52))
% 61.58/61.64 [6]~E(x61,x62)+E(f6(x61,x63),f6(x62,x63))
% 61.58/61.64 [7]~E(x71,x72)+E(f6(x73,x71),f6(x73,x72))
% 61.58/61.64 [8]~E(x81,x82)+E(f4(x81,x83),f4(x82,x83))
% 61.58/61.64 [9]~E(x91,x92)+E(f4(x93,x91),f4(x93,x92))
% 61.58/61.64 [10]~P1(x101)+P1(x102)+~E(x101,x102)
% 61.58/61.64 [11]~P2(x111)+P2(x112)+~E(x111,x112)
% 61.58/61.64 [12]P3(x122,x123)+~E(x121,x122)+~P3(x121,x123)
% 61.58/61.65 [13]P3(x133,x132)+~E(x131,x132)+~P3(x133,x131)
% 61.58/61.65 [14]P4(x142,x143)+~E(x141,x142)+~P4(x141,x143)
% 61.58/61.65 [15]P4(x153,x152)+~E(x151,x152)+~P4(x153,x151)
% 61.58/61.65 [16]P5(x162,x163,x164,x165)+~E(x161,x162)+~P5(x161,x163,x164,x165)
% 61.58/61.65 [17]P5(x173,x172,x174,x175)+~E(x171,x172)+~P5(x173,x171,x174,x175)
% 61.58/61.65 [18]P5(x183,x184,x182,x185)+~E(x181,x182)+~P5(x183,x184,x181,x185)
% 61.58/61.65 [19]P5(x193,x194,x195,x192)+~E(x191,x192)+~P5(x193,x194,x195,x191)
% 61.58/61.65
% 61.58/61.65 %-------------------------------------------
% 61.58/61.65 cnf(33,plain,
% 61.58/61.65 (P3(a1,f3(a1))),
% 61.58/61.65 inference(scs_inference,[],[20,21,23])).
% 61.58/61.65 cnf(34,plain,
% 61.58/61.65 (~P4(f6(a5,f3(a1)),f6(a7,f3(a1)))),
% 61.58/61.65 inference(scs_inference,[],[20,21,23,25])).
% 61.58/61.65 cnf(36,plain,
% 61.58/61.65 (~E(f3(a1),f2(a1))),
% 61.58/61.65 inference(scs_inference,[],[20,22,21,23,25,15,13])).
% 61.58/61.65 cnf(40,plain,
% 61.58/61.65 (P5(a7,a5,a1,f4(f3(a1),a1))),
% 61.58/61.65 inference(scs_inference,[],[20,22,21,23,25,15,13,2,28,27])).
% 61.58/61.65 cnf(42,plain,
% 61.58/61.65 (P4(f4(f3(a1),a1),f3(a1))),
% 61.58/61.65 inference(scs_inference,[],[20,22,21,23,25,15,13,2,28,27,24])).
% 61.58/61.65 cnf(51,plain,
% 61.58/61.65 (~E(a1,x511)+P2(x511)),
% 61.58/61.65 inference(scs_inference,[],[21,11])).
% 61.58/61.65 cnf(59,plain,
% 61.58/61.65 (~E(x591,f2(a1))+~E(f3(a1),x591)),
% 61.58/61.65 inference(scs_inference,[],[36,3])).
% 61.58/61.65 cnf(63,plain,
% 61.58/61.65 (~E(x631,x632)+E(f2(x632),f2(x631))),
% 61.58/61.65 inference(scs_inference,[],[4,2])).
% 61.58/61.65 cnf(65,plain,
% 61.58/61.65 (~E(x651,f3(a1))+~E(x651,f2(a1))),
% 61.58/61.65 inference(scs_inference,[],[59,2])).
% 61.58/61.65 cnf(67,plain,
% 61.58/61.65 (~E(a1,x671)+~E(f2(x671),f3(a1))),
% 61.58/61.65 inference(scs_inference,[],[65,63])).
% 61.58/61.65 cnf(71,plain,
% 61.58/61.65 (~E(f3(a1),f2(x711))+~E(a1,x711)),
% 61.58/61.65 inference(scs_inference,[],[67,2])).
% 61.58/61.65 cnf(74,plain,
% 61.58/61.65 (~P4(f6(a5,f4(f3(a1),a1)),f6(a7,f4(f3(a1),a1)))),
% 61.58/61.65 inference(scs_inference,[],[33,34,20,71,26])).
% 61.58/61.65 cnf(144,plain,
% 61.58/61.65 (P4(f6(a5,f4(f3(a1),a1)),f6(a7,f4(f3(a1),a1)))),
% 61.58/61.65 inference(scs_inference,[],[40,42,20,51,28])).
% 61.58/61.65 cnf(942,plain,
% 61.58/61.65 ($false),
% 61.58/61.65 inference(scs_inference,[],[74,144]),
% 61.58/61.65 ['proof']).
% 61.58/61.65 % SZS output end Proof
% 61.58/61.65 % Total time :61.000000s
%------------------------------------------------------------------------------