TSTP Solution File: NUM602+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM602+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n016.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:47 EDT 2023
% Result : Theorem 5.69s 1.66s
% Output : CNFRefutation 5.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 9 unt; 0 def)
% Number of atoms : 87 ( 35 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 82 ( 25 ~; 19 |; 34 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 15 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f97,axiom,
! [X0] :
( ( aElementOf0(X0,xO)
| ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
=> ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4982) ).
fof(f98,axiom,
( aElementOf0(xx,xO)
& ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5009) ).
fof(f99,conjecture,
? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f100,negated_conjecture,
~ ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
inference(negated_conjecture,[],[f99]) ).
fof(f119,plain,
! [X0] :
( ( aElementOf0(X0,xO)
| ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
=> ? [X2] :
( sdtlpdtrp0(xe,X2) = X0
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& szDzizrdt0(xd) = sdtlpdtrp0(xd,X2)
& aElementOf0(X2,szNzAzT0) ) ),
inference(rectify,[],[f97]) ).
fof(f246,plain,
! [X0] :
( ? [X2] :
( sdtlpdtrp0(xe,X2) = X0
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& szDzizrdt0(xd) = sdtlpdtrp0(xd,X2)
& aElementOf0(X2,szNzAzT0) )
| ( ~ aElementOf0(X0,xO)
& ! [X1] :
( sdtlpdtrp0(xe,X1) != X0
| ~ aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ) ),
inference(ennf_transformation,[],[f119]) ).
fof(f247,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f100]) ).
fof(f469,plain,
! [X0] :
( ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szNzAzT0) )
| ( ~ aElementOf0(X0,xO)
& ! [X2] :
( sdtlpdtrp0(xe,X2) != X0
| ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ) ),
inference(rectify,[],[f246]) ).
fof(f470,plain,
! [X0] :
( ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlpdtrp0(xe,sK70(X0)) = X0
& aElementOf0(sK70(X0),sdtlbdtrb0(xd,szDzizrdt0(xd)))
& szDzizrdt0(xd) = sdtlpdtrp0(xd,sK70(X0))
& aElementOf0(sK70(X0),szNzAzT0) ) ),
introduced(choice_axiom,[]) ).
fof(f471,plain,
! [X0] :
( ( sdtlpdtrp0(xe,sK70(X0)) = X0
& aElementOf0(sK70(X0),sdtlbdtrb0(xd,szDzizrdt0(xd)))
& szDzizrdt0(xd) = sdtlpdtrp0(xd,sK70(X0))
& aElementOf0(sK70(X0),szNzAzT0) )
| ( ~ aElementOf0(X0,xO)
& ! [X2] :
( sdtlpdtrp0(xe,X2) != X0
| ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK70])],[f469,f470]) ).
fof(f472,plain,
( ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd))) )
=> ( xx = sdtlpdtrp0(xe,sK71)
& aElementOf0(sK71,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
introduced(choice_axiom,[]) ).
fof(f473,plain,
( aElementOf0(xx,xO)
& xx = sdtlpdtrp0(xe,sK71)
& aElementOf0(sK71,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK71])],[f98,f472]) ).
fof(f856,plain,
! [X2,X0] :
( aElementOf0(sK70(X0),szNzAzT0)
| sdtlpdtrp0(xe,X2) != X0
| ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(cnf_transformation,[],[f471]) ).
fof(f863,plain,
! [X0] :
( sdtlpdtrp0(xe,sK70(X0)) = X0
| ~ aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f471]) ).
fof(f864,plain,
aElementOf0(sK71,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cnf_transformation,[],[f473]) ).
fof(f865,plain,
xx = sdtlpdtrp0(xe,sK71),
inference(cnf_transformation,[],[f473]) ).
fof(f866,plain,
aElementOf0(xx,xO),
inference(cnf_transformation,[],[f473]) ).
fof(f867,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f247]) ).
fof(f925,plain,
! [X2] :
( aElementOf0(sK70(sdtlpdtrp0(xe,X2)),szNzAzT0)
| ~ aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(equality_resolution,[],[f856]) ).
cnf(c_431,plain,
( ~ aElementOf0(X0,xO)
| sdtlpdtrp0(xe,sK70(X0)) = X0 ),
inference(cnf_transformation,[],[f863]) ).
cnf(c_438,plain,
( ~ aElementOf0(X0,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(sK70(sdtlpdtrp0(xe,X0)),szNzAzT0) ),
inference(cnf_transformation,[],[f925]) ).
cnf(c_439,plain,
aElementOf0(xx,xO),
inference(cnf_transformation,[],[f866]) ).
cnf(c_440,plain,
sdtlpdtrp0(xe,sK71) = xx,
inference(cnf_transformation,[],[f865]) ).
cnf(c_441,plain,
aElementOf0(sK71,sdtlbdtrb0(xd,szDzizrdt0(xd))),
inference(cnf_transformation,[],[f864]) ).
cnf(c_442,negated_conjecture,
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f867]) ).
cnf(c_14499,plain,
( sdtlpdtrp0(xe,sK70(xx)) != xx
| ~ aElementOf0(sK70(xx),szNzAzT0) ),
inference(instantiation,[status(thm)],[c_442]) ).
cnf(c_15010,plain,
( ~ aElementOf0(xx,xO)
| sdtlpdtrp0(xe,sK70(xx)) = xx ),
inference(instantiation,[status(thm)],[c_431]) ).
cnf(c_18200,plain,
aElementOf0(sK70(sdtlpdtrp0(xe,sK71)),szNzAzT0),
inference(superposition,[status(thm)],[c_441,c_438]) ).
cnf(c_18201,plain,
aElementOf0(sK70(xx),szNzAzT0),
inference(demodulation,[status(thm)],[c_18200,c_440]) ).
cnf(c_18228,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18201,c_15010,c_14499,c_439]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM602+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.15/0.33 % Computer : n016.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Fri Aug 25 08:31:25 EDT 2023
% 0.15/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.69/1.66 % SZS status Started for theBenchmark.p
% 5.69/1.66 % SZS status Theorem for theBenchmark.p
% 5.69/1.66
% 5.69/1.66 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 5.69/1.66
% 5.69/1.66 ------ iProver source info
% 5.69/1.66
% 5.69/1.66 git: date: 2023-05-31 18:12:56 +0000
% 5.69/1.66 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 5.69/1.66 git: non_committed_changes: false
% 5.69/1.66 git: last_make_outside_of_git: false
% 5.69/1.66
% 5.69/1.66 ------ Parsing...
% 5.69/1.66 ------ Clausification by vclausify_rel & Parsing by iProver...
% 5.69/1.66
% 5.69/1.66 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe_e
% 5.69/1.66
% 5.69/1.66 ------ Preprocessing... gs_s sp: 4 0s gs_e scvd_s sp: 10 0s scvd_e snvd_s sp: 0 0s snvd_e
% 5.69/1.66
% 5.69/1.66 ------ Preprocessing...
% 5.69/1.66 ------ Proving...
% 5.69/1.66 ------ Problem Properties
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66 clauses 435
% 5.69/1.66 conjectures 1
% 5.69/1.66 EPR 78
% 5.69/1.66 Horn 346
% 5.69/1.66 unary 41
% 5.69/1.66 binary 164
% 5.69/1.66 lits 1331
% 5.69/1.66 lits eq 169
% 5.69/1.66 fd_pure 0
% 5.69/1.66 fd_pseudo 0
% 5.69/1.66 fd_cond 10
% 5.69/1.66 fd_pseudo_cond 46
% 5.69/1.66 AC symbols 0
% 5.69/1.66
% 5.69/1.66 ------ Input Options Time Limit: Unbounded
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66 ------
% 5.69/1.66 Current options:
% 5.69/1.66 ------
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66 ------ Proving...
% 5.69/1.66
% 5.69/1.66
% 5.69/1.66 % SZS status Theorem for theBenchmark.p
% 5.69/1.66
% 5.69/1.66 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 5.69/1.66
% 5.69/1.66
%------------------------------------------------------------------------------