%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN009-2 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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 03:14:54 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 9 unt; 3 def)
% Number of atoms : 71 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 80 ( 39 ~; 38 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 4 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
! [X,Y,Z] :
( ~ t(X,Y,Z)
| ~ p(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
! [X,Y,Z] :
( ~ t(Y,Z,X)
| ~ q(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [X,Y,Z] :
( ~ t(Z,X,Y)
| ~ r(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
s(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
t(c,c,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
! [X,Y,Z] :
( r(Z,X,Y)
| q(Y,Z,X)
| p(X,Y,Z)
| ~ s(Z)
| ~ s(Y)
| ~ s(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,plain,
! [X0,X1,X2] :
( ~ t(X0,X1,X2)
| ~ p(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ~ t(X1,X2,X0)
| ~ q(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ~ t(X2,X0,X1)
| ~ r(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f14,plain,
s(c),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f15,plain,
t(c,c,c),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f16,plain,
! [X0,X1,X2] :
( r(X2,X0,X1)
| q(X1,X2,X0)
| p(X0,X1,X2)
| ~ s(X2)
| ~ s(X1)
| ~ s(X0) ),
inference(cnf_transformation,[status(thm)],[f8]) ).
fof(f17,plain,
~ p(c,c,c),
inference(resolution,[status(thm)],[f15,f9]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ t(X1,X2,X0)
| q(X1,X2,X0)
| p(X0,X1,X2)
| ~ s(X2)
| ~ s(X1)
| ~ s(X0) ),
inference(resolution,[status(thm)],[f16,f11]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ t(X2,X0,X1)
| ~ t(X1,X2,X0)
| p(X0,X1,X2)
| ~ s(X2)
| ~ s(X1)
| ~ s(X0) ),
inference(resolution,[status(thm)],[f18,f10]) ).
fof(f20,plain,
( ~ t(c,c,c)
| p(c,c,c)
| ~ s(c)
| ~ s(c)
| ~ s(c) ),
inference(resolution,[status(thm)],[f19,f15]) ).
fof(f21,definition,
( sQ0_spl
<=> s(c) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f23,plain,
( sQ0_spl
| ~ s(c) ),
inference(component_clause,[status(thm)],[f21]) ).
fof(f24,definition,
( sQ1_spl
<=> p(c,c,c) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f25,plain,
( ~ sQ1_spl
| p(c,c,c) ),
inference(component_clause,[status(thm)],[f24]) ).
fof(f27,definition,
( sQ2_spl
<=> t(c,c,c) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f29,plain,
( sQ2_spl
| ~ t(c,c,c) ),
inference(component_clause,[status(thm)],[f27]) ).
fof(f30,plain,
( ~ sQ2_spl
| sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f20,f21,f24,f27]) ).
fof(f31,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f29,f15]) ).
fof(f32,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f31]) ).
fof(f33,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f23,f14]) ).
fof(f34,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f33]) ).
fof(f35,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f25,f17]) ).
fof(f36,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f35]) ).
fof(f37,plain,
$false,
inference(sat_refutation,[status(thm)],[f30,f32,f34,f36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN009-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 10:38:34 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Drodi V4.1.1
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.41 % Elapsed time: 0.039628 seconds
% 0.12/0.41 % CPU time: 0.105696 seconds
% 0.12/0.41 % Total memory used: 16.062 MB
% 0.12/0.41 % Net memory used: 15.545 MB
%------------------------------------------------------------------------------