TSTP Solution File: MGT003-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT003-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 : n011.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:39 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : MGT003-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n011.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 06:09:55 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.62 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.62
% 0.20/0.62 % Result :Theorem 0.000000s
% 0.20/0.62 % Output :CNFRefutation 0.000000s
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 % File : MGT003-1 : TPTP v8.1.2. Released v2.4.0.
% 0.20/0.62 % Domain : Management (Organisation Theory)
% 0.20/0.62 % Problem : Organizational death rates decrease with age.
% 0.20/0.62 % Version : [PB+94] axioms.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [PB+92] Peli et al. (1992), A Logical Approach to Formalizing
% 0.20/0.62 % : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 0.20/0.62 % : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 0.20/0.62 % Source : [TPTP]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.4.0
% 0.20/0.62 % Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 12 RR)
% 0.20/0.62 % Number of literals : 30 ( 0 equ; 19 neg)
% 0.20/0.62 % Maximal clause size : 10 ( 2 avg)
% 0.20/0.62 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.62 % Number of predicates : 5 ( 5 usr; 0 prp; 2-3 aty)
% 0.20/0.62 % Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% 0.20/0.62 % Number of variables : 21 ( 2 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.62
% 0.20/0.62 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT003+1.p
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 cnf(mp4_1,axiom,
% 0.20/0.62 ( ~ reorganization_free(A,B,C)
% 0.20/0.62 | reorganization_free(A,B,B) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(mp4_2,axiom,
% 0.20/0.62 ( ~ reorganization_free(A,B,C)
% 0.20/0.62 | reorganization_free(A,C,C) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(mp5_3,axiom,
% 0.20/0.62 ( ~ organization(A,B)
% 0.20/0.62 | inertia(A,sk1(B,A),B) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(t1_FOL_4,hypothesis,
% 0.20/0.62 ( ~ organization(A,B)
% 0.20/0.62 | ~ organization(C,D)
% 0.20/0.62 | ~ reorganization_free(A,B,B)
% 0.20/0.62 | ~ reorganization_free(C,D,D)
% 0.20/0.62 | ~ inertia(A,E,B)
% 0.20/0.62 | ~ inertia(C,F,D)
% 0.20/0.62 | ~ survival_chance(A,G,B)
% 0.20/0.62 | ~ survival_chance(C,H,D)
% 0.20/0.62 | ~ greater(F,E)
% 0.20/0.62 | greater(H,G) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(t2_FOL_5,hypothesis,
% 0.20/0.62 ( ~ organization(A,B)
% 0.20/0.62 | ~ organization(A,C)
% 0.20/0.62 | ~ reorganization_free(A,B,C)
% 0.20/0.62 | ~ inertia(A,D,B)
% 0.20/0.62 | ~ inertia(A,E,C)
% 0.20/0.62 | ~ greater(C,B)
% 0.20/0.62 | greater(E,D) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_6,negated_conjecture,
% 0.20/0.62 organization(sk2,sk5) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_7,negated_conjecture,
% 0.20/0.62 organization(sk2,sk6) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_8,negated_conjecture,
% 0.20/0.62 reorganization_free(sk2,sk5,sk6) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_9,negated_conjecture,
% 0.20/0.62 survival_chance(sk2,sk3,sk5) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_10,negated_conjecture,
% 0.20/0.62 survival_chance(sk2,sk4,sk6) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_11,negated_conjecture,
% 0.20/0.62 greater(sk6,sk5) ).
% 0.20/0.62
% 0.20/0.62 cnf(t3_FOL_12,negated_conjecture,
% 0.20/0.62 ~ greater(sk4,sk3) ).
% 0.20/0.62
% 0.20/0.62 %--------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:12(EqnAxiom:0)
% 0.20/0.62 %VarNum:61(SingletonVarNum:21)
% 0.20/0.62 %MaxLitNum:10
% 0.20/0.62 %MaxfuncDepth:1
% 0.20/0.62 %SharedTerms:12
% 0.20/0.62 %goalClause: 1 2 3 4 5 6 7
% 0.20/0.62 %singleGoalClaCount:7
% 0.20/0.62 [1]P1(a1,a3)
% 0.20/0.62 [2]P1(a1,a6)
% 0.20/0.62 [3]P2(a6,a3)
% 0.20/0.62 [4]P4(a1,a3,a6)
% 0.20/0.62 [5]P5(a1,a4,a3)
% 0.20/0.62 [6]P5(a1,a5,a6)
% 0.20/0.62 [7]~P2(a5,a4)
% 0.20/0.62 [8]~P1(x81,x82)+P3(x81,f2(x82,x81),x82)
% 0.20/0.62 [9]P4(x91,x92,x92)+~P4(x91,x93,x92)
% 0.20/0.62 [10]P4(x101,x102,x102)+~P4(x101,x102,x103)
% 0.20/0.62 [11]~P2(x114,x115)+~P4(x113,x115,x114)+~P3(x113,x111,x114)+~P3(x113,x112,x115)+P2(x111,x112)+~P1(x113,x114)+~P1(x113,x115)
% 0.20/0.62 [12]~P4(x123,x124,x124)+~P4(x125,x126,x126)+~P3(x123,x127,x124)+~P3(x125,x128,x126)+~P5(x123,x121,x124)+~P5(x125,x122,x126)+P2(x121,x122)+~P1(x123,x124)+~P1(x125,x126)+~P2(x127,x128)
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(13,plain,
% 0.20/0.62 (P4(a1,a3,a3)),
% 0.20/0.62 inference(scs_inference,[],[4,10])).
% 0.20/0.62 cnf(14,plain,
% 0.20/0.62 (P4(a1,a6,a6)),
% 0.20/0.62 inference(scs_inference,[],[4,10,9])).
% 0.20/0.62 cnf(15,plain,
% 0.20/0.62 (P3(a1,f2(a3,a1),a3)),
% 0.20/0.62 inference(scs_inference,[],[1,4,10,9,8])).
% 0.20/0.62 cnf(19,plain,
% 0.20/0.62 (P2(x191,f2(a3,a1))+~P3(a1,x191,a6)),
% 0.20/0.62 inference(scs_inference,[],[1,2,3,4,15,11])).
% 0.20/0.62 cnf(23,plain,
% 0.20/0.62 (P3(a1,f2(a6,a1),a6)),
% 0.20/0.62 inference(scs_inference,[],[2,8])).
% 0.20/0.62 cnf(26,plain,
% 0.20/0.63 (~P2(f2(a6,a1),f2(a3,a1))),
% 0.20/0.63 inference(scs_inference,[],[2,6,7,13,5,14,15,1,8,11,12])).
% 0.20/0.63 cnf(29,plain,
% 0.20/0.63 ($false),
% 0.20/0.63 inference(scs_inference,[],[26,23,19]),
% 0.20/0.63 ['proof']).
% 0.20/0.63 % SZS output end Proof
% 0.20/0.63 % Total time :0.000000s
%------------------------------------------------------------------------------