%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV216+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 : n020.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.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 24 ( 9 unt; 2 def)
% Number of atoms : 251 ( 219 equ)
% Maximal formula atoms : 55 ( 10 avg)
% Number of connectives : 377 ( 150 ~; 55 |; 166 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 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 = A
& n2 = B
& n2 = A
& n1 = B
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n4 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n4 = B
& n3 = A )
& ~ ( n3 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n4 = A
& n2 = B )
& ~ ( n3 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n4 = B
& n2 = A )
& ~ ( n3 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n4 = A
& n2 = B
& n2 = A
& n1 = B
& ~ ( n5 = B
& n5 = A )
& ~ ( n5 = A
& n4 = B )
& ~ ( n5 = B
& n4 = A )
& ~ ( n4 = B
& n4 = A )
& ~ ( n5 = A
& n3 = B )
& ~ ( n4 = A
& n3 = B )
& ~ ( n5 = B
& n3 = A )
& ~ ( n4 = B
& n3 = A )
& ~ ( n3 = B
& n3 = A )
& ~ ( n5 = A
& n2 = B )
& ~ ( n4 = A
& n2 = B )
& ~ ( n3 = A
& n2 = B )
& ~ ( n5 = B
& n2 = A )
& ~ ( n4 = B
& n2 = A )
& ~ ( n3 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f251,plain,
? [A,B] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& n4 = A
& n2 = B
& n2 = A
& n1 = B
& ( n5 != B
| n5 != A )
& ( n5 != A
| n4 != B )
& ( n5 != B
| n4 != A )
& ( n4 != B
| n4 != A )
& ( n5 != A
| n3 != B )
& ( n4 != A
| n3 != B )
& ( n5 != B
| n3 != A )
& ( n4 != B
| n3 != A )
& ( n3 != B
| n3 != A )
& ( n5 != A
| n2 != B )
& ( n4 != A
| n2 != B )
& ( n3 != A
| n2 != B )
& ( n5 != B
| n2 != A )
& ( n4 != B
| n2 != A )
& ( n3 != B
| n2 != A )
& ( n5 != A
| n1 != B )
& ( n5 != B
| n1 != A )
& ( n4 != B
| n1 != A )
& ( n3 != B
| n1 != A )
& ( n5 != A
| n0 != B )
& ( n5 != B
| n0 != A )
& ( n4 != B
| n0 != A )
& ( n3 != 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,
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& n4 = sK23_skl
& n2 = sK24_skl
& n2 = sK23_skl
& n1 = sK24_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 )
& ( n5 != sK23_skl
| n1 != sK24_skl )
& ( n5 != sK24_skl
| n1 != sK23_skl )
& ( n4 != sK24_skl
| n1 != sK23_skl )
& ( n3 != sK24_skl
| n1 != sK23_skl )
& ( n5 != 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) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(A,sK23_skl),skolemize(B,sK24_skl)],[f251]) ).
fof(f262,plain,
( n4 != sK24_skl
| n1 != sK23_skl ),
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f280,plain,
n1 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f281,plain,
n2 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f282,plain,
n2 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f283,plain,
n4 = sK23_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f373,definition,
( sQ2_spl
<=> n4 = sK24_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f375,plain,
( sQ2_spl
| n4 != sK24_skl ),
inference(component_clause,[status(thm)],[f373]) ).
fof(f388,definition,
( sQ6_spl
<=> n1 = sK23_skl ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f390,plain,
( sQ6_spl
| n1 != sK23_skl ),
inference(component_clause,[status(thm)],[f388]) ).
fof(f392,plain,
( ~ sQ2_spl
| ~ sQ6_spl ),
inference(split_clause,[status(thm)],[f262,f388,f373]) ).
fof(f428,plain,
sK23_skl = sK24_skl,
inference(forward_demodulation,[status(thm)],[f281,f282]) ).
fof(f429,plain,
n4 = sK24_skl,
inference(forward_demodulation,[status(thm)],[f428,f283]) ).
fof(f432,plain,
( sQ2_spl
| sK24_skl != sK24_skl ),
inference(forward_demodulation,[status(thm)],[f429,f375]) ).
fof(f433,plain,
( sQ2_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f432]) ).
fof(f434,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f433]) ).
fof(f436,plain,
( sQ6_spl
| sK24_skl != sK23_skl ),
inference(forward_demodulation,[status(thm)],[f280,f390]) ).
fof(f437,plain,
( sQ6_spl
| sK24_skl != sK24_skl ),
inference(forward_demodulation,[status(thm)],[f428,f436]) ).
fof(f438,plain,
( sQ6_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f437]) ).
fof(f439,plain,
sQ6_spl,
inference(contradiction_clause,[status(thm)],[f438]) ).
fof(f440,plain,
$false,
inference(sat_refutation,[status(thm)],[f392,f434,f439]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV216+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 08:35:17 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.13/0.38 % Drodi V4.1.1
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.056627 seconds
% 0.13/0.42 % CPU time: 0.162437 seconds
% 0.13/0.42 % Total memory used: 103.207 MB
% 0.13/0.42 % Net memory used: 103.043 MB
%------------------------------------------------------------------------------