%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET914+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 : n014.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:49:06 PM UTC 2026
% Result : Theorem 2.66s 1.28s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 45 ( 15 unt; 1 def)
% Number of atoms : 195 ( 71 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 233 ( 89 ~; 89 |; 49 &)
% ( 6 <=>; 0 =>; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 100 ( 0 sgn 89 !; 11 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f5,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(f6,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f7,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f13,conjecture,
! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_zfmisc_1) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f18,plain,
? [X0,X1,X2] :
( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
inference(ennf_transformation,[],[f14]) ).
fof(f19,plain,
! [X0] :
( ( empty_set != X0
| ! [X1] : ~ in(X1,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f20,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(rectify,[],[f19]) ).
fof(f21,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( in(sK0(X0),X0)
| X0 = empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f20]) ).
fof(f22,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,[],[f5]) ).
fof(f23,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,[],[f22]) ).
fof(f24,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,[],[f23]) ).
fof(f25,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))],[f24]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( set_intersection2(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_intersection2(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| ( in(X4,X1)
& in(X4,X0) ) )
& ( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ) ) )
& ( ( ( in(sK2(X0,X1,X2),X2)
| ( in(sK2(X0,X1,X2),X1)
& in(sK2(X0,X1,X2),X0) ) )
& ( ~ in(sK2(X0,X1,X2),X2)
| ~ in(sK2(X0,X1,X2),X1)
| ~ in(sK2(X0,X1,X2),X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1,X2))],[f28]) ).
fof(f30,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set )
& ( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f33,plain,
( in(sK5,sK7)
& disjoint(unordered_pair(sK5,sK6),sK7) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK6,sK7]),skolemize(X0,sK5),skolemize(X1,sK6),skolemize(X2,sK7)],[f18]) ).
fof(f37,plain,
! [X2,X0] :
( empty_set != X0
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f25]) ).
fof(f47,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f30]) ).
fof(f58,plain,
in(sK5,sK7),
inference(cnf_transformation,[],[f33]) ).
fof(f59,plain,
disjoint(unordered_pair(sK5,sK6),sK7),
inference(cnf_transformation,[],[f33]) ).
fof(f60,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f37]) ).
fof(f61,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f41]) ).
fof(f62,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f61]) ).
fof(f66,plain,
! [X0,X1,X4] :
( ~ in(X4,X1)
| ~ in(X4,X0)
| in(X4,set_intersection2(X0,X1)) ),
inference(equality_resolution,[],[f47]) ).
tcf(c_53,plain,
! [X0: $i] : ~ in(X0,empty_set),
inference(cnf_transformation,[],[f60]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f62]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,set_intersection2(X2,X1))
| ~ in(X0,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f66]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = empty_set )
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_73,negated_conjecture,
disjoint(unordered_pair(sK5,sK6),sK7),
inference(cnf_transformation,[],[f59]) ).
tcf(c_74,negated_conjecture,
in(sK5,sK7),
inference(cnf_transformation,[],[f58]) ).
tcf(c_351,definition,
iPr_def_10 = unordered_pair(sK5,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_352,negated_conjecture,
in(sK5,sK7),
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_353,negated_conjecture,
disjoint(iPr_def_10,sK7),
inference(demodulation,[status(thm)],[c_73,c_351]) ).
tcf(c_811,plain,
in(sK5,iPr_def_10),
inference(superposition,[status(thm)],[c_351,c_57]) ).
tcf(c_882,plain,
set_intersection2(iPr_def_10,sK7) = empty_set,
inference(superposition,[status(thm)],[c_353,c_67]) ).
tcf(c_928,plain,
! [X0: $i] :
( in(X0,empty_set)
| ~ in(X0,iPr_def_10)
| ~ in(X0,sK7) ),
inference(superposition,[status(thm)],[c_882,c_63]) ).
tcf(c_931,plain,
! [X0: $i] :
( ~ in(X0,iPr_def_10)
| ~ in(X0,sK7) ),
inference(forward_subsumption_resolution,[status(thm)],[c_928,c_53]) ).
tcf(c_948,plain,
~ in(sK5,sK7),
inference(superposition,[status(thm)],[c_811,c_931]) ).
tcf(c_949,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_948,c_352]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET914+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 : n014.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:21:48 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.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.66/1.28 % SZS status Started for theBenchmark.p
% 2.66/1.28 % SZS status Theorem for theBenchmark.p
% 2.66/1.28
% 2.66/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.66/1.28
% 2.66/1.28 % ------ iProver source info
% 2.66/1.28
% 2.66/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.66/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.66/1.28 % git: non_committed_changes: false
% 2.66/1.28
% 2.66/1.28 % ------ Parsing...
% 2.66/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.66/1.28
% 2.66/1.28 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.66/1.28
% 2.66/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.66/1.28
% 2.66/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.66/1.28 % ------ Proving...
% 2.66/1.28 % ------ Problem Properties
% 2.66/1.28
% 2.66/1.28 %
% 2.66/1.28 % clauses 27
% 2.66/1.28 % conjectures 2
% 2.66/1.28 % EPR 8
% 2.66/1.28 % Horn 22
% 2.66/1.28 % unary 12
% 2.66/1.28 % binary 7
% 2.66/1.28 % lits 52
% 2.66/1.28 % lits eq 19
% 2.66/1.28 % fd_pure 0
% 2.66/1.28 % fd_pseudo 0
% 2.66/1.28 % fd_cond 1
% 2.66/1.28 % fd_pseudo_cond 6
% 2.66/1.28 % AC symbols 0
% 2.66/1.28
% 2.66/1.28 % ------ Schedule dynamic 5 is on
% 2.66/1.28
% 2.66/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.66/1.28
% 2.66/1.28
% 2.66/1.28 % ------
% 2.66/1.28 % Current options:
% 2.66/1.28 % ------
% 2.66/1.28
% 2.66/1.28
% 2.66/1.28 %
% 2.66/1.28
% 2.66/1.28 % ------ Proving...
% 2.66/1.28 %
% 2.66/1.28
% 2.66/1.28 % SZS status Theorem for theBenchmark.p
% 2.66/1.28
% 2.66/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.66/1.28
% 2.66/1.28
%------------------------------------------------------------------------------