TSTP Solution File: NUM610+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM610+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:50 EDT 2023
% Result : Theorem 4.01s 1.17s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 15 unt; 0 def)
% Number of atoms : 129 ( 2 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 160 ( 69 ~; 62 |; 22 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn; 34 !; 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(f14,axiom,
! [X0,X1,X2] :
( ( aSet0(X2)
& aSet0(X1)
& aSet0(X0) )
=> ( ( aSubsetOf0(X1,X2)
& aSubsetOf0(X0,X1) )
=> aSubsetOf0(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSubTrans) ).
fof(f96,axiom,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(f100,axiom,
( slcrc0 != xQ
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(f104,axiom,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& aSet0(xP) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5164) ).
fof(f107,axiom,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(f108,conjecture,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f109,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(negated_conjecture,[],[f108]) ).
fof(f117,plain,
~ aSubsetOf0(xP,xO),
inference(flattening,[],[f109]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X0)
| ~ aElementOf0(X2,X1) )
& aSet0(X1) ) )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f130,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f14]) ).
fof(f131,plain,
! [X0,X1,X2] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(flattening,[],[f130]) ).
fof(f252,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,[],[f124]) ).
fof(f253,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,[],[f252]) ).
fof(f254,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,[],[f253]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X2] :
( ~ aElementOf0(X2,X0)
& aElementOf0(X2,X1) )
=> ( ~ aElementOf0(sK5(X0,X1),X0)
& aElementOf0(sK5(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f256,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])],[f254,f255]) ).
fof(f339,plain,
! [X0,X1] :
( aSet0(X1)
| ~ aSubsetOf0(X1,X0)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f256]) ).
fof(f346,plain,
! [X2,X0,X1] :
( aSubsetOf0(X0,X2)
| ~ aSubsetOf0(X1,X2)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X2)
| ~ aSet0(X1)
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f525,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f532,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f100]) ).
fof(f537,plain,
aSet0(xP),
inference(cnf_transformation,[],[f104]) ).
fof(f541,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f107]) ).
fof(f542,plain,
~ aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f117]) ).
cnf(c_59,plain,
( ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| aSet0(X0) ),
inference(cnf_transformation,[],[f339]) ).
cnf(c_63,plain,
( ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X2,X0)
| ~ aSet0(X0)
| ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1) ),
inference(cnf_transformation,[],[f346]) ).
cnf(c_243,plain,
aSet0(xO),
inference(cnf_transformation,[],[f525]) ).
cnf(c_250,plain,
aSubsetOf0(xQ,xO),
inference(cnf_transformation,[],[f532]) ).
cnf(c_255,plain,
aSet0(xP),
inference(cnf_transformation,[],[f537]) ).
cnf(c_258,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f541]) ).
cnf(c_259,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f542]) ).
cnf(c_409,plain,
( ~ aSubsetOf0(X2,X0)
| ~ aSubsetOf0(X0,X1)
| ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1) ),
inference(global_subsumption_just,[status(thm)],[c_63,c_59,c_63]) ).
cnf(c_410,plain,
( ~ aSubsetOf0(X0,X1)
| ~ aSubsetOf0(X2,X0)
| ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1) ),
inference(renaming,[status(thm)],[c_409]) ).
cnf(c_18345,plain,
( ~ aSubsetOf0(X0,xQ)
| ~ aSet0(X0)
| ~ aSet0(xO)
| aSubsetOf0(X0,xO) ),
inference(superposition,[status(thm)],[c_250,c_410]) ).
cnf(c_18425,plain,
( ~ aSet0(X0)
| ~ aSubsetOf0(X0,xQ)
| aSubsetOf0(X0,xO) ),
inference(global_subsumption_just,[status(thm)],[c_18345,c_243,c_18345]) ).
cnf(c_18426,plain,
( ~ aSubsetOf0(X0,xQ)
| ~ aSet0(X0)
| aSubsetOf0(X0,xO) ),
inference(renaming,[status(thm)],[c_18425]) ).
cnf(c_18435,plain,
( ~ aSet0(xP)
| aSubsetOf0(xP,xO) ),
inference(superposition,[status(thm)],[c_258,c_18426]) ).
cnf(c_18436,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_18435,c_259,c_255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM610+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 13:09:25 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.01/1.17 % SZS status Started for theBenchmark.p
% 4.01/1.17 % SZS status Theorem for theBenchmark.p
% 4.01/1.17
% 4.01/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.01/1.17
% 4.01/1.17 ------ iProver source info
% 4.01/1.17
% 4.01/1.17 git: date: 2023-05-31 18:12:56 +0000
% 4.01/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.01/1.17 git: non_committed_changes: false
% 4.01/1.17 git: last_make_outside_of_git: false
% 4.01/1.17
% 4.01/1.17 ------ Parsing...
% 4.01/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.01/1.17
% 4.01/1.17 ------ 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
% 4.01/1.17
% 4.01/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.01/1.17
% 4.01/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.01/1.17 ------ Proving...
% 4.01/1.17 ------ Problem Properties
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17 clauses 206
% 4.01/1.17 conjectures 1
% 4.01/1.17 EPR 52
% 4.01/1.17 Horn 167
% 4.01/1.17 unary 48
% 4.01/1.17 binary 32
% 4.01/1.17 lits 661
% 4.01/1.17 lits eq 106
% 4.01/1.17 fd_pure 0
% 4.01/1.17 fd_pseudo 0
% 4.01/1.17 fd_cond 10
% 4.01/1.17 fd_pseudo_cond 25
% 4.01/1.17 AC symbols 0
% 4.01/1.17
% 4.01/1.17 ------ Input Options Time Limit: Unbounded
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17 ------
% 4.01/1.17 Current options:
% 4.01/1.17 ------
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17 ------ Proving...
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17 ------ Proving...
% 4.01/1.17
% 4.01/1.17
% 4.01/1.17 % SZS status Theorem for theBenchmark.p
% 4.01/1.17
% 4.01/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.01/1.17
% 4.01/1.17
%------------------------------------------------------------------------------