%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC094+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:19 PM UTC 2026
% Result : Theorem 22.53s 3.91s
% Output : Proof 22.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 82 ( 39 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 99 ( 39 ~; 29 |; 22 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 17 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f27,axiom,
! [U] :
( ssList(U)
=> app(nil,U) = U ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f27_nnf,plain,
! [U] :
( app(nil,U) = U
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f27]) ).
fof(f27_sk,plain,
! [U] :
( app(nil,U) = U
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f27_nnf]) ).
cnf(c97,plain,
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f27_sk]) ).
fof(f16,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f16_nnf,plain,
ssList(nil),
inference(nnf_transformation,[status(thm)],[f16]) ).
cnf(c83,plain,
ssList(nil),
inference(cnf_transformation,[status(esa)],[f16_nnf]) ).
cnf(p293,plain,
app(nil,nil) = nil,
inference(resolution,[status(thm)],[c97,c83]) ).
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Y,X1) = V
& app(app(Y,Z),X1) = U
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| X != W
| 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)
=> ( ? [Y] :
( ? [Z] :
( ? [X1] :
( app(Y,X1) = V
& app(app(Y,Z),X1) = U
& ssList(X1) )
& ssList(Z) )
& ssList(Y) )
| X != W
| U != W
| V != X ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ! [Y] :
( ! [Z] :
( ! [X1] :
( app(Y,X1) != V
| app(app(Y,Z),X1) != U
| ~ ssList(X1) )
| ~ ssList(Z) )
| ~ ssList(Y) )
& X = W
& 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(Y,X1) != sk48
| app(app(Y,Z),X1) != sk47
| ~ ssList(X1)
| ~ ssList(Z)
| ~ ssList(Y) )
& sk50 = sk49
& 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(p288,plain,
app(nil,sk47) = sk47,
inference(resolution,[status(thm)],[c97,c190]) ).
cnf(c197,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(p198,plain,
( app(X0,X1) != sk48
| app(app(X0,X0),X1) != sk47
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(factoring,[status(thm)],[c197]) ).
cnf(p214,plain,
( app(nil,X0) != sk48
| app(app(nil,nil),X0) != sk47
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[p198,c83]) ).
cnf(p249,plain,
( app(nil,sk47) != sk47
| app(app(nil,nil),sk47) != sk47 ),
inference(resolution,[status(thm)],[p214,c190]) ).
cnf(p291,plain,
( sk47 != sk47
| app(app(nil,nil),sk47) != sk47 ),
inference(demodulation,[status(thm)],[p288,p249]) ).
cnf(p300,plain,
( sk47 != sk47
| app(nil,sk47) != sk47 ),
inference(demodulation,[status(thm)],[p293,p291]) ).
cnf(p302,plain,
sk47 != sk47,
inference(equality_resolution,[status(thm)],[p300]) ).
cnf(p303,plain,
$false,
inference(equality_resolution,[status(thm)],[p302]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC094+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n017.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:17:00 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 22.53/3.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.53/3.91 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------