%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC357+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 : n009.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:55:06 AM UTC 2026
% Result : Theorem 14.96s 16.10s
% Output : CNFRefutation 14.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 15 unt; 0 def)
% Number of atoms : 130 ( 39 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 155 ( 67 ~; 65 |; 5 &)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 15 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ) ).
fof(ax7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ) ).
fof(ax15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ) ).
fof(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| segmentP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| segmentP(X1,X0)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c12,plain,
( ssList(sK15(X0,X1))
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax5]) ).
cnf(c13,plain,
( app(X1,sK15(X0,X1)) = X0
| ~ frontsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax5]) ).
cnf(c21,plain,
( ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| segmentP(X0,X1) ),
inference(clausification,[status(esa)],[ax7]) ).
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(c111,plain,
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax28]) ).
cnf(c210,plain,
ssList(sK255),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c211,plain,
ssList(sK256),
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,
neq(sK254,nil),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
~ segmentP(sK254,sK253),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c217,plain,
( frontsegP(sK256,sK255)
| nil = sK256 ),
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,
app(nil,sK255) = sK255,
inference(resolution,[status(thm)],[c111,c210]) ).
cnf(d2,plain,
( segmentP(X1,sK255)
| ~ ssList(nil)
| ~ ssList(sK255)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK255,X0) != X1 ),
inference(superposition,[status(thm)],[d1,c21]) ).
cnf(d3,plain,
( segmentP(X1,sK255)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK255,X0) != X1 ),
inference(resolution,[status(thm)],[c210,d2]) ).
cnf(d4,plain,
( segmentP(X1,sK255)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sK255,X0) != X1 ),
inference(resolution,[status(thm)],[c97,d3]) ).
cnf(d5,plain,
( nil = sK256
| ~ ssList(sK256)
| ~ ssList(sK255)
| app(sK255,sK15(sK256,sK255)) = sK256 ),
inference(resolution,[status(thm)],[c13,c217]) ).
cnf(d6,plain,
( ~ ssList(sK256)
| nil = sK256
| app(sK255,sK15(sK256,sK255)) = sK256 ),
inference(resolution,[status(thm)],[c210,d5]) ).
cnf(d7,plain,
( nil = sK256
| app(sK255,sK15(sK256,sK255)) = sK256 ),
inference(resolution,[status(thm)],[c211,d6]) ).
cnf(d8,plain,
( nil = sK256
| segmentP(X0,sK255)
| ~ ssList(sK15(sK256,sK255))
| ~ ssList(X0)
| sK256 != X0 ),
inference(superposition,[status(thm)],[d7,d4]) ).
cnf(d9,plain,
( segmentP(sK256,sK255)
| ~ ssList(sK15(sK256,sK255))
| ~ ssList(sK256)
| nil = sK256 ),
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
( segmentP(sK256,sK255)
| ~ ssList(sK15(sK256,sK255))
| nil = sK256 ),
inference(resolution,[status(thm)],[c211,d9]) ).
cnf(d11,plain,
~ segmentP(sK256,sK253),
inference(demodulation,[status(thm)],[c215,c212]) ).
cnf(d12,plain,
~ segmentP(sK256,sK255),
inference(demodulation,[status(thm)],[d11,c213]) ).
cnf(d13,plain,
( ~ ssList(sK15(sK256,sK255))
| nil = sK256 ),
inference(resolution,[status(thm)],[d12,d10]) ).
cnf(d14,plain,
( ~ frontsegP(sK256,sK255)
| ~ ssList(sK256)
| ~ ssList(sK255)
| nil = sK256 ),
inference(resolution,[status(thm)],[d13,c12]) ).
cnf(d15,plain,
( ~ frontsegP(sK256,sK255)
| ~ ssList(sK256)
| nil = sK256 ),
inference(resolution,[status(thm)],[c210,d14]) ).
cnf(d16,plain,
( ~ frontsegP(sK256,sK255)
| nil = sK256 ),
inference(resolution,[status(thm)],[c211,d15]) ).
cnf(d17,plain,
( nil = sK256
| nil = sK256 ),
inference(resolution,[status(thm)],[d16,c217]) ).
cnf(d18,plain,
neq(sK256,nil),
inference(demodulation,[status(thm)],[c214,c212]) ).
cnf(d19,plain,
neq(nil,nil),
inference(demodulation,[status(thm)],[d18,d17]) ).
cnf(d20,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[d19,d0]) ).
cnf(d21,plain,
$false,
inference(resolution,[status(thm)],[c97,d20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC357+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n009.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 : Sat Sep 26 12:53:01 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.96/16.10 % SZS status Theorem for theBenchmark.p
% 14.96/16.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------