%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN202-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:21:32 AM UTC 2026
% Result : Unsatisfiable 19.91s 2.83s
% Output : CNFRefutation 19.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 44 ( 20 unt; 0 nHn; 31 RR)
% Number of literals : 86 ( 0 equ; 44 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 64 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_this,negated_conjecture,
~ s2(e) ).
cnf(axiom_1,axiom,
s0(d) ).
cnf(axiom_14,axiom,
p0(b,X0) ).
cnf(axiom_17,axiom,
q0(X0,d) ).
cnf(axiom_19,axiom,
m0(X0,d,X1) ).
cnf(axiom_28,axiom,
k0(e) ).
cnf(rule_085,axiom,
( ~ p0(X1,X0)
| p1(X0,X0,X0) ) ).
cnf(rule_110,axiom,
( ~ m0(X1,X2,X0)
| q1(X0,X0,X0) ) ).
cnf(rule_124,axiom,
( ~ q1(d,X1,d)
| ~ s0(d)
| ~ q0(X0,X1)
| r1(X0) ) ).
cnf(rule_125,axiom,
( ~ p0(X0,X0)
| s1(X0) ) ).
cnf(rule_126,axiom,
( ~ s1(X2)
| ~ q0(X0,X1)
| s1(X0) ) ).
cnf(rule_181,axiom,
( ~ p1(X0,X0,X0)
| q2(X0,X0,X0) ) ).
cnf(rule_187,axiom,
( ~ q2(X1,X1,X1)
| ~ k0(X1)
| ~ m0(X2,X3,X0)
| ~ r1(X1)
| q2(X0,X1,X0) ) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X0,b)
| s2(X0) ) ).
cnf(c0,plain,
~ s2(e),
inference(clausification,[status(esa)],[prove_this]) ).
cnf(c1,plain,
s0(d),
inference(clausification,[status(esa)],[axiom_1]) ).
cnf(c14,plain,
p0(b,X0),
inference(clausification,[status(esa)],[axiom_14]) ).
cnf(c17,plain,
q0(X0,d),
inference(clausification,[status(esa)],[axiom_17]) ).
cnf(c19,plain,
m0(X0,d,X1),
inference(clausification,[status(esa)],[axiom_19]) ).
cnf(c28,plain,
k0(e),
inference(clausification,[status(esa)],[axiom_28]) ).
cnf(c123,plain,
( ~ p0(X1,X0)
| p1(X0,X0,X0) ),
inference(clausification,[status(esa)],[rule_085]) ).
cnf(c148,plain,
( ~ m0(X1,X2,X0)
| q1(X0,X0,X0) ),
inference(clausification,[status(esa)],[rule_110]) ).
cnf(c162,plain,
( ~ q1(d,X1,d)
| ~ s0(d)
| ~ q0(X0,X1)
| r1(X0) ),
inference(clausification,[status(esa)],[rule_124]) ).
cnf(c163,plain,
( ~ p0(X0,X0)
| s1(X0) ),
inference(clausification,[status(esa)],[rule_125]) ).
cnf(c164,plain,
( ~ s1(X2)
| ~ q0(X0,X1)
| s1(X0) ),
inference(clausification,[status(esa)],[rule_126]) ).
cnf(c219,plain,
( ~ p1(X0,X0,X0)
| q2(X0,X0,X0) ),
inference(clausification,[status(esa)],[rule_181]) ).
cnf(c225,plain,
( q2(X3,X0,X3)
| ~ m0(X1,X2,X3)
| ~ q2(X0,X0,X0)
| ~ r1(X0)
| ~ k0(X0) ),
inference(clausification,[status(esa)],[rule_187]) ).
cnf(c227,plain,
( ~ s1(b)
| ~ q2(b,X0,b)
| s2(X0) ),
inference(clausification,[status(esa)],[rule_189]) ).
cnf(d0,plain,
s1(b),
inference(resolution,[status(thm)],[c163,c14]) ).
cnf(d1,plain,
( ~ s1(X1)
| s1(X0) ),
inference(resolution,[status(thm)],[c164,c17]) ).
cnf(d2,plain,
s1(X0),
inference(resolution,[status(thm)],[d1,d0]) ).
cnf(d3,plain,
( ~ q2(b,X0,b)
| s2(X0) ),
inference(resolution,[status(thm)],[d2,c227]) ).
cnf(d4,plain,
q1(X0,X0,X0),
inference(resolution,[status(thm)],[c148,c19]) ).
cnf(d5,plain,
( r1(X0)
| ~ q1(d,X1,d)
| ~ q0(X0,X1) ),
inference(resolution,[status(thm)],[c1,c162]) ).
cnf(d6,plain,
( r1(X0)
| ~ q0(X0,d) ),
inference(resolution,[status(thm)],[d5,d4]) ).
cnf(d7,plain,
r1(X0),
inference(resolution,[status(thm)],[c17,d6]) ).
cnf(d8,plain,
( ~ q2(X3,X3,X3)
| q2(X2,X3,X2)
| ~ k0(X3)
| ~ m0(X0,X1,X2) ),
inference(resolution,[status(thm)],[d7,c225]) ).
cnf(d9,plain,
p1(X0,X0,X0),
inference(resolution,[status(thm)],[c123,c14]) ).
cnf(d10,plain,
q2(X0,X0,X0),
inference(resolution,[status(thm)],[d9,c219]) ).
cnf(d11,plain,
( q2(X2,X3,X2)
| ~ k0(X3)
| ~ m0(X0,X1,X2) ),
inference(resolution,[status(thm)],[d10,d8]) ).
cnf(d12,plain,
( q2(X1,X0,X1)
| ~ k0(X0) ),
inference(resolution,[status(thm)],[d11,c19]) ).
cnf(d13,plain,
( s2(X0)
| ~ k0(X0) ),
inference(resolution,[status(thm)],[d12,d3]) ).
cnf(d14,plain,
s2(e),
inference(resolution,[status(thm)],[d13,c28]) ).
cnf(d15,plain,
$false,
inference(resolution,[status(thm)],[c0,d14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN202-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n005.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 17:21:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.91/2.83 % SZS status Unsatisfiable for theBenchmark.p
% 19.91/2.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------