%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT005-2 : TPTP v9.3.1. Released v2.4.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:13 PM UTC 2026
% Result : Unsatisfiable 2.21s 1.28s
% Output : CNFRefutation 2.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 44
% Syntax : Number of formulae : 143 ( 55 unt; 20 def)
% Number of atoms : 505 ( 20 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 702 ( 340 ~; 342 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 29 ( 27 usr; 21 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 180 ( 180 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [A,B,C,D] :
( organization(A,D)
| ~ greater(C,D)
| ~ greater(D,B)
| ~ organization(A,C)
| ~ organization(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [A,B,C] :
( greater(C,B)
| ~ reorganization(A,B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,hypothesis,
! [A,B,C,D,E,F,G,H,I] :
( greater(D,F)
| ~ greater(I,H)
| ~ complexity(C,I,B)
| ~ complexity(A,H,B)
| ~ reorganization_type(C,G,B)
| ~ reorganization_type(A,G,B)
| ~ reorganization(C,B,D)
| ~ reorganization(A,B,F)
| ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(C,B)
| ~ organization(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,hypothesis,
! [A,B,C,D,E,F,G,H,I,J,K,L] :
( I = J
| greater(I,J)
| ~ greater(L,K)
| ~ complexity(C,L,B)
| ~ complexity(A,K,B)
| ~ survival_chance(C,J,D)
| ~ survival_chance(A,I,D)
| ~ reorganization_type(C,H,B)
| ~ reorganization_type(A,H,B)
| ~ reorganization(C,B,G)
| ~ reorganization(A,B,D)
| ~ survival_chance(C,F,B)
| ~ survival_chance(A,F,B)
| ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,D)
| ~ organization(C,B)
| ~ organization(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
organization(sk5,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,negated_conjecture,
organization(sk6,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,negated_conjecture,
organization(sk5,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
organization(sk6,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,negated_conjecture,
class(sk5,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,negated_conjecture,
class(sk6,sk8,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
survival_chance(sk5,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,negated_conjecture,
survival_chance(sk6,sk9,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f25,negated_conjecture,
reorganization(sk5,sk15,sk16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,negated_conjecture,
reorganization(sk6,sk15,sk17),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f27,negated_conjecture,
reorganization_type(sk5,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,negated_conjecture,
reorganization_type(sk6,sk7,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,negated_conjecture,
survival_chance(sk5,sk10,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,negated_conjecture,
survival_chance(sk6,sk11,sk14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,negated_conjecture,
complexity(sk5,sk12,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
complexity(sk6,sk13,sk15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f34,negated_conjecture,
greater(sk13,sk12),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f36,negated_conjecture,
sk14 = sk16,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,negated_conjecture,
~ greater(sk10,sk11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,negated_conjecture,
sk10 != sk11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f46,plain,
! [A,D] :
( organization(A,D)
| ! [C] :
( ~ greater(C,D)
| ! [B] :
( ~ greater(D,B)
| ~ organization(A,C)
| ~ organization(A,B) ) ) ),
inference(miniscoping,[status(thm)],[f6]) ).
fof(f47,plain,
! [X0,X1,X2,X3] :
( organization(X0,X3)
| ~ greater(X2,X3)
| ~ greater(X3,X1)
| ~ organization(X0,X2)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f46]) ).
fof(f48,plain,
! [B,C] :
( greater(C,B)
| ! [A] : ~ reorganization(A,B,C) ),
inference(miniscoping,[status(thm)],[f7]) ).
fof(f49,plain,
! [X0,X1,X2] :
( greater(X2,X1)
| ~ reorganization(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f48]) ).
fof(f54,plain,
! [D,F] :
( greater(D,F)
| ! [H,I] :
( ~ greater(I,H)
| ! [B,C] :
( ~ complexity(C,I,B)
| ! [A] :
( ~ complexity(A,H,B)
| ! [G] :
( ~ reorganization_type(C,G,B)
| ~ reorganization_type(A,G,B)
| ~ reorganization(C,B,D)
| ~ reorganization(A,B,F)
| ! [E] :
( ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(C,B)
| ~ organization(A,B) ) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f10]) ).
fof(f55,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( greater(X3,X5)
| ~ greater(X8,X7)
| ~ complexity(X2,X8,X1)
| ~ complexity(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)],[f54]) ).
fof(f56,plain,
! [I,J] :
( I = J
| greater(I,J)
| ! [K,L] :
( ~ greater(L,K)
| ! [B,C] :
( ~ complexity(C,L,B)
| ! [A] :
( ~ complexity(A,K,B)
| ! [D] :
( ~ survival_chance(C,J,D)
| ~ survival_chance(A,I,D)
| ! [H] :
( ~ reorganization_type(C,H,B)
| ~ reorganization_type(A,H,B)
| ! [G] : ~ reorganization(C,B,G)
| ~ reorganization(A,B,D)
| ! [F] :
( ~ survival_chance(C,F,B)
| ~ survival_chance(A,F,B)
| ! [E] :
( ~ class(C,E,B)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,D)
| ~ organization(C,B)
| ~ organization(A,B) ) ) ) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f11]) ).
fof(f57,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8,X9,X10,X11] :
( X8 = X9
| greater(X8,X9)
| ~ greater(X11,X10)
| ~ complexity(X2,X11,X1)
| ~ complexity(X0,X10,X1)
| ~ survival_chance(X2,X9,X3)
| ~ survival_chance(X0,X8,X3)
| ~ reorganization_type(X2,X7,X1)
| ~ reorganization_type(X0,X7,X1)
| ~ reorganization(X2,X1,X6)
| ~ reorganization(X0,X1,X3)
| ~ survival_chance(X2,X5,X1)
| ~ survival_chance(X0,X5,X1)
| ~ class(X2,X4,X1)
| ~ class(X0,X4,X1)
| ~ organization(X2,X3)
| ~ organization(X0,X3)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f56]) ).
fof(f63,plain,
organization(sk5,sk15),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f64,plain,
organization(sk6,sk15),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f65,plain,
organization(sk5,sk17),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f66,plain,
organization(sk6,sk17),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f67,plain,
class(sk5,sk8,sk15),
inference(cnf_transformation,[status(thm)],[f21]) ).
fof(f68,plain,
class(sk6,sk8,sk15),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f69,plain,
survival_chance(sk5,sk9,sk15),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f70,plain,
survival_chance(sk6,sk9,sk15),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f71,plain,
reorganization(sk5,sk15,sk16),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f72,plain,
reorganization(sk6,sk15,sk17),
inference(cnf_transformation,[status(thm)],[f26]) ).
fof(f73,plain,
reorganization_type(sk5,sk7,sk15),
inference(cnf_transformation,[status(thm)],[f27]) ).
fof(f74,plain,
reorganization_type(sk6,sk7,sk15),
inference(cnf_transformation,[status(thm)],[f28]) ).
fof(f76,plain,
survival_chance(sk5,sk10,sk14),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f77,plain,
survival_chance(sk6,sk11,sk14),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f78,plain,
complexity(sk5,sk12,sk15),
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f79,plain,
complexity(sk6,sk13,sk15),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f80,plain,
greater(sk13,sk12),
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f82,plain,
sk14 = sk16,
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f83,plain,
~ greater(sk10,sk11),
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f84,plain,
sk10 != sk11,
inference(cnf_transformation,[status(thm)],[f38]) ).
fof(f101,definition,
( sQ5_spl
<=> greater(sk10,sk11) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f102,plain,
( ~ sQ5_spl
| greater(sk10,sk11) ),
inference(component_clause,[status(thm)],[f101]) ).
fof(f110,plain,
! [X0,X1] :
( organization(sk6,X1)
| ~ greater(X0,X1)
| ~ greater(X1,sk15)
| ~ organization(sk6,X0) ),
inference(resolution,[status(thm)],[f47,f64]) ).
fof(f112,plain,
! [X0,X1] :
( organization(sk5,X1)
| ~ greater(X0,X1)
| ~ greater(X1,sk15)
| ~ organization(sk5,X0) ),
inference(resolution,[status(thm)],[f47,f63]) ).
fof(f117,plain,
( ~ sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f102,f83]) ).
fof(f118,plain,
~ sQ5_spl,
inference(contradiction_clause,[status(thm)],[f117]) ).
fof(f121,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X1,X2)
| ~ greater(X5,X4)
| ~ complexity(X0,X5,sk15)
| ~ complexity(sk5,X4,sk15)
| ~ reorganization_type(X0,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ reorganization(sk5,sk15,X2)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(X0,sk15)
| ~ organization(sk5,sk15) ),
inference(resolution,[status(thm)],[f55,f67]) ).
fof(f122,definition,
( sQ6_spl
<=> organization(sk5,sk15) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f124,plain,
( sQ6_spl
| ~ organization(sk5,sk15) ),
inference(component_clause,[status(thm)],[f122]) ).
fof(f125,definition,
! [X0,X1,X2,X3,X4,X5] :
( sQ7_spl
<=> ( greater(X1,X2)
| ~ greater(X5,X4)
| ~ complexity(X0,X5,sk15)
| ~ complexity(sk5,X4,sk15)
| ~ reorganization_type(X0,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ reorganization(sk5,sk15,X2)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(X0,sk15) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f126,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sQ7_spl
| greater(X1,X2)
| ~ greater(X5,X4)
| ~ complexity(X0,X5,sk15)
| ~ complexity(sk5,X4,sk15)
| ~ reorganization_type(X0,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ reorganization(sk5,sk15,X2)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(X0,sk15) ),
inference(component_clause,[status(thm)],[f125]) ).
fof(f128,plain,
( sQ7_spl
| ~ sQ6_spl ),
inference(split_clause,[status(thm)],[f121,f122,f125]) ).
fof(f129,plain,
( sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f124,f63]) ).
fof(f130,plain,
sQ6_spl,
inference(contradiction_clause,[status(thm)],[f129]) ).
fof(f131,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( X5 = X6
| greater(X5,X6)
| ~ greater(X8,X7)
| ~ complexity(X0,X8,sk15)
| ~ complexity(sk5,X7,sk15)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(sk5,X5,X1)
| ~ reorganization_type(X0,X4,sk15)
| ~ reorganization_type(sk5,X4,sk15)
| ~ reorganization(X0,sk15,X3)
| ~ reorganization(sk5,sk15,X1)
| ~ survival_chance(X0,X2,sk15)
| ~ survival_chance(sk5,X2,sk15)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(sk5,X1)
| ~ organization(X0,sk15)
| ~ organization(sk5,sk15) ),
inference(resolution,[status(thm)],[f57,f67]) ).
fof(f132,definition,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( sQ8_spl
<=> ( X5 = X6
| greater(X5,X6)
| ~ greater(X8,X7)
| ~ complexity(X0,X8,sk15)
| ~ complexity(sk5,X7,sk15)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(sk5,X5,X1)
| ~ reorganization_type(X0,X4,sk15)
| ~ reorganization_type(sk5,X4,sk15)
| ~ reorganization(X0,sk15,X3)
| ~ reorganization(sk5,sk15,X1)
| ~ survival_chance(X0,X2,sk15)
| ~ survival_chance(sk5,X2,sk15)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(sk5,X1)
| ~ organization(X0,sk15) ) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f133,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7,X8] :
( ~ sQ8_spl
| X5 = X6
| greater(X5,X6)
| ~ greater(X8,X7)
| ~ complexity(X0,X8,sk15)
| ~ complexity(sk5,X7,sk15)
| ~ survival_chance(X0,X6,X1)
| ~ survival_chance(sk5,X5,X1)
| ~ reorganization_type(X0,X4,sk15)
| ~ reorganization_type(sk5,X4,sk15)
| ~ reorganization(X0,sk15,X3)
| ~ reorganization(sk5,sk15,X1)
| ~ survival_chance(X0,X2,sk15)
| ~ survival_chance(sk5,X2,sk15)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(sk5,X1)
| ~ organization(X0,sk15) ),
inference(component_clause,[status(thm)],[f132]) ).
fof(f135,plain,
( sQ8_spl
| ~ sQ6_spl ),
inference(split_clause,[status(thm)],[f131,f122,f132]) ).
fof(f140,definition,
( sQ9_spl
<=> organization(sk6,sk15) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f142,plain,
( sQ9_spl
| ~ organization(sk6,sk15) ),
inference(component_clause,[status(thm)],[f140]) ).
fof(f151,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f142,f64]) ).
fof(f152,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f151]) ).
fof(f154,plain,
greater(sk16,sk15),
inference(resolution,[status(thm)],[f71,f49]) ).
fof(f176,definition,
( sQ12_spl
<=> organization(sk5,sk16) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f179,definition,
( sQ13_spl
<=> organization(sk5,sk17) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f181,plain,
( sQ13_spl
| ~ organization(sk5,sk17) ),
inference(component_clause,[status(thm)],[f179]) ).
fof(f185,definition,
( sQ15_spl
<=> greater(sk17,sk16) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f186,plain,
( ~ sQ15_spl
| greater(sk17,sk16) ),
inference(component_clause,[status(thm)],[f185]) ).
fof(f189,plain,
( sQ13_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f181,f65]) ).
fof(f190,plain,
sQ13_spl,
inference(contradiction_clause,[status(thm)],[f189]) ).
fof(f191,plain,
survival_chance(sk5,sk10,sk16),
inference(forward_demodulation,[status(thm)],[f82,f76]) ).
fof(f192,plain,
survival_chance(sk6,sk11,sk16),
inference(forward_demodulation,[status(thm)],[f82,f77]) ).
fof(f198,plain,
! [X0] :
( organization(sk6,sk16)
| ~ greater(X0,sk16)
| ~ organization(sk6,X0) ),
inference(resolution,[status(thm)],[f110,f154]) ).
fof(f202,definition,
( sQ17_spl
<=> organization(sk6,sk17) ),
introduced(definition,[new_symbols(definition,[sQ17_spl])],[split_symbol_definition]) ).
fof(f204,plain,
( sQ17_spl
| ~ organization(sk6,sk17) ),
inference(component_clause,[status(thm)],[f202]) ).
fof(f206,definition,
! [X0] :
( sQ18_spl
<=> ( ~ greater(X0,sk16)
| ~ organization(sk6,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition]) ).
fof(f207,plain,
! [X0] :
( ~ sQ18_spl
| ~ greater(X0,sk16)
| ~ organization(sk6,X0) ),
inference(component_clause,[status(thm)],[f206]) ).
fof(f209,definition,
( sQ19_spl
<=> organization(sk6,sk16) ),
introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition]) ).
fof(f212,plain,
( sQ19_spl
| sQ18_spl ),
inference(split_clause,[status(thm)],[f198,f206,f209]) ).
fof(f216,plain,
! [X0] :
( organization(sk5,sk16)
| ~ greater(X0,sk16)
| ~ organization(sk5,X0) ),
inference(resolution,[status(thm)],[f112,f154]) ).
fof(f221,definition,
! [X0] :
( sQ21_spl
<=> ( ~ greater(X0,sk16)
| ~ organization(sk5,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f222,plain,
! [X0] :
( ~ sQ21_spl
| ~ greater(X0,sk16)
| ~ organization(sk5,X0) ),
inference(component_clause,[status(thm)],[f221]) ).
fof(f224,plain,
( sQ12_spl
| sQ21_spl ),
inference(split_clause,[status(thm)],[f216,f221,f176]) ).
fof(f227,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ7_spl
| greater(X1,sk16)
| ~ greater(X4,X3)
| ~ complexity(X0,X4,sk15)
| ~ complexity(sk5,X3,sk15)
| ~ reorganization_type(X0,X2,sk15)
| ~ reorganization_type(sk5,X2,sk15)
| ~ reorganization(X0,sk15,X1)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(X0,sk15) ),
inference(resolution,[status(thm)],[f126,f71]) ).
fof(f229,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ sQ8_spl
| X4 = X5
| greater(X4,X5)
| ~ greater(X7,X6)
| ~ complexity(X0,X7,sk15)
| ~ complexity(sk5,X6,sk15)
| ~ survival_chance(X0,X5,X1)
| ~ survival_chance(sk5,X4,X1)
| ~ reorganization_type(X0,X3,sk15)
| ~ reorganization_type(sk5,X3,sk15)
| ~ reorganization(X0,sk15,X2)
| ~ reorganization(sk5,sk15,X1)
| ~ survival_chance(X0,sk9,sk15)
| ~ class(X0,sk8,sk15)
| ~ organization(X0,X1)
| ~ organization(sk5,X1)
| ~ organization(X0,sk15) ),
inference(resolution,[status(thm)],[f133,f69]) ).
fof(f465,plain,
! [X0,X1,X2] :
( ~ sQ7_spl
| greater(sk17,sk16)
| ~ greater(X2,X1)
| ~ complexity(sk6,X2,sk15)
| ~ complexity(sk5,X1,sk15)
| ~ reorganization_type(sk6,X0,sk15)
| ~ reorganization_type(sk5,X0,sk15)
| ~ class(sk6,sk8,sk15)
| ~ organization(sk6,sk17)
| ~ organization(sk6,sk15) ),
inference(resolution,[status(thm)],[f227,f72]) ).
fof(f467,definition,
( sQ50_spl
<=> class(sk6,sk8,sk15) ),
introduced(definition,[new_symbols(definition,[sQ50_spl])],[split_symbol_definition]) ).
fof(f469,plain,
( sQ50_spl
| ~ class(sk6,sk8,sk15) ),
inference(component_clause,[status(thm)],[f467]) ).
fof(f470,definition,
! [X0] :
( sQ51_spl
<=> ( ~ reorganization_type(sk6,X0,sk15)
| ~ reorganization_type(sk5,X0,sk15) ) ),
introduced(definition,[new_symbols(definition,[sQ51_spl])],[split_symbol_definition]) ).
fof(f471,plain,
! [X0] :
( ~ sQ51_spl
| ~ reorganization_type(sk6,X0,sk15)
| ~ reorganization_type(sk5,X0,sk15) ),
inference(component_clause,[status(thm)],[f470]) ).
fof(f473,definition,
! [X1,X2] :
( sQ52_spl
<=> ( ~ greater(X2,X1)
| ~ complexity(sk6,X2,sk15)
| ~ complexity(sk5,X1,sk15) ) ),
introduced(definition,[new_symbols(definition,[sQ52_spl])],[split_symbol_definition]) ).
fof(f474,plain,
! [X0,X1] :
( ~ sQ52_spl
| ~ greater(X1,X0)
| ~ complexity(sk6,X1,sk15)
| ~ complexity(sk5,X0,sk15) ),
inference(component_clause,[status(thm)],[f473]) ).
fof(f476,plain,
( ~ sQ7_spl
| sQ15_spl
| sQ52_spl
| sQ51_spl
| ~ sQ50_spl
| ~ sQ17_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f465,f140,f202,f467,f470,f473,f185,f125]) ).
fof(f495,plain,
( sQ50_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f469,f68]) ).
fof(f496,plain,
sQ50_spl,
inference(contradiction_clause,[status(thm)],[f495]) ).
fof(f540,plain,
( ~ sQ51_spl
| ~ reorganization_type(sk6,sk7,sk15) ),
inference(resolution,[status(thm)],[f471,f73]) ).
fof(f541,plain,
( ~ sQ51_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f540,f74]) ).
fof(f542,plain,
~ sQ51_spl,
inference(contradiction_clause,[status(thm)],[f541]) ).
fof(f552,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sQ8_spl
| X3 = X4
| greater(X3,X4)
| ~ greater(X6,X5)
| ~ complexity(sk6,X6,sk15)
| ~ complexity(sk5,X5,sk15)
| ~ survival_chance(sk6,X4,X0)
| ~ survival_chance(sk5,X3,X0)
| ~ reorganization_type(sk6,X2,sk15)
| ~ reorganization_type(sk5,X2,sk15)
| ~ reorganization(sk6,sk15,X1)
| ~ reorganization(sk5,sk15,X0)
| ~ class(sk6,sk8,sk15)
| ~ organization(sk6,X0)
| ~ organization(sk5,X0)
| ~ organization(sk6,sk15) ),
inference(resolution,[status(thm)],[f229,f70]) ).
fof(f554,definition,
! [X0,X3,X4] :
( sQ59_spl
<=> ( X3 = X4
| greater(X3,X4)
| ~ survival_chance(sk6,X4,X0)
| ~ survival_chance(sk5,X3,X0)
| ~ reorganization(sk5,sk15,X0)
| ~ organization(sk6,X0)
| ~ organization(sk5,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ59_spl])],[split_symbol_definition]) ).
fof(f555,plain,
! [X0,X1,X2] :
( ~ sQ59_spl
| X1 = X2
| greater(X1,X2)
| ~ survival_chance(sk6,X2,X0)
| ~ survival_chance(sk5,X1,X0)
| ~ reorganization(sk5,sk15,X0)
| ~ organization(sk6,X0)
| ~ organization(sk5,X0) ),
inference(component_clause,[status(thm)],[f554]) ).
fof(f557,definition,
! [X1] :
( sQ60_spl
<=> ~ reorganization(sk6,sk15,X1) ),
introduced(definition,[new_symbols(definition,[sQ60_spl])],[split_symbol_definition]) ).
fof(f558,plain,
! [X0] :
( ~ sQ60_spl
| ~ reorganization(sk6,sk15,X0) ),
inference(component_clause,[status(thm)],[f557]) ).
fof(f560,plain,
( ~ sQ8_spl
| sQ52_spl
| sQ51_spl
| sQ60_spl
| ~ sQ50_spl
| sQ59_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f552,f140,f554,f467,f557,f470,f473,f132]) ).
fof(f562,plain,
( ~ sQ60_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f72,f558]) ).
fof(f563,plain,
~ sQ60_spl,
inference(contradiction_clause,[status(thm)],[f562]) ).
fof(f621,plain,
( sQ17_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f204,f66]) ).
fof(f622,plain,
sQ17_spl,
inference(contradiction_clause,[status(thm)],[f621]) ).
fof(f625,plain,
! [X0] :
( ~ sQ52_spl
| ~ greater(X0,sk12)
| ~ complexity(sk6,X0,sk15) ),
inference(resolution,[status(thm)],[f474,f78]) ).
fof(f626,plain,
( ~ sQ52_spl
| ~ greater(sk13,sk12) ),
inference(resolution,[status(thm)],[f625,f79]) ).
fof(f627,plain,
( ~ sQ52_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f626,f80]) ).
fof(f628,plain,
~ sQ52_spl,
inference(contradiction_clause,[status(thm)],[f627]) ).
fof(f639,plain,
( ~ sQ18_spl
| ~ sQ15_spl
| ~ organization(sk6,sk17) ),
inference(resolution,[status(thm)],[f186,f207]) ).
fof(f647,plain,
( ~ sQ18_spl
| ~ sQ15_spl
| ~ sQ17_spl ),
inference(split_clause,[status(thm)],[f639,f202,f185,f206]) ).
fof(f768,plain,
( ~ sQ15_spl
| ~ sQ21_spl
| ~ organization(sk5,sk17) ),
inference(resolution,[status(thm)],[f222,f186]) ).
fof(f769,plain,
( ~ sQ15_spl
| ~ sQ21_spl
| ~ sQ13_spl ),
inference(split_clause,[status(thm)],[f768,f179,f221,f185]) ).
fof(f1341,definition,
( sQ101_spl
<=> reorganization(sk5,sk15,sk16) ),
introduced(definition,[new_symbols(definition,[sQ101_spl])],[split_symbol_definition]) ).
fof(f1343,plain,
( sQ101_spl
| ~ reorganization(sk5,sk15,sk16) ),
inference(component_clause,[status(thm)],[f1341]) ).
fof(f1370,plain,
( sQ101_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1343,f71]) ).
fof(f1371,plain,
sQ101_spl,
inference(contradiction_clause,[status(thm)],[f1370]) ).
fof(f1375,plain,
! [X0] :
( ~ sQ59_spl
| sk10 = X0
| greater(sk10,X0)
| ~ survival_chance(sk6,X0,sk16)
| ~ reorganization(sk5,sk15,sk16)
| ~ organization(sk6,sk16)
| ~ organization(sk5,sk16) ),
inference(resolution,[status(thm)],[f555,f191]) ).
fof(f1389,definition,
! [X0] :
( sQ112_spl
<=> ( sk10 = X0
| greater(sk10,X0)
| ~ survival_chance(sk6,X0,sk16) ) ),
introduced(definition,[new_symbols(definition,[sQ112_spl])],[split_symbol_definition]) ).
fof(f1390,plain,
! [X0] :
( ~ sQ112_spl
| sk10 = X0
| greater(sk10,X0)
| ~ survival_chance(sk6,X0,sk16) ),
inference(component_clause,[status(thm)],[f1389]) ).
fof(f1392,plain,
( ~ sQ59_spl
| sQ112_spl
| ~ sQ101_spl
| ~ sQ19_spl
| ~ sQ12_spl ),
inference(split_clause,[status(thm)],[f1375,f176,f209,f1341,f1389,f554]) ).
fof(f1607,plain,
( ~ sQ112_spl
| sk10 = sk11
| greater(sk10,sk11) ),
inference(resolution,[status(thm)],[f1390,f192]) ).
fof(f1615,definition,
( sQ132_spl
<=> sk10 = sk11 ),
introduced(definition,[new_symbols(definition,[sQ132_spl])],[split_symbol_definition]) ).
fof(f1616,plain,
( ~ sQ132_spl
| sk10 = sk11 ),
inference(component_clause,[status(thm)],[f1615]) ).
fof(f1618,plain,
( ~ sQ112_spl
| sQ132_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f1607,f101,f1615,f1389]) ).
fof(f1619,plain,
( ~ sQ132_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1616,f84]) ).
fof(f1620,plain,
~ sQ132_spl,
inference(contradiction_clause,[status(thm)],[f1619]) ).
fof(f1621,plain,
$false,
inference(sat_refutation,[status(thm)],[f118,f128,f130,f135,f152,f190,f212,f224,f476,f496,f542,f560,f563,f622,f628,f647,f769,f1371,f1392,f1618,f1620]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : MGT005-2 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n003.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 01:22:15 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.45 % Drodi V4.1.1
% 2.21/1.28 % Refutation found
% 2.21/1.28 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 2.21/1.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 2.21/1.32 % Elapsed time: 0.872300 seconds
% 2.21/1.32 % CPU time: 6.578319 seconds
% 2.21/1.32 % Total memory used: 128.096 MB
% 2.21/1.32 % Net memory used: 123.540 MB
%------------------------------------------------------------------------------