%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC036+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 : n015.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:09 PM UTC 2026
% Result : Theorem 26.32s 3.86s
% Output : Proof 26.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 51 ( 34 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 53 ( 16 ~; 11 |; 18 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 12 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( nil = X
& nil != W )
| nil = U
| U != W
| V != X
| nil != V ) ) ) ) ),
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)
=> ( ( nil = X
& nil != W )
| nil = U
| U != W
| V != X
| nil != V ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( ( nil != X
| nil = W )
& nil != U
& U = W
& V = X
& nil = V
& ssList(X) )
& ssList(W) )
& ssList(V) )
& ssList(U) ),
inference(nnf_transformation,[status(thm)],[f95_neg]) ).
fof(f95_sk,plain,
( ( nil != sk50
| nil = sk49 )
& nil != sk47
& sk47 = sk49
& sk48 = sk50
& nil = sk48
& ssList(sk50)
& ssList(sk49)
& ssList(sk48)
& ssList(sk47) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk47,sk48,sk49,sk50])],[f95_nnf]) ).
cnf(c198,plain,
( nil != sk50
| nil = sk49 ),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c194,plain,
nil = sk48,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c195,plain,
sk48 = sk50,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p209,plain,
nil = sk50,
inference(superposition,[status(thm)],[c194,c195]) ).
cnf(p1005,plain,
nil = sk49,
inference(resolution,[status(thm)],[c198,p209]) ).
cnf(c196,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p1032,plain,
sk47 = nil,
inference(superposition,[status(thm)],[p1005,c196]) ).
cnf(c197,plain,
nil != sk47,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p1033,plain,
nil != nil,
inference(demodulation,[status(thm)],[p1032,c197]) ).
cnf(p1167,plain,
$false,
inference(equality_resolution,[status(thm)],[p1033]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC036+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.37 % Computer : n015.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 16:05:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 26.32/3.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 26.32/3.86 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------