%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU152+1 : 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 : 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 1.60s 1.28s
% Output : CNFRefutation 1.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 18 unt; 2 def)
% Number of atoms : 58 ( 21 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 16 ~; 8 |; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 27 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f6,conjecture,
! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(f7,negated_conjecture,
~ ! [X0,X1] :
( in(X0,X1)
=> set_union2(singleton(X0),X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(singleton(X0),X1)
<=> in(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f14,plain,
? [X0,X1] :
( in(X0,X1)
& set_union2(singleton(X0),X1) != X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f15,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(ennf_transformation,[],[f10]) ).
fof(f16,plain,
( in(sK0,sK1)
& sK1 != set_union2(singleton(sK0),sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( ( ~ subset(singleton(X0),X1)
| in(X0,X1) )
& ( ~ in(X0,X1)
| subset(singleton(X0),X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f19,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f21,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
sK1 != set_union2(singleton(sK0),sK1),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X0,X1] :
( ~ in(X0,X1)
| subset(singleton(X0),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f19]) ).
tcf(c_52,negated_conjecture,
set_union2(singleton(sK0),sK1) != sK1,
inference(cnf_transformation,[],[f22]) ).
tcf(c_53,negated_conjecture,
in(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(singleton(X0),X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( set_union2(X0,X1) = X1 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_122,plain,
set_union2(sK1,singleton(sK0)) != sK1,
inference(demodulation,[status(thm)],[c_52,c_50]) ).
tcf(c_171,definition,
iPr_def_10 = singleton(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_172,definition,
iPr_def_11 = set_union2(sK1,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_173,plain,
iPr_def_11 != sK1,
inference(demodulation,[status(thm)],[c_122,c_171,c_172]) ).
tcf(c_174,negated_conjecture,
in(sK0,sK1),
inference(demodulation,[status(thm)],[c_53]) ).
tcf(c_398,plain,
set_union2(iPr_def_10,sK1) = iPr_def_11,
inference(demodulation,[status(thm)],[c_172,c_50]) ).
tcf(c_406,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ in(sK0,X0) ),
inference(superposition,[status(thm)],[c_171,c_54]) ).
tcf(c_436,plain,
subset(iPr_def_10,sK1),
inference(superposition,[status(thm)],[c_174,c_406]) ).
tcf(c_440,plain,
set_union2(iPr_def_10,sK1) = sK1,
inference(superposition,[status(thm)],[c_436,c_57]) ).
tcf(c_441,plain,
sK1 = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_440,c_398]) ).
tcf(c_445,plain,
iPr_def_11 != iPr_def_11,
inference(demodulation,[status(thm)],[c_173,c_441]) ).
tcf(c_447,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_445]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU152+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 % Computer : n001.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Thu Sep 24 13:03:52 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.13/0.43
% 0.13/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.43
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 1.60/1.28 % SZS status Started for theBenchmark.p
% 1.60/1.28 % SZS status Theorem for theBenchmark.p
% 1.60/1.28
% 1.60/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.60/1.28
% 1.60/1.28 % ------ iProver source info
% 1.60/1.28
% 1.60/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 1.60/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.60/1.28 % git: non_committed_changes: false
% 1.60/1.28
% 1.60/1.28 % ------ Parsing...
% 1.60/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.60/1.28
% 1.60/1.28 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.60/1.28
% 1.60/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.60/1.28
% 1.60/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.60/1.28 % ------ Proving...
% 1.60/1.28 % ------ Problem Properties
% 1.60/1.28
% 1.60/1.28 %
% 1.60/1.28 % clauses 11
% 1.60/1.28 % conjectures 1
% 1.60/1.28 % EPR 4
% 1.60/1.28 % Horn 11
% 1.60/1.28 % unary 7
% 1.60/1.28 % binary 4
% 1.60/1.28 % lits 15
% 1.60/1.28 % lits eq 6
% 1.60/1.28 % fd_pure 0
% 1.60/1.28 % fd_pseudo 0
% 1.60/1.28 % fd_cond 0
% 1.60/1.28 % fd_pseudo_cond 0
% 1.60/1.28 % AC symbols 0
% 1.60/1.28
% 1.60/1.28 % ------ Schedule dynamic 5 is on
% 1.60/1.28
% 1.60/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.60/1.28
% 1.60/1.28
% 1.60/1.28 % ------
% 1.60/1.28 % Current options:
% 1.60/1.28 % ------
% 1.60/1.28
% 1.60/1.28
% 1.60/1.28 %
% 1.60/1.28
% 1.60/1.28 % ------ Proving...
% 1.60/1.28 %
% 1.60/1.28
% 1.60/1.28 % SZS status Theorem for theBenchmark.p
% 1.60/1.28
% 1.60/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.60/1.28
% 1.60/1.28
%------------------------------------------------------------------------------