%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT016+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 : n013.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:15 PM UTC 2026
% Result : Theorem 0.14s 0.37s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 86 ( 20 unt; 11 def)
% Number of atoms : 403 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 573 ( 256 ~; 224 |; 77 &)
% ( 11 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 19 ( 18 usr; 12 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 202 ( 182 !; 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,C1,C2,I1,I2,T1,T2] :
( ( greater(C2,C1)
& inertia(Y,I2,T2)
& inertia(X,I1,T1)
& complexity(Y,C2,T2)
& complexity(X,C1,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(Tb,Tc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [X,Y,Rt,C,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,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(Tb,Tc) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [X,Y,Rt,C,C1,C2,Ta,Tb,Tc] :
( ( greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,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(Tb,Tc) ),
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,C1,C2,I1,I2,T1,T2] :
( greater(I2,I1)
| ~ greater(C2,C1)
| ~ inertia(Y,I2,T2)
| ~ inertia(X,I1,T1)
| ~ complexity(Y,C2,T2)
| ~ complexity(X,C1,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)
| ! [C1,C2] :
( ~ greater(C2,C1)
| ! [Y,T2] :
( ~ inertia(Y,I2,T2)
| ! [X,T1] :
( ~ inertia(X,I1,T1)
| ~ complexity(Y,C2,T2)
| ~ complexity(X,C1,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)
| ~ complexity(X2,X6,X3)
| ~ complexity(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(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) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [Tb,Tc] :
( greater(Tb,Tc)
| ! [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(X5,X3)
| ~ 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,C1,C2,Ta,Tb,Tc] :
( ~ greater(Tb,Tc)
& greater(C2,C1)
& complexity(Y,C2,Ta)
& complexity(X,C1,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(Tb,Tc)
& ? [C1,C2] :
( greater(C2,C1)
& ? [Y,Ta] :
( complexity(Y,C2,Ta)
& ? [X] :
( complexity(X,C1,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(sK1_skl,sK2_skl)
& greater(sK4_skl,sK3_skl)
& complexity(sK5_skl,sK4_skl,sK6_skl)
& complexity(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(C1,sK3_skl),skolemize(C2,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,
complexity(sK7_skl,sK3_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f28,plain,
complexity(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(sK1_skl,sK2_skl),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f31,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(sK0_skl(X1,X0),X7)
| ~ greater(X6,X5)
| ~ inertia(X2,X7,X3)
| ~ complexity(X0,X6,X1)
| ~ complexity(X2,X5,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f8,f11]) ).
fof(f32,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(sK0_skl(X1,X0),X7)
| ~ greater(X6,X5)
| ~ inertia(X2,X7,X3)
| ~ complexity(X0,X6,X1)
| ~ complexity(X2,X5,X3)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X3)
| ~ organization(X2,X3)
| ~ organization(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f31]) ).
fof(f33,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ greater(X6,X5)
| ~ inertia(X2,X6,X1)
| ~ inertia(X0,X5,X1)
| ~ reorganization_type(X2,X4,X1)
| ~ reorganization_type(X0,X4,X1)
| ~ reorganization(X2,X1,sK2_skl)
| ~ reorganization(X0,X1,sK1_skl)
| ~ class(X2,X3,X1)
| ~ class(X0,X3,X1)
| organization(X2,sK2_skl)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f14,f30]) ).
fof(f34,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ greater(X5,X4)
| ~ inertia(sK5_skl,X5,X1)
| ~ inertia(X0,X4,X1)
| ~ reorganization_type(sK5_skl,X3,X1)
| ~ reorganization_type(X0,X3,X1)
| ~ reorganization(sK5_skl,X1,sK2_skl)
| ~ reorganization(X0,X1,sK1_skl)
| ~ class(sK5_skl,X2,X1)
| ~ class(X0,X2,X1)
| ~ organization(sK5_skl,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f33,f20]) ).
fof(f35,plain,
! [X0,X1,X2,X3,X4] :
( ~ greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(X0,X3,sK6_skl)
| ~ reorganization_type(sK5_skl,X2,sK6_skl)
| ~ reorganization_type(X0,X2,sK6_skl)
| ~ reorganization(X0,sK6_skl,sK1_skl)
| ~ class(sK5_skl,X1,sK6_skl)
| ~ class(X0,X1,sK6_skl)
| ~ organization(sK5_skl,sK6_skl)
| ~ organization(X0,sK6_skl) ),
inference(resolution,[status(thm)],[f34,f24]) ).
fof(f36,definition,
! [X0,X1,X2,X3,X4] :
( sQ0_spl
<=> ( ~ greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(X0,X3,sK6_skl)
| ~ reorganization_type(sK5_skl,X2,sK6_skl)
| ~ reorganization_type(X0,X2,sK6_skl)
| ~ reorganization(X0,sK6_skl,sK1_skl)
| ~ class(sK5_skl,X1,sK6_skl)
| ~ class(X0,X1,sK6_skl)
| ~ organization(X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f37,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ0_spl
| ~ greater(X4,X3)
| ~ inertia(sK5_skl,X4,sK6_skl)
| ~ inertia(X0,X3,sK6_skl)
| ~ reorganization_type(sK5_skl,X2,sK6_skl)
| ~ reorganization_type(X0,X2,sK6_skl)
| ~ reorganization(X0,sK6_skl,sK1_skl)
| ~ class(sK5_skl,X1,sK6_skl)
| ~ class(X0,X1,sK6_skl)
| ~ organization(X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,definition,
( sQ1_spl
<=> organization(sK5_skl,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f41,plain,
( sQ1_spl
| ~ organization(sK5_skl,sK6_skl) ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f35,f36,f39]) ).
fof(f43,plain,
! [X0,X1,X2,X3] :
( ~ sQ0_spl
| ~ greater(X3,X2)
| ~ inertia(sK5_skl,X3,sK6_skl)
| ~ inertia(sK7_skl,X2,sK6_skl)
| ~ reorganization_type(sK5_skl,X1,sK6_skl)
| ~ reorganization_type(sK7_skl,X1,sK6_skl)
| ~ class(sK5_skl,X0,sK6_skl)
| ~ class(sK7_skl,X0,sK6_skl)
| ~ organization(sK7_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f37,f23]) ).
fof(f46,definition,
( sQ2_spl
<=> organization(sK7_skl,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f48,plain,
( sQ2_spl
| ~ organization(sK7_skl,sK6_skl) ),
inference(component_clause,[status(thm)],[f46]) ).
fof(f49,definition,
! [X0] :
( sQ3_spl
<=> ( ~ class(sK5_skl,X0,sK6_skl)
| ~ class(sK7_skl,X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f50,plain,
! [X0] :
( ~ sQ3_spl
| ~ class(sK5_skl,X0,sK6_skl)
| ~ class(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f49]) ).
fof(f52,definition,
! [X1] :
( sQ4_spl
<=> ( ~ reorganization_type(sK5_skl,X1,sK6_skl)
| ~ reorganization_type(sK7_skl,X1,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f53,plain,
! [X0] :
( ~ sQ4_spl
| ~ reorganization_type(sK5_skl,X0,sK6_skl)
| ~ reorganization_type(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f52]) ).
fof(f55,definition,
! [X2,X3] :
( sQ5_spl
<=> ( ~ greater(X3,X2)
| ~ inertia(sK5_skl,X3,sK6_skl)
| ~ inertia(sK7_skl,X2,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f56,plain,
! [X0,X1] :
( ~ sQ5_spl
| ~ greater(X1,X0)
| ~ inertia(sK5_skl,X1,sK6_skl)
| ~ inertia(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f55]) ).
fof(f58,plain,
( ~ sQ0_spl
| sQ5_spl
| sQ4_spl
| sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f43,f46,f49,f52,f55,f36]) ).
fof(f63,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f41,f19]) ).
fof(f64,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f63]) ).
fof(f70,plain,
! [X0] :
( ~ sQ5_spl
| ~ organization(sK7_skl,sK6_skl)
| ~ greater(X0,sK0_skl(sK6_skl,sK7_skl))
| ~ inertia(sK5_skl,X0,sK6_skl) ),
inference(resolution,[status(thm)],[f56,f8]) ).
fof(f71,definition,
! [X0] :
( sQ7_spl
<=> ( ~ greater(X0,sK0_skl(sK6_skl,sK7_skl))
| ~ inertia(sK5_skl,X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f72,plain,
! [X0] :
( ~ sQ7_spl
| ~ greater(X0,sK0_skl(sK6_skl,sK7_skl))
| ~ inertia(sK5_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f71]) ).
fof(f74,plain,
( ~ sQ5_spl
| ~ sQ2_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f70,f71,f46,f55]) ).
fof(f75,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f48,f18]) ).
fof(f76,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f75]) ).
fof(f77,plain,
( ~ sQ4_spl
| ~ reorganization_type(sK5_skl,sK8_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f53,f25]) ).
fof(f78,plain,
( ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f77,f26]) ).
fof(f79,plain,
~ sQ4_spl,
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f80,plain,
( ~ sQ3_spl
| ~ class(sK5_skl,sK9_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f50,f21]) ).
fof(f81,plain,
( ~ sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f80,f22]) ).
fof(f82,plain,
~ sQ3_spl,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
( ~ sQ7_spl
| ~ organization(sK5_skl,sK6_skl)
| ~ greater(sK0_skl(sK6_skl,sK5_skl),sK0_skl(sK6_skl,sK7_skl)) ),
inference(resolution,[status(thm)],[f72,f8]) ).
fof(f84,definition,
( sQ8_spl
<=> greater(sK0_skl(sK6_skl,sK5_skl),sK0_skl(sK6_skl,sK7_skl)) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f86,plain,
( sQ8_spl
| ~ greater(sK0_skl(sK6_skl,sK5_skl),sK0_skl(sK6_skl,sK7_skl)) ),
inference(component_clause,[status(thm)],[f84]) ).
fof(f87,plain,
( ~ sQ7_spl
| ~ sQ1_spl
| ~ sQ8_spl ),
inference(split_clause,[status(thm)],[f83,f84,f39,f71]) ).
fof(f88,plain,
! [X0,X1,X2,X3,X4] :
( sQ8_spl
| ~ greater(X4,X3)
| ~ inertia(X0,sK0_skl(sK6_skl,sK7_skl),X1)
| ~ complexity(sK5_skl,X4,sK6_skl)
| ~ complexity(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1)
| ~ organization(sK5_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f86,f32]) ).
fof(f90,definition,
! [X0,X1,X2,X3,X4] :
( sQ9_spl
<=> ( ~ greater(X4,X3)
| ~ inertia(X0,sK0_skl(sK6_skl,sK7_skl),X1)
| ~ complexity(sK5_skl,X4,sK6_skl)
| ~ complexity(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f91,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ9_spl
| ~ greater(X4,X3)
| ~ inertia(X0,sK0_skl(sK6_skl,sK7_skl),X1)
| ~ complexity(sK5_skl,X4,sK6_skl)
| ~ complexity(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(component_clause,[status(thm)],[f90]) ).
fof(f93,plain,
( sQ8_spl
| sQ9_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f88,f39,f90,f84]) ).
fof(f96,plain,
! [X0,X1,X2,X3] :
( ~ sQ9_spl
| ~ greater(sK4_skl,X3)
| ~ inertia(X0,sK0_skl(sK6_skl,sK7_skl),X1)
| ~ complexity(X0,X3,X1)
| ~ class(sK5_skl,X2,sK6_skl)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f91,f28]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ sQ9_spl
| ~ greater(sK4_skl,X2)
| ~ inertia(X0,sK0_skl(sK6_skl,sK7_skl),X1)
| ~ complexity(X0,X2,X1)
| ~ class(X0,sK9_skl,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f96,f22]) ).
fof(f98,plain,
! [X0] :
( ~ sQ9_spl
| ~ organization(sK7_skl,sK6_skl)
| ~ greater(sK4_skl,X0)
| ~ complexity(sK7_skl,X0,sK6_skl)
| ~ class(sK7_skl,sK9_skl,sK6_skl)
| ~ organization(sK7_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f97,f8]) ).
fof(f99,definition,
( sQ10_spl
<=> class(sK7_skl,sK9_skl,sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f101,plain,
( sQ10_spl
| ~ class(sK7_skl,sK9_skl,sK6_skl) ),
inference(component_clause,[status(thm)],[f99]) ).
fof(f102,definition,
! [X0] :
( sQ11_spl
<=> ( ~ greater(sK4_skl,X0)
| ~ complexity(sK7_skl,X0,sK6_skl) ) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f103,plain,
! [X0] :
( ~ sQ11_spl
| ~ greater(sK4_skl,X0)
| ~ complexity(sK7_skl,X0,sK6_skl) ),
inference(component_clause,[status(thm)],[f102]) ).
fof(f105,plain,
( ~ sQ9_spl
| sQ11_spl
| ~ sQ10_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f98,f46,f99,f102,f90]) ).
fof(f106,plain,
( sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f101,f21]) ).
fof(f107,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f106]) ).
fof(f108,plain,
( ~ sQ11_spl
| ~ greater(sK4_skl,sK3_skl) ),
inference(resolution,[status(thm)],[f103,f27]) ).
fof(f109,plain,
( ~ sQ11_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f108,f29]) ).
fof(f110,plain,
~ sQ11_spl,
inference(contradiction_clause,[status(thm)],[f109]) ).
fof(f111,plain,
$false,
inference(sat_refutation,[status(thm)],[f42,f58,f64,f74,f76,f79,f82,f87,f93,f105,f107,f110]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT016+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.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 01:20:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.14/0.37 % Refutation found
% 0.14/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.40 % Elapsed time: 0.030735 seconds
% 0.14/0.40 % CPU time: 0.072972 seconds
% 0.14/0.40 % Total memory used: 4.795 MB
% 0.14/0.40 % Net memory used: 4.736 MB
%------------------------------------------------------------------------------