%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET603+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 : n017.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:31 PM UTC 2026
% Result : Theorem 2.41s 6.29s
% Output : CNFRefutation 2.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 14 unt; 1 def)
% Number of atoms : 119 ( 16 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 112 ( 47 ~; 44 |; 16 &)
% ( 4 <=>; 1 =>; 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 : 67 ( 0 sgn 64 !; 3 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f3,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f9,conjecture,
! [X0] : difference(X0,empty_set) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th74) ).
fof(f10,negated_conjecture,
~ ! [X0] : difference(X0,empty_set) = X0,
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f13,plain,
? [X0] : difference(X0,empty_set) != X0,
inference(ennf_transformation,[],[f10]) ).
fof(f16,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,[],[f2]) ).
fof(f17,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,[],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f19,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f18]) ).
fof(f23,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,[],[f12]) ).
fof(f24,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,[],[f23]) ).
fof(f25,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))],[f24]) ).
fof(f26,plain,
sK3 != difference(sK3,empty_set),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X0,sK3)],[f13]) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ member(X2,difference(X0,X1))
| member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f31,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ member(X2,X0)
| member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f32,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f3]) ).
fof(f35,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0,X1] :
( member(sK2(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f42,plain,
! [X0,X1] :
( ~ member(sK2(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f44,plain,
sK3 != difference(sK3,empty_set),
inference(cnf_transformation,[],[f26]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X2)
| member(X0,difference(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X0,X1)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[],[f30]) ).
tcf(c_54,plain,
! [X0: $i] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f32]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f42]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_64,negated_conjecture,
difference(sK3,empty_set) != sK3,
inference(cnf_transformation,[],[f44]) ).
tcf(c_323,definition,
iPr_def_10 = difference(sK3,empty_set),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_324,negated_conjecture,
iPr_def_10 != sK3,
inference(demodulation,[status(thm)],[c_64,c_323]) ).
tcf(c_519,plain,
! [X0: $i] :
( member(X0,sK3)
| ~ member(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_323,c_52]) ).
tcf(c_530,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| member(sK2(iPr_def_10,X0),sK3) ),
inference(superposition,[status(thm)],[c_61,c_519]) ).
tcf(c_540,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| member(X0,empty_set)
| ~ member(X0,sK3) ),
inference(superposition,[status(thm)],[c_323,c_51]) ).
tcf(c_542,plain,
! [X0: $i] :
( member(X0,iPr_def_10)
| ~ member(X0,sK3) ),
inference(forward_subsumption_resolution,[status(thm)],[c_540,c_54]) ).
tcf(c_594,plain,
! [X0: $i] :
( subset(sK3,X0)
| member(sK2(sK3,X0),iPr_def_10) ),
inference(superposition,[status(thm)],[c_61,c_542]) ).
tcf(c_603,plain,
subset(iPr_def_10,sK3),
inference(superposition,[status(thm)],[c_530,c_60]) ).
tcf(c_626,plain,
subset(sK3,iPr_def_10),
inference(superposition,[status(thm)],[c_594,c_60]) ).
tcf(c_635,plain,
( ( iPr_def_10 = sK3 )
| ~ subset(iPr_def_10,sK3)
| ~ subset(sK3,iPr_def_10) ),
inference(instantiation,[status(thm)],[c_55]) ).
tcf(c_636,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_635,c_626,c_603,c_324]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET603+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.10/5.37 % Computer : n017.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 11:20:22 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 2.41/6.29 % SZS status Started for theBenchmark.p
% 2.41/6.29 % SZS status Theorem for theBenchmark.p
% 2.41/6.29
% 2.41/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.41/6.29
% 2.41/6.29 % ------ iProver source info
% 2.41/6.29
% 2.41/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.41/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.41/6.29 % git: non_committed_changes: false
% 2.41/6.29
% 2.41/6.29 % ------ Parsing...
% 2.41/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.41/6.29
% 2.41/6.29 % ------ Preprocessing... sup_sim: 0 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 %
% 2.41/6.29
% 2.41/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.41/6.29
% 2.41/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.41/6.29 % ------ Proving...
% 2.41/6.29 % ------ Problem Properties
% 2.41/6.29
% 2.41/6.29 %
% 2.41/6.29 % clauses 15
% 2.41/6.29 % conjectures 1
% 2.41/6.29 % EPR 5
% 2.41/6.29 % Horn 11
% 2.41/6.29 % unary 4
% 2.41/6.29 % binary 4
% 2.41/6.29 % lits 33
% 2.41/6.29 % lits eq 7
% 2.41/6.29 % fd_pure 0
% 2.41/6.29 % fd_pseudo 0
% 2.41/6.29 % fd_cond 0
% 2.41/6.29 % fd_pseudo_cond 5
% 2.41/6.29 % AC symbols 0
% 2.41/6.29
% 2.41/6.29 % ------ Schedule dynamic 5 is on
% 2.41/6.29
% 2.41/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.41/6.29
% 2.41/6.29
% 2.41/6.29 % ------
% 2.41/6.29 % Current options:
% 2.41/6.29 % ------
% 2.41/6.29
% 2.41/6.29
% 2.41/6.29 %
% 2.41/6.29
% 2.41/6.29 % ------ Proving...
% 2.41/6.29 %
% 2.41/6.29
% 2.41/6.29 % SZS status Theorem for theBenchmark.p
% 2.41/6.29
% 2.41/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.41/6.29
% 2.41/6.29
%------------------------------------------------------------------------------