%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC198+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 : 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:40:21 PM UTC 2026
% Result : Theorem 0.12s 0.41s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of formulae : 89 ( 8 unt; 10 def)
% Number of atoms : 385 ( 86 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 479 ( 183 ~; 177 |; 81 &)
% ( 14 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 10 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-3 aty)
% Number of variables : 131 ( 108 !; 23 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [U] :
( ? [V] :
( U != V
& ssItem(V) )
& ssItem(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
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(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 )
& ! [X1] :
( ssItem(X1)
=> ( ? [X2] :
( leq(X1,X2)
& memberP(X,X2)
& X1 != X2
& ssItem(X2) )
| ~ memberP(X,X1)
| cons(X1,nil) != W ) ) )
| ? [Y] :
( ! [Z] :
( ssItem(Z)
=> ( Y = Z
| ~ memberP(U,Z) ) )
& ssItem(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 )
& ! [X1] :
( ssItem(X1)
=> ( ? [X2] :
( leq(X1,X2)
& memberP(X,X2)
& X1 != X2
& ssItem(X2) )
| ~ memberP(X,X1)
| cons(X1,nil) != W ) ) )
| ? [Y] :
( ! [Z] :
( ssItem(Z)
=> ( Y = Z
| ~ memberP(U,Z) ) )
& ssItem(Y) )
| 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(f104,plain,
ssItem(sK1_skl),
inference(cnf_transformation,[status(thm)],[f102]) ).
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(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(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(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 )
| ? [X1] :
( ! [X2] :
( ~ leq(X1,X2)
| ~ memberP(X,X2)
| X1 = X2
| ~ ssItem(X2) )
& memberP(X,X1)
& cons(X1,nil) = W
& ssItem(X1) ) )
& ! [Y] :
( ? [Z] :
( Y != Z
& memberP(U,Z)
& ssItem(Z) )
| ~ 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,X1] :
( sP0_prd(X1,X,W)
<=> ( ! [X2] :
( ~ leq(X1,X2)
| ~ memberP(X,X2)
| X1 = X2
| ~ ssItem(X2) )
& memberP(X,X1)
& cons(X1,nil) = W
& ssItem(X1) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [X1] : sP0_prd(X1,X,W) )
& ! [Y] :
( ? [Z] :
( Y != Z
& memberP(U,Z)
& ssItem(Z) )
| ~ 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) )
& ! [Y] :
( ( Y != sK51_skl(Y)
& memberP(sK47_skl,sK51_skl(Y))
& ssItem(sK51_skl(Y)) )
| ~ ssItem(Y) )
& 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(Z,sK51_skl(Y)),skolemize(X1,sK52_skl)],[f417]) ).
fof(f422,plain,
ssList(sK50_skl),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f424,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f425,plain,
! [X0] :
( ssItem(sK51_skl(X0))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
! [X0] :
( memberP(sK47_skl,sK51_skl(X0))
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
! [X0] :
( X0 != sK51_skl(X0)
| ~ ssItem(X0) ),
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,X1] :
( ( ? [X2] :
( leq(X1,X2)
& memberP(X,X2)
& X1 != X2
& ssItem(X2) )
| ~ memberP(X,X1)
| cons(X1,nil) != W
| ~ ssItem(X1)
| sP0_prd(X1,X,W) )
& ( ( ! [X2] :
( ~ leq(X1,X2)
| ~ memberP(X,X2)
| X1 = X2
| ~ ssItem(X2) )
& memberP(X,X1)
& cons(X1,nil) = W
& ssItem(X1) )
| ~ sP0_prd(X1,X,W) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f431,plain,
( ! [W,X,X1] :
( ? [X2] :
( leq(X1,X2)
& memberP(X,X2)
& X1 != X2
& ssItem(X2) )
| ~ memberP(X,X1)
| cons(X1,nil) != W
| ~ ssItem(X1)
| sP0_prd(X1,X,W) )
& ! [W,X,X1] :
( ( ! [X2] :
( ~ leq(X1,X2)
| ~ memberP(X,X2)
| X1 = X2
| ~ ssItem(X2) )
& memberP(X,X1)
& cons(X1,nil) = W
& ssItem(X1) )
| ~ sP0_prd(X1,X,W) ) ),
inference(miniscoping,[status(thm)],[f430]) ).
fof(f432,plain,
( ! [W,X,X1] :
( ( leq(X1,sK53_skl(X1,X,W))
& memberP(X,sK53_skl(X1,X,W))
& X1 != sK53_skl(X1,X,W)
& ssItem(sK53_skl(X1,X,W)) )
| ~ memberP(X,X1)
| cons(X1,nil) != W
| ~ ssItem(X1)
| sP0_prd(X1,X,W) )
& ! [W,X,X1] :
( ( ! [X2] :
( ~ leq(X1,X2)
| ~ memberP(X,X2)
| X1 = X2
| ~ ssItem(X2) )
& memberP(X,X1)
& cons(X1,nil) = W
& ssItem(X1) )
| ~ sP0_prd(X1,X,W) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53_skl]),skolemize(X2,sK53_skl(X1,X,W))],[f431]) ).
fof(f433,plain,
! [X0,X1,X2] :
( ssItem(X0)
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f432]) ).
fof(f434,plain,
! [X0,X1,X2] :
( cons(X0,nil) = X2
| ~ sP0_prd(X0,X1,X2) ),
inference(cnf_transformation,[status(thm)],[f432]) ).
fof(f441,definition,
( sQ0_spl
<=> sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f442,plain,
( ~ sQ0_spl
| sP0_prd(sK52_skl,sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,definition,
( sQ1_spl
<=> nil = sK50_skl ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f445,plain,
( ~ sQ1_spl
| nil = sK50_skl ),
inference(component_clause,[status(thm)],[f444]) ).
fof(f447,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f428,f441,f444]) ).
fof(f448,definition,
( sQ2_spl
<=> nil = sK49_skl ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f449,plain,
( ~ sQ2_spl
| nil = sK49_skl ),
inference(component_clause,[status(thm)],[f448]) ).
fof(f451,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f429,f441,f448]) ).
fof(f455,plain,
! [X0] :
( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil)) ),
inference(destructive_equality_resolution,[status(thm)],[f118]) ).
fof(f488,plain,
( ~ sQ0_spl
| ssItem(sK52_skl) ),
inference(resolution,[status(thm)],[f442,f433]) ).
fof(f492,plain,
! [X0] :
( memberP(sK49_skl,sK51_skl(X0))
| ~ ssItem(X0) ),
inference(forward_demodulation,[status(thm)],[f424,f426]) ).
fof(f493,plain,
( ~ sQ0_spl
| cons(sK52_skl,nil) = sK49_skl ),
inference(resolution,[status(thm)],[f434,f442]) ).
fof(f496,definition,
( sQ3_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f498,plain,
( sQ3_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f496]) ).
fof(f499,definition,
( sQ4_spl
<=> ssItem(sK52_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f501,plain,
( sQ4_spl
| ~ ssItem(sK52_skl) ),
inference(component_clause,[status(thm)],[f499]) ).
fof(f510,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f498,f223]) ).
fof(f511,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f510]) ).
fof(f521,plain,
! [X0] :
( ~ sQ1_spl
| ~ memberP(sK50_skl,X0)
| ~ ssItem(X0) ),
inference(backward_demodulation,[status(thm)],[f445,f279]) ).
fof(f523,plain,
! [X0] :
( ~ sQ2_spl
| ~ sQ1_spl
| memberP(sK50_skl,sK51_skl(X0))
| ~ ssItem(X0) ),
inference(backward_demodulation,[status(thm)],[f526,f492]) ).
fof(f526,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| sK50_skl = sK49_skl ),
inference(forward_demodulation,[status(thm)],[f445,f449]) ).
fof(f527,plain,
! [X0,X1] :
( X1 = X1
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(equality_resolution,[status(thm)],[f227]) ).
fof(f528,definition,
! [X0] :
( sQ7_spl
<=> ( ~ ssList(X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f529,plain,
! [X0] :
( ~ sQ7_spl
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(component_clause,[status(thm)],[f528]) ).
fof(f531,definition,
! [X1] :
( sQ8_spl
<=> ( X1 = X1
| ~ ssItem(X1)
| ~ ssItem(X1) ) ),
introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).
fof(f534,plain,
( sQ8_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f527,f528,f531]) ).
fof(f535,plain,
! [X0] :
( ~ sQ7_spl
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f529]) ).
fof(f536,plain,
( ~ sQ7_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f422,f535]) ).
fof(f537,plain,
~ sQ7_spl,
inference(contradiction_clause,[status(thm)],[f536]) ).
fof(f545,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ2_spl
| ~ ssItem(sK51_skl(X0))
| ~ ssItem(X0) ),
inference(resolution,[status(thm)],[f523,f521]) ).
fof(f546,plain,
! [X0] :
( ~ sQ1_spl
| ~ sQ2_spl
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f545,f425]) ).
fof(f549,plain,
( ~ sQ1_spl
| ~ sQ2_spl
| $false ),
inference(backward_subsumption_resolution,[status(thm)],[f104,f546]) ).
fof(f551,plain,
( ~ sQ1_spl
| ~ sQ2_spl ),
inference(contradiction_clause,[status(thm)],[f549]) ).
fof(f552,plain,
( ~ sQ0_spl
| sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f488,f501]) ).
fof(f553,plain,
( ~ sQ0_spl
| sQ4_spl ),
inference(contradiction_clause,[status(thm)],[f552]) ).
fof(f605,plain,
! [X0] :
( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f222,f455]) ).
fof(f607,definition,
! [X0] :
( sQ17_spl
<=> ( ~ ssItem(X0)
| singletonP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ17_spl])],[split_symbol_definition]) ).
fof(f610,plain,
( sQ17_spl
| ~ sQ3_spl ),
inference(split_clause,[status(thm)],[f605,f496,f607]) ).
fof(f692,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)],[f493,f275]) ).
fof(f694,definition,
! [X0] :
( sQ30_spl
<=> ( memberP(nil,X0)
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ30_spl])],[split_symbol_definition]) ).
fof(f695,plain,
! [X0] :
( ~ sQ30_spl
| memberP(nil,X0)
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ),
inference(component_clause,[status(thm)],[f694]) ).
fof(f697,plain,
( ~ sQ0_spl
| ~ sQ3_spl
| ~ sQ4_spl
| sQ30_spl ),
inference(split_clause,[status(thm)],[f692,f694,f499,f496,f441]) ).
fof(f698,plain,
! [X0] :
( ~ sQ30_spl
| X0 = sK52_skl
| ~ memberP(sK49_skl,X0)
| ~ ssItem(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f695,f279]) ).
fof(f700,plain,
! [X0] :
( ~ sQ30_spl
| ~ ssItem(X0)
| sK51_skl(X0) = sK52_skl
| ~ ssItem(sK51_skl(X0)) ),
inference(resolution,[status(thm)],[f698,f492]) ).
fof(f703,plain,
! [X0] :
( ~ sQ30_spl
| ~ ssItem(X0)
| sK51_skl(X0) = sK52_skl ),
inference(forward_subsumption_resolution,[status(thm)],[f700,f425]) ).
fof(f705,plain,
( ~ sQ30_spl
| ~ ssItem(sK52_skl)
| ~ ssItem(sK52_skl) ),
inference(resolution,[status(thm)],[f703,f427]) ).
fof(f706,plain,
( ~ sQ30_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f705,f499,f694]) ).
fof(f707,plain,
$false,
inference(sat_refutation,[status(thm)],[f447,f451,f511,f534,f537,f551,f553,f610,f697,f706]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC198+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 % Computer : n014.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 08:03:34 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.39 % Drodi V4.1.1
% 0.12/0.41 % Refutation found
% 0.12/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.46 % Elapsed time: 0.087565 seconds
% 0.16/0.46 % CPU time: 0.142438 seconds
% 0.16/0.46 % Total memory used: 17.588 MB
% 0.16/0.46 % Net memory used: 17.555 MB
%------------------------------------------------------------------------------