%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : FLD021-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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:54 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 9 unt; 3 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 67 ( 35 ~; 29 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X] :
( ~ defined(X)
| equalish(add(additive_identity,X),X) ),
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(f24,axiom,
! [X,Z,Y] :
( ~ equalish(X,Y)
| ~ defined(Z)
| equalish(add(X,Z),add(Y,Z)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f28,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f30,negated_conjecture,
equalish(m,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,negated_conjecture,
~ equalish(add(m,a),a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f34,plain,
! [X0] :
( ~ defined(X0)
| equalish(add(additive_identity,X0),X0) ),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f65,plain,
! [Z,Y] :
( ~ equalish(Y,Z)
| ! [X] :
( ~ equalish(X,Y)
| equalish(X,Z) ) ),
inference(miniscoping,[status(thm)],[f23]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ~ equalish(X2,X1)
| ~ equalish(X0,X2)
| equalish(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f65]) ).
fof(f67,plain,
! [X,Y] :
( ~ equalish(X,Y)
| ! [Z] :
( ~ defined(Z)
| equalish(add(X,Z),add(Y,Z)) ) ),
inference(miniscoping,[status(thm)],[f24]) ).
fof(f68,plain,
! [X0,X1,X2] :
( ~ equalish(X0,X2)
| ~ defined(X1)
| equalish(add(X0,X1),add(X2,X1)) ),
inference(cnf_transformation,[status(thm)],[f67]) ).
fof(f74,plain,
defined(a),
inference(cnf_transformation,[status(thm)],[f28]) ).
fof(f76,plain,
equalish(m,additive_identity),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f77,plain,
~ equalish(add(m,a),a),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f81,plain,
! [X0] :
( ~ equalish(X0,a)
| ~ equalish(add(m,a),X0) ),
inference(resolution,[status(thm)],[f66,f77]) ).
fof(f88,definition,
( sQ1_spl
<=> defined(a) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f90,plain,
( sQ1_spl
| ~ defined(a) ),
inference(component_clause,[status(thm)],[f88]) ).
fof(f110,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f90,f74]) ).
fof(f111,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f110]) ).
fof(f112,plain,
! [X0] :
( ~ equalish(add(X0,a),a)
| ~ equalish(m,X0)
| ~ defined(a) ),
inference(resolution,[status(thm)],[f68,f81]) ).
fof(f113,definition,
! [X0] :
( sQ6_spl
<=> ( ~ equalish(add(X0,a),a)
| ~ equalish(m,X0) ) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f114,plain,
! [X0] :
( ~ sQ6_spl
| ~ equalish(add(X0,a),a)
| ~ equalish(m,X0) ),
inference(component_clause,[status(thm)],[f113]) ).
fof(f116,plain,
( sQ6_spl
| ~ sQ1_spl ),
inference(split_clause,[status(thm)],[f112,f88,f113]) ).
fof(f136,plain,
( ~ sQ6_spl
| ~ defined(a)
| ~ equalish(m,additive_identity) ),
inference(resolution,[status(thm)],[f114,f34]) ).
fof(f139,definition,
( sQ10_spl
<=> equalish(m,additive_identity) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f141,plain,
( sQ10_spl
| ~ equalish(m,additive_identity) ),
inference(component_clause,[status(thm)],[f139]) ).
fof(f142,plain,
( ~ sQ6_spl
| ~ sQ1_spl
| ~ sQ10_spl ),
inference(split_clause,[status(thm)],[f136,f139,f88,f113]) ).
fof(f143,plain,
( sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f141,f76]) ).
fof(f144,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f143]) ).
fof(f145,plain,
$false,
inference(sat_refutation,[status(thm)],[f111,f116,f142,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD021-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 % Computer : n009.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Sep 21 15:38:12 UTC 2026
% 0.14/0.38 % CPUTime :
% 0.14/0.41 % Drodi V4.1.1
% 0.14/0.42 % Refutation found
% 0.14/0.42 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.48 % Elapsed time: 0.072891 seconds
% 0.17/0.48 % CPU time: 0.066322 seconds
% 0.17/0.48 % Total memory used: 1.166 MB
% 0.17/0.48 % Net memory used: 1.156 MB
%------------------------------------------------------------------------------