%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC100+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 : 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:39:57 PM UTC 2026
% Result : Theorem 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of formulae : 65 ( 17 unt; 1 def)
% Number of atoms : 301 ( 102 equ)
% Maximal formula atoms : 23 ( 4 avg)
% Number of connectives : 374 ( 138 ~; 134 |; 80 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 96 ( 70 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( frontsegP(U,V)
<=> ? [W] :
( app(V,W) = 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(f46,axiom,
! [U] :
( ssList(U)
=> ( frontsegP(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)
=> ( ( ( ( frontsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( lt(X2,Z)
& app(X3,cons(X2,nil)) = W
& ssList(X3) )
& ssItem(X2) )
& app(cons(Z,nil),X1) = Y
& ssList(X1) )
& ssItem(Z) )
| ~ strictorderedP(W)
| app(W,Y) != X ) )
| 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)
=> ( ( ( ( frontsegP(V,U)
& neq(U,nil) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| ( nil = W
& nil != X )
| ! [Y] :
( ssList(Y)
=> ( ? [Z] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( lt(X2,Z)
& app(X3,cons(X2,nil)) = W
& ssList(X3) )
& ssItem(X2) )
& app(cons(Z,nil),X1) = Y
& ssList(X1) )
& ssItem(Z) )
| ~ strictorderedP(W)
| app(W,Y) != X ) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f124,plain,
! [X0,X1,X2] :
( app(X1,X2) != X0
| ~ ssList(X2)
| frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f121]) ).
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(f296,plain,
! [U] :
( ( frontsegP(nil,U)
<=> nil = U )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f46]) ).
fof(f297,plain,
! [U] :
( ( ( nil != U
| frontsegP(nil,U) )
& ( nil = U
| ~ frontsegP(nil,U) ) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f296]) ).
fof(f298,plain,
! [X0] :
( nil = X0
| ~ frontsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f297]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ frontsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& ( nil != W
| nil = X )
& ? [Y] :
( ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ lt(X2,Z)
| app(X3,cons(X2,nil)) != W
| ~ ssList(X3) )
| ~ ssItem(X2) )
| app(cons(Z,nil),X1) != Y
| ~ ssList(X1) )
| ~ ssItem(Z) )
& strictorderedP(W)
& app(W,Y) = X
& ssList(Y) )
& 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,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ frontsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| sP0_prd(V,U) )
& ( nil != W
| nil = X )
& ? [Y] :
( ! [Z] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ~ lt(X2,Z)
| app(X3,cons(X2,nil)) != W
| ~ ssList(X3) )
| ~ ssItem(X2) )
| app(cons(Z,nil),X1) != Y
| ~ ssList(X1) )
| ~ ssItem(Z) )
& strictorderedP(W)
& app(W,Y) = X
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ( ~ frontsegP(V,U)
| ~ neq(U,nil) )
& neq(V,nil) )
| sP0_prd(V,U) )
& ( nil != W
| nil = X )
& ? [Y] :
( ! [Z] :
( ! [X2] :
( ~ lt(X2,Z)
| ! [X3] :
( app(X3,cons(X2,nil)) != W
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ! [X1] :
( app(cons(Z,nil),X1) != Y
| ~ ssList(X1) )
| ~ ssItem(Z) )
& strictorderedP(W)
& app(W,Y) = X
& ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(miniscoping,[status(thm)],[f417]) ).
fof(f419,plain,
( ( ( ( ~ frontsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) )
& neq(sK48_skl,nil) )
| sP0_prd(sK48_skl,sK47_skl) )
& ( nil != sK49_skl
| nil = sK50_skl )
& ! [Z] :
( ! [X2] :
( ~ lt(X2,Z)
| ! [X3] :
( app(X3,cons(X2,nil)) != sK49_skl
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ! [X1] :
( app(cons(Z,nil),X1) != sK51_skl
| ~ ssList(X1) )
| ~ ssItem(Z) )
& strictorderedP(sK49_skl)
& app(sK49_skl,sK51_skl) = sK50_skl
& ssList(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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl),skolemize(Y,sK51_skl)],[f418]) ).
fof(f420,plain,
ssList(sK47_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f421,plain,
ssList(sK48_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,
ssList(sK51_skl),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f427,plain,
app(sK49_skl,sK51_skl) = sK50_skl,
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f430,plain,
( nil != sK49_skl
| nil = sK50_skl ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f431,plain,
( neq(sK48_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f432,plain,
( ~ frontsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f419]) ).
fof(f433,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(f434,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)],[f433]) ).
fof(f435,plain,
! [X0,X1] :
( nil = X0
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f434]) ).
fof(f436,plain,
! [X0,X1] :
( nil != X1
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f434]) ).
fof(f442,plain,
! [X0,X1] :
( ~ ssList(X1)
| frontsegP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(app(X0,X1)) ),
inference(destructive_equality_resolution,[status(thm)],[f124]) ).
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(f468,plain,
! [X0] : ~ sP0_prd(X0,nil),
inference(destructive_equality_resolution,[status(thm)],[f436]) ).
fof(f474,plain,
app(sK47_skl,sK51_skl) = sK50_skl,
inference(forward_demodulation,[status(thm)],[f425,f427]) ).
fof(f475,plain,
app(sK47_skl,sK51_skl) = sK48_skl,
inference(forward_demodulation,[status(thm)],[f424,f474]) ).
fof(f478,plain,
( nil != sK49_skl
| nil = sK48_skl ),
inference(forward_demodulation,[status(thm)],[f424,f430]) ).
fof(f479,plain,
( nil != sK47_skl
| nil = sK48_skl ),
inference(forward_demodulation,[status(thm)],[f425,f478]) ).
fof(f480,plain,
( ~ ssList(sK51_skl)
| frontsegP(sK48_skl,sK47_skl)
| ~ ssList(sK47_skl)
| ~ ssList(app(sK47_skl,sK51_skl)) ),
inference(paramodulation,[status(thm)],[f475,f442]) ).
fof(f481,plain,
( ~ ssList(sK51_skl)
| frontsegP(sK48_skl,sK47_skl)
| ~ ssList(sK47_skl)
| ~ ssList(sK48_skl) ),
inference(forward_demodulation,[status(thm)],[f475,f480]) ).
fof(f482,plain,
( ~ ssList(sK51_skl)
| frontsegP(sK48_skl,sK47_skl)
| ~ ssList(sK47_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f481,f421]) ).
fof(f486,plain,
( ~ ssList(sK51_skl)
| frontsegP(sK48_skl,sK47_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f482,f420]) ).
fof(f487,plain,
( nil = sK48_skl
| ~ frontsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) ),
inference(resolution,[status(thm)],[f432,f435]) ).
fof(f496,plain,
( sK47_skl = nil
| ~ ssList(nil)
| ~ ssList(sK47_skl)
| nil = sK48_skl
| ~ frontsegP(sK48_skl,sK47_skl) ),
inference(resolution,[status(thm)],[f487,f220]) ).
fof(f498,plain,
( sK47_skl = nil
| ~ ssList(nil)
| nil = sK48_skl
| ~ frontsegP(sK48_skl,sK47_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f496,f420]) ).
fof(f500,plain,
( sK47_skl = nil
| nil = sK48_skl
| ~ frontsegP(sK48_skl,sK47_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f498,f223]) ).
fof(f501,plain,
( ~ ssList(sK51_skl)
| sK47_skl = nil
| nil = sK48_skl ),
inference(resolution,[status(thm)],[f500,f486]) ).
fof(f502,plain,
( ~ ssList(sK51_skl)
| nil = sK48_skl ),
inference(forward_subsumption_resolution,[status(thm)],[f501,f479]) ).
fof(f506,plain,
( ~ ssList(sK51_skl)
| frontsegP(nil,sK47_skl) ),
inference(backward_demodulation,[status(thm)],[f513,f486]) ).
fof(f508,plain,
( neq(nil,nil)
| sP0_prd(sK48_skl,sK47_skl) ),
inference(backward_demodulation,[status(thm)],[f513,f431]) ).
fof(f513,plain,
nil = sK48_skl,
inference(forward_subsumption_resolution,[status(thm)],[f502,f426]) ).
fof(f515,plain,
frontsegP(nil,sK47_skl),
inference(forward_subsumption_resolution,[status(thm)],[f506,f426]) ).
fof(f516,plain,
( neq(nil,nil)
| sP0_prd(nil,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f513,f508]) ).
fof(f519,plain,
( nil = sK47_skl
| ~ ssList(sK47_skl) ),
inference(resolution,[status(thm)],[f515,f298]) ).
fof(f520,plain,
nil = sK47_skl,
inference(forward_subsumption_resolution,[status(thm)],[f519,f420]) ).
fof(f553,plain,
( neq(nil,nil)
| sP0_prd(nil,nil) ),
inference(forward_demodulation,[status(thm)],[f520,f516]) ).
fof(f554,plain,
neq(nil,nil),
inference(forward_subsumption_resolution,[status(thm)],[f553,f468]) ).
fof(f555,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[f554,f454]) ).
fof(f557,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f555,f223]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC100+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n018.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Mon Sep 21 07:57:28 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.36 % Drodi V4.1.1
% 0.11/0.39 % Refutation found
% 0.11/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.42 % Elapsed time: 0.070237 seconds
% 0.11/0.42 % CPU time: 0.189422 seconds
% 0.11/0.42 % Total memory used: 111.172 MB
% 0.11/0.42 % Net memory used: 110.989 MB
%------------------------------------------------------------------------------