%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n004.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:29 PM UTC 2026
% Result : Theorem 0.71s 11.36s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 10 unt; 1 def)
% Number of atoms : 119 ( 11 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 135 ( 51 ~; 52 |; 27 &)
% ( 4 <=>; 1 =>; 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 : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 66 ( 0 sgn 59 !; 7 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f8,axiom,
! [X0,X1,X2] :
( X2 = set_intersection2(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(f23,conjecture,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f24,negated_conjecture,
~ ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(negated_conjecture,[status(cth)],[f23]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f48,plain,
? [X0,X1] : ~ subset(set_intersection2(X0,X1),X0),
inference(ennf_transformation,[],[f24]) ).
fof(f68,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,[],[f43]) ).
fof(f69,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,[],[f68]) ).
fof(f70,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK2(X0,X1),X0)
& ~ in(sK2(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f69]) ).
fof(f71,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,[],[f8]) ).
fof(f72,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,[],[f71]) ).
fof(f73,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,[],[f72]) ).
fof(f74,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(sK3(X0,X1,X2),X2)
| ( in(sK3(X0,X1,X2),X1)
& in(sK3(X0,X1,X2),X0) ) )
& ( ~ in(sK3(X0,X1,X2),X2)
| ~ in(sK3(X0,X1,X2),X1)
| ~ in(sK3(X0,X1,X2),X0) ) )
| X2 = set_intersection2(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f73]) ).
fof(f78,plain,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7]),skolemize(X0,sK6),skolemize(X1,sK7)],[f48]) ).
fof(f96,plain,
! [X0,X1] :
( in(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f97,plain,
! [X0,X1] :
( ~ in(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f99,plain,
! [X2,X0,X1,X4] :
( set_intersection2(X0,X1) != X2
| ~ in(X4,X2)
| in(X4,X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f116,plain,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(cnf_transformation,[],[f78]) ).
fof(f139,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f99]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f97]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f96]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,X1)
| ~ in(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f139]) ).
tcf(c_84,negated_conjecture,
~ subset(set_intersection2(sK6,sK7),sK6),
inference(cnf_transformation,[],[f116]) ).
tcf(c_1173,definition,
iPr_def_10 = set_intersection2(sK6,sK7),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1174,negated_conjecture,
~ subset(iPr_def_10,sK6),
inference(demodulation,[status(thm)],[c_84,c_1173]) ).
tcf(c_2182,plain,
! [X0: $i] :
( in(X0,sK6)
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1173,c_70]) ).
tcf(c_2204,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| in(sK2(iPr_def_10,X0),sK6) ),
inference(superposition,[status(thm)],[c_64,c_2182]) ).
tcf(c_2364,plain,
subset(iPr_def_10,sK6),
inference(superposition,[status(thm)],[c_2204,c_63]) ).
tcf(c_2365,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2364,c_1174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/10.45 % Computer : n004.cluster.edu
% 0.09/10.45 % Model : x86_64 x86_64
% 0.09/10.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.45 % Memory : 8046.5625MB
% 0.09/10.45 % OS : Linux 6.8.0-71-generic
% 0.09/10.45 % CPULimit : 300
% 0.09/10.45 % WCLimit : 300
% 0.09/10.45 % DateTime : Thu Sep 24 12:50:18 UTC 2026
% 0.09/10.45 % CPUTime :
% 0.09/10.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/10.48 Running first-order theorem proving
% 0.09/10.48 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.49
% 0.09/10.49 % ======== iProver multi-core TPTP/SMT =========
% 0.09/10.49
% 0.09/10.49 % Detected problem language: tptp
% 0.14/10.51 % Proving...
% 0.71/11.36 % SZS status Started for theBenchmark.p
% 0.71/11.36 % SZS status Theorem for theBenchmark.p
% 0.71/11.36
% 0.71/11.36 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.71/11.36
% 0.71/11.36 % ------ iProver source info
% 0.71/11.36
% 0.71/11.36 % git: date: 2026-07-19 20:42:38 +0200
% 0.71/11.36 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.71/11.36 % git: non_committed_changes: false
% 0.71/11.36
% 0.71/11.36 % ------ Parsing...
% 0.71/11.36 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.71/11.36
% 0.71/11.36 % ------ Preprocessing... sup_sim: 0 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 %
% 0.71/11.36
% 0.71/11.36 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.71/11.36
% 0.71/11.36 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.71/11.36 % ------ Proving...
% 0.71/11.36 % ------ Problem Properties
% 0.71/11.36
% 0.71/11.36 %
% 0.71/11.36 % clauses 50
% 0.71/11.36 % conjectures 1
% 0.71/11.36 % EPR 17
% 0.71/11.36 % Horn 41
% 0.71/11.36 % unary 15
% 0.71/11.36 % binary 21
% 0.71/11.36 % lits 101
% 0.71/11.36 % lits eq 21
% 0.71/11.36 % fd_pure 0
% 0.71/11.36 % fd_pseudo 0
% 0.71/11.36 % fd_cond 3
% 0.71/11.36 % fd_pseudo_cond 8
% 0.71/11.36 % AC symbols 0
% 0.71/11.36
% 0.71/11.36 % ------ Schedule dynamic 5 is on
% 0.71/11.36
% 0.71/11.36 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.71/11.36
% 0.71/11.36
% 0.71/11.36 % ------
% 0.71/11.36 % Current options:
% 0.71/11.36 % ------
% 0.71/11.36
% 0.71/11.36
% 0.71/11.36 %
% 0.71/11.36
% 0.71/11.36 % ------ Proving...
% 0.71/11.36 %
% 0.71/11.36
% 0.71/11.36 % SZS status Theorem for theBenchmark.p
% 0.71/11.36
% 0.71/11.36 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.71/11.36
% 0.71/11.36
%------------------------------------------------------------------------------