%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV144+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 : n006.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:08 PM UTC 2026
% Result : Theorem 0.09s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV144+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n006.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:32:58 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.38 % Drodi V4.1.1
% 0.09/0.42 % Refutation found
% 0.09/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.42 % SZS output start CNFRefutation for theBenchmark
% 0.09/0.42 fof(f2,axiom,(
% 0.09/0.42 (! [X,Y,Z] :( ( gt(X,Y)& gt(Y,Z) )=> gt(X,Z) ) )),
% 0.09/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.42 fof(f4,axiom,(
% 0.09/0.42 (! [X] : leq(X,X) )),
% 0.09/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.42 fof(f9,axiom,(
% 0.09/0.42 (! [X,Y] :( ( leq(X,Y)& X != Y )=> gt(Y,X) ) )),
% 0.09/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.42 fof(f53,conjecture,(
% 0.09/0.42 ( ( leq(tptp_float_0_001,pv1341)& leq(n1,loopcounter)& ( ~ 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_worst7,n3) ) ),
% 0.09/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.42 fof(f54,negated_conjecture,(
% 0.09/0.42 ~(( ( leq(tptp_float_0_001,pv1341)& leq(n1,loopcounter)& ( ~ 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_worst7,n3) ) )),
% 0.09/0.42 inference(negated_conjecture,[status(cth)],[f53])).
% 0.09/0.42 fof(f64,axiom,(
% 0.09/0.42 gt(n1,n0) ),
% 0.09/0.42 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.09/0.42 fof(f88,plain,(
% 0.09/0.42 ![X,Y,Z]: ((~gt(X,Y)|~gt(Y,Z))|gt(X,Z))),
% 0.09/0.42 inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.09/0.42 fof(f89,plain,(
% 0.09/0.42 ![X,Z]: ((![Y]: (~gt(X,Y)|~gt(Y,Z)))|gt(X,Z))),
% 0.09/0.42 inference(miniscoping,[status(thm)],[f88])).
% 0.09/0.42 fof(f90,plain,(
% 0.09/0.42 ![X0,X1,X2]: (~gt(X0,X1)|~gt(X1,X2)|gt(X0,X2))),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f89])).
% 0.09/0.42 fof(f92,plain,(
% 0.09/0.42 ![X0]: (leq(X0,X0))),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f4])).
% 0.09/0.42 fof(f106,plain,(
% 0.09/0.42 ![X,Y]: ((~leq(X,Y)|X=Y)|gt(Y,X))),
% 0.09/0.42 inference(pre_NNF_transformation,[status(thm)],[f9])).
% 0.09/0.42 fof(f107,plain,(
% 0.09/0.42 ![X0,X1]: (~leq(X0,X1)|X0=X1|gt(X1,X0))),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f106])).
% 0.09/0.42 fof(f244,plain,(
% 0.09/0.42 ((((((((((((((leq(tptp_float_0_001,pv1341)&leq(n1,loopcounter))&(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_worst7,n3))),
% 0.09/0.42 inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.09/0.42 fof(f246,plain,(
% 0.09/0.42 leq(n1,loopcounter)),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f244])).
% 0.09/0.42 fof(f258,plain,(
% 0.09/0.42 ~gt(loopcounter,n0)|leq(s_worst7,n3)),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f244])).
% 0.09/0.42 fof(f259,plain,(
% 0.09/0.42 ~leq(s_worst7,n3)),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f244])).
% 0.09/0.42 fof(f269,plain,(
% 0.09/0.42 gt(n1,n0)),
% 0.09/0.42 inference(cnf_transformation,[status(thm)],[f64])).
% 0.09/0.42 fof(f357,definition,(
% 0.09/0.42 sQ6_spl <=> (leq(s_worst7,n3))),
% 0.09/0.42 introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition])).
% 0.09/0.42 fof(f358,plain,(
% 0.09/0.42 leq(s_worst7,n3)|~sQ6_spl),
% 0.09/0.42 inference(component_clause,[status(thm)],[f357])).
% 0.09/0.42 fof(f361,definition,(
% 0.09/0.42 sQ7_spl <=> (gt(loopcounter,n0))),
% 0.09/0.42 introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition])).
% 0.09/0.42 fof(f363,plain,(
% 0.09/0.42 ~gt(loopcounter,n0)|sQ7_spl),
% 0.09/0.42 inference(component_clause,[status(thm)],[f361])).
% 0.09/0.42 fof(f369,plain,(
% 0.09/0.42 ~sQ7_spl|sQ6_spl),
% 0.09/0.42 inference(split_clause,[status(thm)],[f258,f361,f357])).
% 0.09/0.42 fof(f385,plain,(
% 0.09/0.42 ![X0]: (~gt(loopcounter,X0)|~gt(X0,n0)|sQ7_spl)),
% 0.09/0.42 inference(resolution,[status(thm)],[f90,f363])).
% 0.09/0.42 fof(f427,plain,(
% 0.09/0.42 n1=loopcounter|gt(loopcounter,n1)),
% 0.09/0.42 inference(resolution,[status(thm)],[f107,f246])).
% 0.09/0.42 fof(f432,definition,(
% 0.09/0.42 sQ11_spl <=> (n1=loopcounter)),
% 0.09/0.42 introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition])).
% 0.09/0.42 fof(f433,plain,(
% 0.09/0.42 n1=loopcounter|~sQ11_spl),
% 0.09/0.42 inference(component_clause,[status(thm)],[f432])).
% 0.09/0.42 fof(f435,definition,(
% 0.09/0.42 sQ12_spl <=> (gt(loopcounter,n1))),
% 0.09/0.42 introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition])).
% 0.09/0.42 fof(f436,plain,(
% 0.09/0.42 gt(loopcounter,n1)|~sQ12_spl),
% 0.09/0.42 inference(component_clause,[status(thm)],[f435])).
% 0.09/0.42 fof(f438,plain,(
% 0.09/0.42 sQ11_spl|sQ12_spl),
% 0.09/0.42 inference(split_clause,[status(thm)],[f427,f432,f435])).
% 0.09/0.42 fof(f451,plain,(
% 0.09/0.42 gt(loopcounter,n0)|~sQ11_spl),
% 0.09/0.42 inference(backward_demodulation,[status(thm)],[f433,f269])).
% 0.09/0.42 fof(f453,plain,(
% 0.09/0.42 $false|sQ7_spl|~sQ11_spl),
% 0.09/0.42 inference(forward_subsumption_resolution,[status(thm)],[f451,f363])).
% 0.09/0.42 fof(f454,plain,(
% 0.09/0.42 sQ7_spl|~sQ11_spl),
% 0.09/0.42 inference(contradiction_clause,[status(thm)],[f453])).
% 0.09/0.42 fof(f455,plain,(
% 0.09/0.42 $false|~sQ6_spl),
% 0.09/0.42 inference(forward_subsumption_resolution,[status(thm)],[f358,f259])).
% 0.09/0.42 fof(f456,plain,(
% 0.09/0.42 ~sQ6_spl),
% 0.09/0.42 inference(contradiction_clause,[status(thm)],[f455])).
% 0.09/0.42 fof(f581,definition,(
% 0.09/0.42 sQ20_spl <=> (leq(n0,n0))),
% 0.09/0.42 introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition])).
% 0.09/0.42 fof(f583,plain,(
% 0.09/0.42 ~leq(n0,n0)|sQ20_spl),
% 0.09/0.42 inference(component_clause,[status(thm)],[f581])).
% 0.09/0.42 fof(f589,plain,(
% 0.09/0.42 $false|sQ20_spl),
% 0.09/0.42 inference(forward_subsumption_resolution,[status(thm)],[f583,f92])).
% 0.09/0.42 fof(f590,plain,(
% 0.09/0.42 sQ20_spl),
% 0.09/0.42 inference(contradiction_clause,[status(thm)],[f589])).
% 0.09/0.42 fof(f661,plain,(
% 0.09/0.42 ~gt(n1,n0)|sQ7_spl|~sQ12_spl),
% 0.09/0.42 inference(resolution,[status(thm)],[f385,f436])).
% 0.09/0.42 fof(f668,plain,(
% 0.09/0.42 $false|sQ7_spl|~sQ12_spl),
% 0.09/0.42 inference(forward_subsumption_resolution,[status(thm)],[f661,f269])).
% 0.09/0.42 fof(f669,plain,(
% 0.09/0.42 sQ7_spl|~sQ12_spl),
% 0.09/0.42 inference(contradiction_clause,[status(thm)],[f668])).
% 0.09/0.42 fof(f670,plain,(
% 0.09/0.42 $false),
% 0.09/0.42 inference(sat_refutation,[status(thm)],[f369,f438,f454,f456,f590,f669])).
% 0.09/0.42 % SZS output end CNFRefutation for theBenchmark.p
% 0.09/0.46 % Elapsed time: 0.081818 seconds
% 0.09/0.46 % CPU time: 0.313322 seconds
% 0.09/0.46 % Total memory used: 110.971 MB
% 0.09/0.46 % Net memory used: 110.507 MB
%------------------------------------------------------------------------------