TSTP Solution File: NUM590+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM590+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:41 EDT 2023
% Result : Theorem 7.37s 1.68s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 110 ( 17 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 117 ( 34 ~; 24 |; 49 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(f90,axiom,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4448) ).
fof(f91,axiom,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& ! [X0] :
( aElementOf0(X0,xY)
<=> ( szmzizndt0(sdtlpdtrp0(xN,xi)) != X0
& aElementOf0(X0,sdtlpdtrp0(xN,xi))
& aElement0(X0) ) )
& aSet0(xY)
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X0) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4448_02) ).
fof(f92,conjecture,
( aSubsetOf0(xY,szNzAzT0)
| ! [X0] :
( aElementOf0(X0,xY)
=> aElementOf0(X0,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f93,negated_conjecture,
~ ( aSubsetOf0(xY,szNzAzT0)
| ! [X0] :
( aElementOf0(X0,xY)
=> aElementOf0(X0,szNzAzT0) ) ),
inference(negated_conjecture,[],[f92]) ).
fof(f109,plain,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& ! [X0] :
( aElementOf0(X0,xY)
<=> ( szmzizndt0(sdtlpdtrp0(xN,xi)) != X0
& aElementOf0(X0,sdtlpdtrp0(xN,xi))
& aElement0(X0) ) )
& aSet0(xY)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(rectify,[],[f91]) ).
fof(f216,plain,
! [X0] :
( ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X0)) )
& aSet0(sdtlpdtrp0(xN,X0)) )
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f228,plain,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& ! [X0] :
( aElementOf0(X0,xY)
<=> ( szmzizndt0(sdtlpdtrp0(xN,xi)) != X0
& aElementOf0(X0,sdtlpdtrp0(xN,xi))
& aElement0(X0) ) )
& aSet0(xY)
& ! [X1] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(ennf_transformation,[],[f109]) ).
fof(f229,plain,
( ~ aSubsetOf0(xY,szNzAzT0)
& ? [X0] :
( ~ aElementOf0(X0,szNzAzT0)
& aElementOf0(X0,xY) ) ),
inference(ennf_transformation,[],[f93]) ).
fof(f418,plain,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& ! [X0] :
( ( aElementOf0(X0,xY)
| szmzizndt0(sdtlpdtrp0(xN,xi)) = X0
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| ~ aElement0(X0) )
& ( ( szmzizndt0(sdtlpdtrp0(xN,xi)) != X0
& aElementOf0(X0,sdtlpdtrp0(xN,xi))
& aElement0(X0) )
| ~ aElementOf0(X0,xY) ) )
& aSet0(xY)
& ! [X1] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(nnf_transformation,[],[f228]) ).
fof(f419,plain,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))
& ! [X0] :
( ( aElementOf0(X0,xY)
| szmzizndt0(sdtlpdtrp0(xN,xi)) = X0
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| ~ aElement0(X0) )
& ( ( szmzizndt0(sdtlpdtrp0(xN,xi)) != X0
& aElementOf0(X0,sdtlpdtrp0(xN,xi))
& aElement0(X0) )
| ~ aElementOf0(X0,xY) ) )
& aSet0(xY)
& ! [X1] :
( sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) )
& aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)) ),
inference(flattening,[],[f418]) ).
fof(f420,plain,
( ? [X0] :
( ~ aElementOf0(X0,szNzAzT0)
& aElementOf0(X0,xY) )
=> ( ~ aElementOf0(sK59,szNzAzT0)
& aElementOf0(sK59,xY) ) ),
introduced(choice_axiom,[]) ).
fof(f421,plain,
( ~ aSubsetOf0(xY,szNzAzT0)
& ~ aElementOf0(sK59,szNzAzT0)
& aElementOf0(sK59,xY) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK59])],[f229,f420]) ).
fof(f641,plain,
! [X0,X1] :
( aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f216]) ).
fof(f748,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f90]) ).
fof(f753,plain,
! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X0,xY) ),
inference(cnf_transformation,[],[f419]) ).
fof(f758,plain,
aElementOf0(sK59,xY),
inference(cnf_transformation,[],[f421]) ).
fof(f759,plain,
~ aElementOf0(sK59,szNzAzT0),
inference(cnf_transformation,[],[f421]) ).
cnf(c_269,plain,
( ~ aElementOf0(X0,sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f641]) ).
cnf(c_375,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f748]) ).
cnf(c_380,plain,
( ~ aElementOf0(X0,xY)
| aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(cnf_transformation,[],[f753]) ).
cnf(c_386,negated_conjecture,
~ aElementOf0(sK59,szNzAzT0),
inference(cnf_transformation,[],[f759]) ).
cnf(c_387,negated_conjecture,
aElementOf0(sK59,xY),
inference(cnf_transformation,[],[f758]) ).
cnf(c_32315,plain,
( ~ aElementOf0(X0,xY)
| ~ aElementOf0(xi,szNzAzT0)
| aElementOf0(X0,szNzAzT0) ),
inference(superposition,[status(thm)],[c_380,c_269]) ).
cnf(c_32330,plain,
( ~ aElementOf0(X0,xY)
| aElementOf0(X0,szNzAzT0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_32315,c_375]) ).
cnf(c_32612,plain,
aElementOf0(sK59,szNzAzT0),
inference(superposition,[status(thm)],[c_387,c_32330]) ).
cnf(c_32614,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_32612,c_386]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM590+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 12:46:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.37/1.68 % SZS status Started for theBenchmark.p
% 7.37/1.68 % SZS status Theorem for theBenchmark.p
% 7.37/1.68
% 7.37/1.68 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.37/1.68
% 7.37/1.68 ------ iProver source info
% 7.37/1.68
% 7.37/1.68 git: date: 2023-05-31 18:12:56 +0000
% 7.37/1.68 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.37/1.68 git: non_committed_changes: false
% 7.37/1.68 git: last_make_outside_of_git: false
% 7.37/1.68
% 7.37/1.68 ------ Parsing...
% 7.37/1.68 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.37/1.68
% 7.37/1.68 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.37/1.68
% 7.37/1.68 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.37/1.68
% 7.37/1.68 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.37/1.68 ------ Proving...
% 7.37/1.68 ------ Problem Properties
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68 clauses 316
% 7.37/1.68 conjectures 3
% 7.37/1.68 EPR 56
% 7.37/1.68 Horn 244
% 7.37/1.68 unary 37
% 7.37/1.68 binary 75
% 7.37/1.68 lits 1039
% 7.37/1.68 lits eq 128
% 7.37/1.68 fd_pure 0
% 7.37/1.68 fd_pseudo 0
% 7.37/1.68 fd_cond 11
% 7.37/1.68 fd_pseudo_cond 39
% 7.37/1.68 AC symbols 0
% 7.37/1.68
% 7.37/1.68 ------ Schedule dynamic 5 is on
% 7.37/1.68
% 7.37/1.68 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68 ------
% 7.37/1.68 Current options:
% 7.37/1.68 ------
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68 ------ Proving...
% 7.37/1.68
% 7.37/1.68
% 7.37/1.68 % SZS status Theorem for theBenchmark.p
% 7.37/1.68
% 7.37/1.68 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.37/1.68
% 7.37/1.68
%------------------------------------------------------------------------------