%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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:13:03 AM UTC 2026
% Result : Theorem 8.75s 1.58s
% Output : CNFRefutation 8.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 9 unt; 0 def)
% Number of atoms : 23 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 3 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 4 ( 0 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mEmpFin,axiom,
isFinite0(slcrc0) ).
fof(mCountNFin,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ isFinite0(X0) ) ).
fof(m__,conjecture,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ) ).
fof(negated_conjecture,negated_conjecture,
~ ! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ),
inference(negate_conjecture,[status(cth)],[m__]) ).
cnf(c4,plain,
isFinite0(slcrc0),
inference(clausification,[status(esa)],[mEmpFin]) ).
cnf(c5,plain,
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(clausification,[status(esa)],[mCountNFin]) ).
cnf(c6,plain,
aSet0(sK10),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c7,plain,
isCountable0(sK10),
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(c8,plain,
sK10 = slcrc0,
inference(clausification,[status(esa)],[negated_conjecture]) ).
cnf(d0,plain,
isCountable0(slcrc0),
inference(demodulation,[status(thm)],[c7,c8]) ).
cnf(d1,plain,
( ~ isFinite0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(resolution,[status(thm)],[c5,d0]) ).
cnf(d2,plain,
aSet0(slcrc0),
inference(demodulation,[status(thm)],[c6,c8]) ).
cnf(d3,plain,
~ isFinite0(slcrc0),
inference(resolution,[status(thm)],[d2,d1]) ).
cnf(d4,plain,
$false,
inference(resolution,[status(thm)],[c4,d3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 03:13:42 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.75/1.58 % SZS status Theorem for theBenchmark.p
% 8.75/1.58 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------