%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU123+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 : n010.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.64s 1.26s
% Output : CNFRefutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 41 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 38 ( 17 ~; 11 |; 7 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 16 ( 0 sgn 15 !; 1 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(f8,axiom,
! [X0] : subset(empty_set,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(f9,conjecture,
! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(f10,negated_conjecture,
~ ! [X0] :
( subset(X0,empty_set)
=> X0 = empty_set ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f17,plain,
? [X0] :
( subset(X0,empty_set)
& empty_set != X0 ),
inference(ennf_transformation,[],[f10]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f20]) ).
fof(f24,plain,
( subset(sK2,empty_set)
& empty_set != sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2)],[f17]) ).
fof(f27,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f21]) ).
fof(f32,plain,
! [X0] : subset(empty_set,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f33,plain,
subset(sK2,empty_set),
inference(cnf_transformation,[],[f24]) ).
fof(f34,plain,
empty_set != sK2,
inference(cnf_transformation,[],[f24]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_56,plain,
! [X0: $i] : subset(empty_set,X0),
inference(cnf_transformation,[],[f32]) ).
tcf(c_57,negated_conjecture,
empty_set != sK2,
inference(cnf_transformation,[],[f34]) ).
tcf(c_58,negated_conjecture,
subset(sK2,empty_set),
inference(cnf_transformation,[],[f33]) ).
tcf(c_162,negated_conjecture,
subset(sK2,empty_set),
inference(demodulation,[status(thm)],[c_58]) ).
tcf(c_163,negated_conjecture,
empty_set != sK2,
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_297,plain,
( ( empty_set = sK2 )
| ~ subset(empty_set,sK2) ),
inference(superposition,[status(thm)],[c_162,c_49]) ).
tcf(c_298,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_297,c_163,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU123+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.07/0.35 % Computer : n010.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Thu Sep 24 12:48:58 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.41 % Proving...
% 1.64/1.26 % SZS status Started for theBenchmark.p
% 1.64/1.26 % SZS status Theorem for theBenchmark.p
% 1.64/1.26
% 1.64/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.26
% 1.64/1.26 % ------ iProver source info
% 1.64/1.26
% 1.64/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.26 % git: non_committed_changes: false
% 1.64/1.26
% 1.64/1.26 % ------ Parsing...
% 1.64/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.64/1.26
% 1.64/1.26 % ------ 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 %
% 1.64/1.26
% 1.64/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.64/1.26
% 1.64/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.64/1.26 % ------ Proving...
% 1.64/1.26 % ------ Problem Properties
% 1.64/1.26
% 1.64/1.26 %
% 1.64/1.26 % clauses 10
% 1.64/1.26 % conjectures 2
% 1.64/1.26 % EPR 10
% 1.64/1.26 % Horn 10
% 1.64/1.26 % unary 7
% 1.64/1.26 % binary 1
% 1.64/1.26 % lits 15
% 1.64/1.26 % lits eq 4
% 1.64/1.26 % fd_pure 0
% 1.64/1.26 % fd_pseudo 0
% 1.64/1.26 % fd_cond 1
% 1.64/1.26 % fd_pseudo_cond 2
% 1.64/1.26 % AC symbols 0
% 1.64/1.26
% 1.64/1.26 % ------ Schedule dynamic 5 is on
% 1.64/1.26
% 1.64/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.64/1.26
% 1.64/1.26
% 1.64/1.26 % ------
% 1.64/1.26 % Current options:
% 1.64/1.26 % ------
% 1.64/1.26
% 1.64/1.26
% 1.64/1.26 %
% 1.64/1.26
% 1.64/1.26 % ------ Proving...
% 1.64/1.26 %
% 1.64/1.26
% 1.64/1.26 % SZS status Theorem for theBenchmark.p
% 1.64/1.26
% 1.64/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.26
% 1.64/1.26
%------------------------------------------------------------------------------