%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU120+1 : 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 : n005.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:28 PM UTC 2026
% Result : Theorem 1.80s 1.31s
% Output : CNFRefutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 9 unt; 1 def)
% Number of atoms : 87 ( 22 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 87 ( 43 ~; 25 |; 17 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn 41 !; 8 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( X0 = empty_set
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_intersection2(X0,X1) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(f12,conjecture,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f15,plain,
~ ! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f18,plain,
? [X0,X1] :
( ( disjoint(X0,X1)
& ? [X3] : in(X3,set_intersection2(X0,X1)) )
| ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f19,plain,
! [X0] :
( ( empty_set != X0
| ! [X1] : ~ in(X1,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(nnf_transformation,[],[f3]) ).
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] :
( ( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set )
& ( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f25,plain,
( ( disjoint(sK3,sK4)
& in(sK5,set_intersection2(sK3,sK4)) )
| ( ! [X2] : ~ in(X2,set_intersection2(sK3,sK4))
& ~ disjoint(sK3,sK4) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X3,sK5)],[f18]) ).
fof(f28,plain,
! [X2,X0] :
( empty_set != X0
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f29,plain,
! [X0] :
( in(sK0(X0),X0)
| empty_set = X0 ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| set_intersection2(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f22]) ).
fof(f31,plain,
! [X0,X1] :
( set_intersection2(X0,X1) != empty_set
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f37,plain,
! [X2] :
( disjoint(sK3,sK4)
| ~ in(X2,set_intersection2(sK3,sK4)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
( in(sK5,set_intersection2(sK3,sK4))
| ~ disjoint(sK3,sK4) ),
inference(cnf_transformation,[],[f25]) ).
fof(f41,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f28]) ).
tcf(c_51,plain,
! [X0: $i] :
( in(sK0(X0),X0)
| ( X0 = empty_set ) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_52,plain,
! [X0: $i] : ~ in(X0,empty_set),
inference(cnf_transformation,[],[f41]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| ( set_intersection2(X0,X1) != empty_set ) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = empty_set )
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_60,negated_conjecture,
( in(sK5,set_intersection2(sK3,sK4))
| ~ disjoint(sK3,sK4) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_62,negated_conjecture,
! [X0: $i] :
( disjoint(sK3,sK4)
| ~ in(X0,set_intersection2(sK3,sK4)) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_212,definition,
iPr_def_10 = set_intersection2(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_213,negated_conjecture,
! [X0: $i] :
( disjoint(sK3,sK4)
| ~ in(X0,iPr_def_10) ),
inference(demodulation,[status(thm)],[c_62,c_212]) ).
tcf(c_215,negated_conjecture,
( in(sK5,iPr_def_10)
| ~ disjoint(sK3,sK4) ),
inference(demodulation,[status(thm)],[c_60]) ).
tcf(c_543,plain,
( disjoint(sK3,sK4)
| ( empty_set = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_51,c_213]) ).
tcf(c_588,plain,
( disjoint(sK3,sK4)
| ( empty_set != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_212,c_53]) ).
tcf(c_602,plain,
disjoint(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_588,c_543,c_588]) ).
tcf(c_604,plain,
in(sK5,iPr_def_10),
inference(backward_subsumption_resolution,[status(thm)],[c_215,c_602]) ).
tcf(c_612,plain,
set_intersection2(sK3,sK4) = empty_set,
inference(superposition,[status(thm)],[c_602,c_54]) ).
tcf(c_615,plain,
empty_set = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_612,c_212]) ).
tcf(c_622,plain,
! [X0: $i] : ~ in(X0,iPr_def_10),
inference(demodulation,[status(thm)],[c_52,c_615]) ).
tcf(c_624,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_604,c_622]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU120+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.39 % Computer : n005.cluster.edu
% 0.14/0.39 % Model : x86_64 x86_64
% 0.14/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39 % Memory : 8046.5625MB
% 0.14/0.39 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Thu Sep 24 12:48:02 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/0.44 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.14/0.45
% 0.14/0.45 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.45
% 0.14/0.45 % Detected problem language: tptp
% 0.18/0.46 % Proving...
% 1.80/1.31 % SZS status Started for theBenchmark.p
% 1.80/1.31 % SZS status Theorem for theBenchmark.p
% 1.80/1.31
% 1.80/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.80/1.31
% 1.80/1.31 % ------ iProver source info
% 1.80/1.31
% 1.80/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.80/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.80/1.31 % git: non_committed_changes: false
% 1.80/1.31
% 1.80/1.31 % ------ Parsing...
% 1.80/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.80/1.31
% 1.80/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.80/1.31
% 1.80/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.80/1.31
% 1.80/1.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.80/1.31 % ------ Proving...
% 1.80/1.31 % ------ Problem Properties
% 1.80/1.31
% 1.80/1.31 %
% 1.80/1.31 % clauses 15
% 1.80/1.31 % conjectures 3
% 1.80/1.31 % EPR 9
% 1.80/1.31 % Horn 14
% 1.80/1.31 % unary 7
% 1.80/1.31 % binary 8
% 1.80/1.31 % lits 23
% 1.80/1.31 % lits eq 6
% 1.80/1.31 % fd_pure 0
% 1.80/1.31 % fd_pseudo 0
% 1.80/1.31 % fd_cond 1
% 1.80/1.31 % fd_pseudo_cond 0
% 1.80/1.31 % AC symbols 0
% 1.80/1.31
% 1.80/1.31 % ------ Schedule dynamic 5 is on
% 1.80/1.31
% 1.80/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.80/1.31
% 1.80/1.31
% 1.80/1.31 % ------
% 1.80/1.31 % Current options:
% 1.80/1.31 % ------
% 1.80/1.31
% 1.80/1.31
% 1.80/1.31 %
% 1.80/1.31
% 1.80/1.31 % ------ Proving...
% 1.80/1.31 %
% 1.80/1.31
% 1.80/1.31 % SZS status Theorem for theBenchmark.p
% 1.80/1.31
% 1.80/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.80/1.31
% 1.80/1.31
%------------------------------------------------------------------------------