TSTP Solution File: MGT010-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT010-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n010.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:43 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT010-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Aug 28 06:14:04 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.010000s
% 0.20/0.63 % Output :CNFRefutation 0.010000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 % File : MGT010-1 : TPTP v8.1.2. Released v2.4.0.
% 0.20/0.63 % Domain : Management (Organisation Theory)
% 0.20/0.63 % Problem : Large organization have higher reliability and accountability
% 0.20/0.63 % Version : [PB+94] axioms.
% 0.20/0.63 % English : Large organization have higher reliability and accountability
% 0.20/0.63 % than small organizations (of the same class).
% 0.20/0.63
% 0.20/0.63 % Refs : [PB+92] Peli et al. (1992), A Logical Approach to Formalizing
% 0.20/0.63 % : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 0.20/0.63 % : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 0.20/0.63 % Source : [TPTP]
% 0.20/0.63 % Names :
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.4.0
% 0.20/0.63 % Syntax : Number of clauses : 19 ( 13 unt; 0 nHn; 19 RR)
% 0.20/0.63 % Number of literals : 60 ( 0 equ; 42 neg)
% 0.20/0.63 % Maximal clause size : 12 ( 3 avg)
% 0.20/0.63 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.63 % Number of predicates : 8 ( 8 usr; 0 prp; 2-3 aty)
% 0.20/0.63 % Number of functors : 12 ( 12 usr; 11 con; 0-2 aty)
% 0.20/0.63 % Number of variables : 41 ( 4 sgn)
% 0.20/0.63 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.63
% 0.20/0.63 % Comments : Created with tptp2X -f tptp -t clausify:otter MGT010+1.p
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 cnf(mp3_1,axiom,
% 0.20/0.63 ( ~ organization(A,B)
% 0.20/0.63 | reproducibility(A,sk1(B,A),B) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(a2_FOL_2,hypothesis,
% 0.20/0.63 ( ~ organization(A,B)
% 0.20/0.63 | ~ organization(C,D)
% 0.20/0.63 | ~ reliability(A,E,B)
% 0.20/0.63 | ~ reliability(C,F,D)
% 0.20/0.63 | ~ accountability(A,G,B)
% 0.20/0.63 | ~ accountability(C,H,D)
% 0.20/0.63 | ~ reproducibility(A,I,B)
% 0.20/0.63 | ~ reproducibility(C,J,D)
% 0.20/0.63 | ~ greater(J,I)
% 0.20/0.63 | greater(F,E) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(a2_FOL_3,hypothesis,
% 0.20/0.63 ( ~ organization(A,B)
% 0.20/0.63 | ~ organization(C,D)
% 0.20/0.63 | ~ reliability(A,E,B)
% 0.20/0.63 | ~ reliability(C,F,D)
% 0.20/0.63 | ~ accountability(A,G,B)
% 0.20/0.63 | ~ accountability(C,H,D)
% 0.20/0.63 | ~ reproducibility(A,I,B)
% 0.20/0.63 | ~ reproducibility(C,J,D)
% 0.20/0.63 | ~ greater(J,I)
% 0.20/0.63 | greater(H,G) ) ).
% 0.20/0.63
% 0.20/0.63 cnf(a2_FOL_4,hypothesis,
% 0.20/0.63 ( ~ organization(A,B)
% 0.20/0.63 | ~ organization(C,D)
% 0.20/0.64 | ~ reliability(A,E,B)
% 0.20/0.64 | ~ reliability(C,F,D)
% 0.20/0.64 | ~ accountability(A,G,B)
% 0.20/0.64 | ~ accountability(C,H,D)
% 0.20/0.64 | ~ reproducibility(A,I,B)
% 0.20/0.64 | ~ reproducibility(C,J,D)
% 0.20/0.64 | ~ greater(F,E)
% 0.20/0.64 | ~ greater(H,G)
% 0.20/0.64 | greater(J,I) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(t9_FOL_5,hypothesis,
% 0.20/0.64 ( ~ organization(A,B)
% 0.20/0.64 | ~ organization(C,D)
% 0.20/0.64 | ~ reorganization_free(A,B,B)
% 0.20/0.64 | ~ reorganization_free(C,D,D)
% 0.20/0.64 | ~ class(A,E,B)
% 0.20/0.64 | ~ class(C,E,D)
% 0.20/0.64 | ~ reproducibility(A,F,B)
% 0.20/0.64 | ~ reproducibility(C,G,D)
% 0.20/0.64 | ~ size(A,H,B)
% 0.20/0.64 | ~ size(C,I,D)
% 0.20/0.64 | ~ greater(I,H)
% 0.20/0.64 | greater(G,F) ) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_6,negated_conjecture,
% 0.20/0.64 organization(sk2,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_7,negated_conjecture,
% 0.20/0.64 organization(sk3,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_8,negated_conjecture,
% 0.20/0.64 reorganization_free(sk2,sk11,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_9,negated_conjecture,
% 0.20/0.64 reorganization_free(sk3,sk12,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_10,negated_conjecture,
% 0.20/0.64 class(sk2,sk4,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_11,negated_conjecture,
% 0.20/0.64 class(sk3,sk4,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_12,negated_conjecture,
% 0.20/0.64 reliability(sk2,sk5,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_13,negated_conjecture,
% 0.20/0.64 reliability(sk3,sk6,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_14,negated_conjecture,
% 0.20/0.64 accountability(sk2,sk7,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_15,negated_conjecture,
% 0.20/0.64 accountability(sk3,sk8,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_16,negated_conjecture,
% 0.20/0.64 size(sk2,sk9,sk11) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_17,negated_conjecture,
% 0.20/0.64 size(sk3,sk10,sk12) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_18,negated_conjecture,
% 0.20/0.64 greater(sk10,sk9) ).
% 0.20/0.64
% 0.20/0.64 cnf(t10_FOL_19,negated_conjecture,
% 0.20/0.64 ( ~ greater(sk6,sk5)
% 0.20/0.64 | ~ greater(sk8,sk7) ) ).
% 0.20/0.64
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:19(EqnAxiom:0)
% 0.20/0.64 %VarNum:118(SingletonVarNum:41)
% 0.20/0.64 %MaxLitNum:12
% 0.20/0.64 %MaxfuncDepth:1
% 0.20/0.64 %SharedTerms:26
% 0.20/0.64 %goalClause: 1 2 3 4 5 6 7 8 9 10 11 12 13 14
% 0.20/0.64 %singleGoalClaCount:13
% 0.20/0.64 [1]P1(a1,a2)
% 0.20/0.64 [2]P1(a6,a5)
% 0.20/0.64 [3]P2(a3,a7)
% 0.20/0.64 [4]P5(a1,a8,a2)
% 0.20/0.64 [5]P5(a6,a10,a5)
% 0.20/0.64 [6]P3(a1,a11,a2)
% 0.20/0.64 [7]P3(a6,a12,a5)
% 0.20/0.64 [8]P6(a1,a2,a2)
% 0.20/0.64 [9]P6(a6,a5,a5)
% 0.20/0.64 [10]P4(a1,a9,a2)
% 0.20/0.64 [11]P4(a6,a9,a5)
% 0.20/0.64 [12]P7(a1,a7,a2)
% 0.20/0.64 [13]P7(a6,a3,a5)
% 0.20/0.64 [14]~P2(a10,a8)+~P2(a12,a11)
% 0.20/0.64 [15]~P1(x151,x152)+P8(x151,f4(x152,x151),x152)
% 0.20/0.64 [16]~P8(x163,x167,x164)+~P8(x165,x168,x166)+~P3(x163,x161,x164)+~P3(x165,x162,x166)+P2(x161,x162)+~P1(x163,x164)+~P5(x163,x169,x164)+~P1(x165,x166)+~P5(x165,x1610,x166)+~P2(x167,x168)
% 0.20/0.64 [17]~P8(x173,x177,x174)+~P8(x175,x178,x176)+~P5(x173,x171,x174)+~P5(x175,x172,x176)+P2(x171,x172)+~P1(x173,x174)+~P3(x173,x179,x174)+~P1(x175,x176)+~P3(x175,x1710,x176)+~P2(x177,x178)
% 0.20/0.64 [18]~P8(x183,x181,x184)+~P8(x185,x182,x186)+~P5(x183,x189,x184)+~P5(x185,x1810,x186)+~P3(x183,x187,x184)+~P3(x185,x188,x186)+P2(x181,x182)+~P1(x183,x184)+~P1(x185,x186)+~P2(x187,x188)+~P2(x189,x1810)
% 0.20/0.64 [19]~P8(x193,x191,x194)+~P8(x195,x192,x196)+~P6(x193,x194,x194)+~P6(x195,x196,x196)+~P4(x195,x199,x196)+~P7(x193,x197,x194)+~P7(x195,x198,x196)+P2(x191,x192)+~P1(x193,x194)+~P4(x193,x199,x194)+~P1(x195,x196)+~P2(x197,x198)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(20,plain,
% 0.20/0.64 (P8(a1,f4(a2,a1),a2)),
% 0.20/0.64 inference(scs_inference,[],[1,15])).
% 0.20/0.64 cnf(37,plain,
% 0.20/0.64 (P8(a6,f4(a5,a6),a5)),
% 0.20/0.64 inference(scs_inference,[],[2,15])).
% 0.20/0.64 cnf(44,plain,
% 0.20/0.64 (P2(f4(a5,a6),f4(a2,a1))),
% 0.20/0.64 inference(scs_inference,[],[3,37,9,11,13,8,10,12,20,7,5,2,1,16,19])).
% 0.20/0.64 cnf(50,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[4,44,37,20,6,5,7,2,1,17,14,16]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.010000s
%------------------------------------------------------------------------------