%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWV214+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 : 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:46:54 PM UTC 2026
% Result : Theorem 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 293 ( 271 equ)
% Maximal formula atoms : 71 ( 22 avg)
% Number of connectives : 471 ( 191 ~; 62 |; 214 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 14 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 8 ( 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
! [A,B] :
( ( leq(B,n5)
& leq(A,n5)
& leq(n0,B)
& leq(n0,A) )
=> ( ( n5 = B
& n2 = A
& n1 = B
& n1 = A
& ~ ( 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 )
& ~ ( n2 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n4 = A
& n1 = B )
& ~ ( n3 = A
& n1 = B )
& ~ ( n2 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n2 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n4 = A
& n0 = B )
& ~ ( n3 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A )
& ~ ( n2 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n1)) ) ),
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) )
=> ( ( n5 = B
& n2 = A
& n1 = B
& n1 = A
& ~ ( 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 )
& ~ ( n2 = B
& n2 = A )
& ~ ( n5 = A
& n1 = B )
& ~ ( n4 = A
& n1 = B )
& ~ ( n3 = A
& n1 = B )
& ~ ( n2 = A
& n1 = B )
& ~ ( n5 = B
& n1 = A )
& ~ ( n4 = B
& n1 = A )
& ~ ( n3 = B
& n1 = A )
& ~ ( n2 = B
& n1 = A )
& ~ ( n5 = A
& n0 = B )
& ~ ( n4 = A
& n0 = B )
& ~ ( n3 = A
& n0 = B )
& ~ ( n5 = B
& n0 = A )
& ~ ( n4 = B
& n0 = A )
& ~ ( n3 = B
& n0 = A )
& ~ ( n2 = B
& n0 = A ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f72,axiom,
gt(n5,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f98,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f251,plain,
? [A,B] :
( n0 != times(divide(n1,n400),a_select2(sigma,n1))
& n5 = B
& n2 = A
& n1 = B
& n1 = A
& ( 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 )
& ( n2 != B
| n2 != A )
& ( n5 != A
| n1 != B )
& ( n4 != A
| n1 != B )
& ( n3 != A
| n1 != B )
& ( n2 != A
| n1 != B )
& ( n5 != B
| n1 != A )
& ( n4 != B
| n1 != A )
& ( n3 != B
| n1 != A )
& ( n2 != B
| n1 != A )
& ( n5 != A
| n0 != B )
& ( n4 != A
| n0 != B )
& ( n3 != A
| n0 != B )
& ( n5 != B
| n0 != A )
& ( n4 != B
| n0 != A )
& ( n3 != B
| n0 != A )
& ( n2 != 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,n1))
& n5 = 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 )
& ( 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) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(A,sK23_skl),skolemize(B,sK24_skl)],[f251]) ).
fof(f289,plain,
n1 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f291,plain,
n5 = sK24_skl,
inference(cnf_transformation,[status(thm)],[f252]) ).
fof(f310,plain,
gt(n5,n1),
inference(cnf_transformation,[status(thm)],[f72]) ).
fof(f378,plain,
n5 = n1,
inference(forward_demodulation,[status(thm)],[f289,f291]) ).
fof(f438,plain,
gt(n1,n1),
inference(forward_demodulation,[status(thm)],[f378,f310]) ).
fof(f439,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f438,f98]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV214+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:35:09 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.14/0.39 % Refutation found
% 0.14/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.42 % Elapsed time: 0.051101 seconds
% 0.14/0.42 % CPU time: 0.122275 seconds
% 0.14/0.42 % Total memory used: 55.224 MB
% 0.14/0.42 % Net memory used: 55.140 MB
%------------------------------------------------------------------------------