%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : KRS016-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:00:05 PM UTC 2026
% Result : Satisfiable 0.07s 0.37s
% Output : Saturation 0.07s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
d(exist),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X1,X2] :
( ~ r(X1,X2)
| ~ c(X1)
| s(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X1,X2] :
( ~ s(X1,X2)
| ~ c(X1)
| r(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X1] :
( ~ c(X1)
| r1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X1] :
( ~ r1most(X1)
| r(X1,u0r1(X1))
| s(X1,u0r1(X1))
| c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X1] :
( ~ s(X1,u0r1(X1))
| ~ r(X1,u0r1(X1))
| ~ r1most(X1)
| c(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X3,X2,X1] :
( ~ r(X1,X2)
| ~ r(X1,X3)
| ~ r1most(X1)
| equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X1] :
( ~ equalish(u1r2(X1),u1r1(X1))
| r1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X1] :
( r(X1,u1r1(X1))
| r1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
! [X1] :
( r(X1,u1r2(X1))
| r1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X1,X2] :
( ~ s(X1,X2)
| ~ r(X1,X2)
| ~ d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,axiom,
! [X1] :
( ~ d(X1)
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
! [X1] :
( ~ s1most(X1)
| s(X1,u2r1(X1))
| d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [X1] :
( ~ s1most(X1)
| r(X1,u2r1(X1))
| d(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [X3,X2,X1] :
( ~ s(X1,X2)
| ~ s(X1,X3)
| ~ s1most(X1)
| equalish(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [X1] :
( ~ equalish(u3r2(X1),u3r1(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [X1] :
( s(X1,u3r1(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X1] :
( s(X1,u3r2(X1))
| s1most(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,plain,
c(exist),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f21,plain,
d(exist),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f22,plain,
! [X0,X1] :
( ~ r(X0,X1)
| ~ c(X0)
| s(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f23,plain,
! [X0,X1] :
( ~ s(X0,X1)
| ~ c(X0)
| r(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f24,plain,
! [X0] :
( ~ c(X0)
| r1most(X0) ),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f25,plain,
! [X0] :
( ~ r1most(X0)
| r(X0,u0r1(X0))
| s(X0,u0r1(X0))
| c(X0) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f26,plain,
! [X0] :
( ~ s(X0,u0r1(X0))
| ~ r(X0,u0r1(X0))
| ~ r1most(X0)
| c(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f27,plain,
! [X2,X1] :
( ~ r(X1,X2)
| ! [X3] :
( ~ r(X1,X3)
| ~ r1most(X1)
| equalish(X3,X2) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ~ r(X2,X1)
| ~ r(X2,X0)
| ~ r1most(X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
fof(f29,plain,
! [X0] :
( ~ equalish(u1r2(X0),u1r1(X0))
| r1most(X0) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f30,plain,
! [X0] :
( r(X0,u1r1(X0))
| r1most(X0) ),
inference(cnf_transformation,[status(thm)],[f10]) ).
fof(f31,plain,
! [X0] :
( r(X0,u1r2(X0))
| r1most(X0) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f32,plain,
! [X0,X1] :
( ~ s(X0,X1)
| ~ r(X0,X1)
| ~ d(X0) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f33,plain,
! [X0] :
( ~ d(X0)
| s1most(X0) ),
inference(cnf_transformation,[status(thm)],[f13]) ).
fof(f34,plain,
! [X0] :
( ~ s1most(X0)
| s(X0,u2r1(X0))
| d(X0) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f35,plain,
! [X0] :
( ~ s1most(X0)
| r(X0,u2r1(X0))
| d(X0) ),
inference(cnf_transformation,[status(thm)],[f15]) ).
fof(f36,plain,
! [X2,X1] :
( ~ s(X1,X2)
| ! [X3] :
( ~ s(X1,X3)
| ~ s1most(X1)
| equalish(X3,X2) ) ),
inference(miniscoping,[status(thm)],[f16]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ s(X2,X1)
| ~ s(X2,X0)
| ~ s1most(X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f36]) ).
fof(f38,plain,
! [X0] :
( ~ equalish(u3r2(X0),u3r1(X0))
| s1most(X0) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f39,plain,
! [X0] :
( s(X0,u3r1(X0))
| s1most(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f40,plain,
! [X0] :
( s(X0,u3r2(X0))
| s1most(X0) ),
inference(cnf_transformation,[status(thm)],[f19]) ).
fof(f41,plain,
r1most(exist),
inference(resolution,[status(thm)],[f24,f20]) ).
fof(f42,plain,
s1most(exist),
inference(resolution,[status(thm)],[f33,f21]) ).
fof(f44,plain,
! [X0] :
( ~ s(X0,u1r1(X0))
| ~ d(X0)
| r1most(X0) ),
inference(resolution,[status(thm)],[f30,f32]) ).
fof(f46,plain,
( r(exist,u0r1(exist))
| s(exist,u0r1(exist))
| c(exist) ),
inference(resolution,[status(thm)],[f25,f41]) ).
fof(f47,definition,
( sQ0_spl
<=> c(exist) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f50,definition,
( sQ1_spl
<=> s(exist,u0r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f53,definition,
( sQ2_spl
<=> r(exist,u0r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f54,plain,
( ~ sQ2_spl
| r(exist,u0r1(exist)) ),
inference(component_clause,[status(thm)],[f53]) ).
fof(f55,plain,
( sQ2_spl
| ~ r(exist,u0r1(exist)) ),
inference(component_clause,[status(thm)],[f53]) ).
fof(f56,plain,
( sQ2_spl
| sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f46,f47,f50,f53]) ).
fof(f57,plain,
( ~ sQ2_spl
| ~ s(exist,u0r1(exist))
| ~ r1most(exist)
| c(exist) ),
inference(resolution,[status(thm)],[f54,f26]) ).
fof(f58,plain,
! [X0] :
( ~ sQ2_spl
| ~ r(exist,X0)
| ~ r1most(exist)
| equalish(X0,u0r1(exist)) ),
inference(resolution,[status(thm)],[f54,f28]) ).
fof(f59,plain,
( ~ sQ2_spl
| ~ s(exist,u0r1(exist))
| ~ d(exist) ),
inference(resolution,[status(thm)],[f54,f32]) ).
fof(f60,plain,
( ~ sQ2_spl
| ~ c(exist)
| s(exist,u0r1(exist)) ),
inference(resolution,[status(thm)],[f54,f22]) ).
fof(f61,definition,
( sQ3_spl
<=> r1most(exist) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f63,plain,
( sQ3_spl
| ~ r1most(exist) ),
inference(component_clause,[status(thm)],[f61]) ).
fof(f64,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ3_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f57,f47,f61,f50,f53]) ).
fof(f65,definition,
! [X0] :
( sQ4_spl
<=> ( ~ r(exist,X0)
| equalish(X0,u0r1(exist)) ) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f66,plain,
! [X0] :
( ~ sQ4_spl
| ~ r(exist,X0)
| equalish(X0,u0r1(exist)) ),
inference(component_clause,[status(thm)],[f65]) ).
fof(f68,plain,
( ~ sQ2_spl
| ~ sQ3_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f58,f65,f61,f53]) ).
fof(f69,definition,
( sQ5_spl
<=> d(exist) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f71,plain,
( sQ5_spl
| ~ d(exist) ),
inference(component_clause,[status(thm)],[f69]) ).
fof(f72,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f59,f69,f50,f53]) ).
fof(f73,plain,
( ~ sQ2_spl
| ~ sQ0_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f60,f50,f47,f53]) ).
fof(f74,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f63,f41]) ).
fof(f75,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f74]) ).
fof(f77,plain,
! [X0] :
( ~ s(X0,u1r2(X0))
| ~ d(X0)
| r1most(X0) ),
inference(resolution,[status(thm)],[f31,f32]) ).
fof(f80,plain,
! [X0] :
( ~ c(X0)
| r(X0,u3r1(X0))
| s1most(X0) ),
inference(resolution,[status(thm)],[f39,f23]) ).
fof(f81,plain,
( r(exist,u3r1(exist))
| s1most(exist) ),
inference(resolution,[status(thm)],[f80,f20]) ).
fof(f82,definition,
( sQ6_spl
<=> s1most(exist) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f85,definition,
( sQ7_spl
<=> r(exist,u3r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f88,plain,
( sQ7_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f81,f82,f85]) ).
fof(f90,plain,
! [X0] :
( ~ c(X0)
| r(X0,u3r2(X0))
| s1most(X0) ),
inference(resolution,[status(thm)],[f40,f23]) ).
fof(f91,plain,
( r(exist,u3r2(exist))
| s1most(exist) ),
inference(resolution,[status(thm)],[f90,f20]) ).
fof(f92,definition,
( sQ8_spl
<=> r(exist,u3r2(exist)) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f95,plain,
( sQ8_spl
| sQ6_spl ),
inference(split_clause,[status(thm)],[f91,f82,f92]) ).
fof(f96,plain,
( s(exist,u2r1(exist))
| d(exist) ),
inference(resolution,[status(thm)],[f34,f42]) ).
fof(f97,definition,
( sQ9_spl
<=> s(exist,u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f98,plain,
( ~ sQ9_spl
| s(exist,u2r1(exist)) ),
inference(component_clause,[status(thm)],[f97]) ).
fof(f100,plain,
( sQ9_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f96,f69,f97]) ).
fof(f101,plain,
( r(exist,u2r1(exist))
| d(exist) ),
inference(resolution,[status(thm)],[f35,f42]) ).
fof(f102,definition,
( sQ10_spl
<=> r(exist,u2r1(exist)) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f105,plain,
( sQ10_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f101,f69,f102]) ).
fof(model,axiom,
( sQ0_spl
| ~ sQ2_spl
| sQ3_spl
| sQ5_spl
| sQ6_spl ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KRS016-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n011.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sun Sep 20 22:50:40 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.35 % Drodi V4.1.1
% 0.07/0.37 % SZS status Satisfiable for theBenchmark: Theory is satisfiable
% 0.07/0.37 % SZS output start Saturation for theBenchmark
% See solution above
% 0.12/0.39 % Elapsed time: 0.038066 seconds
% 0.12/0.39 % CPU time: 0.085855 seconds
% 0.12/0.39 % Total memory used: 11.629 MB
% 0.12/0.39 % Net memory used: 11.387 MB
%------------------------------------------------------------------------------