%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC381+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 : n017.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:06:12 PM UTC 2026
% Result : Theorem 26.08s 4.23s
% Output : Proof 26.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 91 ( 19 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 105 ( 36 ~; 31 |; 28 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 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] :
( ssItem(Z)
=> ( ~ memberP(X,Z)
| cons(Z,nil) != W ) )
| ? [Y] :
( memberP(V,Y)
& cons(Y,nil) = U
& ssItem(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)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [Z] :
( ssItem(Z)
=> ( ~ memberP(X,Z)
| cons(Z,nil) != W ) )
| ? [Y] :
( memberP(V,Y)
& cons(Y,nil) = U
& ssItem(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] :
( memberP(X,Z)
& cons(Z,nil) = W
& ssItem(Z) )
& ! [Y] :
( ~ memberP(V,Y)
| cons(Y,nil) != U
| ~ ssItem(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) )
| ( memberP(sk50,sk51)
& cons(sk51,nil) = sk49
& ssItem(sk51)
& ( ~ memberP(sk48,Y)
| cons(Y,nil) != sk47
| ~ ssItem(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(c199,plain,
( ~ neq(sk50,nil)
| ~ memberP(sk48,X4)
| cons(X4,nil) != sk47
| ~ ssItem(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c201,plain,
( ~ neq(sk50,nil)
| ssItem(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p206,plain,
( ~ neq(sk48,nil)
| ssItem(sk51) ),
inference(superposition,[status(thm)],[c194,c201]) ).
cnf(c200,plain,
( neq(sk48,nil)
| ssItem(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p207,plain,
( ssItem(sk51)
| ssItem(sk51) ),
inference(resolution,[status(thm)],[p206,c200]) ).
cnf(p208,plain,
ssItem(sk51),
inference(factoring,[status(thm)],[p207]) ).
cnf(p217,plain,
( ~ neq(sk50,nil)
| ~ memberP(sk48,sk51)
| sk47 != sk47 ),
inference(resolution,[status(thm)],[c199,p208]) ).
cnf(p219,plain,
( ~ neq(sk50,nil)
| ~ memberP(sk48,sk51) ),
inference(equality_resolution,[status(thm)],[p217]) ).
cnf(c205,plain,
( ~ neq(sk50,nil)
| memberP(sk50,sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p210,plain,
( ~ neq(sk48,nil)
| memberP(sk50,sk51) ),
inference(superposition,[status(thm)],[c194,c205]) ).
cnf(c196,plain,
( neq(sk48,nil)
| neq(sk48,nil) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
neq(sk48,nil),
inference(factoring,[status(thm)],[c196]) ).
cnf(p211,plain,
memberP(sk50,sk51),
inference(resolution,[status(thm)],[p210,p209]) ).
cnf(p212,plain,
memberP(sk48,sk51),
inference(superposition,[status(thm)],[c194,p211]) ).
cnf(p220,plain,
~ neq(sk50,nil),
inference(resolution,[status(thm)],[p219,p212]) ).
cnf(p221,plain,
~ neq(sk48,nil),
inference(superposition,[status(thm)],[c194,p220]) ).
cnf(p222,plain,
$false,
inference(resolution,[status(thm)],[p221,p209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC381+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n017.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 : Thu Sep 24 17:52:01 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 26.08/4.23 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 26.08/4.23 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------