%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU230+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 : n012.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:15 PM UTC 2026
% Result : Theorem 0.31s 1.10s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 21 unt; 2 def)
% Number of atoms : 138 ( 41 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 150 ( 58 ~; 59 |; 29 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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 : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 66 ( 0 sgn 60 !; 6 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f6,axiom,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_ordinal1) ).
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_union2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_xboole_0) ).
fof(f28,conjecture,
! [X0] : in(X0,succ(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
fof(f29,negated_conjecture,
~ ! [X0] : in(X0,succ(X0)),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f52,plain,
? [X0] : ~ in(X0,succ(X0)),
inference(ennf_transformation,[],[f29]) ).
fof(f59,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| X2 = X0 )
& ( X0 != X2
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f60,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(rectify,[],[f59]) ).
fof(f61,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 )
& ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 ) )
| X1 = singleton(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f60]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(flattening,[],[f62]) ).
fof(f64,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| in(X3,X1)
| in(X3,X0) )
& ( ~ in(X3,X2)
| ( ~ in(X3,X1)
& ~ in(X3,X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(rectify,[],[f63]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| in(X4,X1)
| in(X4,X0) )
& ( ( ~ in(X4,X1)
& ~ in(X4,X0) )
| in(X4,X2) ) ) )
& ( ( ( in(sK1(X0,X1,X2),X2)
| in(sK1(X0,X1,X2),X1)
| in(sK1(X0,X1,X2),X0) )
& ( ~ in(sK1(X0,X1,X2),X2)
| ( ~ in(sK1(X0,X1,X2),X1)
& ~ in(sK1(X0,X1,X2),X0) ) ) )
| X2 = set_union2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f64]) ).
fof(f77,plain,
~ in(sK13,succ(sK13)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X0,sK13)],[f52]) ).
fof(f83,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f84,plain,
! [X0] : succ(X0) = set_union2(X0,singleton(X0)),
inference(cnf_transformation,[],[f6]) ).
fof(f86,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| X0 != X3
| in(X3,X1) ),
inference(cnf_transformation,[],[f61]) ).
fof(f91,plain,
! [X2,X0,X1,X4] :
( set_union2(X0,X1) != X2
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f65]) ).
fof(f124,plain,
~ in(sK13,succ(sK13)),
inference(cnf_transformation,[],[f77]) ).
fof(f132,plain,
~ in(sK13,set_union2(sK13,singleton(sK13))),
inference(definition_unfolding,[],[f124,f84]) ).
fof(f133,plain,
! [X3,X1] :
( singleton(X3) != X1
| in(X3,X1) ),
inference(equality_resolution,[],[f86]) ).
fof(f134,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f133]) ).
fof(f136,plain,
! [X0,X1,X4] :
( ~ in(X4,X0)
| in(X4,set_union2(X0,X1)) ),
inference(equality_resolution,[],[f91]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f83]) ).
tcf(c_55,plain,
! [X0: $i] : in(X0,singleton(X0)),
inference(cnf_transformation,[],[f134]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_union2(X1,X2))
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_92,negated_conjecture,
~ in(sK13,set_union2(sK13,singleton(sK13))),
inference(cnf_transformation,[],[f132]) ).
tcf(c_577,definition,
iPr_def_10 = singleton(sK13),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_578,definition,
iPr_def_11 = set_union2(sK13,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_579,negated_conjecture,
~ in(sK13,iPr_def_11),
inference(demodulation,[status(thm)],[c_92,c_577,c_578]) ).
tcf(c_872,plain,
in(sK13,iPr_def_10),
inference(superposition,[status(thm)],[c_577,c_55]) ).
tcf(c_881,plain,
set_union2(iPr_def_10,sK13) = iPr_def_11,
inference(demodulation,[status(thm)],[c_578,c_52]) ).
tcf(c_957,plain,
! [X0: $i] :
( in(X0,iPr_def_11)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_881,c_60]) ).
tcf(c_1007,plain,
in(sK13,iPr_def_11),
inference(superposition,[status(thm)],[c_872,c_957]) ).
tcf(c_1008,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1007,c_579]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU230+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.30 % Computer : n012.cluster.edu
% 0.02/0.30 % Model : x86_64 x86_64
% 0.02/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.30 % Memory : 8046.5625MB
% 0.02/0.30 % OS : Linux 6.8.0-71-generic
% 0.02/0.30 % CPULimit : 300
% 0.02/0.30 % WCLimit : 300
% 0.02/0.30 % DateTime : Thu Sep 24 13:18:51 UTC 2026
% 0.02/0.31 % CPUTime :
% 0.02/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.34 Running first-order theorem proving
% 0.02/0.34 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.08/0.35
% 0.08/0.35 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.35
% 0.08/0.35 % Detected problem language: tptp
% 0.08/0.36 % Proving...
% 0.31/1.10 % SZS status Started for theBenchmark.p
% 0.31/1.10 % SZS status Theorem for theBenchmark.p
% 0.31/1.10
% 0.31/1.10 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.31/1.10
% 0.31/1.10 % ------ iProver source info
% 0.31/1.10
% 0.31/1.10 % git: date: 2026-07-19 20:42:38 +0200
% 0.31/1.10 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.31/1.10 % git: non_committed_changes: false
% 0.31/1.10
% 0.31/1.10 % ------ Parsing...
% 0.31/1.10 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.31/1.10
% 0.31/1.10 % ------ Preprocessing... sup_sim: 0 sf_s rm: 20 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 0.31/1.10
% 0.31/1.10 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.31/1.10
% 0.31/1.10 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.31/1.10 % ------ Proving...
% 0.31/1.10 % ------ Problem Properties
% 0.31/1.10
% 0.31/1.10 %
% 0.31/1.10 % clauses 30
% 0.31/1.10 % conjectures 1
% 0.31/1.10 % EPR 11
% 0.31/1.10 % Horn 26
% 0.31/1.10 % unary 14
% 0.31/1.10 % binary 9
% 0.31/1.10 % lits 54
% 0.31/1.10 % lits eq 15
% 0.31/1.10 % fd_pure 0
% 0.31/1.10 % fd_pseudo 0
% 0.31/1.10 % fd_cond 1
% 0.31/1.10 % fd_pseudo_cond 6
% 0.31/1.10 % AC symbols 0
% 0.31/1.10
% 0.31/1.10 % ------ Schedule dynamic 5 is on
% 0.31/1.10
% 0.31/1.10 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.31/1.10
% 0.31/1.10
% 0.31/1.10 % ------
% 0.31/1.10 % Current options:
% 0.31/1.10 % ------
% 0.31/1.10
% 0.31/1.10
% 0.31/1.10 %
% 0.31/1.10
% 0.31/1.10 % ------ Proving...
% 0.31/1.10 %
% 0.31/1.10
% 0.31/1.10 % SZS status Theorem for theBenchmark.p
% 0.31/1.10
% 0.31/1.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.31/1.10
% 0.31/1.10
%------------------------------------------------------------------------------