%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.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:55:26 PM UTC 2026
% Result : Theorem 2.55s 1.27s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 24 unt; 5 def)
% Number of atoms : 91 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 45 ( 24 ~; 18 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 44 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f30,axiom,
! [X0,X1] :
( subset(X0,X1)
=> subset(finite_subsets(X0),finite_subsets(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_finsub_1) ).
fof(f31,conjecture,
! [X0,X1] : subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_finsub_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] : subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f39,axiom,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(f41,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(set_union2(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_xboole_1) ).
fof(f67,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(ennf_transformation,[],[f30]) ).
fof(f68,plain,
? [X0,X1] : ~ subset(set_union2(finite_subsets(X0),finite_subsets(X1)),finite_subsets(set_union2(X0,X1))),
inference(ennf_transformation,[],[f32]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(ennf_transformation,[],[f41]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(flattening,[],[f77]) ).
fof(f89,plain,
~ subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X0,sK10),skolemize(X1,sK11)],[f68]) ).
fof(f98,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f7]) ).
fof(f139,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| subset(finite_subsets(X0),finite_subsets(X1)) ),
inference(cnf_transformation,[],[f67]) ).
fof(f140,plain,
~ subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))),
inference(cnf_transformation,[],[f89]) ).
fof(f148,plain,
! [X0,X1] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f39]) ).
fof(f150,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(set_union2(X0,X2),X1) ),
inference(cnf_transformation,[],[f78]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f98]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i] :
( subset(finite_subsets(X0),finite_subsets(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_98,negated_conjecture,
~ subset(set_union2(finite_subsets(sK10),finite_subsets(sK11)),finite_subsets(set_union2(sK10,sK11))),
inference(cnf_transformation,[],[f140]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] : subset(X0,set_union2(X0,X1)),
inference(cnf_transformation,[],[f148]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_union2(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_1373,definition,
iPr_def_10 = finite_subsets(sK10),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1374,definition,
iPr_def_11 = finite_subsets(sK11),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1375,definition,
iPr_def_12 = set_union2(iPr_def_10,iPr_def_11),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1376,definition,
iPr_def_13 = set_union2(sK10,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1377,definition,
iPr_def_14 = finite_subsets(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_1378,negated_conjecture,
~ subset(iPr_def_12,iPr_def_14),
inference(demodulation,[status(thm)],[c_98,c_1376,c_1377,c_1374,c_1373,c_1375]) ).
tcf(c_1991,plain,
! [X0: $i,X1: $i] : subset(X0,set_union2(X1,X0)),
inference(superposition,[status(thm)],[c_56,c_106]) ).
tcf(c_2020,plain,
subset(sK11,iPr_def_13),
inference(superposition,[status(thm)],[c_1376,c_1991]) ).
tcf(c_2021,plain,
subset(sK10,iPr_def_13),
inference(superposition,[status(thm)],[c_1376,c_106]) ).
tcf(c_2142,plain,
! [X0: $i] :
( subset(iPr_def_10,finite_subsets(X0))
| ~ subset(sK10,X0) ),
inference(superposition,[status(thm)],[c_1373,c_97]) ).
tcf(c_2143,plain,
! [X0: $i] :
( subset(iPr_def_11,finite_subsets(X0))
| ~ subset(sK11,X0) ),
inference(superposition,[status(thm)],[c_1374,c_97]) ).
tcf(c_2172,plain,
( subset(iPr_def_10,iPr_def_14)
| ~ subset(sK10,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1377,c_2142]) ).
tcf(c_2173,plain,
subset(iPr_def_10,iPr_def_14),
inference(forward_subsumption_resolution,[status(thm)],[c_2172,c_2021]) ).
tcf(c_2223,plain,
! [X0: $i] :
( subset(iPr_def_12,X0)
| ~ subset(iPr_def_11,X0)
| ~ subset(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_1375,c_108]) ).
tcf(c_2293,plain,
( subset(iPr_def_11,iPr_def_14)
| ~ subset(sK11,iPr_def_13) ),
inference(superposition,[status(thm)],[c_1377,c_2143]) ).
tcf(c_2294,plain,
subset(iPr_def_11,iPr_def_14),
inference(forward_subsumption_resolution,[status(thm)],[c_2293,c_2020]) ).
tcf(c_2507,plain,
( subset(iPr_def_12,iPr_def_14)
| ~ subset(iPr_def_11,iPr_def_14) ),
inference(superposition,[status(thm)],[c_2173,c_2223]) ).
tcf(c_2508,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2507,c_1378,c_2294]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU112+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Thu Sep 24 12:49:19 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.42 % Proving...
% 2.55/1.27 % SZS status Started for theBenchmark.p
% 2.55/1.27 % SZS status Theorem for theBenchmark.p
% 2.55/1.27
% 2.55/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.55/1.27
% 2.55/1.27 % ------ iProver source info
% 2.55/1.27
% 2.55/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.55/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.55/1.27 % git: non_committed_changes: false
% 2.55/1.27
% 2.55/1.27 % ------ Parsing...
% 2.55/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.55/1.27
% 2.55/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 25 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 2.55/1.27
% 2.55/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.55/1.27
% 2.55/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.55/1.27 % ------ Proving...
% 2.55/1.27 % ------ Problem Properties
% 2.55/1.27
% 2.55/1.27 %
% 2.55/1.27 % clauses 43
% 2.55/1.27 % conjectures 1
% 2.55/1.27 % EPR 15
% 2.55/1.27 % Horn 39
% 2.55/1.27 % unary 23
% 2.55/1.27 % binary 15
% 2.55/1.27 % lits 68
% 2.55/1.27 % lits eq 10
% 2.55/1.27 % fd_pure 0
% 2.55/1.27 % fd_pseudo 0
% 2.55/1.27 % fd_cond 1
% 2.55/1.27 % fd_pseudo_cond 1
% 2.55/1.27 % AC symbols 0
% 2.55/1.27
% 2.55/1.27 % ------ Schedule dynamic 5 is on
% 2.55/1.27
% 2.55/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.55/1.27
% 2.55/1.27
% 2.55/1.27 % ------
% 2.55/1.27 % Current options:
% 2.55/1.27 % ------
% 2.55/1.27
% 2.55/1.27
% 2.55/1.27 %
% 2.55/1.27
% 2.55/1.27 % ------ Proving...
% 2.55/1.27 %
% 2.55/1.27
% 2.55/1.27 % SZS status Theorem for theBenchmark.p
% 2.55/1.27
% 2.55/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.55/1.27
% 2.55/1.27
%------------------------------------------------------------------------------