%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU151+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 : n018.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:37 PM UTC 2026
% Result : Theorem 4.02s 6.30s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 16 unt; 2 def)
% Number of atoms : 115 ( 81 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 129 ( 53 ~; 46 |; 28 &)
% ( 2 <=>; 0 =>; 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; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-3 aty)
% Number of variables : 57 ( 0 sgn 50 !; 7 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( X2 = unordered_pair(X0,X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( X3 = X1
| X3 = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f39,conjecture,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f40,negated_conjecture,
~ ! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(negated_conjecture,[status(cth)],[f39]) ).
fof(f93,plain,
? [X0,X1,X2,X3] :
( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f40]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X3] :
( ( ~ in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ( X1 != X3
& X0 != X3 )
| in(X3,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(flattening,[],[f129]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ? [X3] :
( ( in(X3,X2)
| X3 = X1
| X3 = X0 )
& ( ~ in(X3,X2)
| ( X1 != X3
& X0 != X3 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(rectify,[],[f130]) ).
fof(f132,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) != X2
| ! [X4] :
( ( ~ in(X4,X2)
| X1 = X4
| X0 = X4 )
& ( ( X1 != X4
& X0 != X4 )
| in(X4,X2) ) ) )
& ( ( ( in(sK3(X0,X1,X2),X2)
| sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0 )
& ( ~ in(sK3(X0,X1,X2),X2)
| ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 ) ) )
| X2 = unordered_pair(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X3,sK3(X0,X1,X2))],[f131]) ).
fof(f155,plain,
( sK10 != sK13
& sK10 != sK12
& unordered_pair(sK10,sK11) = unordered_pair(sK12,sK13) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11,sK12,sK13]),skolemize(X0,sK10),skolemize(X1,sK11),skolemize(X2,sK12),skolemize(X3,sK13)],[f93]) ).
fof(f180,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| ~ in(X4,X2)
| X1 = X4
| X0 = X4 ),
inference(cnf_transformation,[],[f132]) ).
fof(f182,plain,
! [X2,X0,X1,X4] :
( unordered_pair(X0,X1) != X2
| X0 != X4
| in(X4,X2) ),
inference(cnf_transformation,[],[f132]) ).
fof(f229,plain,
sK10 != sK13,
inference(cnf_transformation,[],[f155]) ).
fof(f230,plain,
sK10 != sK12,
inference(cnf_transformation,[],[f155]) ).
fof(f231,plain,
unordered_pair(sK10,sK11) = unordered_pair(sK12,sK13),
inference(cnf_transformation,[],[f155]) ).
fof(f313,plain,
! [X2,X1,X4] :
( unordered_pair(X4,X1) != X2
| in(X4,X2) ),
inference(equality_resolution,[],[f182]) ).
fof(f314,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f313]) ).
fof(f317,plain,
! [X0,X1,X4] :
( ~ in(X4,unordered_pair(X0,X1))
| X1 = X4
| X0 = X4 ),
inference(equality_resolution,[],[f180]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : in(X0,unordered_pair(X0,X1)),
inference(cnf_transformation,[],[f314]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( X0 = X1 )
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[],[f317]) ).
tcf(c_116,negated_conjecture,
unordered_pair(sK10,sK11) = unordered_pair(sK12,sK13),
inference(cnf_transformation,[],[f231]) ).
tcf(c_117,negated_conjecture,
sK10 != sK12,
inference(cnf_transformation,[],[f230]) ).
tcf(c_118,negated_conjecture,
sK10 != sK13,
inference(cnf_transformation,[],[f229]) ).
tcf(c_2365,definition,
iPr_def_10 = unordered_pair(sK10,sK11),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2366,definition,
iPr_def_11 = unordered_pair(sK12,sK13),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2367,negated_conjecture,
sK10 != sK13,
inference(demodulation,[status(thm)],[c_118]) ).
tcf(c_2368,negated_conjecture,
sK10 != sK12,
inference(demodulation,[status(thm)],[c_117]) ).
tcf(c_2369,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_116,c_2366,c_2365]) ).
tcf(c_3933,plain,
in(sK10,iPr_def_10),
inference(superposition,[status(thm)],[c_2365,c_70]) ).
tcf(c_3940,plain,
unordered_pair(sK12,sK13) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2366,c_2369]) ).
tcf(c_7302,plain,
! [X0: $i] :
( ( X0 = sK13 )
| ( X0 = sK12 )
| ~ in(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_3940,c_72]) ).
tcf(c_7932,plain,
( ( sK10 = sK13 )
| ( sK10 = sK12 ) ),
inference(superposition,[status(thm)],[c_3933,c_7302]) ).
tcf(c_7938,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7932,c_2367,c_2368]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU151+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.11/5.38 % Computer : n018.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 13:00:09 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/5.41 Running first-order theorem proving
% 0.16/5.41 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.16/5.42
% 0.16/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.42
% 0.16/5.42 % Detected problem language: tptp
% 0.16/5.43 % Proving...
% 4.02/6.30 % SZS status Started for theBenchmark.p
% 4.02/6.30 % SZS status Theorem for theBenchmark.p
% 4.02/6.30
% 4.02/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.02/6.30
% 4.02/6.30 % ------ iProver source info
% 4.02/6.30
% 4.02/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.02/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.02/6.30 % git: non_committed_changes: false
% 4.02/6.30
% 4.02/6.30 % ------ Parsing...
% 4.02/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.02/6.30
% 4.02/6.30 % ------ 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 %
% 4.02/6.30
% 4.02/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.02/6.30
% 4.02/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.02/6.30 % ------ Proving...
% 4.02/6.30 % ------ Problem Properties
% 4.02/6.30
% 4.02/6.30 %
% 4.02/6.30 % clauses 100
% 4.02/6.30 % conjectures 3
% 4.02/6.30 % EPR 24
% 4.02/6.30 % Horn 79
% 4.02/6.30 % unary 28
% 4.02/6.30 % binary 39
% 4.02/6.30 % lits 209
% 4.02/6.30 % lits eq 65
% 4.02/6.30 % fd_pure 0
% 4.02/6.30 % fd_pseudo 0
% 4.02/6.30 % fd_cond 3
% 4.02/6.30 % fd_pseudo_cond 25
% 4.02/6.30 % AC symbols 0
% 4.02/6.30
% 4.02/6.30 % ------ Schedule dynamic 5 is on
% 4.02/6.30
% 4.02/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.02/6.30
% 4.02/6.30
% 4.02/6.30 % ------
% 4.02/6.30 % Current options:
% 4.02/6.30 % ------
% 4.02/6.30
% 4.02/6.30
% 4.02/6.30 %
% 4.02/6.30
% 4.02/6.30 % ------ Proving...
% 4.02/6.30 %
% 4.02/6.30
% 4.02/6.30 % SZS status Theorem for theBenchmark.p
% 4.02/6.30
% 4.02/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/6.30
% 4.02/6.30
%------------------------------------------------------------------------------