%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : SWV141+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 : n008.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.21s 0.48s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV141+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/0.41 % Computer : n008.cluster.edu
% 0.16/0.41 % Model : x86_64 x86_64
% 0.16/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41 % Memory : 8046.5625MB
% 0.16/0.41 % OS : Linux 6.8.0-71-generic
% 0.16/0.41 % CPULimit : 300
% 0.16/0.41 % WCLimit : 300
% 0.16/0.41 % DateTime : Mon Sep 21 08:33:54 UTC 2026
% 0.16/0.41 % CPUTime :
% 0.16/0.43 % Drodi V4.1.1
% 0.21/0.48 % Refutation found
% 0.21/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.48 % SZS output start CNFRefutation for theBenchmark
% 0.21/0.48 fof(f2,axiom,(
% 0.21/0.48 (! [X,Y,Z] :( ( gt(X,Y)& gt(Y,Z) )=> gt(X,Z) ) )),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.21/0.48 fof(f4,axiom,(
% 0.21/0.48 (! [X] : leq(X,X) )),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.21/0.48 fof(f9,axiom,(
% 0.21/0.48 (! [X,Y] :( ( leq(X,Y)& X != Y )=> gt(Y,X) ) )),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.21/0.48 fof(f53,conjecture,(
% 0.21/0.48 ( ( 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(n0,s_worst7) ) ),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.21/0.48 fof(f54,negated_conjecture,(
% 0.21/0.48 ~(( ( 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(n0,s_worst7) ) )),
% 0.21/0.48 inference(negated_conjecture,[status(cth)],[f53])).
% 0.21/0.48 fof(f64,axiom,(
% 0.21/0.48 gt(n1,n0) ),
% 0.21/0.48 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.21/0.48 fof(f88,plain,(
% 0.21/0.48 ![X,Y,Z]: ((~gt(X,Y)|~gt(Y,Z))|gt(X,Z))),
% 0.21/0.48 inference(pre_NNF_transformation,[status(thm)],[f2])).
% 0.21/0.48 fof(f89,plain,(
% 0.21/0.48 ![X,Z]: ((![Y]: (~gt(X,Y)|~gt(Y,Z)))|gt(X,Z))),
% 0.21/0.48 inference(miniscoping,[status(thm)],[f88])).
% 0.21/0.48 fof(f90,plain,(
% 0.21/0.48 ![X0,X1,X2]: (~gt(X0,X1)|~gt(X1,X2)|gt(X0,X2))),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f89])).
% 0.21/0.48 fof(f92,plain,(
% 0.21/0.48 ![X0]: (leq(X0,X0))),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f4])).
% 0.21/0.48 fof(f106,plain,(
% 0.21/0.48 ![X,Y]: ((~leq(X,Y)|X=Y)|gt(Y,X))),
% 0.21/0.48 inference(pre_NNF_transformation,[status(thm)],[f9])).
% 0.21/0.48 fof(f107,plain,(
% 0.21/0.48 ![X0,X1]: (~leq(X0,X1)|X0=X1|gt(X1,X0))),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f106])).
% 0.21/0.48 fof(f244,plain,(
% 0.21/0.48 ((((((((((((((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(n0,s_worst7))),
% 0.21/0.48 inference(pre_NNF_transformation,[status(thm)],[f54])).
% 0.21/0.48 fof(f246,plain,(
% 0.21/0.48 leq(n1,loopcounter)),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f244])).
% 0.21/0.48 fof(f255,plain,(
% 0.21/0.48 ~gt(loopcounter,n0)|leq(n0,s_worst7)),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f244])).
% 0.21/0.48 fof(f259,plain,(
% 0.21/0.48 ~leq(n0,s_worst7)),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f244])).
% 0.21/0.48 fof(f269,plain,(
% 0.21/0.48 gt(n1,n0)),
% 0.21/0.48 inference(cnf_transformation,[status(thm)],[f64])).
% 0.21/0.48 fof(f345,definition,(
% 0.21/0.48 sQ3_spl <=> (leq(n0,s_worst7))),
% 0.21/0.48 introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition])).
% 0.21/0.48 fof(f346,plain,(
% 0.21/0.48 leq(n0,s_worst7)|~sQ3_spl),
% 0.21/0.48 inference(component_clause,[status(thm)],[f345])).
% 0.21/0.48 fof(f361,definition,(
% 0.21/0.49 sQ7_spl <=> (gt(loopcounter,n0))),
% 0.21/0.49 introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition])).
% 0.21/0.49 fof(f363,plain,(
% 0.21/0.49 ~gt(loopcounter,n0)|sQ7_spl),
% 0.21/0.49 inference(component_clause,[status(thm)],[f361])).
% 0.21/0.49 fof(f366,plain,(
% 0.21/0.49 ~sQ7_spl|sQ3_spl),
% 0.21/0.49 inference(split_clause,[status(thm)],[f255,f361,f345])).
% 0.21/0.49 fof(f385,plain,(
% 0.21/0.49 ![X0]: (~gt(loopcounter,X0)|~gt(X0,n0)|sQ7_spl)),
% 0.21/0.49 inference(resolution,[status(thm)],[f90,f363])).
% 0.21/0.49 fof(f427,plain,(
% 0.21/0.49 n1=loopcounter|gt(loopcounter,n1)),
% 0.21/0.49 inference(resolution,[status(thm)],[f107,f246])).
% 0.21/0.49 fof(f432,definition,(
% 0.21/0.49 sQ11_spl <=> (n1=loopcounter)),
% 0.21/0.49 introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition])).
% 0.21/0.49 fof(f433,plain,(
% 0.21/0.49 n1=loopcounter|~sQ11_spl),
% 0.21/0.49 inference(component_clause,[status(thm)],[f432])).
% 0.21/0.49 fof(f435,definition,(
% 0.21/0.49 sQ12_spl <=> (gt(loopcounter,n1))),
% 0.21/0.49 introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition])).
% 0.21/0.49 fof(f436,plain,(
% 0.21/0.49 gt(loopcounter,n1)|~sQ12_spl),
% 0.21/0.49 inference(component_clause,[status(thm)],[f435])).
% 0.21/0.49 fof(f438,plain,(
% 0.21/0.49 sQ11_spl|sQ12_spl),
% 0.21/0.49 inference(split_clause,[status(thm)],[f427,f432,f435])).
% 0.21/0.49 fof(f451,plain,(
% 0.21/0.49 gt(loopcounter,n0)|~sQ11_spl),
% 0.21/0.49 inference(backward_demodulation,[status(thm)],[f433,f269])).
% 0.21/0.49 fof(f453,plain,(
% 0.21/0.49 $false|sQ7_spl|~sQ11_spl),
% 0.21/0.49 inference(forward_subsumption_resolution,[status(thm)],[f451,f363])).
% 0.21/0.49 fof(f454,plain,(
% 0.21/0.49 sQ7_spl|~sQ11_spl),
% 0.21/0.49 inference(contradiction_clause,[status(thm)],[f453])).
% 0.21/0.49 fof(f455,plain,(
% 0.21/0.49 $false|~sQ3_spl),
% 0.21/0.49 inference(forward_subsumption_resolution,[status(thm)],[f346,f259])).
% 0.21/0.49 fof(f456,plain,(
% 0.21/0.49 ~sQ3_spl),
% 0.21/0.49 inference(contradiction_clause,[status(thm)],[f455])).
% 0.21/0.49 fof(f578,definition,(
% 0.21/0.49 sQ19_spl <=> (leq(n0,n0))),
% 0.21/0.49 introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition])).
% 0.21/0.49 fof(f580,plain,(
% 0.21/0.49 ~leq(n0,n0)|sQ19_spl),
% 0.21/0.49 inference(component_clause,[status(thm)],[f578])).
% 0.21/0.49 fof(f586,plain,(
% 0.21/0.49 $false|sQ19_spl),
% 0.21/0.49 inference(forward_subsumption_resolution,[status(thm)],[f580,f92])).
% 0.21/0.49 fof(f587,plain,(
% 0.21/0.49 sQ19_spl),
% 0.21/0.49 inference(contradiction_clause,[status(thm)],[f586])).
% 0.21/0.49 fof(f658,plain,(
% 0.21/0.49 ~gt(n1,n0)|sQ7_spl|~sQ12_spl),
% 0.21/0.49 inference(resolution,[status(thm)],[f385,f436])).
% 0.21/0.49 fof(f665,plain,(
% 0.21/0.49 $false|sQ7_spl|~sQ12_spl),
% 0.21/0.49 inference(forward_subsumption_resolution,[status(thm)],[f658,f269])).
% 0.21/0.49 fof(f666,plain,(
% 0.21/0.49 sQ7_spl|~sQ12_spl),
% 0.21/0.49 inference(contradiction_clause,[status(thm)],[f665])).
% 0.21/0.49 fof(f667,plain,(
% 0.21/0.49 $false),
% 0.21/0.49 inference(sat_refutation,[status(thm)],[f366,f438,f454,f456,f587,f666])).
% 0.21/0.49 % SZS output end CNFRefutation for theBenchmark.p
% 0.21/0.51 % Elapsed time: 0.087421 seconds
% 0.21/0.51 % CPU time: 0.335519 seconds
% 0.21/0.51 % Total memory used: 111.696 MB
% 0.21/0.51 % Net memory used: 111.150 MB
%------------------------------------------------------------------------------