%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU152+2 : 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 : n001.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 3.60s 1.17s
% Output : CNFRefutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 21 unt; 2 def)
% Number of atoms : 63 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 9 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 31 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f31,conjecture,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f31]) ).
fof(f33,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f42,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f67,axiom,
! [X0] : unordered_pair(X0,X0) = singleton(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f91,plain,
? [X0,X1] :
( in(X0,X1)
& set_union2(singleton(X0),X1) != X1 ),
inference(ennf_transformation,[],[f32]) ).
fof(f96,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(ennf_transformation,[],[f42]) ).
fof(f151,plain,
( in(sK8,sK9)
& sK9 != set_union2(singleton(sK8),sK9) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9]),skolemize(X0,sK8),skolemize(X1,sK9)],[f91]) ).
fof(f152,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f167,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f219,plain,
in(sK8,sK9),
inference(cnf_transformation,[],[f151]) ).
fof(f220,plain,
sK9 != set_union2(singleton(sK8),sK9),
inference(cnf_transformation,[],[f151]) ).
fof(f222,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f234,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f96]) ).
fof(f264,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f290,plain,
sK9 != set_union2(unordered_pair(sK8,sK8),sK9),
inference(definition_unfolding,[],[f220,f264]) ).
fof(f291,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(unordered_pair(X0,X0),X1) ),
inference(definition_unfolding,[],[f222,f264]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f167]) ).
tcf(c_104,negated_conjecture,
set_union2(unordered_pair(sK8,sK8),sK9) != sK9,
inference(cnf_transformation,[],[f290]) ).
tcf(c_105,negated_conjecture,
in(sK8,sK9),
inference(cnf_transformation,[],[f219]) ).
tcf(c_106,plain,
! [X0: $i,X1: $i] :
( subset(unordered_pair(X0,X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f291]) ).
tcf(c_119,plain,
! [X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f234]) ).
tcf(c_998,plain,
set_union2(sK9,unordered_pair(sK8,sK8)) != sK9,
inference(demodulation,[status(thm)],[c_104,c_52]) ).
tcf(c_2388,definition,
iPr_def_10 = unordered_pair(sK8,sK8),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_2389,definition,
iPr_def_11 = set_union2(sK9,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_2390,plain,
iPr_def_11 != sK9,
inference(demodulation,[status(thm)],[c_998,c_2388,c_2389]) ).
tcf(c_2391,negated_conjecture,
in(sK8,sK9),
inference(demodulation,[status(thm)],[c_105]) ).
tcf(c_3968,plain,
set_union2(iPr_def_10,sK9) = iPr_def_11,
inference(demodulation,[status(thm)],[c_2389,c_52]) ).
tcf(c_4350,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ in(sK8,X0) ),
inference(superposition,[status(thm)],[c_2388,c_106]) ).
tcf(c_4401,plain,
subset(iPr_def_10,sK9),
inference(superposition,[status(thm)],[c_2391,c_4350]) ).
tcf(c_4553,plain,
set_union2(iPr_def_10,sK9) = sK9,
inference(superposition,[status(thm)],[c_4401,c_119]) ).
tcf(c_4554,plain,
sK9 = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_4553,c_3968]) ).
tcf(c_4565,plain,
iPr_def_11 != iPr_def_11,
inference(demodulation,[status(thm)],[c_2390,c_4554]) ).
tcf(c_4567,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_4565]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU152+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 13:03:52 UTC 2026
% 0.02/0.36 % CPUTime :
% 0.02/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.40 Running first-order theorem proving
% 0.02/0.40 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.02/0.41
% 0.02/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41
% 0.02/0.41 % Detected problem language: tptp
% 0.02/0.42 % Proving...
% 3.60/1.17 % SZS status Started for theBenchmark.p
% 3.60/1.17 % SZS status Theorem for theBenchmark.p
% 3.60/1.17
% 3.60/1.17 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.60/1.17
% 3.60/1.17 % ------ iProver source info
% 3.60/1.17
% 3.60/1.17 % git: date: 2026-07-19 20:42:38 +0200
% 3.60/1.17 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.60/1.17 % git: non_committed_changes: false
% 3.60/1.17
% 3.60/1.17 % ------ Parsing...
% 3.60/1.17 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.60/1.17
% 3.60/1.17 % ------ Preprocessing... sup_sim: 4 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.60/1.17
% 3.60/1.17 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.60/1.17
% 3.60/1.17 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.60/1.17 % ------ Proving...
% 3.60/1.17 % ------ Problem Properties
% 3.60/1.17
% 3.60/1.17 %
% 3.60/1.17 % clauses 100
% 3.60/1.17 % conjectures 1
% 3.60/1.17 % EPR 23
% 3.60/1.17 % Horn 78
% 3.60/1.17 % unary 27
% 3.60/1.17 % binary 39
% 3.60/1.17 % lits 211
% 3.60/1.17 % lits eq 66
% 3.60/1.17 % fd_pure 0
% 3.60/1.17 % fd_pseudo 0
% 3.60/1.17 % fd_cond 3
% 3.60/1.17 % fd_pseudo_cond 26
% 3.60/1.17 % AC symbols 0
% 3.60/1.17
% 3.60/1.17 % ------ Schedule dynamic 5 is on
% 3.60/1.17
% 3.60/1.17 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.60/1.17
% 3.60/1.17
% 3.60/1.17 % ------
% 3.60/1.17 % Current options:
% 3.60/1.17 % ------
% 3.60/1.17
% 3.60/1.17
% 3.60/1.17 %
% 3.60/1.17
% 3.60/1.17 % ------ Proving...
% 3.60/1.17 %
% 3.60/1.17
% 3.60/1.17 % SZS status Theorem for theBenchmark.p
% 3.60/1.17
% 3.60/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.60/1.17
% 3.60/1.17
%------------------------------------------------------------------------------