%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC050+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 : n011.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 22.95s 28.91s
% Output : Proof 22.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 116 ( 10 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 134 ( 49 ~; 43 |; 32 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 12 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [Z] :
( ssList(Z)
=> ( ~ rearsegP(W,Z)
| ~ rearsegP(X,Z)
| ~ neq(Z,nil) ) )
| ? [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',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [Z] :
( ssList(Z)
=> ( ~ rearsegP(W,Z)
| ~ rearsegP(X,Z)
| ~ neq(Z,nil) ) )
| ? [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] :
( ( ( ~ neq(X,nil)
& neq(V,nil) )
| ( ? [Z] :
( rearsegP(W,Z)
& rearsegP(X,Z)
& neq(Z,nil)
& ssList(Z) )
& ! [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] :
( ( ( ~ neq(sk50,nil)
& neq(sk48,nil) )
| ( rearsegP(sk49,sk51)
& rearsegP(sk50,sk51)
& neq(sk51,nil)
& ssList(sk51)
& ( ~ 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,sk51])],[f95_nnf]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c195,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c207,plain,
( ~ neq(sk50,nil)
| rearsegP(sk49,sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p234,plain,
( ~ neq(sk48,nil)
| rearsegP(sk49,sk51) ),
inference(superposition,[status(thm)],[c194,c207]) ).
cnf(c196,plain,
( neq(sk48,nil)
| neq(sk48,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p211,plain,
neq(sk48,nil),
inference(factoring,[status(thm)],[c196]) ).
cnf(p235,plain,
rearsegP(sk49,sk51),
inference(resolution,[status(thm)],[p234,p211]) ).
cnf(p236,plain,
rearsegP(sk47,sk51),
inference(superposition,[status(thm)],[c195,p235]) ).
cnf(c199,plain,
( ~ neq(sk50,nil)
| ~ rearsegP(sk47,X4)
| ~ rearsegP(sk48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c201,plain,
( ~ neq(sk50,nil)
| ssList(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p208,plain,
( ~ neq(sk48,nil)
| ssList(sk51) ),
inference(superposition,[status(thm)],[c194,c201]) ).
cnf(c200,plain,
( neq(sk48,nil)
| ssList(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
( ssList(sk51)
| ssList(sk51) ),
inference(resolution,[status(thm)],[p208,c200]) ).
cnf(p210,plain,
ssList(sk51),
inference(factoring,[status(thm)],[p209]) ).
cnf(p222,plain,
( ~ neq(sk50,nil)
| ~ rearsegP(sk47,sk51)
| ~ rearsegP(sk48,sk51)
| ~ neq(sk51,nil) ),
inference(resolution,[status(thm)],[c199,p210]) ).
cnf(c203,plain,
( ~ neq(sk50,nil)
| neq(sk51,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p212,plain,
( ~ neq(sk48,nil)
| neq(sk51,nil) ),
inference(superposition,[status(thm)],[c194,c203]) ).
cnf(p214,plain,
neq(sk51,nil),
inference(resolution,[status(thm)],[p212,p211]) ).
cnf(p229,plain,
( ~ neq(sk50,nil)
| ~ rearsegP(sk47,sk51)
| ~ rearsegP(sk48,sk51) ),
inference(resolution,[status(thm)],[p222,p214]) ).
cnf(c205,plain,
( ~ neq(sk50,nil)
| rearsegP(sk50,sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p213,plain,
( ~ neq(sk48,nil)
| rearsegP(sk50,sk51) ),
inference(superposition,[status(thm)],[c194,c205]) ).
cnf(p215,plain,
rearsegP(sk50,sk51),
inference(resolution,[status(thm)],[p213,p211]) ).
cnf(p216,plain,
rearsegP(sk48,sk51),
inference(superposition,[status(thm)],[c194,p215]) ).
cnf(p230,plain,
( ~ neq(sk50,nil)
| ~ rearsegP(sk47,sk51) ),
inference(resolution,[status(thm)],[p229,p216]) ).
cnf(p237,plain,
~ neq(sk50,nil),
inference(resolution,[status(thm)],[p236,p230]) ).
cnf(p238,plain,
~ neq(sk48,nil),
inference(superposition,[status(thm)],[c194,p237]) ).
cnf(p239,plain,
$false,
inference(resolution,[status(thm)],[p238,p211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC050+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/25.44 % CPULimit : 300
% 0.09/25.44 % WCLimit : 300
% 0.09/25.44 % DateTime : Thu Sep 24 16:06:19 UTC 2026
% 0.09/25.44 % CPUTime :
% 0.09/25.44 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 22.95/28.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.95/28.91 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------