TSTP Solution File: NUM560+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM560+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:49:56 EDT 2024
% Result : Theorem 0.44s 1.13s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f68,conjecture,
( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
=> aElementOf0(X0,szDzozmdt0(xF)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f69,negated_conjecture,
~ ( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
=> aElementOf0(X0,szDzozmdt0(xF)) ) ) ),
inference(negated_conjecture,[],[f68]) ).
fof(f77,plain,
~ ( ( ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) )
=> ( aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
| ! [X1] :
( aElementOf0(X1,sdtlbdtrb0(xF,xy))
=> aElementOf0(X1,szDzozmdt0(xF)) ) ) ),
inference(rectify,[],[f69]) ).
fof(f168,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( ~ aElementOf0(X1,szDzozmdt0(xF))
& aElementOf0(X1,sdtlbdtrb0(xF,xy)) )
& ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(ennf_transformation,[],[f77]) ).
fof(f169,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( ~ aElementOf0(X1,szDzozmdt0(xF))
& aElementOf0(X1,sdtlbdtrb0(xF,xy)) )
& ! [X0] :
( aElementOf0(X0,sdtlbdtrb0(xF,xy))
<=> ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(flattening,[],[f168]) ).
fof(f237,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( ~ aElementOf0(X1,szDzozmdt0(xF))
& aElementOf0(X1,sdtlbdtrb0(xF,xy)) )
& ! [X0] :
( ( aElementOf0(X0,sdtlbdtrb0(xF,xy))
| xy != sdtlpdtrp0(xF,X0)
| ~ aElementOf0(X0,szDzozmdt0(xF)) )
& ( ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) )
| ~ aElementOf0(X0,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(nnf_transformation,[],[f169]) ).
fof(f238,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X1] :
( ~ aElementOf0(X1,szDzozmdt0(xF))
& aElementOf0(X1,sdtlbdtrb0(xF,xy)) )
& ! [X0] :
( ( aElementOf0(X0,sdtlbdtrb0(xF,xy))
| xy != sdtlpdtrp0(xF,X0)
| ~ aElementOf0(X0,szDzozmdt0(xF)) )
& ( ( xy = sdtlpdtrp0(xF,X0)
& aElementOf0(X0,szDzozmdt0(xF)) )
| ~ aElementOf0(X0,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(flattening,[],[f237]) ).
fof(f239,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ? [X0] :
( ~ aElementOf0(X0,szDzozmdt0(xF))
& aElementOf0(X0,sdtlbdtrb0(xF,xy)) )
& ! [X1] :
( ( aElementOf0(X1,sdtlbdtrb0(xF,xy))
| xy != sdtlpdtrp0(xF,X1)
| ~ aElementOf0(X1,szDzozmdt0(xF)) )
& ( ( xy = sdtlpdtrp0(xF,X1)
& aElementOf0(X1,szDzozmdt0(xF)) )
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(rectify,[],[f238]) ).
fof(f240,plain,
( ? [X0] :
( ~ aElementOf0(X0,szDzozmdt0(xF))
& aElementOf0(X0,sdtlbdtrb0(xF,xy)) )
=> ( ~ aElementOf0(sK17,szDzozmdt0(xF))
& aElementOf0(sK17,sdtlbdtrb0(xF,xy)) ) ),
introduced(choice_axiom,[]) ).
fof(f241,plain,
( ~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF))
& ~ aElementOf0(sK17,szDzozmdt0(xF))
& aElementOf0(sK17,sdtlbdtrb0(xF,xy))
& ! [X1] :
( ( aElementOf0(X1,sdtlbdtrb0(xF,xy))
| xy != sdtlpdtrp0(xF,X1)
| ~ aElementOf0(X1,szDzozmdt0(xF)) )
& ( ( xy = sdtlpdtrp0(xF,X1)
& aElementOf0(X1,szDzozmdt0(xF)) )
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ) )
& aSet0(sdtlbdtrb0(xF,xy)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17])],[f239,f240]) ).
fof(f367,plain,
! [X1] :
( aElementOf0(X1,szDzozmdt0(xF))
| ~ aElementOf0(X1,sdtlbdtrb0(xF,xy)) ),
inference(cnf_transformation,[],[f241]) ).
fof(f370,plain,
aElementOf0(sK17,sdtlbdtrb0(xF,xy)),
inference(cnf_transformation,[],[f241]) ).
fof(f371,plain,
~ aElementOf0(sK17,szDzozmdt0(xF)),
inference(cnf_transformation,[],[f241]) ).
cnf(c_174,negated_conjecture,
~ aElementOf0(sK17,szDzozmdt0(xF)),
inference(cnf_transformation,[],[f371]) ).
cnf(c_175,negated_conjecture,
aElementOf0(sK17,sdtlbdtrb0(xF,xy)),
inference(cnf_transformation,[],[f370]) ).
cnf(c_178,negated_conjecture,
( ~ aElementOf0(X0,sdtlbdtrb0(xF,xy))
| aElementOf0(X0,szDzozmdt0(xF)) ),
inference(cnf_transformation,[],[f367]) ).
cnf(c_12165,plain,
szDzozmdt0(xF) = sP1_iProver_def,
definition ).
cnf(c_12167,negated_conjecture,
( ~ aElementOf0(X0,sP0_iProver_def)
| aElementOf0(X0,sP1_iProver_def) ),
inference(demodulation,[status(thm)],[c_178,c_12165]) ).
cnf(c_12170,negated_conjecture,
aElementOf0(sK17,sP0_iProver_def),
inference(demodulation,[status(thm)],[c_175]) ).
cnf(c_12171,negated_conjecture,
~ aElementOf0(sK17,sP1_iProver_def),
inference(demodulation,[status(thm)],[c_174]) ).
cnf(c_14210,plain,
aElementOf0(sK17,sP1_iProver_def),
inference(superposition,[status(thm)],[c_12170,c_12167]) ).
cnf(c_14211,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_14210,c_12171]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM560+2 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : run_iprover %s %d THM
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Thu May 2 19:39:43 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 0.44/1.13 % SZS status Started for theBenchmark.p
% 0.44/1.13 % SZS status Theorem for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.44/1.13
% 0.44/1.13 ------ iProver source info
% 0.44/1.13
% 0.44/1.13 git: date: 2024-05-02 19:28:25 +0000
% 0.44/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.44/1.13 git: non_committed_changes: false
% 0.44/1.13
% 0.44/1.13 ------ Parsing...
% 0.44/1.13 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.44/1.13
% 0.44/1.13 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/1.13 ------ Proving...
% 0.44/1.13 ------ Problem Properties
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 clauses 130
% 0.44/1.13 conjectures 7
% 0.44/1.13 EPR 35
% 0.44/1.13 Horn 97
% 0.44/1.13 unary 17
% 0.44/1.13 binary 21
% 0.44/1.13 lits 442
% 0.44/1.13 lits eq 67
% 0.44/1.13 fd_pure 0
% 0.44/1.13 fd_pseudo 0
% 0.44/1.13 fd_cond 10
% 0.44/1.13 fd_pseudo_cond 21
% 0.44/1.13 AC symbols 0
% 0.44/1.13
% 0.44/1.13 ------ Schedule dynamic 5 is on
% 0.44/1.13
% 0.44/1.13 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------
% 0.44/1.13 Current options:
% 0.44/1.13 ------
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 ------ Proving...
% 0.44/1.13
% 0.44/1.13
% 0.44/1.13 % SZS status Theorem for theBenchmark.p
% 0.44/1.13
% 0.44/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.13
% 0.44/1.13
%------------------------------------------------------------------------------