%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET917+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 : n013.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:06 PM UTC 2026
% Result : Theorem 1.48s 1.16s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 19 unt; 2 def)
% Number of atoms : 60 ( 22 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 9 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f4,axiom,
! [X0,X1] :
( ~ in(X0,X1)
=> disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(f5,axiom,
! [X0,X1] :
( in(X0,X1)
=> set_intersection2(X1,singleton(X0)) = singleton(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l32_zfmisc_1) ).
fof(f9,conjecture,
! [X0,X1] :
( set_intersection2(singleton(X0),X1) = singleton(X0)
| disjoint(singleton(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t58_zfmisc_1) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( set_intersection2(singleton(X0),X1) = singleton(X0)
| disjoint(singleton(X0),X1) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f13,plain,
! [X0,X1] :
( in(X0,X1)
| disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( ~ in(X0,X1)
| set_intersection2(X1,singleton(X0)) = singleton(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f16,plain,
? [X0,X1] :
( singleton(X0) != set_intersection2(singleton(X0),X1)
& ~ disjoint(singleton(X0),X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f19,plain,
( singleton(sK2) != set_intersection2(singleton(sK2),sK3)
& ~ disjoint(singleton(sK2),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f16]) ).
fof(f21,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f23,plain,
! [X0,X1] :
( in(X0,X1)
| disjoint(singleton(X0),X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( ~ in(X0,X1)
| singleton(X0) = set_intersection2(X1,singleton(X0)) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
singleton(sK2) != set_intersection2(singleton(sK2),sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f29,plain,
~ disjoint(singleton(sK2),sK3),
inference(cnf_transformation,[],[f19]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f21]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( in(X0,X1)
| disjoint(singleton(X0),X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X1,singleton(X0)) = singleton(X0) )
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_57,negated_conjecture,
~ disjoint(singleton(sK2),sK3),
inference(cnf_transformation,[],[f29]) ).
tcf(c_58,negated_conjecture,
set_intersection2(singleton(sK2),sK3) != singleton(sK2),
inference(cnf_transformation,[],[f28]) ).
tcf(c_101,plain,
set_intersection2(sK3,singleton(sK2)) != singleton(sK2),
inference(demodulation,[status(thm)],[c_58,c_50]) ).
tcf(c_164,definition,
iPr_def_10 = singleton(sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_165,definition,
iPr_def_11 = set_intersection2(sK3,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_166,plain,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_101,c_164,c_165]) ).
tcf(c_167,negated_conjecture,
~ disjoint(iPr_def_10,sK3),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_291,plain,
set_intersection2(iPr_def_10,sK3) = iPr_def_11,
inference(demodulation,[status(thm)],[c_165,c_50]) ).
tcf(c_294,plain,
! [X0: $i] :
( disjoint(iPr_def_10,X0)
| in(sK2,X0) ),
inference(superposition,[status(thm)],[c_164,c_52]) ).
tcf(c_302,plain,
in(sK2,sK3),
inference(superposition,[status(thm)],[c_294,c_167]) ).
tcf(c_323,plain,
set_intersection2(sK3,singleton(sK2)) = singleton(sK2),
inference(superposition,[status(thm)],[c_302,c_53]) ).
tcf(c_325,plain,
set_intersection2(sK3,iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_323,c_164]) ).
tcf(c_331,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_325,c_50,c_291]) ).
tcf(c_333,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_166,c_331]) ).
tcf(c_334,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_333]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET917+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 : n013.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:21:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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.09/0.40
% 0.09/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.40
% 0.09/0.40 % Detected problem language: tptp
% 0.09/0.41 % Proving...
% 1.48/1.16 % SZS status Started for theBenchmark.p
% 1.48/1.16 % SZS status Theorem for theBenchmark.p
% 1.48/1.16
% 1.48/1.16 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.16
% 1.48/1.16 % ------ iProver source info
% 1.48/1.16
% 1.48/1.16 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.16 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.16 % git: non_committed_changes: false
% 1.48/1.16
% 1.48/1.16 % ------ Parsing...
% 1.48/1.16 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.48/1.16
% 1.48/1.16 % ------ Preprocessing... sup_sim: 1 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.48/1.16
% 1.48/1.16 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.48/1.16
% 1.48/1.16 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.48/1.16 % ------ Proving...
% 1.48/1.16 % ------ Problem Properties
% 1.48/1.16
% 1.48/1.16 %
% 1.48/1.16 % clauses 11
% 1.48/1.16 % conjectures 1
% 1.48/1.16 % EPR 5
% 1.48/1.16 % Horn 10
% 1.48/1.16 % unary 7
% 1.48/1.16 % binary 4
% 1.48/1.16 % lits 15
% 1.48/1.16 % lits eq 7
% 1.48/1.16 % fd_pure 0
% 1.48/1.16 % fd_pseudo 0
% 1.48/1.16 % fd_cond 0
% 1.48/1.16 % fd_pseudo_cond 0
% 1.48/1.16 % AC symbols 0
% 1.48/1.16
% 1.48/1.16 % ------ Schedule dynamic 5 is on
% 1.48/1.16
% 1.48/1.16 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.48/1.16
% 1.48/1.16
% 1.48/1.16 % ------
% 1.48/1.16 % Current options:
% 1.48/1.16 % ------
% 1.48/1.16
% 1.48/1.16
% 1.48/1.16 %
% 1.48/1.16
% 1.48/1.16 % ------ Proving...
% 1.48/1.16 %
% 1.48/1.16
% 1.48/1.16 % SZS status Theorem for theBenchmark.p
% 1.48/1.16
% 1.48/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.16
% 1.48/1.16
%------------------------------------------------------------------------------