%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUN054+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/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:18:51 AM UTC 2026
% Result : Theorem 10.55s 1.94s
% Output : CNFRefutation 10.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 19 unt; 0 def)
% Number of atoms : 98 ( 22 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 107 ( 48 ~; 35 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 90 ( 5 sgn 9 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X0] :
! [X1] :
( ( X1 = X0
& r1(X1) )
| ( X1 != X0
& ~ r1(X1) ) ) ).
fof(axiom_2,axiom,
! [X0] :
? [X1] :
! [X2] :
( ( X2 = X1
& r2(X0,X2) )
| ( X2 != X1
& ~ r2(X0,X2) ) ) ).
fof(axiom_3,axiom,
! [X0,X1] :
? [X2] :
! [X3] :
( ( X3 = X2
& r3(X0,X1,X3) )
| ( X3 != X2
& ~ r3(X0,X1,X3) ) ) ).
fof(axiom_1a,axiom,
! [X0,X1] :
? [X2] :
( ? [X5] :
( r3(X0,X1,X5)
& r2(X5,X2) )
& ? [X3] :
( X3 = X2
& ? [X4] :
( r3(X0,X4,X3)
& r2(X1,X4) ) ) ) ).
fof(axiom_4a,axiom,
! [X0] :
? [X1] :
( X1 = X0
& ? [X2] :
( r3(X0,X2,X1)
& r1(X2) ) ) ).
fof(zeroplusoneeqone,conjecture,
? [X0] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& X0 = X4 )
& ? [X1] :
( ? [X3] :
( r2(X3,X1)
& r1(X3) )
& ? [X2] :
( r3(X2,X1,X0)
& r1(X2) ) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] :
( ? [X4] :
( ? [X5] :
( r2(X5,X4)
& r1(X5) )
& X0 = X4 )
& ? [X1] :
( ? [X3] :
( r2(X3,X1)
& r1(X3) )
& ? [X2] :
( r3(X2,X1,X0)
& r1(X2) ) ) ),
inference(negate_conjecture,[status(cth)],[zeroplusoneeqone]) ).
cnf(c1,plain,
( X0 = sK0
| ~ r1(X0) ),
inference(clausification,[status(esa)],[axiom_1]) ).
cnf(c2,plain,
( r1(X0)
| X0 != sK0 ),
inference(clausification,[status(esa)],[axiom_1]) ).
cnf(c5,plain,
( X1 = sK3(X0)
| ~ r2(X0,X1) ),
inference(clausification,[status(esa)],[axiom_2]) ).
cnf(c6,plain,
( r2(X1,X0)
| X0 != sK3(X1) ),
inference(clausification,[status(esa)],[axiom_2]) ).
cnf(c9,plain,
( X2 = sK7(X0,X1)
| ~ r3(X0,X1,X2) ),
inference(clausification,[status(esa)],[axiom_3]) ).
cnf(c16,plain,
r2(X0,sK17(X1,X0)),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c17,plain,
r3(X0,sK17(X0,X1),sK16(X0,X1)),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c18,plain,
sK16(X0,X1) = sK15(X0,X1),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c19,plain,
r2(sK18(X0,X1),sK15(X0,X1)),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c20,plain,
r3(X0,X1,sK18(X0,X1)),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c27,plain,
r1(sK31(X0)),
inference(clausification,[status(esa)],[axiom_4a]) ).
cnf(c28,plain,
r3(X0,sK31(X0),sK30(X0)),
inference(clausification,[status(esa)],[axiom_4a]) ).
cnf(c29,plain,
sK30(X0) = X0,
inference(clausification,[status(esa)],[axiom_4a]) ).
cnf(c39,plain,
( ~ r3(X0,X5,X4)
| ~ r2(X2,X5)
| X4 != X3
| ~ r2(X1,X3)
| ~ r1(X2)
| ~ r1(X1)
| ~ r1(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
r1(sK0),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(d1,plain,
sK18(X0,X1) = sK7(X0,X1),
inference(resolution,[status(thm)],[c20,c9]) ).
cnf(d2,plain,
r2(X0,sK3(X0)),
inference(equality_resolution,[status(thm)],[c6]) ).
cnf(d3,plain,
sK17(X0,X1) = sK3(X1),
inference(resolution,[status(thm)],[c16,c5]) ).
cnf(d4,plain,
( ~ r3(X0,X3,X4)
| ~ r2(X2,X4)
| ~ r2(X1,X3)
| ~ r1(X2)
| ~ r1(X1)
| ~ r1(X0) ),
inference(equality_resolution,[status(thm)],[c39]) ).
cnf(d5,plain,
( ~ r2(X1,sK17(X2,X3))
| ~ r2(X0,sK16(X2,X3))
| ~ r1(X2)
| ~ r1(X1)
| ~ r1(X0) ),
inference(resolution,[status(thm)],[c17,d4]) ).
cnf(d6,plain,
r2(sK18(X0,X1),sK16(X0,X1)),
inference(demodulation,[status(thm)],[c19,c18]) ).
cnf(d7,plain,
( ~ r2(X1,sK17(X0,X2))
| ~ r1(sK18(X0,X2))
| ~ r1(X1)
| ~ r1(X0) ),
inference(resolution,[status(thm)],[d6,d5]) ).
cnf(d8,plain,
( ~ r2(X2,sK3(X1))
| ~ r1(sK18(X0,X1))
| ~ r1(X0)
| ~ r1(X2) ),
inference(demodulation,[status(thm)],[d7,d3]) ).
cnf(d9,plain,
( ~ r1(sK18(X1,X0))
| ~ r1(X1)
| ~ r1(X0) ),
inference(resolution,[status(thm)],[d8,d2]) ).
cnf(d10,plain,
( ~ r1(sK7(X0,X1))
| ~ r1(X1)
| ~ r1(X0) ),
inference(demodulation,[status(thm)],[d9,d1]) ).
cnf(d11,plain,
sK31(X0) = sK0,
inference(resolution,[status(thm)],[c27,c1]) ).
cnf(d12,plain,
r3(X0,sK0,sK30(X0)),
inference(demodulation,[status(thm)],[c28,d11]) ).
cnf(d13,plain,
r3(X0,sK0,X0),
inference(demodulation,[status(thm)],[d12,c29]) ).
cnf(d14,plain,
X0 = sK7(X0,sK0),
inference(resolution,[status(thm)],[d13,c9]) ).
cnf(d15,plain,
( ~ r1(sK0)
| ~ r1(X0)
| ~ r1(X0) ),
inference(superposition,[status(thm)],[d14,d10]) ).
cnf(d16,plain,
~ r1(X0),
inference(resolution,[status(thm)],[d0,d15]) ).
cnf(d17,plain,
$false,
inference(resolution,[status(thm)],[d16,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUN054+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n003.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 04:29:53 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.55/1.94 % SZS status Theorem for theBenchmark.p
% 10.55/1.94 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------