%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC092+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:39:55 PM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 85 ( 16 unt; 10 def)
% Number of atoms : 344 ( 66 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 430 ( 171 ~; 162 |; 67 &)
% ( 14 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 11 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 99 ( 73 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
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)
=> ( ( nil = W
& nil != X )
| ! [Z] :
( ssList(Z)
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( lt(X3,X1)
& app(X4,cons(X3,nil)) = W
& ssList(X4) )
& ssItem(X3) )
& app(cons(X1,nil),X2) = Z
& ssList(X2) )
& ssItem(X1) )
| ~ strictorderedP(W)
| app(W,Z) != 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)
=> ( ( nil = W
& nil != X )
| ! [Z] :
( ssList(Z)
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( lt(X3,X1)
& app(X4,cons(X3,nil)) = W
& ssList(X4) )
& ssItem(X3) )
& app(cons(X1,nil),X2) = Z
& ssList(X2) )
& ssItem(X1) )
| ~ strictorderedP(W)
| app(W,Z) != 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(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(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(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] :
( ( nil != W
| nil = X )
& ? [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ~ lt(X3,X1)
| app(X4,cons(X3,nil)) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| app(cons(X1,nil),X2) != Z
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(W)
& app(W,Z) = X
& ssList(Z) )
& ! [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,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( nil != W
| nil = X )
& ? [Z] :
( ! [X1] :
( ! [X3] :
( ~ lt(X3,X1)
| ! [X4] :
( app(X4,cons(X3,nil)) != W
| ~ ssList(X4) )
| ~ ssItem(X3) )
| ! [X2] :
( app(cons(X1,nil),X2) != Z
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(W)
& app(W,Z) = X
& ssList(Z) )
& ! [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(miniscoping,[status(thm)],[f415]) ).
fof(f417,plain,
( ( nil != sK49_skl
| nil = sK50_skl )
& ! [X1] :
( ! [X3] :
( ~ lt(X3,X1)
| ! [X4] :
( app(X4,cons(X3,nil)) != sK49_skl
| ~ ssList(X4) )
| ~ ssItem(X3) )
| ! [X2] :
( app(cons(X1,nil),X2) != sK51_skl
| ~ ssList(X2) )
| ~ ssItem(X1) )
& strictorderedP(sK49_skl)
& app(sK49_skl,sK51_skl) = sK50_skl
& ssList(sK51_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,sK51_skl]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Z,sK51_skl)],[f416]) ).
fof(f420,plain,
ssList(sK49_skl),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f421,plain,
ssList(sK50_skl),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f422,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f423,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f424,plain,
neq(sK48_skl,nil),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f425,plain,
! [X0] :
( ~ segmentP(sK47_skl,X0)
| ~ segmentP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f426,plain,
ssList(sK51_skl),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f427,plain,
app(sK49_skl,sK51_skl) = sK50_skl,
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f430,plain,
( nil != sK49_skl
| nil = sK50_skl ),
inference(cnf_transformation,[status(thm)],[f417]) ).
fof(f431,definition,
( sQ0_spl
<=> nil = sK50_skl ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f432,plain,
( ~ sQ0_spl
| nil = sK50_skl ),
inference(component_clause,[status(thm)],[f431]) ).
fof(f434,definition,
( sQ1_spl
<=> nil = sK49_skl ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f437,plain,
( ~ sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f430,f431,f434]) ).
fof(f444,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(f453,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(destructive_equality_resolution,[status(thm)],[f219]) ).
fof(f454,plain,
! [X0] :
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f453]) ).
fof(f470,plain,
( ~ sQ0_spl
| sK48_skl = nil ),
inference(backward_demodulation,[status(thm)],[f432,f422]) ).
fof(f472,plain,
( ~ sQ0_spl
| neq(nil,nil) ),
inference(forward_demodulation,[status(thm)],[f470,f424]) ).
fof(f480,plain,
( ~ sQ0_spl
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[f454,f472]) ).
fof(f481,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f480,f223]) ).
fof(f482,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f481]) ).
fof(f483,plain,
! [X0] :
( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f489,definition,
( sQ3_spl
<=> ssList(sK51_skl) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f491,plain,
( sQ3_spl
| ~ ssList(sK51_skl) ),
inference(component_clause,[status(thm)],[f489]) ).
fof(f492,definition,
( sQ4_spl
<=> ssList(sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f494,plain,
( sQ4_spl
| ~ ssList(sK49_skl) ),
inference(component_clause,[status(thm)],[f492]) ).
fof(f496,plain,
( sQ4_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f494,f420]) ).
fof(f497,plain,
sQ4_spl,
inference(contradiction_clause,[status(thm)],[f496]) ).
fof(f504,plain,
app(nil,sK49_skl) = sK49_skl,
inference(resolution,[status(thm)],[f249,f420]) ).
fof(f509,definition,
( sQ6_spl
<=> ssList(sK50_skl) ),
introduced(definition,[new_symbols(definition,[sQ6_spl])],[split_symbol_definition]) ).
fof(f511,plain,
( sQ6_spl
| ~ ssList(sK50_skl) ),
inference(component_clause,[status(thm)],[f509]) ).
fof(f512,definition,
( sQ7_spl
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f514,plain,
( sQ7_spl
| ~ ssList(nil) ),
inference(component_clause,[status(thm)],[f512]) ).
fof(f516,plain,
( sQ7_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f514,f223]) ).
fof(f517,plain,
sQ7_spl,
inference(contradiction_clause,[status(thm)],[f516]) ).
fof(f524,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f491,f426]) ).
fof(f525,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f524]) ).
fof(f533,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)],[f504,f444]) ).
fof(f534,definition,
! [X0] :
( sQ10_spl
<=> ( ~ ssList(X0)
| segmentP(app(app(nil,sK49_skl),X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f535,plain,
! [X0] :
( ~ sQ10_spl
| ~ ssList(X0)
| segmentP(app(app(nil,sK49_skl),X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ),
inference(component_clause,[status(thm)],[f534]) ).
fof(f537,plain,
( ~ sQ7_spl
| ~ sQ4_spl
| sQ10_spl ),
inference(split_clause,[status(thm)],[f533,f534,f492,f512]) ).
fof(f538,plain,
! [X0] :
( ~ sQ10_spl
| ~ ssList(X0)
| segmentP(app(sK49_skl,X0),sK49_skl)
| ~ ssList(app(sK49_skl,X0)) ),
inference(forward_demodulation,[status(thm)],[f504,f535]) ).
fof(f539,plain,
! [X0] :
( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f422,f483]) ).
fof(f548,plain,
( sQ6_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f511,f421]) ).
fof(f549,plain,
sQ6_spl,
inference(contradiction_clause,[status(thm)],[f548]) ).
fof(f584,plain,
! [X0] :
( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| ~ ssList(X0)
| X0 = nil
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[f220,f539]) ).
fof(f600,definition,
! [X0] :
( sQ21_spl
<=> ( ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| ~ ssList(X0)
| X0 = nil
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ21_spl])],[split_symbol_definition]) ).
fof(f601,plain,
! [X0] :
( ~ sQ21_spl
| ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| ~ ssList(X0)
| X0 = nil
| ~ ssList(X0) ),
inference(component_clause,[status(thm)],[f600]) ).
fof(f603,plain,
( ~ sQ7_spl
| sQ21_spl ),
inference(split_clause,[status(thm)],[f584,f600,f512]) ).
fof(f604,plain,
! [X0] :
( ~ sQ21_spl
| ~ segmentP(sK49_skl,X0)
| ~ segmentP(sK50_skl,X0)
| X0 = nil
| ~ ssList(X0) ),
inference(duplicate_literals_removal,[status(thm)],[f601]) ).
fof(f624,plain,
( ~ sQ21_spl
| ~ ssList(sK49_skl)
| ~ segmentP(sK50_skl,sK49_skl)
| sK49_skl = nil
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f604,f319]) ).
fof(f632,definition,
( sQ26_spl
<=> segmentP(sK50_skl,sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ26_spl])],[split_symbol_definition]) ).
fof(f634,plain,
( sQ26_spl
| ~ segmentP(sK50_skl,sK49_skl) ),
inference(component_clause,[status(thm)],[f632]) ).
fof(f635,plain,
( ~ sQ21_spl
| ~ sQ26_spl
| sQ1_spl
| ~ sQ4_spl ),
inference(split_clause,[status(thm)],[f624,f492,f434,f632,f600]) ).
fof(f643,plain,
( ~ sQ10_spl
| ~ ssList(sK51_skl)
| segmentP(app(sK49_skl,sK51_skl),sK49_skl)
| ~ ssList(sK50_skl) ),
inference(paramodulation,[status(thm)],[f427,f538]) ).
fof(f648,definition,
( sQ29_spl
<=> segmentP(app(sK49_skl,sK51_skl),sK49_skl) ),
introduced(definition,[new_symbols(definition,[sQ29_spl])],[split_symbol_definition]) ).
fof(f649,plain,
( ~ sQ29_spl
| segmentP(app(sK49_skl,sK51_skl),sK49_skl) ),
inference(component_clause,[status(thm)],[f648]) ).
fof(f651,plain,
( ~ sQ10_spl
| ~ sQ3_spl
| sQ29_spl
| ~ sQ6_spl ),
inference(split_clause,[status(thm)],[f643,f509,f648,f489,f534]) ).
fof(f653,plain,
( ~ sQ29_spl
| segmentP(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f427,f649]) ).
fof(f654,plain,
( ~ sQ29_spl
| sQ26_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f653,f634]) ).
fof(f655,plain,
( ~ sQ29_spl
| sQ26_spl ),
inference(contradiction_clause,[status(thm)],[f654]) ).
fof(f656,plain,
$false,
inference(sat_refutation,[status(thm)],[f437,f482,f497,f517,f525,f537,f549,f603,f635,f651,f655]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC092+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/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 07:54:34 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.13/0.39 % Refutation found
% 0.13/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.42 % Elapsed time: 0.060728 seconds
% 0.13/0.42 % CPU time: 0.169070 seconds
% 0.13/0.42 % Total memory used: 76.494 MB
% 0.13/0.42 % Net memory used: 76.341 MB
%------------------------------------------------------------------------------