%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV225+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 : n005.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.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 2 def)
% Number of atoms : 346 ( 282 equ)
% Maximal formula atoms : 79 ( 15 avg)
% Number of connectives : 531 ( 208 ~; 85 |; 226 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 44 ( 9 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) )
=> ( ( n3 = E
& n2 = F
& 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 )
& ~ ( n5 = F
& n0 = E )
& ~ ( n4 = F
& n0 = E )
& ~ ( n3 = F
& n0 = E )
& ~ ( n2 = F
& n0 = E ) )
=> n0 = a_select2(xinit_noise,n1) ) ) ),
file('/export/starexec/sandbox2/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) )
=> ( ( n3 = E
& n2 = F
& 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 )
& ~ ( n5 = F
& n0 = E )
& ~ ( n4 = F
& n0 = E )
& ~ ( n3 = F
& n0 = E )
& ~ ( n2 = F
& n0 = E ) )
=> n0 = a_select2(xinit_noise,n1) ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f244,plain,
( ? [E,F] :
( n0 != a_select2(xinit_noise,n1)
& n3 = E
& n2 = F
& 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 )
& ( n5 != F
| n0 != E )
& ( n4 != F
| n0 != E )
& ( n3 != F
| n0 != E )
& ( n2 != 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,
( n0 != a_select2(xinit_noise,n1)
& n3 = sK23_skl
& n2 = sK24_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 )
& ( n5 != sK24_skl
| n0 != sK23_skl )
& ( n4 != sK24_skl
| n0 != sK23_skl )
& ( n3 != sK24_skl
| n0 != sK23_skl )
& ( n2 != 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(f273,plain,
( n3 != sK24_skl
| n3 != sK23_skl ),
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f282,plain,
n1 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f283,plain,
n1 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f285,plain,
n3 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f245]) ).
fof(f368,definition,
( sQ2_spl
<=> n3 = sK24_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f370,plain,
( sQ2_spl
| n3 != sK24_skl ),
inference(component_clause,[status(thm)],[f368]) ).
fof(f405,definition,
( sQ11_spl
<=> n3 = sK23_skl ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f407,plain,
( sQ11_spl
| n3 != sK23_skl ),
inference(component_clause,[status(thm)],[f405]) ).
fof(f418,plain,
( ~ sQ2_spl
| ~ sQ11_spl ),
inference(split_clause,[status(thm)],[f273,f405,f368]) ).
fof(f430,plain,
sK23_skl = sK24_skl,
inference(forward_demodulation,[status(thm)],[f282,f283]) ).
fof(f431,plain,
n3 = sK24_skl,
inference(forward_demodulation,[status(thm)],[f430,f285]) ).
fof(f434,plain,
( sQ2_spl
| sK24_skl != sK24_skl ),
inference(forward_demodulation,[status(thm)],[f431,f370]) ).
fof(f435,plain,
( sQ2_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f434]) ).
fof(f436,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f435]) ).
fof(f439,plain,
( sQ11_spl
| sK24_skl != sK23_skl ),
inference(forward_demodulation,[status(thm)],[f431,f407]) ).
fof(f440,plain,
( sQ11_spl
| sK24_skl != sK24_skl ),
inference(forward_demodulation,[status(thm)],[f430,f439]) ).
fof(f441,plain,
( sQ11_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f440]) ).
fof(f442,plain,
sQ11_spl,
inference(contradiction_clause,[status(thm)],[f441]) ).
fof(f443,plain,
$false,
inference(sat_refutation,[status(thm)],[f418,f436,f442]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV225+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.44 % Computer : n005.cluster.edu
% 0.16/0.44 % Model : x86_64 x86_64
% 0.16/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44 % Memory : 8046.5625MB
% 0.16/0.44 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Mon Sep 21 08:34:48 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.47 % Drodi V4.1.1
% 0.16/0.49 % Refutation found
% 0.16/0.49 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.16/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.55 % Elapsed time: 0.094019 seconds
% 0.16/0.55 % CPU time: 0.127133 seconds
% 0.16/0.55 % Total memory used: 10.391 MB
% 0.16/0.55 % Net memory used: 10.381 MB
%------------------------------------------------------------------------------