%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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 0.44s 6.29s
% Output : CNFRefutation 0.44s
% 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/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).
fof(f40,conjecture,
! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t13_finset_1) ).
fof(f41,negated_conjecture,
~ ! [X0,X1] :
( ( finite(X1)
& subset(X0,X1) )
=> finite(X0) ),
inference(negated_conjecture,[status(cth)],[f40]) ).
fof(f44,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).
fof(f51,plain,
! [X0,X1] :
( subset(X0,X1)
=> element(X0,powerset(X1)) ),
inference(unused_predicate_definition_removal,[],[f44]) ).
fof(f72,plain,
! [X0] :
( ~ finite(X0)
| ! [X1] :
( ~ element(X1,powerset(X0))
| finite(X1) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f80,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(ennf_transformation,[],[f41]) ).
fof(f81,plain,
? [X0,X1] :
( finite(X1)
& subset(X0,X1)
& ~ finite(X0) ),
inference(flattening,[],[f80]) ).
fof(f85,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(ennf_transformation,[],[f51]) ).
fof(f111,plain,
( finite(sK20)
& subset(sK19,sK20)
& ~ finite(sK19) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19,sK20]),skolemize(X0,sK19),skolemize(X1,sK20)],[f81]) ).
fof(f124,plain,
! [X0,X1] :
( ~ finite(X0)
| ~ element(X1,powerset(X0))
| finite(X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f195,plain,
finite(sK20),
inference(cnf_transformation,[],[f111]) ).
fof(f196,plain,
subset(sK19,sK20),
inference(cnf_transformation,[],[f111]) ).
fof(f197,plain,
~ finite(sK19),
inference(cnf_transformation,[],[f111]) ).
fof(f200,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( finite(X0)
| ~ finite(X1)
| ~ element(X0,powerset(X1)) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_129,negated_conjecture,
~ finite(sK19),
inference(cnf_transformation,[],[f197]) ).
tcf(c_130,negated_conjecture,
subset(sK19,sK20),
inference(cnf_transformation,[],[f196]) ).
tcf(c_131,negated_conjecture,
finite(sK20),
inference(cnf_transformation,[],[f195]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_545,plain,
! [X0: $i,X1: $i] :
( element(X0,powerset(X1))
| ( X1 != sK20 )
| ( X0 != sK19 ) ),
inference(resolution_lifted,[status(thm)],[c_130,c_134]) ).
tcf(c_546,plain,
element(sK19,powerset(sK20)),
inference(unflattening,[status(thm)],[c_545]) ).
tcf(c_741,definition,
iPr_def_10 = powerset(sK20),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_742,plain,
element(sK19,iPr_def_10),
inference(demodulation,[status(thm)],[c_546,c_741]) ).
tcf(c_743,negated_conjecture,
finite(sK20),
inference(demodulation,[status(thm)],[c_131]) ).
tcf(c_744,negated_conjecture,
~ finite(sK19),
inference(demodulation,[status(thm)],[c_129]) ).
tcf(c_1184,plain,
! [X0: $i] :
( finite(X0)
| ~ finite(sK20)
| ~ element(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_741,c_60]) ).
tcf(c_1190,plain,
! [X0: $i] :
( finite(X0)
| ~ element(X0,iPr_def_10) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1184,c_743]) ).
tcf(c_1210,plain,
finite(sK19),
inference(superposition,[status(thm)],[c_742,c_1190]) ).
tcf(c_1215,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1210,c_744]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU294+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/5.38 % Computer : n016.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Thu Sep 24 13:39:18 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 0.44/6.29 % SZS status Started for theBenchmark.p
% 0.44/6.29 % SZS status Theorem for theBenchmark.p
% 0.44/6.29
% 0.44/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/6.29
% 0.44/6.29 % ------ iProver source info
% 0.44/6.29
% 0.44/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/6.29 % git: non_committed_changes: false
% 0.44/6.29
% 0.44/6.29 % ------ Parsing...
% 0.44/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/6.29
% 0.44/6.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 52 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 7 0s sf_e pe_s pe_e %
% 0.44/6.29
% 0.44/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.44/6.29
% 0.44/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.44/6.29 % ------ Proving...
% 0.44/6.29 % ------ Problem Properties
% 0.44/6.29
% 0.44/6.29 %
% 0.44/6.29 % clauses 38
% 0.44/6.29 % conjectures 2
% 0.44/6.29 % EPR 21
% 0.44/6.29 % Horn 34
% 0.44/6.29 % unary 23
% 0.44/6.29 % binary 10
% 0.44/6.29 % lits 58
% 0.44/6.29 % lits eq 3
% 0.44/6.29 % fd_pure 0
% 0.44/6.29 % fd_pseudo 0
% 0.44/6.29 % fd_cond 1
% 0.44/6.29 % fd_pseudo_cond 1
% 0.44/6.29 % AC symbols 0
% 0.44/6.29
% 0.44/6.29 % ------ Schedule dynamic 5 is on
% 0.44/6.29
% 0.44/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/6.29
% 0.44/6.29
% 0.44/6.29 % ------
% 0.44/6.29 % Current options:
% 0.44/6.29 % ------
% 0.44/6.29
% 0.44/6.29
% 0.44/6.29 %
% 0.44/6.29
% 0.44/6.29 % ------ Proving...
% 0.44/6.29 %
% 0.44/6.29
% 0.44/6.29 % SZS status Theorem for theBenchmark.p
% 0.44/6.29
% 0.44/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/6.30
% 0.44/6.30
%------------------------------------------------------------------------------