TSTP Solution File: MGT006+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n008.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:41 EDT 2023
% Result : Theorem 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.13 % Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.17/0.35 % Computer : n008.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Mon Aug 28 06:14:17 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.58 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.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 % File : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% 0.20/0.64 % Domain : Management (Organisation Theory)
% 0.20/0.64 % Problem : Reliability and accountability increase with time.
% 0.20/0.64 % Version : Especial.
% 0.20/0.64 % Theorem formulation : Different.
% 0.20/0.64 % English :
% 0.20/0.64
% 0.20/0.64 % Refs : [PB+92] Peli et al. (1992), A Logical Approach to Formalizing
% 0.20/0.64 % : [PB+94] Peli et al. (1994), A Logical Approach to Formalizing
% 0.20/0.64 % : [Kam94] Kamps (1994), Email to G. Sutcliffe
% 0.20/0.64 % Source : [Kam94]
% 0.20/0.64 % Names : THEOREM 6 [PB+92]
% 0.20/0.64 % : T6FOL2 [PB+94]
% 0.20/0.64
% 0.20/0.64 % Status : Theorem
% 0.20/0.64 % Rating : 0.00 v7.5.0, 0.05 v7.4.0, 0.00 v7.0.0, 0.07 v6.4.0, 0.00 v6.3.0, 0.08 v6.2.0, 0.00 v6.1.0, 0.12 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
% 0.20/0.64 % Syntax : Number of formulae : 4 ( 0 unt; 0 def)
% 0.20/0.64 % Number of atoms : 30 ( 0 equ)
% 0.20/0.64 % Maximal formula atoms : 11 ( 7 avg)
% 0.20/0.64 % Number of connectives : 26 ( 0 ~; 0 |; 21 &)
% 0.20/0.64 % ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% 0.20/0.64 % Maximal formula depth : 19 ( 13 avg)
% 0.20/0.64 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.64 % Number of predicates : 6 ( 6 usr; 0 prp; 2-3 aty)
% 0.20/0.64 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.64 % Number of variables : 25 ( 24 !; 1 ?)
% 0.20/0.64 % SPC : FOF_THM_RFO_NEQ
% 0.20/0.64
% 0.20/0.64 % Comments : Contains one less theorem predicate than [Kam94].
% 0.20/0.64 %--------------------------------------------------------------------------
% 0.20/0.64 fof(mp3,axiom,
% 0.20/0.64 ! [X,T] :
% 0.20/0.64 ( organization(X,T)
% 0.20/0.64 => ? [Rp] : reproducibility(X,Rp,T) ) ).
% 0.20/0.64
% 0.20/0.64 %----Reliability and accountability require that organizational
% 0.20/0.64 %----structures be highly reproducible.
% 0.20/0.64 fof(a2_FOL,hypothesis,
% 0.20/0.64 ! [X,Y,T1,T2,R1,R2,A1,A2,Rp1,Rp2] :
% 0.20/0.64 ( ( organization(X,T1)
% 0.20/0.64 & organization(Y,T2)
% 0.20/0.64 & reliability(X,R1,T1)
% 0.20/0.64 & reliability(Y,R2,T2)
% 0.20/0.64 & accountability(X,A1,T1)
% 0.20/0.64 & accountability(Y,A2,T2)
% 0.20/0.64 & reproducibility(X,Rp1,T1)
% 0.20/0.64 & reproducibility(Y,Rp2,T2) )
% 0.20/0.64 => ( greater(Rp2,Rp1)
% 0.20/0.64 <=> ( greater(R2,R1)
% 0.20/0.64 & greater(A2,A1) ) ) ) ).
% 0.20/0.64
% 0.20/0.64 %----Reproducibility of structure increases monotonically with age.
% 0.20/0.64 fof(a4_FOL,hypothesis,
% 0.20/0.64 ! [X,Rp1,Rp2,T1,T2] :
% 0.20/0.64 ( ( organization(X,T1)
% 0.20/0.64 & organization(X,T2)
% 0.20/0.64 & reorganization_free(X,T1,T2)
% 0.20/0.64 & reproducibility(X,Rp1,T1)
% 0.20/0.64 & reproducibility(X,Rp2,T2)
% 0.20/0.64 & greater(T2,T1) )
% 0.20/0.64 => greater(Rp2,Rp1) ) ).
% 0.20/0.64
% 0.20/0.64 fof(t6_FOL,conjecture,
% 0.20/0.64 ! [X,R1,R2,A1,A2,T1,T2] :
% 0.20/0.64 ( ( organization(X,T1)
% 0.20/0.64 & organization(X,T2)
% 0.20/0.64 & reorganization_free(X,T1,T2)
% 0.20/0.64 & reliability(X,R1,T1)
% 0.20/0.64 & reliability(X,R2,T2)
% 0.20/0.64 & accountability(X,A1,T1)
% 0.20/0.64 & accountability(X,A2,T2)
% 0.20/0.64 & greater(T2,T1) )
% 0.20/0.64 => ( greater(R2,R1)
% 0.20/0.64 & greater(A2,A1) ) ) ).
% 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:14(EqnAxiom:0)
% 0.20/0.64 %VarNum:103(SingletonVarNum:37)
% 0.20/0.64 %MaxLitNum:11
% 0.20/0.64 %MaxfuncDepth:1
% 0.20/0.64 %SharedTerms:17
% 0.20/0.64 %goalClause: 1 2 3 4 5 6 7 8 9
% 0.20/0.64 %singleGoalClaCount:8
% 0.20/0.64 [1]P1(a1,a3)
% 0.20/0.64 [2]P1(a1,a8)
% 0.20/0.64 [3]P2(a8,a3)
% 0.20/0.64 [4]P4(a1,a4,a3)
% 0.20/0.64 [5]P4(a1,a5,a8)
% 0.20/0.64 [6]P3(a1,a6,a3)
% 0.20/0.64 [7]P3(a1,a7,a8)
% 0.20/0.64 [8]P5(a1,a3,a8)
% 0.20/0.64 [9]~P2(a5,a4)+~P2(a7,a6)
% 0.20/0.64 [10]~P1(x101,x102)+P6(x101,f2(x101,x102),x102)
% 0.20/0.64 [11]~P2(x114,x115)+~P6(x113,x111,x114)+~P6(x113,x112,x115)+~P5(x113,x115,x114)+P2(x111,x112)+~P1(x113,x114)+~P1(x113,x115)
% 0.20/0.64 [12]~P6(x123,x127,x124)+~P6(x125,x128,x126)+~P3(x123,x121,x124)+~P3(x125,x122,x126)+P2(x121,x122)+~P1(x123,x124)+~P4(x123,x129,x124)+~P1(x125,x126)+~P4(x125,x1210,x126)+~P2(x127,x128)
% 0.20/0.64 [13]~P6(x133,x137,x134)+~P6(x135,x138,x136)+~P4(x133,x131,x134)+~P4(x135,x132,x136)+P2(x131,x132)+~P1(x133,x134)+~P3(x133,x139,x134)+~P1(x135,x136)+~P3(x135,x1310,x136)+~P2(x137,x138)
% 0.20/0.64 [14]~P6(x143,x141,x144)+~P6(x145,x142,x146)+~P4(x143,x149,x144)+~P4(x145,x1410,x146)+~P3(x143,x147,x144)+~P3(x145,x148,x146)+P2(x141,x142)+~P1(x143,x144)+~P1(x145,x146)+~P2(x147,x148)+~P2(x149,x1410)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(15,plain,
% 0.20/0.64 (P6(a1,f2(a1,a3),a3)),
% 0.20/0.64 inference(scs_inference,[],[1,10])).
% 0.20/0.64 cnf(24,plain,
% 0.20/0.64 (P6(a1,f2(a1,a8),a8)),
% 0.20/0.64 inference(scs_inference,[],[2,10])).
% 0.20/0.64 cnf(26,plain,
% 0.20/0.64 (P2(f2(a1,a8),f2(a1,a3))),
% 0.20/0.64 inference(scs_inference,[],[2,8,15,3,1,10,11])).
% 0.20/0.64 cnf(34,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[24,15,4,6,5,7,26,1,2,13,12,9]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------