%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC026+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 : n002.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:39 PM UTC 2026
% Result : Theorem 0.14s 5.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of formulae : 34 ( 10 unt; 1 def)
% Number of atoms : 125 ( 81 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 136 ( 45 ~; 43 |; 39 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 31 ( 23 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( nil = V
| nil != U )
& ( nil = U
| nil != V ) )
| ( nil = X
& nil != W )
| ( nil = W
& nil != X )
| 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 = V
| nil != U )
& ( nil = U
| nil != V ) )
| ( nil = X
& nil != W )
| ( nil = W
& nil != X )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( nil != V
& nil = U )
| ( nil != U
& nil = V ) )
& ( nil != X
| nil = W )
& ( nil != W
| nil = X )
& 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] :
( ( ( nil != V
& nil = U )
| sP0_prd(V,U) )
& ( nil != X
| nil = W )
& ( nil != W
| nil = X )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(formula_renaming,[status(thm)],[f415,f416]) ).
fof(f418,plain,
( ( ( nil != sK48_skl
& nil = sK47_skl )
| sP0_prd(sK48_skl,sK47_skl) )
& ( nil != sK50_skl
| nil = sK49_skl )
& ( nil != sK49_skl
| nil = sK50_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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f417]) ).
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,
( nil != sK49_skl
| nil = sK50_skl ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f426,plain,
( nil != sK50_skl
| nil = sK49_skl ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f427,plain,
( nil = sK47_skl
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f428,plain,
( nil != sK48_skl
| sP0_prd(sK48_skl,sK47_skl) ),
inference(cnf_transformation,[status(thm)],[f418]) ).
fof(f429,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(f430,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)],[f429]) ).
fof(f431,plain,
! [X0,X1] :
( nil = X0
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f430]) ).
fof(f432,plain,
! [X0,X1] :
( nil != X1
| ~ sP0_prd(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f430]) ).
fof(f464,plain,
! [X0] : ~ sP0_prd(X0,nil),
inference(destructive_equality_resolution,[status(thm)],[f432]) ).
fof(f469,plain,
( nil = sK47_skl
| sP0_prd(sK50_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f427]) ).
fof(f470,plain,
( nil = sK47_skl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f469]) ).
fof(f471,plain,
( nil = sK49_skl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f470]) ).
fof(f472,plain,
( nil = sK50_skl
| nil = sK49_skl ),
inference(resolution,[status(thm)],[f471,f431]) ).
fof(f473,plain,
nil = sK50_skl,
inference(forward_subsumption_resolution,[status(thm)],[f472,f425]) ).
fof(f476,plain,
! [X0] : ~ sP0_prd(X0,sK50_skl),
inference(backward_demodulation,[status(thm)],[f473,f464]) ).
fof(f480,plain,
( sK50_skl != sK50_skl
| nil = sK49_skl ),
inference(backward_demodulation,[status(thm)],[f473,f426]) ).
fof(f483,plain,
( sK50_skl != sK50_skl
| sK50_skl = sK49_skl ),
inference(forward_demodulation,[status(thm)],[f473,f480]) ).
fof(f484,plain,
sK50_skl = sK49_skl,
inference(trivial_equality_resolution,[status(thm)],[f483]) ).
fof(f485,plain,
( nil != sK48_skl
| sP0_prd(sK50_skl,sK47_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f428]) ).
fof(f486,plain,
( nil != sK48_skl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f424,f485]) ).
fof(f487,plain,
( sK50_skl != sK48_skl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f473,f486]) ).
fof(f488,plain,
( sK50_skl != sK50_skl
| sP0_prd(sK50_skl,sK49_skl) ),
inference(forward_demodulation,[status(thm)],[f423,f487]) ).
fof(f489,plain,
sP0_prd(sK50_skl,sK49_skl),
inference(trivial_equality_resolution,[status(thm)],[f488]) ).
fof(f503,plain,
sP0_prd(sK49_skl,sK49_skl),
inference(backward_demodulation,[status(thm)],[f484,f489]) ).
fof(f513,plain,
! [X0] : ~ sP0_prd(X0,sK49_skl),
inference(forward_demodulation,[status(thm)],[f484,f476]) ).
fof(f514,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f503,f513]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC026+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.37 % Computer : n002.cluster.edu
% 0.11/5.37 % Model : x86_64 x86_64
% 0.11/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.37 % Memory : 8046.5625MB
% 0.11/5.37 % OS : Linux 6.8.0-71-generic
% 0.11/5.37 % CPULimit : 300
% 0.11/5.37 % WCLimit : 300
% 0.11/5.37 % DateTime : Mon Sep 21 07:52:53 UTC 2026
% 0.11/5.37 % CPUTime :
% 0.11/5.39 % Drodi V4.1.1
% 0.14/5.40 % Refutation found
% 0.14/5.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.44 % Elapsed time: 0.060933 seconds
% 0.14/5.44 % CPU time: 0.122880 seconds
% 0.14/5.44 % Total memory used: 13.843 MB
% 0.14/5.44 % Net memory used: 13.822 MB
%------------------------------------------------------------------------------