%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC018+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:53:57 AM UTC 2026
% Result : Theorem 15.66s 3.69s
% Output : CNFRefutation 15.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 17 unt; 0 def)
% Number of atoms : 153 ( 58 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 170 ( 65 ~; 67 |; 19 &)
% ( 3 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 16 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ) ).
fof(ax15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ) ).
fof(ax46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ) ).
fof(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( frontsegP(X0,X8)
& frontsegP(X1,X8)
& neq(X8,nil)
& ssList(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( frontsegP(X0,X8)
& frontsegP(X1,X8)
& neq(X8,nil)
& ssList(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c14,plain,
( ~ ssList(X2)
| app(X2,X0) != X1
| ~ ssList(X1)
| frontsegP(X1,X2)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax5]) ).
cnf(c94,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax15]) ).
cnf(c95,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(c131,plain,
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax42]) ).
cnf(c137,plain,
( nil = X0
| ~ frontsegP(nil,X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax46]) ).
cnf(c208,plain,
ssList(sK253),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c209,plain,
ssList(sK254),
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,
ssList(sK257),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
app(sK255,sK257) = sK256,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c218,plain,
( nil != sK255
| nil = sK256 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c220,plain,
( ~ neq(X0,nil)
| ~ frontsegP(sK253,X0)
| ~ ssList(X0)
| nil = sK254
| ~ frontsegP(sK254,X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c221,plain,
( neq(sK254,nil)
| nil != sK253 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ ssList(X0)
| ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(equality_resolution,[status(thm)],[c94]) ).
cnf(d1,plain,
( nil = sK256
| nil != sK253 ),
inference(demodulation,[status(thm)],[c218,c213]) ).
cnf(d2,plain,
( nil = sK254
| nil != sK253 ),
inference(demodulation,[status(thm)],[d1,c212]) ).
cnf(d3,plain,
app(sK253,sK257) = sK256,
inference(demodulation,[status(thm)],[c215,c213]) ).
cnf(d4,plain,
app(sK253,sK257) = sK254,
inference(demodulation,[status(thm)],[d3,c212]) ).
cnf(d5,plain,
( frontsegP(X0,sK253)
| ~ ssList(X0)
| ~ ssList(sK257)
| ~ ssList(sK253)
| sK254 != X0 ),
inference(superposition,[status(thm)],[d4,c14]) ).
cnf(d6,plain,
( frontsegP(X0,sK253)
| ~ ssList(sK257)
| ~ ssList(X0)
| sK254 != X0 ),
inference(resolution,[status(thm)],[c208,d5]) ).
cnf(d7,plain,
( frontsegP(X0,sK253)
| ~ ssList(X0)
| sK254 != X0 ),
inference(resolution,[status(thm)],[c214,d6]) ).
cnf(d8,plain,
( frontsegP(sK254,sK253)
| ~ ssList(sK254) ),
inference(equality_resolution,[status(thm)],[d7]) ).
cnf(d9,plain,
frontsegP(sK254,sK253),
inference(resolution,[status(thm)],[c209,d8]) ).
cnf(d10,plain,
( ~ frontsegP(sK253,sK253)
| ~ ssList(sK253)
| ~ neq(sK253,nil)
| nil = sK254 ),
inference(resolution,[status(thm)],[c220,d9]) ).
cnf(d11,plain,
( ~ frontsegP(sK253,sK253)
| ~ neq(sK253,nil)
| nil = sK254 ),
inference(resolution,[status(thm)],[c208,d10]) ).
cnf(d12,plain,
( ~ neq(sK253,nil)
| nil = sK254
| ~ ssList(sK253) ),
inference(resolution,[status(thm)],[c131,d11]) ).
cnf(d13,plain,
( ~ neq(sK253,nil)
| nil = sK254 ),
inference(resolution,[status(thm)],[c208,d12]) ).
cnf(d14,plain,
( nil = sK254
| ~ ssList(sK253)
| ~ ssList(nil)
| sK253 = nil ),
inference(resolution,[status(thm)],[c95,d13]) ).
cnf(d15,plain,
( ~ ssList(nil)
| sK253 = nil
| nil = sK254 ),
inference(resolution,[status(thm)],[c208,d14]) ).
cnf(d16,plain,
( sK253 = nil
| nil = sK254 ),
inference(resolution,[status(thm)],[c97,d15]) ).
cnf(d17,plain,
( nil = sK254
| nil = sK254
| nil != nil ),
inference(superposition,[status(thm)],[d16,d2]) ).
cnf(d18,plain,
nil = sK254,
inference(equality_resolution,[status(thm)],[d17]) ).
cnf(d19,plain,
( neq(nil,nil)
| nil != sK253 ),
inference(demodulation,[status(thm)],[c221,d18]) ).
cnf(d20,plain,
frontsegP(nil,sK253),
inference(demodulation,[status(thm)],[d9,d18]) ).
cnf(d21,plain,
( ~ ssList(sK253)
| nil = sK253 ),
inference(resolution,[status(thm)],[c137,d20]) ).
cnf(d22,plain,
nil = sK253,
inference(resolution,[status(thm)],[c208,d21]) ).
cnf(d23,plain,
neq(nil,nil),
inference(resolution,[status(thm)],[d22,d19]) ).
cnf(d24,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[d23,d0]) ).
cnf(d25,plain,
$false,
inference(resolution,[status(thm)],[c97,d24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC018+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sat Sep 26 12:04:21 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.66/3.69 % SZS status Theorem for theBenchmark.p
% 15.66/3.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------