%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU149+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 : n008.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:36 PM UTC 2026
% Result : Theorem 4.01s 1.32s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 19 unt; 2 def)
% Number of atoms : 190 ( 93 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 208 ( 79 ~; 81 |; 38 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 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; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 106 ( 0 sgn 96 !; 10 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X1
| X3 = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f12,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f31,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f64,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f72,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f73,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
inference(negated_conjecture,[status(cth)],[f72]) ).
fof(f83,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f113,plain,
? [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
& X0 != X1 ),
inference(ennf_transformation,[],[f73]) ).
fof(f116,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(f117,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,[],[f116]) ).
fof(f118,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))],[f117]) ).
fof(f125,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(flattening,[],[f125]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(rectify,[],[f126]) ).
fof(f128,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ( ( in(sK3(X0,X1,X2),X2)
| sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0 )
& ( ~ in(sK3(X0,X1,X2),X2)
| ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f127]) ).
fof(f133,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f83]) ).
fof(f134,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ? [X2] :
( in(X2,X0)
& ~ in(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f133]) ).
fof(f135,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK5(X0,X1),X0)
& ~ in(sK5(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f134]) ).
fof(f145,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f31]) ).
fof(f157,plain,
( singleton(sK13) = unordered_pair(sK14,sK15)
& sK13 != sK14 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X0,sK13),skolemize(X1,sK14),skolemize(X2,sK15)],[f113]) ).
fof(f166,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(cnf_transformation,[],[f118]) ).
fof(f178,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f128]) ).
fof(f188,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f135]) ).
fof(f214,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f145]) ).
fof(f255,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f264,plain,
singleton(sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f157]) ).
fof(f265,plain,
sK13 != sK14,
inference(cnf_transformation,[],[f157]) ).
fof(f270,plain,
! [X3,X0,X1] :
( unordered_pair(X0,X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(definition_unfolding,[],[f166,f255]) ).
fof(f281,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f214,f255]) ).
fof(f296,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK13,sK13),
inference(definition_unfolding,[],[f264,f255]) ).
fof(f301,plain,
! [X3,X0] :
( ~ in(X3,unordered_pair(X0,X0))
| X0 = X3 ),
inference(equality_resolution,[],[f270]) ).
fof(f305,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f178]) ).
fof(f306,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f305]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X1)) ),
inference(cnf_transformation,[],[f301]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f306]) ).
tcf(c_81,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f188]) ).
tcf(c_104,plain,
! [X0: $i,X1: $i] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f281]) ).
tcf(c_153,negated_conjecture,
sK13 != sK14,
inference(cnf_transformation,[],[f265]) ).
tcf(c_154,negated_conjecture,
unordered_pair(sK13,sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f296]) ).
tcf(c_2303,definition,
iPr_def_10 = unordered_pair(sK13,sK13),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2304,definition,
iPr_def_11 = unordered_pair(sK14,sK15),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2305,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_154,c_2304,c_2303]) ).
tcf(c_2306,negated_conjecture,
sK13 != sK14,
inference(demodulation,[status(thm)],[c_153]) ).
tcf(c_3835,plain,
unordered_pair(sK14,sK15) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2304,c_2305]) ).
tcf(c_3837,plain,
in(sK14,iPr_def_10),
inference(superposition,[status(thm)],[c_3835,c_70]) ).
tcf(c_4235,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ in(sK13,X0) ),
inference(superposition,[status(thm)],[c_2303,c_104]) ).
tcf(c_4352,plain,
! [X0: $i] : subset(iPr_def_10,unordered_pair(sK13,X0)),
inference(superposition,[status(thm)],[c_70,c_4235]) ).
tcf(c_4765,plain,
! [X0: $i] :
( in(sK14,X0)
| ~ subset(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_3837,c_81]) ).
tcf(c_4883,plain,
! [X0: $i] : in(sK14,unordered_pair(sK13,X0)),
inference(superposition,[status(thm)],[c_4352,c_4765]) ).
tcf(c_5244,plain,
sK13 = sK14,
inference(superposition,[status(thm)],[c_4883,c_60]) ).
tcf(c_5245,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_5244,c_2306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU149+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.10/0.37 % Computer : n008.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 12:58:09 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.43
% 0.15/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.43
% 0.15/0.43 % Detected problem language: tptp
% 0.15/0.44 % Proving...
% 4.01/1.32 % SZS status Started for theBenchmark.p
% 4.01/1.32 % SZS status Theorem for theBenchmark.p
% 4.01/1.32
% 4.01/1.32 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.01/1.32
% 4.01/1.32 % ------ iProver source info
% 4.01/1.32
% 4.01/1.32 % git: date: 2026-07-19 20:42:38 +0200
% 4.01/1.32 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.01/1.32 % git: non_committed_changes: false
% 4.01/1.32
% 4.01/1.32 % ------ Parsing...
% 4.01/1.32 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.01/1.32
% 4.01/1.32 % ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 4.01/1.32
% 4.01/1.32 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.01/1.32
% 4.01/1.32 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.01/1.32 % ------ Proving...
% 4.01/1.32 % ------ Problem Properties
% 4.01/1.32
% 4.01/1.32 %
% 4.01/1.32 % clauses 97
% 4.01/1.32 % conjectures 2
% 4.01/1.32 % EPR 23
% 4.01/1.32 % Horn 76
% 4.01/1.32 % unary 27
% 4.01/1.32 % binary 37
% 4.01/1.32 % lits 204
% 4.01/1.32 % lits eq 60
% 4.01/1.32 % fd_pure 0
% 4.01/1.32 % fd_pseudo 0
% 4.01/1.32 % fd_cond 3
% 4.01/1.32 % fd_pseudo_cond 23
% 4.01/1.32 % AC symbols 0
% 4.01/1.32
% 4.01/1.32 % ------ Schedule dynamic 5 is on
% 4.01/1.32
% 4.01/1.32 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.01/1.32
% 4.01/1.32
% 4.01/1.32 % ------
% 4.01/1.32 % Current options:
% 4.01/1.32 % ------
% 4.01/1.32
% 4.01/1.32
% 4.01/1.32 %
% 4.01/1.32
% 4.01/1.32 % ------ Proving...
% 4.01/1.32 %
% 4.01/1.32
% 4.01/1.32 % SZS status Theorem for theBenchmark.p
% 4.01/1.32
% 4.01/1.32 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.01/1.32
% 4.01/1.32
%------------------------------------------------------------------------------