%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU122+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 : n026.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 0.43s 1.30s
% Output : CNFRefutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 51 ( 25 ~; 16 |; 7 &)
% ( 2 <=>; 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn 31 !; 3 ?; 6 :)
% 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(f4,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f8,conjecture,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f9,negated_conjecture,
~ ! [X0] : subset(empty_set,X0),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f11,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ in(X2,X0)
| in(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f16,plain,
? [X0] : ~ subset(empty_set,X0),
inference(ennf_transformation,[],[f9]) ).
fof(f18,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f20,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,[],[f15]) ).
fof(f21,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,[],[f20]) ).
fof(f22,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))],[f21]) ).
fof(f25,plain,
~ subset(empty_set,sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f16]) ).
fof(f28,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f30,plain,
empty(empty_set),
inference(cnf_transformation,[],[f4]) ).
fof(f34,plain,
~ subset(empty_set,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| in(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_53,plain,
empty(empty_set),
inference(cnf_transformation,[],[f30]) ).
tcf(c_57,negated_conjecture,
~ subset(empty_set,sK3),
inference(cnf_transformation,[],[f34]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_191,negated_conjecture,
~ subset(empty_set,sK3),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_364,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ empty(X0) ),
inference(superposition,[status(thm)],[c_51,c_59]) ).
tcf(c_391,plain,
~ empty(empty_set),
inference(superposition,[status(thm)],[c_364,c_191]) ).
tcf(c_392,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_391,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU122+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.12/0.38 % Computer : n026.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 12:51:39 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 0.43/1.30 % SZS status Started for theBenchmark.p
% 0.43/1.30 % SZS status Theorem for theBenchmark.p
% 0.43/1.30
% 0.43/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.43/1.30
% 0.43/1.30 % ------ iProver source info
% 0.43/1.30
% 0.43/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 0.43/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.43/1.30 % git: non_committed_changes: false
% 0.43/1.30
% 0.43/1.30 % ------ Parsing...
% 0.43/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.43/1.30
% 0.43/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 0.43/1.30
% 0.43/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.43/1.30
% 0.43/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.43/1.30 % ------ Proving...
% 0.43/1.30 % ------ Problem Properties
% 0.43/1.30
% 0.43/1.30 %
% 0.43/1.30 % clauses 12
% 0.43/1.30 % conjectures 1
% 0.43/1.30 % EPR 10
% 0.43/1.30 % Horn 11
% 0.43/1.30 % unary 5
% 0.43/1.30 % binary 5
% 0.43/1.30 % lits 21
% 0.43/1.30 % lits eq 2
% 0.43/1.30 % fd_pure 0
% 0.43/1.30 % fd_pseudo 0
% 0.43/1.30 % fd_cond 1
% 0.43/1.30 % fd_pseudo_cond 1
% 0.43/1.30 % AC symbols 0
% 0.43/1.30
% 0.43/1.30 % ------ Schedule dynamic 5 is on
% 0.43/1.30
% 0.43/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.43/1.30
% 0.43/1.30
% 0.43/1.30 % ------
% 0.43/1.30 % Current options:
% 0.43/1.30 % ------
% 0.43/1.30
% 0.43/1.30
% 0.43/1.30 %
% 0.43/1.30
% 0.43/1.30 % ------ Proving...
% 0.43/1.30 %
% 0.43/1.30
% 0.43/1.30 % SZS status Theorem for theBenchmark.p
% 0.43/1.30
% 0.43/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.74/1.30
% 1.74/1.30
%------------------------------------------------------------------------------