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