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.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n004.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   : Unsatisfiable 0.18s 0.61s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MGT041-2 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 06:01:52 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.18/0.56  start to proof:theBenchmark
% 0.18/0.60  %-------------------------------------------
% 0.18/0.60  % File        :CSE---1.6
% 0.18/0.60  % Problem     :theBenchmark
% 0.18/0.60  % Transform   :cnf
% 0.18/0.60  % Format      :tptp:raw
% 0.18/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.18/0.60  
% 0.18/0.60  % Result      :Theorem 0.000000s
% 0.18/0.60  % Output      :CNFRefutation 0.000000s
% 0.18/0.60  %-------------------------------------------
% 0.18/0.60  %--------------------------------------------------------------------------
% 0.18/0.60  % File     : MGT041-2 : TPTP v8.1.2. Released v2.4.0.
% 0.18/0.60  % Domain   : Management (Organisation Theory)
% 0.18/0.60  % Problem  : There are non-FM and non-EP organisations
% 0.18/0.60  % Version  : [PM93] axioms.
% 0.18/0.60  % English  : There are non-first mover and non-efficient producers
% 0.18/0.60  %            organisations.
% 0.18/0.60  
% 0.18/0.60  % Refs     : [PM93]  Peli & Masuch (1993), The Logic of Propogation Strateg
% 0.18/0.60  %          : [PM94]  Peli & Masuch (1994), The Logic of Propogation Strateg
% 0.18/0.60  %          : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 0.18/0.60  % Source   : [TPTP]
% 0.18/0.60  % Names    :
% 0.18/0.60  
% 0.18/0.60  % Status   : Unsatisfiable
% 0.18/0.61  % Rating   : 0.00 v2.4.0
% 0.18/0.61  % Syntax   : Number of clauses     :    8 (   4 unt;   1 nHn;   8 RR)
% 0.18/0.61  %            Number of literals    :   17 (   0 equ;  10 neg)
% 0.18/0.61  %            Maximal clause size   :    4 (   2 avg)
% 0.18/0.61  %            Maximal term depth    :    1 (   1 avg)
% 0.18/0.61  %            Number of predicates  :    6 (   6 usr;   0 prp; 1-3 aty)
% 0.18/0.61  %            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
% 0.18/0.61  %            Number of variables   :    8 (   1 sgn)
% 0.18/0.61  % SPC      : CNF_UNS_EPR_NEQ_NHN
% 0.18/0.61  
% 0.18/0.61  % Comments : Created with tptp2X -f tptp -t clausify:otter MGT041+2.p
% 0.18/0.61  %--------------------------------------------------------------------------
% 0.18/0.61  cnf(mp_not_high_and_low_1,axiom,
% 0.18/0.61      ( ~ number_of_routines(A,B,low)
% 0.18/0.61      | ~ number_of_routines(A,B,high) ) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a14_2,hypothesis,
% 0.18/0.61      ( ~ organisation_at_time(A,B)
% 0.18/0.61      | ~ efficient_producer(A)
% 0.18/0.61      | ~ founding_time(A,B)
% 0.18/0.61      | has_elaborated_routines(A,B) ) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a15_3,hypothesis,
% 0.18/0.61      ( ~ organisation_at_time(A,B)
% 0.18/0.61      | ~ first_mover(A)
% 0.18/0.61      | ~ founding_time(A,B)
% 0.18/0.61      | number_of_routines(A,B,low) ) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a16_4,hypothesis,
% 0.18/0.61      organisation_at_time(sk1,sk2) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a16_5,hypothesis,
% 0.18/0.61      founding_time(sk1,sk2) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a16_6,hypothesis,
% 0.18/0.61      number_of_routines(sk1,sk2,high) ).
% 0.18/0.61  
% 0.18/0.61  cnf(a16_7,hypothesis,
% 0.18/0.61      ~ has_elaborated_routines(sk1,sk2) ).
% 0.18/0.61  
% 0.18/0.61  cnf(prove_t10_8,negated_conjecture,
% 0.18/0.61      ( ~ organisation_at_time(A,B)
% 0.18/0.61      | first_mover(A)
% 0.18/0.61      | efficient_producer(A) ) ).
% 0.18/0.61  
% 0.18/0.61  %--------------------------------------------------------------------------
% 0.18/0.61  %-------------------------------------------
% 0.18/0.61  % Proof found
% 0.18/0.61  % SZS status Theorem for theBenchmark
% 0.18/0.61  % SZS output start Proof
% 0.18/0.61  %ClaNum:8(EqnAxiom:0)
% 0.18/0.61  %VarNum:22(SingletonVarNum:8)
% 0.18/0.61  %MaxLitNum:4
% 0.18/0.61  %MaxfuncDepth:0
% 0.18/0.61  %SharedTerms:8
% 0.18/0.61  %goalClause: 5
% 0.18/0.61  [1]P1(a1,a4)
% 0.18/0.61  [2]P2(a1,a4)
% 0.18/0.61  [3]P5(a1,a4,a2)
% 0.18/0.61  [4]~P6(a1,a4)
% 0.18/0.61  [8]~P5(x81,x82,a2)+~P5(x81,x82,a3)
% 0.18/0.61  [5]P4(x51)+P3(x51)+~P1(x51,x52)
% 0.18/0.61  [6]~P3(x61)+~P1(x61,x62)+~P2(x61,x62)+P6(x61,x62)
% 0.18/0.61  [7]~P4(x71)+~P1(x71,x72)+~P2(x71,x72)+P5(x71,x72,a3)
% 0.18/0.61  %EqnAxiom
% 0.18/0.61  
% 0.18/0.61  %-------------------------------------------
% 0.18/0.61  cnf(12,plain,
% 0.18/0.61     ($false),
% 0.18/0.61     inference(scs_inference,[],[1,2,3,4,6,8,7,5]),
% 0.18/0.61     ['proof']).
% 0.18/0.61  % SZS output end Proof
% 0.18/0.61  % Total time :0.000000s
%------------------------------------------------------------------------------