%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC047+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n006.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 : Fri Sep 25 03:05:12 PM UTC 2026
% Result : Theorem 33.07s 4.69s
% Output : Proof 33.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 19 unt; 0 def)
% Number of atoms : 130 ( 40 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 147 ( 59 ~; 53 |; 26 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 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 : 25 ( 0 sgn 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,U) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f48_nnf,plain,
! [U] :
( rearsegP(U,U)
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f48]) ).
fof(f48_sk,plain,
! [U] :
( rearsegP(U,U)
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f48_nnf]) ).
cnf(c127,plain,
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f48_sk]) ).
fof(f16,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f16_nnf,plain,
ssList(nil),
inference(nnf_transformation,[status(thm)],[f16]) ).
cnf(c83,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f16_nnf]) ).
cnf(p225,plain,
rearsegP(nil,nil),
inference(resolution,[status(thm)],[c127,c83]) ).
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| X != W
| U != W
| V != X ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( ? [Y] :
( rearsegP(U,Y)
& rearsegP(V,Y)
& neq(Y,nil)
& ssList(Y) )
| ~ neq(V,nil) )
& ( nil = U
| nil != V ) )
| X != W
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( ( ! [Y] :
( ~ rearsegP(U,Y)
| ~ rearsegP(V,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(V,nil) )
| ( nil != U
& nil = V ) )
& X = W
& U = W
& V = X
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
! [Y] :
( ( ( ( ~ rearsegP(sk47,Y)
| ~ rearsegP(sk48,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(sk48,nil) )
| ( nil != sk47
& nil = sk48 ) )
& sk50 = sk49
& sk47 = sk49
& sk48 = sk50
& ssList(sk50)
& ssList(sk49)
& ssList(sk48)
& ssList(sk47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50])],[f95_nnf]) ).
cnf(c190,plain,
ssList(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p224,plain,
rearsegP(sk47,sk47),
inference(resolution,[status(thm)],[c127,c190]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c193,plain,
ssList(sk50),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c198,plain,
( ~ rearsegP(sk47,X4)
| ~ rearsegP(sk48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sk48 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p204,plain,
( ~ rearsegP(sk47,sk50)
| ~ rearsegP(sk48,sk50)
| ~ neq(sk50,nil)
| nil = sk48 ),
inference(resolution,[status(thm)],[c193,c198]) ).
cnf(p210,plain,
( ~ rearsegP(sk47,sk47)
| ~ rearsegP(sk47,sk47)
| ~ neq(sk47,nil)
| nil = sk47 ),
inference(superposition,[status(thm)],[c194,p204]) ).
cnf(p213,plain,
( ~ rearsegP(sk47,sk47)
| ~ neq(sk47,nil)
| nil = sk47 ),
inference(factoring,[status(thm)],[p210]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c196,plain,
sk50 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p206,plain,
sk49 = sk47,
inference(superposition,[status(thm)],[c195,c196]) ).
cnf(p205,plain,
sk48 = sk49,
inference(superposition,[status(thm)],[c196,c194]) ).
cnf(p208,plain,
sk48 = sk47,
inference(demodulation,[status(thm)],[p206,p205]) ).
cnf(c197,plain,
( neq(sk48,nil)
| nil = sk48 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
( neq(sk47,nil)
| nil = sk47 ),
inference(superposition,[status(thm)],[p208,c197]) ).
cnf(p214,plain,
( nil = sk47
| ~ rearsegP(sk47,sk47)
| nil = sk47 ),
inference(resolution,[status(thm)],[p213,p209]) ).
cnf(p215,plain,
( ~ rearsegP(sk47,sk47)
| nil = sk47 ),
inference(factoring,[status(thm)],[p214]) ).
cnf(p226,plain,
nil = sk47,
inference(resolution,[status(thm)],[p224,p215]) ).
cnf(p228,plain,
sk47 = nil,
inference(superposition,[status(thm)],[p226,p206]) ).
cnf(c200,plain,
( ~ rearsegP(sk47,X4)
| ~ rearsegP(sk48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sk47 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p227,plain,
( ~ rearsegP(sk47,X0)
| ~ rearsegP(sk47,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[p226,c200]) ).
cnf(p238,plain,
( ~ rearsegP(nil,X0)
| ~ rearsegP(nil,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(demodulation,[status(thm)],[p228,p227]) ).
cnf(p240,plain,
( ~ rearsegP(nil,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) ),
inference(factoring,[status(thm)],[p238]) ).
cnf(c191,plain,
ssList(sk48),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p241,plain,
( ~ rearsegP(nil,nil)
| ~ neq(nil,nil) ),
inference(resolution,[status(thm)],[p240,c191]) ).
cnf(c199,plain,
( neq(sk48,nil)
| nil != sk47 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p230,plain,
( neq(sk48,nil)
| nil != nil ),
inference(demodulation,[status(thm)],[p228,c199]) ).
cnf(p239,plain,
neq(nil,nil),
inference(equality_resolution,[status(thm)],[p230]) ).
cnf(p242,plain,
~ rearsegP(nil,nil),
inference(resolution,[status(thm)],[p241,p239]) ).
cnf(p243,plain,
$false,
inference(resolution,[status(thm)],[p225,p242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC047+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.15/0.41 % Computer : n006.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Thu Sep 24 16:05:41 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 33.07/4.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 33.07/4.69 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------