%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC010+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 : n013.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:34 PM UTC 2026
% Result : Theorem 13.11s 7.33s
% Output : CNFRefutation 13.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 4 unt; 4 def)
% Number of atoms : 278 ( 69 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 367 ( 131 ~; 122 |; 96 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 9 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-7 aty)
% Number of variables : 171 ( 135 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
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)
=> ( ? [X5] :
( geq(X5,X2)
& memberP(X,X5)
& X2 != X5
& ssItem(X5) )
| app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Z,X1) = U
& app(app(Z,cons(Y,nil)),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssItem(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)
=> ( ? [X5] :
( geq(X5,X2)
& memberP(X,X5)
& X2 != X5
& ssItem(X5) )
| app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X ) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Z,X1) = U
& app(app(Z,cons(Y,nil)),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) )
| ~ neq(V,nil) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ geq(X5,X2)
| ~ memberP(X,X5)
| X2 = X5
| ~ ssItem(X5) )
& app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Z,X1) != U
| app(app(Z,cons(Y,nil)),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(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] :
( ! [X5] :
( ~ geq(X5,X2)
| ~ memberP(X,X5)
| X2 = X5
| ~ ssItem(X5) )
& app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Z,X1) != U
| app(app(Z,cons(Y,nil)),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(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] :
( ? [X5] :
( geq(X5,X2)
& memberP(X,X5)
& X2 != X5
& ssItem(X5) )
| app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Z,X1) = U
& app(app(Z,cons(Y,nil)),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ( ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ geq(X5,X2)
| ~ memberP(X,X5)
| X2 = X5
| ~ ssItem(X5) )
& app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Z,X1) != U
| app(app(Z,cons(Y,nil)),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(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] :
( ? [X5] :
( geq(X5,X2)
& memberP(X,X5)
& X2 != X5
& ssItem(X5) )
| app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Z,X1) = U
& app(app(Z,cons(Y,nil)),X1) = V
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ! [U,V,W,X] :
( ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ geq(X5,X2)
| ~ memberP(X,X5)
| X2 = X5
| ~ ssItem(X5) )
& app(X3,X4) = W
& app(app(X3,cons(X2,nil)),X4) = X
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Z,X1) != U
| app(app(Z,cons(Y,nil)),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(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] :
( ( geq(sK57_skl(X4,X3,X2,X,W,V,U),X2)
& memberP(X,sK57_skl(X4,X3,X2,X,W,V,U))
& X2 != sK57_skl(X4,X3,X2,X,W,V,U)
& ssItem(sK57_skl(X4,X3,X2,X,W,V,U)) )
| app(X3,X4) != W
| app(app(X3,cons(X2,nil)),X4) != X
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ( app(sK55_skl(X,W,V,U),sK56_skl(X,W,V,U)) = U
& app(app(sK55_skl(X,W,V,U),cons(sK54_skl(X,W,V,U),nil)),sK56_skl(X,W,V,U)) = V
& ssList(sK56_skl(X,W,V,U))
& ssList(sK55_skl(X,W,V,U))
& ssItem(sK54_skl(X,W,V,U)) )
| ~ neq(V,nil)
| sP0_prd(X,W,V,U) )
& ! [U,V,W,X] :
( ( ! [X5] :
( ~ geq(X5,sK51_skl(X,W,V,U))
| ~ memberP(X,X5)
| sK51_skl(X,W,V,U) = X5
| ~ ssItem(X5) )
& 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] :
( ! [X1] :
( app(Z,X1) != U
| app(app(Z,cons(Y,nil)),X1) != V
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(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,sK57_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)),skolemize(X5,sK57_skl(X4,X3,X2,X,W,V,U))],[f428]) ).
fof(f431,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( app(X5,X6) != X3
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(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(f458,definition,
( sQ0_spl
<=> sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f459,plain,
( ~ sQ0_spl
| sP0_prd(sK50_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(component_clause,[status(thm)],[f458]) ).
fof(f461,definition,
( sQ1_spl
<=> neq(sK48_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f462,plain,
( ~ sQ1_spl
| neq(sK48_skl,nil) ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f425,f458,f461]) ).
fof(f465,definition,
( sQ2_spl
<=> neq(sK50_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f467,plain,
( sQ2_spl
| ~ neq(sK50_skl,nil) ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f468,plain,
( ~ sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f426,f458,f465]) ).
fof(f495,plain,
( ~ sQ0_spl
| sP0_prd(sK48_skl,sK49_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f459]) ).
fof(f496,plain,
( ~ sQ0_spl
| sP0_prd(sK48_skl,sK47_skl,sK48_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f495]) ).
fof(f698,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(sK53_skl(X2,X4,X5,X6))
| ~ ssList(sK52_skl(X2,X4,X5,X6))
| ~ ssItem(sK51_skl(X2,X4,X5,X6))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f431,f435]) ).
fof(f709,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(sK53_skl(X2,X4,X5,X6))
| ~ ssList(sK52_skl(X2,X4,X5,X6))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f698,f432]) ).
fof(f896,plain,
( sQ2_spl
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f423,f467]) ).
fof(f4423,plain,
! [X0,X1,X2,X3,X4,X5,X6] :
( ~ sP0_prd(X2,X4,X5,X6)
| app(sK52_skl(X2,X4,X5,X6),sK53_skl(X2,X4,X5,X6)) != X3
| ~ ssList(sK53_skl(X2,X4,X5,X6))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f709,f433]) ).
fof(f4424,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X2,X3,X4,X5)
| ~ ssList(sK53_skl(X2,X3,X4,X5))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(resolution,[status(thm)],[f4423,f436]) ).
fof(f4462,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ ssList(sK53_skl(X2,X3,X4,X5))
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(duplicate_literals_removal,[status(thm)],[f4424]) ).
fof(f4463,plain,
! [X0,X1,X2,X3,X4,X5] :
( ~ sP0_prd(X2,X3,X4,X5)
| ~ sP0_prd(X0,X1,X2,X3) ),
inference(forward_subsumption_resolution,[status(thm)],[f4462,f434]) ).
fof(f4544,plain,
! [X0,X1] :
( ~ sQ0_spl
| ~ sP0_prd(X0,X1,sK48_skl,sK47_skl) ),
inference(resolution,[status(thm)],[f4463,f496]) ).
fof(f4552,plain,
( ~ sQ0_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f496,f4544]) ).
fof(f4553,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f4552]) ).
fof(f4554,plain,
( sQ2_spl
| ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f896,f462]) ).
fof(f4555,plain,
( sQ2_spl
| ~ sQ1_spl ),
inference(contradiction_clause,[status(thm)],[f4554]) ).
fof(f4556,plain,
$false,
inference(sat_refutation,[status(thm)],[f464,f468,f4553,f4555]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC010+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.54 % Computer : n013.cluster.edu
% 0.10/5.54 % Model : x86_64 x86_64
% 0.10/5.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.54 % Memory : 8046.5625MB
% 0.10/5.54 % OS : Linux 6.8.0-71-generic
% 0.10/5.54 % CPULimit : 300
% 0.10/5.54 % WCLimit : 300
% 0.10/5.54 % DateTime : Mon Sep 21 07:48:43 UTC 2026
% 0.10/5.54 % CPUTime :
% 0.10/5.56 % Drodi V4.1.1
% 13.11/7.33 % Refutation found
% 13.11/7.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 13.11/7.33 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 5.90/7.37 % Elapsed time: 1.812851 seconds
% 5.90/7.37 % CPU time: 14.165548 seconds
% 5.90/7.37 % Total memory used: 233.702 MB
% 5.90/7.37 % Net memory used: 221.223 MB
%------------------------------------------------------------------------------