%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU294+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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:30 PM UTC 2026
% Result : Theorem 21.01s 5.69s
% Output : CNFRefutation 21.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 21 ~; 14 |; 9 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn 24 !; 4 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f249,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f250,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[status(cth)],[f249]) ).
fof(f324,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(f436,plain,
! [X0] :
( ~ finite(X0)
| ! [X1] :
( ~ element(X1,powerset(X0))
| finite(X1) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f636,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(ennf_transformation,[],[f250]) ).
fof(f637,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(flattening,[],[f636]) ).
fof(f1179,plain,
( finite(sK255)
& subset(sK254,sK255)
& ~ finite(sK254) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK254,sK255]),skolemize(X0,sK254),skolemize(X1,sK255)],[f637]) ).
fof(f1213,plain,
! [X0,X1] :
( ( ~ element(X0,powerset(X1))
| subset(X0,X1) )
& ( ~ subset(X0,X1)
| element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f324]) ).
fof(f1262,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ element(X1,powerset(X0))
| finite(X1) ),
inference(cnf_transformation,[],[f436]) ).
fof(f1998,plain,
finite(sK255),
inference(cnf_transformation,[],[f1179]) ).
fof(f1999,plain,
subset(sK254,sK255),
inference(cnf_transformation,[],[f1179]) ).
fof(f2000,plain,
~ finite(sK254),
inference(cnf_transformation,[],[f1179]) ).
fof(f2119,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f1213]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] :
( finite(X0)
| ~ finite(X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f1262]) ).
tcf(c_794,negated_conjecture,
~ finite(sK254),
inference(cnf_transformation,[],[f2000]) ).
tcf(c_795,negated_conjecture,
subset(sK254,sK255),
inference(cnf_transformation,[],[f1999]) ).
tcf(c_796,negated_conjecture,
finite(sK255),
inference(cnf_transformation,[],[f1998]) ).
tcf(c_914,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f2119]) ).
tcf(c_1729,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_914]) ).
tcf(c_4091,plain,
! [X0: $i,X1: $i] :
( finite(X0)
| ~ finite(X1)
| ~ subset(X0,X1) ),
inference(bin_hyper_res,[status(thm)],[c_62,c_1729]) ).
tcf(c_82614,negated_conjecture,
finite(sK255),
inference(demodulation,[status(thm)],[c_796]) ).
tcf(c_82615,negated_conjecture,
subset(sK254,sK255),
inference(demodulation,[status(thm)],[c_795]) ).
tcf(c_82616,negated_conjecture,
~ finite(sK254),
inference(demodulation,[status(thm)],[c_794]) ).
tcf(c_99240,plain,
( finite(sK254)
| ~ finite(sK255) ),
inference(superposition,[status(thm)],[c_82615,c_4091]) ).
tcf(c_99241,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_99240,c_82616,c_82614]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU294+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 13:34:27 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 21.01/5.69 % SZS status Started for theBenchmark.p
% 21.01/5.69 % SZS status Theorem for theBenchmark.p
% 21.01/5.69
% 21.01/5.69 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 21.01/5.69
% 21.01/5.69 % ------ iProver source info
% 21.01/5.69
% 21.01/5.69 % git: date: 2026-07-19 20:42:38 +0200
% 21.01/5.69 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 21.01/5.69 % git: non_committed_changes: false
% 21.01/5.69
% 21.01/5.69 % ------ Parsing...
% 21.01/5.69 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 21.01/5.69
% 21.01/5.69 % ------ Preprocessing... sup_sim: 95 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 21.01/5.69
% 21.01/5.69 % ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e %
% 21.01/5.69
% 21.01/5.69 % ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 21.01/5.69 % ------ Proving...
% 21.01/5.69 % ------ Problem Properties
% 21.01/5.69
% 21.01/5.69 %
% 21.01/5.69 % clauses 903
% 21.01/5.69 % conjectures 3
% 21.01/5.69 % EPR 138
% 21.01/5.69 % Horn 684
% 21.01/5.69 % unary 124
% 21.01/5.69 % binary 277
% 21.01/5.69 % lits 2634
% 21.01/5.69 % lits eq 396
% 21.01/5.69 % fd_pure 0
% 21.01/5.69 % fd_pseudo 0
% 21.01/5.69 % fd_cond 30
% 21.01/5.69 % fd_pseudo_cond 105
% 21.01/5.69 % AC symbols 0
% 21.01/5.69
% 21.01/5.69 % ------ Schedule dynamic 5 is on
% 21.01/5.69
% 21.01/5.69 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 21.01/5.69
% 21.01/5.69
% 21.01/5.69 % ------
% 21.01/5.69 % Current options:
% 21.01/5.69 % ------
% 21.01/5.69
% 21.01/5.69
% 21.01/5.69 %
% 21.01/5.69
% 21.01/5.69 % ------ Proving...
% 21.01/5.69 %
% 21.01/5.69
% 21.01/5.69 % SZS status Theorem for theBenchmark.p
% 21.01/5.69
% 21.01/5.69 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 21.01/5.69
% 21.01/5.69
%------------------------------------------------------------------------------