%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV226+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 : n010.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:55 PM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 8 unt; 2 def)
% Number of atoms : 350 ( 288 equ)
% Maximal formula atoms : 81 ( 16 avg)
% Number of connectives : 541 ( 212 ~; 85 |; 232 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 45 ( 10 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 22 ( 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
( ( ! [C,D] :
( ( leq(D,n2)
& leq(C,n2)
& leq(n0,D)
& leq(n0,C) )
=> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C) )
& ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) ) )
=> ! [E,F] :
( ( leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
=> ( ( n2 = F
& n2 = E
& n1 = F
& n1 = E
& ~ ( n5 = F
& n5 = E )
& ~ ( n5 = E
& n4 = F )
& ~ ( n5 = F
& n4 = E )
& ~ ( n4 = F
& n4 = E )
& ~ ( n5 = E
& n3 = F )
& ~ ( n4 = E
& n3 = F )
& ~ ( n5 = F
& n3 = E )
& ~ ( n4 = F
& n3 = E )
& ~ ( n3 = F
& n3 = E )
& ~ ( n5 = E
& n2 = F )
& ~ ( n4 = E
& n2 = F )
& ~ ( n3 = E
& n2 = F )
& ~ ( n5 = F
& n2 = E )
& ~ ( n4 = F
& n2 = E )
& ~ ( n3 = F
& n2 = E )
& ~ ( n2 = F
& n2 = E )
& ~ ( n5 = E
& n1 = F )
& ~ ( n4 = E
& n1 = F )
& ~ ( n3 = E
& n1 = F )
& ~ ( n2 = E
& n1 = F )
& ~ ( n5 = F
& n1 = E )
& ~ ( n4 = F
& n1 = E )
& ~ ( n3 = F
& n1 = E )
& ~ ( n2 = F
& n1 = E )
& ~ ( n5 = E
& n0 = F )
& ~ ( n4 = E
& n0 = F )
& ~ ( n3 = E
& n0 = F )
& ~ ( n2 = E
& n0 = F )
& ~ ( n5 = F
& n0 = E )
& ~ ( n4 = F
& n0 = E )
& ~ ( n3 = F
& n0 = E ) )
=> a_select2(xinit_noise,n1) = a_select2(xinit_noise,n2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ! [C,D] :
( ( leq(D,n2)
& leq(C,n2)
& leq(n0,D)
& leq(n0,C) )
=> a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C) )
& ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) ) )
=> ! [E,F] :
( ( leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
=> ( ( n2 = F
& n2 = E
& n1 = F
& n1 = E
& ~ ( n5 = F
& n5 = E )
& ~ ( n5 = E
& n4 = F )
& ~ ( n5 = F
& n4 = E )
& ~ ( n4 = F
& n4 = E )
& ~ ( n5 = E
& n3 = F )
& ~ ( n4 = E
& n3 = F )
& ~ ( n5 = F
& n3 = E )
& ~ ( n4 = F
& n3 = E )
& ~ ( n3 = F
& n3 = E )
& ~ ( n5 = E
& n2 = F )
& ~ ( n4 = E
& n2 = F )
& ~ ( n3 = E
& n2 = F )
& ~ ( n5 = F
& n2 = E )
& ~ ( n4 = F
& n2 = E )
& ~ ( n3 = F
& n2 = E )
& ~ ( n2 = F
& n2 = E )
& ~ ( n5 = E
& n1 = F )
& ~ ( n4 = E
& n1 = F )
& ~ ( n3 = E
& n1 = F )
& ~ ( n2 = E
& n1 = F )
& ~ ( n5 = F
& n1 = E )
& ~ ( n4 = F
& n1 = E )
& ~ ( n3 = F
& n1 = E )
& ~ ( n2 = F
& n1 = E )
& ~ ( n5 = E
& n0 = F )
& ~ ( n4 = E
& n0 = F )
& ~ ( n3 = E
& n0 = F )
& ~ ( n2 = E
& n0 = F )
& ~ ( n5 = F
& n0 = E )
& ~ ( n4 = F
& n0 = E )
& ~ ( n3 = F
& n0 = E ) )
=> a_select2(xinit_noise,n1) = a_select2(xinit_noise,n2) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f244,plain,
( ? [E,F] :
( a_select2(xinit_noise,n1) != a_select2(xinit_noise,n2)
& n2 = F
& n2 = E
& n1 = F
& n1 = E
& ( n5 != F
| n5 != E )
& ( n5 != E
| n4 != F )
& ( n5 != F
| n4 != E )
& ( n4 != F
| n4 != E )
& ( n5 != E
| n3 != F )
& ( n4 != E
| n3 != F )
& ( n5 != F
| n3 != E )
& ( n4 != F
| n3 != E )
& ( n3 != F
| n3 != E )
& ( n5 != E
| n2 != F )
& ( n4 != E
| n2 != F )
& ( n3 != E
| n2 != F )
& ( n5 != F
| n2 != E )
& ( n4 != F
| n2 != E )
& ( n3 != F
| n2 != E )
& ( n2 != F
| n2 != E )
& ( n5 != E
| n1 != F )
& ( n4 != E
| n1 != F )
& ( n3 != E
| n1 != F )
& ( n2 != E
| n1 != F )
& ( n5 != F
| n1 != E )
& ( n4 != F
| n1 != E )
& ( n3 != F
| n1 != E )
& ( n2 != F
| n1 != E )
& ( n5 != E
| n0 != F )
& ( n4 != E
| n0 != F )
& ( n3 != E
| n0 != F )
& ( n2 != E
| n0 != F )
& ( n5 != F
| n0 != E )
& ( n4 != F
| n0 != E )
& ( n3 != F
| n0 != E )
& leq(F,n5)
& leq(E,n5)
& leq(n0,F)
& leq(n0,E) )
& ! [C,D] :
( a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C)
| ~ leq(D,n2)
| ~ leq(C,n2)
| ~ leq(n0,D)
| ~ leq(n0,C) )
& ! [A,B] :
( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
| ~ leq(B,n5)
| ~ leq(A,n5)
| ~ leq(n0,B)
| ~ leq(n0,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f245,plain,
( a_select2(xinit_noise,n1) != a_select2(xinit_noise,n2)
& n2 = sK24_skl
& n2 = sK23_skl
& n1 = sK24_skl
& n1 = sK23_skl
& ( n5 != sK24_skl
| n5 != sK23_skl )
& ( n5 != sK23_skl
| n4 != sK24_skl )
& ( n5 != sK24_skl
| n4 != sK23_skl )
& ( n4 != sK24_skl
| n4 != sK23_skl )
& ( n5 != sK23_skl
| n3 != sK24_skl )
& ( n4 != sK23_skl
| n3 != sK24_skl )
& ( n5 != sK24_skl
| n3 != sK23_skl )
& ( n4 != sK24_skl
| n3 != sK23_skl )
& ( n3 != sK24_skl
| n3 != sK23_skl )
& ( n5 != sK23_skl
| n2 != sK24_skl )
& ( n4 != sK23_skl
| n2 != sK24_skl )
& ( n3 != sK23_skl
| n2 != sK24_skl )
& ( n5 != sK24_skl
| n2 != sK23_skl )
& ( n4 != sK24_skl
| n2 != sK23_skl )
& ( n3 != sK24_skl
| n2 != sK23_skl )
& ( n2 != sK24_skl
| n2 != sK23_skl )
& ( n5 != sK23_skl
| n1 != sK24_skl )
& ( n4 != sK23_skl
| n1 != sK24_skl )
& ( n3 != sK23_skl
| n1 != sK24_skl )
& ( n2 != sK23_skl
| n1 != sK24_skl )
& ( n5 != sK24_skl
| n1 != sK23_skl )
& ( n4 != sK24_skl
| n1 != sK23_skl )
& ( n3 != sK24_skl
| n1 != sK23_skl )
& ( n2 != sK24_skl
| n1 != sK23_skl )
& ( n5 != sK23_skl
| n0 != sK24_skl )
& ( n4 != sK23_skl
| n0 != sK24_skl )
& ( n3 != sK23_skl
| n0 != sK24_skl )
& ( n2 != sK23_skl
| n0 != sK24_skl )
& ( n5 != sK24_skl
| n0 != sK23_skl )
& ( n4 != sK24_skl
| n0 != sK23_skl )
& ( n3 != sK24_skl
| n0 != sK23_skl )
& leq(sK24_skl,n5)
& leq(sK23_skl,n5)
& leq(n0,sK24_skl)
& leq(n0,sK23_skl)
& ! [C,D] :
( a_select3(r_ds1_filter,C,D) = a_select3(r_ds1_filter,D,C)
| ~ leq(D,n2)
| ~ leq(C,n2)
| ~ leq(n0,D)
| ~ leq(n0,C) )
& ! [A,B] :
( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
| ~ leq(B,n5)
| ~ leq(A,n5)
| ~ leq(n0,B)
| ~ leq(n0,A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(E,sK23_skl),skolemize(F,sK24_skl)],[f244]) ).
fof(f267,plain,
( n2 != sK24_skl
| n2 != sK23_skl ),
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f283,plain,
n1 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f285,plain,
n2 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f286,plain,
n2 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f380,definition,
( sQ5_spl
<=> n2 = sK23_skl ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f382,plain,
( sQ5_spl
| n2 != sK23_skl ),
inference(component_clause,[status(thm)],[f380]) ).
fof(f399,definition,
( sQ10_spl
<=> n2 = sK24_skl ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f401,plain,
( sQ10_spl
| n2 != sK24_skl ),
inference(component_clause,[status(thm)],[f399]) ).
fof(f413,plain,
( ~ sQ10_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f267,f380,f399]) ).
fof(f432,plain,
n2 = sK23_skl,
inference(backward_demodulation,[status(thm)],[f433,f283]) ).
fof(f433,plain,
n2 = n1,
inference(forward_demodulation,[status(thm)],[f283,f285]) ).
fof(f449,plain,
( sQ10_spl
| n2 != n2 ),
inference(forward_demodulation,[status(thm)],[f286,f401]) ).
fof(f450,plain,
( sQ10_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f449]) ).
fof(f451,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f450]) ).
fof(f453,plain,
( sQ5_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f432,f382]) ).
fof(f454,plain,
sQ5_spl,
inference(contradiction_clause,[status(thm)],[f453]) ).
fof(f455,plain,
$false,
inference(sat_refutation,[status(thm)],[f413,f451,f454]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV226+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 08:35:11 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.39 % Drodi V4.1.1
% 0.09/0.40 % Refutation found
% 0.09/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.45 % Elapsed time: 0.069152 seconds
% 0.09/0.45 % CPU time: 0.196501 seconds
% 0.09/0.45 % Total memory used: 79.305 MB
% 0.09/0.45 % Net memory used: 79.184 MB
%------------------------------------------------------------------------------