%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 : Thu Sep 24 01:25:14 PM UTC 2026
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 53 ( 14 unt; 0 def)
% Number of atoms : 319 ( 0 equ)
% Maximal formula atoms : 12 ( 6 avg)
% Number of connectives : 471 ( 205 ~; 189 |; 70 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 208 ( 188 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,hypothesis,
! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
( ( inertia(Y,I2,T2)
& inertia(X,I1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> ( greater(Rp2,Rp1)
<=> greater(I2,I1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,hypothesis,
! [X,Y,C,S1,S2,I1,I2,T1,T2] :
( ( greater(S2,S1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& size(Y,S2,T2)
& size(X,S1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(I2,I1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [X,Y,C,Rp1,Rp2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(Rp2,Rp1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [X,Y,C,Rp1,Rp2,S1,S2,T1,T2] :
( ( greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) )
=> greater(Rp2,Rp1) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X,T] :
( ? [I] : inertia(X,I,T)
| ~ organization(X,T) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f7,plain,
! [X,T] :
( inertia(X,sK0_skl(T,X),T)
| ~ organization(X,T) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(I,sK0_skl(T,X))],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( inertia(X0,sK0_skl(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f9,plain,
! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
( ( greater(Rp2,Rp1)
<=> greater(I2,I1) )
| ~ inertia(Y,I2,T2)
| ~ inertia(X,I1,T1)
| ~ reproducibility(Y,Rp2,T2)
| ~ reproducibility(X,Rp1,T1)
| ~ reorganization_free(Y,T2,T2)
| ~ reorganization_free(X,T1,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
! [X,Y,T1,T2,Rp1,Rp2,I1,I2] :
( ( ( ~ greater(I2,I1)
| greater(Rp2,Rp1) )
& ( greater(I2,I1)
| ~ greater(Rp2,Rp1) ) )
| ~ inertia(Y,I2,T2)
| ~ inertia(X,I1,T1)
| ~ reproducibility(Y,Rp2,T2)
| ~ reproducibility(X,Rp1,T1)
| ~ reorganization_free(Y,T2,T2)
| ~ reorganization_free(X,T1,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ),
inference(NNF_transformation,[status(thm)],[f9]) ).
fof(f11,plain,
! [Rp1,Rp2,I1,I2] :
( ( ( ~ greater(I2,I1)
| greater(Rp2,Rp1) )
& ( greater(I2,I1)
| ~ greater(Rp2,Rp1) ) )
| ! [Y,T2] :
( ~ inertia(Y,I2,T2)
| ! [X,T1] :
( ~ inertia(X,I1,T1)
| ~ reproducibility(Y,Rp2,T2)
| ~ reproducibility(X,Rp1,T1)
| ~ reorganization_free(Y,T2,T2)
| ~ reorganization_free(X,T1,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ) ) ),
inference(miniscoping,[status(thm)],[f10]) ).
fof(f13,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ greater(X7,X6)
| greater(X5,X4)
| ~ inertia(X2,X7,X3)
| ~ inertia(X0,X6,X1)
| ~ reproducibility(X2,X5,X3)
| ~ reproducibility(X0,X4,X1)
| ~ reorganization_free(X2,X3,X3)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f14,plain,
! [X,Y,C,S1,S2,I1,I2,T1,T2] :
( greater(I2,I1)
| ~ greater(S2,S1)
| ~ inertia(Y,I2,T2)
| ~ inertia(X,I1,T1)
| ~ size(Y,S2,T2)
| ~ size(X,S1,T1)
| ~ class(Y,C,T2)
| ~ class(X,C,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f15,plain,
! [I1,I2] :
( greater(I2,I1)
| ! [S1,S2] :
( ~ greater(S2,S1)
| ! [Y,T2] :
( ~ inertia(Y,I2,T2)
| ! [X,T1] :
( ~ inertia(X,I1,T1)
| ~ size(Y,S2,T2)
| ~ size(X,S1,T1)
| ! [C] :
( ~ class(Y,C,T2)
| ~ class(X,C,T1)
| ~ organization(Y,T2)
| ~ organization(X,T1) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f14]) ).
fof(f16,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X8,X7)
| ~ greater(X6,X5)
| ~ inertia(X2,X8,X3)
| ~ inertia(X0,X7,X1)
| ~ size(X2,X6,X3)
| ~ size(X0,X5,X1)
| ~ class(X2,X4,X3)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f17,plain,
? [X,Y,C,Rp1,Rp2,S1,S2,T1,T2] :
( ~ greater(Rp2,Rp1)
& greater(S2,S1)
& size(Y,S2,T2)
& size(X,S1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f18,plain,
? [Rp1,Rp2] :
( ~ greater(Rp2,Rp1)
& ? [S1,S2] :
( greater(S2,S1)
& ? [Y,T2] :
( size(Y,S2,T2)
& ? [X,T1] :
( size(X,S1,T1)
& reproducibility(Y,Rp2,T2)
& reproducibility(X,Rp1,T1)
& ? [C] :
( class(Y,C,T2)
& class(X,C,T1)
& reorganization_free(Y,T2,T2)
& reorganization_free(X,T1,T1)
& organization(Y,T2)
& organization(X,T1) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f17]) ).
fof(f19,plain,
( ~ greater(sK2_skl,sK1_skl)
& greater(sK4_skl,sK3_skl)
& size(sK5_skl,sK4_skl,sK6_skl)
& size(sK7_skl,sK3_skl,sK8_skl)
& reproducibility(sK5_skl,sK2_skl,sK6_skl)
& reproducibility(sK7_skl,sK1_skl,sK8_skl)
& class(sK5_skl,sK9_skl,sK6_skl)
& class(sK7_skl,sK9_skl,sK8_skl)
& reorganization_free(sK5_skl,sK6_skl,sK6_skl)
& reorganization_free(sK7_skl,sK8_skl,sK8_skl)
& organization(sK5_skl,sK6_skl)
& organization(sK7_skl,sK8_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl,sK4_skl,sK5_skl,sK6_skl,sK7_skl,sK8_skl,sK9_skl]),skolemize(Rp1,sK1_skl),skolemize(Rp2,sK2_skl),skolemize(S1,sK3_skl),skolemize(S2,sK4_skl),skolemize(Y,sK5_skl),skolemize(T2,sK6_skl),skolemize(X,sK7_skl),skolemize(T1,sK8_skl),skolemize(C,sK9_skl)],[f18]) ).
fof(f20,plain,
organization(sK7_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f21,plain,
organization(sK5_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f22,plain,
reorganization_free(sK7_skl,sK8_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f23,plain,
reorganization_free(sK5_skl,sK6_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f24,plain,
class(sK7_skl,sK9_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f25,plain,
class(sK5_skl,sK9_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f26,plain,
reproducibility(sK7_skl,sK1_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f27,plain,
reproducibility(sK5_skl,sK2_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f28,plain,
size(sK7_skl,sK3_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f29,plain,
size(sK5_skl,sK4_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f30,plain,
greater(sK4_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f31,plain,
~ greater(sK2_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f36,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ greater(X5,X4)
| greater(X3,X2)
| ~ inertia(sK5_skl,X5,sK6_skl)
| ~ inertia(X0,X4,X1)
| ~ reproducibility(sK5_skl,X3,sK6_skl)
| ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(sK5_skl,sK6_skl)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f23,f13]) ).
fof(f38,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ greater(X5,X4)
| greater(X3,X2)
| ~ inertia(sK5_skl,X5,sK6_skl)
| ~ inertia(X0,X4,X1)
| ~ reproducibility(sK5_skl,X3,sK6_skl)
| ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f36,f21]) ).
fof(f42,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X5,X4)
| ~ greater(sK4_skl,X3)
| ~ inertia(sK5_skl,X5,sK6_skl)
| ~ inertia(X0,X4,X1)
| ~ size(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(sK5_skl,sK6_skl)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f29,f16]) ).
fof(f43,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X5,X4)
| ~ greater(sK4_skl,X3)
| ~ inertia(sK5_skl,X5,sK6_skl)
| ~ inertia(X0,X4,X1)
| ~ size(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f42,f21]) ).
fof(f49,plain,
! [X0,X1,X2,X3,X4] :
( ~ organization(sK5_skl,sK6_skl)
| ~ greater(sK0_skl(sK6_skl,sK5_skl),X4)
| greater(X3,X2)
| ~ inertia(X0,X4,X1)
| ~ reproducibility(sK5_skl,X3,sK6_skl)
| ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f38,f8]) ).
fof(f50,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(sK0_skl(sK6_skl,sK5_skl),X4)
| greater(X3,X2)
| ~ inertia(X0,X4,X1)
| ~ reproducibility(sK5_skl,X3,sK6_skl)
| ~ reproducibility(X0,X2,X1)
| ~ reorganization_free(X0,X1,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f49,f21]) ).
fof(f54,plain,
! [X0,X1,X2,X3,X4] :
( greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f43,f30]) ).
fof(f56,plain,
! [X0,X1,X2,X3] :
( ~ organization(sK5_skl,sK6_skl)
| greater(sK0_skl(sK6_skl,sK5_skl),X3)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f54,f8]) ).
fof(f57,plain,
! [X0,X1,X2,X3] :
( greater(sK0_skl(sK6_skl,sK5_skl),X3)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f56,f21]) ).
fof(f58,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X7,X6)
| ~ inertia(X4,X3,X5)
| ~ reproducibility(sK5_skl,X7,sK6_skl)
| ~ reproducibility(X4,X6,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f57,f50]) ).
fof(f63,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( greater(sK2_skl,X6)
| ~ inertia(X4,X3,X5)
| ~ reproducibility(X4,X6,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f58,f27]) ).
fof(f64,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ inertia(X4,X3,X5)
| ~ reproducibility(X4,sK1_skl,X5)
| ~ reorganization_free(X4,X5,X5)
| ~ organization(X4,X5)
| ~ inertia(X0,X3,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f63,f31]) ).
fof(f69,plain,
! [X0,X1,X2,X3,X4] :
( ~ inertia(X3,X2,X4)
| ~ reproducibility(X3,sK1_skl,X4)
| ~ reorganization_free(X3,X4,X4)
| ~ organization(X3,X4)
| ~ inertia(X0,X2,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f64,f25]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ~ inertia(sK7_skl,X2,sK8_skl)
| ~ reorganization_free(sK7_skl,sK8_skl,sK8_skl)
| ~ organization(sK7_skl,sK8_skl)
| ~ inertia(X0,X2,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f69,f26]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ inertia(sK7_skl,X2,sK8_skl)
| ~ reorganization_free(sK7_skl,sK8_skl,sK8_skl)
| ~ inertia(X0,X2,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f72,f20]) ).
fof(f74,plain,
! [X0,X1,X2] :
( ~ inertia(sK7_skl,X2,sK8_skl)
| ~ inertia(X0,X2,X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f73,f22]) ).
fof(f75,plain,
! [X0,X1] :
( ~ organization(sK7_skl,sK8_skl)
| ~ inertia(X0,sK0_skl(sK8_skl,sK7_skl),X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f74,f8]) ).
fof(f76,plain,
! [X0,X1] :
( ~ inertia(X0,sK0_skl(sK8_skl,sK7_skl),X1)
| ~ size(X0,sK3_skl,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f75,f20]) ).
fof(f79,plain,
( ~ organization(sK7_skl,sK8_skl)
| ~ size(sK7_skl,sK3_skl,sK8_skl)
| ~ class(sK7_skl,sK9_skl,sK8_skl)
| ~ organization(sK7_skl,sK8_skl) ),
inference(resolution,[status(thm)],[f76,f8]) ).
fof(f80,plain,
( ~ size(sK7_skl,sK3_skl,sK8_skl)
| ~ class(sK7_skl,sK9_skl,sK8_skl)
| ~ organization(sK7_skl,sK8_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f79]) ).
fof(f81,plain,
( ~ size(sK7_skl,sK3_skl,sK8_skl)
| ~ class(sK7_skl,sK9_skl,sK8_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f80,f20]) ).
fof(f83,plain,
~ size(sK7_skl,sK3_skl,sK8_skl),
inference(forward_subsumption_resolution,[status(thm)],[f81,f24]) ).
fof(f84,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f28,f83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT009+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 % Computer : n003.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 01:22:31 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.47 % Drodi V4.1.1
% 0.20/0.50 % Refutation found
% 0.20/0.50 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.56 % Elapsed time: 0.091745 seconds
% 0.24/0.56 % CPU time: 0.203636 seconds
% 0.24/0.56 % Total memory used: 29.164 MB
% 0.24/0.56 % Net memory used: 29.011 MB
%------------------------------------------------------------------------------