%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU155+1 : 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 : n009.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:38 PM UTC 2026
% Result : Theorem 0.27s 1.05s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 7 unt; 1 def)
% Number of atoms : 116 ( 9 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 131 ( 50 ~; 50 |; 24 &)
% ( 4 <=>; 3 =>; 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 61 !; 11 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(f3,axiom,
! [X0,X1] :
( X1 = union(X0)
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(f5,conjecture,
! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f11,plain,
? [X0,X1] :
( in(X0,X1)
& ~ subset(X0,union(X1)) ),
inference(ennf_transformation,[],[f6]) ).
fof(f12,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,[],[f10]) ).
fof(f13,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,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ in(X3,X0)
| in(X3,X1) ) )
& ( ( in(sK0(X0,X1),X0)
& ~ in(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| ? [X3] :
( in(X3,X0)
& in(X2,X3) ) )
& ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X3] :
( in(X3,X0)
& in(X2,X3) ) )
& ( ~ in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) ) )
| X1 = union(X0) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f16,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| ? [X7] :
( in(X7,X0)
& in(X5,X7) ) )
& ( ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) )
| in(X5,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| ? [X4] :
( in(X4,X0)
& in(X2,X4) ) )
& ( ~ in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) ) )
| X1 = union(X0) ) ),
inference(rectify,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( union(X0) != X1
| ! [X5] :
( ( ~ in(X5,X1)
| ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) ) )
& ( ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) )
| in(X5,X1) ) ) )
& ( ( ( in(sK1(X0,X1),X1)
| ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) ) )
& ( ~ in(sK1(X0,X1),X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) ) ) )
| X1 = union(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X4,sK2(X0,X1)),skolemize(X7,sK3(X0,X5))],[f16]) ).
fof(f18,plain,
( in(sK4,sK5)
& ~ subset(sK4,union(sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5]),skolemize(X0,sK4),skolemize(X1,sK5)],[f11]) ).
fof(f21,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f25,plain,
! [X0,X1,X6,X5] :
( union(X0) != X1
| ~ in(X6,X0)
| ~ in(X5,X6)
| in(X5,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f29,plain,
in(sK4,sK5),
inference(cnf_transformation,[],[f18]) ).
fof(f30,plain,
~ subset(sK4,union(sK5)),
inference(cnf_transformation,[],[f18]) ).
fof(f32,plain,
! [X0,X6,X5] :
( ~ in(X6,X0)
| ~ in(X5,X6)
| in(X5,union(X0)) ),
inference(equality_resolution,[],[f25]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ in(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X0,union(X2))
| ~ in(X1,X2)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_59,negated_conjecture,
~ subset(sK4,union(sK5)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_60,negated_conjecture,
in(sK4,sK5),
inference(cnf_transformation,[],[f29]) ).
tcf(c_230,definition,
iPr_def_10 = union(sK5),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_232,negated_conjecture,
~ subset(sK4,iPr_def_10),
inference(demodulation,[status(thm)],[c_59,c_230]) ).
tcf(c_484,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,X2)
| in(sK0(X0,X2),union(X1))
| ~ in(X0,X1) ),
inference(superposition,[status(thm)],[c_51,c_56]) ).
tcf(c_923,plain,
! [X0: $i,X1: $i] :
( subset(X0,union(X1))
| ~ in(X0,X1) ),
inference(superposition,[status(thm)],[c_484,c_50]) ).
tcf(c_976,plain,
! [X0: $i] :
( subset(X0,iPr_def_10)
| ~ in(X0,sK5) ),
inference(superposition,[status(thm)],[c_230,c_923]) ).
tcf(c_985,plain,
( subset(sK4,iPr_def_10)
| ~ in(sK4,sK5) ),
inference(instantiation,[status(thm)],[c_976]) ).
tcf(c_986,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_985,c_232,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU155+1 : 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/0.34 % Computer : n009.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Thu Sep 24 12:58:28 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 Running first-order theorem proving
% 0.11/0.38 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.11/0.40
% 0.11/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.40
% 0.11/0.40 % Detected problem language: tptp
% 0.11/0.41 % Proving...
% 0.27/1.05 % SZS status Started for theBenchmark.p
% 0.27/1.05 % SZS status Theorem for theBenchmark.p
% 0.27/1.05
% 0.27/1.05 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.27/1.05
% 0.27/1.05 % ------ iProver source info
% 0.27/1.05
% 0.27/1.05 % git: date: 2026-07-19 20:42:38 +0200
% 0.27/1.05 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.27/1.05 % git: non_committed_changes: false
% 0.27/1.05
% 0.27/1.05 % ------ Parsing...
% 0.27/1.05 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.27/1.05
% 0.27/1.05 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.27/1.05
% 0.27/1.05 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.27/1.05
% 0.27/1.05 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.27/1.05 % ------ Proving...
% 0.27/1.05 % ------ Problem Properties
% 0.27/1.05
% 0.27/1.05 %
% 0.27/1.05 % clauses 14
% 0.27/1.05 % conjectures 2
% 0.27/1.05 % EPR 5
% 0.27/1.05 % Horn 11
% 0.27/1.05 % unary 4
% 0.27/1.05 % binary 5
% 0.27/1.05 % lits 30
% 0.27/1.05 % lits eq 4
% 0.27/1.05 % fd_pure 0
% 0.27/1.05 % fd_pseudo 0
% 0.27/1.05 % fd_cond 0
% 0.27/1.05 % fd_pseudo_cond 3
% 0.27/1.05 % AC symbols 0
% 0.27/1.05
% 0.27/1.05 % ------ Schedule dynamic 5 is on
% 0.27/1.05
% 0.27/1.05 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.27/1.05
% 0.27/1.05
% 0.27/1.05 % ------
% 0.27/1.05 % Current options:
% 0.27/1.05 % ------
% 0.27/1.05
% 0.27/1.05
% 0.27/1.05 %
% 0.27/1.05
% 0.27/1.05 % ------ Proving...
% 0.27/1.05 %
% 0.27/1.05
% 0.27/1.05 % SZS status Theorem for theBenchmark.p
% 0.27/1.05
% 0.27/1.05 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.27/1.06
% 0.27/1.06
%------------------------------------------------------------------------------