%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC339+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 : n007.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:02 AM UTC 2026
% Result : Theorem 24.81s 3.62s
% Output : CNFRefutation 24.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 107 ( 27 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 123 ( 40 ~; 38 |; 30 &)
% ( 1 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 14 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
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(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X10] :
( ? [X11] :
( ? [X12] :
( ? [X13] :
( leq(X12,X10)
& app(X13,cons(X12,nil)) = X2
& ssList(X13) )
& ssItem(X12) )
& app(cons(X10,nil),X11) = X5
& ssList(X11) )
& ssItem(X10) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( ? [X9] :
( leq(X6,X8)
& app(cons(X8,nil),X9) = X2
& ssList(X9) )
& ssItem(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ totalorderedP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
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(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,
ssList(sK257),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
ssList(sK258),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c216,plain,
app(app(sK257,sK255),sK258) = sK256,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c217,plain,
totalorderedP(sK255),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c221,plain,
( ~ totalorderedP(sK253)
| ~ segmentP(sK254,sK253) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( segmentP(X0,sK255)
| ~ ssList(sK257)
| ~ ssList(sK255)
| ~ ssList(sK258)
| ~ ssList(X0)
| sK256 != X0 ),
inference(superposition,[status(thm)],[c216,c21]) ).
cnf(d1,plain,
( segmentP(X0,sK255)
| ~ ssList(sK258)
| ~ ssList(sK257)
| ~ ssList(X0)
| sK256 != X0 ),
inference(resolution,[status(thm)],[c210,d0]) ).
cnf(d2,plain,
( segmentP(X0,sK255)
| ~ ssList(sK258)
| ~ ssList(X0)
| sK256 != X0 ),
inference(resolution,[status(thm)],[c214,d1]) ).
cnf(d3,plain,
( segmentP(X0,sK255)
| ~ ssList(X0)
| sK256 != X0 ),
inference(resolution,[status(thm)],[c215,d2]) ).
cnf(d4,plain,
( segmentP(sK256,sK255)
| ~ ssList(sK256) ),
inference(equality_resolution,[status(thm)],[d3]) ).
cnf(d5,plain,
segmentP(sK256,sK255),
inference(resolution,[status(thm)],[c211,d4]) ).
cnf(d6,plain,
( ~ totalorderedP(sK253)
| ~ segmentP(sK256,sK253) ),
inference(demodulation,[status(thm)],[c221,c212]) ).
cnf(d7,plain,
( ~ totalorderedP(sK253)
| ~ segmentP(sK256,sK255) ),
inference(demodulation,[status(thm)],[d6,c213]) ).
cnf(d8,plain,
( ~ totalorderedP(sK255)
| ~ segmentP(sK256,sK255) ),
inference(demodulation,[status(thm)],[d7,c213]) ).
cnf(d9,plain,
~ segmentP(sK256,sK255),
inference(resolution,[status(thm)],[c217,d8]) ).
cnf(d10,plain,
$false,
inference(resolution,[status(thm)],[d9,d5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC339+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n007.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Sat Sep 26 12:47:53 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 24.81/3.62 % SZS status Theorem for theBenchmark.p
% 24.81/3.62 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------