%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV132+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n013.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:50:07 PM UTC 2026
% Result : Theorem 0.20s 15.50s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV132+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/15.45 % Computer : n013.cluster.edu
% 0.16/15.45 % Model : x86_64 x86_64
% 0.16/15.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/15.45 % Memory : 8046.5625MB
% 0.16/15.45 % OS : Linux 6.8.0-71-generic
% 0.16/15.45 % CPULimit : 300
% 0.16/15.45 % WCLimit : 300
% 0.16/15.45 % DateTime : Mon Sep 21 08:31:52 UTC 2026
% 0.16/15.45 % CPUTime :
% 0.16/15.47 % Drodi V4.1.1
% 0.20/15.50 % Refutation found
% 0.20/15.50 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/15.50 % SZS output start CNFRefutation for theBenchmark
% 0.20/15.50 fof(f53,conjecture,(
% 0.20/15.50 ( ( ~ leq(tptp_float_0_001,pv1341)& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_best7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_sworst7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_worst7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_best7,n3) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_sworst7,n3) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_worst7,n3) )& ( gt(loopcounter,n0)=> leq(n0,s_best7) )& ( gt(loopcounter,n0)=> leq(n0,s_sworst7) )& ( gt(loopcounter,n0)=> leq(n0,s_worst7) )& ( gt(loopcounter,n0)=> leq(s_best7,n3) )& ( gt(loopcounter,n0)=> leq(s_sworst7,n3) )& ( gt(loopcounter,n0)=> leq(s_worst7,n3) ) )=> leq(s_best7,n3) ) ),
% 0.20/15.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.20/15.50 fof(f54,negated_conjecture,(
% 0.20/15.50 ~(( ( ~ leq(tptp_float_0_001,pv1341)& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_best7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_sworst7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(n0,s_worst7) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_best7,n3) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_sworst7,n3) )& ( ~ leq(tptp_float_0_001,pv1341)=> leq(s_worst7,n3) )& ( gt(loopcounter,n0)=> leq(n0,s_best7) )& ( gt(loopcounter,n0)=> leq(n0,s_sworst7) )& ( gt(loopcounter,n0)=> leq(n0,s_worst7) )& ( gt(loopcounter,n0)=> leq(s_best7,n3) )& ( gt(loopcounter,n0)=> leq(s_sworst7,n3) )& ( gt(loopcounter,n0)=> leq(s_worst7,n3) ) )=> leq(s_best7,n3) ) )),
% 0.20/15.50 inference(negated_conjecture,[status(cth)],[f53])).
% 0.20/15.50 fof(f244,plain,(
% 0.20/15.50 (((((((((((((~leq(tptp_float_0_001,pv1341)&(leq(tptp_float_0_001,pv1341)|leq(n0,s_best7)))&(leq(tptp_float_0_001,pv1341)|leq(n0,s_sworst7)))&(leq(tptp_float_0_001,pv1341)|leq(n0,s_worst7)))&(leq(tptp_float_0_001,pv1341)|leq(s_best7,n3)))&(leq(tptp_float_0_001,pv1341)|leq(s_sworst7,n3)))&(leq(tptp_float_0_001,pv1341)|leq(s_worst7,n3)))&(~gt(loopcounter,n0)|leq(n0,s_best7)))&(~gt(loopcounter,n0)|leq(n0,s_sworst7)))&(~gt(loopcounter,n0)|leq(n0,s_worst7)))&(~gt(loopcounter,n0)|leq(s_best7,n3)))&(~gt(loopcounter,n0)|leq(s_sworst7,n3)))&(~gt(loopcounter,n0)|leq(s_worst7,n3)))&~leq(s_best7,n3))),
% 0.20/15.50 inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.20/15.50 fof(f245,plain,(
% 0.20/15.50 ~leq(tptp_float_0_001,pv1341)),
% 0.20/15.50 inference(cnf_transformation,[status(thm)],[f244])).
% 0.20/15.50 fof(f249,plain,(
% 0.20/15.50 leq(tptp_float_0_001,pv1341)|leq(s_best7,n3)),
% 0.20/15.50 inference(cnf_transformation,[status(thm)],[f244])).
% 0.20/15.50 fof(f258,plain,(
% 0.20/15.50 ~leq(s_best7,n3)),
% 0.20/15.50 inference(cnf_transformation,[status(thm)],[f244])).
% 0.20/15.50 fof(f333,definition,(
% 0.20/15.50 sQ0_spl <=> (leq(tptp_float_0_001,pv1341))),
% 0.20/15.50 introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition])).
% 0.20/15.50 fof(f334,plain,(
% 0.20/15.50 leq(tptp_float_0_001,pv1341)|~sQ0_spl),
% 0.20/15.50 inference(component_clause,[status(thm)],[f333])).
% 0.20/15.50 fof(f348,definition,(
% 0.20/15.50 sQ4_spl <=> (leq(s_best7,n3))),
% 0.20/15.50 introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition])).
% 0.20/15.50 fof(f349,plain,(
% 0.20/15.50 leq(s_best7,n3)|~sQ4_spl),
% 0.20/15.50 inference(component_clause,[status(thm)],[f348])).
% 0.20/15.50 fof(f351,plain,(
% 0.20/15.50 sQ0_spl|sQ4_spl),
% 0.20/15.50 inference(split_clause,[status(thm)],[f249,f333,f348])).
% 0.20/15.50 fof(f371,plain,(
% 0.20/15.50 $false|~sQ0_spl),
% 0.20/15.50 inference(forward_subsumption_resolution,[status(thm)],[f334,f245])).
% 0.20/15.50 fof(f372,plain,(
% 0.20/15.50 ~sQ0_spl),
% 0.20/15.50 inference(contradiction_clause,[status(thm)],[f371])).
% 0.20/15.50 fof(f373,plain,(
% 0.20/15.50 $false|~sQ4_spl),
% 0.20/15.50 inference(forward_subsumption_resolution,[status(thm)],[f349,f258])).
% 0.20/15.50 fof(f374,plain,(
% 0.20/15.50 ~sQ4_spl),
% 0.20/15.50 inference(contradiction_clause,[status(thm)],[f373])).
% 0.20/15.50 fof(f375,plain,(
% 0.20/15.50 $false),
% 0.20/15.50 inference(sat_refutation,[status(thm)],[f351,f372,f374])).
% 0.20/15.50 % SZS output end CNFRefutation for theBenchmark.p
% 0.20/15.52 % Elapsed time: 0.064768 seconds
% 0.20/15.52 % CPU time: 0.161452 seconds
% 0.20/15.52 % Total memory used: 47.708 MB
% 0.20/15.52 % Net memory used: 47.624 MB
%------------------------------------------------------------------------------