%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC208+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:40:23 PM UTC 2026
% Result : Theorem 0.19s 5.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 10 unt; 3 def)
% Number of atoms : 130 ( 35 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 148 ( 54 ~; 43 |; 36 &)
% ( 5 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 28 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
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 ) )
| 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)
=> ( ( ( ~ frontsegP(X,W)
| ~ neq(W,nil) )
& ( nil != W
| nil != X ) )
| 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(f219,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f218]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( frontsegP(X,W)
& neq(W,nil) )
| ( nil = W
& nil = X ) )
& ~ 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] :
( 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) )
& ~ 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,
( ( ( frontsegP(sK50_skl,sK49_skl)
& neq(sK49_skl,nil) )
| sP0_prd(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]),skolemize(U,sK47_skl),skolemize(V,sK48_skl),skolemize(W,sK49_skl),skolemize(X,sK50_skl)],[f417]) ).
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,
~ neq(sK47_skl,nil),
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(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(f438,plain,
( ~ sQ1_spl
| neq(sK49_skl,nil) ),
inference(component_clause,[status(thm)],[f437]) ).
fof(f440,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f427,f434,f437]) ).
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(f479,plain,
~ neq(sK49_skl,nil),
inference(forward_demodulation,[status(thm)],[f424,f426]) ).
fof(f480,plain,
( ~ sQ0_spl
| nil = sK50_skl ),
inference(resolution,[status(thm)],[f431,f435]) ).
fof(f485,plain,
( ~ sQ0_spl
| neq(sK50_skl,sK50_skl) ),
inference(backward_demodulation,[status(thm)],[f480,f478]) ).
fof(f513,plain,
( ~ sQ0_spl
| ~ ssList(sK50_skl) ),
inference(resolution,[status(thm)],[f485,f461]) ).
fof(f515,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f513,f422]) ).
fof(f516,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f515]) ).
fof(f518,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f479,f438]) ).
fof(f519,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f518]) ).
fof(f520,plain,
$false,
inference(sat_refutation,[status(thm)],[f440,f516,f519]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC208+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/5.46 % Computer : n014.cluster.edu
% 0.19/5.46 % Model : x86_64 x86_64
% 0.19/5.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.46 % Memory : 8046.5625MB
% 0.19/5.46 % OS : Linux 6.8.0-71-generic
% 0.19/5.46 % CPULimit : 300
% 0.19/5.46 % WCLimit : 300
% 0.19/5.46 % DateTime : Mon Sep 21 08:04:39 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.48 % Drodi V4.1.1
% 0.19/5.49 % Refutation found
% 0.19/5.49 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/5.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/5.57 % Elapsed time: 0.097442 seconds
% 0.23/5.57 % CPU time: 0.093243 seconds
% 0.23/5.57 % Total memory used: 3.485 MB
% 0.23/5.57 % Net memory used: 3.481 MB
%------------------------------------------------------------------------------