%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUN069+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 : n011.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:55 AM UTC 2026
% Result : Theorem 15.16s 2.36s
% Output : CNFRefutation 15.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 4 unt; 0 def)
% Number of atoms : 26 ( 7 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 25 ( 10 ~; 5 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 20 ( 3 sgn 3 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X0] :
! [X1] :
( ( X1 = X0
& r1(X1) )
| ( X1 != X0
& ~ r1(X1) ) ) ).
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(oneeqone,conjecture,
? [X0] :
( ? [X1] :
( r2(X1,X0)
& r1(X1) )
& X0 = X0 ) ).
fof(negated_conjecture,negated_conjecture,
~ ? [X0] :
( ? [X1] :
( r2(X1,X0)
& r1(X1) )
& X0 = X0 ),
inference(negate_conjecture,[status(cth)],[oneeqone]) ).
cnf(c2,plain,
( r1(X0)
| X0 != sK0 ),
inference(clausification,[status(esa)],[axiom_1]) ).
cnf(c16,plain,
r2(X0,sK17(X1,X0)),
inference(clausification,[status(esa)],[axiom_1a]) ).
cnf(c39,plain,
( ~ r2(X1,X0)
| ~ r1(X1)
| X0 != X0 ),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
r1(sK0),
inference(equality_resolution,[status(thm)],[c2]) ).
cnf(d1,plain,
( ~ r2(X0,X1)
| ~ r1(X0) ),
inference(equality_resolution,[status(thm)],[c39]) ).
cnf(d2,plain,
~ r1(X0),
inference(resolution,[status(thm)],[c16,d1]) ).
cnf(d3,plain,
$false,
inference(resolution,[status(thm)],[d2,d0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUN069+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.10/0.37 % Computer : n011.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 04:29:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.16/2.36 % SZS status Theorem for theBenchmark.p
% 15.16/2.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------