%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 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 : Fri Sep 25 02:25:51 PM UTC 2026
% Result : Theorem 1.12s 1.28s
% Output : CNFRefutation 1.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 10 unt; 0 def)
% Number of atoms : 43 ( 6 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 41 ( 19 ~; 10 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 9 ( 0 sgn 7 !; 2 ?; 1 :)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
isFinite0(slcrc0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mEmpFin) ).
fof(f8,axiom,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ isFinite0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCountNFin) ).
fof(f9,conjecture,
! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> X0 != slcrc0 ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f17,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
? [X0] :
( isCountable0(X0)
& aSet0(X0)
& slcrc0 = X0 ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
? [X0] :
( isCountable0(X0)
& aSet0(X0)
& slcrc0 = X0 ),
inference(flattening,[],[f19]) ).
fof(f25,plain,
( isCountable0(sK1)
& aSet0(sK1)
& slcrc0 = sK1 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f20]) ).
fof(f29,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[],[f6]) ).
fof(f30,plain,
! [X0] :
( ~ isCountable0(X0)
| ~ aSet0(X0)
| ~ isFinite0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f31,plain,
isCountable0(sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f32,plain,
aSet0(sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f33,plain,
slcrc0 = sK1,
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
isFinite0(sK1),
inference(definition_unfolding,[],[f29,f33]) ).
tcf(c_52,negated_conjecture,
isFinite0(sK1),
inference(cnf_transformation,[],[f37]) ).
tcf(c_53,plain,
! [X0: $i] :
( ~ isCountable0(X0)
| ~ isFinite0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_54,negated_conjecture,
aSet0(sK1),
inference(cnf_transformation,[],[f32]) ).
tcf(c_55,negated_conjecture,
isCountable0(sK1),
inference(cnf_transformation,[],[f31]) ).
tcf(c_57,plain,
( ~ isCountable0(sK1)
| ~ isFinite0(sK1)
| ~ aSet0(sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_58,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_57,c_52,c_54,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM531+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Thu Sep 24 04:28:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 1.12/1.28 % SZS status Started for theBenchmark.p
% 1.12/1.28 % SZS status Theorem for theBenchmark.p
% 1.12/1.28
% 1.12/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.12/1.28
% 1.12/1.28 % ------ iProver source info
% 1.12/1.28
% 1.12/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.12/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.12/1.28 % git: non_committed_changes: false
% 1.12/1.28
% 1.12/1.28 % ------ Parsing...
% 1.12/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.12/1.28
% 1.12/1.28 % ------ Preprocessing...%
% 1.12/1.28
% 1.12/1.28 % SZS status Theorem for theBenchmark.p
% 1.12/1.28
% 1.12/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.12/1.28
% 1.12/1.28
%------------------------------------------------------------------------------