%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n009.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:46:45 PM UTC 2026
% Result : Theorem 2.26s 1.39s
% Output : CNFRefutation 2.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 104 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 115 ( 50 ~; 46 |; 13 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 66 !; 3 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(f4,axiom,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(f12,conjecture,
! [X0] : equal_set(intersection(X0,X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI13) ).
fof(f13,negated_conjecture,
~ ! [X0] : equal_set(intersection(X0,X0),X0),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f16]) ).
fof(f19,plain,
? [X0] : ~ equal_set(intersection(X0,X0),X0),
inference(ennf_transformation,[],[f13]) ).
fof(f20,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f21]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ~ member(X0,intersection(X1,X2))
| ( member(X0,X2)
& member(X0,X1) ) )
& ( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ~ member(X0,intersection(X1,X2))
| ( member(X0,X2)
& member(X0,X1) ) )
& ( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f24]) ).
fof(f39,plain,
~ equal_set(intersection(sK3,sK3),sK3),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f19]) ).
fof(f41,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f42,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f43,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f47,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f67,plain,
~ equal_set(intersection(sK3,sK3),sK3),
inference(cnf_transformation,[],[f39]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_76,negated_conjecture,
~ equal_set(intersection(sK3,sK3),sK3),
inference(cnf_transformation,[],[f67]) ).
tcf(c_426,plain,
! [X0: $i,X1: $i] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| ( X1 != sK3 )
| ( intersection(sK3,sK3) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
tcf(c_427,plain,
( ~ subset(sK3,intersection(sK3,sK3))
| ~ subset(intersection(sK3,sK3),sK3) ),
inference(unflattening,[status(thm)],[c_426]) ).
tcf(c_492,plain,
( ~ subset(sK3,intersection(sK3,sK3))
| ~ subset(intersection(sK3,sK3),sK3) ),
inference(prop_impl_just,[status(thm)],[c_427]) ).
tcf(c_1316,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(intersection(X0,X1),X2)
| member(sK0(intersection(X0,X1),X2),X0) ),
inference(superposition,[status(thm)],[c_50,c_56]) ).
tcf(c_1319,plain,
( subset(intersection(sK3,sK3),sK3)
| member(sK0(intersection(sK3,sK3),sK3),sK3) ),
inference(instantiation,[status(thm)],[c_1316]) ).
tcf(c_1441,plain,
( subset(sK3,intersection(sK3,sK3))
| member(sK0(sK3,intersection(sK3,sK3)),sK3) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_1763,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,intersection(X1,X2))
| ~ member(sK0(X0,intersection(X1,X2)),X2)
| ~ member(sK0(X0,intersection(X1,X2)),X1) ),
inference(superposition,[status(thm)],[c_55,c_49]) ).
tcf(c_1779,plain,
( subset(sK3,intersection(sK3,sK3))
| ~ member(sK0(sK3,intersection(sK3,sK3)),sK3) ),
inference(instantiation,[status(thm)],[c_1763]) ).
tcf(c_1817,plain,
~ subset(intersection(sK3,sK3),sK3),
inference(global_subsumption_just,[status(thm)],[c_492,c_427,c_1441,c_1779]) ).
tcf(c_2044,plain,
( subset(intersection(sK3,sK3),sK3)
| ~ member(sK0(intersection(sK3,sK3),sK3),sK3) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_2046,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2044,c_1817,c_1319]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n009.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Thu Sep 24 10:02:13 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.49 Running first-order theorem proving
% 0.24/0.49 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.24/0.51
% 0.24/0.51 % ======== iProver multi-core TPTP/SMT =========
% 0.24/0.51
% 0.24/0.51 % Detected problem language: tptp
% 0.24/0.53 % Proving...
% 2.26/1.39 % SZS status Started for theBenchmark.p
% 2.26/1.39 % SZS status Theorem for theBenchmark.p
% 2.26/1.39
% 2.26/1.39 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.26/1.39
% 2.26/1.39 % ------ iProver source info
% 2.26/1.39
% 2.26/1.39 % git: date: 2026-07-19 20:42:38 +0200
% 2.26/1.39 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.26/1.39 % git: non_committed_changes: false
% 2.26/1.39
% 2.26/1.39 % ------ Parsing...
% 2.26/1.39 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.26/1.39
% 2.26/1.39 % ------ Preprocessing... sup_sim: 0 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.26/1.39
% 2.26/1.39 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.26/1.39
% 2.26/1.39 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.26/1.39 % ------ Proving...
% 2.26/1.39 % ------ Problem Properties
% 2.26/1.39
% 2.26/1.39 %
% 2.26/1.39 % clauses 27
% 2.26/1.39 % conjectures 0
% 2.26/1.39 % EPR 2
% 2.26/1.39 % Horn 22
% 2.26/1.39 % unary 4
% 2.26/1.39 % binary 16
% 2.26/1.39 % lits 57
% 2.26/1.39 % lits eq 3
% 2.26/1.39 % fd_pure 0
% 2.26/1.39 % fd_pseudo 0
% 2.26/1.39 % fd_cond 0
% 2.26/1.39 % fd_pseudo_cond 2
% 2.26/1.39 % AC symbols 0
% 2.26/1.39
% 2.26/1.39 % ------ Schedule dynamic 5 is on
% 2.26/1.39
% 2.26/1.39 % ------ no conjectures: strip conj schedule
% 2.26/1.39
% 2.26/1.39 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.26/1.39
% 2.26/1.39
% 2.26/1.39 % ------
% 2.26/1.39 % Current options:
% 2.26/1.39 % ------
% 2.26/1.39
% 2.26/1.39
% 2.26/1.39 %
% 2.26/1.39
% 2.26/1.39 % ------ Proving...
% 2.26/1.39 %
% 2.26/1.39
% 2.26/1.39 % SZS status Theorem for theBenchmark.p
% 2.26/1.39
% 2.26/1.39 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.26/1.39
% 2.26/1.39
%------------------------------------------------------------------------------