%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC095+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 : n019.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:19 PM UTC 2026
% Result : Theorem 22.86s 3.45s
% Output : Proof 22.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 83 ( 33 equ)
% Maximal formula atoms : 16 ( 6 avg)
% Number of connectives : 108 ( 38 ~; 30 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 20 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( app(X2,X4) != X
| app(app(X2,X3),X4) != W
| ~ ssList(X4) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Y,X1) = V
& app(app(Y,Z),X1) = U
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| U != W
| V != X
| ~ ssList(X) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f95_neg,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( app(X2,X4) != X
| app(app(X2,X3),X4) != W
| ~ ssList(X4) ) ) )
| ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Y,X1) = V
& app(app(Y,Z),X1) = U
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| U != W
| V != X
| ~ ssList(X) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( app(X2,X4) = X
& app(app(X2,X3),X4) = W
& ssList(X4) )
& ssList(X3) )
& ssList(X2) )
& ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Y,X1) != V
| app(app(Y,Z),X1) != U
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& 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,X1] :
( app(sk51,sk53) = sk50
& app(app(sk51,sk52),sk53) = sk49
& ssList(sk53)
& ssList(sk52)
& ssList(sk51)
& ( app(Y,X1) != sk48
| app(app(Y,Z),X1) != sk47
| ~ ssList(X1)
| ~ ssList(Z)
| ~ ssList(Y) )
& 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,sk53])],[f95_nnf]) ).
cnf(c196,plain,
( app(X4,X6) != sk48
| app(app(X4,X5),X6) != sk47
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c197,plain,
ssList(sk51),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p210,plain,
( app(sk51,X1) != sk48
| app(app(sk51,X0),X1) != sk47
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c196,c197]) ).
cnf(c198,plain,
ssList(sk52),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p439,plain,
( app(sk51,X0) != sk48
| app(app(sk51,sk52),X0) != sk47
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[p210,c198]) ).
cnf(c199,plain,
ssList(sk53),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p455,plain,
( sk48 != sk48
| sk47 != sk47 ),
inference(resolution,[status(thm)],[p439,c199]) ).
cnf(p456,plain,
sk48 != sk48,
inference(equality_resolution,[status(thm)],[p455]) ).
cnf(p458,plain,
$false,
inference(equality_resolution,[status(thm)],[p456]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC095+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 16:22:04 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 22.86/3.45 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.86/3.45 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------