%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC277+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 : n019.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:50 AM UTC 2026
% Result : Theorem 12.24s 2.87s
% Output : CNFRefutation 12.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 14 unt; 0 def)
% Number of atoms : 92 ( 26 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 88 ( 33 ~; 36 |; 3 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ) ).
fof(ax15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ) ).
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] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| totalorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ~ singletonP(X2) )
| totalorderedP(X0)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c9,plain,
( ssItem(sK11(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax4]) ).
cnf(c10,plain,
( cons(sK11(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax4]) ).
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(c151,plain,
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax58]) ).
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(c210,plain,
ssList(sK255),
inference(clausification,[status(esa)],[negated_conjecture]) ).
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,
segmentP(sK256,sK255),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
~ totalorderedP(sK253),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c216,plain,
( ~ neq(sK256,nil)
| singletonP(sK255) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( singletonP(sK255)
| ~ ssList(sK256)
| ~ ssList(nil)
| sK256 = nil ),
inference(resolution,[status(thm)],[c95,c216]) ).
cnf(d1,plain,
( singletonP(sK255)
| ~ ssList(nil)
| sK256 = nil ),
inference(resolution,[status(thm)],[c211,d0]) ).
cnf(d2,plain,
( singletonP(sK255)
| sK256 = nil ),
inference(resolution,[status(thm)],[c97,d1]) ).
cnf(d3,plain,
( ~ ssList(sK255)
| cons(sK11(sK255),nil) = sK255
| sK256 = nil ),
inference(resolution,[status(thm)],[d2,c10]) ).
cnf(d4,plain,
( sK256 = nil
| cons(sK11(sK255),nil) = sK255 ),
inference(resolution,[status(thm)],[c210,d3]) ).
cnf(d5,plain,
( sK256 = nil
| ~ ssItem(sK11(sK255))
| totalorderedP(sK255) ),
inference(superposition,[status(thm)],[d4,c159]) ).
cnf(d6,plain,
~ totalorderedP(sK255),
inference(demodulation,[status(thm)],[c215,c213]) ).
cnf(d7,plain,
( ~ ssItem(sK11(sK255))
| sK256 = nil ),
inference(resolution,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
( ~ singletonP(sK255)
| ~ ssList(sK255)
| sK256 = nil ),
inference(resolution,[status(thm)],[d7,c9]) ).
cnf(d9,plain,
( ~ singletonP(sK255)
| sK256 = nil ),
inference(resolution,[status(thm)],[c210,d8]) ).
cnf(d10,plain,
( sK256 = nil
| sK256 = nil ),
inference(resolution,[status(thm)],[d9,d2]) ).
cnf(d11,plain,
segmentP(nil,sK255),
inference(demodulation,[status(thm)],[c214,d10]) ).
cnf(d12,plain,
( ~ ssList(sK255)
| nil = sK255 ),
inference(resolution,[status(thm)],[c151,d11]) ).
cnf(d13,plain,
nil = sK255,
inference(resolution,[status(thm)],[c210,d12]) ).
cnf(d14,plain,
~ totalorderedP(nil),
inference(demodulation,[status(thm)],[d6,d13]) ).
cnf(d15,plain,
$false,
inference(resolution,[status(thm)],[c160,d14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC277+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.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sat Sep 26 12:40:48 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.24/2.87 % SZS status Theorem for theBenchmark.p
% 12.24/2.87 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------