%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET045+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:14 PM UTC 2026
% Result : Theorem 1.48s 1.27s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 49 ( 23 ~; 18 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn 27 !; 6 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
( element(X2,X1)
<=> ( ~ element(X2,X2)
& element(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41_1) ).
fof(f2,conjecture,
~ ? [X0] :
! [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel41) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
! [X1] : element(X1,X0),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
? [X0] :
! [X1] : element(X1,X0),
inference(flattening,[],[f3]) ).
fof(f5,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ element(X2,X1)
| ( ~ element(X2,X2)
& element(X2,X0) ) )
& ( element(X2,X2)
| ~ element(X2,X0)
| element(X2,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f6,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ element(X2,X1)
| ( ~ element(X2,X2)
& element(X2,X0) ) )
& ( element(X2,X2)
| ~ element(X2,X0)
| element(X2,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f7,plain,
! [X0,X2] :
( ( ~ element(X2,sK0(X0))
| ( ~ element(X2,X2)
& element(X2,X0) ) )
& ( element(X2,X2)
| ~ element(X2,X0)
| element(X2,sK0(X0)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f6]) ).
fof(f8,plain,
! [X1] : element(X1,sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f4]) ).
fof(f9,plain,
! [X2,X0] :
( ~ element(X2,sK0(X0))
| ~ element(X2,X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f11,plain,
! [X2,X0] :
( element(X2,X2)
| ~ element(X2,X0)
| element(X2,sK0(X0)) ),
inference(cnf_transformation,[],[f7]) ).
fof(f12,plain,
! [X1] : element(X1,sK1),
inference(cnf_transformation,[],[f8]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] :
( element(X0,X0)
| element(X0,sK0(X1))
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f11]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i] :
( ~ element(X0,X0)
| ~ element(X0,sK0(X1)) ),
inference(cnf_transformation,[],[f9]) ).
tcf(c_52,negated_conjecture,
! [X0: $i] : element(X0,sK1),
inference(cnf_transformation,[],[f12]) ).
tcf(c_71,negated_conjecture,
! [X0: $i] : element(X0,sK1),
inference(demodulation,[status(thm)],[c_52]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( element(sK0(X0),sK0(X1))
| element(sK0(X0),sK0(X0))
| ~ element(sK0(X0),X1) ),
inference(instantiation,[status(thm)],[c_49]) ).
tcf(c_75,plain,
! [X0: $i] : ~ element(sK0(X0),sK0(X0)),
inference(instantiation,[status(thm)],[c_51]) ).
tcf(c_76,plain,
( element(sK0(sK1),sK0(sK1))
| ~ element(sK0(sK1),sK1) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_77,plain,
~ element(sK0(sK1),sK0(sK1)),
inference(instantiation,[status(thm)],[c_75]) ).
tcf(c_86,plain,
! [X0: $i] : element(sK0(X0),sK1),
inference(instantiation,[status(thm)],[c_71]) ).
tcf(c_87,plain,
element(sK0(sK1),sK1),
inference(instantiation,[status(thm)],[c_86]) ).
tcf(c_88,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_87,c_77,c_76]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET045+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 09:25:11 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.43 % Proving...
% 1.48/1.27 % SZS status Started for theBenchmark.p
% 1.48/1.27 % SZS status Theorem for theBenchmark.p
% 1.48/1.27
% 1.48/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.27
% 1.48/1.27 % ------ iProver source info
% 1.48/1.27
% 1.48/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.27 % git: non_committed_changes: false
% 1.48/1.27
% 1.48/1.27 % ------ Parsing...
% 1.48/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.48/1.27
% 1.48/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.48/1.27
% 1.48/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.48/1.27 % ------ Proving...
% 1.48/1.27 % ------ Problem Properties
% 1.48/1.27
% 1.48/1.27 %
% 1.48/1.27 % clauses 4
% 1.48/1.27 % conjectures 1
% 1.48/1.27 % EPR 1
% 1.48/1.27 % Horn 3
% 1.48/1.27 % unary 1
% 1.48/1.27 % binary 2
% 1.48/1.27 % lits 8
% 1.48/1.27 % lits eq 0
% 1.48/1.27 % fd_pure 0
% 1.48/1.27 % fd_pseudo 0
% 1.48/1.27 % fd_cond 0
% 1.48/1.27 % fd_pseudo_cond 0
% 1.48/1.27 % AC symbols 0
% 1.48/1.27
% 1.48/1.27 % ------ Schedule dynamic 5 is on
% 1.48/1.27
% 1.48/1.27 % ------ no equalities: superposition off
% 1.48/1.27
% 1.48/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.48/1.27
% 1.48/1.27
% 1.48/1.27 % ------
% 1.48/1.27 % Current options:
% 1.48/1.27 % ------
% 1.48/1.27
% 1.48/1.27
% 1.48/1.27 %
% 1.48/1.27
% 1.48/1.27 % ------ Proving...
% 1.48/1.27 %
% 1.48/1.27
% 1.48/1.27 % SZS status Theorem for theBenchmark.p
% 1.48/1.27
% 1.48/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.27
% 1.48/1.27
%------------------------------------------------------------------------------