%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : SWC044+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 : n005.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:11 PM UTC 2026
% Result : Theorem 40.33s 6.32s
% Output : Proof 40.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 65 ( 29 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 66 ( 21 ~; 17 |; 18 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
! [U] :
( ssList(U)
=> ( rearsegP(nil,U)
<=> nil = U ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax52) ).
fof(f51_nnf,plain,
! [U] :
( ( ( nil != U
| rearsegP(nil,U) )
& ( nil = U
| ~ rearsegP(nil,U) ) )
| ~ ssList(U) ),
inference(nnf_transformation,[status(thm)],[f51]) ).
fof(f51_sk,plain,
! [U] :
( ( ( nil != U
| rearsegP(nil,U) )
& ( nil = U
| ~ rearsegP(nil,U) ) )
| ~ ssList(U) ),
inference(skolemisation,[status(esa)],[f51_nnf]) ).
cnf(c130,plain,
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[status(esa)],[f51_sk]) ).
fof(f95,conjecture,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( nil = U
| ~ rearsegP(X,W)
| U != W
| V != X
| nil != V ) ) ) ) ),
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)
=> ( nil = U
| ~ rearsegP(X,W)
| U != W
| V != X
| nil != V ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f95]) ).
fof(f95_nnf,plain,
? [U] :
( ? [V] :
( ? [W] :
( ? [X] :
( nil != U
& rearsegP(X,W)
& 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 != sk47
& rearsegP(sk50,sk49)
& 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(c190,plain,
ssList(sk47),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p14156,plain,
( nil = sk47
| ~ rearsegP(nil,sk47) ),
inference(resolution,[status(thm)],[c130,c190]) ).
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(c196,plain,
sk47 = sk49,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(c197,plain,
rearsegP(sk50,sk49),
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p211,plain,
rearsegP(sk50,sk47),
inference(superposition,[status(thm)],[c196,c197]) ).
cnf(p218,plain,
rearsegP(nil,sk47),
inference(superposition,[status(thm)],[p209,p211]) ).
cnf(p14539,plain,
nil = sk47,
inference(resolution,[status(thm)],[p14156,p218]) ).
cnf(c198,plain,
nil != sk47,
inference(cnf_transformation,[status(esa)],[f95_sk]) ).
cnf(p14540,plain,
$false,
inference(resolution,[status(thm)],[p14539,c198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC044+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 16:04:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 40.33/6.32 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 40.33/6.32 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------