%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC415-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:18 AM UTC 2026
% Result : Unsatisfiable 31.80s 8.40s
% Output : CNFRefutation 31.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 40 ( 13 unt; 6 nHn; 40 RR)
% Number of literals : 118 ( 41 equ; 83 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
ssList(sk2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4 ).
cnf(co1_6,negated_conjecture,
sk1 = sk3 ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| tl(sk4) != X0
| sk3 = X0
| ~ ssList(X0) ) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| sk1 != X0
| tl(sk2) != X0
| ~ ssList(X0) ) ).
cnf(clause8,axiom,
ssList(nil) ).
cnf(clause75,axiom,
( nil = X0
| ssList(tl(X0))
| ~ ssList(X0) ) ).
cnf(clause100,axiom,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ) ).
cnf(clause115,axiom,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ) ).
cnf(c1,plain,
ssList(sk2),
inference(clausification,[status(esa)],[co1_2]) ).
cnf(c4,plain,
sk2 = sk4,
inference(clausification,[status(esa)],[co1_5]) ).
cnf(c5,plain,
sk1 = sk3,
inference(clausification,[status(esa)],[co1_6]) ).
cnf(c6,plain,
neq(sk2,nil),
inference(clausification,[status(esa)],[co1_7]) ).
cnf(c10,plain,
( ~ neq(nil,sk4)
| ~ ssList(X0)
| sk3 = X0
| ~ neq(sk4,nil)
| tl(sk4) != X0 ),
inference(clausification,[status(esa)],[co1_11]) ).
cnf(c11,plain,
( tl(sk2) != X0
| sk1 != X0
| ~ neq(sk4,nil)
| ~ neq(nil,sk2)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[co1_12]) ).
cnf(c19,plain,
ssList(nil),
inference(clausification,[status(esa)],[clause8]) ).
cnf(c86,plain,
( nil = X0
| ssList(tl(X0))
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause75]) ).
cnf(c111,plain,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause100]) ).
cnf(c126,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| ~ neq(X0,X1)
| X0 != X1 ),
inference(clausification,[status(esa)],[clause115]) ).
cnf(d0,plain,
( ~ neq(X0,X0)
| ~ ssList(X0)
| ~ ssList(X0) ),
inference(equality_resolution,[status(thm)],[c126]) ).
cnf(d1,plain,
( ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 != X0 ),
inference(demodulation,[status(thm)],[c11,c4]) ).
cnf(d2,plain,
( ~ neq(nil,sk2)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 != X0 ),
inference(resolution,[status(thm)],[c6,d1]) ).
cnf(d3,plain,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2))
| sk1 != tl(sk2) ),
inference(equality_resolution,[status(thm)],[d2]) ).
cnf(d4,plain,
( ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssList(X0)
| tl(sk4) != X0
| sk1 = X0 ),
inference(demodulation,[status(thm)],[c10,c5]) ).
cnf(d5,plain,
( ~ neq(nil,sk4)
| ~ neq(sk4,nil)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 = X0 ),
inference(demodulation,[status(thm)],[d4,c4]) ).
cnf(d6,plain,
( ~ neq(nil,sk4)
| ~ neq(sk2,nil)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 = X0 ),
inference(demodulation,[status(thm)],[d5,c4]) ).
cnf(d7,plain,
( ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 = X0 ),
inference(demodulation,[status(thm)],[d6,c4]) ).
cnf(d8,plain,
( ~ neq(nil,sk2)
| ~ ssList(X0)
| tl(sk2) != X0
| sk1 = X0 ),
inference(resolution,[status(thm)],[c6,d7]) ).
cnf(d9,plain,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2))
| sk1 = tl(sk2) ),
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2))
| ~ neq(nil,sk2)
| ~ ssList(tl(sk2))
| sk1 != sk1 ),
inference(superposition,[status(thm)],[d9,d3]) ).
cnf(d11,plain,
( ~ neq(nil,sk2)
| ~ ssList(tl(sk2)) ),
inference(equality_resolution,[status(thm)],[d10]) ).
cnf(d12,plain,
( ~ ssList(nil)
| ~ ssList(sk2)
| nil = sk2
| ~ ssList(tl(sk2)) ),
inference(resolution,[status(thm)],[d11,c111]) ).
cnf(d13,plain,
( ~ ssList(tl(sk2))
| ~ ssList(nil)
| nil = sk2 ),
inference(resolution,[status(thm)],[c1,d12]) ).
cnf(d14,plain,
( ~ ssList(tl(sk2))
| nil = sk2 ),
inference(resolution,[status(thm)],[c19,d13]) ).
cnf(d15,plain,
( ~ ssList(sk2)
| nil = sk2
| nil = sk2 ),
inference(resolution,[status(thm)],[d14,c86]) ).
cnf(d16,plain,
nil = sk2,
inference(resolution,[status(thm)],[c1,d15]) ).
cnf(d17,plain,
neq(nil,nil),
inference(demodulation,[status(thm)],[c6,d16]) ).
cnf(d18,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[d17,d0]) ).
cnf(d19,plain,
$false,
inference(resolution,[status(thm)],[c19,d18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC415-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.59 % Computer : n011.cluster.edu
% 0.19/0.59 % Model : x86_64 x86_64
% 0.19/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.59 % Memory : 8046.5625MB
% 0.19/0.59 % OS : Linux 6.8.0-71-generic
% 0.19/0.59 % CPULimit : 300
% 0.19/0.59 % WCLimit : 300
% 0.19/0.59 % DateTime : Sat Sep 26 13:00:30 UTC 2026
% 0.19/0.60 % CPUTime :
% 0.19/0.60 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 31.80/8.40 % SZS status Unsatisfiable for theBenchmark.p
% 31.80/8.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------