%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC317+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 : 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:05:59 PM UTC 2026
% Result : Theorem 25.94s 4.33s
% Output : Proof 25.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 109 ( 38 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 134 ( 49 ~; 41 |; 32 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 16 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( ( neq(X,nil)
| ~ neq(V,nil) )
& ( ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,cons(X1,nil)) != X
| app(cons(X1,nil),X2) != W ) ) )
| ? [Y] :
( ? [Z] :
( app(Z,cons(Y,nil)) = V
& app(cons(Y,nil),Z) = U
& ssList(Z) )
& ssItem(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) )
& ( ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( app(X2,cons(X1,nil)) != X
| app(cons(X1,nil),X2) != W ) ) )
| ? [Y] :
( ? [Z] :
( app(Z,cons(Y,nil)) = V
& app(cons(Y,nil),Z) = U
& ssList(Z) )
& 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) )
| ( ? [X1] :
( ? [X2] :
( app(X2,cons(X1,nil)) = X
& app(cons(X1,nil),X2) = W
& ssList(X2) )
& ssItem(X1) )
& ! [Y] :
( ! [Z] :
( app(Z,cons(Y,nil)) != V
| app(cons(Y,nil),Z) != U
| ~ ssList(Z) )
| ~ 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,Z] :
( ( ( ~ neq(sk50,nil)
& neq(sk48,nil) )
| ( app(sk52,cons(sk51,nil)) = sk50
& app(cons(sk51,nil),sk52) = sk49
& ssList(sk52)
& ssItem(sk51)
& ( app(Z,cons(Y,nil)) != sk48
| app(cons(Y,nil),Z) != sk47
| ~ ssList(Z)
| ~ 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,sk52])],[f95_nnf]) ).
cnf(c194,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c207,plain,
( ~ neq(sk50,nil)
| app(sk52,cons(sk51,nil)) = sk50 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p214,plain,
( ~ neq(sk48,nil)
| app(sk52,cons(sk51,nil)) = sk50 ),
inference(superposition,[status(thm)],[c194,c207]) ).
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(p218,plain,
app(sk52,cons(sk51,nil)) = sk50,
inference(resolution,[status(thm)],[p214,p209]) ).
cnf(p219,plain,
sk50 = sk48,
inference(superposition,[status(thm)],[c194,p218]) ).
cnf(c199,plain,
( ~ neq(sk50,nil)
| app(X5,cons(X4,nil)) != sk48
| app(cons(X4,nil),X5) != sk47
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p220,plain,
( ~ neq(sk48,nil)
| app(X1,cons(X0,nil)) != sk48
| app(cons(X0,nil),X1) != sk47
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(demodulation,[status(thm)],[p219,c199]) ).
cnf(c201,plain,
( ~ neq(sk50,nil)
| ssItem(sk51) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p208,plain,
( ~ neq(sk48,nil)
| ssItem(sk51) ),
inference(superposition,[status(thm)],[c194,c201]) ).
cnf(p211,plain,
ssItem(sk51),
inference(resolution,[status(thm)],[p208,p209]) ).
cnf(p222,plain,
( ~ neq(sk48,nil)
| app(X0,cons(sk51,nil)) != sk48
| app(cons(sk51,nil),X0) != sk47
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[p220,p211]) ).
cnf(c203,plain,
( ~ neq(sk50,nil)
| ssList(sk52) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p210,plain,
( ~ neq(sk48,nil)
| ssList(sk52) ),
inference(superposition,[status(thm)],[c194,c203]) ).
cnf(p212,plain,
ssList(sk52),
inference(resolution,[status(thm)],[p210,p209]) ).
cnf(p225,plain,
( ~ neq(sk48,nil)
| sk48 != sk48
| sk47 != sk47 ),
inference(resolution,[status(thm)],[p222,p212]) ).
cnf(p226,plain,
( ~ neq(sk48,nil)
| sk48 != sk48 ),
inference(equality_resolution,[status(thm)],[p225]) ).
cnf(p228,plain,
~ neq(sk48,nil),
inference(equality_resolution,[status(thm)],[p226]) ).
cnf(p229,plain,
$false,
inference(resolution,[status(thm)],[p228,p209]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC317+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.13/0.41 % Computer : n017.cluster.edu
% 0.13/0.41 % Model : x86_64 x86_64
% 0.13/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41 % Memory : 8046.5625MB
% 0.13/0.41 % OS : Linux 6.8.0-71-generic
% 0.13/0.41 % CPULimit : 300
% 0.13/0.41 % WCLimit : 300
% 0.13/0.41 % DateTime : Thu Sep 24 17:30:46 UTC 2026
% 0.13/0.41 % CPUTime :
% 0.13/0.41 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 25.94/4.33 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.94/4.33 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------