TSTP Solution File: NUM623+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM623+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:57 EDT 2023
% Result : Theorem 7.45s 1.66s
% Output : CNFRefutation 7.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 106 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 98 ( 38 ~; 33 |; 20 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 10 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X0)
& sdtlseqdt0(X0,X1) )
=> X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessASymm) ).
fof(f101,axiom,
( aSubsetOf0(xQ,szNzAzT0)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5106) ).
fof(f103,axiom,
( xp = szmzizndt0(xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
=> sdtlseqdt0(xp,X0) )
& aElementOf0(xp,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5147) ).
fof(f105,axiom,
aElementOf0(xp,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5173) ).
fof(f107,axiom,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( aElementOf0(X0,xP)
=> aElementOf0(X0,xQ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(f113,axiom,
( aElementOf0(xx,xP)
& szmzizndt0(xQ) != xx
& aElementOf0(xx,xQ)
& aElement0(xx) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5348) ).
fof(f114,axiom,
( ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& aElementOf0(xx,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5365) ).
fof(f116,axiom,
! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> sdtlseqdt0(xx,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5401) ).
fof(f119,axiom,
( aElementOf0(xx,xQ)
& aElementOf0(xp,sdtlpdtrp0(xN,xm)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5481) ).
fof(f120,conjecture,
xp = xx,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f121,negated_conjecture,
xp != xx,
inference(negated_conjecture,[],[f120]) ).
fof(f144,plain,
xp != xx,
inference(flattening,[],[f121]) ).
fof(f186,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f35]) ).
fof(f187,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(flattening,[],[f186]) ).
fof(f276,plain,
( aSubsetOf0(xQ,szNzAzT0)
& ! [X0] :
( aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,xQ) ) ),
inference(ennf_transformation,[],[f101]) ).
fof(f278,plain,
( xp = szmzizndt0(xQ)
& ! [X0] :
( sdtlseqdt0(xp,X0)
| ~ aElementOf0(X0,xQ) )
& aElementOf0(xp,xQ) ),
inference(ennf_transformation,[],[f103]) ).
fof(f280,plain,
( aSubsetOf0(xP,xQ)
& ! [X0] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ) ),
inference(ennf_transformation,[],[f107]) ).
fof(f282,plain,
! [X0] :
( sdtlseqdt0(xx,X0)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(ennf_transformation,[],[f116]) ).
fof(f515,plain,
( ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
=> ( xx = sdtlpdtrp0(xe,sK73)
& aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
introduced(choice_axiom,[]) ).
fof(f516,plain,
( xx = sdtlpdtrp0(xe,sK73)
& aElementOf0(sK73,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(xx,szNzAzT0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK73])],[f114,f515]) ).
fof(f579,plain,
! [X0,X1] :
( X0 = X1
| ~ sdtlseqdt0(X1,X0)
| ~ sdtlseqdt0(X0,X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f187]) ).
fof(f919,plain,
! [X0] :
( aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f276]) ).
fof(f927,plain,
! [X0] :
( sdtlseqdt0(xp,X0)
| ~ aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f278]) ).
fof(f936,plain,
aElementOf0(xp,xQ),
inference(cnf_transformation,[],[f105]) ).
fof(f939,plain,
! [X0] :
( aElementOf0(X0,xQ)
| ~ aElementOf0(X0,xP) ),
inference(cnf_transformation,[],[f280]) ).
fof(f954,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f113]) ).
fof(f955,plain,
aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f516]) ).
fof(f960,plain,
! [X0] :
( sdtlseqdt0(xx,X0)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(cnf_transformation,[],[f282]) ).
fof(f966,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f119]) ).
fof(f968,plain,
xp != xx,
inference(cnf_transformation,[],[f144]) ).
cnf(c_109,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ sdtlseqdt0(X1,X0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| X0 = X1 ),
inference(cnf_transformation,[],[f579]) ).
cnf(c_450,plain,
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f919]) ).
cnf(c_457,plain,
( ~ aElementOf0(X0,xQ)
| sdtlseqdt0(xp,X0) ),
inference(cnf_transformation,[],[f927]) ).
cnf(c_466,plain,
aElementOf0(xp,xQ),
inference(cnf_transformation,[],[f936]) ).
cnf(c_470,plain,
( ~ aElementOf0(X0,xP)
| aElementOf0(X0,xQ) ),
inference(cnf_transformation,[],[f939]) ).
cnf(c_481,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f954]) ).
cnf(c_487,plain,
aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f955]) ).
cnf(c_490,plain,
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| sdtlseqdt0(xx,X0) ),
inference(cnf_transformation,[],[f960]) ).
cnf(c_497,plain,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
inference(cnf_transformation,[],[f966]) ).
cnf(c_498,negated_conjecture,
xp != xx,
inference(cnf_transformation,[],[f968]) ).
cnf(c_1643,plain,
( ~ aElementOf0(X0,xP)
| sdtlseqdt0(xp,X0) ),
inference(prop_impl_just,[status(thm)],[c_470,c_457]) ).
cnf(c_18616,plain,
sdtlseqdt0(xp,xx),
inference(superposition,[status(thm)],[c_481,c_1643]) ).
cnf(c_18692,plain,
aElementOf0(xp,szNzAzT0),
inference(superposition,[status(thm)],[c_466,c_450]) ).
cnf(c_19736,plain,
( ~ aElementOf0(xp,szNzAzT0)
| ~ aElementOf0(xx,szNzAzT0)
| ~ sdtlseqdt0(xp,xx)
| ~ sdtlseqdt0(xx,xp)
| xp = xx ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_20154,plain,
sdtlseqdt0(xx,xp),
inference(superposition,[status(thm)],[c_497,c_490]) ).
cnf(c_20155,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_20154,c_19736,c_18692,c_18616,c_498,c_487]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM623+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 10:01:17 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.45/1.66 % SZS status Started for theBenchmark.p
% 7.45/1.66 % SZS status Theorem for theBenchmark.p
% 7.45/1.66
% 7.45/1.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.45/1.66
% 7.45/1.66 ------ iProver source info
% 7.45/1.66
% 7.45/1.66 git: date: 2023-05-31 18:12:56 +0000
% 7.45/1.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.45/1.66 git: non_committed_changes: false
% 7.45/1.66 git: last_make_outside_of_git: false
% 7.45/1.66
% 7.45/1.66 ------ Parsing...
% 7.45/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.45/1.66
% 7.45/1.66 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe_e
% 7.45/1.66
% 7.45/1.66 ------ Preprocessing... gs_s sp: 4 0s gs_e scvd_s sp: 10 0s scvd_e snvd_s sp: 0 0s snvd_e
% 7.45/1.66
% 7.45/1.66 ------ Preprocessing...
% 7.45/1.66 ------ Proving...
% 7.45/1.66 ------ Problem Properties
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66 clauses 614
% 7.45/1.66 conjectures 1
% 7.45/1.66 EPR 131
% 7.45/1.66 Horn 524
% 7.45/1.66 unary 79
% 7.45/1.66 binary 305
% 7.45/1.66 lits 1652
% 7.45/1.66 lits eq 200
% 7.45/1.66 fd_pure 0
% 7.45/1.66 fd_pseudo 0
% 7.45/1.66 fd_cond 11
% 7.45/1.66 fd_pseudo_cond 46
% 7.45/1.66 AC symbols 0
% 7.45/1.66
% 7.45/1.66 ------ Input Options Time Limit: Unbounded
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66 ------
% 7.45/1.66 Current options:
% 7.45/1.66 ------
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66 ------ Proving...
% 7.45/1.66
% 7.45/1.66
% 7.45/1.66 % SZS status Theorem for theBenchmark.p
% 7.45/1.66
% 7.45/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.45/1.66
% 7.45/1.66
%------------------------------------------------------------------------------