%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU154+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 : n003.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 7.17s 1.64s
% Output : CNFRefutation 7.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 12 unt; 1 def)
% Number of atoms : 108 ( 32 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 116 ( 50 ~; 37 |; 25 &)
% ( 2 <=>; 2 =>; 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; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 50 !; 7 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0,X1] :
( X1 = singleton(X0)
<=> ! [X2] :
( in(X2,X1)
<=> X2 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f33,conjecture,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f34,negated_conjecture,
~ ! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[status(cth)],[f33]) ).
fof(f60,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] :
( in(X2,X1)
& in(X2,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(f69,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f83,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X3] :
( in(X3,X1)
& in(X3,X0) ) )
& ~ ( ! [X2] :
~ ( in(X2,X1)
& in(X2,X0) )
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f60]) ).
fof(f95,plain,
? [X0,X1] :
( ~ in(X0,X1)
& ~ disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f109,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) ) )
& ( ? [X2] :
( in(X2,X1)
& in(X2,X0) )
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f126,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X2] :
( ( ~ in(X2,X1)
| X2 = X0 )
& ( X0 != X2
| in(X2,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f127,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ? [X2] :
( ( in(X2,X1)
| X2 = X0 )
& ( ~ in(X2,X1)
| X0 != X2 ) )
| X1 = singleton(X0) ) ),
inference(rectify,[],[f126]) ).
fof(f128,plain,
! [X0,X1] :
( ( singleton(X0) != X1
| ! [X3] :
( ( ~ in(X3,X1)
| X0 = X3 )
& ( X0 != X3
| in(X3,X1) ) ) )
& ( ( ( in(sK0(X0,X1),X1)
| sK0(X0,X1) = X0 )
& ( ~ in(sK0(X0,X1),X1)
| sK0(X0,X1) != X0 ) )
| X1 = singleton(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f127]) ).
fof(f155,plain,
( ~ in(sK8,sK9)
& ~ disjoint(singleton(sK8),sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f95]) ).
fof(f165,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X3] :
( ~ in(X3,X1)
| ~ in(X3,X0) ) )
& ( ( in(sK13(X0,X1),X1)
& in(sK13(X0,X1),X0) )
| disjoint(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13]),skolemize(X2,sK13(X0,X1))],[f109]) ).
fof(f176,plain,
! [X3,X0,X1] :
( singleton(X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(cnf_transformation,[],[f128]) ).
fof(f225,plain,
~ in(sK8,sK9),
inference(cnf_transformation,[],[f155]) ).
fof(f226,plain,
~ disjoint(singleton(sK8),sK9),
inference(cnf_transformation,[],[f155]) ).
fof(f259,plain,
! [X0,X1] :
( in(sK13(X0,X1),X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f260,plain,
! [X0,X1] :
( in(sK13(X0,X1),X0)
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f270,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f69]) ).
fof(f285,plain,
! [X3,X0,X1] :
( unordered_pair(X0,X0) != X1
| ~ in(X3,X1)
| X0 = X3 ),
inference(definition_unfolding,[],[f176,f270]) ).
fof(f298,plain,
~ disjoint(unordered_pair(sK8,sK8),sK9),
inference(definition_unfolding,[],[f226,f270]) ).
fof(f320,plain,
! [X3,X0] :
( ~ in(X3,unordered_pair(X0,X0))
| X0 = X3 ),
inference(equality_resolution,[],[f285]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X1)) ),
inference(cnf_transformation,[],[f320]) ).
tcf(c_106,negated_conjecture,
~ disjoint(unordered_pair(sK8,sK8),sK9),
inference(cnf_transformation,[],[f298]) ).
tcf(c_107,negated_conjecture,
~ in(sK8,sK9),
inference(cnf_transformation,[],[f225]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK13(X0,X1),X0) ),
inference(cnf_transformation,[],[f260]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] :
( disjoint(X0,X1)
| in(sK13(X0,X1),X1) ),
inference(cnf_transformation,[],[f259]) ).
tcf(c_2443,definition,
iPr_def_10 = unordered_pair(sK8,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2444,negated_conjecture,
~ in(sK8,sK9),
inference(demodulation,[status(thm)],[c_107]) ).
tcf(c_2445,negated_conjecture,
~ disjoint(iPr_def_10,sK9),
inference(demodulation,[status(thm)],[c_106,c_2443]) ).
tcf(c_4520,plain,
! [X0: $i] :
( ( X0 = sK8 )
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_2443,c_60]) ).
tcf(c_5046,plain,
! [X0: $i] :
( disjoint(iPr_def_10,X0)
| ( sK13(iPr_def_10,X0) = sK8 ) ),
inference(superposition,[status(thm)],[c_139,c_4520]) ).
tcf(c_9737,plain,
sK13(iPr_def_10,sK9) = sK8,
inference(superposition,[status(thm)],[c_5046,c_2445]) ).
tcf(c_9777,plain,
( disjoint(iPr_def_10,sK9)
| in(sK8,sK9) ),
inference(superposition,[status(thm)],[c_9737,c_140]) ).
tcf(c_9779,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_9777,c_2445,c_2444]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.34 % Computer : n003.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.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 13:00:06 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.12/0.39
% 0.12/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.39
% 0.12/0.39 % Detected problem language: tptp
% 0.12/0.40 % Proving...
% 7.17/1.64 % SZS status Started for theBenchmark.p
% 7.17/1.64 % SZS status Theorem for theBenchmark.p
% 7.17/1.64
% 7.17/1.64 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.17/1.64
% 7.17/1.64 % ------ iProver source info
% 7.17/1.64
% 7.17/1.64 % git: date: 2026-07-19 20:42:38 +0200
% 7.17/1.64 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.17/1.64 % git: non_committed_changes: false
% 7.17/1.64
% 7.17/1.64 % ------ Parsing...
% 7.17/1.64 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.17/1.64
% 7.17/1.64 % ------ Preprocessing... sup_sim: 3 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 %
% 7.17/1.64
% 7.17/1.64 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.17/1.64
% 7.17/1.64 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.17/1.64 % ------ Proving...
% 7.17/1.64 % ------ Problem Properties
% 7.17/1.64
% 7.17/1.64 %
% 7.17/1.64 % clauses 101
% 7.17/1.64 % conjectures 2
% 7.17/1.64 % EPR 23
% 7.17/1.64 % Horn 79
% 7.17/1.64 % unary 26
% 7.17/1.64 % binary 41
% 7.17/1.64 % lits 214
% 7.17/1.64 % lits eq 65
% 7.17/1.64 % fd_pure 0
% 7.17/1.64 % fd_pseudo 0
% 7.17/1.64 % fd_cond 3
% 7.17/1.64 % fd_pseudo_cond 26
% 7.17/1.64 % AC symbols 0
% 7.17/1.64
% 7.17/1.64 % ------ Schedule dynamic 5 is on
% 7.17/1.64
% 7.17/1.64 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.17/1.64
% 7.17/1.64
% 7.17/1.64 % ------
% 7.17/1.64 % Current options:
% 7.17/1.64 % ------
% 7.17/1.64
% 7.17/1.64
% 7.17/1.64 %
% 7.17/1.64
% 7.17/1.64 % ------ Proving...
% 7.17/1.64 %
% 7.17/1.64
% 7.17/1.64 % SZS status Theorem for theBenchmark.p
% 7.17/1.64
% 7.17/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.17/1.64
% 7.17/1.64
%------------------------------------------------------------------------------