TSTP Solution File: NUM620+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM620+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:14 EDT 2024
% Result : Theorem 10.01s 2.16s
% Output : CNFRefutation 10.01s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f91,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> sdtlseqdt0(sdtlpdtrp0(xe,X0),X1) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ) )
& szNzAzT0 = szDzozmdt0(xe)
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(f115,axiom,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5389) ).
fof(f117,conjecture,
( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f118,negated_conjecture,
~ ( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xm))
=> aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(negated_conjecture,[],[f117]) ).
fof(f263,plain,
( ! [X0] :
( ( szmzizndt0(sdtlpdtrp0(xN,X0)) = sdtlpdtrp0(xe,X0)
& ! [X1] :
( sdtlseqdt0(sdtlpdtrp0(xe,X0),X1)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,X0)) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) )
| ~ aElementOf0(X0,szNzAzT0) )
& szNzAzT0 = szDzozmdt0(xe)
& aFunction0(xe) ),
inference(ennf_transformation,[],[f91]) ).
fof(f279,plain,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ) ),
inference(ennf_transformation,[],[f118]) ).
fof(f280,plain,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ) ),
inference(flattening,[],[f279]) ).
fof(f864,plain,
! [X0] :
( aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f263]) ).
fof(f952,plain,
aElementOf0(xm,szNzAzT0),
inference(cnf_transformation,[],[f115]) ).
fof(f953,plain,
xx = sdtlpdtrp0(xe,xm),
inference(cnf_transformation,[],[f115]) ).
fof(f955,plain,
! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xm)) ),
inference(cnf_transformation,[],[f280]) ).
fof(f957,plain,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(cnf_transformation,[],[f280]) ).
cnf(c_400,plain,
( ~ aElementOf0(X0,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f864]) ).
cnf(c_488,plain,
sdtlpdtrp0(xe,xm) = xx,
inference(cnf_transformation,[],[f953]) ).
cnf(c_489,plain,
aElementOf0(xm,szNzAzT0),
inference(cnf_transformation,[],[f952]) ).
cnf(c_491,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(cnf_transformation,[],[f957]) ).
cnf(c_493,negated_conjecture,
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xm))
| aElementOf0(X0,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(cnf_transformation,[],[f955]) ).
cnf(c_26392,plain,
sdtlpdtrp0(xN,xm) = sP0_iProver_def,
definition ).
cnf(c_26393,plain,
szszuzczcdt0(xn) = sP1_iProver_def,
definition ).
cnf(c_26394,plain,
sdtlpdtrp0(xN,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_26395,negated_conjecture,
( ~ aElementOf0(X0,sP0_iProver_def)
| aElementOf0(X0,sP2_iProver_def) ),
inference(demodulation,[status(thm)],[c_493,c_26393,c_26394,c_26392]) ).
cnf(c_26397,negated_conjecture,
~ aElementOf0(xx,sP2_iProver_def),
inference(demodulation,[status(thm)],[c_491]) ).
cnf(c_32789,plain,
( ~ aElementOf0(xm,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,xm),sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_26392,c_400]) ).
cnf(c_32796,plain,
( ~ aElementOf0(xm,szNzAzT0)
| aElementOf0(xx,sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_32789,c_488]) ).
cnf(c_32797,plain,
aElementOf0(xx,sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_32796,c_489]) ).
cnf(c_32841,plain,
aElementOf0(xx,sP2_iProver_def),
inference(superposition,[status(thm)],[c_32797,c_26395]) ).
cnf(c_32842,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_32841,c_26397]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM620+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 20:05:05 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running first-order theorem proving
% 0.19/0.45 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
% 10.01/2.16 % SZS status Started for theBenchmark.p
% 10.01/2.16 % SZS status Theorem for theBenchmark.p
% 10.01/2.16
% 10.01/2.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.01/2.16
% 10.01/2.16 ------ iProver source info
% 10.01/2.16
% 10.01/2.16 git: date: 2024-05-02 19:28:25 +0000
% 10.01/2.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.01/2.16 git: non_committed_changes: false
% 10.01/2.16
% 10.01/2.16 ------ Parsing...
% 10.01/2.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.01/2.16
% 10.01/2.16 ------ 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
% 10.01/2.16
% 10.01/2.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.01/2.16
% 10.01/2.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.01/2.16 ------ Proving...
% 10.01/2.16 ------ Problem Properties
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16 clauses 401
% 10.01/2.16 conjectures 3
% 10.01/2.16 EPR 84
% 10.01/2.16 Horn 326
% 10.01/2.16 unary 77
% 10.01/2.16 binary 105
% 10.01/2.16 lits 1205
% 10.01/2.16 lits eq 179
% 10.01/2.16 fd_pure 0
% 10.01/2.16 fd_pseudo 0
% 10.01/2.16 fd_cond 11
% 10.01/2.16 fd_pseudo_cond 39
% 10.01/2.16 AC symbols 0
% 10.01/2.16
% 10.01/2.16 ------ Schedule dynamic 5 is on
% 10.01/2.16
% 10.01/2.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16 ------
% 10.01/2.16 Current options:
% 10.01/2.16 ------
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16 ------ Proving...
% 10.01/2.16
% 10.01/2.16
% 10.01/2.16 % SZS status Theorem for theBenchmark.p
% 10.01/2.16
% 10.01/2.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.01/2.16
% 10.01/2.16
%------------------------------------------------------------------------------