%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUN087+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 : 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 08:18:59 AM UTC 2026
% Result : Theorem 11.18s 1.85s
% Output : CNFRefutation 11.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 40 ( 12 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 34 ( 14 ~; 9 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 6 sgn 2 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X0] :
! [X1] :
( ( X1 = X0
& r1(X1) )
| ( X1 != X0
& ~ r1(X1) ) ) ).
fof(axiom_5a,axiom,
! [X0] :
? [X1] :
( ? [X3] :
( X1 = X3
& r1(X3) )
& ? [X2] :
( r4(X0,X2,X1)
& r1(X2) ) ) ).
fof(zerotimeszeroeqzero,conjecture,
? [X0] :
( ? [X2] :
( X0 = X2
& r1(X2) )
& ? [X1] :
( r4(X1,X1,X0)
& r1(X1) ) ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] :
( ? [X2] :
( X0 = X2
& r1(X2) )
& ? [X1] :
( r4(X1,X1,X0)
& r1(X1) ) ),
inference(negate_conjecture,[status(cth)],[zerotimeszeroeqzero]) ).
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(c30,plain,
r1(sK34(X0)),
inference(clausification,[status(esa)],[axiom_5a]) ).
cnf(c31,plain,
r4(X0,sK34(X0),sK33(X0)),
inference(clausification,[status(esa)],[axiom_5a]) ).
cnf(c32,plain,
r1(sK35(X0)),
inference(clausification,[status(esa)],[axiom_5a]) ).
cnf(c33,plain,
sK33(X0) = sK35(X0),
inference(clausification,[status(esa)],[axiom_5a]) ).
cnf(c39,plain,
( X1 != X2
| ~ r1(X2)
| ~ r4(X0,X0,X1)
| ~ r1(X0) ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
( ~ r4(X1,X1,X0)
| ~ r1(X1)
| ~ r1(X0) ),
inference(equality_resolution,[status(thm)],[c39]) ).
cnf(d1,plain,
sK35(X0) = sK0,
inference(resolution,[status(thm)],[c32,c1]) ).
cnf(d2,plain,
sK33(X0) = sK0,
inference(demodulation,[status(thm)],[c33,d1]) ).
cnf(d3,plain,
sK34(X0) = sK0,
inference(resolution,[status(thm)],[c30,c1]) ).
cnf(d4,plain,
r4(X0,sK0,sK33(X0)),
inference(demodulation,[status(thm)],[c31,d3]) ).
cnf(d5,plain,
r4(X0,sK0,sK0),
inference(demodulation,[status(thm)],[d4,d2]) ).
cnf(d6,plain,
( ~ r1(sK0)
| ~ r1(sK0) ),
inference(resolution,[status(thm)],[d5,d0]) ).
cnf(d7,plain,
r1(sK0),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(d8,plain,
$false,
inference(resolution,[status(thm)],[d7,d6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN087+2 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sat Sep 26 04:32:32 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.18/1.85 % SZS status Theorem for theBenchmark.p
% 11.18/1.85 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------