%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : KRS010-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 12:59:32 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.41s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 121 ( 7 unt; 20 def)
% Number of atoms : 360 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 464 ( 225 ~; 219 |; 0 &)
% ( 20 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 29 ( 28 usr; 21 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 65 ( 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
e(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ f(exist),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X1] :
( ~ a(X1)
| d(X1)
| c(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X4,X3,X1] :
( ~ c(X3)
| ~ c(X4)
| ~ r(X1,X3)
| ~ r(X1,X4)
| ~ e(X1)
| equalish(X4,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X1] :
( ~ e(X1)
| r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X2,X1] :
( ~ r(X1,X2)
| ~ e(X1)
| a(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X1] :
( ~ equalish(u2r2(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f20,axiom,
! [X1] :
( ~ equalish(u2r3(X1),u2r1(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f21,axiom,
! [X1] :
( ~ equalish(u2r3(X1),u2r2(X1))
| ~ r3least(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [X1] :
( ~ r3least(X1)
| r(X1,u2r1(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,axiom,
! [X1] :
( ~ r3least(X1)
| r(X1,u2r2(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f24,axiom,
! [X1] :
( ~ r3least(X1)
| r(X1,u2r3(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,axiom,
! [X1,X3,X2] :
( ~ d(X2)
| ~ d(X3)
| ~ r(X1,X2)
| ~ r(X1,X3)
| equalish(X3,X2)
| f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,plain,
e(exist),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f33,plain,
~ f(exist),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f34,plain,
! [X0] :
( ~ a(X0)
| d(X0)
| c(X0) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f37,plain,
! [X3] :
( ~ c(X3)
| ! [X4] :
( ~ c(X4)
| ! [X1] :
( ~ r(X1,X3)
| ~ r(X1,X4)
| ~ e(X1)
| equalish(X4,X3) ) ) ),
inference(miniscoping,[status(thm)],[f6]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ c(X1)
| ~ c(X0)
| ~ r(X2,X1)
| ~ r(X2,X0)
| ~ e(X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f37]) ).
fof(f39,plain,
! [X0] :
( ~ e(X0)
| r3least(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f40,plain,
! [X0,X1] :
( ~ r(X1,X0)
| ~ e(X1)
| a(X0) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f51,plain,
! [X0] :
( ~ equalish(u2r2(X0),u2r1(X0))
| ~ r3least(X0) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f52,plain,
! [X0] :
( ~ equalish(u2r3(X0),u2r1(X0))
| ~ r3least(X0) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f53,plain,
! [X0] :
( ~ equalish(u2r3(X0),u2r2(X0))
| ~ r3least(X0) ),
inference(cnf_transformation,[status(thm)],[f21]) ).
fof(f54,plain,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r1(X0)) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f55,plain,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r2(X0)) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f56,plain,
! [X0] :
( ~ r3least(X0)
| r(X0,u2r3(X0)) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f64,plain,
! [X2] :
( ~ d(X2)
| ! [X3] :
( ~ d(X3)
| ! [X1] :
( ~ r(X1,X2)
| ~ r(X1,X3)
| equalish(X3,X2)
| f(X1) ) ) ),
inference(miniscoping,[status(thm)],[f31]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ~ d(X2)
| ~ d(X1)
| ~ r(X0,X2)
| ~ r(X0,X1)
| equalish(X1,X2)
| f(X0) ),
inference(cnf_transformation,[status(thm)],[f64]) ).
fof(f66,plain,
! [X0] :
( ~ r(exist,X0)
| a(X0) ),
inference(resolution,[status(thm)],[f40,f32]) ).
fof(f67,plain,
( ~ r3least(exist)
| a(u2r2(exist)) ),
inference(resolution,[status(thm)],[f66,f55]) ).
fof(f68,plain,
( ~ r3least(exist)
| a(u2r1(exist)) ),
inference(resolution,[status(thm)],[f66,f54]) ).
fof(f69,definition,
( sQ0_spl
<=> a(u2r2(exist)) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f70,plain,
( ~ sQ0_spl
| a(u2r2(exist)) ),
inference(component_clause,[status(thm)],[f69]) ).
fof(f72,definition,
( sQ1_spl
<=> r3least(exist) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f74,plain,
( sQ1_spl
| ~ r3least(exist) ),
inference(component_clause,[status(thm)],[f72]) ).
fof(f75,plain,
( ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f67,f69,f72]) ).
fof(f76,definition,
( sQ2_spl
<=> a(u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f77,plain,
( ~ sQ2_spl
| a(u2r1(exist)) ),
inference(component_clause,[status(thm)],[f76]) ).
fof(f79,plain,
( ~ sQ1_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f68,f76,f72]) ).
fof(f80,plain,
( sQ1_spl
| ~ e(exist) ),
inference(resolution,[status(thm)],[f74,f39]) ).
fof(f81,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f80,f32]) ).
fof(f82,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
( ~ sQ0_spl
| d(u2r2(exist))
| c(u2r2(exist)) ),
inference(resolution,[status(thm)],[f70,f34]) ).
fof(f84,definition,
( sQ3_spl
<=> c(u2r2(exist)) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f85,plain,
( ~ sQ3_spl
| c(u2r2(exist)) ),
inference(component_clause,[status(thm)],[f84]) ).
fof(f87,definition,
( sQ4_spl
<=> d(u2r2(exist)) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f88,plain,
( ~ sQ4_spl
| d(u2r2(exist)) ),
inference(component_clause,[status(thm)],[f87]) ).
fof(f90,plain,
( ~ sQ0_spl
| sQ4_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f83,f84,f87,f69]) ).
fof(f91,plain,
( ~ sQ2_spl
| d(u2r1(exist))
| c(u2r1(exist)) ),
inference(resolution,[status(thm)],[f77,f34]) ).
fof(f92,definition,
( sQ5_spl
<=> c(u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f93,plain,
( ~ sQ5_spl
| c(u2r1(exist)) ),
inference(component_clause,[status(thm)],[f92]) ).
fof(f95,definition,
( sQ6_spl
<=> d(u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f96,plain,
( ~ sQ6_spl
| d(u2r1(exist)) ),
inference(component_clause,[status(thm)],[f95]) ).
fof(f98,plain,
( ~ sQ2_spl
| sQ6_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f91,f92,f95,f76]) ).
fof(f99,plain,
! [X0,X1] :
( ~ sQ3_spl
| ~ c(X0)
| ~ r(X1,u2r2(exist))
| ~ r(X1,X0)
| ~ e(X1)
| equalish(X0,u2r2(exist)) ),
inference(resolution,[status(thm)],[f85,f38]) ).
fof(f101,plain,
! [X0,X1] :
( ~ sQ5_spl
| ~ c(X0)
| ~ r(X1,u2r1(exist))
| ~ r(X1,X0)
| ~ e(X1)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[status(thm)],[f93,f38]) ).
fof(f103,plain,
( a(u2r3(exist))
| ~ r3least(exist) ),
inference(resolution,[status(thm)],[f56,f66]) ).
fof(f104,definition,
( sQ7_spl
<=> a(u2r3(exist)) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f105,plain,
( ~ sQ7_spl
| a(u2r3(exist)) ),
inference(component_clause,[status(thm)],[f104]) ).
fof(f107,plain,
( sQ7_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f103,f72,f104]) ).
fof(f108,plain,
( ~ sQ7_spl
| d(u2r3(exist))
| c(u2r3(exist)) ),
inference(resolution,[status(thm)],[f105,f34]) ).
fof(f109,definition,
( sQ8_spl
<=> c(u2r3(exist)) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f112,definition,
( sQ9_spl
<=> d(u2r3(exist)) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f115,plain,
( ~ sQ7_spl
| sQ9_spl
| sQ8_spl ),
inference(split_clause,[status(thm)],[f108,f109,f112,f104]) ).
fof(f118,plain,
! [X0] :
( ~ sQ5_spl
| ~ c(u2r2(exist))
| ~ r(X0,u2r1(exist))
| ~ r(X0,u2r2(exist))
| ~ e(X0)
| ~ r3least(exist) ),
inference(resolution,[status(thm)],[f51,f101]) ).
fof(f119,definition,
! [X0] :
( sQ10_spl
<=> ( ~ r(X0,u2r1(exist))
| ~ r(X0,u2r2(exist))
| ~ e(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f120,plain,
! [X0] :
( ~ sQ10_spl
| ~ r(X0,u2r1(exist))
| ~ r(X0,u2r2(exist))
| ~ e(X0) ),
inference(component_clause,[status(thm)],[f119]) ).
fof(f122,plain,
( ~ sQ5_spl
| ~ sQ3_spl
| sQ10_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f118,f72,f119,f84,f92]) ).
fof(f125,plain,
( ~ sQ10_spl
| ~ r(exist,u2r1(exist))
| ~ r(exist,u2r2(exist)) ),
inference(resolution,[status(thm)],[f120,f32]) ).
fof(f126,definition,
( sQ11_spl
<=> r(exist,u2r2(exist)) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f128,plain,
( sQ11_spl
| ~ r(exist,u2r2(exist)) ),
inference(component_clause,[status(thm)],[f126]) ).
fof(f129,definition,
( sQ12_spl
<=> r(exist,u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f130,plain,
( ~ sQ12_spl
| r(exist,u2r1(exist)) ),
inference(component_clause,[status(thm)],[f129]) ).
fof(f131,plain,
( sQ12_spl
| ~ r(exist,u2r1(exist)) ),
inference(component_clause,[status(thm)],[f129]) ).
fof(f132,plain,
( ~ sQ10_spl
| ~ sQ12_spl
| ~ sQ11_spl ),
inference(split_clause,[status(thm)],[f125,f126,f129,f119]) ).
fof(f134,plain,
( sQ12_spl
| ~ r3least(exist) ),
inference(resolution,[status(thm)],[f131,f54]) ).
fof(f135,plain,
( sQ12_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f134,f72,f129]) ).
fof(f136,plain,
( sQ11_spl
| ~ r3least(exist) ),
inference(resolution,[status(thm)],[f128,f55]) ).
fof(f137,plain,
( sQ11_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f136,f72,f126]) ).
fof(f254,definition,
( sQ27_spl
<=> r(exist,u2r3(exist)) ),
introduced(definition,[new_symbols(definition,[sQ27_spl])],[split_symbol_definition]) ).
fof(f256,plain,
( sQ27_spl
| ~ r(exist,u2r3(exist)) ),
inference(component_clause,[status(thm)],[f254]) ).
fof(f373,plain,
( sQ27_spl
| ~ r3least(exist) ),
inference(resolution,[status(thm)],[f256,f56]) ).
fof(f374,plain,
( sQ27_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f373,f72,f254]) ).
fof(f391,plain,
! [X0,X1] :
( ~ sQ4_spl
| ~ d(X1)
| ~ r(X0,u2r2(exist))
| ~ r(X0,X1)
| equalish(X1,u2r2(exist))
| f(X0) ),
inference(resolution,[status(thm)],[f65,f88]) ).
fof(f392,plain,
! [X0,X1] :
( ~ sQ6_spl
| ~ d(X1)
| ~ r(X0,u2r1(exist))
| ~ r(X0,X1)
| equalish(X1,u2r1(exist))
| f(X0) ),
inference(resolution,[status(thm)],[f65,f96]) ).
fof(f431,definition,
( sQ49_spl
<=> f(exist) ),
introduced(definition,[new_symbols(definition,[sQ49_spl])],[split_symbol_definition]) ).
fof(f432,plain,
( ~ sQ49_spl
| f(exist) ),
inference(component_clause,[status(thm)],[f431]) ).
fof(f438,plain,
( ~ sQ49_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f432,f33]) ).
fof(f439,plain,
~ sQ49_spl,
inference(contradiction_clause,[status(thm)],[f438]) ).
fof(f448,plain,
! [X0] :
( ~ sQ4_spl
| ~ r3least(exist)
| ~ d(u2r3(exist))
| ~ r(X0,u2r2(exist))
| ~ r(X0,u2r3(exist))
| f(X0) ),
inference(resolution,[status(thm)],[f391,f53]) ).
fof(f449,definition,
! [X0] :
( sQ51_spl
<=> ( ~ r(X0,u2r2(exist))
| ~ r(X0,u2r3(exist))
| f(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ51_spl])],[split_symbol_definition]) ).
fof(f450,plain,
! [X0] :
( ~ sQ51_spl
| ~ r(X0,u2r2(exist))
| ~ r(X0,u2r3(exist))
| f(X0) ),
inference(component_clause,[status(thm)],[f449]) ).
fof(f452,plain,
( ~ sQ4_spl
| ~ sQ1_spl
| ~ sQ9_spl
| sQ51_spl ),
inference(split_clause,[status(thm)],[f448,f449,f112,f72,f87]) ).
fof(f456,plain,
( ~ sQ51_spl
| ~ r3least(exist)
| ~ r(exist,u2r2(exist))
| f(exist) ),
inference(resolution,[status(thm)],[f450,f56]) ).
fof(f458,plain,
( ~ sQ51_spl
| ~ sQ1_spl
| ~ sQ11_spl
| sQ49_spl ),
inference(split_clause,[status(thm)],[f456,f431,f126,f72,f449]) ).
fof(f459,plain,
! [X0] :
( ~ sQ12_spl
| ~ sQ6_spl
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist))
| f(exist) ),
inference(resolution,[status(thm)],[f392,f130]) ).
fof(f461,definition,
! [X0] :
( sQ52_spl
<=> ( ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ) ),
introduced(definition,[new_symbols(definition,[sQ52_spl])],[split_symbol_definition]) ).
fof(f462,plain,
! [X0] :
( ~ sQ52_spl
| ~ d(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( ~ sQ12_spl
| ~ sQ6_spl
| sQ52_spl
| sQ49_spl ),
inference(split_clause,[status(thm)],[f459,f431,f461,f95,f129]) ).
fof(f466,plain,
( ~ sQ52_spl
| ~ r3least(exist)
| ~ d(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[f462,f52]) ).
fof(f467,plain,
( ~ sQ52_spl
| ~ r3least(exist)
| ~ d(u2r2(exist))
| ~ r(exist,u2r2(exist)) ),
inference(resolution,[status(thm)],[f462,f51]) ).
fof(f468,plain,
( ~ sQ52_spl
| ~ sQ1_spl
| ~ sQ9_spl
| ~ sQ27_spl ),
inference(split_clause,[status(thm)],[f466,f254,f112,f72,f461]) ).
fof(f469,plain,
( ~ sQ52_spl
| ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ11_spl ),
inference(split_clause,[status(thm)],[f467,f126,f87,f72,f461]) ).
fof(f472,plain,
! [X0] :
( ~ sQ5_spl
| ~ c(X0)
| ~ r(exist,u2r1(exist))
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(resolution,[status(thm)],[f101,f32]) ).
fof(f473,definition,
! [X0] :
( sQ53_spl
<=> ( ~ c(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ) ),
introduced(definition,[new_symbols(definition,[sQ53_spl])],[split_symbol_definition]) ).
fof(f474,plain,
! [X0] :
( ~ sQ53_spl
| ~ c(X0)
| ~ r(exist,X0)
| equalish(X0,u2r1(exist)) ),
inference(component_clause,[status(thm)],[f473]) ).
fof(f476,plain,
( ~ sQ5_spl
| ~ sQ12_spl
| sQ53_spl ),
inference(split_clause,[status(thm)],[f472,f473,f129,f92]) ).
fof(f481,plain,
( ~ sQ53_spl
| ~ r3least(exist)
| ~ c(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[f474,f52]) ).
fof(f483,plain,
( ~ sQ53_spl
| ~ sQ1_spl
| ~ sQ8_spl
| ~ sQ27_spl ),
inference(split_clause,[status(thm)],[f481,f254,f109,f72,f473]) ).
fof(f502,definition,
! [X0] :
( sQ55_spl
<=> ( ~ r(X0,u2r1(exist))
| ~ r(X0,u2r1(exist))
| f(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ55_spl])],[split_symbol_definition]) ).
fof(f503,plain,
! [X0] :
( ~ sQ55_spl
| ~ r(X0,u2r1(exist))
| ~ r(X0,u2r1(exist))
| f(X0) ),
inference(component_clause,[status(thm)],[f502]) ).
fof(f510,plain,
! [X0] :
( ~ sQ55_spl
| ~ r(X0,u2r1(exist))
| f(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f503]) ).
fof(f511,plain,
( ~ sQ12_spl
| ~ sQ55_spl
| f(exist) ),
inference(resolution,[status(thm)],[f510,f130]) ).
fof(f513,plain,
( ~ sQ12_spl
| ~ sQ55_spl
| sQ49_spl ),
inference(split_clause,[status(thm)],[f511,f431,f502,f129]) ).
fof(f519,plain,
! [X0] :
( ~ sQ3_spl
| ~ c(X0)
| ~ r(exist,u2r2(exist))
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(resolution,[status(thm)],[f99,f32]) ).
fof(f520,definition,
! [X0] :
( sQ57_spl
<=> ( ~ c(X0)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ) ),
introduced(definition,[new_symbols(definition,[sQ57_spl])],[split_symbol_definition]) ).
fof(f521,plain,
! [X0] :
( ~ sQ57_spl
| ~ c(X0)
| ~ r(exist,X0)
| equalish(X0,u2r2(exist)) ),
inference(component_clause,[status(thm)],[f520]) ).
fof(f523,plain,
( ~ sQ3_spl
| ~ sQ11_spl
| sQ57_spl ),
inference(split_clause,[status(thm)],[f519,f520,f126,f84]) ).
fof(f532,plain,
( ~ sQ57_spl
| ~ r3least(exist)
| ~ c(u2r3(exist))
| ~ r(exist,u2r3(exist)) ),
inference(resolution,[status(thm)],[f521,f53]) ).
fof(f533,plain,
( ~ sQ57_spl
| ~ sQ1_spl
| ~ sQ8_spl
| ~ sQ27_spl ),
inference(split_clause,[status(thm)],[f532,f254,f109,f72,f520]) ).
fof(f534,plain,
$false,
inference(sat_refutation,[status(thm)],[f75,f79,f82,f90,f98,f107,f115,f122,f132,f135,f137,f374,f439,f452,f458,f464,f468,f469,f476,f483,f513,f523,f533]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS010-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 20 22:51:45 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.39 % Drodi V4.1.1
% 0.10/0.41 % Refutation found
% 0.10/0.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.45 % Elapsed time: 0.056598 seconds
% 0.10/0.45 % CPU time: 0.193820 seconds
% 0.10/0.45 % Total memory used: 18.110 MB
% 0.10/0.45 % Net memory used: 17.810 MB
%------------------------------------------------------------------------------