TSTP Solution File: NUM531+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 11:31:12 EDT 2023
% Result : Theorem 0.72s 1.17s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 56 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 60 ( 26 ~; 10 |; 20 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn; 11 !; 5 ?)
% 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) )
=> ~ ( slcrc0 = X0
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( ( isCountable0(X0)
& aSet0(X0) )
=> ~ ( slcrc0 = X0
& ~ ? [X1] : aElementOf0(X1,X0) ) ),
inference(negated_conjecture,[],[f9]) ).
fof(f17,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f18,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
? [X0] :
( slcrc0 = X0
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
? [X0] :
( slcrc0 = X0
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) ),
inference(flattening,[],[f19]) ).
fof(f26,plain,
( ? [X0] :
( slcrc0 = X0
& ! [X1] : ~ aElementOf0(X1,X0)
& isCountable0(X0)
& aSet0(X0) )
=> ( slcrc0 = sK1
& ! [X1] : ~ aElementOf0(X1,sK1)
& isCountable0(sK1)
& aSet0(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
( slcrc0 = sK1
& ! [X1] : ~ aElementOf0(X1,sK1)
& isCountable0(sK1)
& aSet0(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f20,f26]) ).
fof(f31,plain,
isFinite0(slcrc0),
inference(cnf_transformation,[],[f6]) ).
fof(f32,plain,
! [X0] :
( ~ isFinite0(X0)
| ~ isCountable0(X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,plain,
aSet0(sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f34,plain,
isCountable0(sK1),
inference(cnf_transformation,[],[f27]) ).
fof(f36,plain,
slcrc0 = sK1,
inference(cnf_transformation,[],[f27]) ).
fof(f40,plain,
isFinite0(sK1),
inference(definition_unfolding,[],[f31,f36]) ).
cnf(c_52,negated_conjecture,
isFinite0(sK1),
inference(cnf_transformation,[],[f40]) ).
cnf(c_53,plain,
( ~ aSet0(X0)
| ~ isFinite0(X0)
| ~ isCountable0(X0) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_55,negated_conjecture,
isCountable0(sK1),
inference(cnf_transformation,[],[f34]) ).
cnf(c_56,negated_conjecture,
aSet0(sK1),
inference(cnf_transformation,[],[f33]) ).
cnf(c_58,plain,
( ~ aSet0(sK1)
| ~ isFinite0(sK1)
| ~ isCountable0(sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
cnf(c_59,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_58,c_52,c_55,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 25 15:02:36 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.72/1.17 % SZS status Started for theBenchmark.p
% 0.72/1.17 % SZS status Theorem for theBenchmark.p
% 0.72/1.17
% 0.72/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.72/1.17
% 0.72/1.17 ------ iProver source info
% 0.72/1.17
% 0.72/1.17 git: date: 2023-05-31 18:12:56 +0000
% 0.72/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.72/1.17 git: non_committed_changes: false
% 0.72/1.17 git: last_make_outside_of_git: false
% 0.72/1.17
% 0.72/1.17 ------ Parsing...
% 0.72/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.72/1.17
% 0.72/1.17 ------ Preprocessing...
% 0.72/1.17
% 0.72/1.17 % SZS status Theorem for theBenchmark.p
% 0.72/1.17
% 0.72/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.72/1.17
% 0.72/1.17
%------------------------------------------------------------------------------