%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SWC397-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 : 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:55:15 AM UTC 2026
% Result : Unsatisfiable 107.51s 27.73s
% Output : CNFRefutation 107.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 28
% Syntax : Number of clauses : 144 ( 26 unt; 50 nHn; 123 RR)
% Number of literals : 454 ( 88 equ; 270 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 127 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_3,negated_conjecture,
ssList(sk3) ).
cnf(co1_4,negated_conjecture,
ssList(sk4) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4 ).
cnf(co1_6,negated_conjecture,
sk1 = sk3 ).
cnf(co1_7,negated_conjecture,
ssItem(sk5) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5) ).
cnf(co1_10,negated_conjecture,
( nil != sk4
| nil = sk3 ) ).
cnf(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk6) ) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ) ).
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk6,nil),sk7) = sk3 ) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk7,cons(sk6,nil)) = sk4 ) ).
cnf(clause8,axiom,
ssList(nil) ).
cnf(clause51,axiom,
ssList(skaf45(X0,X1)) ).
cnf(clause71,axiom,
( ~ ssItem(X0)
| ~ memberP(nil,X0) ) ).
cnf(clause72,axiom,
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ) ).
cnf(clause85,axiom,
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ) ).
cnf(clause86,axiom,
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ) ).
cnf(clause100,axiom,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ) ).
cnf(clause102,axiom,
( X1 = X0
| neq(X1,X0)
| ~ ssItem(X1)
| ~ ssItem(X0) ) ).
cnf(clause120,axiom,
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ) ).
cnf(clause132,axiom,
( app(X1,skaf45(X0,X1)) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1) ) ).
cnf(clause138,axiom,
( memberP(cons(X1,X2),X0)
| ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| X0 != X1 ) ).
cnf(clause140,axiom,
( memberP(app(X0,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ memberP(X0,X1) ) ).
cnf(clause141,axiom,
( memberP(app(X2,X0),X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ memberP(X0,X1) ) ).
cnf(clause144,axiom,
( frontsegP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| app(X0,X1) != X2 ) ).
cnf(clause161,axiom,
( X2 = X0
| memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ memberP(cons(X0,X1),X2) ) ).
cnf(clause179,axiom,
( ~ ssList(X4)
| ~ duplicatefreeP(X4)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ) ).
cnf(c2,plain,
ssList(sk3),
inference(clausification,[status(esa)],[co1_3]) ).
cnf(c3,plain,
ssList(sk4),
inference(clausification,[status(esa)],[co1_4]) ).
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,
ssItem(sk5),
inference(clausification,[status(esa)],[co1_7]) ).
cnf(c7,plain,
memberP(sk1,sk5),
inference(clausification,[status(esa)],[co1_8]) ).
cnf(c8,plain,
~ memberP(sk2,sk5),
inference(clausification,[status(esa)],[co1_9]) ).
cnf(c9,plain,
( nil != sk4
| nil = sk3 ),
inference(clausification,[status(esa)],[co1_10]) ).
cnf(c10,plain,
( ~ neq(sk4,nil)
| ssItem(sk6) ),
inference(clausification,[status(esa)],[co1_11]) ).
cnf(c11,plain,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(clausification,[status(esa)],[co1_12]) ).
cnf(c12,plain,
( ~ neq(sk4,nil)
| app(cons(sk6,nil),sk7) = sk3 ),
inference(clausification,[status(esa)],[co1_13]) ).
cnf(c13,plain,
( ~ neq(sk4,nil)
| app(sk7,cons(sk6,nil)) = sk4 ),
inference(clausification,[status(esa)],[co1_14]) ).
cnf(c21,plain,
ssList(nil),
inference(clausification,[status(esa)],[clause8]) ).
cnf(c64,plain,
ssList(skaf45(X0,X1)),
inference(clausification,[status(esa)],[clause51]) ).
cnf(c84,plain,
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(clausification,[status(esa)],[clause71]) ).
cnf(c85,plain,
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause72]) ).
cnf(c98,plain,
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause85]) ).
cnf(c99,plain,
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[clause86]) ).
cnf(c113,plain,
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause100]) ).
cnf(c115,plain,
( X1 = X0
| neq(X1,X0)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[clause102]) ).
cnf(c133,plain,
( app(cons(X0,nil),X1) = cons(X0,X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[clause120]) ).
cnf(c145,plain,
( app(X1,skaf45(X0,X1)) = X0
| ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1) ),
inference(clausification,[status(esa)],[clause132]) ).
cnf(c151,plain,
( ~ ssItem(X2)
| memberP(cons(X2,X0),X1)
| ~ ssItem(X1)
| X1 != X2
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause138]) ).
cnf(c153,plain,
( ~ ssList(X1)
| memberP(app(X1,X0),X2)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause140]) ).
cnf(c154,plain,
( memberP(app(X0,X1),X2)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause141]) ).
cnf(c157,plain,
( ~ ssList(X2)
| frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(clausification,[status(esa)],[clause144]) ).
cnf(c174,plain,
( ~ ssItem(X0)
| X2 = X0
| ~ ssItem(X2)
| ~ ssList(X1)
| memberP(X1,X2)
| ~ memberP(cons(X0,X1),X2) ),
inference(clausification,[status(esa)],[clause161]) ).
cnf(c192,plain,
( ~ ssList(X4)
| app(app(X4,cons(X0,X3)),cons(X0,X2)) != X1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(clausification,[status(esa)],[clause179]) ).
cnf(d0,plain,
( memberP(cons(X1,X0),X1)
| ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(equality_resolution,[status(thm)],[c151]) ).
cnf(d1,plain,
( ~ neq(sk4,nil)
| ~ memberP(cons(sk6,nil),X0)
| ~ ssItem(X0)
| ~ ssList(cons(sk6,nil))
| ~ ssList(sk7)
| memberP(sk4,X0) ),
inference(superposition,[status(thm)],[c13,c154]) ).
cnf(d2,plain,
~ memberP(sk4,sk5),
inference(demodulation,[status(thm)],[c8,c4]) ).
cnf(d3,plain,
( ssList(sk7)
| ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil ),
inference(resolution,[status(thm)],[c113,c11]) ).
cnf(d4,plain,
( ssList(sk7)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d3]) ).
cnf(d5,plain,
( ssList(sk7)
| sk4 = nil ),
inference(resolution,[status(thm)],[c21,d4]) ).
cnf(d6,plain,
( ssList(sk7)
| ~ memberP(nil,sk5) ),
inference(superposition,[status(thm)],[d5,d2]) ).
cnf(d7,plain,
memberP(sk3,sk5),
inference(demodulation,[status(thm)],[c7,c5]) ).
cnf(d8,plain,
( ssList(sk7)
| nil = sk3
| nil != nil ),
inference(superposition,[status(thm)],[d5,c9]) ).
cnf(d9,plain,
( ssList(sk7)
| nil = sk3 ),
inference(equality_resolution,[status(thm)],[d8]) ).
cnf(d10,plain,
( ssList(sk7)
| memberP(nil,sk5) ),
inference(superposition,[status(thm)],[d9,d7]) ).
cnf(d11,plain,
( ssList(sk7)
| ssList(sk7) ),
inference(resolution,[status(thm)],[d10,d6]) ).
cnf(d12,plain,
( ~ neq(sk4,nil)
| ~ memberP(cons(sk6,nil),X0)
| memberP(sk4,X0)
| ~ ssItem(X0)
| ~ ssList(cons(sk6,nil)) ),
inference(resolution,[status(thm)],[d11,d1]) ).
cnf(d13,plain,
( ~ ssItem(sk6)
| ~ ssList(nil)
| ~ neq(sk4,nil)
| memberP(sk4,sk6)
| ~ ssItem(sk6)
| ~ ssList(cons(sk6,nil)) ),
inference(resolution,[status(thm)],[d12,d0]) ).
cnf(d14,plain,
( ~ neq(sk4,nil)
| memberP(sk4,sk6)
| ~ ssItem(sk6)
| ~ ssList(cons(sk6,nil)) ),
inference(resolution,[status(thm)],[c21,d13]) ).
cnf(d15,plain,
( ssItem(sk6)
| ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil ),
inference(resolution,[status(thm)],[c113,c10]) ).
cnf(d16,plain,
( ssItem(sk6)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d15]) ).
cnf(d17,plain,
( ssItem(sk6)
| sk4 = nil ),
inference(resolution,[status(thm)],[c21,d16]) ).
cnf(d18,plain,
( ssItem(sk6)
| ~ memberP(nil,sk5) ),
inference(superposition,[status(thm)],[d17,d2]) ).
cnf(d19,plain,
( ssItem(sk6)
| nil = sk3
| nil != nil ),
inference(superposition,[status(thm)],[d17,c9]) ).
cnf(d20,plain,
( ssItem(sk6)
| nil = sk3 ),
inference(equality_resolution,[status(thm)],[d19]) ).
cnf(d21,plain,
( ssItem(sk6)
| memberP(nil,sk5) ),
inference(superposition,[status(thm)],[d20,d7]) ).
cnf(d22,plain,
( ssItem(sk6)
| ssItem(sk6) ),
inference(resolution,[status(thm)],[d21,d18]) ).
cnf(d23,plain,
( ~ neq(sk4,nil)
| memberP(sk4,sk6)
| ~ ssList(cons(sk6,nil)) ),
inference(resolution,[status(thm)],[d22,d14]) ).
cnf(d24,plain,
( ~ ssItem(sk6)
| ~ ssList(nil)
| ~ neq(sk4,nil)
| memberP(sk4,sk6) ),
inference(resolution,[status(thm)],[d23,c99]) ).
cnf(d25,plain,
( ~ neq(sk4,nil)
| memberP(sk4,sk6)
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c21,d24]) ).
cnf(d26,plain,
( ~ neq(sk4,nil)
| memberP(sk4,sk6) ),
inference(resolution,[status(thm)],[d22,d25]) ).
cnf(d27,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil
| memberP(sk4,sk6) ),
inference(resolution,[status(thm)],[d26,c113]) ).
cnf(d28,plain,
( memberP(sk4,sk6)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d27]) ).
cnf(d29,plain,
( memberP(sk4,sk6)
| sk4 = nil ),
inference(resolution,[status(thm)],[c21,d28]) ).
cnf(d30,plain,
( ~ frontsegP(X1,X0)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ memberP(X0,X2)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(skaf45(X1,X0))
| memberP(X1,X2) ),
inference(superposition,[status(thm)],[c145,c153]) ).
cnf(d31,plain,
( ~ frontsegP(X0,X1)
| ~ memberP(X1,X2)
| memberP(X0,X2)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c64,d30]) ).
cnf(d32,plain,
( ~ neq(sk4,nil)
| frontsegP(X0,sk7)
| ~ ssList(sk7)
| ~ ssList(cons(sk6,nil))
| ~ ssList(X0)
| sk4 != X0 ),
inference(superposition,[status(thm)],[c13,c157]) ).
cnf(d33,plain,
( frontsegP(X0,sk7)
| ~ neq(sk4,nil)
| ~ ssList(cons(sk6,nil))
| ~ ssList(X0)
| sk4 != X0 ),
inference(resolution,[status(thm)],[d11,d32]) ).
cnf(d34,plain,
( frontsegP(sk4,sk7)
| ~ neq(sk4,nil)
| ~ ssList(cons(sk6,nil))
| ~ ssList(sk4) ),
inference(equality_resolution,[status(thm)],[d33]) ).
cnf(d35,plain,
( frontsegP(sk4,sk7)
| ~ neq(sk4,nil)
| ~ ssList(cons(sk6,nil)) ),
inference(resolution,[status(thm)],[c3,d34]) ).
cnf(d36,plain,
( ~ ssItem(sk6)
| ~ ssList(nil)
| frontsegP(sk4,sk7)
| ~ neq(sk4,nil) ),
inference(resolution,[status(thm)],[d35,c99]) ).
cnf(d37,plain,
( frontsegP(sk4,sk7)
| ~ neq(sk4,nil)
| ~ ssItem(sk6) ),
inference(resolution,[status(thm)],[c21,d36]) ).
cnf(d38,plain,
( frontsegP(sk4,sk7)
| ~ neq(sk4,nil) ),
inference(resolution,[status(thm)],[d22,d37]) ).
cnf(d39,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil
| frontsegP(sk4,sk7) ),
inference(resolution,[status(thm)],[d38,c113]) ).
cnf(d40,plain,
( frontsegP(sk4,sk7)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d39]) ).
cnf(d41,plain,
( frontsegP(sk4,sk7)
| sk4 = nil ),
inference(resolution,[status(thm)],[c21,d40]) ).
cnf(d42,plain,
( memberP(sk4,X0)
| ~ memberP(sk7,X0)
| ~ ssItem(X0)
| ~ ssList(sk4)
| ~ ssList(sk7)
| sk4 = nil ),
inference(resolution,[status(thm)],[d41,d31]) ).
cnf(d43,plain,
( ~ memberP(sk7,X0)
| memberP(sk4,X0)
| ~ ssItem(X0)
| ~ ssList(sk7)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d42]) ).
cnf(d44,plain,
( ~ memberP(sk7,X0)
| memberP(sk4,X0)
| ~ ssItem(X0)
| sk4 = nil ),
inference(resolution,[status(thm)],[d11,d43]) ).
cnf(d45,plain,
( duplicatefreeP(app(X1,X0))
| ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c98,c85]) ).
cnf(d46,plain,
( ~ neq(sk4,nil)
| ~ duplicatefreeP(X1)
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(nil)
| app(sk4,cons(sk6,X0)) != X1 ),
inference(superposition,[status(thm)],[c13,c192]) ).
cnf(d47,plain,
( ~ duplicatefreeP(X1)
| ~ neq(sk4,nil)
| ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sk4,cons(sk6,X0)) != X1 ),
inference(resolution,[status(thm)],[c21,d46]) ).
cnf(d48,plain,
( ~ duplicatefreeP(X1)
| ~ neq(sk4,nil)
| ~ ssItem(sk6)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sk4,cons(sk6,X0)) != X1 ),
inference(resolution,[status(thm)],[d11,d47]) ).
cnf(d49,plain,
( ~ duplicatefreeP(X1)
| ~ neq(sk4,nil)
| ~ ssList(X0)
| ~ ssList(X1)
| app(sk4,cons(sk6,X0)) != X1 ),
inference(resolution,[status(thm)],[d22,d48]) ).
cnf(d50,plain,
( ~ ssItem(sk6)
| ~ ssList(sk7)
| ~ neq(sk4,nil)
| cons(sk6,sk7) = sk3 ),
inference(superposition,[status(thm)],[c133,c12]) ).
cnf(d51,plain,
( ~ neq(sk4,nil)
| ~ ssItem(sk6)
| cons(sk6,sk7) = sk3 ),
inference(resolution,[status(thm)],[d11,d50]) ).
cnf(d52,plain,
( ~ neq(sk4,nil)
| cons(sk6,sk7) = sk3 ),
inference(resolution,[status(thm)],[d22,d51]) ).
cnf(d53,plain,
( ~ neq(sk4,nil)
| ~ duplicatefreeP(X0)
| ~ neq(sk4,nil)
| ~ ssList(sk7)
| ~ ssList(X0)
| app(sk4,sk3) != X0 ),
inference(superposition,[status(thm)],[d52,d49]) ).
cnf(d54,plain,
( ~ duplicatefreeP(X0)
| ~ neq(sk4,nil)
| ~ ssList(X0)
| app(sk4,sk3) != X0 ),
inference(resolution,[status(thm)],[d11,d53]) ).
cnf(d55,plain,
( ~ duplicatefreeP(app(sk4,sk3))
| ~ neq(sk4,nil)
| ~ ssList(app(sk4,sk3)) ),
inference(equality_resolution,[status(thm)],[d54]) ).
cnf(d56,plain,
( ssItem(X0)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ neq(sk4,nil)
| ~ ssList(app(sk4,sk3)) ),
inference(resolution,[status(thm)],[d55,d45]) ).
cnf(d57,plain,
( ~ neq(sk4,nil)
| ssItem(X0)
| ~ ssList(app(sk4,sk3))
| ~ ssList(sk4) ),
inference(resolution,[status(thm)],[c2,d56]) ).
cnf(d58,plain,
( ~ neq(sk4,nil)
| ssItem(X0)
| ~ ssList(app(sk4,sk3)) ),
inference(resolution,[status(thm)],[c3,d57]) ).
cnf(d59,plain,
( ~ ssList(sk4)
| ~ ssList(sk3)
| ~ neq(sk4,nil)
| ssItem(X0) ),
inference(resolution,[status(thm)],[d58,c98]) ).
cnf(d60,plain,
( ~ neq(sk4,nil)
| ssItem(X0)
| ~ ssList(sk4) ),
inference(resolution,[status(thm)],[c2,d59]) ).
cnf(d61,plain,
( ~ neq(sk4,nil)
| ssItem(X0) ),
inference(resolution,[status(thm)],[c3,d60]) ).
cnf(d62,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| sk4 = nil
| ssItem(X0) ),
inference(resolution,[status(thm)],[d61,c113]) ).
cnf(d63,plain,
( ssItem(X0)
| ~ ssList(nil)
| sk4 = nil ),
inference(resolution,[status(thm)],[c3,d62]) ).
cnf(d64,plain,
( ssItem(X0)
| sk4 = nil ),
inference(resolution,[status(thm)],[c21,d63]) ).
cnf(d65,plain,
( ssItem(X0)
| nil = sk3
| nil != nil ),
inference(superposition,[status(thm)],[d64,c9]) ).
cnf(d66,plain,
( ssItem(X0)
| nil = sk3 ),
inference(equality_resolution,[status(thm)],[d65]) ).
cnf(d67,plain,
( ssItem(X0)
| memberP(nil,sk5) ),
inference(superposition,[status(thm)],[d66,d7]) ).
cnf(d68,plain,
( ~ ssItem(sk5)
| ssItem(X0) ),
inference(resolution,[status(thm)],[d67,c84]) ).
cnf(d69,plain,
ssItem(X0),
inference(resolution,[status(thm)],[c6,d68]) ).
cnf(d70,plain,
( ~ memberP(sk7,X0)
| memberP(sk4,X0)
| sk4 = nil ),
inference(resolution,[status(thm)],[d69,d44]) ).
cnf(d71,plain,
( neq(X0,X1)
| ~ ssItem(X1)
| X0 = X1 ),
inference(resolution,[status(thm)],[d69,c115]) ).
cnf(d72,plain,
( neq(X0,X1)
| X0 = X1 ),
inference(resolution,[status(thm)],[d69,d71]) ).
cnf(d73,plain,
( ~ neq(sk4,nil)
| memberP(sk7,X0)
| ~ ssItem(X0)
| ~ ssItem(sk6)
| ~ ssList(sk7)
| X0 = sk6
| ~ memberP(sk3,X0) ),
inference(superposition,[status(thm)],[d52,c174]) ).
cnf(d74,plain,
( ~ neq(sk4,nil)
| memberP(sk7,X0)
| ~ memberP(sk3,X0)
| ~ ssItem(sk6)
| ~ ssItem(X0)
| X0 = sk6 ),
inference(resolution,[status(thm)],[d11,d73]) ).
cnf(d75,plain,
( ~ neq(sk4,nil)
| memberP(sk7,X0)
| ~ memberP(sk3,X0)
| ~ ssItem(X0)
| X0 = sk6 ),
inference(resolution,[status(thm)],[d22,d74]) ).
cnf(d76,plain,
( ~ neq(sk4,nil)
| memberP(sk7,X0)
| ~ memberP(sk3,X0)
| X0 = sk6 ),
inference(resolution,[status(thm)],[d69,d75]) ).
cnf(d77,plain,
( sk4 = nil
| memberP(sk7,X0)
| ~ memberP(sk3,X0)
| X0 = sk6 ),
inference(resolution,[status(thm)],[d76,d72]) ).
cnf(d78,plain,
( memberP(sk7,sk5)
| sk4 = nil
| sk5 = sk6 ),
inference(resolution,[status(thm)],[d77,d7]) ).
cnf(d79,plain,
( memberP(sk4,sk5)
| sk4 = nil
| sk5 = sk6
| sk4 = nil ),
inference(resolution,[status(thm)],[d78,d70]) ).
cnf(d80,plain,
( sk5 = sk6
| sk4 = nil ),
inference(resolution,[status(thm)],[d2,d79]) ).
cnf(d81,plain,
( sk4 = nil
| sk4 = nil
| memberP(sk4,sk5) ),
inference(superposition,[status(thm)],[d80,d29]) ).
cnf(d82,plain,
sk4 = nil,
inference(resolution,[status(thm)],[d2,d81]) ).
cnf(d83,plain,
( nil != nil
| nil = sk3 ),
inference(demodulation,[status(thm)],[c9,d82]) ).
cnf(d84,plain,
nil = sk3,
inference(equality_resolution,[status(thm)],[d83]) ).
cnf(d85,plain,
memberP(nil,sk5),
inference(demodulation,[status(thm)],[d7,d84]) ).
cnf(d86,plain,
~ memberP(nil,X0),
inference(resolution,[status(thm)],[d69,c84]) ).
cnf(d87,plain,
$false,
inference(resolution,[status(thm)],[d86,d85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC397-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 12:59:54 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 107.51/27.73 % SZS status Unsatisfiable for theBenchmark.p
% 107.51/27.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------