%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET764+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n026.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:48:31 PM UTC 2026
% Result : Theorem 3.33s 1.30s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 97 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 108 ( 47 ~; 36 |; 17 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 76 ( 0 sgn 68 !; 8 ?; 15 :)
% 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(f6,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(f24,axiom,
! [X0,X1,X2] :
( member(X2,inverse_image2(X0,X1))
<=> ? [X3] :
( apply(X0,X2,X3)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',inverse_image2) ).
fof(f29,conjecture,
! [X0,X1,X2] :
( maps(X0,X1,X2)
=> equal_set(inverse_image2(X0,empty_set),empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIIa14) ).
fof(f30,negated_conjecture,
~ ! [X0,X1,X2] :
( maps(X0,X1,X2)
=> equal_set(inverse_image2(X0,empty_set),empty_set) ),
inference(negated_conjecture,[status(cth)],[f29]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f34,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(flattening,[],[f35]) ).
fof(f44,plain,
? [X0,X1,X2] :
( maps(X0,X1,X2)
& ~ equal_set(inverse_image2(X0,empty_set),empty_set) ),
inference(ennf_transformation,[],[f30]) ).
fof(f45,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,[],[f34]) ).
fof(f46,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,[],[f45]) ).
fof(f47,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))],[f46]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( ~ member(X2,inverse_image2(X0,X1))
| ? [X3] :
( apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ! [X3] :
( ~ apply(X0,X2,X3)
| ~ member(X3,X1) )
| member(X2,inverse_image2(X0,X1)) ) ),
inference(nnf_transformation,[],[f24]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( ~ member(X2,inverse_image2(X0,X1))
| ? [X4] :
( apply(X0,X2,X4)
& member(X4,X1) ) )
& ( ! [X3] :
( ~ apply(X0,X2,X3)
| ~ member(X3,X1) )
| member(X2,inverse_image2(X0,X1)) ) ),
inference(rectify,[],[f76]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( ~ member(X2,inverse_image2(X0,X1))
| ( apply(X0,X2,sK7(X0,X1,X2))
& member(sK7(X0,X1,X2),X1) ) )
& ( ! [X3] :
( ~ apply(X0,X2,X3)
| ~ member(X3,X1) )
| member(X2,inverse_image2(X0,X1)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(X4,sK7(X0,X1,X2))],[f77]) ).
fof(f83,plain,
( maps(sK9,sK10,sK11)
& ~ equal_set(inverse_image2(sK9,empty_set),empty_set) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9,sK10,sK11]),skolemize(X0,sK9),skolemize(X1,sK10),skolemize(X2,sK11)],[f44]) ).
fof(f85,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f87,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f96,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f6]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ member(X2,inverse_image2(X0,X1))
| member(sK7(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f78]) ).
fof(f135,plain,
~ equal_set(inverse_image2(sK9,empty_set),empty_set),
inference(cnf_transformation,[],[f83]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_61,plain,
! [X0: $i] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f96]) ).
tcf(c_93,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(sK7(X1,X2,X0),X2)
| ~ member(X0,inverse_image2(X1,X2)) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_99,negated_conjecture,
~ equal_set(inverse_image2(sK9,empty_set),empty_set),
inference(cnf_transformation,[],[f135]) ).
tcf(c_839,plain,
! [X0: $i,X1: $i] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| ( X1 != empty_set )
| ( inverse_image2(sK9,empty_set) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_99]) ).
tcf(c_840,plain,
( ~ subset(empty_set,inverse_image2(sK9,empty_set))
| ~ subset(inverse_image2(sK9,empty_set),empty_set) ),
inference(unflattening,[status(thm)],[c_839]) ).
tcf(c_994,plain,
( ~ subset(empty_set,inverse_image2(sK9,empty_set))
| ~ subset(inverse_image2(sK9,empty_set),empty_set) ),
inference(prop_impl_just,[status(thm)],[c_840]) ).
tcf(c_2639,plain,
! [X0: $i] : subset(empty_set,X0),
inference(superposition,[status(thm)],[c_50,c_61]) ).
tcf(c_2645,plain,
~ subset(inverse_image2(sK9,empty_set),empty_set),
inference(forward_subsumption_resolution,[status(thm)],[c_994,c_2639]) ).
tcf(c_3469,plain,
! [X0: $i,X1: $i] : ~ member(X0,inverse_image2(X1,empty_set)),
inference(superposition,[status(thm)],[c_93,c_61]) ).
tcf(c_3654,plain,
! [X0: $i,X1: $i] : subset(inverse_image2(X0,empty_set),X1),
inference(superposition,[status(thm)],[c_50,c_3469]) ).
tcf(c_3659,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_2645,c_3654]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET764+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 % Computer : n026.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 11:56:24 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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.12/0.43
% 0.12/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43
% 0.12/0.43 % Detected problem language: tptp
% 0.12/0.44 % Proving...
% 3.33/1.30 % SZS status Started for theBenchmark.p
% 3.33/1.30 % SZS status Theorem for theBenchmark.p
% 3.33/1.30
% 3.33/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.33/1.30
% 3.33/1.30 % ------ iProver source info
% 3.33/1.30
% 3.33/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.33/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.33/1.30 % git: non_committed_changes: false
% 3.33/1.30
% 3.33/1.30 % ------ Parsing...
% 3.33/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.33/1.30
% 3.33/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.33/1.30
% 3.33/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.33/1.30
% 3.33/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.33/1.30 % ------ Proving...
% 3.33/1.30 % ------ Problem Properties
% 3.33/1.30
% 3.33/1.30 %
% 3.33/1.30 % clauses 50
% 3.33/1.30 % conjectures 0
% 3.33/1.30 % EPR 3
% 3.33/1.30 % Horn 45
% 3.33/1.30 % unary 4
% 3.33/1.30 % binary 28
% 3.33/1.30 % lits 127
% 3.33/1.30 % lits eq 4
% 3.33/1.30 % fd_pure 0
% 3.33/1.30 % fd_pseudo 0
% 3.33/1.30 % fd_cond 0
% 3.33/1.30 % fd_pseudo_cond 3
% 3.33/1.30 % AC symbols 0
% 3.33/1.30
% 3.33/1.30 % ------ Schedule dynamic 5 is on
% 3.33/1.30
% 3.33/1.30 % ------ no conjectures: strip conj schedule
% 3.33/1.30
% 3.33/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.33/1.30
% 3.33/1.30
% 3.33/1.30 % ------
% 3.33/1.30 % Current options:
% 3.33/1.30 % ------
% 3.33/1.30
% 3.33/1.30
% 3.33/1.30 %
% 3.33/1.30
% 3.33/1.30 % ------ Proving...
% 3.33/1.30 %
% 3.33/1.30
% 3.33/1.30 % SZS status Theorem for theBenchmark.p
% 3.33/1.30
% 3.33/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.33/1.30
% 3.33/1.30
%------------------------------------------------------------------------------