%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN982-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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 09:34:28 AM UTC 2026
% Result : Unsatisfiable 20.04s 3.57s
% Output : CNFRefutation 20.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of clauses : 60 ( 16 unt; 0 nHn; 60 RR)
% Number of literals : 150 ( 0 equ; 96 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-1 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 85 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause2,axiom,
ssP(t) ).
cnf(clause3,axiom,
ssBf(na) ).
cnf(clause4,axiom,
ssP(b) ).
cnf(clause5,axiom,
ssP(a) ).
cnf(clause14,axiom,
( ssIm(X1)
| ~ ssIm(pair(X0,X1)) ) ).
cnf(clause16,axiom,
ssM(sent(a,b,pair(a,na))) ).
cnf(clause17,axiom,
( ssIm(X2)
| ~ ssIm(triple(X0,X1,X2)) ) ).
cnf(clause18,axiom,
( ssIm(X1)
| ~ ssIm(triple(X0,X1,X2)) ) ).
cnf(clause20,axiom,
( ssIm(X2)
| ~ ssM(sent(X0,X1,X2)) ) ).
cnf(clause25,axiom,
( ssIk(key(X0,X1))
| ~ ssP(X1)
| ~ ssIm(X0) ) ).
cnf(clause26,axiom,
( ssIm(pair(X0,X1))
| ~ ssIm(X1)
| ~ ssIm(X0) ) ).
cnf(clause27,axiom,
( ssM(sent(X1,X2,X0))
| ~ ssP(X2)
| ~ ssP(X1)
| ~ ssIm(X0) ) ).
cnf(clause29,axiom,
( ssIm(encr(X0,X1))
| ~ ssP(X2)
| ~ ssIk(key(X1,X2))
| ~ ssIm(X0) ) ).
cnf(clause30,axiom,
( ssSb(pair(X0,X1))
| ~ ssBf(X1)
| ~ ssM(sent(X0,b,pair(X0,X1))) ) ).
cnf(clause33,axiom,
( ssM(sent(b,t,triple(b,nb(X1),encr(triple(X0,X1,tb(X1)),bt))))
| ~ ssBf(X1)
| ~ ssM(sent(X0,b,pair(X0,X1))) ) ).
cnf(clause34,axiom,
( ssBk(key(X1,X0))
| ~ ssSb(pair(X0,X2))
| ~ ssM(sent(X0,b,pair(encr(triple(X0,X1,tb(X2)),bt),encr(nb(X2),X1)))) ) ).
cnf(clause37,negated_conjecture,
( ~ ssBk(key(X0,a))
| ~ ssIk(key(X0,b)) ) ).
cnf(c1,plain,
ssP(t),
inference(clausification,[status(esa)],[clause2]) ).
cnf(c2,plain,
ssBf(na),
inference(clausification,[status(esa)],[clause3]) ).
cnf(c3,plain,
ssP(b),
inference(clausification,[status(esa)],[clause4]) ).
cnf(c4,plain,
ssP(a),
inference(clausification,[status(esa)],[clause5]) ).
cnf(c13,plain,
( ssIm(X1)
| ~ ssIm(pair(X0,X1)) ),
inference(clausification,[status(esa)],[clause14]) ).
cnf(c15,plain,
ssM(sent(a,b,pair(a,na))),
inference(clausification,[status(esa)],[clause16]) ).
cnf(c16,plain,
( ssIm(X2)
| ~ ssIm(triple(X0,X1,X2)) ),
inference(clausification,[status(esa)],[clause17]) ).
cnf(c17,plain,
( ssIm(X1)
| ~ ssIm(triple(X0,X1,X2)) ),
inference(clausification,[status(esa)],[clause18]) ).
cnf(c19,plain,
( ssIm(X2)
| ~ ssM(sent(X0,X1,X2)) ),
inference(clausification,[status(esa)],[clause20]) ).
cnf(c24,plain,
( ssIk(key(X0,X1))
| ~ ssP(X1)
| ~ ssIm(X0) ),
inference(clausification,[status(esa)],[clause25]) ).
cnf(c25,plain,
( ssIm(pair(X0,X1))
| ~ ssIm(X1)
| ~ ssIm(X0) ),
inference(clausification,[status(esa)],[clause26]) ).
cnf(c26,plain,
( ssM(sent(X1,X2,X0))
| ~ ssP(X2)
| ~ ssP(X1)
| ~ ssIm(X0) ),
inference(clausification,[status(esa)],[clause27]) ).
cnf(c28,plain,
( ssIm(encr(X0,X1))
| ~ ssP(X2)
| ~ ssIk(key(X1,X2))
| ~ ssIm(X0) ),
inference(clausification,[status(esa)],[clause29]) ).
cnf(c29,plain,
( ssSb(pair(X0,X1))
| ~ ssBf(X1)
| ~ ssM(sent(X0,b,pair(X0,X1))) ),
inference(clausification,[status(esa)],[clause30]) ).
cnf(c32,plain,
( ssM(sent(b,t,triple(b,nb(X1),encr(triple(X0,X1,tb(X1)),bt))))
| ~ ssBf(X1)
| ~ ssM(sent(X0,b,pair(X0,X1))) ),
inference(clausification,[status(esa)],[clause33]) ).
cnf(c33,plain,
( ssBk(key(X1,X0))
| ~ ssSb(pair(X0,X2))
| ~ ssM(sent(X0,b,pair(encr(triple(X0,X1,tb(X2)),bt),encr(nb(X2),X1)))) ),
inference(clausification,[status(esa)],[clause34]) ).
cnf(c36,plain,
( ~ ssBk(key(X0,a))
| ~ ssIk(key(X0,b)) ),
inference(clausification,[status(esa)],[clause37]) ).
cnf(d0,plain,
( ~ ssIm(X0)
| ~ ssP(b)
| ~ ssBk(key(X0,a)) ),
inference(resolution,[status(thm)],[c36,c24]) ).
cnf(d1,plain,
( ~ ssIm(X0)
| ~ ssBk(key(X0,a)) ),
inference(resolution,[status(thm)],[c3,d0]) ).
cnf(d2,plain,
( ~ ssIm(X2)
| ~ ssP(X0)
| ssIm(encr(X1,X2))
| ~ ssIm(X1)
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[c28,c24]) ).
cnf(d3,plain,
( ssIm(triple(b,nb(X0),encr(triple(X1,X0,tb(X0)),bt)))
| ~ ssM(sent(X1,b,pair(X1,X0)))
| ~ ssBf(X0) ),
inference(resolution,[status(thm)],[c32,c19]) ).
cnf(d4,plain,
( ssIm(encr(triple(X1,X0,tb(X0)),bt))
| ~ ssM(sent(X1,b,pair(X1,X0)))
| ~ ssBf(X0) ),
inference(resolution,[status(thm)],[d3,c16]) ).
cnf(d5,plain,
( ~ ssIm(pair(encr(triple(X1,X0,tb(X2)),bt),encr(nb(X2),X0)))
| ~ ssP(b)
| ~ ssP(X1)
| ~ ssSb(pair(X1,X2))
| ssBk(key(X0,X1)) ),
inference(resolution,[status(thm)],[c33,c26]) ).
cnf(d6,plain,
( ~ ssSb(pair(X0,X2))
| ~ ssIm(pair(encr(triple(X0,X1,tb(X2)),bt),encr(nb(X2),X1)))
| ssBk(key(X1,X0))
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[c3,d5]) ).
cnf(d7,plain,
( ~ ssIm(encr(triple(X0,X1,tb(X2)),bt))
| ~ ssIm(encr(nb(X2),X1))
| ~ ssSb(pair(X0,X2))
| ssBk(key(X1,X0))
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[d6,c25]) ).
cnf(d8,plain,
( ~ ssM(sent(X0,b,pair(X0,X1)))
| ~ ssBf(X1)
| ~ ssSb(pair(X0,X1))
| ~ ssIm(encr(nb(X1),X1))
| ssBk(key(X1,X0))
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[d7,d4]) ).
cnf(d9,plain,
( ~ ssSb(pair(a,na))
| ~ ssIm(encr(nb(na),na))
| ssBk(key(na,a))
| ~ ssBf(na)
| ~ ssP(a) ),
inference(resolution,[status(thm)],[d8,c15]) ).
cnf(d10,plain,
( ~ ssSb(pair(a,na))
| ~ ssIm(encr(nb(na),na))
| ssBk(key(na,a))
| ~ ssP(a) ),
inference(resolution,[status(thm)],[c2,d9]) ).
cnf(d11,plain,
( ~ ssSb(pair(a,na))
| ~ ssIm(encr(nb(na),na))
| ssBk(key(na,a)) ),
inference(resolution,[status(thm)],[c4,d10]) ).
cnf(d12,plain,
( ssSb(pair(a,na))
| ~ ssBf(na) ),
inference(resolution,[status(thm)],[c29,c15]) ).
cnf(d13,plain,
ssSb(pair(a,na)),
inference(resolution,[status(thm)],[c2,d12]) ).
cnf(d14,plain,
( ~ ssIm(encr(nb(na),na))
| ssBk(key(na,a)) ),
inference(resolution,[status(thm)],[d13,d11]) ).
cnf(d15,plain,
( ~ ssIm(nb(na))
| ~ ssIm(na)
| ~ ssP(X0)
| ssBk(key(na,a)) ),
inference(resolution,[status(thm)],[d14,d2]) ).
cnf(d16,plain,
ssIm(pair(a,na)),
inference(resolution,[status(thm)],[c19,c15]) ).
cnf(d17,plain,
ssIm(na),
inference(resolution,[status(thm)],[d16,c13]) ).
cnf(d18,plain,
( ~ ssIm(nb(na))
| ssBk(key(na,a))
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[d17,d15]) ).
cnf(d19,plain,
( ssIm(nb(X0))
| ~ ssM(sent(X1,b,pair(X1,X0)))
| ~ ssBf(X0) ),
inference(resolution,[status(thm)],[d3,c17]) ).
cnf(d20,plain,
( ssIm(nb(na))
| ~ ssBf(na) ),
inference(resolution,[status(thm)],[d19,c15]) ).
cnf(d21,plain,
ssIm(nb(na)),
inference(resolution,[status(thm)],[c2,d20]) ).
cnf(d22,plain,
( ssBk(key(na,a))
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[d21,d18]) ).
cnf(d23,plain,
( ~ ssIm(na)
| ~ ssP(X0) ),
inference(resolution,[status(thm)],[d22,d1]) ).
cnf(d24,plain,
~ ssP(X0),
inference(resolution,[status(thm)],[d17,d23]) ).
cnf(d25,plain,
$false,
inference(resolution,[status(thm)],[d24,c1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN982-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.35 % Computer : n001.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sat Sep 26 18:58:58 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 20.04/3.57 % SZS status Unsatisfiable for theBenchmark.p
% 20.04/3.57 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------