%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC044+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 : n013.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:43 PM UTC 2026
% Result : Theorem 0.10s 0.60s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 11 unt; 0 def)
% Number of atoms : 69 ( 30 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 71 ( 24 ~; 19 |; 17 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 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 : 18 ( 14 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(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)
=> ( nil = U
| ~ rearsegP(X,W)
| U != W
| V != X
| nil != V ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f97,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil = U
| ~ rearsegP(X,W)
| U != W
| V != X
| nil != V ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f310,plain,
! [U] :
( ( rearsegP(nil,U)
<=> nil = U )
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f52]) ).
fof(f311,plain,
! [U] :
( ( ( nil != U
| rearsegP(nil,U) )
& ( nil = U
| ~ rearsegP(nil,U) ) )
| ~ ssList(U) ),
inference(NNF_transformation,[status(thm)],[f310]) ).
fof(f312,plain,
! [X0] :
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f311]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( nil != U
& rearsegP(X,W)
& U = W
& V = X
& nil = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,plain,
( nil != sK47_skl
& rearsegP(sK50_skl,sK49_skl)
& sK47_skl = sK49_skl
& sK48_skl = sK50_skl
& nil = sK48_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)],[f415]) ).
fof(f417,plain,
ssList(sK47_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f421,plain,
nil = sK48_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f422,plain,
sK48_skl = sK50_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f423,plain,
sK47_skl = sK49_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
rearsegP(sK50_skl,sK49_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f425,plain,
nil != sK47_skl,
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f466,plain,
sK48_skl != sK47_skl,
inference(forward_demodulation,[status(thm)],[f421,f425]) ).
fof(f467,plain,
rearsegP(sK48_skl,sK49_skl),
inference(forward_demodulation,[status(thm)],[f422,f424]) ).
fof(f468,plain,
rearsegP(sK48_skl,sK47_skl),
inference(forward_demodulation,[status(thm)],[f423,f467]) ).
fof(f489,plain,
! [X0] :
( nil = X0
| ~ rearsegP(sK48_skl,X0)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f421,f312]) ).
fof(f490,plain,
! [X0] :
( sK48_skl = X0
| ~ rearsegP(sK48_skl,X0)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f421,f489]) ).
fof(f493,plain,
( sK48_skl = sK47_skl
| ~ rearsegP(sK48_skl,sK47_skl) ),
inference(resolution,[status(thm)],[f490,f417]) ).
fof(f494,plain,
sK48_skl = sK47_skl,
inference(forward_subsumption_resolution,[status(thm)],[f493,f468]) ).
fof(f495,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f494,f466]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC044+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.56 % Computer : n013.cluster.edu
% 0.10/0.56 % Model : x86_64 x86_64
% 0.10/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.56 % Memory : 8046.5625MB
% 0.10/0.56 % OS : Linux 6.8.0-71-generic
% 0.10/0.56 % CPULimit : 300
% 0.10/0.56 % WCLimit : 300
% 0.10/0.56 % DateTime : Mon Sep 21 07:51:07 UTC 2026
% 0.10/0.56 % CPUTime :
% 0.10/0.58 % Drodi V4.1.1
% 0.10/0.60 % Refutation found
% 0.10/0.60 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.60 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.63 % Elapsed time: 0.058263 seconds
% 0.14/0.63 % CPU time: 0.151521 seconds
% 0.14/0.63 % Total memory used: 86.137 MB
% 0.14/0.63 % Net memory used: 86.014 MB
%------------------------------------------------------------------------------