%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC051+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n014.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:13 PM UTC 2026
% Result : Theorem 23.95s 3.43s
% Output : Proof 23.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 101 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 116 ( 42 ~; 35 |; 30 &)
% ( 0 <=>; 9 =>; 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 : 21 ( 0 sgn 13 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,axiom,
! [U] :
( ssList(U)
=> rearsegP(U,U) ),
file('/export/starexec/sandbox/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(f95,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/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,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)],[f95]) ).
fof(f95_nnf,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(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
! [Y] :
( ( ( rearsegP(sk50,sk49)
& neq(sk49,nil) )
| ~ neq(sk50,nil) )
& ( nil != sk50
| nil = sk49 )
& ( ~ rearsegP(sk47,Y)
| ~ rearsegP(sk48,Y)
| ~ neq(Y,nil)
| ~ ssList(Y) )
& neq(sk48,nil)
& 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(p242,plain,
rearsegP(sk47,sk47),
inference(resolution,[status(thm)],[c127,c190]) ).
cnf(c197,plain,
( ~ rearsegP(sk47,X4)
| ~ rearsegP(sk48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p202,plain,
( ~ rearsegP(sk47,sk47)
| ~ rearsegP(sk48,sk47)
| ~ neq(sk47,nil) ),
inference(resolution,[status(thm)],[c197,c190]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c199,plain,
( neq(sk49,nil)
| ~ neq(sk50,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p207,plain,
( neq(sk49,nil)
| ~ neq(sk48,nil) ),
inference(superposition,[status(thm)],[c194,c199]) ).
cnf(c196,plain,
neq(sk48,nil),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
neq(sk49,nil),
inference(resolution,[status(thm)],[p207,c196]) ).
cnf(p210,plain,
neq(sk47,nil),
inference(superposition,[status(thm)],[c195,p209]) ).
cnf(p215,plain,
( ~ rearsegP(sk47,sk47)
| ~ rearsegP(sk48,sk47) ),
inference(resolution,[status(thm)],[p202,p210]) ).
cnf(c200,plain,
( rearsegP(sk50,sk49)
| ~ neq(sk50,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p208,plain,
( rearsegP(sk50,sk49)
| ~ neq(sk48,nil) ),
inference(superposition,[status(thm)],[c194,c200]) ).
cnf(p211,plain,
rearsegP(sk50,sk49),
inference(resolution,[status(thm)],[p208,c196]) ).
cnf(p212,plain,
rearsegP(sk48,sk49),
inference(superposition,[status(thm)],[c194,p211]) ).
cnf(p214,plain,
rearsegP(sk48,sk47),
inference(superposition,[status(thm)],[c195,p212]) ).
cnf(p216,plain,
~ rearsegP(sk47,sk47),
inference(resolution,[status(thm)],[p215,p214]) ).
cnf(p247,plain,
$false,
inference(resolution,[status(thm)],[p242,p216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC051+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n014.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 16:07:03 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 23.95/3.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 23.95/3.43 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------