%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SWC051+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 : n008.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:45 PM UTC 2026
% Result : Theorem 0.15s 10.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 10 unt; 0 def)
% Number of atoms : 101 ( 18 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 125 ( 48 ~; 38 |; 30 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 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 : 22 ( 16 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
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 = X
& nil != W )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil)
| 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 = X
& nil != W )
| ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil)
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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 != X
| nil = W )
& ! [Y] :
( ~ rearsegP(U,Y)
| ~ rearsegP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(V,nil)
& 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 != sK50_skl
| nil = sK49_skl )
& ! [Y] :
( ~ rearsegP(sK47_skl,Y)
| ~ rearsegP(sK48_skl,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& 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)],[f415]) ).
fof(f419,plain,
ssList(sK49_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,
neq(sK48_skl,nil),
inference(cnf_transformation,[status(thm)],[f416]) ).
fof(f424,plain,
! [X0] :
( ~ rearsegP(sK47_skl,X0)
| ~ rearsegP(sK48_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
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(f460,plain,
neq(sK50_skl,nil),
inference(forward_demodulation,[status(thm)],[f421,f423]) ).
fof(f463,plain,
neq(sK49_skl,nil),
inference(forward_subsumption_resolution,[status(thm)],[f426,f460]) ).
fof(f464,plain,
rearsegP(sK50_skl,sK49_skl),
inference(forward_subsumption_resolution,[status(thm)],[f427,f460]) ).
fof(f465,plain,
! [X0] :
( ~ rearsegP(sK47_skl,X0)
| ~ rearsegP(sK50_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f421,f424]) ).
fof(f466,plain,
! [X0] :
( ~ rearsegP(sK49_skl,X0)
| ~ rearsegP(sK50_skl,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(forward_demodulation,[status(thm)],[f422,f465]) ).
fof(f467,plain,
( ~ rearsegP(sK49_skl,sK49_skl)
| ~ rearsegP(sK50_skl,sK49_skl)
| ~ ssList(sK49_skl) ),
inference(resolution,[status(thm)],[f466,f463]) ).
fof(f470,plain,
( ~ rearsegP(sK49_skl,sK49_skl)
| ~ rearsegP(sK50_skl,sK49_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f467,f419]) ).
fof(f479,plain,
~ rearsegP(sK49_skl,sK49_skl),
inference(forward_subsumption_resolution,[status(thm)],[f470,f464]) ).
fof(f480,plain,
~ ssList(sK49_skl),
inference(resolution,[status(thm)],[f479,f305]) ).
fof(f481,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f480,f419]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC051+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/10.38 % Computer : n008.cluster.edu
% 0.11/10.38 % Model : x86_64 x86_64
% 0.11/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38 % Memory : 8046.5625MB
% 0.11/10.38 % OS : Linux 6.8.0-71-generic
% 0.11/10.38 % CPULimit : 300
% 0.11/10.38 % WCLimit : 300
% 0.11/10.38 % DateTime : Mon Sep 21 07:52:08 UTC 2026
% 0.11/10.38 % CPUTime :
% 0.15/10.40 % Drodi V4.1.1
% 0.15/10.43 % Refutation found
% 0.15/10.43 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/10.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/10.45 % Elapsed time: 0.065827 seconds
% 0.15/10.45 % CPU time: 0.168801 seconds
% 0.15/10.45 % Total memory used: 110.489 MB
% 0.15/10.45 % Net memory used: 110.364 MB
%------------------------------------------------------------------------------