↑ Up

CSE---1.7.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : MGT007+1 : TPTP v9.3.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:04:14 AM UTC 2026

% Result   : Theorem 58.19s 58.41s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem    : MGT007+1 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.01  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.03/0.28  % Computer : n012.cluster.edu
% 0.03/0.28  % Model    : x86_64 x86_64
% 0.03/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.28  % Memory   : 8046.5625MB
% 0.03/0.28  % OS       : Linux 6.8.0-71-generic
% 0.03/0.28  % CPULimit   : 300
% 0.03/0.28  % WCLimit    : 300
% 0.03/0.28  % DateTime   : Mon Sep  7 11:43:11 UTC 2026
% 0.03/0.29  % CPUTime    : 
% 0.09/0.37  start to proof:theBenchmark
% 58.19/58.41  %-------------------------------------------
% 58.19/58.41  % File        :CSE---1.7
% 58.19/58.41  % Problem     :theBenchmark
% 58.19/58.41  % Transform   :cnf
% 58.19/58.41  % Format      :tptp:raw
% 58.19/58.41  % Command     :java -jar mcs_scs.jar %d %s
% 58.19/58.41  
% 58.19/58.41  % Result      :Theorem 58.025683s
% 58.19/58.41  % Output      :CNFRefutation 58.025683s
% 58.19/58.41  %-------------------------------------------
% 58.19/58.41  %--------------------------------------------------------------------------
% 58.19/58.41  % File     : MGT007+1 : TPTP v9.3.0. Released v2.0.0.
% 58.19/58.41  % Domain   : Management (Organisation Theory)
% 58.19/58.41  % Problem  : Reproducibility decreases during reorganization.
% 58.19/58.41  % Version  : [PB+94] axioms.
% 58.19/58.41  % English  :
% 58.19/58.41  
% 58.19/58.41  % Refs     : [PB+92] Peli et al. (1992), A Logical Approach to Formalizing
% 58.19/58.41  %          : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 58.19/58.41  %          : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 58.19/58.41  % Source   : [Kam94]
% 58.19/58.41  % Names    : THEOREM 7 [PB+92]
% 58.19/58.41  %          : T7FOL1 [PB+94]
% 58.19/58.41  
% 58.19/58.41  % Status   : Theorem
% 58.19/58.41  % Rating   : 0.00 v9.3.0, 0.05 v9.1.0, 0.00 v6.1.0, 0.08 v6.0.0, 0.50 v5.5.0, 0.12 v5.4.0, 0.13 v5.3.0, 0.22 v5.2.0, 0.00 v5.0.0, 0.05 v4.1.0, 0.06 v4.0.1, 0.05 v3.7.0, 0.00 v3.2.0, 0.11 v3.1.0, 0.00 v2.1.0
% 58.19/58.41  % Syntax   : Number of formulae    :    6 (   0 unt;   0 def)
% 58.19/58.41  %            Number of atoms       :   38 (   0 equ)
% 58.19/58.41  %            Maximal formula atoms :   12 (   6 avg)
% 58.19/58.41  %            Number of connectives :   36 (   4   ~;   0   |;  25   &)
% 58.19/58.41  %                                         (   1 <=>;   6  =>;   0  <=;   0 <~>)
% 58.19/58.41  %            Maximal formula depth :   21 (  12 avg)
% 58.19/58.41  %            Maximal term depth    :    1 (   1 avg)
% 58.19/58.41  %            Number of predicates  :    6 (   6 usr;   0 prp; 2-3 aty)
% 58.19/58.41  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 58.19/58.41  %            Number of variables   :   35 (  32   !;   3   ?)
% 58.19/58.41  % SPC      : FOF_THM_RFO_NEQ
% 58.19/58.41  
% 58.19/58.41  % Comments :
% 58.19/58.41  %--------------------------------------------------------------------------
% 58.19/58.41  fof(mp1,axiom,
% 58.19/58.41      ! [X,T] :
% 58.19/58.41        ( organization(X,T)
% 58.19/58.41       => ? [R] : reliability(X,R,T) ) ).
% 58.19/58.41  
% 58.19/58.41  fof(mp2,axiom,
% 58.19/58.41      ! [X,T] :
% 58.19/58.41        ( organization(X,T)
% 58.19/58.41       => ? [A] : accountability(X,A,T) ) ).
% 58.19/58.41  
% 58.19/58.41  fof(mp_not_in_TR,axiom,
% 58.19/58.41      ! [X,T] :
% 58.19/58.41        ( organization(X,T)
% 58.19/58.41       => ? [A] : reproducibility(X,A,T) ) ).
% 58.19/58.41  
% 58.19/58.41  %----Reliability and accountability require that organizational
% 58.19/58.41  %----structures be highly reproducible.
% 58.19/58.41  fof(a2_FOL,hypothesis,
% 58.19/58.41      ! [X,Y,T1,T2,R1,R2,A1,A2,Rp1,Rp2] :
% 58.19/58.41        ( ( organization(X,T1)
% 58.19/58.41          & organization(Y,T2)
% 58.19/58.41          & reliability(X,R1,T1)
% 58.19/58.41          & reliability(Y,R2,T2)
% 58.19/58.41          & accountability(X,A1,T1)
% 58.19/58.41          & accountability(Y,A2,T2)
% 58.19/58.41          & reproducibility(X,Rp1,T1)
% 58.19/58.41          & reproducibility(Y,Rp2,T2) )
% 58.19/58.41       => ( greater(Rp2,Rp1)
% 58.19/58.41        <=> ( greater(R2,R1)
% 58.19/58.41            & greater(A2,A1) ) ) ) ).
% 58.19/58.41  
% 58.19/58.41  %----The process of attempting reorganization lowers reliability of
% 58.19/58.41  %----performance.
% 58.19/58.41  fof(a6_FOL,hypothesis,
% 58.19/58.41      ! [X,R1,R2,A1,A2,T1,T2,Ta,Tb] :
% 58.19/58.41        ( ( organization(X,T1)
% 58.19/58.41          & organization(X,T2)
% 58.19/58.41          & reorganization(X,Ta,Tb)
% 58.19/58.41          & reliability(X,R1,T1)
% 58.19/58.41          & reliability(X,R2,T2)
% 58.19/58.41          & accountability(X,A1,T1)
% 58.19/58.41          & accountability(X,A2,T2)
% 58.19/58.41          & ~ greater(Ta,T1)
% 58.19/58.41          & greater(T2,T1)
% 58.19/58.41          & ~ greater(T2,Tb) )
% 58.19/58.41       => ( greater(R1,R2)
% 58.19/58.41          & greater(A1,A2) ) ) ).
% 58.19/58.41  
% 58.19/58.41  fof(t7_FOL,conjecture,
% 58.19/58.41      ! [X,Rp1,Rp2,T1,T2,Ta,Tb] :
% 58.19/58.41        ( ( organization(X,T1)
% 58.19/58.41          & organization(X,T2)
% 58.19/58.41          & reorganization(X,Ta,Tb)
% 58.19/58.41          & reproducibility(X,Rp1,T1)
% 58.19/58.41          & reproducibility(X,Rp2,T2)
% 58.19/58.41          & ~ greater(Ta,T1)
% 58.19/58.41          & greater(T2,T1)
% 58.19/58.41          & ~ greater(T2,Tb) )
% 58.19/58.41       => greater(Rp1,Rp2) ) ).
% 58.19/58.41  
% 58.19/58.41  %--------------------------------------------------------------------------
% 58.19/58.41  %-------------------------------------------
% 58.19/58.41  % Proof found
% 58.19/58.41  % SZS status Theorem for theBenchmark
% 58.19/58.41  % SZS output start Proof
% 58.19/58.41  %ClaNum:17(EqnAxiom:0)
% 58.19/58.41  %VarNum:152(SingletonVarNum:54)
% 58.19/58.41  %MaxLitNum:11
% 58.19/58.41  %MaxfuncDepth:1
% 58.19/58.41  %SharedTerms:16
% 58.19/58.41  %goalClause: 1 2 3 4 5 6 7 8 9
% 58.19/58.41  %singleGoalClaCount:9
% 58.19/58.41  [1]P1(a1,a6)
% 58.19/58.41  [2]P1(a1,a9)
% 58.19/58.41  [3]P2(a9,a6)
% 58.19/58.41  [4]P4(a1,a7,a6)
% 58.19/58.41  [5]P4(a1,a8,a9)
% 58.19/58.41  [6]P5(a1,a10,a2)
% 58.19/58.41  [7]~P2(a7,a8)
% 58.19/58.41  [8]~P2(a9,a2)
% 58.19/58.41  [9]~P2(a10,a6)
% 58.19/58.41  [10]~P1(x101,x102)+P6(x101,f3(x101,x102),x102)
% 58.19/58.41  [11]~P1(x111,x112)+P3(x111,f4(x111,x112),x112)
% 58.19/58.41  [12]~P1(x121,x122)+P4(x121,f5(x121,x122),x122)
% 58.19/58.41  [15]~P3(x153,x151,x154)+~P3(x155,x152,x156)+~P4(x153,x157,x154)+~P4(x155,x158,x156)+P2(x151,x152)+~P1(x153,x154)+~P6(x153,x159,x154)+~P1(x155,x156)+~P6(x155,x1510,x156)+~P2(x157,x158)
% 58.19/58.41  [16]~P6(x163,x161,x164)+~P6(x165,x162,x166)+~P4(x163,x167,x164)+~P4(x165,x168,x166)+P2(x161,x162)+~P1(x163,x164)+~P3(x163,x169,x164)+~P1(x165,x166)+~P3(x165,x1610,x166)+~P2(x167,x168)
% 58.19/58.41  [13]~P1(x137,x132)+~P2(x133,x132)+~P3(x137,x136,x133)+~P3(x137,x135,x132)+~P5(x137,x131,x134)+P2(x131,x132)+P2(x133,x134)+~P6(x137,x138,x133)+~P6(x137,x139,x132)+P2(x135,x136)+~P1(x137,x133)
% 58.19/58.41  [14]~P1(x147,x142)+~P2(x143,x142)+~P6(x147,x146,x143)+~P6(x147,x145,x142)+~P5(x147,x141,x144)+P2(x141,x142)+P2(x143,x144)+~P3(x147,x148,x143)+~P3(x147,x149,x142)+P2(x145,x146)+~P1(x147,x143)
% 58.19/58.41  [17]~P6(x173,x179,x174)+~P6(x175,x1710,x176)+~P3(x173,x177,x174)+~P3(x175,x178,x176)+~P4(x173,x171,x174)+~P4(x175,x172,x176)+P2(x171,x172)+~P1(x173,x174)+~P1(x175,x176)+~P2(x177,x178)+~P2(x179,x1710)
% 58.19/58.41  %EqnAxiom
% 58.19/58.41  
% 58.19/58.41  %-------------------------------------------
% 58.19/58.45  cnf(80354,plain,
% 58.19/58.45     (P6(a1,f3(a1,a6),a6)),
% 58.19/58.45     inference(scs_inference,[],[1,10])).
% 58.19/58.45  cnf(80356,plain,
% 58.19/58.45     (P3(a1,f4(a1,a6),a6)),
% 58.19/58.45     inference(scs_inference,[],[1,10,11])).
% 58.19/58.45  cnf(80363,plain,
% 58.19/58.45     (P6(a1,f3(a1,a9),a9)),
% 58.19/58.45     inference(scs_inference,[],[2,12,10])).
% 58.19/58.45  cnf(80365,plain,
% 58.19/58.45     (P3(a1,f4(a1,a9),a9)),
% 58.19/58.45     inference(scs_inference,[],[2,12,10,11])).
% 58.19/58.45  cnf(80371,plain,
% 58.19/58.45     (P2(f4(a1,a6),f4(a1,a9))),
% 58.19/58.45     inference(scs_inference,[],[1,6,80363,80365,80354,80356,8,9,3,2,13])).
% 58.19/58.45  cnf(80373,plain,
% 58.19/58.45     (P2(f3(a1,a6),f3(a1,a9))),
% 58.19/58.45     inference(scs_inference,[],[1,6,80363,80365,80354,80356,8,9,3,2,13,14])).
% 58.19/58.45  cnf(80446,plain,
% 58.19/58.45     ($false),
% 58.19/58.45     inference(scs_inference,[],[1,80371,80373,5,4,80365,80356,80363,80354,7,2,17]),
% 58.19/58.45     ['proof']).
% 58.19/58.46  % SZS output end Proof
% 58.19/58.46  % Total time :58.025683s
%------------------------------------------------------------------------------