%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC085+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 : 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:54 PM UTC 2026
% Result : Theorem 0.13s 5.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 21
% Syntax : Number of formulae : 103 ( 16 unt; 13 def)
% Number of atoms : 365 ( 61 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 438 ( 176 ~; 165 |; 62 &)
% ( 19 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 13 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 98 ( 77 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [U] :
( ? [V] :
( U != V
& ssItem(V) )
& ssItem(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( frontsegP(U,V)
<=> ? [W] :
( app(V,W) = U
& ssList(W) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
! [U] :
( ssList(U)
=> app(nil,U) = U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f55,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ~ frontsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ? [Y] :
( segmentP(U,Y)
& segmentP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil)
| 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)
=> ( ( ( ~ frontsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| ? [Y] :
( segmentP(U,Y)
& segmentP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil)
| 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(f119,plain,
! [U] :
( ! [V] :
( ( frontsegP(U,V)
<=> ? [W] :
( app(V,W) = U
& ssList(W) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f120,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( app(V,W) != U
| ~ ssList(W) )
| frontsegP(U,V) )
& ( ? [W] :
( app(V,W) = U
& ssList(W) )
| ~ frontsegP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f119]) ).
fof(f121,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( app(V,W) != U
| ~ ssList(W) )
| frontsegP(U,V) )
& ( ( app(V,sK5_skl(V,U)) = U
& ssList(sK5_skl(V,U)) )
| ~ frontsegP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl]),skolemize(W,sK5_skl(V,U))],[f120]) ).
fof(f122,plain,
! [X0,X1] :
( ssList(sK5_skl(X1,X0))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f121]) ).
fof(f123,plain,
! [X0,X1] :
( app(X1,sK5_skl(X1,X0)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f121]) ).
fof(f131,plain,
! [U] :
( ! [V] :
( ( segmentP(U,V)
<=> ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f132,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( ! [X] :
( app(app(W,V),X) != U
| ~ ssList(X) )
| ~ ssList(W) )
| segmentP(U,V) )
& ( ? [W] :
( ? [X] :
( app(app(W,V),X) = U
& ssList(X) )
& ssList(W) )
| ~ segmentP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f131]) ).
fof(f133,plain,
! [U] :
( ! [V] :
( ( ( ! [W] :
( ! [X] :
( app(app(W,V),X) != U
| ~ ssList(X) )
| ~ ssList(W) )
| segmentP(U,V) )
& ( ( app(app(sK7_skl(V,U),V),sK8_skl(V,U)) = U
& ssList(sK8_skl(V,U))
& ssList(sK7_skl(V,U)) )
| ~ segmentP(U,V) ) )
| ~ ssList(V) )
| ~ ssList(U) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl,sK8_skl]),skolemize(W,sK7_skl(V,U)),skolemize(X,sK8_skl(V,U))],[f132]) ).
fof(f137,plain,
! [X0,X1,X2,X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f133]) ).
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(f223,plain,
ssList(nil),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f248,plain,
! [U] :
( app(nil,U) = U
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f28]) ).
fof(f249,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f248]) ).
fof(f318,plain,
! [U] :
( segmentP(U,U)
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f55]) ).
fof(f319,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f318]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( frontsegP(X,W)
& neq(W,nil) )
| ( nil = W
& nil = X ) )
& ! [Y] :
( ~ segmentP(U,Y)
| ~ segmentP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(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,
! [W,X] :
( sP0_prd(X,W)
<=> ( nil = W
& nil = X ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( frontsegP(X,W)
& neq(W,nil) )
| sP0_prd(X,W) )
& ! [Y] :
( ~ segmentP(U,Y)
| ~ segmentP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(V,nil)
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ( ( frontsegP(sK50_skl,sK49_skl)
& neq(sK49_skl,nil) )
| sP0_prd(sK50_skl,sK49_skl) )
& ! [Y] :
( ~ segmentP(sK47_skl,Y)
| ~ segmentP(sK48_skl,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(sK48_skl,nil)
& 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(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,
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),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
! [X0] :
( ~ segmentP(sK47_skl,X0)
| ~ segmentP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
( neq(sK49_skl,nil)
| sP0_prd(sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f428,plain,
( frontsegP(sK50_skl,sK49_skl)
| sP0_prd(sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f429,plain,
! [W,X] :
( ( nil != W
| nil != X
| sP0_prd(X,W) )
& ( ( nil = W
& nil = X )
| ~ sP0_prd(X,W) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f430,plain,
( ! [W,X] :
( nil != W
| nil != X
| sP0_prd(X,W) )
& ! [W,X] :
( ( nil = W
& nil = X )
| ~ sP0_prd(X,W) ) ),
inference(miniscoping,[status(thm)],[f429]) ).
fof(f431,plain,
! [X0,X1] :
( nil = X0
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f430]) ).
fof(f434,definition,
( sQ0_spl
<=> sP0_prd(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f435,plain,
( ~ sQ0_spl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f434]) ).
fof(f437,definition,
( sQ1_spl
<=> neq(sK49_skl,nil) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f440,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f427,f434,f437]) ).
fof(f441,definition,
( sQ2_spl
<=> frontsegP(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f442,plain,
( ~ sQ2_spl
| frontsegP(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f441]) ).
fof(f444,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f428,f434,f441]) ).
fof(f451,plain,
! [X0,X1,X2] :
( ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f137]) ).
fof(f460,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(thm)],[f219]) ).
fof(f461,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f460]) ).
fof(f478,plain,
neq(sK50_skl,nil),
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f483,plain,
( ~ sQ0_spl
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f431,f435]) ).
fof(f486,plain,
( ~ sQ0_spl
| neq(nil,nil) ),
inference(backward_demodulation,[status(thm)],[f483,f478]) ).
fof(f493,plain,
( ~ sQ0_spl
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f486,f461]) ).
fof(f494,definition,
( sQ3_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f496,plain,
( sQ3_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f494]) ).
fof(f504,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f493,f223]) ).
fof(f505,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f504]) ).
fof(f506,plain,
! [X0] :
( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f424,f426]) ).
fof(f525,plain,
! [X0] :
( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f423,f506]) ).
fof(f526,plain,
( ~ ssList(sK49_skl)
| ~ segmentP(sK50_skl,sK49_skl)
| ~ neq(sK49_skl,nil)
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f525,f319]) ).
fof(f527,definition,
( sQ10_spl
<=> ssList(sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f529,plain,
( sQ10_spl
| ~ ssList(sK49_skl) ),
inference(component_clause,[status(thm)],[f527]) ).
fof(f530,definition,
( sQ11_spl
<=> segmentP(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ11_spl])],[split_symbol_definition]) ).
fof(f532,plain,
( sQ11_spl
| ~ segmentP(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f530]) ).
fof(f533,plain,
( ~ sQ11_spl
| ~ sQ1_spl
| ~ sQ10_spl ),
inference(split_clause,[status(thm)],[f526,f527,f437,f530]) ).
fof(f534,plain,
( sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f529,f421]) ).
fof(f535,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f534]) ).
fof(f544,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f496,f223]) ).
fof(f545,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f544]) ).
fof(f569,definition,
( sQ16_spl
<=> sK1_skl = sK0_skl ),
introduced(definition,[new_symbols(definition,[sQ16_spl])],[split_symbol_definition]) ).
fof(f570,plain,
( ~ sQ16_spl
| sK1_skl = sK0_skl ),
inference(component_clause,[status(thm)],[f569]) ).
fof(f587,definition,
( sQ19_spl
<=> ssList(sK50_skl) ),
introduced(definition,[new_symbols(definition,[sQ19_spl])],[split_symbol_definition]) ).
fof(f589,plain,
( sQ19_spl
| ~ ssList(sK50_skl) ),
inference(component_clause,[status(thm)],[f587]) ).
fof(f614,plain,
( sQ19_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f589,f422]) ).
fof(f615,plain,
sQ19_spl,
inference(contradiction_clause,[status(thm)],[f614]) ).
fof(f623,plain,
app(nil,sK49_skl) = sK49_skl,
inference(resolution,[status(thm)],[f249,f421]) ).
fof(f629,plain,
( ~ sQ2_spl
| app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)) = sK50_skl
| ~ ssList(sK49_skl)
| ~ ssList(sK50_skl) ),
inference(resolution,[status(thm)],[f123,f442]) ).
fof(f633,definition,
( sQ24_spl
<=> app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)) = sK50_skl ),
introduced(definition,[new_symbols(definition,[sQ24_spl])],[split_symbol_definition]) ).
fof(f634,plain,
( ~ sQ24_spl
| app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)) = sK50_skl ),
inference(component_clause,[status(thm)],[f633]) ).
fof(f636,plain,
( ~ sQ2_spl
| sQ24_spl
| ~ sQ10_spl
| ~ sQ19_spl ),
inference(split_clause,[status(thm)],[f629,f587,f527,f633,f441]) ).
fof(f644,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(app(nil,sK49_skl),X0),sK49_skl)
| ~ ssList(sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ),
inference(paramodulation,[status(thm)],[f623,f451]) ).
fof(f646,definition,
! [X0] :
( sQ26_spl
<=> ( ~ ssList(X0)
| segmentP(app(app(nil,sK49_skl),X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ) ),
introduced(definition,[new_symbols(definition,[sQ26_spl])],[split_symbol_definition]) ).
fof(f647,plain,
! [X0] :
( ~ sQ26_spl
| ~ ssList(X0)
| segmentP(app(app(nil,sK49_skl),X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ),
inference(component_clause,[status(thm)],[f646]) ).
fof(f649,plain,
( ~ sQ3_spl
| ~ sQ10_spl
| sQ26_spl ),
inference(split_clause,[status(thm)],[f644,f646,f527,f494]) ).
fof(f654,plain,
! [X0] :
( ~ sQ26_spl
| ~ ssList(X0)
| segmentP(app(sK49_skl,X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ),
inference(forward_demodulation,[status(thm)],[f623,f647]) ).
fof(f1003,definition,
( sQ75_spl
<=> ssList(sK5_skl(sK49_skl,sK50_skl)) ),
introduced(definition,[new_symbols(definition,[sQ75_spl])],[split_symbol_definition]) ).
fof(f1005,plain,
( sQ75_spl
| ~ ssList(sK5_skl(sK49_skl,sK50_skl)) ),
inference(component_clause,[status(thm)],[f1003]) ).
fof(f1026,plain,
( sQ75_spl
| ~ frontsegP(sK50_skl,sK49_skl)
| ~ ssList(sK49_skl)
| ~ ssList(sK50_skl) ),
inference(resolution,[status(thm)],[f1005,f122]) ).
fof(f1027,plain,
( sQ75_spl
| ~ sQ2_spl
| ~ sQ10_spl
| ~ sQ19_spl ),
inference(split_clause,[status(thm)],[f1026,f587,f527,f441,f1003]) ).
fof(f1048,plain,
( ~ sQ16_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f570,f105]) ).
fof(f1049,plain,
~ sQ16_spl,
inference(contradiction_clause,[status(thm)],[f1048]) ).
fof(f1636,plain,
( ~ sQ24_spl
| ~ sQ26_spl
| ~ ssList(sK5_skl(sK49_skl,sK50_skl))
| segmentP(app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)),sK49_skl)
| ~ ssList(sK50_skl) ),
inference(paramodulation,[status(thm)],[f634,f654]) ).
fof(f1642,definition,
( sQ163_spl
<=> segmentP(app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)),sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ163_spl])],[split_symbol_definition]) ).
fof(f1643,plain,
( ~ sQ163_spl
| segmentP(app(sK49_skl,sK5_skl(sK49_skl,sK50_skl)),sK49_skl) ),
inference(component_clause,[status(thm)],[f1642]) ).
fof(f1645,plain,
( ~ sQ24_spl
| ~ sQ26_spl
| ~ sQ75_spl
| sQ163_spl
| ~ sQ19_spl ),
inference(split_clause,[status(thm)],[f1636,f587,f1642,f1003,f646,f633]) ).
fof(f1650,plain,
( ~ sQ163_spl
| ~ sQ24_spl
| segmentP(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f634,f1643]) ).
fof(f1651,plain,
( ~ sQ163_spl
| ~ sQ24_spl
| sQ11_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f1650,f532]) ).
fof(f1652,plain,
( ~ sQ163_spl
| ~ sQ24_spl
| sQ11_spl ),
inference(contradiction_clause,[status(thm)],[f1651]) ).
fof(f1653,plain,
$false,
inference(sat_refutation,[status(thm)],[f440,f444,f505,f533,f535,f545,f615,f636,f649,f1027,f1049,f1645,f1652]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.37 % Computer : n017.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Mon Sep 21 07:49:47 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.39 % Drodi V4.1.1
% 0.13/5.45 % Refutation found
% 0.13/5.45 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/5.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/5.48 % Elapsed time: 0.088896 seconds
% 0.13/5.48 % CPU time: 0.429936 seconds
% 0.13/5.48 % Total memory used: 115.456 MB
% 0.13/5.48 % Net memory used: 114.933 MB
%------------------------------------------------------------------------------