%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU122+2 : 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 : n012.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.79s 1.07s
% Output : CNFRefutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 55 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 59 ( 27 ~; 19 |; 9 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 34 !; 5 ?; 4 :)
% 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] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(f16,conjecture,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f17,negated_conjecture,
~ ! [X0] : subset(empty_set,X0),
inference(negated_conjecture,[status(cth)],[f16]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f32,plain,
? [X0] : ~ subset(empty_set,X0),
inference(ennf_transformation,[],[f17]) ).
fof(f38,plain,
! [X0] :
( ( empty_set != X0
| ! [X1] : ~ in(X1,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f39,plain,
! [X0] :
( ( empty_set != X0
| ! [X2] : ~ in(X2,X0) )
& ( ? [X1] : in(X1,X0)
| X0 = empty_set ) ),
inference(rectify,[],[f38]) ).
fof(f40,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))],[f39]) ).
fof(f41,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,[],[f28]) ).
fof(f42,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,[],[f41]) ).
fof(f43,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK1(X0,X1),X0)
& ~ in(sK1(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X2,sK1(X0,X1))],[f42]) ).
fof(f51,plain,
~ subset(empty_set,sK5),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f32]) ).
fof(f56,plain,
! [X2,X0] :
( empty_set != X0
| ~ in(X2,X0) ),
inference(cnf_transformation,[],[f40]) ).
fof(f59,plain,
! [X0,X1] :
( in(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f76,plain,
~ subset(empty_set,sK5),
inference(cnf_transformation,[],[f51]) ).
fof(f85,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f56]) ).
tcf(c_52,plain,
! [X0: $i] : ~ in(X0,empty_set),
inference(cnf_transformation,[],[f85]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f59]) ).
tcf(c_71,negated_conjecture,
~ subset(empty_set,sK5),
inference(cnf_transformation,[],[f76]) ).
tcf(c_433,negated_conjecture,
~ subset(empty_set,sK5),
inference(demodulation,[status(thm)],[c_71]) ).
tcf(c_1011,plain,
! [X0: $i] : subset(empty_set,X0),
inference(superposition,[status(thm)],[c_54,c_52]) ).
tcf(c_1016,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_433,c_1011]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU122+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Thu Sep 24 12:48:36 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.34
% 0.07/0.34 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.34
% 0.07/0.34 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 1.79/1.07 % SZS status Started for theBenchmark.p
% 1.79/1.07 % SZS status Theorem for theBenchmark.p
% 1.79/1.07
% 1.79/1.07 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.79/1.07
% 1.79/1.07 % ------ iProver source info
% 1.79/1.07
% 1.79/1.07 % git: date: 2026-07-19 20:42:38 +0200
% 1.79/1.07 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.79/1.07 % git: non_committed_changes: false
% 1.79/1.07
% 1.79/1.07 % ------ Parsing...
% 1.79/1.07 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.79/1.07
% 1.79/1.07 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.79/1.07
% 1.79/1.07 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.79/1.07
% 1.79/1.07 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.79/1.07 % ------ Proving...
% 1.79/1.07 % ------ Problem Properties
% 1.79/1.07
% 1.79/1.07 %
% 1.79/1.07 % clauses 31
% 1.79/1.07 % conjectures 1
% 1.79/1.07 % EPR 14
% 1.79/1.07 % Horn 24
% 1.79/1.07 % unary 8
% 1.79/1.07 % binary 15
% 1.79/1.07 % lits 63
% 1.79/1.07 % lits eq 10
% 1.79/1.07 % fd_pure 0
% 1.79/1.07 % fd_pseudo 0
% 1.79/1.07 % fd_cond 2
% 1.79/1.07 % fd_pseudo_cond 4
% 1.79/1.07 % AC symbols 0
% 1.79/1.07
% 1.79/1.07 % ------ Schedule dynamic 5 is on
% 1.79/1.07
% 1.79/1.07 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.79/1.07
% 1.79/1.07
% 1.79/1.07 % ------
% 1.79/1.07 % Current options:
% 1.79/1.07 % ------
% 1.79/1.07
% 1.79/1.07
% 1.79/1.07 %
% 1.79/1.07
% 1.79/1.07 % ------ Proving...
% 1.79/1.07 %
% 1.79/1.07
% 1.79/1.07 % SZS status Theorem for theBenchmark.p
% 1.79/1.07
% 1.79/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.79/1.07
% 1.79/1.07
%------------------------------------------------------------------------------