%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC407+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:41:07 PM UTC 2026
% Result : Theorem 0.23s 10.54s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 23
% Syntax : Number of formulae : 108 ( 13 unt; 15 def)
% Number of atoms : 383 ( 76 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 459 ( 184 ~; 178 |; 52 &)
% ( 19 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 21 ( 19 usr; 15 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 118 ( 103 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [U] :
( ssList(U)
=> ( singletonP(U)
<=> ? [V] :
( cons(V,nil) = U
& ssItem(V) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ssList(cons(V,U)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> cons(V,U) != U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssItem(W)
=> ! [X] :
( ssItem(X)
=> ( cons(W,U) = cons(X,V)
=> ( V = U
& W = X ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssList(W)
=> ( memberP(cons(V,W),U)
<=> ( memberP(W,U)
| U = V ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f38,axiom,
! [U] :
( ssItem(U)
=> ~ memberP(nil,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil != W
| nil != X )
& ! [Z] :
( ssItem(Z)
=> ( ~ memberP(X,Z)
| cons(Z,nil) != W ) ) )
| ! [Y] :
( ssItem(Y)
=> ( memberP(V,Y)
| ~ memberP(U,Y) ) )
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil != W
| nil != X )
& ! [Z] :
( ssItem(Z)
=> ( ~ memberP(X,Z)
| cons(Z,nil) != W ) ) )
| ! [Y] :
( ssItem(Y)
=> ( memberP(V,Y)
| ~ memberP(U,Y) ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f113,plain,
! [U] :
( ( singletonP(U)
<=> ? [V] :
( cons(V,nil) = U
& ssItem(V) ) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f114,plain,
! [U] :
( ( ( ! [V] :
( cons(V,nil) != U
| ~ ssItem(V) )
| singletonP(U) )
& ( ? [V] :
( cons(V,nil) = U
& ssItem(V) )
| ~ singletonP(U) ) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f113]) ).
fof(f115,plain,
! [U] :
( ( ( ! [V] :
( cons(V,nil) != U
| ~ ssItem(V) )
| singletonP(U) )
& ( ( cons(sK4_skl(U),nil) = U
& ssItem(sK4_skl(U)) )
| ~ singletonP(U) ) )
| ~ ssList(U) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl]),skolemize(V,sK4_skl(U))],[f114]) ).
fof(f116,plain,
! [X0] :
( ssItem(sK4_skl(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f115]) ).
fof(f117,plain,
! [X0] :
( cons(sK4_skl(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f115]) ).
fof(f118,plain,
! [X0,X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f115]) ).
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(f226,plain,
! [U] :
( ! [V] :
( ! [W] :
( ! [X] :
( ( V = U
& W = X )
| cons(W,U) != cons(X,V)
| ~ ssItem(X) )
| ~ ssItem(W) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f19]) ).
fof(f227,plain,
! [X0,X1,X2,X3] :
( X2 = X3
| cons(X2,X0) != cons(X3,X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f226]) ).
fof(f228,plain,
! [X0,X1,X2,X3] :
( X1 = X0
| cons(X2,X0) != cons(X3,X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f226]) ).
fof(f273,plain,
! [U] :
( ! [V] :
( ! [W] :
( ( memberP(cons(V,W),U)
<=> ( memberP(W,U)
| U = V ) )
| ~ ssList(W) )
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(pre_NNF_transformation,[status(thm)],[f37]) ).
fof(f274,plain,
! [U] :
( ! [V] :
( ! [W] :
( ( ( ( ~ memberP(W,U)
& U != V )
| memberP(cons(V,W),U) )
& ( memberP(W,U)
| U = V
| ~ memberP(cons(V,W),U) ) )
| ~ ssList(W) )
| ~ ssItem(V) )
| ~ ssItem(U) ),
inference(NNF_transformation,[status(thm)],[f273]) ).
fof(f275,plain,
! [X0,X1,X2] :
( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f274]) ).
fof(f278,plain,
! [U] :
( ~ memberP(nil,U)
| ~ ssItem(U) ),
inference(pre_NNF_transformation,[status(thm)],[f38]) ).
fof(f279,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f278]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Z] :
( memberP(X,Z)
& cons(Z,nil) = W
& ssItem(Z) ) )
& ? [Y] :
( ~ memberP(V,Y)
& memberP(U,Y)
& ssItem(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,definition,
! [W,X,Z] :
( sP0_prd(Z,X,W)
<=> ( memberP(X,Z)
& cons(Z,nil) = W
& ssItem(Z) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Z] : sP0_prd(Z,X,W) )
& ? [Y] :
( ~ memberP(V,Y)
& memberP(U,Y)
& ssItem(Y) )
& U = W
& V = X
& 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(sK52_skl,sK50_skl,sK49_skl) )
& ~ memberP(sK48_skl,sK51_skl)
& memberP(sK47_skl,sK51_skl)
& ssItem(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)],[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,
ssItem(sK51_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
memberP(sK47_skl,sK51_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
~ memberP(sK48_skl,sK51_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f428,plain,
( nil = sK50_skl
| sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f429,plain,
( nil = sK49_skl
| sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f430,plain,
! [W,X,Z] :
( ( ~ memberP(X,Z)
| cons(Z,nil) != W
| ~ ssItem(Z)
| sP0_prd(Z,X,W) )
& ( ( memberP(X,Z)
& cons(Z,nil) = W
& ssItem(Z) )
| ~ sP0_prd(Z,X,W) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f431,plain,
( ! [W,X,Z] :
( ~ memberP(X,Z)
| cons(Z,nil) != W
| ~ ssItem(Z)
| sP0_prd(Z,X,W) )
& ! [W,X,Z] :
( ( memberP(X,Z)
& cons(Z,nil) = W
& ssItem(Z) )
| ~ sP0_prd(Z,X,W) ) ),
inference(miniscoping,[status(thm)],[f430]) ).
fof(f432,plain,
! [X0,X1,X2] :
( ssItem(X0)
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f433,plain,
! [X0,X1,X2] :
( cons(X0,nil) = X2
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f434,plain,
! [X0,X1,X2] :
( memberP(X1,X0)
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f431]) ).
fof(f436,definition,
( sQ0_spl
<=> sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f437,plain,
( ~ sQ0_spl
| sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f436]) ).
fof(f439,definition,
( sQ1_spl
<=> nil = sK50_skl ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f440,plain,
( ~ sQ1_spl
| nil = sK50_skl ),
inference(component_clause,[status(thm)],[f439]) ).
fof(f442,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f428,f436,f439]) ).
fof(f443,definition,
( sQ2_spl
<=> nil = sK49_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f444,plain,
( ~ sQ2_spl
| nil = sK49_skl ),
inference(component_clause,[status(thm)],[f443]) ).
fof(f446,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f429,f436,f443]) ).
fof(f450,plain,
! [X0] :
( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil)) ),
inference(destructive_equality_resolution,[status(thm)],[f118]) ).
fof(f480,plain,
memberP(sK49_skl,sK51_skl),
inference(forward_demodulation,[status(thm)],[f424,f426]) ).
fof(f481,plain,
~ memberP(sK50_skl,sK51_skl),
inference(forward_demodulation,[status(thm)],[f423,f427]) ).
fof(f482,plain,
( ~ sQ0_spl
| ssItem(sK52_skl) ),
inference(resolution,[status(thm)],[f437,f432]) ).
fof(f483,plain,
( ~ sQ0_spl
| memberP(sK50_skl,sK52_skl) ),
inference(resolution,[status(thm)],[f434,f437]) ).
fof(f486,plain,
( ~ sQ0_spl
| cons(sK52_skl,nil) = sK49_skl ),
inference(resolution,[status(thm)],[f433,f437]) ).
fof(f489,definition,
( sQ3_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f491,plain,
( sQ3_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f489]) ).
fof(f492,definition,
( sQ4_spl
<=> ssItem(sK52_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f494,plain,
( sQ4_spl
| ~ ssItem(sK52_skl) ),
inference(component_clause,[status(thm)],[f492]) ).
fof(f503,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f491,f223]) ).
fof(f504,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f503]) ).
fof(f516,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| memberP(sK50_skl,sK51_skl) ),
inference(backward_demodulation,[status(thm)],[f519,f480]) ).
fof(f519,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| sK50_skl = sK49_skl ),
inference(forward_demodulation,[status(thm)],[f440,f444]) ).
fof(f520,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f516,f481]) ).
fof(f521,plain,
( ~ sQ2_spl
| ~ sQ1_spl ),
inference(contradiction_clause,[status(thm)],[f520]) ).
fof(f524,plain,
( ~ sQ0_spl
| sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f494]) ).
fof(f525,plain,
( ~ sQ0_spl
| sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f524]) ).
fof(f526,plain,
! [X0,X1] :
( X1 = X1
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(equality_resolution,[status(thm)],[f227]) ).
fof(f527,definition,
! [X0] :
( sQ7_spl
<=> ( ~ ssList(X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f528,plain,
! [X0] :
( ~ sQ7_spl
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(component_clause,[status(thm)],[f527]) ).
fof(f530,definition,
! [X1] :
( sQ8_spl
<=> ( X1 = X1
| ~ ssItem(X1)
| ~ ssItem(X1) ) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f533,plain,
( sQ8_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f526,f527,f530]) ).
fof(f534,plain,
! [X0] :
( ~ sQ7_spl
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f528]) ).
fof(f535,plain,
( ~ sQ7_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f223,f534]) ).
fof(f538,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f535]) ).
fof(f561,plain,
( ~ singletonP(nil)
| ~ ssList(nil)
| ~ ssItem(sK4_skl(nil))
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f225,f117]) ).
fof(f563,definition,
( sQ12_spl
<=> ssItem(sK4_skl(nil)) ),
introduced(definition,[new_symbols(definition,[sQ12_spl])],[split_symbol_definition]) ).
fof(f565,plain,
( sQ12_spl
| ~ ssItem(sK4_skl(nil)) ),
inference(component_clause,[status(thm)],[f563]) ).
fof(f566,definition,
( sQ13_spl
<=> singletonP(nil) ),
introduced(definition,[new_symbols(definition,[sQ13_spl])],[split_symbol_definition]) ).
fof(f569,plain,
( ~ sQ13_spl
| ~ sQ12_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f561,f489,f563,f566]) ).
fof(f571,plain,
( sQ12_spl
| ~ singletonP(nil)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f565,f116]) ).
fof(f572,plain,
( sQ12_spl
| ~ sQ13_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f571,f489,f566,f563]) ).
fof(f589,plain,
! [X0,X1] :
( ~ singletonP(cons(X1,X0))
| ~ ssList(cons(X1,X0))
| X0 = nil
| ~ ssItem(X1)
| ~ ssItem(sK4_skl(cons(X1,X0)))
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f228,f117]) ).
fof(f594,definition,
! [X0,X1] :
( sQ15_spl
<=> ( ~ singletonP(cons(X1,X0))
| ~ ssList(cons(X1,X0))
| X0 = nil
| ~ ssItem(X1)
| ~ ssItem(sK4_skl(cons(X1,X0)))
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f597,plain,
( sQ15_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f589,f489,f594]) ).
fof(f625,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(nil)
| ~ ssItem(X0)
| singletonP(cons(X0,nil)) ),
inference(resolution,[status(thm)],[f450,f222]) ).
fof(f627,definition,
! [X0] :
( sQ21_spl
<=> ( ~ ssItem(X0)
| ~ ssItem(X0)
| singletonP(cons(X0,nil)) ) ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f630,plain,
( ~ sQ3_spl
| sQ21_spl ),
inference(split_clause,[status(thm)],[f625,f627,f489]) ).
fof(f664,plain,
! [X0] :
( ~ sQ0_spl
| memberP(nil,X0)
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssList(nil)
| ~ ssItem(sK52_skl)
| ~ ssItem(X0) ),
inference(paramodulation,[status(thm)],[f486,f275]) ).
fof(f665,definition,
! [X0] :
( sQ28_spl
<=> ( memberP(nil,X0)
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ28_spl])],[split_symbol_definition]) ).
fof(f666,plain,
! [X0] :
( ~ sQ28_spl
| memberP(nil,X0)
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ),
inference(component_clause,[status(thm)],[f665]) ).
fof(f668,plain,
( ~ sQ0_spl
| ~ sQ3_spl
| ~ sQ4_spl
| sQ28_spl ),
inference(split_clause,[status(thm)],[f664,f665,f492,f489,f436]) ).
fof(f669,plain,
! [X0] :
( ~ sQ28_spl
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f666,f279]) ).
fof(f671,plain,
( ~ sQ28_spl
| sK51_skl = sK52_skl
| ~ ssItem(sK51_skl) ),
inference(resolution,[status(thm)],[f669,f480]) ).
fof(f676,definition,
( sQ30_spl
<=> ssItem(sK51_skl) ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f678,plain,
( sQ30_spl
| ~ ssItem(sK51_skl) ),
inference(component_clause,[status(thm)],[f676]) ).
fof(f679,definition,
( sQ31_spl
<=> sK51_skl = sK52_skl ),
introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition]) ).
fof(f680,plain,
( ~ sQ31_spl
| sK51_skl = sK52_skl ),
inference(component_clause,[status(thm)],[f679]) ).
fof(f682,plain,
( ~ sQ28_spl
| sQ31_spl
| ~ sQ30_spl ),
inference(split_clause,[status(thm)],[f671,f676,f679,f665]) ).
fof(f683,plain,
( sQ30_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f678,f425]) ).
fof(f684,plain,
sQ30_spl,
inference(contradiction_clause,[status(thm)],[f683]) ).
fof(f686,plain,
( ~ sQ31_spl
| ~ memberP(sK50_skl,sK52_skl) ),
inference(backward_demodulation,[status(thm)],[f680,f481]) ).
fof(f688,plain,
( ~ sQ31_spl
| ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f686,f483]) ).
fof(f689,plain,
( ~ sQ31_spl
| ~ sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f688]) ).
fof(f690,plain,
$false,
inference(sat_refutation,[status(thm)],[f442,f446,f504,f521,f525,f533,f538,f569,f572,f597,f630,f668,f682,f684,f689]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC407+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/10.45 % Computer : n018.cluster.edu
% 0.17/10.45 % Model : x86_64 x86_64
% 0.17/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/10.45 % Memory : 8046.5625MB
% 0.17/10.45 % OS : Linux 6.8.0-71-generic
% 0.17/10.45 % CPULimit : 300
% 0.17/10.45 % WCLimit : 300
% 0.17/10.45 % DateTime : Mon Sep 21 08:24:26 UTC 2026
% 0.17/10.45 % CPUTime :
% 0.17/10.48 % Drodi V4.1.1
% 0.23/10.54 % Refutation found
% 0.23/10.54 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.23/10.54 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/10.56 % Elapsed time: 0.096440 seconds
% 0.23/10.56 % CPU time: 0.280483 seconds
% 0.23/10.56 % Total memory used: 70.756 MB
% 0.23/10.56 % Net memory used: 70.571 MB
%------------------------------------------------------------------------------