TSTP Solution File: MGT041+2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.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:59 EDT 2023
% Result : Theorem 0.55s 0.61s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n023.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:27:10 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.57 start to proof:theBenchmark
% 0.55/0.61 %-------------------------------------------
% 0.55/0.61 % File :CSE---1.6
% 0.55/0.61 % Problem :theBenchmark
% 0.55/0.61 % Transform :cnf
% 0.55/0.61 % Format :tptp:raw
% 0.55/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.55/0.61
% 0.55/0.61 % Result :Theorem 0.000000s
% 0.55/0.61 % Output :CNFRefutation 0.000000s
% 0.55/0.61 %-------------------------------------------
% 0.55/0.61 %--------------------------------------------------------------------------
% 0.55/0.61 % File : MGT041+2 : TPTP v8.1.2. Released v2.0.0.
% 0.55/0.61 % Domain : Management (Organisation Theory)
% 0.55/0.61 % Problem : There are non-FM and non-EP organisations
% 0.55/0.61 % Version : [PM93] axioms.
% 0.55/0.61 % English : There are non-first mover and non-efficient producers
% 0.55/0.61 % organisations.
% 0.55/0.61
% 0.55/0.61 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg
% 0.55/0.61 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg
% 0.55/0.61 % : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 0.55/0.61 % Source : [PM93]
% 0.55/0.61 % Names : Theorem 10 [PM93]
% 0.55/0.61
% 0.55/0.61 % Status : Theorem
% 0.55/0.61 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.55/0.61 % Syntax : Number of formulae : 5 ( 0 unt; 0 def)
% 0.55/0.61 % Number of atoms : 17 ( 0 equ)
% 0.55/0.61 % Maximal formula atoms : 4 ( 3 avg)
% 0.55/0.61 % Number of connectives : 16 ( 4 ~; 0 |; 10 &)
% 0.55/0.61 % ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% 0.55/0.61 % Maximal formula depth : 7 ( 6 avg)
% 0.55/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.55/0.61 % Number of predicates : 6 ( 6 usr; 0 prp; 1-3 aty)
% 0.55/0.61 % Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% 0.55/0.61 % Number of variables : 10 ( 6 !; 4 ?)
% 0.55/0.61 % SPC : FOF_THM_EPR_NEQ
% 0.55/0.61
% 0.55/0.61 % Comments :
% 0.55/0.61 %--------------------------------------------------------------------------
% 0.55/0.61 %----MP. The number of routines cannot be low and high at the same time.
% 0.55/0.61 fof(mp_not_high_and_low,axiom,
% 0.55/0.61 ! [X,T] :
% 0.55/0.61 ~ ( number_of_routines(X,T,low)
% 0.55/0.61 & number_of_routines(X,T,high) ) ).
% 0.55/0.61
% 0.55/0.61 %----A14. Efficient producer organizations have elaborated routines at
% 0.55/0.61 %----their founding.
% 0.55/0.61 fof(a14,hypothesis,
% 0.55/0.61 ! [X,T] :
% 0.55/0.61 ( ( organisation_at_time(X,T)
% 0.55/0.61 & efficient_producer(X)
% 0.55/0.61 & founding_time(X,T) )
% 0.55/0.61 => has_elaborated_routines(X,T) ) ).
% 0.55/0.61
% 0.55/0.61 %----A15. First mover organizations have only a few routines at their
% 0.55/0.61 %----founding.
% 0.55/0.61 fof(a15,hypothesis,
% 0.55/0.61 ! [X,T] :
% 0.55/0.61 ( ( organisation_at_time(X,T)
% 0.55/0.61 & first_mover(X)
% 0.55/0.61 & founding_time(X,T) )
% 0.55/0.61 => number_of_routines(X,T,low) ) ).
% 0.55/0.61
% 0.55/0.61 %----A16. Some organizations come to birth with several, but poorly
% 0.55/0.61 %----elaborated routines are not elaborated.
% 0.55/0.61 fof(a16,hypothesis,
% 0.55/0.61 ? [X,T] :
% 0.55/0.61 ( organisation_at_time(X,T)
% 0.55/0.61 & founding_time(X,T)
% 0.55/0.61 & number_of_routines(X,T,high)
% 0.55/0.61 & ~ has_elaborated_routines(X,T) ) ).
% 0.55/0.61
% 0.55/0.61 %----GOAL: T10. There are are non-first movers and non-efficient producer
% 0.55/0.61 %----organizations.
% 0.55/0.61 fof(prove_t10,conjecture,
% 0.55/0.61 ? [X,T] :
% 0.55/0.61 ( organisation_at_time(X,T)
% 0.55/0.61 & ~ first_mover(X)
% 0.55/0.61 & ~ efficient_producer(X) ) ).
% 0.55/0.61
% 0.55/0.61 %--------------------------------------------------------------------------
% 0.55/0.61 %-------------------------------------------
% 0.55/0.61 % Proof found
% 0.55/0.61 % SZS status Theorem for theBenchmark
% 0.55/0.61 % SZS output start Proof
% 0.55/0.61 %ClaNum:8(EqnAxiom:0)
% 0.55/0.61 %VarNum:22(SingletonVarNum:8)
% 0.55/0.61 %MaxLitNum:4
% 0.55/0.61 %MaxfuncDepth:0
% 0.55/0.61 %SharedTerms:8
% 0.55/0.61 %goalClause: 5
% 0.55/0.61 [1]P1(a1,a2)
% 0.55/0.61 [2]P2(a1,a2)
% 0.55/0.61 [3]P5(a1,a2,a3)
% 0.55/0.61 [4]~P6(a1,a2)
% 0.55/0.61 [8]~P5(x81,x82,a3)+~P5(x81,x82,a4)
% 0.55/0.61 [5]P4(x51)+P3(x51)+~P1(x51,x52)
% 0.55/0.61 [6]~P3(x61)+~P1(x61,x62)+~P2(x61,x62)+P6(x61,x62)
% 0.55/0.61 [7]~P4(x71)+~P1(x71,x72)+~P2(x71,x72)+P5(x71,x72,a4)
% 0.55/0.61 %EqnAxiom
% 0.55/0.61
% 0.55/0.61 %-------------------------------------------
% 0.55/0.62 cnf(12,plain,
% 0.55/0.62 ($false),
% 0.55/0.62 inference(scs_inference,[],[1,2,3,4,6,8,7,5]),
% 0.55/0.62 ['proof']).
% 0.55/0.62 % SZS output end Proof
% 0.55/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------