%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% Computer : n016.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 : Fri Sep 25 02:20:16 PM UTC 2026
% Result : Theorem 2.34s 0.79s
% Output : Proof 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 33 ( 4 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 33 ( 16 ~; 7 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 7 ( 0 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,conjecture,
! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> W0 != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f8_neg,negated_conjecture,
~ ! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> W0 != slcrc0 ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f8_nnf,plain,
? [W0] :
( W0 = slcrc0
& isCountable0(W0)
& aSet0(W0) ),
inference(nnf_transformation,[status(thm)],[f8_neg]) ).
fof(f8_sk,plain,
( sk1 = slcrc0
& isCountable0(sk1)
& aSet0(sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f8_nnf]) ).
cnf(c10,plain,
aSet0(sk1),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
fof(f7,axiom,
! [W0] :
( ( isCountable0(W0)
& aSet0(W0) )
=> ~ isFinite0(W0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(f7_nnf,plain,
! [W0] :
( ~ isFinite0(W0)
| ~ isCountable0(W0)
| ~ aSet0(W0) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [W0] :
( ~ isFinite0(W0)
| ~ isCountable0(W0)
| ~ aSet0(W0) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c9,plain,
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p17,plain,
( ~ isFinite0(sk1)
| ~ isCountable0(sk1) ),
inference(resolution,[status(thm)],[c10,c9]) ).
cnf(c11,plain,
isCountable0(sk1),
inference(cnf_transformation,[status(esa)],[f8_sk]) ).
cnf(p20,plain,
~ isFinite0(slcrc0),
inference(resolution,[status(thm)],[p17,c11]) ).
fof(f5,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(f5_nnf,plain,
isFinite0(slcrc0),
inference(nnf_transformation,[status(thm)],[f5]) ).
cnf(c7,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[status(esa)],[f5_nnf]) ).
cnf(p21,plain,
$false,
inference(resolution,[status(thm)],[p20,c7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 04:33:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.34/0.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.34/0.79 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------