%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET920+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 : n018.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:07 PM UTC 2026
% Result : Theorem 0.45s 1.30s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 17 unt; 2 def)
% Number of atoms : 173 ( 71 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 193 ( 70 ~; 74 |; 43 &)
% ( 4 <=>; 2 =>; 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 83 ( 0 sgn 74 !; 9 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
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,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(f9,conjecture,
! [X0,X1,X2] :
( set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
=> in(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t63_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
=> in(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f13,plain,
? [X0,X1,X2] :
( set_intersection2(unordered_pair(X0,X1),X2) = unordered_pair(X0,X1)
& ~ in(X0,X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,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(f15,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,[],[f14]) ).
fof(f16,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,[],[f15]) ).
fof(f17,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(sK0(X0,X1,X2),X2)
| sK0(X0,X1,X2) = X1
| sK0(X0,X1,X2) = X0 )
& ( ~ in(sK0(X0,X1,X2),X2)
| ( sK0(X0,X1,X2) != X1
& sK0(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1,X2))],[f16]) ).
fof(f18,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,[],[f5]) ).
fof(f19,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,[],[f18]) ).
fof(f20,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,[],[f19]) ).
fof(f21,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(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_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1,X2))],[f20]) ).
fof(f24,plain,
( unordered_pair(sK4,sK5) = set_intersection2(unordered_pair(sK4,sK5),sK6)
& ~ in(sK4,sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6)],[f13]) ).
fof(f27,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f30,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f34,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f43,plain,
unordered_pair(sK4,sK5) = set_intersection2(unordered_pair(sK4,sK5),sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
~ in(sK4,sK6),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f30]) ).
fof(f46,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f45]) ).
fof(f52,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f34]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f27]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f46]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X2)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_67,negated_conjecture,
~ in(sK4,sK6),
inference(cnf_transformation,[],[f44]) ).
tcf(c_68,negated_conjecture,
set_intersection2(unordered_pair(sK4,sK5),sK6) = unordered_pair(sK4,sK5),
inference(cnf_transformation,[],[f43]) ).
tcf(c_170,plain,
set_intersection2(sK6,unordered_pair(sK4,sK5)) = unordered_pair(sK4,sK5),
inference(demodulation,[status(thm)],[c_68,c_51]) ).
tcf(c_383,definition,
iPr_def_10 = unordered_pair(sK4,sK5),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_384,definition,
iPr_def_11 = set_intersection2(sK6,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_385,plain,
iPr_def_11 = iPr_def_10,
inference(demodulation,[status(thm)],[c_170,c_383,c_384]) ).
tcf(c_622,plain,
in(sK4,iPr_def_10),
inference(superposition,[status(thm)],[c_383,c_55]) ).
tcf(c_623,plain,
set_intersection2(sK6,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_384,c_385]) ).
tcf(c_624,plain,
set_intersection2(iPr_def_10,sK6) = iPr_def_10,
inference(demodulation,[status(thm)],[c_623,c_51]) ).
tcf(c_657,plain,
! [X0: $i] :
( in(X0,sK6)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_624,c_63]) ).
tcf(c_660,plain,
( in(sK4,sK6)
| ~ in(sK4,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_657]) ).
tcf(c_661,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_660,c_622,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET920+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 : n018.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:24:33 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.44 % Proving...
% 0.45/1.30 % SZS status Started for theBenchmark.p
% 0.45/1.30 % SZS status Theorem for theBenchmark.p
% 0.45/1.30
% 0.45/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/1.30
% 0.45/1.30 % ------ iProver source info
% 0.45/1.30
% 0.45/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.45/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/1.30 % git: non_committed_changes: false
% 0.45/1.30
% 0.45/1.30 % ------ Parsing...
% 0.45/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.45/1.30
% 0.45/1.30 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 0.45/1.30
% 0.45/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.45/1.30
% 0.45/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.45/1.30 % ------ Proving...
% 0.45/1.30 % ------ Problem Properties
% 0.45/1.30
% 0.45/1.30 %
% 0.45/1.30 % clauses 21
% 0.45/1.30 % conjectures 1
% 0.45/1.30 % EPR 4
% 0.45/1.30 % Horn 17
% 0.45/1.30 % unary 10
% 0.45/1.30 % binary 3
% 0.45/1.30 % lits 42
% 0.45/1.30 % lits eq 19
% 0.45/1.30 % fd_pure 0
% 0.45/1.30 % fd_pseudo 0
% 0.45/1.30 % fd_cond 0
% 0.45/1.30 % fd_pseudo_cond 6
% 0.45/1.30 % AC symbols 0
% 0.45/1.30
% 0.45/1.30 % ------ Schedule dynamic 5 is on
% 0.45/1.30
% 0.45/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.45/1.30
% 0.45/1.30
% 0.45/1.30 % ------
% 0.45/1.30 % Current options:
% 0.45/1.30 % ------
% 0.45/1.30
% 0.45/1.30
% 0.45/1.30 %
% 0.45/1.30
% 0.45/1.30 % ------ Proving...
% 0.45/1.30 %
% 0.45/1.30
% 0.45/1.30 % SZS status Theorem for theBenchmark.p
% 0.45/1.30
% 0.45/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/1.30
% 0.45/1.30
%------------------------------------------------------------------------------