%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET588+3 : 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 : n001.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:28 PM UTC 2026
% Result : Theorem 2.58s 6.30s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 43 ( 10 unt; 2 def)
% Number of atoms : 134 ( 2 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 109 ( 44 ~; 46 |; 13 &)
% ( 3 <=>; 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 72 !; 5 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f4,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(difference(X0,X2),difference(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_subset1) ).
fof(f5,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(difference(X0,X2),difference(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f7,plain,
? [X0,X1,X2] :
( subset(X0,X1)
& ~ subset(difference(X0,X2),difference(X1,X2)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f8,plain,
! [X0,X1,X2] :
( ( ~ member(X2,difference(X0,X1))
| ( ~ member(X2,X1)
& member(X2,X0) ) )
& ( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f9,plain,
! [X0,X1,X2] :
( ( ~ member(X2,difference(X0,X1))
| ( ~ member(X2,X1)
& member(X2,X0) ) )
& ( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f8]) ).
fof(f10,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,[],[f6]) ).
fof(f11,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,[],[f10]) ).
fof(f12,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))],[f11]) ).
fof(f13,plain,
( subset(sK1,sK2)
& ~ subset(difference(sK1,sK3),difference(sK2,sK3)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f7]) ).
fof(f14,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f15,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f9]) ).
fof(f16,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f9]) ).
fof(f17,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f19,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f21,plain,
subset(sK1,sK2),
inference(cnf_transformation,[],[f13]) ).
fof(f22,plain,
~ subset(difference(sK1,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,difference(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[],[f15]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ member(X0,X2)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[],[f14]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f19]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f18]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| ~ subset(X1,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f17]) ).
tcf(c_56,negated_conjecture,
~ subset(difference(sK1,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f22]) ).
tcf(c_57,negated_conjecture,
subset(sK1,sK2),
inference(cnf_transformation,[],[f21]) ).
tcf(c_142,definition,
iPr_def_10 = difference(sK1,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_143,definition,
iPr_def_11 = difference(sK2,sK3),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_144,negated_conjecture,
subset(sK1,sK2),
inference(demodulation,[status(thm)],[c_57]) ).
tcf(c_145,negated_conjecture,
~ subset(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_56,c_143,c_142]) ).
tcf(c_300,plain,
! [X0: $i] :
( member(X0,sK1)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_142,c_50]) ).
tcf(c_315,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),sK1) ),
inference(superposition,[status(thm)],[c_53,c_300]) ).
tcf(c_326,plain,
! [X0: $i] :
( member(X0,iPr_def_11)
| member(X0,sK3)
| ~ member(X0,sK2) ),
inference(superposition,[status(thm)],[c_143,c_49]) ).
tcf(c_351,plain,
! [X0: $i] :
( ~ member(X0,iPr_def_10)
| ~ member(X0,sK3) ),
inference(superposition,[status(thm)],[c_142,c_51]) ).
tcf(c_389,plain,
! [X0: $i,X1: $i] :
( subset(iPr_def_10,X1)
| member(sK0(iPr_def_10,X1),X0)
| ~ subset(sK1,X0) ),
inference(superposition,[status(thm)],[c_315,c_54]) ).
tcf(c_398,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ member(sK0(iPr_def_10,X0),sK3) ),
inference(superposition,[status(thm)],[c_53,c_351]) ).
tcf(c_696,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),iPr_def_11)
| member(sK0(iPr_def_10,X0),sK3)
| ~ subset(sK1,sK2) ),
inference(superposition,[status(thm)],[c_389,c_326]) ).
tcf(c_730,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),iPr_def_11)
| member(sK0(iPr_def_10,X0),sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_696,c_144]) ).
tcf(c_877,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK0(iPr_def_10,X0),iPr_def_11) ),
inference(global_subsumption_just,[status(thm)],[c_730,c_398,c_730]) ).
tcf(c_884,plain,
subset(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_877,c_52]) ).
tcf(c_888,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_884,c_145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET588+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.39 % Computer : n001.cluster.edu
% 0.10/5.39 % Model : x86_64 x86_64
% 0.10/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39 % Memory : 8046.5625MB
% 0.10/5.39 % OS : Linux 6.8.0-71-generic
% 0.10/5.39 % CPULimit : 300
% 0.10/5.39 % WCLimit : 300
% 0.10/5.39 % DateTime : Thu Sep 24 11:27:43 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.43 Running first-order theorem proving
% 0.14/5.43 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.14/5.44
% 0.14/5.44 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.44
% 0.14/5.44 % Detected problem language: tptp
% 0.14/5.46 % Proving...
% 2.58/6.30 % SZS status Started for theBenchmark.p
% 2.58/6.30 % SZS status Theorem for theBenchmark.p
% 2.58/6.30
% 2.58/6.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.58/6.30
% 2.58/6.30 % ------ iProver source info
% 2.58/6.30
% 2.58/6.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.58/6.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.58/6.30 % git: non_committed_changes: false
% 2.58/6.30
% 2.58/6.30 % ------ Parsing...
% 2.58/6.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.58/6.30
% 2.58/6.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.58/6.30
% 2.58/6.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.58/6.30
% 2.58/6.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.58/6.30 % ------ Proving...
% 2.58/6.30 % ------ Problem Properties
% 2.58/6.30
% 2.58/6.30 %
% 2.58/6.30 % clauses 11
% 2.58/6.30 % conjectures 2
% 2.58/6.30 % EPR 4
% 2.58/6.30 % Horn 9
% 2.58/6.30 % unary 5
% 2.58/6.30 % binary 4
% 2.58/6.30 % lits 19
% 2.58/6.30 % lits eq 2
% 2.58/6.30 % fd_pure 0
% 2.58/6.31 % fd_pseudo 0
% 2.58/6.31 % fd_cond 0
% 2.58/6.31 % fd_pseudo_cond 0
% 2.58/6.31 % AC symbols 0
% 2.58/6.31
% 2.58/6.31 % ------ Schedule dynamic 5 is on
% 2.58/6.31
% 2.58/6.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.58/6.31
% 2.58/6.31
% 2.58/6.31 % ------
% 2.58/6.31 % Current options:
% 2.58/6.31 % ------
% 2.58/6.31
% 2.58/6.31
% 2.58/6.31 %
% 2.58/6.31
% 2.58/6.31 % ------ Proving...
% 2.58/6.31 %
% 2.58/6.31
% 2.58/6.31 % SZS status Theorem for theBenchmark.p
% 2.58/6.31
% 2.58/6.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.58/6.31
% 2.58/6.31
%------------------------------------------------------------------------------