%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC004+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 : n003.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:39:32 PM UTC 2026
% Result : Theorem 1.32s 0.76s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 54 ( 8 unt; 1 def)
% Number of atoms : 305 ( 71 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 412 ( 161 ~; 146 |; 82 &)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 228 ( 196 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ssList(cons(V,U)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> cons(V,U) != U ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( neq(Z,nil)
& app(Y,X1) = U
& app(app(Y,Z),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| ~ neq(V,nil) ) )
| 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)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( neq(Z,nil)
& app(Y,X1) = U
& app(app(Y,Z),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f220,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f218]) ).
fof(f221,plain,
! [U] :
( ! [V] :
( ssList(cons(V,U))
| ~ ssItem(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f16]) ).
fof(f222,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f221]) ).
fof(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f224,plain,
! [U] :
( ! [V] :
( cons(V,U) != U
| ~ ssItem(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f18]) ).
fof(f225,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f224]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( ~ neq(Z,nil)
| app(Y,X1) != U
| app(app(Y,Z),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& neq(V,nil) ) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,definition,
! [U,V,W,X] :
( sP0_prd(X,W,V,U)
<=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( ~ neq(Z,nil)
| app(Y,X1) != U
| app(app(Y,Z),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& neq(V,nil) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| sP0_prd(X,W,V,U) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ( ( ~ neq(sK50_skl,nil)
& neq(sK48_skl,nil) )
| sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f417]) ).
fof(f423,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f424,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f425,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
( ~ neq(sK50_skl,nil)
| sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
! [U,V,W,X] :
( ( ! [X2] :
( ! [X3] :
( ! [X4] :
( app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( neq(Z,nil)
& app(Y,X1) = U
& app(app(Y,Z),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ( ( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( ~ neq(Z,nil)
| app(Y,X1) != U
| app(app(Y,Z),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& neq(V,nil) )
| ~ sP0_prd(X,W,V,U) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f428,plain,
( ! [U,V,W,X] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ? [Y] :
( ? [Z] :
( neq(Z,nil)
& ? [X1] :
( app(Y,X1) = U
& app(app(Y,Z),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ! [U,V,W,X] :
( ( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ~ neq(Z,nil)
| ! [X1] :
( app(Y,X1) != U
| app(app(Y,Z),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& neq(V,nil) )
| ~ sP0_prd(X,W,V,U) ) ),
inference(miniscoping,[status(thm)],[f427]) ).
fof(f429,plain,
( ! [U,V,W,X] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ( neq(sK55_skl(X,W,V,U),nil)
& app(sK54_skl(X,W,V,U),sK56_skl(X,W,V,U)) = U
& app(app(sK54_skl(X,W,V,U),sK55_skl(X,W,V,U)),sK56_skl(X,W,V,U)) = V
& ssList(sK56_skl(X,W,V,U))
& ssList(sK55_skl(X,W,V,U))
& ssList(sK54_skl(X,W,V,U)) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ! [U,V,W,X] :
( ( app(sK52_skl(X,W,V,U),sK53_skl(X,W,V,U)) = W
& app(app(sK52_skl(X,W,V,U),cons(sK51_skl(X,W,V,U),nil)),sK53_skl(X,W,V,U)) = X
& ssList(sK53_skl(X,W,V,U))
& ssList(sK52_skl(X,W,V,U))
& ssItem(sK51_skl(X,W,V,U))
& ! [Y] :
( ! [Z] :
( ~ neq(Z,nil)
| ! [X1] :
( app(Y,X1) != U
| app(app(Y,Z),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& neq(V,nil) )
| ~ sP0_prd(X,W,V,U) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK51_skl,sK52_skl,sK53_skl,sK54_skl,sK55_skl,sK56_skl]),skolemize(X2,sK51_skl(X,W,V,U)),skolemize(X3,sK52_skl(X,W,V,U)),skolemize(X4,sK53_skl(X,W,V,U)),skolemize(Y,sK54_skl(X,W,V,U)),skolemize(Z,sK55_skl(X,W,V,U)),skolemize(X1,sK56_skl(X,W,V,U))],[f428]) ).
fof(f430,plain,
! [X0,X1,X2,X3] :
( neq(X2,nil)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f431,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X3
| app(app(X4,X5),X6) != X2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f432,plain,
! [X0,X1,X2,X3] :
( ssItem(sK51_skl(X0,X1,X2,X3))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f433,plain,
! [X0,X1,X2,X3] :
( ssList(sK52_skl(X0,X1,X2,X3))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f434,plain,
! [X0,X1,X2,X3] :
( ssList(sK53_skl(X0,X1,X2,X3))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f435,plain,
! [X0,X1,X2,X3] :
( app(app(sK52_skl(X0,X1,X2,X3),cons(sK51_skl(X0,X1,X2,X3),nil)),sK53_skl(X0,X1,X2,X3)) = X0
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f436,plain,
! [X0,X1,X2,X3] :
( app(sK52_skl(X0,X1,X2,X3),sK53_skl(X0,X1,X2,X3)) = X1
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(cnf_transformation,[status(thm)],[f429]) ).
fof(f457,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f458,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f457]) ).
fof(f459,plain,
neq(sK48_skl,nil),
inference(backward_subsumption_resolution,[status(thm)],[f458,f430]) ).
fof(f475,plain,
( ~ neq(sK50_skl,nil)
| sP0_prd(sK48_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f426]) ).
fof(f476,plain,
( ~ neq(sK50_skl,nil)
| sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f475]) ).
fof(f477,plain,
( ~ neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f476]) ).
fof(f478,plain,
sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl),
inference(forward_subsumption_resolution,[status(thm)],[f477,f459]) ).
fof(f480,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| ~ neq(cons(sK51_skl(X2,X4,X5,X6),nil),nil)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(sK53_skl(X2,X4,X5,X6))
| ~ ssList(cons(sK51_skl(X2,X4,X5,X6),nil))
| ~ ssList(sK52_skl(X2,X4,X5,X6))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f431,f435]) ).
fof(f487,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| ~ neq(cons(sK51_skl(X2,X4,X5,X6),nil),nil)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(sK53_skl(X2,X4,X5,X6))
| ~ ssList(cons(sK51_skl(X2,X4,X5,X6),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f480,f433]) ).
fof(f765,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| ~ neq(cons(sK51_skl(X2,X4,X5,X6),nil),nil)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(cons(sK51_skl(X2,X4,X5,X6),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f487,f434]) ).
fof(f766,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X2,X3,X4,X5)
| ~ neq(cons(sK51_skl(X2,X3,X4,X5),nil),nil)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f765,f436]) ).
fof(f781,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ neq(cons(sK51_skl(X2,X3,X4,X5),nil),nil)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(duplicate_literals_removal,[status(thm)],[f766]) ).
fof(f895,plain,
! [X0,X1,X2,X3,X4,X5] :
( cons(sK51_skl(X2,X3,X4,X5),nil) = nil
| ~ ssList(nil)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X2,X3,X4,X5)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f781,f220]) ).
fof(f897,plain,
! [X0,X1,X2,X3,X4,X5] :
( cons(sK51_skl(X2,X3,X4,X5),nil) = nil
| ~ ssList(nil)
| ~ sP0_prd(X2,X3,X4,X5)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(duplicate_literals_removal,[status(thm)],[f895]) ).
fof(f898,plain,
! [X0,X1,X2,X3,X4,X5] :
( cons(sK51_skl(X2,X3,X4,X5),nil) = nil
| ~ sP0_prd(X2,X3,X4,X5)
| ~ ssList(cons(sK51_skl(X2,X3,X4,X5),nil))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f897,f223]) ).
fof(f899,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ ssItem(sK51_skl(X2,X3,X4,X5))
| ~ ssList(nil)
| cons(sK51_skl(X2,X3,X4,X5),nil) = nil
| ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f898,f222]) ).
fof(f900,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ ssItem(sK51_skl(X2,X3,X4,X5))
| ~ ssList(nil)
| ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f899,f225]) ).
fof(f901,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ ssItem(sK51_skl(X2,X3,X4,X5))
| ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f900,f223]) ).
fof(f902,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f901,f432]) ).
fof(f903,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(duplicate_literals_removal,[status(thm)],[f902]) ).
fof(f904,plain,
! [X0,X1] : ~ sP0_prd(X0,X1,sK48_skl,sK47_skl),
inference(resolution,[status(thm)],[f903,f478]) ).
fof(f906,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f478,f904]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC004+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 07:50:00 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 1.32/0.76 % Refutation found
% 1.32/0.76 % SZS status Theorem for theBenchmark: Theorem is valid
% 1.32/0.76 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/0.79 % Elapsed time: 0.418633 seconds
% 0.23/0.79 % CPU time: 3.049377 seconds
% 0.23/0.79 % Total memory used: 149.821 MB
% 0.23/0.79 % Net memory used: 146.259 MB
%------------------------------------------------------------------------------