%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV073+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:34 PM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 9 unt; 4 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 56 ( 17 ~; 17 |; 16 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( leq(pv35,minus(n135300,n1))
& leq(pv31,minus(n5,n1))
& leq(n0,pv35)
& leq(n0,pv31) )
=> ( leq(pv35,minus(n135300,n1))
& leq(pv31,minus(n5,n1))
& leq(n0,pv35)
& leq(n0,pv31) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(pv35,minus(n135300,n1))
& leq(pv31,minus(n5,n1))
& leq(n0,pv35)
& leq(n0,pv31) )
=> ( leq(pv35,minus(n135300,n1))
& leq(pv31,minus(n5,n1))
& leq(n0,pv35)
& leq(n0,pv31) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
( ( ~ leq(pv35,minus(n135300,n1))
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv35)
| ~ leq(n0,pv31) )
& leq(pv35,minus(n135300,n1))
& leq(pv31,minus(n5,n1))
& leq(n0,pv35)
& leq(n0,pv31) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f252,plain,
leq(n0,pv31),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f253,plain,
leq(n0,pv35),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f254,plain,
leq(pv31,minus(n5,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f255,plain,
leq(pv35,minus(n135300,n1)),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f256,plain,
( ~ leq(pv35,minus(n135300,n1))
| ~ leq(pv31,minus(n5,n1))
| ~ leq(n0,pv35)
| ~ leq(n0,pv31) ),
inference(cnf_transformation,[status(thm)],[f251]) ).
fof(f338,definition,
( sQ0_spl
<=> leq(n0,pv31) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f340,plain,
( sQ0_spl
| ~ leq(n0,pv31) ),
inference(component_clause,[status(thm)],[f338]) ).
fof(f341,definition,
( sQ1_spl
<=> leq(n0,pv35) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f343,plain,
( sQ1_spl
| ~ leq(n0,pv35) ),
inference(component_clause,[status(thm)],[f341]) ).
fof(f344,definition,
( sQ2_spl
<=> leq(pv31,minus(n5,n1)) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f346,plain,
( sQ2_spl
| ~ leq(pv31,minus(n5,n1)) ),
inference(component_clause,[status(thm)],[f344]) ).
fof(f347,definition,
( sQ3_spl
<=> leq(pv35,minus(n135300,n1)) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f349,plain,
( sQ3_spl
| ~ leq(pv35,minus(n135300,n1)) ),
inference(component_clause,[status(thm)],[f347]) ).
fof(f350,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f256,f338,f341,f344,f347]) ).
fof(f353,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f349,f255]) ).
fof(f354,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f353]) ).
fof(f355,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f346,f254]) ).
fof(f356,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f355]) ).
fof(f357,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f340,f252]) ).
fof(f358,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f357]) ).
fof(f359,plain,
( sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f343,f253]) ).
fof(f360,plain,
sQ1_spl,
inference(contradiction_clause,[status(thm)],[f359]) ).
fof(f361,plain,
$false,
inference(sat_refutation,[status(thm)],[f350,f354,f356,f358,f360]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV073+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n007.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 08:27:50 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.13/0.39 % Refutation found
% 0.13/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43 % Elapsed time: 0.058455 seconds
% 0.13/0.43 % CPU time: 0.164932 seconds
% 0.13/0.43 % Total memory used: 108.635 MB
% 0.13/0.43 % Net memory used: 108.483 MB
%------------------------------------------------------------------------------