%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN352-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:15:51 PM UTC 2026
% Result : Unsatisfiable 0.13s 15.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 7 unt; 3 def)
% Number of atoms : 63 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 30 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
f(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
! [X,Y] :
( f(Y,z(X,Y))
| f(b,z(X,Y))
| ~ f(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
! [X,Y] :
( f(z(X,Y),z(X,Y))
| f(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
! [X,Y] :
( ~ f(Y,z(X,Y))
| ~ f(X,z(X,Y))
| ~ f(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
! [X,Y] :
( f(Y,z(X,Y))
| f(X,z(X,Y))
| ~ f(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,plain,
f(a,b),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f9,plain,
! [X0,X1] :
( f(X1,z(X0,X1))
| f(b,z(X0,X1))
| ~ f(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f10,plain,
! [X0,X1] :
( f(z(X0,X1),z(X0,X1))
| f(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ~ f(X1,z(X0,X1))
| ~ f(X0,z(X0,X1))
| ~ f(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f14,plain,
! [X0,X1] :
( f(X1,z(X0,X1))
| f(X0,z(X0,X1))
| ~ f(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f16,plain,
( f(b,z(a,b))
| f(b,z(a,b)) ),
inference(resolution,[status(thm)],[f9,f8]) ).
fof(f17,definition,
( sQ0_spl
<=> f(b,z(a,b)) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f18,plain,
( ~ sQ0_spl
| f(b,z(a,b)) ),
inference(component_clause,[status(thm)],[f17]) ).
fof(f20,plain,
sQ0_spl,
inference(split_clause,[status(thm)],[f16,f17]) ).
fof(f21,plain,
( ~ sQ0_spl
| ~ f(a,z(a,b))
| ~ f(a,b) ),
inference(resolution,[status(thm)],[f18,f13]) ).
fof(f23,definition,
( sQ1_spl
<=> f(a,b) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f25,plain,
( sQ1_spl
| ~ f(a,b) ),
inference(component_clause,[status(thm)],[f23]) ).
fof(f26,definition,
( sQ2_spl
<=> f(a,z(a,b)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f28,plain,
( sQ2_spl
| ~ f(a,z(a,b)) ),
inference(component_clause,[status(thm)],[f26]) ).
fof(f29,plain,
( ~ sQ0_spl
| ~ sQ2_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f21,f23,f26,f17]) ).
fof(f37,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f25,f8]) ).
fof(f38,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f37]) ).
fof(f48,plain,
! [X0,X1] :
( f(X0,X1)
| f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(z(X0,X1),z(z(X0,X1),z(X0,X1))) ),
inference(resolution,[status(thm)],[f14,f10]) ).
fof(f51,plain,
! [X0,X1] :
( f(X0,X1)
| f(z(X0,X1),z(z(X0,X1),z(X0,X1))) ),
inference(duplicate_literals_removal,[status(thm)],[f48]) ).
fof(f72,plain,
! [X0,X1] :
( ~ f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| ~ f(z(X0,X1),z(X0,X1))
| f(X0,X1) ),
inference(resolution,[status(thm)],[f51,f13]) ).
fof(f75,plain,
! [X0,X1] :
( ~ f(z(X0,X1),z(z(X0,X1),z(X0,X1)))
| f(X0,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f72,f10]) ).
fof(f78,plain,
( sQ2_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f28,f79]) ).
fof(f79,plain,
! [X0,X1] : f(X0,X1),
inference(forward_subsumption_resolution,[status(thm)],[f75,f51]) ).
fof(f82,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f83,plain,
$false,
inference(sat_refutation,[status(thm)],[f20,f29,f38,f82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN352-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/15.38 % Computer : n026.cluster.edu
% 0.09/15.38 % Model : x86_64 x86_64
% 0.09/15.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.38 % Memory : 8046.5625MB
% 0.09/15.38 % OS : Linux 6.8.0-71-generic
% 0.09/15.38 % CPULimit : 300
% 0.09/15.38 % WCLimit : 300
% 0.09/15.38 % DateTime : Mon Sep 21 10:54:07 UTC 2026
% 0.09/15.38 % CPUTime :
% 0.09/15.39 % Drodi V4.1.1
% 0.13/15.41 % Refutation found
% 0.13/15.41 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.13/15.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/15.43 % Elapsed time: 0.042393 seconds
% 0.13/15.43 % CPU time: 0.114698 seconds
% 0.13/15.43 % Total memory used: 15.558 MB
% 0.13/15.43 % Net memory used: 15.075 MB
%------------------------------------------------------------------------------