%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET200+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 : n002.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:55 PM UTC 2026
% Result : Theorem 2.87s 1.09s
% Output : CNFRefutation 2.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 106 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 111 ( 47 ~; 40 |; 18 &)
% ( 3 <=>; 3 =>; 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 78 ( 0 sgn 68 !; 10 ?; 20 :)
% 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(f6,conjecture,
! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(union(X0,X2),union(X1,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th34) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( subset(X2,X3)
& subset(X0,X1) )
=> subset(union(X0,X2),union(X1,X3)) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f9,plain,
? [X0,X1,X2,X3] :
( subset(X2,X3)
& subset(X0,X1)
& ~ subset(union(X0,X2),union(X1,X3)) ),
inference(ennf_transformation,[],[f7]) ).
fof(f10,plain,
? [X0,X1,X2,X3] :
( subset(X2,X3)
& subset(X0,X1)
& ~ subset(union(X0,X2),union(X1,X3)) ),
inference(flattening,[],[f9]) ).
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,[],[f8]) ).
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(f19,plain,
( subset(sK4,sK5)
& subset(sK2,sK3)
& ~ subset(union(sK2,sK4),union(sK3,sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f10]) ).
fof(f20,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X1)
| member(X2,X0) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
fof(f22,plain,
! [X2,X0,X1] :
( ~ member(X2,X0)
| member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f24,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f32,plain,
subset(sK4,sK5),
inference(cnf_transformation,[],[f19]) ).
fof(f33,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f19]) ).
fof(f34,plain,
~ subset(union(sK2,sK4),union(sK3,sK5)),
inference(cnf_transformation,[],[f19]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f22]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,union(X2,X1))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f20]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subset(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_59,negated_conjecture,
~ subset(union(sK2,sK4),union(sK3,sK5)),
inference(cnf_transformation,[],[f34]) ).
tcf(c_60,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f33]) ).
tcf(c_61,negated_conjecture,
subset(sK4,sK5),
inference(cnf_transformation,[],[f32]) ).
tcf(c_166,plain,
! [X0: $i,X1: $i] :
( member(sK0(X0,X1),X0)
| ( union(sK3,sK5) != X1 )
| ( union(sK2,sK4) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_59]) ).
tcf(c_167,plain,
member(sK0(union(sK2,sK4),union(sK3,sK5)),union(sK2,sK4)),
inference(unflattening,[status(thm)],[c_166]) ).
tcf(c_394,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),union(sK3,sK5)),
inference(resolution,[status(thm)],[c_52,c_59]) ).
tcf(c_396,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK3),
inference(resolution,[status(thm)],[c_394,c_49]) ).
tcf(c_397,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK5),
inference(resolution,[status(thm)],[c_394,c_50]) ).
tcf(c_439,plain,
( member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4)
| member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2)
| ~ member(sK0(union(sK2,sK4),union(sK3,sK5)),union(sK2,sK4)) ),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_692,plain,
! [X0: $i] :
( ~ subset(X0,sK3)
| ~ member(sK0(union(sK2,sK4),union(sK3,sK5)),X0) ),
inference(resolution,[status(thm)],[c_54,c_396]) ).
tcf(c_693,plain,
( ~ subset(sK2,sK3)
| ~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK2) ),
inference(instantiation,[status(thm)],[c_692]) ).
tcf(c_694,plain,
! [X0: $i] :
( ~ subset(X0,sK5)
| ~ member(sK0(union(sK2,sK4),union(sK3,sK5)),X0) ),
inference(resolution,[status(thm)],[c_54,c_397]) ).
tcf(c_1215,plain,
~ member(sK0(union(sK2,sK4),union(sK3,sK5)),sK4),
inference(resolution,[status(thm)],[c_694,c_61]) ).
tcf(c_1216,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1215,c_693,c_439,c_167,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET200+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 10:16:35 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.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...
% 2.87/1.09 % SZS status Started for theBenchmark.p
% 2.87/1.09 % SZS status Theorem for theBenchmark.p
% 2.87/1.09
% 2.87/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.87/1.09
% 2.87/1.09 % ------ iProver source info
% 2.87/1.09
% 2.87/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 2.87/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.87/1.09 % git: non_committed_changes: false
% 2.87/1.09
% 2.87/1.09 % ------ Parsing...
% 2.87/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.87/1.09
% 2.87/1.09 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.87/1.09
% 2.87/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.87/1.09
% 2.87/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.87/1.09 % ------ Proving...
% 2.87/1.09 % ------ Problem Properties
% 2.87/1.09
% 2.87/1.09 %
% 2.87/1.09 % clauses 13
% 2.87/1.09 % conjectures 3
% 2.87/1.09 % EPR 4
% 2.87/1.09 % Horn 10
% 2.87/1.09 % unary 5
% 2.87/1.09 % binary 4
% 2.87/1.09 % lits 25
% 2.87/1.09 % lits eq 3
% 2.87/1.09 % fd_pure 0
% 2.87/1.09 % fd_pseudo 0
% 2.87/1.09 % fd_cond 0
% 2.87/1.09 % fd_pseudo_cond 2
% 2.87/1.09 % AC symbols 0
% 2.87/1.09
% 2.87/1.09 % ------ Input Options Time Limit: Unbounded
% 2.87/1.09
% 2.87/1.09
% 2.87/1.09 % ------
% 2.87/1.09 % Current options:
% 2.87/1.09 % ------
% 2.87/1.09
% 2.87/1.09
% 2.87/1.09 %
% 2.87/1.09
% 2.87/1.09 % ------ Proving...
% 2.87/1.09 %
% 2.87/1.09
% 2.87/1.09 % SZS status Theorem for theBenchmark.p
% 2.87/1.09
% 2.87/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.87/1.09
% 2.87/1.09
%------------------------------------------------------------------------------