%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC411+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 : n017.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:41:08 PM UTC 2026
% Result : Theorem 0.22s 0.55s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 10 unt; 2 def)
% Number of atoms : 77 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 79 ( 25 ~; 20 |; 22 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 13 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ! [Z] :
( ssItem(Z)
=> ( memberP(U,Z)
| ~ memberP(V,Z) ) )
| ? [Y] :
( memberP(X,Y)
& ~ memberP(W,Y)
& ssItem(Y) )
| 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)
=> ( ! [Z] :
( ssItem(Z)
=> ( memberP(U,Z)
| ~ memberP(V,Z) ) )
| ? [Y] :
( memberP(X,Y)
& ~ memberP(W,Y)
& ssItem(Y) )
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ? [Z] :
( ~ memberP(U,Z)
& memberP(V,Z)
& ssItem(Z) )
& ! [Y] :
( ~ memberP(X,Y)
| memberP(W,Y)
| ~ ssItem(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,plain,
( ~ memberP(sK47_skl,sK51_skl)
& memberP(sK48_skl,sK51_skl)
& ssItem(sK51_skl)
& ! [Y] :
( ~ memberP(sK50_skl,Y)
| memberP(sK49_skl,Y)
| ~ ssItem(Y) )
& 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)],[f415]) ).
fof(f421,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f422,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f423,plain,
! [X0] :
( ~ memberP(sK50_skl,X0)
| memberP(sK49_skl,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
ssItem(sK51_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f425,plain,
memberP(sK48_skl,sK51_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f426,plain,
~ memberP(sK47_skl,sK51_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f459,plain,
memberP(sK50_skl,sK51_skl),
inference(forward_demodulation,[status(thm)],[f421,f425]) ).
fof(f460,plain,
~ memberP(sK49_skl,sK51_skl),
inference(forward_demodulation,[status(thm)],[f422,f426]) ).
fof(f461,plain,
( memberP(sK49_skl,sK51_skl)
| ~ ssItem(sK51_skl) ),
inference(resolution,[status(thm)],[f423,f459]) ).
fof(f462,definition,
( sQ0_spl
<=> ssItem(sK51_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f464,plain,
( sQ0_spl
| ~ ssItem(sK51_skl) ),
inference(component_clause,[status(thm)],[f462]) ).
fof(f465,definition,
( sQ1_spl
<=> memberP(sK49_skl,sK51_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f466,plain,
( ~ sQ1_spl
| memberP(sK49_skl,sK51_skl) ),
inference(component_clause,[status(thm)],[f465]) ).
fof(f468,plain,
( sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f461,f462,f465]) ).
fof(f469,plain,
( sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f464,f424]) ).
fof(f470,plain,
sQ0_spl,
inference(contradiction_clause,[status(thm)],[f469]) ).
fof(f471,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f466,f460]) ).
fof(f472,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f471]) ).
fof(f473,plain,
$false,
inference(sat_refutation,[status(thm)],[f468,f470,f472]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC411+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 % Computer : n017.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Mon Sep 21 08:17:42 UTC 2026
% 0.18/0.49 % CPUTime :
% 0.18/0.54 % Drodi V4.1.1
% 0.22/0.55 % Refutation found
% 0.22/0.55 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.22/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.61 % Elapsed time: 0.114204 seconds
% 0.22/0.61 % CPU time: 0.121361 seconds
% 0.22/0.61 % Total memory used: 10.363 MB
% 0.22/0.61 % Net memory used: 10.346 MB
%------------------------------------------------------------------------------