%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC028+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 : Sun Sep 27 08:54:00 AM UTC 2026
% Result : Theorem 27.26s 3.90s
% Output : CNFRefutation 27.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 10 unt; 0 def)
% Number of atoms : 79 ( 41 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 85 ( 34 ~; 34 |; 4 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ) ).
fof(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c94,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax15]) ).
cnf(c97,plain,
ssList(nil),
inference(clausification,[status(esa)],[ax17]) ).
cnf(c144,plain,
( nil = X0
| ~ rearsegP(nil,X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax52]) ).
cnf(c210,plain,
ssList(sK255),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c212,plain,
sK254 = sK256,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c213,plain,
sK253 = sK255,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c214,plain,
( nil = sK253
| nil = sK254 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c217,plain,
( nil != sK254
| nil != sK253 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c218,plain,
( neq(sK255,nil)
| nil = sK256 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c221,plain,
( rearsegP(sK256,sK255)
| nil = sK255 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( rearsegP(sK254,sK255)
| nil = sK255 ),
inference(demodulation,[status(thm)],[c221,c212]) ).
cnf(d1,plain,
( nil = sK254
| nil = sK255 ),
inference(demodulation,[status(thm)],[c214,c213]) ).
cnf(d2,plain,
( nil = sK255
| nil = sK255
| rearsegP(nil,sK255) ),
inference(superposition,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( nil = sK255
| ~ ssList(sK255)
| nil = sK255 ),
inference(resolution,[status(thm)],[c144,d2]) ).
cnf(d4,plain,
nil = sK255,
inference(resolution,[status(thm)],[c210,d3]) ).
cnf(d5,plain,
( neq(sK255,nil)
| nil = sK254 ),
inference(demodulation,[status(thm)],[c218,c212]) ).
cnf(d6,plain,
( neq(nil,nil)
| nil = sK254 ),
inference(demodulation,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
( nil != sK254
| nil != sK255 ),
inference(demodulation,[status(thm)],[c217,c213]) ).
cnf(d8,plain,
nil != sK254,
inference(resolution,[status(thm)],[d4,d7]) ).
cnf(d9,plain,
neq(nil,nil),
inference(resolution,[status(thm)],[d8,d6]) ).
cnf(d10,plain,
( ~ ssList(X0)
| ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(equality_resolution,[status(thm)],[c94]) ).
cnf(d11,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[d10,d9]) ).
cnf(d12,plain,
$false,
inference(resolution,[status(thm)],[c97,d11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC028+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n011.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.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 12:05:45 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 27.26/3.90 % SZS status Theorem for theBenchmark.p
% 27.26/3.90 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------