%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU150+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 : n006.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:36 PM UTC 2026
% Result : Theorem 3.91s 21.53s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 18 unt; 2 def)
% Number of atoms : 50 ( 41 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 7 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 35 !; 3 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f64,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f72,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f73,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f74,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f73]) ).
fof(f114,plain,
! [X0,X1,X2] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(ennf_transformation,[],[f72]) ).
fof(f115,plain,
? [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
& X1 != X2 ),
inference(ennf_transformation,[],[f74]) ).
fof(f159,plain,
( singleton(sK13) = unordered_pair(sK14,sK15)
& sK14 != sK15 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK13,sK14,sK15]),skolemize(X0,sK13),skolemize(X1,sK14),skolemize(X2,sK15)],[f115]) ).
fof(f162,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f257,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f64]) ).
fof(f266,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f114]) ).
fof(f267,plain,
singleton(sK13) = unordered_pair(sK14,sK15),
inference(cnf_transformation,[],[f159]) ).
fof(f268,plain,
sK14 != sK15,
inference(cnf_transformation,[],[f159]) ).
fof(f299,plain,
! [X2,X0,X1] :
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(definition_unfolding,[],[f266,f257]) ).
fof(f300,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK13,sK13),
inference(definition_unfolding,[],[f267,f257]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f162]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X1 )
| ( unordered_pair(X0,X0) != unordered_pair(X1,X2) ) ),
inference(cnf_transformation,[],[f299]) ).
tcf(c_154,negated_conjecture,
sK14 != sK15,
inference(cnf_transformation,[],[f268]) ).
tcf(c_155,negated_conjecture,
unordered_pair(sK14,sK15) = unordered_pair(sK13,sK13),
inference(cnf_transformation,[],[f300]) ).
tcf(c_2331,definition,
iPr_def_10 = unordered_pair(sK14,sK15),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2332,definition,
iPr_def_11 = unordered_pair(sK13,sK13),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2333,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_155,c_2332,c_2331]) ).
tcf(c_2334,negated_conjecture,
sK14 != sK15,
inference(demodulation,[status(thm)],[c_154]) ).
tcf(c_3881,plain,
unordered_pair(sK13,sK13) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_2332,c_2333]) ).
tcf(c_3945,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK13 )
| ( unordered_pair(X0,X1) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_3881,c_153]) ).
tcf(c_4030,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK13 )
| ( unordered_pair(X0,X1) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_51,c_3945]) ).
tcf(c_4033,plain,
sK14 = sK13,
inference(superposition,[status(thm)],[c_2331,c_3945]) ).
tcf(c_4060,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK14 )
| ( unordered_pair(X0,X1) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_4030,c_4033]) ).
tcf(c_4070,plain,
sK14 = sK15,
inference(superposition,[status(thm)],[c_2331,c_4060]) ).
tcf(c_4072,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4070,c_2334]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU150+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/20.59 % Computer : n006.cluster.edu
% 0.12/20.59 % Model : x86_64 x86_64
% 0.12/20.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/20.59 % Memory : 8046.5625MB
% 0.12/20.59 % OS : Linux 6.8.0-71-generic
% 0.12/20.59 % CPULimit : 300
% 0.12/20.59 % WCLimit : 300
% 0.12/20.59 % DateTime : Thu Sep 24 12:57:47 UTC 2026
% 0.16/20.60 % CPUTime :
% 0.16/20.60 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/20.64 Running first-order theorem proving
% 0.16/20.64 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/20.65
% 0.16/20.65 % ======== iProver multi-core TPTP/SMT =========
% 0.16/20.65
% 0.16/20.66 % Detected problem language: tptp
% 0.16/20.67 % Proving...
% 3.91/21.53 % SZS status Started for theBenchmark.p
% 3.91/21.53 % SZS status Theorem for theBenchmark.p
% 3.91/21.53
% 3.91/21.53 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.91/21.53
% 3.91/21.53 % ------ iProver source info
% 3.91/21.53
% 3.91/21.53 % git: date: 2026-07-19 20:42:38 +0200
% 3.91/21.53 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.91/21.53 % git: non_committed_changes: false
% 3.91/21.53
% 3.91/21.53 % ------ Parsing...
% 3.91/21.53 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.91/21.53
% 3.91/21.53 % ------ 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 %
% 3.91/21.53
% 3.91/21.53 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.91/21.53
% 3.91/21.53 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.91/21.53 % ------ Proving...
% 3.91/21.53 % ------ Problem Properties
% 3.91/21.53
% 3.91/21.53 %
% 3.91/21.53 % clauses 98
% 3.91/21.53 % conjectures 2
% 3.91/21.53 % EPR 23
% 3.91/21.53 % Horn 77
% 3.91/21.53 % unary 27
% 3.91/21.53 % binary 38
% 3.91/21.53 % lits 206
% 3.91/21.53 % lits eq 62
% 3.91/21.53 % fd_pure 0
% 3.91/21.53 % fd_pseudo 0
% 3.91/21.53 % fd_cond 3
% 3.91/21.53 % fd_pseudo_cond 24
% 3.91/21.53 % AC symbols 0
% 3.91/21.53
% 3.91/21.53 % ------ Schedule dynamic 5 is on
% 3.91/21.53
% 3.91/21.53 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.91/21.53
% 3.91/21.53
% 3.91/21.53 % ------
% 3.91/21.53 % Current options:
% 3.91/21.53 % ------
% 3.91/21.53
% 3.91/21.53
% 3.91/21.53 %
% 3.91/21.53
% 3.91/21.53 % ------ Proving...
% 3.91/21.53 %
% 3.91/21.53
% 3.91/21.53 % SZS status Theorem for theBenchmark.p
% 3.91/21.53
% 3.91/21.53 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.91/21.54
% 3.91/21.54
%------------------------------------------------------------------------------