TSTP Solution File: NUM623+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% 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 : Fri May 3 02:50:15 EDT 2024
% Result : Theorem 13.69s 2.69s
% Output : CNFRefutation 13.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 90 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 83 ( 33 ~; 29 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 17 !; 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(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(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(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(f967,plain,
aElementOf0(xx,xQ),
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_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_496,plain,
aElementOf0(xx,xQ),
inference(cnf_transformation,[],[f967]) ).
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_31757,plain,
aElementOf0(xp,szNzAzT0),
inference(superposition,[status(thm)],[c_466,c_450]) ).
cnf(c_31786,plain,
sdtlseqdt0(xp,xx),
inference(superposition,[status(thm)],[c_496,c_457]) ).
cnf(c_31829,plain,
sdtlseqdt0(xx,xp),
inference(superposition,[status(thm)],[c_497,c_490]) ).
cnf(c_34096,plain,
( ~ aElementOf0(xp,szNzAzT0)
| ~ aElementOf0(xx,szNzAzT0)
| ~ sdtlseqdt0(xp,xx)
| ~ sdtlseqdt0(xx,xp)
| xp = xx ),
inference(instantiation,[status(thm)],[c_109]) ).
cnf(c_34097,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_34096,c_31829,c_31786,c_31757,c_498,c_487]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM623+3 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n002.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 : Thu May 2 19:43:42 EDT 2024
% 0.12/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 --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 13.69/2.69 % SZS status Started for theBenchmark.p
% 13.69/2.69 % SZS status Theorem for theBenchmark.p
% 13.69/2.69
% 13.69/2.69 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 13.69/2.69
% 13.69/2.69 ------ iProver source info
% 13.69/2.69
% 13.69/2.69 git: date: 2024-05-02 19:28:25 +0000
% 13.69/2.69 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 13.69/2.69 git: non_committed_changes: false
% 13.69/2.69
% 13.69/2.69 ------ Parsing...
% 13.69/2.69 ------ Clausification by vclausify_rel & Parsing by iProver...
% 13.69/2.69
% 13.69/2.69 ------ Preprocessing... sup_sim: 16 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e
% 13.69/2.69
% 13.69/2.69 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 13.69/2.69
% 13.69/2.69 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 13.69/2.69 ------ Proving...
% 13.69/2.69 ------ Problem Properties
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69 clauses 401
% 13.69/2.69 conjectures 1
% 13.69/2.69 EPR 81
% 13.69/2.69 Horn 326
% 13.69/2.69 unary 77
% 13.69/2.69 binary 105
% 13.69/2.69 lits 1205
% 13.69/2.69 lits eq 176
% 13.69/2.69 fd_pure 0
% 13.69/2.69 fd_pseudo 0
% 13.69/2.69 fd_cond 11
% 13.69/2.69 fd_pseudo_cond 39
% 13.69/2.69 AC symbols 0
% 13.69/2.69
% 13.69/2.69 ------ Schedule dynamic 5 is on
% 13.69/2.69
% 13.69/2.69 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69 ------
% 13.69/2.69 Current options:
% 13.69/2.69 ------
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69 ------ Proving...
% 13.69/2.69
% 13.69/2.69
% 13.69/2.69 % SZS status Theorem for theBenchmark.p
% 13.69/2.69
% 13.69/2.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 13.69/2.69
% 13.69/2.69
%------------------------------------------------------------------------------