TSTP Solution File: SEU118+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU118+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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 17:03:47 EDT 2023
% Result : Theorem 2.48s 1.15s
% Output : CNFRefutation 2.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 45 ( 12 unt; 0 def)
% Number of atoms : 171 ( 11 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 205 ( 79 ~; 74 |; 38 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 1 sgn; 51 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).
fof(f8,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).
fof(f24,axiom,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f25,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_subset) ).
fof(f27,conjecture,
! [X0,X1] :
( element(X1,powerset(X0))
=> ( finite(X0)
=> element(X1,finite_subsets(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t34_finsub_1) ).
fof(f28,negated_conjecture,
~ ! [X0,X1] :
( element(X1,powerset(X0))
=> ( finite(X0)
=> element(X1,finite_subsets(X0)) ) ),
inference(negated_conjecture,[],[f27]) ).
fof(f29,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f55,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f56,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(flattening,[],[f55]) ).
fof(f57,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f60,plain,
? [X0,X1] :
( ~ element(X1,finite_subsets(X0))
& finite(X0)
& element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f28]) ).
fof(f61,plain,
? [X0,X1] :
( ~ element(X1,finite_subsets(X0))
& finite(X0)
& element(X1,powerset(X0)) ),
inference(flattening,[],[f60]) ).
fof(f68,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(nnf_transformation,[],[f51]) ).
fof(f69,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(flattening,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) )
=> ( ( ~ finite(sK0(X0,X1))
| ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( ( finite(sK0(X0,X1))
& subset(sK0(X0,X1),X0) )
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f72,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ( ( ~ finite(sK0(X0,X1))
| ~ subset(sK0(X0,X1),X0)
| ~ in(sK0(X0,X1),X1) )
& ( ( finite(sK0(X0,X1))
& subset(sK0(X0,X1),X0) )
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f70,f71]) ).
fof(f93,plain,
( ? [X0,X1] :
( ~ element(X1,finite_subsets(X0))
& finite(X0)
& element(X1,powerset(X0)) )
=> ( ~ element(sK12,finite_subsets(sK11))
& finite(sK11)
& element(sK12,powerset(sK11)) ) ),
introduced(choice_axiom,[]) ).
fof(f94,plain,
( ~ element(sK12,finite_subsets(sK11))
& finite(sK11)
& element(sK12,powerset(sK11)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12])],[f61,f93]) ).
fof(f95,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f105,plain,
! [X3,X0,X1] :
( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f109,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f8]) ).
fof(f143,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f144,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f146,plain,
element(sK12,powerset(sK11)),
inference(cnf_transformation,[],[f94]) ).
fof(f147,plain,
finite(sK11),
inference(cnf_transformation,[],[f94]) ).
fof(f148,plain,
~ element(sK12,finite_subsets(sK11)),
inference(cnf_transformation,[],[f94]) ).
fof(f149,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f95]) ).
fof(f156,plain,
! [X3,X0] :
( in(X3,finite_subsets(X0))
| ~ finite(X3)
| ~ subset(X3,X0)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f105]) ).
cnf(c_59,plain,
( ~ subset(X0,X1)
| ~ preboolean(finite_subsets(X1))
| ~ finite(X0)
| in(X0,finite_subsets(X1)) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_62,plain,
preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f109]) ).
cnf(c_96,plain,
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(cnf_transformation,[],[f143]) ).
cnf(c_97,plain,
( ~ in(X0,X1)
| element(X0,X1) ),
inference(cnf_transformation,[],[f144]) ).
cnf(c_99,negated_conjecture,
~ element(sK12,finite_subsets(sK11)),
inference(cnf_transformation,[],[f148]) ).
cnf(c_100,negated_conjecture,
finite(sK11),
inference(cnf_transformation,[],[f147]) ).
cnf(c_101,negated_conjecture,
element(sK12,powerset(sK11)),
inference(cnf_transformation,[],[f146]) ).
cnf(c_103,plain,
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f149]) ).
cnf(c_307,plain,
( ~ subset(X0,X1)
| ~ finite(X0)
| in(X0,finite_subsets(X1)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_59,c_62]) ).
cnf(c_3717,plain,
subset(sK12,sK11),
inference(superposition,[status(thm)],[c_101,c_103]) ).
cnf(c_3736,plain,
( ~ finite(sK11)
| finite(sK12) ),
inference(superposition,[status(thm)],[c_3717,c_96]) ).
cnf(c_3737,plain,
finite(sK12),
inference(forward_subsumption_resolution,[status(thm)],[c_3736,c_100]) ).
cnf(c_3828,plain,
( ~ subset(X0,X1)
| ~ finite(X0)
| element(X0,finite_subsets(X1)) ),
inference(superposition,[status(thm)],[c_307,c_97]) ).
cnf(c_4296,plain,
( ~ subset(sK12,sK11)
| ~ finite(sK12) ),
inference(superposition,[status(thm)],[c_3828,c_99]) ).
cnf(c_4297,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4296,c_3737,c_3717]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU118+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 13:02:02 EDT 2023
% 0.14/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
% 2.48/1.15 % SZS status Started for theBenchmark.p
% 2.48/1.15 % SZS status Theorem for theBenchmark.p
% 2.48/1.15
% 2.48/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.48/1.15
% 2.48/1.15 ------ iProver source info
% 2.48/1.15
% 2.48/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.48/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.48/1.15 git: non_committed_changes: false
% 2.48/1.15 git: last_make_outside_of_git: false
% 2.48/1.15
% 2.48/1.15 ------ Parsing...
% 2.48/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.48/1.15
% 2.48/1.15 ------ 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: 3 0s sf_e pe_s pe_e
% 2.48/1.15
% 2.48/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.48/1.15
% 2.48/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.48/1.15 ------ Proving...
% 2.48/1.15 ------ Problem Properties
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15 clauses 48
% 2.48/1.15 conjectures 3
% 2.48/1.15 EPR 19
% 2.48/1.15 Horn 40
% 2.48/1.15 unary 21
% 2.48/1.15 binary 18
% 2.48/1.15 lits 88
% 2.48/1.15 lits eq 5
% 2.48/1.15 fd_pure 0
% 2.48/1.15 fd_pseudo 0
% 2.48/1.15 fd_cond 1
% 2.48/1.15 fd_pseudo_cond 4
% 2.48/1.15 AC symbols 0
% 2.48/1.15
% 2.48/1.15 ------ Schedule dynamic 5 is on
% 2.48/1.15
% 2.48/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15 ------
% 2.48/1.15 Current options:
% 2.48/1.15 ------
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15 ------ Proving...
% 2.48/1.15
% 2.48/1.15
% 2.48/1.15 % SZS status Theorem for theBenchmark.p
% 2.48/1.15
% 2.48/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.48/1.15
% 2.48/1.15
%------------------------------------------------------------------------------