%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC105+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:39:59 PM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 27
% Syntax : Number of formulae : 136 ( 13 unt; 18 def)
% Number of atoms : 448 ( 95 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 521 ( 209 ~; 208 |; 59 &)
% ( 24 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 24 ( 22 usr; 17 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 108 ( 95 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [U] :
( ? [V] :
( U != V
& ssItem(V) )
& ssItem(U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( rearsegP(U,V)
<=> ? [W] :
( app(W,V) = U
& 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(f47,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ( ( rearsegP(V,W)
& rearsegP(U,V) )
=> rearsegP(U,W) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f48,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( rearsegP(V,U)
& rearsegP(U,V) )
=> 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(f52,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(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)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ( ( ( rearsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| 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)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ( ( ( rearsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f102,plain,
( sK0_skl != sK1_skl
& ssItem(sK1_skl)
& ssItem(sK0_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl)],[f2]) ).
fof(f105,plain,
sK0_skl != sK1_skl,
inference(cnf_transformation,[status(thm)],[f102]) ).
fof(f125,plain,
! [U] :
( ! [V] :
( ( rearsegP(U,V)
<=> ? [W] :
( app(W,V) = U
& ssList(W) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f126,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( app(W,V) != U
| ~ ssList(W) )
| rearsegP(U,V) )
& ( ? [W] :
( app(W,V) = U
& ssList(W) )
| ~ rearsegP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f125]) ).
fof(f127,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( app(W,V) != U
| ~ ssList(W) )
| rearsegP(U,V) )
& ( ( app(sK6_skl(V,U),V) = U
& ssList(sK6_skl(V,U)) )
| ~ rearsegP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6_skl]),skolemize(W,sK6_skl(V,U))],[f126]) ).
fof(f129,plain,
! [X0,X1] :
( app(sK6_skl(X1,X0),X1) = X0
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f127]) ).
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(f300,plain,
! [U] :
( ! [V] :
( ! [W] :
( rearsegP(U,W)
| ~ rearsegP(V,W)
| ~ rearsegP(U,V)
| ~ ssList(W) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f47]) ).
fof(f301,plain,
! [X0,X1,X2] :
( rearsegP(X0,X2)
| ~ rearsegP(X1,X2)
| ~ rearsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f300]) ).
fof(f302,plain,
! [U] :
( ! [V] :
( U = V
| ~ rearsegP(V,U)
| ~ rearsegP(U,V)
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f48]) ).
fof(f303,plain,
! [X0,X1] :
( X0 = X1
| ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f302]) ).
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(f310,plain,
! [U] :
( ( rearsegP(nil,U)
<=> nil = U )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f52]) ).
fof(f311,plain,
! [U] :
( ( ( nil != U
| rearsegP(nil,U) )
& ( nil = U
| ~ rearsegP(nil,U) ) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f310]) ).
fof(f312,plain,
! [X0] :
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f311]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( rearsegP(X,W)
& neq(W,nil) )
| ( nil = W
& nil = X ) )
& ( ( ( ~ rearsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& 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,definition,
! [W,X] :
( sP1_prd(X,W)
<=> ( nil = W
& nil = X ) ),
introduced(definition,[new_symbols(definition,[sP1_prd])],[]) ).
fof(f418,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( rearsegP(X,W)
& neq(W,nil) )
| sP1_prd(X,W) )
& ( ( ( ~ rearsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| sP0_prd(V,U) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f417,f416]) ).
fof(f419,plain,
( ( ( rearsegP(sK50_skl,sK49_skl)
& neq(sK49_skl,nil) )
| sP1_prd(sK50_skl,sK49_skl) )
& ( ( ( ~ rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) )
& neq(sK48_skl,nil) )
| sP0_prd(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)],[f418]) ).
fof(f422,plain,
ssList(sK49_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f423,plain,
ssList(sK50_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,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f427,plain,
( ~ rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f428,plain,
( neq(sK49_skl,nil)
| sP1_prd(sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f429,plain,
( rearsegP(sK50_skl,sK49_skl)
| sP1_prd(sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f430,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(f431,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)],[f430]) ).
fof(f432,plain,
! [X0,X1] :
( nil = X0
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f433,plain,
! [X0,X1] :
( nil != X1
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f434,plain,
! [X0,X1] :
( nil = X1
| nil != X0
| sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f435,plain,
! [W,X] :
( ( nil != W
| nil != X
| sP1_prd(X,W) )
& ( ( nil = W
& nil = X )
| ~ sP1_prd(X,W) ) ),
inference(NNF_transformation,[status(thm)],[f417]) ).
fof(f436,plain,
( ! [W,X] :
( nil != W
| nil != X
| sP1_prd(X,W) )
& ! [W,X] :
( ( nil = W
& nil = X )
| ~ sP1_prd(X,W) ) ),
inference(miniscoping,[status(thm)],[f435]) ).
fof(f437,plain,
! [X0,X1] :
( nil = X0
| ~ sP1_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f436]) ).
fof(f438,plain,
! [X0,X1] :
( nil = X1
| ~ sP1_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f436]) ).
fof(f440,definition,
( sQ0_spl
<=> sP0_prd(sK48_skl,sK47_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f441,plain,
( ~ sQ0_spl
| sP0_prd(sK48_skl,sK47_skl) ),
inference(component_clause,[status(thm)],[f440]) ).
fof(f443,definition,
( sQ1_spl
<=> neq(sK48_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f444,plain,
( ~ sQ1_spl
| neq(sK48_skl,nil) ),
inference(component_clause,[status(thm)],[f443]) ).
fof(f446,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f426,f440,f443]) ).
fof(f447,definition,
( sQ2_spl
<=> neq(sK47_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f449,plain,
( sQ2_spl
| ~ neq(sK47_skl,nil) ),
inference(component_clause,[status(thm)],[f447]) ).
fof(f450,definition,
( sQ3_spl
<=> rearsegP(sK48_skl,sK47_skl) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f452,plain,
( sQ3_spl
| ~ rearsegP(sK48_skl,sK47_skl) ),
inference(component_clause,[status(thm)],[f450]) ).
fof(f453,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f427,f440,f447,f450]) ).
fof(f454,definition,
( sQ4_spl
<=> sP1_prd(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f455,plain,
( ~ sQ4_spl
| sP1_prd(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f454]) ).
fof(f457,definition,
( sQ5_spl
<=> neq(sK49_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f458,plain,
( ~ sQ5_spl
| neq(sK49_skl,nil) ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( sQ5_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f428,f454,f457]) ).
fof(f461,definition,
( sQ6_spl
<=> rearsegP(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f462,plain,
( ~ sQ6_spl
| rearsegP(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f461]) ).
fof(f464,plain,
( sQ6_spl
| sQ4_spl ),
inference(split_clause,[status(thm)],[f429,f454,f461]) ).
fof(f480,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(thm)],[f219]) ).
fof(f481,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f480]) ).
fof(f495,plain,
! [X0] : ~ sP0_prd(X0,nil),
inference(destructive_equality_resolution,[status(thm)],[f433]) ).
fof(f496,plain,
! [X0] :
( nil = X0
| sP0_prd(nil,X0) ),
inference(destructive_equality_resolution,[status(thm)],[f434]) ).
fof(f500,plain,
( ~ sQ0_spl
| sP0_prd(sK50_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f441]) ).
fof(f501,plain,
( ~ sQ0_spl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f500]) ).
fof(f506,plain,
( ~ sQ0_spl
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f432,f501]) ).
fof(f507,plain,
( ~ sQ0_spl
| sP0_prd(nil,sK49_skl) ),
inference(backward_demodulation,[status(thm)],[f506,f501]) ).
fof(f508,plain,
( ~ sQ4_spl
| ~ sQ0_spl
| sP1_prd(nil,sK49_skl) ),
inference(backward_demodulation,[status(thm)],[f506,f455]) ).
fof(f513,plain,
! [X0] :
( nil = nil
| nil = X0 ),
inference(resolution,[status(thm)],[f496,f432]) ).
fof(f514,definition,
! [X0] :
( sQ7_spl
<=> nil = X0 ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f515,plain,
! [X0] :
( ~ sQ7_spl
| nil = X0 ),
inference(component_clause,[status(thm)],[f514]) ).
fof(f517,definition,
( sQ8_spl
<=> nil = nil ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f520,plain,
( sQ8_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f513,f514,f517]) ).
fof(f521,plain,
! [X0,X1] :
( ~ sQ7_spl
| X0 = X1 ),
inference(paramodulation,[status(thm)],[f515,f515]) ).
fof(f535,plain,
( ~ sQ7_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f105,f521]) ).
fof(f536,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f535]) ).
fof(f556,plain,
( ~ sQ4_spl
| ~ sQ0_spl
| nil = sK49_skl ),
inference(resolution,[status(thm)],[f438,f508]) ).
fof(f560,plain,
( ~ sQ0_spl
| ~ sQ4_spl
| sP0_prd(nil,nil) ),
inference(backward_demodulation,[status(thm)],[f556,f507]) ).
fof(f562,plain,
( ~ sQ0_spl
| ~ sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f560,f495]) ).
fof(f563,plain,
( ~ sQ0_spl
| ~ sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f562]) ).
fof(f564,plain,
( ~ sQ6_spl
| ~ sQ0_spl
| rearsegP(nil,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f506,f462]) ).
fof(f570,plain,
( sQ2_spl
| ~ neq(sK49_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f425,f449]) ).
fof(f572,plain,
( ~ sQ1_spl
| neq(sK50_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f424,f444]) ).
fof(f573,plain,
( sQ2_spl
| sK49_skl = nil
| ~ ssList(nil)
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f570,f220]) ).
fof(f574,definition,
( sQ13_spl
<=> ssList(sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f576,plain,
( sQ13_spl
| ~ ssList(sK49_skl) ),
inference(component_clause,[status(thm)],[f574]) ).
fof(f577,definition,
( sQ14_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ14_spl])],[split_symbol_definition]) ).
fof(f579,plain,
( sQ14_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f577]) ).
fof(f580,definition,
( sQ15_spl
<=> sK49_skl = nil ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f581,plain,
( ~ sQ15_spl
| sK49_skl = nil ),
inference(component_clause,[status(thm)],[f580]) ).
fof(f583,plain,
( sQ2_spl
| sQ15_spl
| ~ sQ14_spl
| ~ sQ13_spl ),
inference(split_clause,[status(thm)],[f573,f574,f577,f580,f447]) ).
fof(f584,plain,
( sQ3_spl
| ~ rearsegP(sK50_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f452]) ).
fof(f585,plain,
( sQ3_spl
| ~ rearsegP(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f425,f584]) ).
fof(f593,plain,
( ~ sQ4_spl
| ~ sQ15_spl
| sP1_prd(sK50_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f581,f455]) ).
fof(f595,plain,
( ~ sQ4_spl
| ~ sQ15_spl
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f593,f437]) ).
fof(f612,plain,
( sQ14_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f579,f223]) ).
fof(f613,plain,
sQ14_spl,
inference(contradiction_clause,[status(thm)],[f612]) ).
fof(f614,plain,
( sQ13_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f576,f422]) ).
fof(f615,plain,
sQ13_spl,
inference(contradiction_clause,[status(thm)],[f614]) ).
fof(f624,plain,
( ~ sQ5_spl
| ~ sQ15_spl
| neq(nil,nil) ),
inference(forward_demodulation,[status(thm)],[f581,f458]) ).
fof(f625,plain,
( ~ sQ5_spl
| ~ sQ15_spl
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f624,f481]) ).
fof(f626,plain,
( ~ sQ5_spl
| ~ sQ15_spl
| ~ sQ14_spl ),
inference(split_clause,[status(thm)],[f625,f577,f580,f457]) ).
fof(f633,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ15_spl
| neq(nil,nil) ),
inference(forward_demodulation,[status(thm)],[f595,f572]) ).
fof(f634,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ15_spl
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f633,f481]) ).
fof(f635,plain,
( ~ sQ1_spl
| ~ sQ4_spl
| ~ sQ15_spl
| ~ sQ14_spl ),
inference(split_clause,[status(thm)],[f634,f577,f580,f454,f443]) ).
fof(f636,plain,
! [X0] :
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[f309,f303]) ).
fof(f637,definition,
! [X0] :
( sQ17_spl
<=> ( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ17_spl])],[split_symbol_definition]) ).
fof(f640,plain,
( ~ sQ14_spl
| sQ17_spl ),
inference(split_clause,[status(thm)],[f636,f637,f577]) ).
fof(f643,plain,
! [X0,X1] :
( ~ rearsegP(X1,X0)
| ~ rearsegP(nil,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[f312,f301]) ).
fof(f646,definition,
! [X0,X1] :
( sQ18_spl
<=> ( ~ rearsegP(X1,X0)
| ~ rearsegP(nil,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| nil = X0
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ18_spl])],[split_symbol_definition]) ).
fof(f649,plain,
( ~ sQ14_spl
| sQ18_spl ),
inference(split_clause,[status(thm)],[f643,f646,f577]) ).
fof(f654,plain,
( ~ sQ6_spl
| ~ sQ0_spl
| nil = sK49_skl
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f564,f312]) ).
fof(f656,plain,
( ~ sQ6_spl
| ~ sQ0_spl
| sQ15_spl
| ~ sQ13_spl ),
inference(split_clause,[status(thm)],[f654,f574,f580,f440,f461]) ).
fof(f662,plain,
( ~ sQ4_spl
| nil = sK49_skl ),
inference(resolution,[status(thm)],[f455,f438]) ).
fof(f664,plain,
( ~ sQ4_spl
| sQ15_spl ),
inference(split_clause,[status(thm)],[f662,f580,f454]) ).
fof(f666,definition,
( sQ20_spl
<=> ssList(sK50_skl) ),
introduced(definition,[new_symbols(definition,[sQ20_spl])],[split_symbol_definition]) ).
fof(f668,plain,
( sQ20_spl
| ~ ssList(sK50_skl) ),
inference(component_clause,[status(thm)],[f666]) ).
fof(f673,plain,
( sQ20_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f668,f423]) ).
fof(f674,plain,
sQ20_spl,
inference(contradiction_clause,[status(thm)],[f673]) ).
fof(f676,plain,
! [X0] :
( ~ ssList(X0)
| app(sK6_skl(nil,X0),nil) = X0
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[f129,f309]) ).
fof(f680,definition,
! [X0] :
( sQ22_spl
<=> ( ~ ssList(X0)
| app(sK6_skl(nil,X0),nil) = X0
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ22_spl])],[split_symbol_definition]) ).
fof(f683,plain,
( ~ sQ14_spl
| sQ22_spl ),
inference(split_clause,[status(thm)],[f676,f680,f577]) ).
fof(f688,plain,
( ~ sQ6_spl
| sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f462,f585]) ).
fof(f689,plain,
( ~ sQ6_spl
| sQ3_spl ),
inference(contradiction_clause,[status(thm)],[f688]) ).
fof(f690,plain,
$false,
inference(sat_refutation,[status(thm)],[f446,f453,f460,f464,f520,f536,f563,f583,f613,f615,f626,f635,f640,f649,f656,f664,f674,f683,f689]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC105+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/0.36 % Computer : n017.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 07:51:27 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.40 % Refutation found
% 0.10/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.43 % Elapsed time: 0.052694 seconds
% 0.10/0.43 % CPU time: 0.150409 seconds
% 0.10/0.43 % Total memory used: 69.498 MB
% 0.10/0.43 % Net memory used: 69.395 MB
%------------------------------------------------------------------------------