%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET912+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 : n011.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:05 PM UTC 2026
% Result : Theorem 2.31s 21.37s
% Output : CNFRefutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 21 unt; 2 def)
% Number of atoms : 86 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 25 ~; 16 |; 13 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 36 !; 6 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_intersection2(X0,X1) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(f9,axiom,
! [X0,X1,X2] :
( subset(unordered_pair(X0,X1),X2)
<=> ( in(X1,X2)
& in(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(f10,conjecture,
! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_intersection2(unordered_pair(X0,X2),X1) = unordered_pair(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_zfmisc_1) ).
fof(f11,negated_conjecture,
~ ! [X0,X1,X2] :
( ( in(X2,X1)
& in(X0,X1) )
=> set_intersection2(unordered_pair(X0,X2),X1) = unordered_pair(X0,X2) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
fof(f15,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(ennf_transformation,[],[f8]) ).
fof(f16,plain,
? [X0,X1,X2] :
( in(X2,X1)
& in(X0,X1)
& unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1) ),
inference(ennf_transformation,[],[f11]) ).
fof(f17,plain,
? [X0,X1,X2] :
( in(X2,X1)
& in(X0,X1)
& unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1) ),
inference(flattening,[],[f16]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( ~ subset(unordered_pair(X0,X1),X2)
| ( in(X1,X2)
& in(X0,X2) ) )
& ( ~ in(X1,X2)
| ~ in(X0,X2)
| subset(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ( ~ subset(unordered_pair(X0,X1),X2)
| ( in(X1,X2)
& in(X0,X2) ) )
& ( ~ in(X1,X2)
| ~ in(X0,X2)
| subset(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f20]) ).
fof(f22,plain,
( in(sK4,sK3)
& in(sK2,sK3)
& unordered_pair(sK2,sK4) != set_intersection2(unordered_pair(sK2,sK4),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f17]) ).
fof(f25,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f30,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_intersection2(X0,X1) = X0 ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
! [X2,X0,X1] :
( ~ in(X1,X2)
| ~ in(X0,X2)
| subset(unordered_pair(X0,X1),X2) ),
inference(cnf_transformation,[],[f21]) ).
fof(f34,plain,
in(sK4,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f35,plain,
in(sK2,sK3),
inference(cnf_transformation,[],[f22]) ).
fof(f36,plain,
unordered_pair(sK2,sK4) != set_intersection2(unordered_pair(sK2,sK4),sK3),
inference(cnf_transformation,[],[f22]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f25]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( ( set_intersection2(X0,X1) = X0 )
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(unordered_pair(X2,X0),X1)
| ~ in(X2,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_60,negated_conjecture,
set_intersection2(unordered_pair(sK2,sK4),sK3) != unordered_pair(sK2,sK4),
inference(cnf_transformation,[],[f36]) ).
tcf(c_61,negated_conjecture,
in(sK2,sK3),
inference(cnf_transformation,[],[f35]) ).
tcf(c_62,negated_conjecture,
in(sK4,sK3),
inference(cnf_transformation,[],[f34]) ).
tcf(c_123,plain,
set_intersection2(sK3,unordered_pair(sK2,sK4)) != unordered_pair(sK2,sK4),
inference(demodulation,[status(thm)],[c_60,c_51]) ).
tcf(c_337,definition,
iPr_def_10 = unordered_pair(sK2,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_338,definition,
iPr_def_11 = set_intersection2(sK3,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_339,plain,
iPr_def_11 != iPr_def_10,
inference(demodulation,[status(thm)],[c_123,c_337,c_338]) ).
tcf(c_340,negated_conjecture,
in(sK4,sK3),
inference(demodulation,[status(thm)],[c_62]) ).
tcf(c_341,negated_conjecture,
in(sK2,sK3),
inference(demodulation,[status(thm)],[c_61]) ).
tcf(c_505,plain,
set_intersection2(iPr_def_10,sK3) = iPr_def_11,
inference(demodulation,[status(thm)],[c_338,c_51]) ).
tcf(c_567,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ in(sK4,X0)
| ~ in(sK2,X0) ),
inference(superposition,[status(thm)],[c_337,c_57]) ).
tcf(c_588,plain,
( subset(iPr_def_10,sK3)
| ~ in(sK4,sK3) ),
inference(superposition,[status(thm)],[c_341,c_567]) ).
tcf(c_592,plain,
subset(iPr_def_10,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_588,c_340]) ).
tcf(c_598,plain,
set_intersection2(iPr_def_10,sK3) = iPr_def_10,
inference(superposition,[status(thm)],[c_592,c_56]) ).
tcf(c_601,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_505,c_598]) ).
tcf(c_602,plain,
iPr_def_10 != iPr_def_10,
inference(demodulation,[status(thm)],[c_339,c_601]) ).
tcf(c_603,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_602]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET912+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.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/20.45 % CPULimit : 300
% 0.09/20.45 % WCLimit : 300
% 0.09/20.45 % DateTime : Thu Sep 24 12:22:02 UTC 2026
% 0.09/20.45 % CPUTime :
% 0.09/20.45 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/20.49 Running first-order theorem proving
% 0.09/20.49 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.36/20.50
% 0.36/20.50 % ======== iProver multi-core TPTP/SMT =========
% 0.36/20.50
% 0.36/20.50 % Detected problem language: tptp
% 0.36/20.52 % Proving...
% 2.31/21.37 % SZS status Started for theBenchmark.p
% 2.31/21.37 % SZS status Theorem for theBenchmark.p
% 2.31/21.37
% 2.31/21.37 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.31/21.37
% 2.31/21.37 % ------ iProver source info
% 2.31/21.37
% 2.31/21.37 % git: date: 2026-07-19 20:42:38 +0200
% 2.31/21.37 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.31/21.37 % git: non_committed_changes: false
% 2.31/21.37
% 2.31/21.37 % ------ Parsing...
% 2.31/21.37 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.31/21.37
% 2.31/21.37 % ------ 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 %
% 2.31/21.37
% 2.31/21.37 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.31/21.37
% 2.31/21.37 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.31/21.37 % ------ Proving...
% 2.31/21.37 % ------ Problem Properties
% 2.31/21.37
% 2.31/21.37 %
% 2.31/21.37 % clauses 15
% 2.31/21.37 % conjectures 2
% 2.31/21.37 % EPR 6
% 2.31/21.37 % Horn 15
% 2.31/21.37 % unary 10
% 2.31/21.37 % binary 4
% 2.31/21.37 % lits 21
% 2.31/21.37 % lits eq 8
% 2.31/21.37 % fd_pure 0
% 2.31/21.37 % fd_pseudo 0
% 2.31/21.37 % fd_cond 0
% 2.31/21.37 % fd_pseudo_cond 0
% 2.31/21.37 % AC symbols 0
% 2.31/21.37
% 2.31/21.37 % ------ Schedule dynamic 5 is on
% 2.31/21.37
% 2.31/21.37 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.31/21.37
% 2.31/21.37
% 2.31/21.37 % ------
% 2.31/21.37 % Current options:
% 2.31/21.37 % ------
% 2.31/21.37
% 2.31/21.37
% 2.31/21.37 %
% 2.31/21.37
% 2.31/21.37 % ------ Proving...
% 2.31/21.37 %
% 2.31/21.37
% 2.31/21.37 % SZS status Theorem for theBenchmark.p
% 2.31/21.37
% 2.31/21.37 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.31/21.37
% 2.31/21.37
%------------------------------------------------------------------------------