%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV219+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 : n011.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:54 PM UTC 2026
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 138 ( 121 equ)
% Maximal formula atoms : 32 ( 12 avg)
% Number of connectives : 209 ( 82 ~; 27 |; 96 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 6 ( 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f53,conjecture,
! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n4 = B
& n4 = A
& n3 = A
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n4 = B
& n4 = A
& n3 = A
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A ) )
=> times(divide(n1,n400),a_select2(sigma,n4)) = n0 ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
? [A,B] :
( times(divide(n1,n400),a_select2(sigma,n4)) != n0
& n4 = B
& n4 = A
& n3 = A
& ( n5 != B
| n5 != A )
& ( n5 != A
| n4 != B )
& ( n5 != B
| n4 != A )
& ( n4 != B
| n4 != A )
& ( n5 != A
| n3 != B )
& ( n5 != B
| n3 != A )
& ( n5 != A
| n2 != B )
& ( n5 != B
| n2 != A )
& ( n5 != A
| n1 != B )
& ( n5 != B
| n1 != A )
& ( n5 != A
| n0 != B )
& ( n5 != B
| n0 != A )
& leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) ),
inference(pre_NNF_transformation,[status(thm)],[f54]) ).
fof(f252,plain,
( times(divide(n1,n400),a_select2(sigma,n4)) != n0
& n4 = sK24_skl
& n4 = sK23_skl
& n3 = 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 )
& ( n5 != sK24_skl
| n3 != sK23_skl )
& ( n5 != sK23_skl
| n2 != sK24_skl )
& ( n5 != sK24_skl
| n2 != sK23_skl )
& ( n5 != sK23_skl
| n1 != sK24_skl )
& ( n5 != sK24_skl
| n1 != sK23_skl )
& ( n5 != sK23_skl
| n0 != sK24_skl )
& ( n5 != sK24_skl
| n0 != sK23_skl )
& leq(sK24_skl,n5)
& leq(sK23_skl,n5)
& leq(n0,sK24_skl)
& leq(n0,sK23_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(A,sK23_skl),skolemize(B,sK24_skl)],[f251]) ).
fof(f265,plain,
( n4 != sK24_skl
| n4 != sK23_skl ),
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f270,plain,
n4 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f271,plain,
n4 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f417,plain,
( n4 != sK24_skl
| n4 != n4 ),
inference(forward_demodulation,[status(thm)],[f270,f265]) ).
fof(f418,plain,
( n4 != n4
| n4 != n4 ),
inference(forward_demodulation,[status(thm)],[f271,f417]) ).
fof(f419,plain,
n4 != n4,
inference(duplicate_literals_removal,[status(thm)],[f418]) ).
fof(f420,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f419]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV219+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 % Computer : n011.cluster.edu
% 0.11/0.35 % Model : x86_64 x86_64
% 0.11/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35 % Memory : 8046.5625MB
% 0.11/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 08:34:55 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.37 % Drodi V4.1.1
% 0.14/0.40 % Refutation found
% 0.14/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.44 % Elapsed time: 0.064400 seconds
% 0.14/0.44 % CPU time: 0.166095 seconds
% 0.14/0.44 % Total memory used: 109.198 MB
% 0.14/0.44 % Net memory used: 109.039 MB
%------------------------------------------------------------------------------