%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET013+4 : TPTP v9.3.1. Released v2.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:46:01 PM UTC 2026
% Result : Theorem 4.11s 1.31s
% Output : CNFRefutation 4.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 43 ( 7 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 47 ~; 45 |; 9 &)
% ( 3 <=>; 4 =>; 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 63 !; 3 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(f12,conjecture,
! [X0,X1] : equal_set(intersection(X0,X1),intersection(X1,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI06) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : equal_set(intersection(X0,X1),intersection(X1,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] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f16,plain,
? [X0,X1] : ~ equal_set(intersection(X0,X1),intersection(X1,X0)),
inference(ennf_transformation,[],[f13]) ).
fof(f17,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f20,plain,
~ equal_set(intersection(sK0,sK1),intersection(sK1,sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
fof(f21,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(f22,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,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( member(sK2(X0,X1),X0)
& ~ member(sK2(X0,X1),X1) )
| subset(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f19]) ).
fof(f24,plain,
~ equal_set(intersection(sK0,sK1),intersection(sK1,sK0)),
inference(cnf_transformation,[],[f20]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f28,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f29,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f30,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_49,negated_conjecture,
~ equal_set(intersection(sK0,sK1),intersection(sK1,sK0)),
inference(cnf_transformation,[],[f24]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_91,plain,
( ~ subset(intersection(sK1,sK0),intersection(sK0,sK1))
| ~ subset(intersection(sK0,sK1),intersection(sK1,sK0)) ),
inference(resolution,[status(thm)],[c_49,c_53]) ).
tcf(c_126,plain,
( subset(intersection(sK0,sK1),intersection(sK1,sK0))
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_127,plain,
( subset(intersection(sK0,sK1),intersection(sK1,sK0))
| member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_128,plain,
( subset(intersection(sK1,sK0),intersection(sK0,sK1))
| member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_129,plain,
( subset(intersection(sK1,sK0),intersection(sK0,sK1))
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_132,plain,
( member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),sK0)
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_133,plain,
( member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),sK1)
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK1,sK0)) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_138,plain,
( member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),sK1)
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_139,plain,
( member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),sK0)
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_140,plain,
! [X0: $i] :
( member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK0,X0))
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),sK0)
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_160,plain,
( member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),intersection(sK0,sK1))
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),sK1)
| ~ member(sK2(intersection(sK1,sK0),intersection(sK0,sK1)),sK0) ),
inference(instantiation,[status(thm)],[c_140]) ).
tcf(c_178,plain,
! [X0: $i] :
( member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK1,X0))
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),sK1)
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),X0) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_179,plain,
( member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),intersection(sK1,sK0))
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),sK1)
| ~ member(sK2(intersection(sK0,sK1),intersection(sK1,sK0)),sK0) ),
inference(instantiation,[status(thm)],[c_178]) ).
tcf(c_182,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_179,c_160,c_138,c_139,c_132,c_133,c_128,c_129,c_127,c_126,c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET013+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n018.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Thu Sep 24 09:08:48 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.44
% 0.12/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.44
% 0.12/0.44 % Detected problem language: tptp
% 0.12/0.45 % Proving...
% 4.11/1.31 % SZS status Started for theBenchmark.p
% 4.11/1.31 % SZS status Theorem for theBenchmark.p
% 4.11/1.31
% 4.11/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.11/1.31
% 4.11/1.31 % ------ iProver source info
% 4.11/1.31
% 4.11/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 4.11/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.11/1.31 % git: non_committed_changes: false
% 4.11/1.31
% 4.11/1.31 % ------ Parsing...
% 4.11/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.11/1.31
% 4.11/1.31 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.11/1.31
% 4.11/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.11/1.31 % ------ Proving...
% 4.11/1.31 % ------ Problem Properties
% 4.11/1.31
% 4.11/1.31 %
% 4.11/1.31 % clauses 6
% 4.11/1.31 % conjectures 0
% 4.11/1.31 % EPR 0
% 4.11/1.31 % Horn 5
% 4.11/1.31 % unary 0
% 4.11/1.31 % binary 5
% 4.11/1.31 % lits 13
% 4.11/1.31 % lits eq 0
% 4.11/1.31 % fd_pure 0
% 4.11/1.31 % fd_pseudo 0
% 4.11/1.31 % fd_cond 0
% 4.11/1.31 % fd_pseudo_cond 0
% 4.11/1.31 % AC symbols 0
% 4.11/1.31
% 4.11/1.31 % ------ Schedule dynamic 5 is on
% 4.11/1.31
% 4.11/1.31 % ------ no conjectures: strip conj schedule
% 4.11/1.31
% 4.11/1.31 % ------ no equalities: superposition off
% 4.11/1.31
% 4.11/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 4.11/1.31
% 4.11/1.31
% 4.11/1.31 % ------
% 4.11/1.31 % Current options:
% 4.11/1.31 % ------
% 4.11/1.31
% 4.11/1.31
% 4.11/1.31 %
% 4.11/1.31
% 4.11/1.31 % ------ Proving...
% 4.11/1.31 %
% 4.11/1.31
% 4.11/1.31 % SZS status Theorem for theBenchmark.p
% 4.11/1.31
% 4.11/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.11/1.31
% 4.11/1.31
%------------------------------------------------------------------------------