%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : NUM843+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n004.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:41:48 PM UTC 2026
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 9 unt; 2 def)
% Number of atoms : 54 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 21 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
~ greater(vd390,vd391),
inference(negated_conjecture,[status(cth)],[f1]) ).
fof(f3,axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [Vd249,Vd250] :
( leq(Vd250,Vd249)
<=> ( Vd250 = Vd249
| less(Vd250,Vd249) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f26,axiom,
! [Vd203,Vd204] :
( less(Vd203,Vd204)
| greater(Vd203,Vd204)
| Vd203 = Vd204 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f48,plain,
~ greater(vd390,vd391),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f49,plain,
~ leq(vd390,vd391),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f94,plain,
! [Vd249,Vd250] :
( ( ( Vd250 != Vd249
& ~ less(Vd250,Vd249) )
| leq(Vd250,Vd249) )
& ( Vd250 = Vd249
| less(Vd250,Vd249)
| ~ leq(Vd250,Vd249) ) ),
inference(NNF_transformation,[status(thm)],[f22]) ).
fof(f95,plain,
( ! [Vd249,Vd250] :
( ( Vd250 != Vd249
& ~ less(Vd250,Vd249) )
| leq(Vd250,Vd249) )
& ! [Vd249,Vd250] :
( Vd250 = Vd249
| less(Vd250,Vd249)
| ~ leq(Vd250,Vd249) ) ),
inference(miniscoping,[status(thm)],[f94]) ).
fof(f97,plain,
! [X0,X1] :
( ~ less(X0,X1)
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f95]) ).
fof(f98,plain,
! [X0,X1] :
( X0 != X1
| leq(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f95]) ).
fof(f108,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(thm)],[f26]) ).
fof(f148,plain,
! [X0] : leq(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f98]) ).
fof(f251,definition,
( sQ5_spl
<=> vd390 = vd391 ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f252,plain,
( ~ sQ5_spl
| vd390 = vd391 ),
inference(component_clause,[status(thm)],[f251]) ).
fof(f304,plain,
( less(vd390,vd391)
| vd390 = vd391 ),
inference(resolution,[status(thm)],[f108,f48]) ).
fof(f306,definition,
( sQ8_spl
<=> less(vd390,vd391) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f307,plain,
( ~ sQ8_spl
| less(vd390,vd391) ),
inference(component_clause,[status(thm)],[f306]) ).
fof(f309,plain,
( sQ8_spl
| sQ5_spl ),
inference(split_clause,[status(thm)],[f304,f251,f306]) ).
fof(f334,plain,
( ~ sQ5_spl
| ~ leq(vd390,vd390) ),
inference(backward_demodulation,[status(thm)],[f252,f49]) ).
fof(f336,plain,
( ~ sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f334,f148]) ).
fof(f337,plain,
~ sQ5_spl,
inference(contradiction_clause,[status(thm)],[f336]) ).
fof(f352,plain,
( ~ sQ8_spl
| leq(vd390,vd391) ),
inference(resolution,[status(thm)],[f307,f97]) ).
fof(f354,plain,
( ~ sQ8_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f352,f49]) ).
fof(f355,plain,
~ sQ8_spl,
inference(contradiction_clause,[status(thm)],[f354]) ).
fof(f356,plain,
$false,
inference(sat_refutation,[status(thm)],[f309,f337,f355]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM843+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n004.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Mon Sep 21 03:13:04 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.36 % Drodi V4.1.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43 % Elapsed time: 0.067274 seconds
% 0.14/0.43 % CPU time: 0.276776 seconds
% 0.14/0.43 % Total memory used: 105.884 MB
% 0.14/0.43 % Net memory used: 105.506 MB
%------------------------------------------------------------------------------