%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU150+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.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 1.53s 6.20s
% Output : CNFRefutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 14 unt; 2 def)
% Number of atoms : 47 ( 37 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 12 ~; 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 : 32 ( 0 sgn 29 !; 3 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [X0,X1,X2] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(ennf_transformation,[],[f4]) ).
fof(f8,plain,
? [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
& X1 != X2 ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
( singleton(sK2) = unordered_pair(sK3,sK4)
& sK3 != sK4 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f8]) ).
fof(f12,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f15,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
singleton(sK2) = unordered_pair(sK3,sK4),
inference(cnf_transformation,[],[f11]) ).
fof(f17,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f11]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( unordered_pair(X0,X1) != singleton(X2) ) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_53,negated_conjecture,
sK3 != sK4,
inference(cnf_transformation,[],[f17]) ).
tcf(c_54,negated_conjecture,
unordered_pair(sK3,sK4) = singleton(sK2),
inference(cnf_transformation,[],[f16]) ).
tcf(c_102,definition,
iPr_def_10 = unordered_pair(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_103,definition,
iPr_def_11 = singleton(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_104,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_54,c_103,c_102]) ).
tcf(c_146,plain,
singleton(sK2) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_103,c_104]) ).
tcf(c_149,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( unordered_pair(X0,X1) != singleton(X2) ) ),
inference(superposition,[status(thm)],[c_49,c_52]) ).
tcf(c_151,plain,
! [X0: $i] :
( ( X0 = sK3 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_102,c_52]) ).
tcf(c_160,plain,
sK3 = sK2,
inference(superposition,[status(thm)],[c_146,c_151]) ).
tcf(c_161,plain,
singleton(sK3) = iPr_def_10,
inference(demodulation,[status(thm)],[c_146,c_160]) ).
tcf(c_168,plain,
! [X0: $i] :
( ( X0 = sK4 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_102,c_149]) ).
tcf(c_171,plain,
( ( sK3 = sK4 )
| ( singleton(sK3) != iPr_def_10 ) ),
inference(instantiation,[status(thm)],[c_168]) ).
tcf(c_172,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_171,c_161,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU150+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/5.39 % Computer : n015.cluster.edu
% 0.12/5.39 % Model : x86_64 x86_64
% 0.12/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.39 % Memory : 8046.5625MB
% 0.12/5.39 % OS : Linux 6.8.0-71-generic
% 0.12/5.39 % CPULimit : 300
% 0.12/5.39 % WCLimit : 300
% 0.12/5.39 % DateTime : Thu Sep 24 13:01:03 UTC 2026
% 0.12/5.39 % CPUTime :
% 0.12/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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.15/5.44
% 0.15/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.44
% 0.15/5.44 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 1.53/6.20 % SZS status Started for theBenchmark.p
% 1.53/6.20 % SZS status Theorem for theBenchmark.p
% 1.53/6.20
% 1.53/6.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.53/6.20
% 1.53/6.20 % ------ iProver source info
% 1.53/6.20
% 1.53/6.20 % git: date: 2026-07-19 20:42:38 +0200
% 1.53/6.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.53/6.20 % git: non_committed_changes: false
% 1.53/6.20
% 1.53/6.20 % ------ Parsing...
% 1.53/6.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.53/6.20
% 1.53/6.20 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.53/6.20 % ------ Proving...
% 1.53/6.20 % ------ Problem Properties
% 1.53/6.20
% 1.53/6.20 %
% 1.53/6.20 % clauses 7
% 1.53/6.20 % conjectures 2
% 1.53/6.20 % EPR 3
% 1.53/6.20 % Horn 7
% 1.53/6.20 % unary 6
% 1.53/6.20 % binary 1
% 1.53/6.20 % lits 8
% 1.53/6.20 % lits eq 8
% 1.53/6.20 % fd_pure 0
% 1.53/6.20 % fd_pseudo 0
% 1.53/6.20 % fd_cond 0
% 1.53/6.20 % fd_pseudo_cond 1
% 1.53/6.20 % AC symbols 0
% 1.53/6.20
% 1.53/6.20 % ------ Schedule dynamic 5 is on
% 1.53/6.20
% 1.53/6.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.53/6.20
% 1.53/6.20
% 1.53/6.20 % ------
% 1.53/6.20 % Current options:
% 1.53/6.20 % ------
% 1.53/6.20
% 1.53/6.20
% 1.53/6.20 %
% 1.53/6.20
% 1.53/6.20 % ------ Proving...
% 1.53/6.20 %
% 1.53/6.20
% 1.53/6.20 % SZS status Theorem for theBenchmark.p
% 1.53/6.20
% 1.53/6.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.53/6.20
% 1.53/6.20
%------------------------------------------------------------------------------