%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT017+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:16 PM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 91 ( 24 unt; 13 def)
% Number of atoms : 389 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 518 ( 220 ~; 203 |; 77 &)
% ( 13 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 14 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 189 ( 169 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,T] :
( organization(X,T)
=> ? [I] : inertia(X,I,T) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,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/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,hypothesis,
! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] :
( ( greater(I2,I1)
& inertia(Y,I2,Ta)
& inertia(X,I1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [X,Y,Rt,C,S1,S2,Ta,Tb,Tc] :
( ( greater(S2,S1)
& size(Y,S2,Ta)
& size(X,S1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [X,Y,Rt,C,S1,S2,Ta,Tb,Tc] :
( ( greater(S2,S1)
& size(Y,S2,Ta)
& size(X,S1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) )
=> greater(Tc,Tb) ),
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,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)],[f2]) ).
fof(f10,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)],[f9]) ).
fof(f11,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)],[f10]) ).
fof(f12,plain,
! [X,Y,Rt,C,I1,I2,Ta,Tb,Tc] :
( greater(Tc,Tb)
| ~ greater(I2,I1)
| ~ inertia(Y,I2,Ta)
| ~ inertia(X,I1,Ta)
| ~ reorganization_type(Y,Rt,Ta)
| ~ reorganization_type(X,Rt,Ta)
| ~ reorganization(Y,Ta,Tc)
| ~ reorganization(X,Ta,Tb)
| ~ class(Y,C,Ta)
| ~ class(X,C,Ta)
| ~ organization(Y,Tc)
| ~ organization(Y,Ta)
| ~ organization(X,Ta) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [Tb,Tc] :
( greater(Tc,Tb)
| ! [I1,I2] :
( ~ greater(I2,I1)
| ! [Y,Ta] :
( ~ inertia(Y,I2,Ta)
| ! [X] :
( ~ inertia(X,I1,Ta)
| ! [Rt] :
( ~ reorganization_type(Y,Rt,Ta)
| ~ reorganization_type(X,Rt,Ta)
| ~ reorganization(Y,Ta,Tc)
| ~ reorganization(X,Ta,Tb)
| ! [C] :
( ~ class(Y,C,Ta)
| ~ class(X,C,Ta)
| ~ organization(Y,Tc)
| ~ organization(Y,Ta)
| ~ organization(X,Ta) ) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f12]) ).
fof(f14,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X3,X5)
| ~ greater(X8,X7)
| ~ inertia(X2,X8,X1)
| ~ inertia(X0,X7,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization(X2,X1,X3)
| ~ reorganization(X0,X1,X5)
| ~ class(X2,X4,X1)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f15,plain,
? [X,Y,Rt,C,S1,S2,Ta,Tb,Tc] :
( ~ greater(Tc,Tb)
& greater(S2,S1)
& size(Y,S2,Ta)
& size(X,S1,Ta)
& reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f16,plain,
? [Tb,Tc] :
( ~ greater(Tc,Tb)
& ? [S1,S2] :
( greater(S2,S1)
& ? [Y,Ta] :
( size(Y,S2,Ta)
& ? [X] :
( size(X,S1,Ta)
& ? [Rt] :
( reorganization_type(Y,Rt,Ta)
& reorganization_type(X,Rt,Ta)
& reorganization(Y,Ta,Tc)
& reorganization(X,Ta,Tb)
& ? [C] :
( class(Y,C,Ta)
& class(X,C,Ta)
& organization(Y,Tc)
& organization(Y,Ta)
& organization(X,Ta) ) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f15]) ).
fof(f17,plain,
( ~ greater(sK2_skl,sK1_skl)
& greater(sK4_skl,sK3_skl)
& size(sK5_skl,sK4_skl,sK6_skl)
& size(sK7_skl,sK3_skl,sK6_skl)
& reorganization_type(sK5_skl,sK8_skl,sK6_skl)
& reorganization_type(sK7_skl,sK8_skl,sK6_skl)
& reorganization(sK5_skl,sK6_skl,sK2_skl)
& reorganization(sK7_skl,sK6_skl,sK1_skl)
& class(sK5_skl,sK9_skl,sK6_skl)
& class(sK7_skl,sK9_skl,sK6_skl)
& organization(sK5_skl,sK2_skl)
& organization(sK5_skl,sK6_skl)
& organization(sK7_skl,sK6_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(Tb,sK1_skl),skolemize(Tc,sK2_skl),skolemize(S1,sK3_skl),skolemize(S2,sK4_skl),skolemize(Y,sK5_skl),skolemize(Ta,sK6_skl),skolemize(X,sK7_skl),skolemize(Rt,sK8_skl),skolemize(C,sK9_skl)],[f16]) ).
fof(f18,plain,
organization(sK7_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,plain,
organization(sK5_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f20,plain,
organization(sK5_skl,sK2_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f21,plain,
class(sK7_skl,sK9_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f22,plain,
class(sK5_skl,sK9_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f23,plain,
reorganization(sK7_skl,sK6_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f24,plain,
reorganization(sK5_skl,sK6_skl,sK2_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f25,plain,
reorganization_type(sK7_skl,sK8_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f26,plain,
reorganization_type(sK5_skl,sK8_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f27,plain,
size(sK7_skl,sK3_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f28,plain,
size(sK5_skl,sK4_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f29,plain,
greater(sK4_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f30,plain,
~ greater(sK2_skl,sK1_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f32,plain,
inertia(sK5_skl,sK0_skl(sK6_skl,sK5_skl),sK6_skl),
inference(resolution,[status(thm)],[f8,f19]) ).
fof(f33,plain,
inertia(sK7_skl,sK0_skl(sK6_skl,sK7_skl),sK6_skl),
inference(resolution,[status(thm)],[f8,f18]) ).
fof(f34,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X5,X4)
| ~ greater(X3,X2)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ size(X0,X3,X1)
| ~ size(sK7_skl,X2,sK6_skl)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1)
| ~ organization(sK7_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f11,f21]) ).
fof(f35,definition,
( sQ0_spl
<=> organization(sK7_skl,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f37,plain,
( sQ0_spl
| ~ organization(sK7_skl,sK6_skl) ),
inference(component_clause,[status(thm)],[f35]) ).
fof(f38,definition,
! [X0,X1,X2,X3,X4,X5] :
( sQ1_spl
<=> ( greater(X5,X4)
| ~ greater(X3,X2)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ size(X0,X3,X1)
| ~ size(sK7_skl,X2,sK6_skl)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f39,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sQ1_spl
| greater(X5,X4)
| ~ greater(X3,X2)
| ~ inertia(X0,X5,X1)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ size(X0,X3,X1)
| ~ size(sK7_skl,X2,sK6_skl)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(component_clause,[status(thm)],[f38]) ).
fof(f41,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f34,f35,f38]) ).
fof(f42,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f37,f18]) ).
fof(f43,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f42]) ).
fof(f45,definition,
( sQ2_spl
<=> organization(sK5_skl,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f47,plain,
( sQ2_spl
| ~ organization(sK5_skl,sK6_skl) ),
inference(component_clause,[status(thm)],[f45]) ).
fof(f52,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f47,f19]) ).
fof(f53,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f52]) ).
fof(f55,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X1,X2)
| ~ greater(X5,X4)
| ~ inertia(X0,X5,sK6_skl)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ reorganization_type(X0,X3,sK6_skl)
| ~ reorganization_type(sK7_skl,X3,sK6_skl)
| ~ reorganization(X0,sK6_skl,X1)
| ~ reorganization(sK7_skl,sK6_skl,X2)
| ~ class(X0,sK9_skl,sK6_skl)
| ~ organization(X0,X1)
| ~ organization(X0,sK6_skl)
| ~ organization(sK7_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f14,f21]) ).
fof(f60,definition,
! [X0,X1,X2,X3,X4,X5] :
( sQ5_spl
<=> ( greater(X1,X2)
| ~ greater(X5,X4)
| ~ inertia(X0,X5,sK6_skl)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ reorganization_type(X0,X3,sK6_skl)
| ~ reorganization_type(sK7_skl,X3,sK6_skl)
| ~ reorganization(X0,sK6_skl,X1)
| ~ reorganization(sK7_skl,sK6_skl,X2)
| ~ class(X0,sK9_skl,sK6_skl)
| ~ organization(X0,X1)
| ~ organization(X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f61,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sQ5_spl
| greater(X1,X2)
| ~ greater(X5,X4)
| ~ inertia(X0,X5,sK6_skl)
| ~ inertia(sK7_skl,X4,sK6_skl)
| ~ reorganization_type(X0,X3,sK6_skl)
| ~ reorganization_type(sK7_skl,X3,sK6_skl)
| ~ reorganization(X0,sK6_skl,X1)
| ~ reorganization(sK7_skl,sK6_skl,X2)
| ~ class(X0,sK9_skl,sK6_skl)
| ~ organization(X0,X1)
| ~ organization(X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f60]) ).
fof(f63,plain,
( sQ5_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f55,f35,f60]) ).
fof(f64,plain,
! [X0,X1,X2,X3] :
( ~ sQ1_spl
| greater(X3,X2)
| ~ greater(X1,X0)
| ~ inertia(sK5_skl,X3,sK6_skl)
| ~ inertia(sK7_skl,X2,sK6_skl)
| ~ size(sK5_skl,X1,sK6_skl)
| ~ size(sK7_skl,X0,sK6_skl)
| ~ organization(sK5_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f39,f22]) ).
fof(f66,definition,
! [X0,X1] :
( sQ6_spl
<=> ( ~ greater(X1,X0)
| ~ size(sK5_skl,X1,sK6_skl)
| ~ size(sK7_skl,X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f67,plain,
! [X0,X1] :
( ~ sQ6_spl
| ~ greater(X1,X0)
| ~ size(sK5_skl,X1,sK6_skl)
| ~ size(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f66]) ).
fof(f69,definition,
! [X2,X3] :
( sQ7_spl
<=> ( greater(X3,X2)
| ~ inertia(sK5_skl,X3,sK6_skl)
| ~ inertia(sK7_skl,X2,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f70,plain,
! [X0,X1] :
( ~ sQ7_spl
| greater(X1,X0)
| ~ inertia(sK5_skl,X1,sK6_skl)
| ~ inertia(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f69]) ).
fof(f72,plain,
( ~ sQ1_spl
| sQ7_spl
| sQ6_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f64,f45,f66,f69,f38]) ).
fof(f80,plain,
! [X0] :
( ~ sQ6_spl
| ~ greater(X0,sK3_skl)
| ~ size(sK5_skl,X0,sK6_skl) ),
inference(resolution,[status(thm)],[f67,f27]) ).
fof(f81,plain,
( ~ sQ6_spl
| ~ greater(sK4_skl,sK3_skl) ),
inference(resolution,[status(thm)],[f80,f28]) ).
fof(f82,plain,
( ~ sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f81,f29]) ).
fof(f83,plain,
~ sQ6_spl,
inference(contradiction_clause,[status(thm)],[f82]) ).
fof(f103,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ5_spl
| greater(X0,X1)
| ~ greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(sK7_skl,X3,sK6_skl)
| ~ reorganization_type(sK5_skl,X2,sK6_skl)
| ~ reorganization_type(sK7_skl,X2,sK6_skl)
| ~ reorganization(sK5_skl,sK6_skl,X0)
| ~ reorganization(sK7_skl,sK6_skl,X1)
| ~ organization(sK5_skl,X0)
| ~ organization(sK5_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f61,f22]) ).
fof(f105,definition,
! [X0,X1] :
( sQ14_spl
<=> ( greater(X0,X1)
| ~ reorganization(sK5_skl,sK6_skl,X0)
| ~ reorganization(sK7_skl,sK6_skl,X1)
| ~ organization(sK5_skl,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ14_spl])],[split_symbol_definition]) ).
fof(f106,plain,
! [X0,X1] :
( ~ sQ14_spl
| greater(X0,X1)
| ~ reorganization(sK5_skl,sK6_skl,X0)
| ~ reorganization(sK7_skl,sK6_skl,X1)
| ~ organization(sK5_skl,X0) ),
inference(component_clause,[status(thm)],[f105]) ).
fof(f108,definition,
! [X2] :
( sQ15_spl
<=> ( ~ reorganization_type(sK5_skl,X2,sK6_skl)
| ~ reorganization_type(sK7_skl,X2,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f109,plain,
! [X0] :
( ~ sQ15_spl
| ~ reorganization_type(sK5_skl,X0,sK6_skl)
| ~ reorganization_type(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f108]) ).
fof(f111,definition,
! [X3,X4] :
( sQ16_spl
<=> ( ~ greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(sK7_skl,X3,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ16_spl])],[split_symbol_definition]) ).
fof(f112,plain,
! [X0,X1] :
( ~ sQ16_spl
| ~ greater(X1,X0)
| ~ inertia(sK5_skl,X1,sK6_skl)
| ~ inertia(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f111]) ).
fof(f114,plain,
( ~ sQ5_spl
| sQ16_spl
| sQ15_spl
| sQ14_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f103,f45,f105,f108,f111,f60]) ).
fof(f126,plain,
! [X0,X1] :
( ~ sQ16_spl
| ~ sQ7_spl
| ~ inertia(sK5_skl,X1,sK6_skl)
| ~ inertia(sK7_skl,X0,sK6_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f112,f70]) ).
fof(f149,plain,
( ~ sQ15_spl
| ~ reorganization_type(sK7_skl,sK8_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f109,f26]) ).
fof(f150,plain,
( ~ sQ15_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f149,f25]) ).
fof(f151,plain,
~ sQ15_spl,
inference(contradiction_clause,[status(thm)],[f150]) ).
fof(f180,plain,
! [X0] :
( ~ sQ14_spl
| greater(X0,sK1_skl)
| ~ reorganization(sK5_skl,sK6_skl,X0)
| ~ organization(sK5_skl,X0) ),
inference(resolution,[status(thm)],[f106,f23]) ).
fof(f182,plain,
( ~ sQ14_spl
| greater(sK2_skl,sK1_skl)
| ~ organization(sK5_skl,sK2_skl) ),
inference(resolution,[status(thm)],[f180,f24]) ).
fof(f183,definition,
( sQ28_spl
<=> organization(sK5_skl,sK2_skl) ),
introduced(definition,[new_symbols(definition,[sQ28_spl])],[split_symbol_definition]) ).
fof(f185,plain,
( sQ28_spl
| ~ organization(sK5_skl,sK2_skl) ),
inference(component_clause,[status(thm)],[f183]) ).
fof(f186,definition,
( sQ29_spl
<=> greater(sK2_skl,sK1_skl) ),
introduced(definition,[new_symbols(definition,[sQ29_spl])],[split_symbol_definition]) ).
fof(f187,plain,
( ~ sQ29_spl
| greater(sK2_skl,sK1_skl) ),
inference(component_clause,[status(thm)],[f186]) ).
fof(f189,plain,
( ~ sQ14_spl
| sQ29_spl
| ~ sQ28_spl ),
inference(split_clause,[status(thm)],[f182,f183,f186,f105]) ).
fof(f190,definition,
! [X0] :
( sQ30_spl
<=> ~ inertia(sK7_skl,X0,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f191,plain,
! [X0] :
( ~ sQ30_spl
| ~ inertia(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f190]) ).
fof(f193,definition,
! [X1] :
( sQ31_spl
<=> ~ inertia(sK5_skl,X1,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition]) ).
fof(f194,plain,
! [X0] :
( ~ sQ31_spl
| ~ inertia(sK5_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f193]) ).
fof(f196,plain,
( ~ sQ16_spl
| ~ sQ7_spl
| sQ31_spl
| sQ30_spl ),
inference(split_clause,[status(thm)],[f126,f190,f193,f69,f111]) ).
fof(f197,plain,
( ~ sQ29_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f187,f30]) ).
fof(f198,plain,
~ sQ29_spl,
inference(contradiction_clause,[status(thm)],[f197]) ).
fof(f199,plain,
( sQ28_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f185,f20]) ).
fof(f200,plain,
sQ28_spl,
inference(contradiction_clause,[status(thm)],[f199]) ).
fof(f201,plain,
( ~ sQ31_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f32,f194]) ).
fof(f202,plain,
~ sQ31_spl,
inference(contradiction_clause,[status(thm)],[f201]) ).
fof(f203,plain,
( ~ sQ30_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f33,f191]) ).
fof(f204,plain,
~ sQ30_spl,
inference(contradiction_clause,[status(thm)],[f203]) ).
fof(f205,plain,
$false,
inference(sat_refutation,[status(thm)],[f41,f43,f53,f63,f72,f83,f114,f151,f189,f196,f198,f200,f202,f204]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT017+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n026.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 01:24:07 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.09/0.38 % Refutation found
% 0.09/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.054851 seconds
% 0.13/0.42 % CPU time: 0.094949 seconds
% 0.13/0.42 % Total memory used: 5.483 MB
% 0.13/0.42 % Net memory used: 5.449 MB
%------------------------------------------------------------------------------