%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC009+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 : 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 : Sun Sep 27 08:53:55 AM UTC 2026
% Result : Theorem 30.53s 4.40s
% Output : CNFRefutation 30.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 97 ( 44 equ)
% Maximal formula atoms : 23 ( 3 avg)
% Number of connectives : 120 ( 48 ~; 39 |; 22 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 11 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax17,axiom,
ssList(nil) ).
fof(ax84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ) ).
fof(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c97,plain,
ssList(nil),
inference(clausification,[status(esa)],[ax17]) ).
cnf(c194,plain,
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax84]) ).
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(X2)
| app(app(X1,X0),X2) != sK254
| app(X1,X2) != sK253
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
ssList(sK260),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c216,plain,
app(sK255,sK260) = sK256,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
app(sK255,nil) = sK255,
inference(resolution,[status(thm)],[c194,c210]) ).
cnf(d1,plain,
( ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| app(app(X0,X2),X1) != sK254
| app(X0,X1) != sK255 ),
inference(demodulation,[status(thm)],[c214,c213]) ).
cnf(d2,plain,
( ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| app(app(X0,X2),X1) != sK256
| app(X0,X1) != sK255 ),
inference(demodulation,[status(thm)],[d1,c212]) ).
cnf(d3,plain,
( ~ ssList(X0)
| ~ ssList(sK255)
| ~ ssList(sK260)
| app(sK255,X0) != sK255
| app(sK256,X0) != sK256 ),
inference(superposition,[status(thm)],[c216,d2]) ).
cnf(d4,plain,
( ~ ssList(sK260)
| ~ ssList(X0)
| app(sK256,X0) != sK256
| app(sK255,X0) != sK255 ),
inference(resolution,[status(thm)],[c210,d3]) ).
cnf(d5,plain,
( ~ ssList(X0)
| app(sK256,X0) != sK256
| app(sK255,X0) != sK255 ),
inference(resolution,[status(thm)],[c215,d4]) ).
cnf(d6,plain,
app(sK256,nil) = sK256,
inference(resolution,[status(thm)],[c194,c211]) ).
cnf(d7,plain,
( ~ ssList(nil)
| app(sK255,nil) != sK255
| sK256 != sK256 ),
inference(superposition,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
( ~ ssList(nil)
| sK256 != sK256
| sK255 != sK255 ),
inference(demodulation,[status(thm)],[d7,d0]) ).
cnf(d9,plain,
( sK256 != sK256
| sK255 != sK255 ),
inference(resolution,[status(thm)],[c97,d8]) ).
cnf(d10,plain,
sK255 != sK255,
inference(equality_resolution,[status(thm)],[d9]) ).
cnf(d11,plain,
$false,
inference(equality_resolution,[status(thm)],[d10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC009+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.17/0.42 % Computer : n005.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Sat Sep 26 12:03:02 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.53/4.40 % SZS status Theorem for theBenchmark.p
% 30.53/4.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------