%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.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 12:21:57 PM UTC 2026
% Result : Unsatisfiable 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 11 unt; 2 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 34 ~; 26 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X,Y] :
( ~ equalish(Y,X)
| equalish(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,axiom,
! [X,Z,Y] :
( ~ equalish(Y,Z)
| ~ equalish(X,Y)
| equalish(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f25,axiom,
! [X,Z,Y] :
( ~ equalish(X,Y)
| ~ defined(Z)
| equalish(multiply(X,Z),multiply(Y,Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,negated_conjecture,
equalish(multiply(a,b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
equalish(a,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f34,negated_conjecture,
~ equalish(multiply(d,b),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f67,plain,
! [X0,X1] :
( ~ equalish(X1,X0)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f68,plain,
! [Z,Y] :
( ~ equalish(Y,Z)
| ! [X] :
( ~ equalish(X,Y)
| equalish(X,Z) ) ),
inference(miniscoping,[status(thm)],[f23]) ).
fof(f69,plain,
! [X0,X1,X2] :
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f68]) ).
fof(f72,plain,
! [X,Y] :
( ~ equalish(X,Y)
| ! [Z] :
( ~ defined(Z)
| equalish(multiply(X,Z),multiply(Y,Z)) ) ),
inference(miniscoping,[status(thm)],[f25]) ).
fof(f73,plain,
! [X0,X1,X2] :
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(multiply(X0,X1),multiply(X2,X1)) ),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f78,plain,
defined(b),
inference(cnf_transformation,[status(thm)],[f29]) ).
fof(f81,plain,
equalish(multiply(a,b),c),
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f82,plain,
equalish(a,d),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f83,plain,
~ equalish(multiply(d,b),c),
inference(cnf_transformation,[status(thm)],[f34]) ).
fof(f87,plain,
! [X0] :
( ~ equalish(X0,c)
| ~ equalish(multiply(d,b),X0) ),
inference(resolution,[status(thm)],[f69,f83]) ).
fof(f108,definition,
( sQ4_spl
<=> defined(b) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f110,plain,
( sQ4_spl
| ~ defined(b) ),
inference(component_clause,[status(thm)],[f108]) ).
fof(f119,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f110,f78]) ).
fof(f120,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f119]) ).
fof(f121,plain,
! [X0] :
( ~ equalish(multiply(X0,b),c)
| ~ equalish(d,X0)
| ~ defined(b) ),
inference(resolution,[status(thm)],[f73,f87]) ).
fof(f122,definition,
! [X0] :
( sQ7_spl
<=> ( ~ equalish(multiply(X0,b),c)
| ~ equalish(d,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f123,plain,
! [X0] :
( ~ sQ7_spl
| ~ equalish(multiply(X0,b),c)
| ~ equalish(d,X0) ),
inference(component_clause,[status(thm)],[f122]) ).
fof(f125,plain,
( sQ7_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f121,f108,f122]) ).
fof(f145,plain,
( ~ sQ7_spl
| ~ equalish(d,a) ),
inference(resolution,[status(thm)],[f123,f81]) ).
fof(f151,plain,
( ~ sQ7_spl
| ~ equalish(a,d) ),
inference(resolution,[status(thm)],[f145,f67]) ).
fof(f152,plain,
( ~ sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f151,f82]) ).
fof(f153,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f152]) ).
fof(f154,plain,
$false,
inference(sat_refutation,[status(thm)],[f120,f125,f153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD030-2 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 % Computer : n026.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 15:41:22 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.47 % Drodi V4.1.1
% 0.18/0.50 % Refutation found
% 0.18/0.50 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.50 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/0.57 % Elapsed time: 0.104075 seconds
% 0.23/0.57 % CPU time: 0.097471 seconds
% 0.23/0.57 % Total memory used: 3.430 MB
% 0.23/0.57 % Net memory used: 3.402 MB
%------------------------------------------------------------------------------