%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC049+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 : n019.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:44 PM UTC 2026
% Result : Theorem 0.09s 0.41s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 11 unt; 0 def)
% Number of atoms : 145 ( 44 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 177 ( 72 ~; 59 |; 33 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 28 ( 22 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> U != V ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f49,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f96,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& neq(X,nil) )
| ( nil = U
& nil = V )
| ( nil = X
& nil != W )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(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)
=> ( ( ( ~ rearsegP(X,W)
| ~ neq(W,nil) )
& neq(X,nil) )
| ( nil = U
& nil = V )
| ( nil = X
& nil != W )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| 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(f304,plain,
! [U] :
( rearsegP(U,U)
| ~ ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f49]) ).
fof(f305,plain,
! [X0] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f304]) ).
fof(f415,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( rearsegP(X,W)
& neq(W,nil) )
| ~ neq(X,nil) )
& ( nil != U
| nil != V )
& ( nil != X
| nil = W )
& ! [Y] :
( ~ rearsegP(U,Y)
| ~ rearsegP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(pre_NNF_transformation,[status(thm)],[f97]) ).
fof(f416,plain,
( ( ( rearsegP(sK50_skl,sK49_skl)
& neq(sK49_skl,nil) )
| ~ neq(sK50_skl,nil) )
& ( nil != sK47_skl
| nil != sK48_skl )
& ( nil != sK50_skl
| nil = sK49_skl )
& ! [Y] :
( ~ rearsegP(sK47_skl,Y)
| ~ rearsegP(sK48_skl,Y)
| ~ neq(Y,nil)
| ~ ssList(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]),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(f418,plain,
ssList(sK48_skl),
inference(cnf_transformation,[status(thm)],[f416]) ).
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] :
( ~ rearsegP(sK47_skl,X0)
| ~ rearsegP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
( nil != sK50_skl
| nil = sK49_skl ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f425,plain,
( nil != sK47_skl
| nil != sK48_skl ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f426,plain,
( neq(sK49_skl,nil)
| ~ neq(sK50_skl,nil) ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f427,plain,
( rearsegP(sK50_skl,sK49_skl)
| ~ neq(sK50_skl,nil) ),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f464,plain,
( nil != sK50_skl
| nil = sK47_skl ),
inference(forward_demodulation,[status(thm)],[f422,f424]) ).
fof(f465,plain,
( nil != sK48_skl
| nil = sK47_skl ),
inference(forward_demodulation,[status(thm)],[f421,f464]) ).
fof(f466,plain,
nil != sK48_skl,
inference(forward_subsumption_resolution,[status(thm)],[f425,f465]) ).
fof(f467,plain,
( ~ rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| ~ ssList(sK47_skl)
| ~ ssList(sK47_skl) ),
inference(resolution,[status(thm)],[f305,f423]) ).
fof(f469,plain,
( ~ rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil)
| ~ ssList(sK47_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f467]) ).
fof(f470,plain,
( ~ rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK47_skl,nil) ),
inference(forward_subsumption_resolution,[status(thm)],[f469,f417]) ).
fof(f476,plain,
( neq(sK49_skl,nil)
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f421,f426]) ).
fof(f477,plain,
( neq(sK47_skl,nil)
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f422,f476]) ).
fof(f478,plain,
( rearsegP(sK50_skl,sK49_skl)
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f421,f427]) ).
fof(f479,plain,
( rearsegP(sK48_skl,sK49_skl)
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f421,f478]) ).
fof(f480,plain,
( rearsegP(sK48_skl,sK47_skl)
| ~ neq(sK48_skl,nil) ),
inference(forward_demodulation,[status(thm)],[f422,f479]) ).
fof(f483,plain,
( ~ neq(sK48_skl,nil)
| ~ neq(sK47_skl,nil) ),
inference(resolution,[status(thm)],[f470,f480]) ).
fof(f484,plain,
~ neq(sK48_skl,nil),
inference(forward_subsumption_resolution,[status(thm)],[f483,f477]) ).
fof(f485,plain,
( sK48_skl = nil
| ~ ssList(nil)
| ~ ssList(sK48_skl) ),
inference(resolution,[status(thm)],[f484,f220]) ).
fof(f486,plain,
( sK48_skl = nil
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[status(thm)],[f485,f418]) ).
fof(f499,plain,
sK48_skl != sK48_skl,
inference(backward_demodulation,[status(thm)],[f504,f466]) ).
fof(f504,plain,
sK48_skl = nil,
inference(forward_subsumption_resolution,[status(thm)],[f486,f223]) ).
fof(f505,plain,
$false,
inference(trivial_equality_resolution,[status(thm)],[f499]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC049+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n019.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 07:51:20 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.39 % Drodi V4.1.1
% 0.09/0.41 % Refutation found
% 0.09/0.41 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.44 % Elapsed time: 0.059781 seconds
% 0.09/0.44 % CPU time: 0.166710 seconds
% 0.09/0.44 % Total memory used: 100.197 MB
% 0.09/0.44 % Net memory used: 100.065 MB
%------------------------------------------------------------------------------