%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV131+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:43 PM UTC 2026
% Result : Theorem 0.14s 5.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 2 def)
% Number of atoms : 99 ( 0 equ)
% Maximal formula atoms : 26 ( 6 avg)
% Number of connectives : 114 ( 31 ~; 18 |; 37 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ~ leq(tptp_float_0_001,pv1341) )
=> leq(n0,s_best7) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f244,plain,
( ~ leq(n0,s_best7)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ~ leq(tptp_float_0_001,pv1341) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f245,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f246,plain,
( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) ),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f258,plain,
~ leq(n0,s_best7),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f333,definition,
( sQ0_spl
<=> leq(tptp_float_0_001,pv1341) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f334,plain,
( ~ sQ0_spl
| leq(tptp_float_0_001,pv1341) ),
inference(component_clause,[status(thm)],[f333]) ).
fof(f336,definition,
( sQ1_spl
<=> leq(n0,s_best7) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f337,plain,
( ~ sQ1_spl
| leq(n0,s_best7) ),
inference(component_clause,[status(thm)],[f336]) ).
fof(f339,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f246,f333,f336]) ).
fof(f371,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f334,f245]) ).
fof(f372,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f371]) ).
fof(f373,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f337,f258]) ).
fof(f374,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f373]) ).
fof(f375,plain,
$false,
inference(sat_refutation,[status(thm)],[f339,f372,f374]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV131+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36 % Computer : n015.cluster.edu
% 0.09/5.36 % Model : x86_64 x86_64
% 0.09/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36 % Memory : 8046.5625MB
% 0.09/5.36 % OS : Linux 6.8.0-71-generic
% 0.09/5.36 % CPULimit : 300
% 0.09/5.36 % WCLimit : 300
% 0.09/5.36 % DateTime : Mon Sep 21 08:35:27 UTC 2026
% 0.09/5.37 % CPUTime :
% 0.09/5.38 % Drodi V4.1.1
% 0.14/5.40 % Refutation found
% 0.14/5.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.43 % Elapsed time: 0.051670 seconds
% 0.14/5.43 % CPU time: 0.122498 seconds
% 0.14/5.43 % Total memory used: 51.064 MB
% 0.14/5.43 % Net memory used: 50.986 MB
%------------------------------------------------------------------------------