%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV065+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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 02:46:33 PM UTC 2026
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 12 unt; 5 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 68 ( 21 ~; 22 |; 18 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10) )
=> ( leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10)
& leq(n0,n0) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f99,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f251,plain,
( ( ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) )
& leq(pv53,minus(n5,n1))
& leq(pv10,minus(n135300,n1))
& leq(n0,pv53)
& leq(n0,pv10) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f252,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f253,plain,
leq(n0,pv53),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f254,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f255,plain,
leq(pv53,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f256,plain,
( ~ leq(pv53,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv53)
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f338,definition,
( sQ0_spl
<=> leq(n0,n0) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f340,plain,
( sQ0_spl
| ~ leq(n0,n0) ),
inference(component_clause,[status(thm)],[f338]) ).
fof(f341,definition,
( sQ1_spl
<=> leq(n0,pv10) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f343,plain,
( sQ1_spl
| ~ leq(n0,pv10) ),
inference(component_clause,[status(thm)],[f341]) ).
fof(f344,definition,
( sQ2_spl
<=> leq(n0,pv53) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f346,plain,
( sQ2_spl
| ~ leq(n0,pv53) ),
inference(component_clause,[status(thm)],[f344]) ).
fof(f347,definition,
( sQ3_spl
<=> leq(pv10,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f349,plain,
( sQ3_spl
| ~ leq(pv10,minus(n135300,n1)) ),
inference(component_clause,[status(thm)],[f347]) ).
fof(f350,definition,
( sQ4_spl
<=> leq(pv53,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f352,plain,
( sQ4_spl
| ~ leq(pv53,minus(n5,n1)) ),
inference(component_clause,[status(thm)],[f350]) ).
fof(f353,plain,
( ~ sQ4_spl
| ~ sQ3_spl
| ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f256,f338,f341,f344,f347,f350]) ).
fof(f356,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f352,f255]) ).
fof(f357,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f356]) ).
fof(f358,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f349,f254]) ).
fof(f359,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f358]) ).
fof(f360,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f346,f253]) ).
fof(f361,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f360]) ).
fof(f369,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f340,f99]) ).
fof(f370,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f369]) ).
fof(f371,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f343,f252]) ).
fof(f372,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f371]) ).
fof(f373,plain,
$false,
inference(sat_refutation,[status(thm)],[f353,f357,f359,f361,f370,f372]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV065+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.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 08:27:20 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.14/0.39 % Refutation found
% 0.14/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42 % Elapsed time: 0.060103 seconds
% 0.14/0.42 % CPU time: 0.167476 seconds
% 0.14/0.42 % Total memory used: 105.218 MB
% 0.14/0.42 % Net memory used: 105.070 MB
%------------------------------------------------------------------------------