%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC275+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 : n016.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:49 AM UTC 2026
% Result : Theorem 19.01s 2.91s
% Output : CNFRefutation 19.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 82 ( 32 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 86 ( 34 ~; 38 |; 4 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ) ).
fof(ax66,axiom,
totalorderedP(nil) ).
fof(co1,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X4] :
( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| ( nil = X3
& nil != X2 )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
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(c159,plain,
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[ax65]) ).
cnf(c160,plain,
totalorderedP(nil),
inference(clausification,[status(esa)],[ax66]) ).
cnf(c211,plain,
ssList(sK256),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c213,plain,
sK253 = sK255,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c214,plain,
~ totalorderedP(sK253),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
( nil != sK256
| nil = sK255 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c216,plain,
( ~ neq(sK256,nil)
| ssItem(sK257) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c217,plain,
( ~ neq(sK256,nil)
| cons(sK257,nil) = sK255 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ssItem(sK257)
| ~ ssList(sK256)
| ~ ssList(nil)
| sK256 = nil ),
inference(resolution,[status(thm)],[c95,c216]) ).
cnf(d1,plain,
( ~ ssList(nil)
| ssItem(sK257)
| sK256 = nil ),
inference(resolution,[status(thm)],[c211,d0]) ).
cnf(d2,plain,
( ssItem(sK257)
| sK256 = nil ),
inference(resolution,[status(thm)],[c97,d1]) ).
cnf(d3,plain,
( cons(sK257,nil) = sK255
| ~ ssList(sK256)
| ~ ssList(nil)
| sK256 = nil ),
inference(resolution,[status(thm)],[c95,c217]) ).
cnf(d4,plain,
( ~ ssList(nil)
| sK256 = nil
| cons(sK257,nil) = sK255 ),
inference(resolution,[status(thm)],[c211,d3]) ).
cnf(d5,plain,
( sK256 = nil
| cons(sK257,nil) = sK255 ),
inference(resolution,[status(thm)],[c97,d4]) ).
cnf(d6,plain,
( sK256 = nil
| ~ ssItem(sK257)
| totalorderedP(sK255) ),
inference(superposition,[status(thm)],[d5,c159]) ).
cnf(d7,plain,
~ totalorderedP(sK255),
inference(demodulation,[status(thm)],[c214,c213]) ).
cnf(d8,plain,
( ~ ssItem(sK257)
| sK256 = nil ),
inference(resolution,[status(thm)],[d7,d6]) ).
cnf(d9,plain,
( sK256 = nil
| sK256 = nil ),
inference(resolution,[status(thm)],[d8,d2]) ).
cnf(d10,plain,
( nil != nil
| nil = sK255 ),
inference(demodulation,[status(thm)],[c215,d9]) ).
cnf(d11,plain,
nil = sK255,
inference(equality_resolution,[status(thm)],[d10]) ).
cnf(d12,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm)],[d7,d11]) ).
cnf(d13,plain,
$false,
inference(resolution,[status(thm)],[c160,d12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC275+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.11/0.37 % Computer : n016.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 12:45:15 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.01/2.91 % SZS status Theorem for theBenchmark.p
% 19.01/2.91 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------