%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET185+3 : 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 : n016.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:52 PM UTC 2026
% Result : Theorem 1.97s 1.48s
% Output : CNFRefutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 12 unt; 1 def)
% Number of atoms : 145 ( 20 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 129 ( 50 ~; 55 |; 17 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 0 sgn 76 !; 4 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f4,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_union) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f10,plain,
? [X0,X1] :
( subset(X0,X1)
& union(X0,X1) != X1 ),
inference(ennf_transformation,[],[f8]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) )
& ( ( ~ member(X2,X1)
& ~ member(X2,X0) )
| member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) )
& ( ( ~ member(X2,X1)
& ~ member(X2,X0) )
| member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f11]) ).
fof(f13,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,[],[f9]) ).
fof(f14,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,[],[f13]) ).
fof(f15,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))],[f14]) ).
fof(f16,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f16]) ).
fof(f21,plain,
( subset(sK2,sK3)
& sK3 != union(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X0,sK2),skolemize(X1,sK3)],[f10]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
fof(f25,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f26,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f27,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f30,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f37,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
fof(f38,plain,
sK3 != union(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f27]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subset(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f31]) ).
tcf(c_62,negated_conjecture,
union(sK2,sK3) != sK3,
inference(cnf_transformation,[],[f38]) ).
tcf(c_63,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f37]) ).
tcf(c_125,plain,
union(sK3,sK2) != sK3,
inference(demodulation,[status(thm)],[c_62,c_58]) ).
tcf(c_280,definition,
iPr_def_10 = union(sK3,sK2),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_281,plain,
iPr_def_10 != sK3,
inference(demodulation,[status(thm)],[c_125,c_280]) ).
tcf(c_473,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,sK3) ),
inference(superposition,[status(thm)],[c_280,c_49]) ).
tcf(c_481,plain,
! [X0: $i] :
( subset(sK3,X0)
| member(sK0(sK3,X0),iPr_def_10) ),
inference(superposition,[status(thm)],[c_53,c_473]) ).
tcf(c_535,plain,
! [X0: $i] :
( member(X0,sK2)
| member(X0,sK3)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_280,c_51]) ).
tcf(c_566,plain,
subset(sK3,iPr_def_10),
inference(superposition,[status(thm)],[c_481,c_52]) ).
tcf(c_603,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),sK2)
| member(sK0(iPr_def_10,X0),sK3) ),
inference(superposition,[status(thm)],[c_53,c_535]) ).
tcf(c_616,plain,
( ( iPr_def_10 = sK3 )
| ~ subset(iPr_def_10,sK3)
| ~ subset(sK3,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_651,plain,
( subset(iPr_def_10,sK3)
| ~ member(sK0(iPr_def_10,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_52]) ).
tcf(c_2269,plain,
! [X0: $i,X1: $i] :
( subset(iPr_def_10,X1)
| member(sK0(iPr_def_10,X1),sK3)
| member(sK0(iPr_def_10,X1),X0)
| ~ subset(sK2,X0) ),
inference(superposition,[status(thm)],[c_603,c_54]) ).
tcf(c_2296,plain,
( subset(iPr_def_10,sK3)
| member(sK0(iPr_def_10,sK3),sK3)
| ~ subset(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_2269]) ).
tcf(c_2297,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2296,c_651,c_616,c_566,c_281,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET185+3 : 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.58 % Computer : n016.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Thu Sep 24 10:15:28 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.61 Running first-order theorem proving
% 0.12/0.61 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.62
% 0.12/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.62
% 0.15/0.63 % Detected problem language: tptp
% 0.15/0.64 % Proving...
% 1.97/1.48 % SZS status Started for theBenchmark.p
% 1.97/1.48 % SZS status Theorem for theBenchmark.p
% 1.97/1.48
% 1.97/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.97/1.48
% 1.97/1.48 % ------ iProver source info
% 1.97/1.48
% 1.97/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 1.97/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.97/1.48 % git: non_committed_changes: false
% 1.97/1.48
% 1.97/1.48 % ------ Parsing...
% 1.97/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.97/1.48
% 1.97/1.48 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.97/1.48
% 1.97/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.97/1.48
% 1.97/1.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.97/1.48 % ------ Proving...
% 1.97/1.48 % ------ Problem Properties
% 1.97/1.48
% 1.97/1.48 %
% 1.97/1.48 % clauses 14
% 1.97/1.48 % conjectures 1
% 1.97/1.48 % EPR 5
% 1.97/1.48 % Horn 11
% 1.97/1.48 % unary 5
% 1.97/1.48 % binary 4
% 1.97/1.48 % lits 28
% 1.97/1.48 % lits eq 6
% 1.97/1.48 % fd_pure 0
% 1.97/1.48 % fd_pseudo 0
% 1.97/1.48 % fd_cond 0
% 1.97/1.48 % fd_pseudo_cond 3
% 1.97/1.48 % AC symbols 0
% 1.97/1.48
% 1.97/1.48 % ------ Schedule dynamic 5 is on
% 1.97/1.48
% 1.97/1.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.97/1.48
% 1.97/1.48
% 1.97/1.48 % ------
% 1.97/1.48 % Current options:
% 1.97/1.48 % ------
% 1.97/1.48
% 1.97/1.48
% 1.97/1.48 %
% 1.97/1.48
% 1.97/1.48 % ------ Proving...
% 1.97/1.48 %
% 1.97/1.48
% 1.97/1.48 % SZS status Theorem for theBenchmark.p
% 1.97/1.48
% 1.97/1.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.97/1.48
% 1.97/1.48
%------------------------------------------------------------------------------