%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC039+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 : n014.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:42 PM UTC 2026
% Result : Theorem 0.22s 5.51s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 16
% Syntax : Number of formulae : 93 ( 14 unt; 10 def)
% Number of atoms : 379 ( 104 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 463 ( 177 ~; 164 |; 86 &)
% ( 13 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 9 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-5 aty)
% Number of variables : 159 ( 131 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ssList(cons(V,U)) ) ),
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(f26,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ssList(app(U,V)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f51,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f83,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( nil = app(U,V)
<=> ( nil = U
& nil = V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] :
( lt(Y,X2)
& memberP(Z,X2)
& ssItem(X2) )
| app(app(Z,W),X1) != X
| cons(Y,nil) != W ) ) ) ) )
| nil = U
| U != W
| V != X
| nil != V ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil != W
| nil != X )
& ! [Y] :
( ssItem(Y)
=> ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] :
( lt(Y,X2)
& memberP(Z,X2)
& ssItem(X2) )
| app(app(Z,W),X1) != X
| cons(Y,nil) != W ) ) ) ) )
| nil = U
| U != W
| V != X
| nil != V ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(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(f244,plain,
! [U] :
( ! [V] :
( ssList(app(U,V))
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f26]) ).
fof(f245,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f244]) ).
fof(f308,plain,
! [U] :
( rearsegP(U,nil)
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f51]) ).
fof(f309,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f308]) ).
fof(f383,plain,
! [U] :
( ! [V] :
( ( nil = app(U,V)
<=> ( nil = U
& nil = V ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f83]) ).
fof(f384,plain,
! [U] :
( ! [V] :
( ( ( nil != U
| nil != V
| nil = app(U,V) )
& ( ( nil = U
& nil = V )
| nil != app(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f383]) ).
fof(f385,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f384]) ).
fof(f386,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f384]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] :
( ~ lt(Y,X2)
| ~ memberP(Z,X2)
| ~ ssItem(X2) )
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) ) )
& nil != U
& U = W
& V = X
& nil = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,definition,
! [W,X,Y] :
( sP0_prd(Y,X,W)
<=> ( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] :
( ~ lt(Y,X2)
| ~ memberP(Z,X2)
| ~ ssItem(X2) )
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] : sP0_prd(Y,X,W) )
& nil != U
& U = W
& V = X
& nil = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ( ( nil = sK49_skl
& nil = sK50_skl )
| sP0_prd(sK51_skl,sK50_skl,sK49_skl) )
& nil != sK47_skl
& sK47_skl = sK49_skl
& sK48_skl = sK50_skl
& nil = sK48_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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Y,sK51_skl)],[f417]) ).
fof(f421,plain,
ssList(sK49_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f422,plain,
ssList(sK50_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f423,plain,
nil = sK48_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f424,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f425,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
nil != sK47_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f428,plain,
( nil = sK49_skl
| sP0_prd(sK51_skl,sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f429,definition,
! [Y,Z,X2] :
( sP1_prd(X2,Z,Y)
<=> ( ~ lt(Y,X2)
| ~ memberP(Z,X2)
| ~ ssItem(X2) ) ),
introduced(definition,[new_symbols(definition,[sP1_prd])],[]) ).
fof(f430,plain,
! [W,X,Y] :
( sP0_prd(Y,X,W)
<=> ( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] : sP1_prd(X2,Z,Y)
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) ) ),
inference(formula_renaming,[status(thm)],[f416,f429]) ).
fof(f431,plain,
! [W,X,Y] :
( ( ! [Z] :
( ! [X1] :
( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] : ~ sP1_prd(X2,Z,Y)
| app(app(Z,W),X1) != X
| cons(Y,nil) != W
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ( ( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] : sP1_prd(X2,Z,Y)
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(NNF_transformation,[status(thm)],[f430]) ).
fof(f432,plain,
( ! [W,X,Y] :
( ! [Z] :
( ! [X1] :
( ? [X3] :
( lt(X3,Y)
& memberP(X1,X3)
& ssItem(X3) )
| ? [X2] : ~ sP1_prd(X2,Z,Y)
| app(app(Z,W),X1) != X
| cons(Y,nil) != W
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ! [W,X,Y] :
( ( ? [Z] :
( ? [X1] :
( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(X1,X3)
| ~ ssItem(X3) )
& ! [X2] : sP1_prd(X2,Z,Y)
& app(app(Z,W),X1) = X
& cons(Y,nil) = W
& ssList(X1) )
& ssList(Z) )
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(miniscoping,[status(thm)],[f431]) ).
fof(f433,plain,
( ! [W,X,Y] :
( ! [Z] :
( ! [X1] :
( ( lt(sK55_skl(X1,Z,Y,X,W),Y)
& memberP(X1,sK55_skl(X1,Z,Y,X,W))
& ssItem(sK55_skl(X1,Z,Y,X,W)) )
| ~ sP1_prd(sK54_skl(X1,Z,Y,X,W),Z,Y)
| app(app(Z,W),X1) != X
| cons(Y,nil) != W
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ! [W,X,Y] :
( ( ! [X3] :
( ~ lt(X3,Y)
| ~ memberP(sK53_skl(Y,X,W),X3)
| ~ ssItem(X3) )
& ! [X2] : sP1_prd(X2,sK52_skl(Y,X,W),Y)
& app(app(sK52_skl(Y,X,W),W),sK53_skl(Y,X,W)) = X
& cons(Y,nil) = W
& ssList(sK53_skl(Y,X,W))
& ssList(sK52_skl(Y,X,W))
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK52_skl,sK53_skl,sK54_skl,sK55_skl]),skolemize(Z,sK52_skl(Y,X,W)),skolemize(X1,sK53_skl(Y,X,W)),skolemize(X2,sK54_skl(X1,Z,Y,X,W)),skolemize(X3,sK55_skl(X1,Z,Y,X,W))],[f432]) ).
fof(f434,plain,
! [X0,X1,X2] :
( ssItem(X0)
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f433]) ).
fof(f435,plain,
! [X0,X1,X2] :
( ssList(sK52_skl(X0,X1,X2))
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f433]) ).
fof(f436,plain,
! [X0,X1,X2] :
( ssList(sK53_skl(X0,X1,X2))
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f433]) ).
fof(f437,plain,
! [X0,X1,X2] :
( cons(X0,nil) = X2
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f433]) ).
fof(f438,plain,
! [X0,X1,X2] :
( app(app(sK52_skl(X0,X1,X2),X2),sK53_skl(X0,X1,X2)) = X1
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f433]) ).
fof(f450,definition,
( sQ0_spl
<=> sP0_prd(sK51_skl,sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f451,plain,
( ~ sQ0_spl
| sP0_prd(sK51_skl,sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f457,definition,
( sQ2_spl
<=> nil = sK49_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f458,plain,
( ~ sQ2_spl
| nil = sK49_skl ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f428,f450,f457]) ).
fof(f494,plain,
nil = sK50_skl,
inference(backward_demodulation,[status(thm)],[f424,f423]) ).
fof(f497,plain,
nil != sK49_skl,
inference(forward_demodulation,[status(thm)],[f425,f426]) ).
fof(f498,plain,
sK50_skl != sK49_skl,
inference(backward_demodulation,[status(thm)],[f494,f497]) ).
fof(f511,plain,
( ~ sQ0_spl
| ssItem(sK51_skl) ),
inference(resolution,[status(thm)],[f451,f434]) ).
fof(f512,plain,
! [X0,X1,X2] :
( cons(X0,sK50_skl) = X2
| ~ sP0_prd(X0,X1,X2) ),
inference(forward_demodulation,[status(thm)],[f494,f437]) ).
fof(f513,plain,
( ~ sQ0_spl
| cons(sK51_skl,sK50_skl) = sK49_skl ),
inference(resolution,[status(thm)],[f512,f451]) ).
fof(f514,plain,
( ~ sQ0_spl
| ssList(sK49_skl)
| ~ ssItem(sK51_skl)
| ~ ssList(sK50_skl) ),
inference(paramodulation,[status(thm)],[f513,f222]) ).
fof(f516,definition,
( sQ3_spl
<=> ssList(sK50_skl) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f518,plain,
( sQ3_spl
| ~ ssList(sK50_skl) ),
inference(component_clause,[status(thm)],[f516]) ).
fof(f519,definition,
( sQ4_spl
<=> ssItem(sK51_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f521,plain,
( sQ4_spl
| ~ ssItem(sK51_skl) ),
inference(component_clause,[status(thm)],[f519]) ).
fof(f522,definition,
( sQ5_spl
<=> ssList(sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f525,plain,
( ~ sQ0_spl
| sQ5_spl
| ~ sQ4_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f514,f516,f519,f522,f450]) ).
fof(f530,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f518,f422]) ).
fof(f531,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f530]) ).
fof(f532,plain,
( ~ sQ2_spl
| sK50_skl = sK49_skl ),
inference(forward_demodulation,[status(thm)],[f494,f458]) ).
fof(f533,plain,
( ~ sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f532,f498]) ).
fof(f534,plain,
~ sQ2_spl,
inference(contradiction_clause,[status(thm)],[f533]) ).
fof(f536,plain,
( ~ sQ0_spl
| sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f511,f521]) ).
fof(f537,plain,
( ~ sQ0_spl
| sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f536]) ).
fof(f546,plain,
( ~ sQ0_spl
| sK49_skl != sK50_skl
| ~ ssItem(sK51_skl)
| ~ ssList(sK50_skl) ),
inference(paramodulation,[status(thm)],[f513,f225]) ).
fof(f547,definition,
( sQ7_spl
<=> sK49_skl = sK50_skl ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f550,plain,
( ~ sQ0_spl
| ~ sQ7_spl
| ~ sQ4_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f546,f516,f519,f547,f450]) ).
fof(f559,definition,
! [X0] :
( sQ9_spl
<=> ( ~ ssList(X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f560,plain,
! [X0] :
( ~ sQ9_spl
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(component_clause,[status(thm)],[f559]) ).
fof(f566,plain,
! [X0] :
( ~ sQ9_spl
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f560]) ).
fof(f568,plain,
( ~ sQ9_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f422,f566]) ).
fof(f570,plain,
~ sQ9_spl,
inference(contradiction_clause,[status(thm)],[f568]) ).
fof(f573,plain,
! [X0] :
( rearsegP(X0,sK50_skl)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f494,f309]) ).
fof(f631,plain,
! [X0,X1] :
( nil = X1
| sK50_skl != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f494,f385]) ).
fof(f632,plain,
! [X0,X1] :
( sK50_skl = X1
| sK50_skl != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f494,f631]) ).
fof(f730,plain,
! [X0,X1] :
( nil = X0
| sK50_skl != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f494,f386]) ).
fof(f731,plain,
! [X0,X1] :
( sK50_skl = X0
| sK50_skl != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f494,f730]) ).
fof(f732,plain,
! [X0,X1] :
( ~ sP0_prd(X0,sK50_skl,X1)
| sK50_skl = app(sK52_skl(X0,sK50_skl,X1),X1)
| ~ ssList(sK53_skl(X0,sK50_skl,X1))
| ~ ssList(app(sK52_skl(X0,sK50_skl,X1),X1)) ),
inference(resolution,[status(thm)],[f731,f438]) ).
fof(f736,plain,
! [X0,X1] :
( ~ sP0_prd(X0,sK50_skl,X1)
| sK50_skl = app(sK52_skl(X0,sK50_skl,X1),X1)
| ~ ssList(app(sK52_skl(X0,sK50_skl,X1),X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[f732,f436]) ).
fof(f920,definition,
( sQ51_spl
<=> rearsegP(sK49_skl,sK50_skl) ),
introduced(definition,[new_symbols(definition,[sQ51_spl])],[split_symbol_definition]) ).
fof(f922,plain,
( sQ51_spl
| ~ rearsegP(sK49_skl,sK50_skl) ),
inference(component_clause,[status(thm)],[f920]) ).
fof(f926,plain,
( sQ51_spl
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f922,f573]) ).
fof(f927,plain,
( sQ51_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f926,f421]) ).
fof(f928,plain,
sQ51_spl,
inference(contradiction_clause,[status(thm)],[f927]) ).
fof(f1167,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ ssList(sK52_skl(X0,sK50_skl,X1))
| ~ sP0_prd(X0,sK50_skl,X1)
| sK50_skl = app(sK52_skl(X0,sK50_skl,X1),X1) ),
inference(resolution,[status(thm)],[f736,f245]) ).
fof(f1168,plain,
! [X0,X1] :
( ~ ssList(X1)
| ~ sP0_prd(X0,sK50_skl,X1)
| sK50_skl = app(sK52_skl(X0,sK50_skl,X1),X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f1167,f435]) ).
fof(f1170,plain,
! [X0,X1] :
( sK50_skl = X1
| ~ ssList(X1)
| ~ ssList(sK52_skl(X0,sK50_skl,X1))
| ~ ssList(X1)
| ~ sP0_prd(X0,sK50_skl,X1) ),
inference(resolution,[status(thm)],[f1168,f632]) ).
fof(f1173,plain,
! [X0,X1] :
( sK50_skl = X1
| ~ ssList(sK52_skl(X0,sK50_skl,X1))
| ~ ssList(X1)
| ~ sP0_prd(X0,sK50_skl,X1) ),
inference(duplicate_literals_removal,[status(thm)],[f1170]) ).
fof(f1174,plain,
! [X0,X1] :
( sK50_skl = X1
| ~ ssList(X1)
| ~ sP0_prd(X0,sK50_skl,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f1173,f435]) ).
fof(f1175,plain,
( ~ sQ0_spl
| sK50_skl = sK49_skl
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f1174,f451]) ).
fof(f1176,plain,
( ~ sQ0_spl
| sQ7_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f1175,f522,f547,f450]) ).
fof(f1177,plain,
$false,
inference(sat_refutation,[status(thm)],[f460,f525,f531,f534,f537,f550,f570,f928,f1176]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC039+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/5.44 % Computer : n014.cluster.edu
% 0.17/5.44 % Model : x86_64 x86_64
% 0.17/5.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.44 % Memory : 8046.5625MB
% 0.17/5.44 % OS : Linux 6.8.0-71-generic
% 0.17/5.44 % CPULimit : 300
% 0.17/5.44 % WCLimit : 300
% 0.17/5.44 % DateTime : Mon Sep 21 07:50:40 UTC 2026
% 0.17/5.45 % CPUTime :
% 0.17/5.47 % Drodi V4.1.1
% 0.22/5.51 % Refutation found
% 0.22/5.51 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.22/5.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/5.54 % Elapsed time: 0.086321 seconds
% 0.22/5.54 % CPU time: 0.299899 seconds
% 0.22/5.54 % Total memory used: 81.662 MB
% 0.22/5.54 % Net memory used: 81.448 MB
%------------------------------------------------------------------------------