%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:49:04 PM UTC 2026
% Result : Theorem 1.43s 6.19s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 10 unt; 2 def)
% Number of atoms : 56 ( 2 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 45 ( 19 ~; 17 |; 6 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 24 !; 6 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t40_zfmisc_1) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( subset(X0,X1)
=> ( subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l3_zfmisc_1) ).
fof(f10,plain,
? [X0,X1,X2] :
( subset(X0,X1)
& ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f11,plain,
? [X0,X1,X2] :
( subset(X0,X1)
& ~ subset(X0,set_difference(X1,singleton(X2)))
& ~ in(X2,X0) ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ),
inference(flattening,[],[f12]) ).
fof(f16,plain,
( subset(sK2,sK3)
& ~ subset(sK2,set_difference(sK3,singleton(sK4)))
& ~ in(sK4,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4)],[f11]) ).
fof(f21,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f16]) ).
fof(f22,plain,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f16]) ).
fof(f23,plain,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f16]) ).
fof(f24,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| subset(X0,set_difference(X1,singleton(X2)))
| in(X2,X0) ),
inference(cnf_transformation,[],[f13]) ).
tcf(c_53,negated_conjecture,
~ in(sK4,sK2),
inference(cnf_transformation,[],[f23]) ).
tcf(c_54,negated_conjecture,
~ subset(sK2,set_difference(sK3,singleton(sK4))),
inference(cnf_transformation,[],[f22]) ).
tcf(c_55,negated_conjecture,
subset(sK2,sK3),
inference(cnf_transformation,[],[f21]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( in(X2,X0)
| subset(X0,set_difference(X1,singleton(X2)))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_100,definition,
iPr_def_10 = singleton(sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_101,definition,
iPr_def_11 = set_difference(sK3,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_103,negated_conjecture,
~ subset(sK2,iPr_def_11),
inference(demodulation,[status(thm)],[c_54,c_100,c_101]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] :
( in(sK4,X0)
| subset(X0,set_difference(X1,iPr_def_10))
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_100,c_56]) ).
tcf(c_249,plain,
! [X0: $i] :
( in(sK4,X0)
| subset(X0,iPr_def_11)
| ~ subset(X0,sK3) ),
inference(superposition,[status(thm)],[c_101,c_238]) ).
tcf(c_253,plain,
( in(sK4,sK2)
| subset(sK2,iPr_def_11)
| ~ subset(sK2,sK3) ),
inference(instantiation,[status(thm)],[c_249]) ).
tcf(c_254,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_253,c_103,c_53,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET899+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/5.38 % Computer : n015.cluster.edu
% 0.11/5.38 % Model : x86_64 x86_64
% 0.11/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38 % Memory : 8046.5625MB
% 0.11/5.38 % OS : Linux 6.8.0-71-generic
% 0.11/5.38 % CPULimit : 300
% 0.11/5.38 % WCLimit : 300
% 0.11/5.38 % DateTime : Thu Sep 24 12:24:16 UTC 2026
% 0.11/5.38 % CPUTime :
% 0.11/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.45 % Proving...
% 1.43/6.19 % SZS status Started for theBenchmark.p
% 1.43/6.19 % SZS status Theorem for theBenchmark.p
% 1.43/6.19
% 1.43/6.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.43/6.19
% 1.43/6.19 % ------ iProver source info
% 1.43/6.19
% 1.43/6.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.43/6.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.43/6.19 % git: non_committed_changes: false
% 1.43/6.19
% 1.43/6.19 % ------ Parsing...
% 1.43/6.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.43/6.19
% 1.43/6.19 % ------ Preprocessing... sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.43/6.19
% 1.43/6.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.43/6.19
% 1.43/6.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.43/6.19 % ------ Proving...
% 1.43/6.19 % ------ Problem Properties
% 1.43/6.19
% 1.43/6.19 %
% 1.43/6.19 % clauses 8
% 1.43/6.19 % conjectures 3
% 1.43/6.19 % EPR 5
% 1.43/6.19 % Horn 7
% 1.43/6.19 % unary 6
% 1.43/6.19 % binary 1
% 1.43/6.19 % lits 11
% 1.43/6.19 % lits eq 2
% 1.43/6.19 % fd_pure 0
% 1.43/6.19 % fd_pseudo 0
% 1.43/6.19 % fd_cond 0
% 1.43/6.19 % fd_pseudo_cond 0
% 1.43/6.19 % AC symbols 0
% 1.43/6.19
% 1.43/6.19 % ------ Schedule dynamic 5 is on
% 1.43/6.19
% 1.43/6.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.43/6.19
% 1.43/6.19
% 1.43/6.19 % ------
% 1.43/6.19 % Current options:
% 1.43/6.19 % ------
% 1.43/6.19
% 1.43/6.19
% 1.43/6.19 %
% 1.43/6.19
% 1.43/6.19 % ------ Proving...
% 1.43/6.19 %
% 1.43/6.19
% 1.43/6.19 % SZS status Theorem for theBenchmark.p
% 1.43/6.19
% 1.43/6.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.43/6.19
% 1.43/6.19
%------------------------------------------------------------------------------