%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET014+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 : n014.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:02 PM UTC 2026
% Result : Theorem 4.23s 1.26s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 58 ( 3 unt; 0 def)
% Number of atoms : 170 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 184 ( 72 ~; 86 |; 19 &)
% ( 5 <=>; 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 84 !; 11 ?; 38 :)
% 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(f5,axiom,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).
fof(f12,conjecture,
! [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X0) )
<=> subset(union(X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI45) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X0) )
<=> subset(union(X1,X2),X0) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
? [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X0) )
<~> subset(union(X1,X2),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,X2] :
( ( ( subset(X2,X0)
& subset(X1,X0) )
| subset(union(X1,X2),X0) )
& ( ~ subset(X2,X0)
| ~ subset(X1,X0)
| ~ subset(union(X1,X2),X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f17,plain,
? [X0,X1,X2] :
( ( ( subset(X2,X0)
& subset(X1,X0) )
| subset(union(X1,X2),X0) )
& ( ~ subset(X2,X0)
| ~ subset(X1,X0)
| ~ subset(union(X1,X2),X0) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
( ( ( subset(sK2,sK0)
& subset(sK1,sK0) )
| subset(union(sK1,sK2),sK0) )
& ( ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| ~ subset(union(sK1,sK2),sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).
fof(f19,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(f20,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,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK3(X0,X1),X0)
& ~ member(sK3(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f20]) ).
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(nnf_transformation,[],[f5]) ).
fof(f23,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,[],[f22]) ).
fof(f24,plain,
( subset(sK2,sK0)
| subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f25,plain,
( subset(sK1,sK0)
| subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
( ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| ~ subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f28,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f29,plain,
! [X0,X1] :
( ~ member(sK3(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X2)
| member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X0,X2)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_49,negated_conjecture,
( ~ subset(sK2,sK0)
| ~ subset(sK1,sK0)
| ~ subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,negated_conjecture,
( subset(sK1,sK0)
| subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_51,negated_conjecture,
( subset(sK2,sK0)
| subset(union(sK1,sK2),sK0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f28]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_104,plain,
( subset(sK1,sK0)
| ~ member(sK3(sK1,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_106,plain,
( subset(sK2,sK0)
| member(sK3(sK2,sK0),sK2) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_107,plain,
( subset(sK2,sK0)
| ~ member(sK3(sK2,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_110,plain,
! [X0: $i] :
( member(sK3(sK2,sK0),union(X0,sK2))
| ~ member(sK3(sK2,sK0),sK2) ),
inference(instantiation,[status(thm)],[c_56]) ).
tcf(c_114,plain,
( subset(union(sK1,sK2),sK0)
| member(sK3(union(sK1,sK2),sK0),union(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_53]) ).
tcf(c_115,plain,
( subset(union(sK1,sK2),sK0)
| ~ member(sK3(union(sK1,sK2),sK0),sK0) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_122,plain,
( member(sK3(union(sK1,sK2),sK0),sK2)
| member(sK3(union(sK1,sK2),sK0),sK1)
| ~ member(sK3(union(sK1,sK2),sK0),union(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_57]) ).
tcf(c_226,plain,
! [X0: $i,X1: $i] :
( member(sK3(sK2,sK0),X1)
| ~ subset(union(X0,sK2),X1)
| ~ member(sK3(sK2,sK0),union(X0,sK2)) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_297,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X3,X2)
| ~ member(X3,X0)
| ~ subset(union(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_315,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X3,X2)
| ~ member(X3,X0)
| ~ subset(union(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_55,c_54]) ).
tcf(c_316,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( member(X3,X2)
| ~ member(X3,X1)
| ~ subset(union(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_56,c_54]) ).
tcf(c_383,plain,
! [X0: $i] :
( member(sK3(union(sK1,sK2),sK0),X0)
| ~ subset(sK1,X0)
| ~ member(sK3(union(sK1,sK2),sK0),sK1) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_384,plain,
( member(sK3(union(sK1,sK2),sK0),sK0)
| ~ subset(sK1,sK0)
| ~ member(sK3(union(sK1,sK2),sK0),sK1) ),
inference(instantiation,[status(thm)],[c_383]) ).
tcf(c_520,plain,
( member(sK3(sK2,sK0),sK0)
| ~ subset(union(sK1,sK2),sK0)
| ~ member(sK3(sK2,sK0),union(sK1,sK2)) ),
inference(instantiation,[status(thm)],[c_226]) ).
tcf(c_659,plain,
! [X0: $i] :
( subset(sK1,sK0)
| member(X0,sK0)
| ~ member(X0,sK1) ),
inference(superposition,[status(thm)],[c_50,c_297]) ).
tcf(c_692,plain,
! [X0: $i] :
( subset(sK1,sK0)
| member(X0,sK0)
| ~ member(X0,sK1) ),
inference(superposition,[status(thm)],[c_50,c_315]) ).
tcf(c_856,plain,
! [X0: $i] :
( member(X0,sK0)
| ~ member(X0,sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_659,c_54]) ).
tcf(c_863,plain,
! [X0: $i] :
( subset(sK1,X0)
| member(sK3(sK1,X0),sK0) ),
inference(superposition,[status(thm)],[c_53,c_856]) ).
tcf(c_870,plain,
( subset(sK1,sK0)
| member(sK3(sK1,sK0),sK0) ),
inference(instantiation,[status(thm)],[c_863]) ).
tcf(c_871,plain,
subset(sK1,sK0),
inference(global_subsumption_just,[status(thm)],[c_692,c_104,c_870]) ).
tcf(c_1017,plain,
( member(sK3(sK2,sK0),union(sK1,sK2))
| ~ member(sK3(sK2,sK0),sK2) ),
inference(instantiation,[status(thm)],[c_110]) ).
tcf(c_1330,plain,
! [X0: $i] :
( subset(sK2,sK0)
| member(X0,sK0)
| ~ member(X0,sK2) ),
inference(superposition,[status(thm)],[c_51,c_316]) ).
tcf(c_1436,plain,
subset(sK2,sK0),
inference(global_subsumption_just,[status(thm)],[c_1330,c_51,c_107,c_106,c_520,c_1017]) ).
tcf(c_2059,plain,
! [X0: $i] :
( member(sK3(union(sK1,sK2),sK0),X0)
| ~ subset(sK2,X0)
| ~ member(sK3(union(sK1,sK2),sK0),sK2) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_2060,plain,
( member(sK3(union(sK1,sK2),sK0),sK0)
| ~ subset(sK2,sK0)
| ~ member(sK3(union(sK1,sK2),sK0),sK2) ),
inference(instantiation,[status(thm)],[c_2059]) ).
tcf(c_2061,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2060,c_1436,c_871,c_384,c_122,c_114,c_115,c_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET014+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.34 % Computer : n014.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Thu Sep 24 09:10:04 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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.13/0.39
% 0.13/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.39
% 0.13/0.40 % Detected problem language: tptp
% 0.13/0.41 % Proving...
% 4.23/1.26 % SZS status Started for theBenchmark.p
% 4.23/1.26 % SZS status Theorem for theBenchmark.p
% 4.23/1.26
% 4.23/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.23/1.26
% 4.23/1.26 % ------ iProver source info
% 4.23/1.26
% 4.23/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 4.23/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.23/1.26 % git: non_committed_changes: false
% 4.23/1.26
% 4.23/1.26 % ------ Parsing...
% 4.23/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.23/1.26
% 4.23/1.26 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 4.23/1.26
% 4.23/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.23/1.26 % ------ Proving...
% 4.23/1.26 % ------ Problem Properties
% 4.23/1.26
% 4.23/1.26 %
% 4.23/1.26 % clauses 9
% 4.23/1.26 % conjectures 3
% 4.23/1.26 % EPR 1
% 4.23/1.26 % Horn 5
% 4.23/1.26 % unary 0
% 4.23/1.26 % binary 6
% 4.23/1.26 % lits 21
% 4.23/1.26 % lits eq 0
% 4.23/1.26 % fd_pure 0
% 4.23/1.26 % fd_pseudo 0
% 4.23/1.26 % fd_cond 0
% 4.23/1.26 % fd_pseudo_cond 0
% 4.23/1.26 % AC symbols 0
% 4.23/1.26
% 4.23/1.26 % ------ Schedule dynamic 5 is on
% 4.23/1.26
% 4.23/1.26 % ------ no equalities: superposition off
% 4.23/1.26
% 4.23/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.23/1.26
% 4.23/1.26
% 4.23/1.26 % ------
% 4.23/1.26 % Current options:
% 4.23/1.26 % ------
% 4.23/1.26
% 4.23/1.26
% 4.23/1.26 %
% 4.23/1.26
% 4.23/1.26 % ------ Proving...
% 4.23/1.26 %
% 4.23/1.26
% 4.23/1.26 % SZS status Theorem for theBenchmark.p
% 4.23/1.26
% 4.23/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.23/1.26
% 4.23/1.26
%------------------------------------------------------------------------------