%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU150+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 : n002.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 0.44s 1.29s
% Output : CNFRefutation 0.44s
% 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/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f4,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X1 = X2 ),
file('/export/starexec/sandbox/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(f9,plain,
( singleton(sK0) = unordered_pair(sK1,sK2)
& sK1 != sK2 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f8]) ).
fof(f10,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f11,plain,
! [X2,X0,X1] :
( singleton(X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
singleton(sK0) = unordered_pair(sK1,sK2),
inference(cnf_transformation,[],[f9]) ).
fof(f13,plain,
sK1 != sK2,
inference(cnf_transformation,[],[f9]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = X2 )
| ( unordered_pair(X0,X1) != singleton(X2) ) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,negated_conjecture,
sK1 != sK2,
inference(cnf_transformation,[],[f13]) ).
tcf(c_52,negated_conjecture,
unordered_pair(sK1,sK2) = singleton(sK0),
inference(cnf_transformation,[],[f12]) ).
tcf(c_71,definition,
iPr_def_10 = unordered_pair(sK1,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_72,definition,
iPr_def_11 = singleton(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_73,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_52,c_72,c_71]) ).
tcf(c_113,plain,
singleton(sK0) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_72,c_73]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ( unordered_pair(X0,X1) != singleton(X2) ) ),
inference(superposition,[status(thm)],[c_49,c_50]) ).
tcf(c_118,plain,
! [X0: $i] :
( ( X0 = sK1 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_71,c_50]) ).
tcf(c_127,plain,
sK1 = sK0,
inference(superposition,[status(thm)],[c_113,c_118]) ).
tcf(c_128,plain,
singleton(sK1) = iPr_def_10,
inference(demodulation,[status(thm)],[c_113,c_127]) ).
tcf(c_135,plain,
! [X0: $i] :
( ( X0 = sK2 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_71,c_116]) ).
tcf(c_138,plain,
( ( sK1 = sK2 )
| ( singleton(sK1) != iPr_def_10 ) ),
inference(instantiation,[status(thm)],[c_135]) ).
tcf(c_139,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_138,c_128,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU150+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.11/0.37 % Computer : n002.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 13:00:04 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.44/1.29 % SZS status Started for theBenchmark.p
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.44/1.29
% 0.44/1.29 % ------ iProver source info
% 0.44/1.29
% 0.44/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.44/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.44/1.29 % git: non_committed_changes: false
% 0.44/1.29
% 0.44/1.29 % ------ Parsing...
% 0.44/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.44/1.29
% 0.44/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.44/1.29 % ------ Proving...
% 0.44/1.29 % ------ Problem Properties
% 0.44/1.29
% 0.44/1.29 %
% 0.44/1.29 % clauses 6
% 0.44/1.29 % conjectures 2
% 0.44/1.29 % EPR 2
% 0.44/1.29 % Horn 6
% 0.44/1.29 % unary 5
% 0.44/1.29 % binary 1
% 0.44/1.29 % lits 7
% 0.44/1.29 % lits eq 7
% 0.44/1.29 % fd_pure 0
% 0.44/1.29 % fd_pseudo 0
% 0.44/1.29 % fd_cond 0
% 0.44/1.29 % fd_pseudo_cond 1
% 0.44/1.29 % AC symbols 0
% 0.44/1.29
% 0.44/1.29 % ------ Schedule dynamic 5 is on
% 0.44/1.29
% 0.44/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.44/1.29
% 0.44/1.29
% 0.44/1.29 % ------
% 0.44/1.29 % Current options:
% 0.44/1.29 % ------
% 0.44/1.29
% 0.44/1.29
% 0.44/1.29 %
% 0.44/1.29
% 0.44/1.29 % ------ Proving...
% 0.44/1.29 %
% 0.44/1.29
% 0.44/1.29 % SZS status Theorem for theBenchmark.p
% 0.44/1.29
% 0.44/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.44/1.29
% 0.44/1.29
%------------------------------------------------------------------------------