%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:20 AM UTC 2026
% Result : Unsatisfiable 30.35s 4.27s
% Output : CNFRefutation 30.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 19 RR)
% Number of literals : 43 ( 42 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-4 aty)
% Number of variables : 44 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(ifeq_axiom,axiom,
ifeq(X0,X0,X1,X2) = X1 ).
cnf(axiom_9,axiom,
r0(b) = true ).
cnf(axiom_14,axiom,
p0(b,X0) = true ).
cnf(axiom_30,axiom,
n0(e,e) = true ).
cnf(rule_002,axiom,
ifeq(n0(X0,X1),true,l1(X1,X1),true) = true ).
cnf(rule_057,axiom,
ifeq(r0(X0),true,n1(X0,X0,X0),true) = true ).
cnf(rule_085,axiom,
ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true ).
cnf(rule_137,axiom,
ifeq(p1(X0,X1,X2),true,n2(X2),true) = true ).
cnf(rule_244,axiom,
ifeq(n2(X0),true,p3(X0,X0,X0),true) = true ).
cnf(rule_299,axiom,
ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true ).
cnf(rule_301,axiom,
ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true ).
cnf(prove_this,negated_conjecture,
k5(b) != true ).
cnf(c0,plain,
ifeq(X0,X0,X1,X2) = X1,
inference(clausification,[status(esa)],[ifeq_axiom]) ).
cnf(c9,plain,
r0(b) = true,
inference(clausification,[status(esa)],[axiom_9]) ).
cnf(c14,plain,
p0(b,X0) = true,
inference(clausification,[status(esa)],[axiom_14]) ).
cnf(c30,plain,
n0(e,e) = true,
inference(clausification,[status(esa)],[axiom_30]) ).
cnf(c40,plain,
ifeq(n0(X0,X1),true,l1(X1,X1),true) = true,
inference(clausification,[status(esa)],[rule_002]) ).
cnf(c94,plain,
ifeq(r0(X0),true,n1(X0,X0,X0),true) = true,
inference(clausification,[status(esa)],[rule_057]) ).
cnf(c121,plain,
ifeq(p0(X0,X1),true,p1(X1,X1,X1),true) = true,
inference(clausification,[status(esa)],[rule_085]) ).
cnf(c172,plain,
ifeq(p1(X0,X1,X2),true,n2(X2),true) = true,
inference(clausification,[status(esa)],[rule_137]) ).
cnf(c277,plain,
ifeq(n2(X0),true,p3(X0,X0,X0),true) = true,
inference(clausification,[status(esa)],[rule_244]) ).
cnf(c330,plain,
ifeq(p3(X0,X1,X2),true,ifeq(l1(X3,X1),true,s4(X3),true),true) = true,
inference(clausification,[status(esa)],[rule_299]) ).
cnf(c332,plain,
ifeq(s4(e),true,ifeq(n1(b,b,b),true,k5(b),true),true) = true,
inference(clausification,[status(esa)],[rule_301]) ).
cnf(c362,plain,
k5(b) != true,
inference(clausification,[status(esa)],[prove_this]) ).
cnf(d0,plain,
ifeq(true,true,l1(e,e),true) = true,
inference(superposition,[status(thm)],[c30,c40]) ).
cnf(d1,plain,
l1(e,e) = true,
inference(demodulation,[status(thm)],[d0,c0]) ).
cnf(d2,plain,
ifeq(p3(X0,e,X1),true,ifeq(true,true,s4(e),true),true) = true,
inference(superposition,[status(thm)],[d1,c330]) ).
cnf(d3,plain,
ifeq(p3(X0,e,X1),true,s4(e),true) = true,
inference(demodulation,[status(thm)],[d2,c0]) ).
cnf(d4,plain,
ifeq(true,true,p1(X0,X0,X0),true) = true,
inference(superposition,[status(thm)],[c14,c121]) ).
cnf(d5,plain,
p1(X0,X0,X0) = true,
inference(demodulation,[status(thm)],[d4,c0]) ).
cnf(d6,plain,
ifeq(true,true,n2(X0),true) = true,
inference(superposition,[status(thm)],[d5,c172]) ).
cnf(d7,plain,
n2(X0) = true,
inference(demodulation,[status(thm)],[d6,c0]) ).
cnf(d8,plain,
ifeq(true,true,p3(X0,X0,X0),true) = true,
inference(demodulation,[status(thm)],[c277,d7]) ).
cnf(d9,plain,
p3(X0,X0,X0) = true,
inference(demodulation,[status(thm)],[d8,c0]) ).
cnf(d10,plain,
ifeq(true,true,s4(e),true) = true,
inference(superposition,[status(thm)],[d9,d3]) ).
cnf(d11,plain,
s4(e) = true,
inference(demodulation,[status(thm)],[d10,c0]) ).
cnf(d12,plain,
ifeq(true,true,n1(b,b,b),true) = true,
inference(superposition,[status(thm)],[c9,c94]) ).
cnf(d13,plain,
n1(b,b,b) = true,
inference(demodulation,[status(thm)],[d12,c0]) ).
cnf(d14,plain,
ifeq(s4(e),true,ifeq(true,true,k5(b),true),true) = true,
inference(demodulation,[status(thm)],[c332,d13]) ).
cnf(d15,plain,
ifeq(s4(e),true,k5(b),true) = true,
inference(demodulation,[status(thm)],[d14,c0]) ).
cnf(d16,plain,
ifeq(true,true,k5(b),true) = true,
inference(demodulation,[status(thm)],[d15,d11]) ).
cnf(d17,plain,
k5(b) = true,
inference(demodulation,[status(thm)],[d16,c0]) ).
cnf(d18,plain,
$false,
inference(resolution,[status(thm)],[c362,d17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN116-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.36 % Computer : n005.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Sat Sep 26 17:12:02 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 30.35/4.27 % SZS status Unsatisfiable for theBenchmark.p
% 30.35/4.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------