TSTP Solution File: NUM618+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM618+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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:54 EDT 2023
% Result : Theorem 3.68s 1.04s
% Output : CNFRefutation 3.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 44 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 9 |; 13 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn; 8 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f97,axiom,
! [X0] :
( aElementOf0(X0,xO)
=> ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(X1,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
fof(f114,axiom,
( aElementOf0(xx,xO)
& aElementOf0(xx,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5365) ).
fof(f115,conjecture,
? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f116,negated_conjecture,
~ ? [X0] :
( sdtlpdtrp0(xe,X0) = xx
& aElementOf0(X0,szNzAzT0) ),
inference(negated_conjecture,[],[f115]) ).
fof(f246,plain,
! [X0] :
( ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(X1,szNzAzT0) )
| ~ aElementOf0(X0,xO) ),
inference(ennf_transformation,[],[f97]) ).
fof(f247,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(ennf_transformation,[],[f116]) ).
fof(f337,plain,
! [X0] :
( ? [X1] :
( sdtlpdtrp0(xe,X1) = X0
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlpdtrp0(xe,sK28(X0)) = X0
& aElementOf0(sK28(X0),sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(sK28(X0),szNzAzT0) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
! [X0] :
( ( sdtlpdtrp0(xe,sK28(X0)) = X0
& aElementOf0(sK28(X0),sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(sK28(X0),szNzAzT0) )
| ~ aElementOf0(X0,xO) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK28])],[f246,f337]) ).
fof(f534,plain,
! [X0] :
( aElementOf0(sK28(X0),szNzAzT0)
| ~ aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f338]) ).
fof(f536,plain,
! [X0] :
( sdtlpdtrp0(xe,sK28(X0)) = X0
| ~ aElementOf0(X0,xO) ),
inference(cnf_transformation,[],[f338]) ).
fof(f558,plain,
aElementOf0(xx,xO),
inference(cnf_transformation,[],[f114]) ).
fof(f559,plain,
! [X0] :
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f247]) ).
cnf(c_244,plain,
( ~ aElementOf0(X0,xO)
| sdtlpdtrp0(xe,sK28(X0)) = X0 ),
inference(cnf_transformation,[],[f536]) ).
cnf(c_246,plain,
( ~ aElementOf0(X0,xO)
| aElementOf0(sK28(X0),szNzAzT0) ),
inference(cnf_transformation,[],[f534]) ).
cnf(c_267,plain,
aElementOf0(xx,xO),
inference(cnf_transformation,[],[f558]) ).
cnf(c_269,negated_conjecture,
( sdtlpdtrp0(xe,X0) != xx
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_19056,plain,
sdtlpdtrp0(xe,sK28(xx)) = xx,
inference(superposition,[status(thm)],[c_267,c_244]) ).
cnf(c_19094,plain,
~ aElementOf0(sK28(xx),szNzAzT0),
inference(superposition,[status(thm)],[c_19056,c_269]) ).
cnf(c_19095,plain,
~ aElementOf0(xx,xO),
inference(superposition,[status(thm)],[c_246,c_19094]) ).
cnf(c_19096,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_19095,c_267]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM618+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : run_iprover %s %d THM
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri Aug 25 12:50:12 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.40 Running first-order theorem proving
% 0.16/0.40 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.68/1.04 % SZS status Started for theBenchmark.p
% 3.68/1.04 % SZS status Theorem for theBenchmark.p
% 3.68/1.04
% 3.68/1.04 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.68/1.04
% 3.68/1.04 ------ iProver source info
% 3.68/1.04
% 3.68/1.04 git: date: 2023-05-31 18:12:56 +0000
% 3.68/1.04 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.68/1.04 git: non_committed_changes: false
% 3.68/1.04 git: last_make_outside_of_git: false
% 3.68/1.04
% 3.68/1.04 ------ Parsing...
% 3.68/1.04 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.68/1.04
% 3.68/1.04 ------ Preprocessing... sup_sim: 3 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
% 3.68/1.04
% 3.68/1.04 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.68/1.04
% 3.68/1.04 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.68/1.04 ------ Proving...
% 3.68/1.04 ------ Problem Properties
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04 clauses 216
% 3.68/1.04 conjectures 1
% 3.68/1.04 EPR 56
% 3.68/1.04 Horn 177
% 3.68/1.04 unary 57
% 3.68/1.04 binary 33
% 3.68/1.04 lits 672
% 3.68/1.04 lits eq 110
% 3.68/1.04 fd_pure 0
% 3.68/1.04 fd_pseudo 0
% 3.68/1.04 fd_cond 10
% 3.68/1.04 fd_pseudo_cond 25
% 3.68/1.04 AC symbols 0
% 3.68/1.04
% 3.68/1.04 ------ Schedule dynamic 5 is on
% 3.68/1.04
% 3.68/1.04 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04 ------
% 3.68/1.04 Current options:
% 3.68/1.04 ------
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04 ------ Proving...
% 3.68/1.04
% 3.68/1.04
% 3.68/1.04 % SZS status Theorem for theBenchmark.p
% 3.68/1.04
% 3.68/1.04 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.68/1.04
% 3.68/1.04
%------------------------------------------------------------------------------