%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC207+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 : n010.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:23 PM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 14 unt; 1 def)
% Number of atoms : 192 ( 63 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 230 ( 78 ~; 72 |; 63 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-3 aty)
% Number of variables : 67 ( 53 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
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(f18,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> cons(V,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 )
& ! [Y] :
( ssItem(Y)
=> ( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W ) ) )
| neq(U,nil)
| ~ 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 )
& ! [Y] :
( ssItem(Y)
=> ( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W ) ) )
| neq(U,nil)
| ~ neq(V,nil)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(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(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(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] :
( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) ) )
& ~ neq(U,nil)
& 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,Y] :
( sP0_prd(Y,X,W)
<=> ( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) ) ),
introduced(definition,[new_symbols(definition,[sP0_prd])],[]) ).
fof(f417,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil = W
& nil = X )
| ? [Y] : sP0_prd(Y,X,W) )
& ~ neq(U,nil)
& 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,
( ( ( nil = sK49_skl
& nil = sK50_skl )
| sP0_prd(sK51_skl,sK50_skl,sK49_skl) )
& ~ neq(sK47_skl,nil)
& 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(Y,sK51_skl)],[f417]) ).
fof(f421,plain,
ssList(sK49_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,
~ neq(sK47_skl,nil),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
( nil = sK50_skl
| sP0_prd(sK51_skl,sK50_skl,sK49_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f429,plain,
! [W,X,Y] :
( ( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ( ( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(NNF_transformation,[status(thm)],[f416]) ).
fof(f430,plain,
( ! [W,X,Y] :
( ? [Z] :
( leq(Y,Z)
& memberP(X,Z)
& Y != Z
& ssItem(Z) )
| ~ memberP(X,Y)
| cons(Y,nil) != W
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ! [W,X,Y] :
( ( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(miniscoping,[status(thm)],[f429]) ).
fof(f431,plain,
( ! [W,X,Y] :
( ( leq(Y,sK52_skl(Y,X,W))
& memberP(X,sK52_skl(Y,X,W))
& Y != sK52_skl(Y,X,W)
& ssItem(sK52_skl(Y,X,W)) )
| ~ memberP(X,Y)
| cons(Y,nil) != W
| ~ ssItem(Y)
| sP0_prd(Y,X,W) )
& ! [W,X,Y] :
( ( ! [Z] :
( ~ leq(Y,Z)
| ~ memberP(X,Z)
| Y = Z
| ~ ssItem(Z) )
& memberP(X,Y)
& cons(Y,nil) = W
& ssItem(Y) )
| ~ sP0_prd(Y,X,W) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK52_skl]),skolemize(Z,sK52_skl(Y,X,W))],[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(f476,plain,
neq(sK50_skl,nil),
inference(forward_demodulation,[status(thm)],[f423,f425]) ).
fof(f477,plain,
~ neq(sK49_skl,nil),
inference(forward_demodulation,[status(thm)],[f424,f426]) ).
fof(f480,plain,
( cons(sK51_skl,nil) = sK49_skl
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f427,f433]) ).
fof(f482,plain,
( ssItem(sK51_skl)
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f427,f432]) ).
fof(f484,plain,
( sK49_skl = nil
| ~ ssList(nil)
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f220,f477]) ).
fof(f487,plain,
( sK49_skl = nil
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[status(thm)],[f484,f421]) ).
fof(f491,plain,
~ neq(nil,nil),
inference(backward_demodulation,[status(thm)],[f494,f477]) ).
fof(f494,plain,
sK49_skl = nil,
inference(forward_subsumption_resolution,[status(thm)],[f487,f223]) ).
fof(f501,plain,
( cons(sK51_skl,nil) = nil
| nil = sK50_skl ),
inference(forward_demodulation,[status(thm)],[f494,f480]) ).
fof(f502,plain,
( ~ ssItem(sK51_skl)
| ~ ssList(nil)
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f501,f225]) ).
fof(f509,plain,
( ~ ssItem(sK51_skl)
| nil = sK50_skl ),
inference(forward_subsumption_resolution,[status(thm)],[f502,f223]) ).
fof(f520,plain,
neq(nil,nil),
inference(backward_demodulation,[status(thm)],[f523,f476]) ).
fof(f523,plain,
nil = sK50_skl,
inference(forward_subsumption_resolution,[status(thm)],[f509,f482]) ).
fof(f524,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f520,f491]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC207+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n010.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 08:05:10 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Drodi V4.1.1
% 0.10/0.40 % Refutation found
% 0.10/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.10/0.43 % Elapsed time: 0.064922 seconds
% 0.10/0.43 % CPU time: 0.177236 seconds
% 0.10/0.43 % Total memory used: 110.920 MB
% 0.10/0.43 % Net memory used: 110.753 MB
%------------------------------------------------------------------------------