%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET884+1 : 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 : 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:48:53 PM UTC 2026
% Result : Theorem 0.45s 1.29s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 12 unt; 2 def)
% Number of atoms : 172 ( 93 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 201 ( 79 ~; 77 |; 37 &)
% ( 5 <=>; 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 84 ( 0 sgn 76 !; 8 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f4,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(f5,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f9,conjecture,
! [X0,X1,X2] :
~ ( X0 != X2
& X0 != X1
& subset(singleton(X0),unordered_pair(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( X0 != X2
& X0 != X1
& subset(singleton(X0),unordered_pair(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f5]) ).
fof(f14,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f15,plain,
? [X0,X1,X2] :
( X0 != X2
& X0 != X1
& subset(singleton(X0),unordered_pair(X1,X2)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,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,[],[f3]) ).
fof(f17,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,[],[f16]) ).
fof(f18,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))],[f17]) ).
fof(f19,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,[],[f4]) ).
fof(f20,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,[],[f19]) ).
fof(f21,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,[],[f20]) ).
fof(f22,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(sK1(X0,X1,X2),X2)
| sK1(X0,X1,X2) = X1
| sK1(X0,X1,X2) = X0 )
& ( ~ in(sK1(X0,X1,X2),X2)
| ( sK1(X0,X1,X2) != X1
& sK1(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f21]) ).
fof(f25,plain,
( sK4 != sK6
& sK4 != sK5
& subset(singleton(sK4),unordered_pair(sK5,sK6)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f15]) ).
fof(f29,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| X0 != X3
| in(X3,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| ~ in(X4,X2)
| X1 = X4
| X0 = X4 ),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
sK4 != sK6,
inference(cnf_transformation,[],[f25]) ).
fof(f43,plain,
sK4 != sK5,
inference(cnf_transformation,[],[f25]) ).
fof(f44,plain,
subset(singleton(sK4),unordered_pair(sK5,sK6)),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X3,X1] :
( singleton(X3) != X1
| in(X3,X1) ),
inference(equality_resolution,[],[f29]) ).
fof(f46,plain,
! [X3] : in(X3,singleton(X3)),
inference(equality_resolution,[],[f45]) ).
fof(f52,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f32]) ).
tcf(c_53,plain,
! [X0: $i] : in(X0,singleton(X0)),
inference(cnf_transformation,[],[f46]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ subset(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_65,negated_conjecture,
subset(singleton(sK4),unordered_pair(sK5,sK6)),
inference(cnf_transformation,[],[f44]) ).
tcf(c_66,negated_conjecture,
sK4 != sK5,
inference(cnf_transformation,[],[f43]) ).
tcf(c_67,negated_conjecture,
sK4 != sK6,
inference(cnf_transformation,[],[f42]) ).
tcf(c_216,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X2,X1)
| ~ in(X2,X0)
| ( singleton(sK4) != X0 )
| ( unordered_pair(sK5,sK6) != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_65]) ).
tcf(c_217,plain,
! [X0: $i] :
( in(X0,unordered_pair(sK5,sK6))
| ~ in(X0,singleton(sK4)) ),
inference(unflattening,[status(thm)],[c_216]) ).
tcf(c_345,definition,
iPr_def_10 = singleton(sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_346,definition,
iPr_def_11 = unordered_pair(sK5,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_347,plain,
! [X0: $i] :
( in(X0,iPr_def_11)
| ~ in(X0,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_217,c_346,c_345]) ).
tcf(c_359,plain,
( in(sK4,iPr_def_11)
| ~ in(sK4,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_347]) ).
tcf(c_552,plain,
in(sK4,iPr_def_10),
inference(superposition,[status(thm)],[c_345,c_53]) ).
tcf(c_586,plain,
! [X0: $i] :
( ( X0 = sK6 )
| ( X0 = sK5 )
| ~ in(X0,iPr_def_11) ),
inference(superposition,[status(thm)],[c_346,c_60]) ).
tcf(c_590,plain,
( ( sK4 = sK6 )
| ( sK4 = sK5 )
| ~ in(sK4,iPr_def_11) ),
inference(instantiation,[status(thm)],[c_586]) ).
tcf(c_591,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_590,c_552,c_359,c_66,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET884+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 12:19:28 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.45/1.29 % SZS status Started for theBenchmark.p
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.29
% 0.45/1.29 % ------ iProver source info
% 0.45/1.29
% 0.45/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.29 % git: non_committed_changes: false
% 0.45/1.29
% 0.45/1.29 % ------ Parsing...
% 0.45/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.45/1.29
% 0.45/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 % ------ Problem Properties
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29 % clauses 18
% 0.45/1.29 % conjectures 2
% 0.45/1.29 % EPR 5
% 0.45/1.29 % Horn 15
% 0.45/1.29 % unary 9
% 0.45/1.29 % binary 3
% 0.45/1.29 % lits 34
% 0.45/1.29 % lits eq 20
% 0.45/1.29 % fd_pure 0
% 0.45/1.29 % fd_pseudo 0
% 0.45/1.29 % fd_cond 0
% 0.45/1.29 % fd_pseudo_cond 5
% 0.45/1.29 % AC symbols 0
% 0.45/1.29
% 0.45/1.29 % ------ Schedule dynamic 5 is on
% 0.45/1.29
% 0.45/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 % ------
% 0.45/1.29 % Current options:
% 0.45/1.29 % ------
% 0.45/1.29
% 0.45/1.29
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % ------ Proving...
% 0.45/1.29 %
% 0.45/1.29
% 0.45/1.29 % SZS status Theorem for theBenchmark.p
% 0.45/1.29
% 0.45/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.29
% 0.45/1.29
%------------------------------------------------------------------------------