%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC149+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 : n003.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:27 AM UTC 2026
% Result : Theorem 11.12s 5.89s
% Output : CNFRefutation 11.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 234 ( 65 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 325 ( 144 ~; 152 |; 9 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 18 !; 9 ?)
% 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(ax16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ) ).
fof(ax17,axiom,
ssList(nil) ).
fof(ax20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ) ).
fof(ax27,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,app(X1,X0)) = app(cons(X2,X1),X0) ) ) ) ).
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)
=> ( singletonP(X1)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) = X3
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( singletonP(X1)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) = X3
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negate_conjecture,[status(cth)],[co1]) ).
cnf(c11,plain,
( cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax4]) ).
cnf(c94,plain,
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax15]) ).
cnf(c96,plain,
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax16]) ).
cnf(c97,plain,
ssList(nil),
inference(clausification,[status(esa)],[ax17]) ).
cnf(c101,plain,
( ssList(sK120(X0))
| nil = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax20]) ).
cnf(c102,plain,
( ssItem(sK121(X0))
| nil = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax20]) ).
cnf(c103,plain,
( cons(sK121(X0),sK120(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax20]) ).
cnf(c110,plain,
( cons(X2,app(X1,X0)) = app(cons(X2,X1),X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax27]) ).
cnf(c111,plain,
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[ax28]) ).
cnf(c209,plain,
ssList(sK254),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c212,plain,
sK254 = sK256,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c214,plain,
neq(sK254,nil),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c215,plain,
( app(app(cons(X0,nil),cons(X1,nil)),X2) != sK256
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c216,plain,
~ singletonP(sK254),
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,
( ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X1)
| app(app(cons(X0,nil),cons(X1,nil)),X2) != sK254 ),
inference(demodulation,[status(thm)],[c215,c212]) ).
cnf(d2,plain,
( ~ ssList(cons(X1,nil))
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X1)
| app(cons(X0,app(nil,cons(X1,nil))),X2) != sK254 ),
inference(superposition,[status(thm)],[c110,d1]) ).
cnf(d3,plain,
( ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X0)
| ~ ssItem(X1)
| app(cons(X0,app(nil,cons(X1,nil))),X2) != sK254 ),
inference(resolution,[status(thm)],[c97,d2]) ).
cnf(d4,plain,
( ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0)
| app(cons(X1,cons(X0,nil)),X2) != sK254 ),
inference(superposition,[status(thm)],[c111,d3]) ).
cnf(d5,plain,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X0)
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0)
| cons(X0,app(cons(X1,nil),X2)) != sK254 ),
inference(superposition,[status(thm)],[c110,d4]) ).
cnf(d6,plain,
( ~ ssList(X1)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssItem(X0)
| cons(X2,cons(X0,app(nil,X1))) != sK254 ),
inference(superposition,[status(thm)],[c110,d5]) ).
cnf(d7,plain,
( ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0)
| cons(X0,cons(X1,app(nil,X2))) != sK254 ),
inference(resolution,[status(thm)],[c97,d6]) ).
cnf(d8,plain,
( ~ ssList(X0)
| ~ ssList(cons(X2,nil))
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ ssItem(X2)
| cons(X1,cons(X2,X0)) != sK254 ),
inference(superposition,[status(thm)],[c111,d7]) ).
cnf(d9,plain,
( ~ ssList(X0)
| nil = X0
| ~ ssList(cons(sK121(X0),nil))
| ~ ssList(sK120(X0))
| ~ ssItem(X1)
| ~ ssItem(sK121(X0))
| cons(X1,X0) != sK254 ),
inference(superposition,[status(thm)],[c103,d8]) ).
cnf(d10,plain,
( ~ ssList(X0)
| nil = X0
| ~ ssList(sK120(sK120(X0)))
| ~ ssList(cons(sK121(sK120(X0)),nil))
| ~ ssList(sK120(X0))
| ~ ssItem(sK121(sK120(X0)))
| ~ ssItem(sK121(X0))
| nil = sK120(X0)
| X0 != sK254 ),
inference(superposition,[status(thm)],[c103,d9]) ).
cnf(d11,plain,
( ~ ssList(sK120(sK120(sK254)))
| ~ ssList(sK120(sK254))
| ~ ssList(cons(sK121(sK120(sK254)),nil))
| ~ ssList(sK254)
| ~ ssItem(sK121(sK120(sK254)))
| ~ ssItem(sK121(sK254))
| nil = sK120(sK254)
| nil = sK254 ),
inference(equality_resolution,[status(thm)],[d10]) ).
cnf(d12,plain,
( ~ ssList(sK120(sK254))
| ~ ssList(sK120(sK120(sK254)))
| ~ ssList(cons(sK121(sK120(sK254)),nil))
| ~ ssItem(sK121(sK254))
| ~ ssItem(sK121(sK120(sK254)))
| nil = sK254
| nil = sK120(sK254) ),
inference(resolution,[status(thm)],[c209,d11]) ).
cnf(d13,plain,
( ~ ssList(nil)
| ~ ssItem(sK121(sK120(sK254)))
| ~ ssList(sK120(sK254))
| ~ ssList(sK120(sK120(sK254)))
| ~ ssItem(sK121(sK254))
| ~ ssItem(sK121(sK120(sK254)))
| nil = sK254
| nil = sK120(sK254) ),
inference(resolution,[status(thm)],[d12,c96]) ).
cnf(d14,plain,
( ~ ssList(sK120(sK254))
| ~ ssList(sK120(sK120(sK254)))
| ~ ssItem(sK121(sK254))
| ~ ssItem(sK121(sK120(sK254)))
| nil = sK254
| nil = sK120(sK254) ),
inference(resolution,[status(thm)],[c97,d13]) ).
cnf(d15,plain,
( ~ ssList(sK120(sK254))
| nil = sK120(sK254)
| ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| ~ ssItem(sK121(sK120(sK254)))
| nil = sK254
| nil = sK120(sK254) ),
inference(resolution,[status(thm)],[d14,c101]) ).
cnf(d16,plain,
( ~ ssList(sK120(sK254))
| nil = sK120(sK254)
| ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254
| nil = sK120(sK254) ),
inference(resolution,[status(thm)],[d15,c102]) ).
cnf(d17,plain,
( ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254
| ~ ssList(sK254)
| nil = sK254
| cons(sK121(sK254),nil) = sK254 ),
inference(superposition,[status(thm)],[d16,c103]) ).
cnf(d18,plain,
( ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254
| cons(sK121(sK254),nil) = sK254 ),
inference(resolution,[status(thm)],[c209,d17]) ).
cnf(d19,plain,
( ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254
| singletonP(X0)
| ~ ssList(X0)
| ~ ssItem(sK121(sK254))
| sK254 != X0 ),
inference(superposition,[status(thm)],[d18,c11]) ).
cnf(d20,plain,
( singletonP(sK254)
| ~ ssList(sK120(sK254))
| ~ ssList(sK254)
| ~ ssItem(sK121(sK254))
| nil = sK254 ),
inference(equality_resolution,[status(thm)],[d19]) ).
cnf(d21,plain,
( singletonP(sK254)
| ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254 ),
inference(resolution,[status(thm)],[c209,d20]) ).
cnf(d22,plain,
( ~ ssList(sK120(sK254))
| ~ ssItem(sK121(sK254))
| nil = sK254 ),
inference(resolution,[status(thm)],[c216,d21]) ).
cnf(d23,plain,
( ~ ssList(sK254)
| nil = sK254
| ~ ssItem(sK121(sK254))
| nil = sK254 ),
inference(resolution,[status(thm)],[d22,c101]) ).
cnf(d24,plain,
( ~ ssItem(sK121(sK254))
| nil = sK254 ),
inference(resolution,[status(thm)],[c209,d23]) ).
cnf(d25,plain,
( ~ ssList(sK254)
| nil = sK254
| nil = sK254 ),
inference(resolution,[status(thm)],[d24,c102]) ).
cnf(d26,plain,
nil = sK254,
inference(resolution,[status(thm)],[c209,d25]) ).
cnf(d27,plain,
neq(nil,nil),
inference(demodulation,[status(thm)],[c214,d26]) ).
cnf(d28,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[d27,d0]) ).
cnf(d29,plain,
$false,
inference(resolution,[status(thm)],[c97,d28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC149+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.08/0.56 % Computer : n003.cluster.edu
% 0.08/0.56 % Model : x86_64 x86_64
% 0.08/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.56 % Memory : 8046.5625MB
% 0.08/0.56 % OS : Linux 6.8.0-71-generic
% 0.08/0.56 % CPULimit : 300
% 0.08/0.56 % WCLimit : 300
% 0.08/0.56 % DateTime : Sat Sep 26 12:22:39 UTC 2026
% 0.08/0.56 % CPUTime :
% 0.08/0.56 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.12/5.89 % SZS status Theorem for theBenchmark.p
% 11.12/5.89 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------