%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : MGT016-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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 : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 92 ( 33 unt; 12 def)
% Number of atoms : 419 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 634 ( 307 ~; 315 |; 0 &)
% ( 12 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 20 ( 19 usr; 13 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 184 ( 184 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( inertia(A,sk1(B,A),B)
| ~ organization(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,hypothesis,
! [A,B,C,D,E,F,G,H,I] :
( greater(I,H)
| ~ greater(G,F)
| ~ inertia(C,I,D)
| ~ inertia(A,H,B)
| ~ complexity(C,G,D)
| ~ complexity(A,F,B)
| ~ class(C,E,D)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,hypothesis,
! [A,B,C,D,E,F,G,H,I] :
( greater(F,D)
| ~ greater(I,H)
| ~ inertia(C,I,B)
| ~ inertia(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(f4,negated_conjecture,
organization(sk2,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
organization(sk3,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ organization(sk3,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
class(sk2,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
class(sk3,sk5,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
reorganization(sk2,sk8,sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
reorganization(sk3,sk8,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,negated_conjecture,
reorganization_type(sk2,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
reorganization_type(sk3,sk4,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
complexity(sk2,sk6,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,negated_conjecture,
complexity(sk3,sk7,sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,negated_conjecture,
greater(sk7,sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ greater(sk9,sk10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,plain,
! [X0,X1] :
( inertia(X0,sk1(X1,X0),X1)
| ~ organization(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f18,plain,
! [H,I] :
( greater(I,H)
| ! [F,G] :
( ~ greater(G,F)
| ! [C,D] :
( ~ inertia(C,I,D)
| ! [A,B] :
( ~ inertia(A,H,B)
| ~ complexity(C,G,D)
| ~ complexity(A,F,B)
| ! [E] :
( ~ class(C,E,D)
| ~ class(A,E,B)
| ~ organization(C,D)
| ~ organization(A,B) ) ) ) ) ),
inference(miniscoping,[status(thm)],[f2]) ).
fof(f19,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)],[f18]) ).
fof(f20,plain,
! [D,F] :
( greater(F,D)
| ! [H,I] :
( ~ greater(I,H)
| ! [B,C] :
( ~ inertia(C,I,B)
| ! [A] :
( ~ inertia(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)],[f3]) ).
fof(f21,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)],[f20]) ).
fof(f22,plain,
organization(sk2,sk8),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f23,plain,
organization(sk3,sk8),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f24,plain,
~ organization(sk3,sk10),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f25,plain,
class(sk2,sk5,sk8),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f26,plain,
class(sk3,sk5,sk8),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f27,plain,
reorganization(sk2,sk8,sk9),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f28,plain,
reorganization(sk3,sk8,sk10),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f29,plain,
reorganization_type(sk2,sk4,sk8),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f30,plain,
reorganization_type(sk3,sk4,sk8),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f31,plain,
complexity(sk2,sk6,sk8),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f32,plain,
complexity(sk3,sk7,sk8),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f33,plain,
greater(sk7,sk6),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f34,plain,
~ greater(sk9,sk10),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f39,definition,
( sQ1_spl
<=> organization(sk2,sk8) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f41,plain,
( sQ1_spl
| ~ organization(sk2,sk8) ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f43,plain,
! [X0,X1,X2,X3,X4,X5] :
( greater(X5,X4)
| ~ greater(sk7,X3)
| ~ inertia(sk3,X5,sk8)
| ~ inertia(X0,X4,X1)
| ~ complexity(X0,X3,X1)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,X1)
| ~ organization(sk3,sk8)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f32,f19]) ).
fof(f44,definition,
! [X0,X1,X2,X3,X4,X5] :
( sQ2_spl
<=> ( greater(X5,X4)
| ~ greater(sk7,X3)
| ~ inertia(sk3,X5,sk8)
| ~ inertia(X0,X4,X1)
| ~ complexity(X0,X3,X1)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f45,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sQ2_spl
| greater(X5,X4)
| ~ greater(sk7,X3)
| ~ inertia(sk3,X5,sk8)
| ~ inertia(X0,X4,X1)
| ~ complexity(X0,X3,X1)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(component_clause,[status(thm)],[f44]) ).
fof(f47,definition,
( sQ3_spl
<=> organization(sk3,sk8) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f49,plain,
( sQ3_spl
| ~ organization(sk3,sk8) ),
inference(component_clause,[status(thm)],[f47]) ).
fof(f50,plain,
( ~ sQ3_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f43,f44,f47]) ).
fof(f51,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X5,X3)
| ~ greater(sk1(X1,X0),X7)
| ~ inertia(X2,X7,X1)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ reorganization(X0,X1,X3)
| ~ reorganization(X2,X1,X5)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| organization(X0,X3)
| ~ organization(X0,X1)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f17,f21]) ).
fof(f52,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( greater(X5,X3)
| ~ greater(sk1(X1,X0),X7)
| ~ inertia(X2,X7,X1)
| ~ reorganization_type(X0,X6,X1)
| ~ reorganization_type(X2,X6,X1)
| ~ reorganization(X0,X1,X3)
| ~ reorganization(X2,X1,X5)
| ~ class(X0,X4,X1)
| ~ class(X2,X4,X1)
| organization(X0,X3)
| ~ organization(X2,X1)
| ~ organization(X0,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f51]) ).
fof(f53,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ2_spl
| greater(X4,X3)
| ~ inertia(sk3,X4,sk8)
| ~ inertia(X0,X3,X1)
| ~ complexity(X0,sk6,X1)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f45,f33]) ).
fof(f54,plain,
! [X0,X1,X2,X3] :
( ~ sQ2_spl
| greater(X3,X2)
| ~ inertia(sk3,X3,sk8)
| ~ inertia(X0,X2,X1)
| ~ complexity(X0,sk6,X1)
| ~ class(X0,sk5,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f53,f26]) ).
fof(f55,plain,
! [X0,X1,X2] :
( ~ sQ2_spl
| ~ organization(sk3,sk8)
| greater(sk1(sk8,sk3),X2)
| ~ inertia(X0,X2,X1)
| ~ complexity(X0,sk6,X1)
| ~ class(X0,sk5,X1)
| ~ organization(X0,X1) ),
inference(resolution,[status(thm)],[f54,f17]) ).
fof(f56,definition,
! [X0,X1,X2] :
( sQ4_spl
<=> ( greater(sk1(sk8,sk3),X2)
| ~ inertia(X0,X2,X1)
| ~ complexity(X0,sk6,X1)
| ~ class(X0,sk5,X1)
| ~ organization(X0,X1) ) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ~ sQ4_spl
| greater(sk1(sk8,sk3),X2)
| ~ inertia(X0,X2,X1)
| ~ complexity(X0,sk6,X1)
| ~ class(X0,sk5,X1)
| ~ organization(X0,X1) ),
inference(component_clause,[status(thm)],[f56]) ).
fof(f59,plain,
( ~ sQ2_spl
| ~ sQ3_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f55,f56,f47,f44]) ).
fof(f60,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f49,f23]) ).
fof(f61,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f60]) ).
fof(f62,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ sQ4_spl
| ~ inertia(X6,X5,X7)
| ~ complexity(X6,sk6,X7)
| ~ class(X6,sk5,X7)
| ~ organization(X6,X7)
| greater(X3,X1)
| ~ inertia(X0,X5,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ reorganization_type(X0,X4,sk8)
| ~ reorganization(sk3,sk8,X1)
| ~ reorganization(X0,sk8,X3)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,sk8)
| organization(sk3,X1)
| ~ organization(X0,sk8)
| ~ organization(sk3,sk8) ),
inference(resolution,[status(thm)],[f52,f57]) ).
fof(f63,definition,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( sQ5_spl
<=> ( ~ inertia(X6,X5,X7)
| ~ complexity(X6,sk6,X7)
| ~ class(X6,sk5,X7)
| ~ organization(X6,X7)
| greater(X3,X1)
| ~ inertia(X0,X5,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ reorganization_type(X0,X4,sk8)
| ~ reorganization(sk3,sk8,X1)
| ~ reorganization(X0,sk8,X3)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,sk8)
| organization(sk3,X1)
| ~ organization(X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f64,plain,
! [X0,X1,X2,X3,X4,X5,X6,X7] :
( ~ sQ5_spl
| ~ inertia(X6,X5,X7)
| ~ complexity(X6,sk6,X7)
| ~ class(X6,sk5,X7)
| ~ organization(X6,X7)
| greater(X3,X1)
| ~ inertia(X0,X5,sk8)
| ~ reorganization_type(sk3,X4,sk8)
| ~ reorganization_type(X0,X4,sk8)
| ~ reorganization(sk3,sk8,X1)
| ~ reorganization(X0,sk8,X3)
| ~ class(sk3,X2,sk8)
| ~ class(X0,X2,sk8)
| organization(sk3,X1)
| ~ organization(X0,sk8) ),
inference(component_clause,[status(thm)],[f63]) ).
fof(f66,plain,
( ~ sQ4_spl
| sQ5_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f62,f47,f63,f56]) ).
fof(f71,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sQ5_spl
| ~ inertia(X5,X4,X6)
| ~ complexity(X5,sk6,X6)
| ~ class(X5,sk5,X6)
| ~ organization(X5,X6)
| greater(X2,sk10)
| ~ inertia(X0,X4,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| ~ reorganization_type(X0,X3,sk8)
| ~ reorganization(X0,sk8,X2)
| ~ class(sk3,X1,sk8)
| ~ class(X0,X1,sk8)
| organization(sk3,sk10)
| ~ organization(X0,sk8) ),
inference(resolution,[status(thm)],[f64,f28]) ).
fof(f73,definition,
! [X0,X1,X2,X3,X4,X5,X6] :
( sQ6_spl
<=> ( ~ inertia(X5,X4,X6)
| ~ complexity(X5,sk6,X6)
| ~ class(X5,sk5,X6)
| ~ organization(X5,X6)
| greater(X2,sk10)
| ~ inertia(X0,X4,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| ~ reorganization_type(X0,X3,sk8)
| ~ reorganization(X0,sk8,X2)
| ~ class(sk3,X1,sk8)
| ~ class(X0,X1,sk8)
| ~ organization(X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f74,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sQ6_spl
| ~ inertia(X5,X4,X6)
| ~ complexity(X5,sk6,X6)
| ~ class(X5,sk5,X6)
| ~ organization(X5,X6)
| greater(X2,sk10)
| ~ inertia(X0,X4,sk8)
| ~ reorganization_type(sk3,X3,sk8)
| ~ reorganization_type(X0,X3,sk8)
| ~ reorganization(X0,sk8,X2)
| ~ class(sk3,X1,sk8)
| ~ class(X0,X1,sk8)
| ~ organization(X0,sk8) ),
inference(component_clause,[status(thm)],[f73]) ).
fof(f76,definition,
( sQ7_spl
<=> organization(sk3,sk10) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f77,plain,
( ~ sQ7_spl
| organization(sk3,sk10) ),
inference(component_clause,[status(thm)],[f76]) ).
fof(f79,plain,
( ~ sQ5_spl
| sQ7_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f71,f73,f76,f63]) ).
fof(f80,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sQ6_spl
| ~ inertia(X4,X3,X5)
| ~ complexity(X4,sk6,X5)
| ~ class(X4,sk5,X5)
| ~ organization(X4,X5)
| greater(X2,sk10)
| ~ inertia(X0,X3,sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X2)
| ~ class(sk3,X1,sk8)
| ~ class(X0,X1,sk8)
| ~ organization(X0,sk8) ),
inference(resolution,[status(thm)],[f74,f30]) ).
fof(f81,plain,
! [X0,X1,X2,X3,X4] :
( ~ sQ6_spl
| ~ inertia(X3,X2,X4)
| ~ complexity(X3,sk6,X4)
| ~ class(X3,sk5,X4)
| ~ organization(X3,X4)
| greater(X1,sk10)
| ~ inertia(X0,X2,sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ),
inference(resolution,[status(thm)],[f80,f26]) ).
fof(f82,plain,
! [X0,X1,X2] :
( ~ sQ6_spl
| ~ inertia(sk2,X2,sk8)
| ~ class(sk2,sk5,sk8)
| ~ organization(sk2,sk8)
| greater(X1,sk10)
| ~ inertia(X0,X2,sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ),
inference(resolution,[status(thm)],[f81,f31]) ).
fof(f83,definition,
! [X0,X1,X2] :
( sQ8_spl
<=> ( ~ inertia(sk2,X2,sk8)
| greater(X1,sk10)
| ~ inertia(X0,X2,sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ~ sQ8_spl
| ~ inertia(sk2,X2,sk8)
| greater(X1,sk10)
| ~ inertia(X0,X2,sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ),
inference(component_clause,[status(thm)],[f83]) ).
fof(f86,definition,
( sQ9_spl
<=> class(sk2,sk5,sk8) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f88,plain,
( sQ9_spl
| ~ class(sk2,sk5,sk8) ),
inference(component_clause,[status(thm)],[f86]) ).
fof(f89,plain,
( ~ sQ6_spl
| ~ sQ9_spl
| ~ sQ1_spl
| sQ8_spl ),
inference(split_clause,[status(thm)],[f82,f83,f39,f86,f73]) ).
fof(f90,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f41,f22]) ).
fof(f91,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f90]) ).
fof(f92,plain,
( ~ sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f77,f24]) ).
fof(f93,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f92]) ).
fof(f94,plain,
! [X0,X1] :
( ~ sQ8_spl
| ~ organization(sk2,sk8)
| greater(X1,sk10)
| ~ inertia(X0,sk1(sk8,sk2),sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ),
inference(resolution,[status(thm)],[f84,f17]) ).
fof(f95,definition,
! [X0,X1] :
( sQ10_spl
<=> ( greater(X1,sk10)
| ~ inertia(X0,sk1(sk8,sk2),sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f96,plain,
! [X0,X1] :
( ~ sQ10_spl
| greater(X1,sk10)
| ~ inertia(X0,sk1(sk8,sk2),sk8)
| ~ reorganization_type(X0,sk4,sk8)
| ~ reorganization(X0,sk8,X1)
| ~ class(X0,sk5,sk8)
| ~ organization(X0,sk8) ),
inference(component_clause,[status(thm)],[f95]) ).
fof(f98,plain,
( ~ sQ8_spl
| ~ sQ1_spl
| sQ10_spl ),
inference(split_clause,[status(thm)],[f94,f95,f39,f83]) ).
fof(f99,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f88,f25]) ).
fof(f100,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f99]) ).
fof(f101,plain,
! [X0] :
( ~ sQ10_spl
| ~ organization(sk2,sk8)
| greater(X0,sk10)
| ~ reorganization_type(sk2,sk4,sk8)
| ~ reorganization(sk2,sk8,X0)
| ~ class(sk2,sk5,sk8)
| ~ organization(sk2,sk8) ),
inference(resolution,[status(thm)],[f96,f17]) ).
fof(f102,definition,
! [X0] :
( sQ11_spl
<=> ( greater(X0,sk10)
| ~ reorganization(sk2,sk8,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f103,plain,
! [X0] :
( ~ sQ11_spl
| greater(X0,sk10)
| ~ reorganization(sk2,sk8,X0) ),
inference(component_clause,[status(thm)],[f102]) ).
fof(f105,definition,
( sQ12_spl
<=> reorganization_type(sk2,sk4,sk8) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f107,plain,
( sQ12_spl
| ~ reorganization_type(sk2,sk4,sk8) ),
inference(component_clause,[status(thm)],[f105]) ).
fof(f108,plain,
( ~ sQ10_spl
| ~ sQ12_spl
| sQ11_spl
| ~ sQ9_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f101,f39,f86,f102,f105,f95]) ).
fof(f115,plain,
( ~ sQ11_spl
| greater(sk9,sk10) ),
inference(resolution,[status(thm)],[f103,f27]) ).
fof(f116,plain,
( ~ sQ11_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f115,f34]) ).
fof(f117,plain,
~ sQ11_spl,
inference(contradiction_clause,[status(thm)],[f116]) ).
fof(f118,plain,
( sQ12_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f107,f29]) ).
fof(f119,plain,
sQ12_spl,
inference(contradiction_clause,[status(thm)],[f118]) ).
fof(f120,plain,
$false,
inference(sat_refutation,[status(thm)],[f50,f59,f61,f66,f79,f89,f91,f93,f98,f100,f108,f117,f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT016-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n017.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 01:16:43 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.13/0.36 % Drodi V4.1.1
% 0.13/0.38 % Refutation found
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.40 % Elapsed time: 0.042757 seconds
% 0.13/0.40 % CPU time: 0.124160 seconds
% 0.13/0.40 % Total memory used: 14.865 MB
% 0.13/0.40 % Net memory used: 14.495 MB
%------------------------------------------------------------------------------