%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU294+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:56:31 PM UTC 2026
% Result : Theorem 1.88s 1.28s
% Output : CNFRefutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 13 unt; 1 def)
% Number of atoms : 62 ( 3 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 14 |; 8 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 30 ( 0 sgn 26 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f46,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f47,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f50,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f50]) ).
fof(f86,plain,
! [X0] :
( ~ finite(X0)
| ! [X1] :
( ~ element(X1,powerset(X0))
| finite(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f96,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f97,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(flattening,[],[f96]) ).
fof(f101,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(ennf_transformation,[],[f57]) ).
fof(f134,plain,
( finite(sK27)
& subset(sK26,sK27)
& ~ finite(sK26) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK26,sK27]),skolemize(X0,sK26),skolemize(X1,sK27)],[f97]) ).
fof(f147,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ element(X1,powerset(X0))
| finite(X1) ),
inference(cnf_transformation,[],[f86]) ).
fof(f243,plain,
finite(sK27),
inference(cnf_transformation,[],[f134]) ).
fof(f244,plain,
subset(sK26,sK27),
inference(cnf_transformation,[],[f134]) ).
fof(f245,plain,
~ finite(sK26),
inference(cnf_transformation,[],[f134]) ).
fof(f248,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f101]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( finite(X0)
| ~ finite(X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f147]) ).
tcf(c_153,negated_conjecture,
~ finite(sK26),
inference(cnf_transformation,[],[f245]) ).
tcf(c_154,negated_conjecture,
subset(sK26,sK27),
inference(cnf_transformation,[],[f244]) ).
tcf(c_155,negated_conjecture,
finite(sK27),
inference(cnf_transformation,[],[f243]) ).
tcf(c_158,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f248]) ).
tcf(c_617,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ( X1 != sK27 )
| ( X0 != sK26 ) ),
inference(resolution_lifted,[status(thm)],[c_154,c_158]) ).
tcf(c_618,plain,
element(sK26,powerset(sK27)),
inference(unflattening,[status(thm)],[c_617]) ).
tcf(c_823,definition,
iPr_def_10 = powerset(sK27),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_824,plain,
element(sK26,iPr_def_10),
inference(demodulation,[status(thm)],[c_618,c_823]) ).
tcf(c_825,negated_conjecture,
finite(sK27),
inference(demodulation,[status(thm)],[c_155]) ).
tcf(c_826,negated_conjecture,
~ finite(sK26),
inference(demodulation,[status(thm)],[c_153]) ).
tcf(c_1188,plain,
! [X0: $i] :
( finite(X0)
| ~ finite(sK27)
| ~ element(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_823,c_60]) ).
tcf(c_1191,plain,
! [X0: $i] :
( finite(X0)
| ~ element(X0,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1188,c_825]) ).
tcf(c_1227,plain,
finite(sK26),
inference(superposition,[status(thm)],[c_824,c_1191]) ).
tcf(c_1231,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1227,c_826]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU294+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 13:34:38 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.88/1.28 % SZS status Started for theBenchmark.p
% 1.88/1.28 % SZS status Theorem for theBenchmark.p
% 1.88/1.28
% 1.88/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.88/1.28
% 1.88/1.28 % ------ iProver source info
% 1.88/1.28
% 1.88/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.88/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.88/1.28 % git: non_committed_changes: false
% 1.88/1.28
% 1.88/1.28 % ------ Parsing...
% 1.88/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.88/1.28
% 1.88/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 69 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e %
% 1.88/1.28
% 1.88/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.88/1.28
% 1.88/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.88/1.28 % ------ Proving...
% 1.88/1.28 % ------ Problem Properties
% 1.88/1.28
% 1.88/1.28 %
% 1.88/1.28 % clauses 43
% 1.88/1.28 % conjectures 2
% 1.88/1.28 % EPR 26
% 1.88/1.28 % Horn 39
% 1.88/1.28 % unary 28
% 1.88/1.28 % binary 10
% 1.88/1.28 % lits 63
% 1.88/1.28 % lits eq 3
% 1.88/1.28 % fd_pure 0
% 1.88/1.28 % fd_pseudo 0
% 1.88/1.28 % fd_cond 1
% 1.88/1.28 % fd_pseudo_cond 1
% 1.88/1.28 % AC symbols 0
% 1.88/1.28
% 1.88/1.28 % ------ Schedule dynamic 5 is on
% 1.88/1.28
% 1.88/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.88/1.28
% 1.88/1.28
% 1.88/1.28 % ------
% 1.88/1.28 % Current options:
% 1.88/1.28 % ------
% 1.88/1.28
% 1.88/1.28
% 1.88/1.28 %
% 1.88/1.28
% 1.88/1.28 % ------ Proving...
% 1.88/1.28 %
% 1.88/1.28
% 1.88/1.28 % SZS status Theorem for theBenchmark.p
% 1.88/1.28
% 1.88/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.88/1.28
% 1.88/1.28
%------------------------------------------------------------------------------