TSTP Solution File: SEU094+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU094+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 03:04:30 EDT 2024
% Result : Theorem 3.21s 1.24s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f21,axiom,
! [X0] :
( ( ! [X1] :
( in(X1,X0)
=> finite(X1) )
& finite(X0) )
=> finite(union(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l22_finset_1) ).
fof(f48,axiom,
! [X0] : subset(X0,powerset(union(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(f49,axiom,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f51,axiom,
! [X0] :
( finite(X0)
<=> finite(powerset(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t24_finset_1) ).
fof(f52,conjecture,
! [X0] :
( ( ! [X1] :
( in(X1,X0)
=> finite(X1) )
& finite(X0) )
<=> finite(union(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_finset_1) ).
fof(f53,negated_conjecture,
~ ! [X0] :
( ( ! [X1] :
( in(X1,X0)
=> finite(X1) )
& finite(X0) )
<=> finite(union(X0)) ),
inference(negated_conjecture,[],[f52]) ).
fof(f61,axiom,
! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t92_zfmisc_1) ).
fof(f100,plain,
! [X0] :
( finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f101,plain,
! [X0] :
( finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) ),
inference(flattening,[],[f100]) ).
fof(f104,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f105,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(flattening,[],[f104]) ).
fof(f107,plain,
? [X0] :
( ( ! [X1] :
( finite(X1)
| ~ in(X1,X0) )
& finite(X0) )
<~> finite(union(X0)) ),
inference(ennf_transformation,[],[f53]) ).
fof(f116,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f119,plain,
! [X0] :
( ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
=> ( ~ finite(sK1(X0))
& in(sK1(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
! [X0] :
( finite(union(X0))
| ( ~ finite(sK1(X0))
& in(sK1(X0),X0) )
| ~ finite(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f101,f119]) ).
fof(f171,plain,
! [X0] :
( ( finite(X0)
| ~ finite(powerset(X0)) )
& ( finite(powerset(X0))
| ~ finite(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f172,plain,
? [X0] :
( ( ~ finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) )
& ( finite(union(X0))
| ( ! [X1] :
( finite(X1)
| ~ in(X1,X0) )
& finite(X0) ) ) ),
inference(nnf_transformation,[],[f107]) ).
fof(f173,plain,
? [X0] :
( ( ~ finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) )
& ( finite(union(X0))
| ( ! [X1] :
( finite(X1)
| ~ in(X1,X0) )
& finite(X0) ) ) ),
inference(flattening,[],[f172]) ).
fof(f174,plain,
? [X0] :
( ( ~ finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) )
& ( finite(union(X0))
| ( ! [X2] :
( finite(X2)
| ~ in(X2,X0) )
& finite(X0) ) ) ),
inference(rectify,[],[f173]) ).
fof(f175,plain,
( ? [X0] :
( ( ~ finite(union(X0))
| ? [X1] :
( ~ finite(X1)
& in(X1,X0) )
| ~ finite(X0) )
& ( finite(union(X0))
| ( ! [X2] :
( finite(X2)
| ~ in(X2,X0) )
& finite(X0) ) ) )
=> ( ( ~ finite(union(sK27))
| ? [X1] :
( ~ finite(X1)
& in(X1,sK27) )
| ~ finite(sK27) )
& ( finite(union(sK27))
| ( ! [X2] :
( finite(X2)
| ~ in(X2,sK27) )
& finite(sK27) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
( ? [X1] :
( ~ finite(X1)
& in(X1,sK27) )
=> ( ~ finite(sK28)
& in(sK28,sK27) ) ),
introduced(choice_axiom,[]) ).
fof(f177,plain,
( ( ~ finite(union(sK27))
| ( ~ finite(sK28)
& in(sK28,sK27) )
| ~ finite(sK27) )
& ( finite(union(sK27))
| ( ! [X2] :
( finite(X2)
| ~ in(X2,sK27) )
& finite(sK27) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK27,sK28])],[f174,f176,f175]) ).
fof(f218,plain,
! [X0] :
( finite(union(X0))
| in(sK1(X0),X0)
| ~ finite(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f219,plain,
! [X0] :
( finite(union(X0))
| ~ finite(sK1(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f292,plain,
! [X0] : subset(X0,powerset(union(X0))),
inference(cnf_transformation,[],[f48]) ).
fof(f293,plain,
! [X0,X1] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f295,plain,
! [X0] :
( finite(powerset(X0))
| ~ finite(X0) ),
inference(cnf_transformation,[],[f171]) ).
fof(f297,plain,
( finite(union(sK27))
| finite(sK27) ),
inference(cnf_transformation,[],[f177]) ).
fof(f298,plain,
! [X2] :
( finite(union(sK27))
| finite(X2)
| ~ in(X2,sK27) ),
inference(cnf_transformation,[],[f177]) ).
fof(f299,plain,
( ~ finite(union(sK27))
| in(sK28,sK27)
| ~ finite(sK27) ),
inference(cnf_transformation,[],[f177]) ).
fof(f300,plain,
( ~ finite(union(sK27))
| ~ finite(sK28)
| ~ finite(sK27) ),
inference(cnf_transformation,[],[f177]) ).
fof(f309,plain,
! [X0,X1] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_84,plain,
( ~ finite(sK1(X0))
| ~ finite(X0)
| finite(union(X0)) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_85,plain,
( ~ finite(X0)
| in(sK1(X0),X0)
| finite(union(X0)) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_158,plain,
subset(X0,powerset(union(X0))),
inference(cnf_transformation,[],[f292]) ).
cnf(c_159,plain,
( ~ subset(X0,X1)
| ~ finite(X1)
| finite(X0) ),
inference(cnf_transformation,[],[f293]) ).
cnf(c_162,plain,
( ~ finite(X0)
| finite(powerset(X0)) ),
inference(cnf_transformation,[],[f295]) ).
cnf(c_163,negated_conjecture,
( ~ finite(union(sK27))
| ~ finite(sK27)
| ~ finite(sK28) ),
inference(cnf_transformation,[],[f300]) ).
cnf(c_164,negated_conjecture,
( ~ finite(union(sK27))
| ~ finite(sK27)
| in(sK28,sK27) ),
inference(cnf_transformation,[],[f299]) ).
cnf(c_165,negated_conjecture,
( ~ in(X0,sK27)
| finite(union(sK27))
| finite(X0) ),
inference(cnf_transformation,[],[f298]) ).
cnf(c_166,negated_conjecture,
( finite(union(sK27))
| finite(sK27) ),
inference(cnf_transformation,[],[f297]) ).
cnf(c_175,plain,
( ~ in(X0,X1)
| subset(X0,union(X1)) ),
inference(cnf_transformation,[],[f309]) ).
cnf(c_227,plain,
( ~ in(X0,X1)
| subset(X0,union(X1)) ),
inference(prop_impl_just,[status(thm)],[c_175]) ).
cnf(c_1038,plain,
( union(X2) != X3
| X0 != X1
| ~ in(X1,X2)
| ~ finite(X3)
| finite(X0) ),
inference(resolution_lifted,[status(thm)],[c_159,c_227]) ).
cnf(c_1039,plain,
( ~ in(X0,X1)
| ~ finite(union(X1))
| finite(X0) ),
inference(unflattening,[status(thm)],[c_1038]) ).
cnf(c_1110,plain,
( ~ in(X0,sK27)
| finite(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_165,c_1039]) ).
cnf(c_1377,plain,
( finite(X0)
| ~ in(X0,sK27) ),
inference(prop_impl_just,[status(thm)],[c_1110]) ).
cnf(c_1378,plain,
( ~ in(X0,sK27)
| finite(X0) ),
inference(renaming,[status(thm)],[c_1377]) ).
cnf(c_2105,plain,
union(sK27) = sP0_iProver_def,
definition ).
cnf(c_2106,negated_conjecture,
( finite(sK27)
| finite(sP0_iProver_def) ),
inference(demodulation,[status(thm)],[c_166,c_2105]) ).
cnf(c_2107,negated_conjecture,
( ~ finite(sK27)
| ~ finite(sP0_iProver_def)
| in(sK28,sK27) ),
inference(demodulation,[status(thm)],[c_164]) ).
cnf(c_2108,negated_conjecture,
( ~ finite(sK27)
| ~ finite(sK28)
| ~ finite(sP0_iProver_def) ),
inference(demodulation,[status(thm)],[c_163]) ).
cnf(c_2890,plain,
( ~ finite(sK27)
| ~ finite(sP0_iProver_def)
| finite(sK28) ),
inference(superposition,[status(thm)],[c_2107,c_1378]) ).
cnf(c_2894,plain,
( ~ finite(sP0_iProver_def)
| ~ finite(sK27) ),
inference(global_subsumption_just,[status(thm)],[c_2890,c_2108,c_2890]) ).
cnf(c_2895,plain,
( ~ finite(sK27)
| ~ finite(sP0_iProver_def) ),
inference(renaming,[status(thm)],[c_2894]) ).
cnf(c_2918,plain,
subset(sK27,powerset(sP0_iProver_def)),
inference(superposition,[status(thm)],[c_2105,c_158]) ).
cnf(c_3021,plain,
( ~ finite(powerset(sP0_iProver_def))
| finite(sK27) ),
inference(superposition,[status(thm)],[c_2918,c_159]) ).
cnf(c_3051,plain,
( ~ finite(sP0_iProver_def)
| finite(sK27) ),
inference(superposition,[status(thm)],[c_162,c_3021]) ).
cnf(c_3054,plain,
finite(sK27),
inference(global_subsumption_just,[status(thm)],[c_3051,c_2106,c_3051]) ).
cnf(c_3056,plain,
~ finite(sP0_iProver_def),
inference(backward_subsumption_resolution,[status(thm)],[c_2895,c_3054]) ).
cnf(c_3135,plain,
( ~ finite(sK27)
| finite(union(sK27))
| finite(sK1(sK27)) ),
inference(superposition,[status(thm)],[c_85,c_1378]) ).
cnf(c_3136,plain,
( ~ finite(sK27)
| finite(sK1(sK27))
| finite(sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_3135,c_2105]) ).
cnf(c_3137,plain,
finite(sK1(sK27)),
inference(forward_subsumption_resolution,[status(thm)],[c_3136,c_3056,c_3054]) ).
cnf(c_3169,plain,
( ~ finite(sK27)
| finite(union(sK27)) ),
inference(superposition,[status(thm)],[c_3137,c_84]) ).
cnf(c_3170,plain,
( ~ finite(sK27)
| finite(sP0_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_3169,c_2105]) ).
cnf(c_3171,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3170,c_3056,c_3054]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU094+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n013.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 : Thu May 2 17:40:34 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 3.21/1.24 % SZS status Started for theBenchmark.p
% 3.21/1.24 % SZS status Theorem for theBenchmark.p
% 3.21/1.24
% 3.21/1.24 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.21/1.24
% 3.21/1.24 ------ iProver source info
% 3.21/1.24
% 3.21/1.24 git: date: 2024-05-02 19:28:25 +0000
% 3.21/1.24 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.21/1.24 git: non_committed_changes: false
% 3.21/1.24
% 3.21/1.24 ------ Parsing...
% 3.21/1.24 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.21/1.24
% 3.21/1.24 ------ Preprocessing... sup_sim: 0 sf_s rm: 72 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e
% 3.21/1.24
% 3.21/1.24 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.21/1.24
% 3.21/1.24 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.21/1.24 ------ Proving...
% 3.21/1.24 ------ Problem Properties
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24 clauses 52
% 3.21/1.24 conjectures 3
% 3.21/1.24 EPR 31
% 3.21/1.24 Horn 46
% 3.21/1.24 unary 26
% 3.21/1.24 binary 17
% 3.21/1.24 lits 87
% 3.21/1.24 lits eq 3
% 3.21/1.24 fd_pure 0
% 3.21/1.24 fd_pseudo 0
% 3.21/1.24 fd_cond 1
% 3.21/1.24 fd_pseudo_cond 1
% 3.21/1.24 AC symbols 0
% 3.21/1.24
% 3.21/1.24 ------ Schedule dynamic 5 is on
% 3.21/1.24
% 3.21/1.24 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24 ------
% 3.21/1.24 Current options:
% 3.21/1.24 ------
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24 ------ Proving...
% 3.21/1.24
% 3.21/1.24
% 3.21/1.24 % SZS status Theorem for theBenchmark.p
% 3.21/1.24
% 3.21/1.24 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.21/1.24
% 3.21/1.25
%------------------------------------------------------------------------------