%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET903+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n018.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:49:04 PM UTC 2026
% Result : Theorem 1.68s 1.26s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f38ERROR: Could not build tree for root c_464ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f9,conjecture,
! [X0,X1,X2] :
~ ( X2 != empty_set
& X1 != empty_set
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
~ ( X2 != empty_set
& X1 != empty_set
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f15,plain,
? [X0,X1,X2] :
( X2 != empty_set
& X1 != empty_set
& X1 != X2
& singleton(X0) = set_union2(X1,X2) ),
inference(ennf_transformation,[],[f10]) ).
fof(f18,plain,
( empty_set != sK4
& empty_set != sK3
& sK3 != sK4
& singleton(sK2) = set_union2(sK3,sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f15]) ).
fof(f34,plain,
empty_set != sK4,
inference(cnf_transformation,[],[f18]) ).
fof(f35,plain,
empty_set != sK3,
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
sK3 != sK4,
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
singleton(sK2) = set_union2(sK3,sK4),
inference(cnf_transformation,[],[f18]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X0 = empty_set )
| ( singleton(X2) = X0 )
| ( set_union2(X0,X1) != singleton(X2) ) ),
inference(cnf_transformation,[],[f38]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = empty_set )
| ( singleton(X2) = X1 )
| ( set_union2(X0,X1) != singleton(X2) ) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_64,negated_conjecture,
set_union2(sK3,sK4) = singleton(sK2),
inference(cnf_transformation,[],[f37]) ).
tcf(c_65,negated_conjecture,
sK3 != sK4,
inference(cnf_transformation,[],[f36]) ).
tcf(c_66,negated_conjecture,
empty_set != sK3,
inference(cnf_transformation,[],[f35]) ).
tcf(c_67,negated_conjecture,
empty_set != sK4,
inference(cnf_transformation,[],[f34]) ).
tcf(c_228,definition,
iPr_def_10 = set_union2(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_229,definition,
iPr_def_11 = singleton(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_230,negated_conjecture,
empty_set != sK4,
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_231,negated_conjecture,
empty_set != sK3,
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_232,negated_conjecture,
sK3 != sK4,
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_233,negated_conjecture,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_64,c_229,c_228]) ).
tcf(c_389,plain,
singleton(sK2) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_229,c_233]) ).
tcf(c_425,plain,
! [X0: $i] :
( ( empty_set = sK3 )
| ( singleton(X0) = sK3 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_228,c_56]) ).
tcf(c_426,plain,
! [X0: $i] :
( ( singleton(X0) = sK3 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_425,c_231]) ).
tcf(c_434,plain,
singleton(sK2) = sK3,
inference(superposition,[status(thm)],[c_389,c_426]) ).
tcf(c_435,plain,
sK3 = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_434,c_389]) ).
tcf(c_438,plain,
set_union2(iPr_def_10,sK4) = iPr_def_10,
inference(demodulation,[status(thm)],[c_228,c_435]) ).
tcf(c_439,plain,
sK4 != iPr_def_10,
inference(demodulation,[status(thm)],[c_232,c_435]) ).
tcf(c_453,plain,
! [X0: $i] :
( ( empty_set = sK4 )
| ( singleton(X0) = sK4 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_438,c_63]) ).
tcf(c_454,plain,
! [X0: $i] :
( ( singleton(X0) = sK4 )
| ( singleton(X0) != iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_453,c_230]) ).
tcf(c_462,plain,
singleton(sK2) = sK4,
inference(superposition,[status(thm)],[c_389,c_454]) ).
tcf(c_463,plain,
sK4 = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_462,c_389]) ).
tcf(c_464,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_463,c_439]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET903+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n018.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 12:23:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/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.13/0.41
% 0.13/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.41
% 0.13/0.41 % Detected problem language: tptp
% 0.13/0.42 % Proving...
% 1.68/1.26 % SZS status Started for theBenchmark.p
% 1.68/1.26 % SZS status Theorem for theBenchmark.p
% 1.68/1.26
% 1.68/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.68/1.26
% 1.68/1.26 % ------ iProver source info
% 1.68/1.26
% 1.68/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 1.68/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.68/1.26 % git: non_committed_changes: false
% 1.68/1.26
% 1.68/1.26 % ------ Parsing...
% 1.68/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.68/1.26
% 1.68/1.26 % ------ Preprocessing... sup_sim: 0 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 %
% 1.68/1.26
% 1.68/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.68/1.26
% 1.68/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.68/1.26 % ------ Proving...
% 1.68/1.26 % ------ Problem Properties
% 1.68/1.26
% 1.68/1.26 %
% 1.68/1.26 % clauses 16
% 1.68/1.26 % conjectures 4
% 1.68/1.26 % EPR 7
% 1.68/1.26 % Horn 13
% 1.68/1.26 % unary 11
% 1.68/1.26 % binary 2
% 1.68/1.26 % lits 24
% 1.68/1.26 % lits eq 17
% 1.68/1.26 % fd_pure 0
% 1.68/1.26 % fd_pseudo 0
% 1.68/1.26 % fd_cond 0
% 1.68/1.26 % fd_pseudo_cond 3
% 1.68/1.26 % AC symbols 0
% 1.68/1.26
% 1.68/1.26 % ------ Schedule dynamic 5 is on
% 1.68/1.26
% 1.68/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.68/1.26
% 1.68/1.26
% 1.68/1.26 % ------
% 1.68/1.26 % Current options:
% 1.68/1.26 % ------
% 1.68/1.26
% 1.68/1.26
% 1.68/1.26 %
% 1.68/1.26
% 1.68/1.26 % ------ Proving...
% 1.68/1.26 %
% 1.68/1.26
% 1.68/1.26 % SZS status Theorem for theBenchmark.p
% 1.68/1.26
% 1.68/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.68/1.26
% 1.68/1.26
%------------------------------------------------------------------------------