TSTP Solution File: NUM617+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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:13 EDT 2024
% Result : Theorem 8.04s 1.67s
% Output : CNFRefutation 8.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 19 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 108 ( 46 ~; 40 |; 17 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(f23,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(f101,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
fof(f107,axiom,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(f113,axiom,
aElementOf0(xx,xP),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5348) ).
fof(f114,conjecture,
aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f115,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(negated_conjecture,[],[f114]) ).
fof(f123,plain,
~ aElementOf0(xx,szNzAzT0),
inference(flattening,[],[f115]) ).
fof(f130,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) )
& aSet0(X1) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f258,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) )
& aSet0(X1) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f130]) ).
fof(f259,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) )
| ~ aSet0(X1) )
& ( ( ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) )
& aSet0(X1) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(flattening,[],[f258]) ).
fof(f260,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) )
| ~ aSet0(X1) )
& ( ( ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) )
& aSet0(X1) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(rectify,[],[f259]) ).
fof(f261,plain,
! [X0,X1] :
( ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) )
=> ( ~ aElementOf0(sK5(X0,X1),X0)
& aElementOf0(sK5(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f262,plain,
! [X0] :
( ! [X1] :
( ( aSubsetOf0(X1,X0)
| ( ~ aElementOf0(sK5(X0,X1),X0)
& aElementOf0(sK5(X0,X1),X1) )
| ~ aSet0(X1) )
& ( ( ! [X3] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1) )
& aSet0(X1) )
| ~ aSubsetOf0(X1,X0) ) )
| ~ aSet0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f260,f261]) ).
fof(f345,plain,
! [X0,X1] :
( aSet0(X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f262]) ).
fof(f346,plain,
! [X3,X0,X1] :
( aElementOf0(X3,X0)
| ~ aElementOf0(X3,X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f262]) ).
fof(f383,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f540,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f101]) ).
fof(f547,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f107]) ).
fof(f555,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f113]) ).
fof(f556,plain,
~ aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f123]) ).
cnf(c_58,plain,
( ~ aElementOf0(X0,X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2)
| aElementOf0(X0,X2) ),
inference(cnf_transformation,[],[f346]) ).
cnf(c_59,plain,
( ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| aSet0(X0) ),
inference(cnf_transformation,[],[f345]) ).
cnf(c_95,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f383]) ).
cnf(c_251,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f540]) ).
cnf(c_258,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f547]) ).
cnf(c_266,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f555]) ).
cnf(c_267,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f556]) ).
cnf(c_18550,plain,
( ~ aSet0(szNzAzT0)
| aSet0(xQ) ),
inference(superposition,[status(thm)],[c_251,c_59]) ).
cnf(c_18554,plain,
aSet0(xQ),
inference(forward_subsumption_resolution,[status(thm)],[c_18550,c_95]) ).
cnf(c_20373,plain,
( ~ aSubsetOf0(xP,X0)
| ~ aSet0(X0)
| aElementOf0(xx,X0) ),
inference(superposition,[status(thm)],[c_266,c_58]) ).
cnf(c_23674,plain,
( ~ aSet0(xQ)
| aElementOf0(xx,xQ) ),
inference(superposition,[status(thm)],[c_258,c_20373]) ).
cnf(c_23677,plain,
aElementOf0(xx,xQ),
inference(forward_subsumption_resolution,[status(thm)],[c_23674,c_18554]) ).
cnf(c_23703,plain,
( ~ aSubsetOf0(xQ,X0)
| ~ aSet0(X0)
| aElementOf0(xx,X0) ),
inference(superposition,[status(thm)],[c_23677,c_58]) ).
cnf(c_23710,plain,
( ~ aSubsetOf0(xQ,szNzAzT0)
| ~ aSet0(szNzAzT0)
| aElementOf0(xx,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_23703]) ).
cnf(c_23711,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_23710,c_267,c_251,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : NUM617+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n028.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 19:42:33 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 8.04/1.67 % SZS status Started for theBenchmark.p
% 8.04/1.67 % SZS status Theorem for theBenchmark.p
% 8.04/1.67
% 8.04/1.67 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.04/1.67
% 8.04/1.67 ------ iProver source info
% 8.04/1.67
% 8.04/1.67 git: date: 2024-05-02 19:28:25 +0000
% 8.04/1.67 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.04/1.67 git: non_committed_changes: false
% 8.04/1.67
% 8.04/1.67 ------ Parsing...
% 8.04/1.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.04/1.67
% 8.04/1.67 ------ 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
% 8.04/1.67
% 8.04/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.04/1.67
% 8.04/1.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 8.04/1.67 ------ Proving...
% 8.04/1.67 ------ Problem Properties
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67 clauses 214
% 8.04/1.67 conjectures 1
% 8.04/1.67 EPR 55
% 8.04/1.67 Horn 175
% 8.04/1.67 unary 56
% 8.04/1.67 binary 32
% 8.04/1.67 lits 669
% 8.04/1.67 lits eq 109
% 8.04/1.67 fd_pure 0
% 8.04/1.67 fd_pseudo 0
% 8.04/1.67 fd_cond 10
% 8.04/1.67 fd_pseudo_cond 25
% 8.04/1.67 AC symbols 0
% 8.04/1.67
% 8.04/1.67 ------ Schedule dynamic 5 is on
% 8.04/1.67
% 8.04/1.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67 ------
% 8.04/1.67 Current options:
% 8.04/1.67 ------
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67 ------ Proving...
% 8.04/1.67
% 8.04/1.67
% 8.04/1.67 % SZS status Theorem for theBenchmark.p
% 8.04/1.67
% 8.04/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.04/1.67
% 8.04/1.67
%------------------------------------------------------------------------------