%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET693+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 : n019.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:47:48 PM UTC 2026
% Result : Theorem 4.36s 6.30s
% Output : CNFRefutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 60 ( 2 unt; 0 def)
% Number of atoms : 166 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 179 ( 73 ~; 81 |; 17 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% 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 : 87 ( 0 sgn 81 !; 6 ?; 27 :)
% 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(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(f12,conjecture,
! [X0,X1] :
( equal_set(X0,union(X0,X1))
<=> subset(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI20) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] :
( equal_set(X0,union(X0,X1))
<=> subset(X1,X0) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0,X1] :
( equal_set(X0,union(X0,X1))
<~> subset(X1,X0) ),
inference(ennf_transformation,[],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f16,plain,
? [X0,X1] :
( ( equal_set(X0,union(X0,X1))
| subset(X1,X0) )
& ( ~ equal_set(X0,union(X0,X1))
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f17,plain,
( ( equal_set(sK0,union(sK0,sK1))
| subset(sK1,sK0) )
& ( ~ equal_set(sK0,union(sK0,sK1))
| ~ subset(sK1,sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f16]) ).
fof(f18,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(f19,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,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,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(f21,plain,
! [X0,X1,X2] :
( ( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) )
& ( ( ~ member(X0,X2)
& ~ member(X0,X1) )
| member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) )
& ( ( ~ member(X0,X2)
& ~ member(X0,X1) )
| member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( ~ equal_set(X0,X1)
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0,X1] :
( ( ~ equal_set(X0,X1)
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
( equal_set(sK0,union(sK0,sK1))
| subset(sK1,sK0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f26,plain,
( ~ equal_set(sK0,union(sK0,sK1))
| ~ subset(sK1,sK0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f27,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f28,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f29,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
fof(f33,plain,
! [X0,X1] :
( ~ equal_set(X0,X1)
| subset(X1,X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_49,negated_conjecture,
( ~ subset(sK1,sK0)
| ~ equal_set(sK0,union(sK0,sK1)) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,negated_conjecture,
( subset(sK1,sK0)
| equal_set(sK0,union(sK0,sK1)) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_66,plain,
( ~ equal_set(sK0,union(sK0,sK1))
| ~ subset(sK1,sK0) ),
inference(prop_impl_just,[status(thm)],[c_49]) ).
tcf(c_67,plain,
( ~ subset(sK1,sK0)
| ~ equal_set(sK0,union(sK0,sK1)) ),
inference(renaming,[status(thm)],[c_66]) ).
tcf(c_68,plain,
( equal_set(sK0,union(sK0,sK1))
| subset(sK1,sK0) ),
inference(prop_impl_just,[status(thm)],[c_50]) ).
tcf(c_69,plain,
( subset(sK1,sK0)
| equal_set(sK0,union(sK0,sK1)) ),
inference(renaming,[status(thm)],[c_68]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_169,plain,
( subset(sK1,sK0)
| subset(union(sK0,sK1),sK0) ),
inference(resolution,[status(thm)],[c_69,c_86]) ).
tcf(c_183,plain,
( ~ subset(sK1,sK0)
| ~ subset(sK0,union(sK0,sK1))
| ~ subset(union(sK0,sK1),sK0) ),
inference(resolution,[status(thm)],[c_67,c_57]) ).
tcf(c_242,plain,
( subset(sK1,sK0)
| ~ member(sK2(sK1,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_243,plain,
( subset(sK1,sK0)
| member(sK2(sK1,sK0),sK1) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_244,plain,
( subset(sK0,union(sK0,sK1))
| member(sK2(sK0,union(sK0,sK1)),sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_245,plain,
( subset(sK0,union(sK0,sK1))
| ~ member(sK2(sK0,union(sK0,sK1)),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_248,plain,
! [X0: $i] :
( member(sK2(sK0,union(sK0,sK1)),union(sK0,X0))
| ~ member(sK2(sK0,union(sK0,sK1)),sK0) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_250,plain,
( subset(union(sK0,sK1),sK0)
| member(sK2(union(sK0,sK1),sK0),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_251,plain,
( subset(union(sK0,sK1),sK0)
| ~ member(sK2(union(sK0,sK1),sK0),sK0) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_258,plain,
( member(sK2(union(sK0,sK1),sK0),sK0)
| member(sK2(union(sK0,sK1),sK0),sK1)
| ~ member(sK2(union(sK0,sK1),sK0),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_263,plain,
! [X0: $i] :
( member(sK2(sK1,sK0),union(X0,sK1))
| ~ member(sK2(sK1,sK0),sK1) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_266,plain,
( member(sK2(sK1,sK0),union(sK0,sK1))
| ~ member(sK2(sK1,sK0),sK1) ),
inference(instantiation,[status(thm)],[c_263]) ).
tcf(c_267,plain,
! [X0: $i,X1: $i] :
( member(sK2(sK1,sK0),X1)
| ~ subset(union(X0,sK1),X1)
| ~ member(sK2(sK1,sK0),union(X0,sK1)) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_268,plain,
( member(sK2(sK1,sK0),sK0)
| ~ subset(union(sK0,sK1),sK0)
| ~ member(sK2(sK1,sK0),union(sK0,sK1)) ),
inference(instantiation,[status(thm)],[c_267]) ).
tcf(c_314,plain,
subset(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_169,c_169,c_242,c_243,c_266,c_268]) ).
tcf(c_350,plain,
( member(sK2(sK0,union(sK0,sK1)),union(sK0,sK1))
| ~ member(sK2(sK0,union(sK0,sK1)),sK0) ),
inference(instantiation,[status(thm)],[c_248]) ).
tcf(c_392,plain,
! [X0: $i] :
( member(sK2(union(sK0,sK1),sK0),X0)
| ~ subset(sK1,X0)
| ~ member(sK2(union(sK0,sK1),sK0),sK1) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_393,plain,
( member(sK2(union(sK0,sK1),sK0),sK0)
| ~ subset(sK1,sK0)
| ~ member(sK2(union(sK0,sK1),sK0),sK1) ),
inference(instantiation,[status(thm)],[c_392]) ).
tcf(c_466,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_393,c_350,c_314,c_258,c_250,c_251,c_244,c_245,c_183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET693+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n019.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 11:41:25 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/5.42 Running first-order theorem proving
% 0.16/5.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.16/5.43
% 0.16/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.16/5.43
% 0.16/5.43 % Detected problem language: tptp
% 0.16/5.45 % Proving...
% 4.36/6.30 % SZS status Started for theBenchmark.p
% 4.36/6.30 % SZS status Theorem for theBenchmark.p
% 4.36/6.30
% 4.36/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.36/6.30
% 4.36/6.30 % ------ iProver source info
% 4.36/6.30
% 4.36/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.36/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.36/6.30 % git: non_committed_changes: false
% 4.36/6.30
% 4.36/6.30 % ------ Parsing...
% 4.36/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.36/6.30
% 4.36/6.30 % ------ 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.36/6.30
% 4.36/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.36/6.30 % ------ Proving...
% 4.36/6.30 % ------ Problem Properties
% 4.36/6.30
% 4.36/6.30 %
% 4.36/6.30 % clauses 9
% 4.36/6.30 % conjectures 0
% 4.36/6.30 % EPR 1
% 4.36/6.30 % Horn 5
% 4.36/6.30 % unary 0
% 4.36/6.30 % binary 6
% 4.36/6.30 % lits 21
% 4.36/6.30 % lits eq 0
% 4.36/6.30 % fd_pure 0
% 4.36/6.30 % fd_pseudo 0
% 4.36/6.30 % fd_cond 0
% 4.36/6.30 % fd_pseudo_cond 0
% 4.36/6.30 % AC symbols 0
% 4.36/6.30
% 4.36/6.30 % ------ Schedule dynamic 5 is on
% 4.36/6.30
% 4.36/6.30 % ------ no conjectures: strip conj schedule
% 4.36/6.30
% 4.36/6.30 % ------ no equalities: superposition off
% 4.36/6.30
% 4.36/6.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 4.36/6.30
% 4.36/6.30
% 4.36/6.30 % ------
% 4.36/6.30 % Current options:
% 4.36/6.30 % ------
% 4.36/6.30
% 4.36/6.30
% 4.36/6.30 %
% 4.36/6.30
% 4.36/6.30 % ------ Proving...
% 4.36/6.30 %
% 4.36/6.30
% 4.36/6.30 % SZS status Theorem for theBenchmark.p
% 4.36/6.30
% 4.36/6.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.36/6.30
% 4.36/6.30
%------------------------------------------------------------------------------