%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC112+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n017.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:40:01 PM UTC 2026
% Result : Theorem 0.07s 0.39s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 6
% Syntax : Number of formulae : 70 ( 17 unt; 1 def)
% Number of atoms : 377 ( 112 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 491 ( 184 ~; 179 |; 104 &)
% ( 7 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 132 ( 92 !; 40 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f58,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ( segmentP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = W
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = Z
& ssList(X6) )
& ssItem(X5) )
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( lt(X1,X3)
& app(cons(X3,nil),X4) = W
& ssList(X4) )
& ssItem(X3) )
& app(X2,cons(X1,nil)) = Y
& ssList(X2) )
& ssItem(X1) )
| ~ strictorderedP(W)
| app(app(Y,W),Z) != X ) ) )
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ( segmentP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ! [Z] :
( ssList(Z)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = W
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = Z
& ssList(X6) )
& ssItem(X5) )
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( lt(X1,X3)
& app(cons(X3,nil),X4) = W
& ssList(X4) )
& ssItem(X3) )
& app(X2,cons(X1,nil)) = Y
& ssList(X2) )
& ssItem(X1) )
| ~ strictorderedP(W)
| app(app(Y,W),Z) != X ) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f131,plain,
! [U] :
( ! [V] :
( ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f132,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( ! [X] :
( app(app(W,V),X) != U
| ~ ssList(X) )
| ~ ssList(W) )
| segmentP(U,V) )
& ( ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) )
| ~ segmentP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f131]) ).
fof(f133,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( ! [X] :
( app(app(W,V),X) != U
| ~ ssList(X) )
| ~ ssList(W) )
| segmentP(U,V) )
& ( ( app(app(sK7_skl(V,U),V),sK8_skl(V,U)) = U
& ssList(sK8_skl(V,U))
& ssList(sK7_skl(V,U)) )
| ~ segmentP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl,sK8_skl]),skolemize(W,sK7_skl(V,U)),skolemize(X,sK8_skl(V,U))],[f132]) ).
fof(f137,plain,
! [X0,X1,X2,X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f133]) ).
fof(f217,plain,
! [U] :
( ! [V] :
( ( neq(U,V)
<=> U != V )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f15]) ).
fof(f218,plain,
! [U] :
( ! [V] :
( ( ( U = V
| neq(U,V) )
& ( U != V
| ~ neq(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f217]) ).
fof(f219,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f218]) ).
fof(f220,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f218]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f324,plain,
! [U] :
( ( segmentP(nil,U)
<=> nil = U )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f58]) ).
fof(f325,plain,
! [U] :
( ( ( nil != U
| segmentP(nil,U) )
& ( nil = U
| ~ segmentP(nil,U) ) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f324]) ).
fof(f326,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f325]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ segmentP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& ( nil != W
| nil = X )
& ? [Y] :
( ? [Z] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != W
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != Z
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ~ lt(X1,X3)
| app(cons(X3,nil),X4) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| app(X2,cons(X1,nil)) != Y
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(W)
& app(app(Y,W),Z) = X
& ssList(Z) )
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,definition,
! [U,V] :
( sP0_prd(V,U)
<=> ( nil != U
& nil = V ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ segmentP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| sP0_prd(V,U) )
& ( nil != W
| nil = X )
& ? [Y] :
( ? [Z] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != W
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != Z
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ~ lt(X1,X3)
| app(cons(X3,nil),X4) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| app(X2,cons(X1,nil)) != Y
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(W)
& app(app(Y,W),Z) = X
& ssList(Z) )
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ segmentP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| sP0_prd(V,U) )
& ( nil != W
| nil = X )
& ? [Y] :
( ? [Z] :
( ! [X5] :
( ! [X7] :
( ~ lt(X7,X5)
| ! [X8] :
( app(X8,cons(X7,nil)) != W
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ! [X6] :
( app(cons(X5,nil),X6) != Z
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ! [X1] :
( ! [X3] :
( ~ lt(X1,X3)
| ! [X4] :
( app(cons(X3,nil),X4) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| ! [X2] :
( app(X2,cons(X1,nil)) != Y
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(W)
& app(app(Y,W),Z) = X
& ssList(Z) )
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(miniscoping,[status(thm)],[f417]) ).
fof(f419,plain,
( ( ( ( ~ segmentP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) )
& neq(sK48_skl,nil) )
| sP0_prd(sK48_skl,sK47_skl) )
& ( nil != sK49_skl
| nil = sK50_skl )
& ! [X5] :
( ! [X7] :
( ~ lt(X7,X5)
| ! [X8] :
( app(X8,cons(X7,nil)) != sK49_skl
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ! [X6] :
( app(cons(X5,nil),X6) != sK52_skl
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ! [X1] :
( ! [X3] :
( ~ lt(X1,X3)
| ! [X4] :
( app(cons(X3,nil),X4) != sK49_skl
| ~ ssList(X4) )
| ~ ssItem(X3) )
| ! [X2] :
( app(X2,cons(X1,nil)) != sK51_skl
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(sK49_skl)
& app(app(sK51_skl,sK49_skl),sK52_skl) = sK50_skl
& ssList(sK52_skl)
& ssList(sK51_skl)
& sK47_skl = sK49_skl
& sK48_skl = sK50_skl
& ssList(sK50_skl)
& ssList(sK49_skl)
& ssList(sK48_skl)
& ssList(sK47_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK47_skl,sK48_skl,sK49_skl,sK50_skl,sK51_skl,sK52_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Y,sK51_skl),skolemize(Z,sK52_skl)],[f418]) ).
fof(f421,plain,
ssList(sK48_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f422,plain,
ssList(sK49_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f424,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f425,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f426,plain,
ssList(sK51_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f427,plain,
ssList(sK52_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f428,plain,
app(app(sK51_skl,sK49_skl),sK52_skl) = sK50_skl,
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f432,plain,
( nil != sK49_skl
| nil = sK50_skl ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f433,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f434,plain,
( ~ segmentP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f435,plain,
! [U,V] :
( ( nil = U
| nil != V
| sP0_prd(V,U) )
& ( ( nil != U
& nil = V )
| ~ sP0_prd(V,U) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f436,plain,
( ! [U,V] :
( nil = U
| nil != V
| sP0_prd(V,U) )
& ! [U,V] :
( ( nil != U
& nil = V )
| ~ sP0_prd(V,U) ) ),
inference(miniscoping,[status(thm)],[f435]) ).
fof(f437,plain,
! [X0,X1] :
( nil = X0
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f436]) ).
fof(f438,plain,
! [X0,X1] :
( nil != X1
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f436]) ).
fof(f446,plain,
! [X0,X1,X2] :
( ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f137]) ).
fof(f455,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(thm)],[f219]) ).
fof(f456,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f455]) ).
fof(f470,plain,
! [X0] : ~ sP0_prd(X0,nil),
inference(destructive_equality_resolution,[status(thm)],[f438]) ).
fof(f475,plain,
app(app(sK51_skl,sK49_skl),sK52_skl) = sK48_skl,
inference(forward_demodulation,[status(thm)],[f424,f428]) ).
fof(f477,plain,
( nil != sK49_skl
| nil = sK48_skl ),
inference(forward_demodulation,[status(thm)],[f424,f432]) ).
fof(f478,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| segmentP(sK48_skl,sK49_skl)
| ~ ssList(sK49_skl)
| ~ ssList(app(app(sK51_skl,sK49_skl),sK52_skl)) ),
inference(paramodulation,[status(thm)],[f475,f446]) ).
fof(f480,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| segmentP(sK48_skl,sK49_skl)
| ~ ssList(sK49_skl)
| ~ ssList(sK48_skl) ),
inference(forward_demodulation,[status(thm)],[f475,f478]) ).
fof(f481,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| segmentP(sK48_skl,sK49_skl)
| ~ ssList(sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f480,f421]) ).
fof(f486,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f433]) ).
fof(f488,plain,
( ~ segmentP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| sP0_prd(sK48_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f434]) ).
fof(f489,plain,
( ~ segmentP(sK48_skl,sK47_skl)
| ~ neq(sK49_skl,nil)
| sP0_prd(sK48_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f488]) ).
fof(f490,plain,
( ~ segmentP(sK48_skl,sK49_skl)
| ~ neq(sK49_skl,nil)
| sP0_prd(sK48_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f489]) ).
fof(f491,plain,
( nil = sK48_skl
| ~ segmentP(sK48_skl,sK49_skl)
| ~ neq(sK49_skl,nil) ),
inference(resolution,[status(thm)],[f490,f437]) ).
fof(f498,plain,
( sK49_skl = nil
| ~ ssList(nil)
| ~ ssList(sK49_skl)
| nil = sK48_skl
| ~ segmentP(sK48_skl,sK49_skl) ),
inference(resolution,[status(thm)],[f491,f220]) ).
fof(f500,plain,
( sK49_skl = nil
| ~ ssList(nil)
| nil = sK48_skl
| ~ segmentP(sK48_skl,sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f498,f422]) ).
fof(f502,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| segmentP(sK48_skl,sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f481,f422]) ).
fof(f503,plain,
( sK49_skl = nil
| nil = sK48_skl
| ~ segmentP(sK48_skl,sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f500,f223]) ).
fof(f504,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| sK49_skl = nil
| nil = sK48_skl ),
inference(resolution,[status(thm)],[f503,f502]) ).
fof(f505,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| nil = sK48_skl ),
inference(forward_subsumption_resolution,[status(thm)],[f504,f477]) ).
fof(f511,plain,
( ~ ssList(sK52_skl)
| nil = sK48_skl ),
inference(forward_subsumption_resolution,[status(thm)],[f505,f426]) ).
fof(f512,plain,
nil = sK48_skl,
inference(resolution,[status(thm)],[f511,f427]) ).
fof(f515,plain,
( ~ ssList(sK52_skl)
| ~ ssList(sK51_skl)
| segmentP(nil,sK49_skl) ),
inference(backward_demodulation,[status(thm)],[f512,f502]) ).
fof(f519,plain,
( neq(nil,nil)
| sP0_prd(sK48_skl,sK49_skl) ),
inference(backward_demodulation,[status(thm)],[f512,f486]) ).
fof(f524,plain,
( ~ ssList(sK52_skl)
| segmentP(nil,sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f515,f426]) ).
fof(f526,plain,
( neq(nil,nil)
| sP0_prd(nil,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f512,f519]) ).
fof(f537,plain,
segmentP(nil,sK49_skl),
inference(forward_subsumption_resolution,[status(thm)],[f524,f427]) ).
fof(f538,plain,
( nil = sK49_skl
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f537,f326]) ).
fof(f539,plain,
nil = sK49_skl,
inference(forward_subsumption_resolution,[status(thm)],[f538,f422]) ).
fof(f548,plain,
( neq(nil,nil)
| sP0_prd(nil,nil) ),
inference(forward_demodulation,[status(thm)],[f539,f526]) ).
fof(f549,plain,
neq(nil,nil),
inference(forward_subsumption_resolution,[status(thm)],[f548,f470]) ).
fof(f550,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[f549,f456]) ).
fof(f552,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f550,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC112+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n017.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 07:51:43 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.37 % Drodi V4.1.1
% 0.07/0.39 % Refutation found
% 0.07/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.069839 seconds
% 0.13/0.42 % CPU time: 0.172863 seconds
% 0.13/0.42 % Total memory used: 111.059 MB
% 0.13/0.42 % Net memory used: 110.901 MB
%------------------------------------------------------------------------------