%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM614+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n012.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:26:14 PM UTC 2026
% Result : Theorem 8.18s 1.51s
% Output : CNFRefutation 8.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 16 unt; 0 def)
% Number of atoms : 143 ( 37 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 183 ( 72 ~; 71 |; 33 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 41 !; 3 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aSet0(X0) )
=> ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSel) ).
fof(f80,axiom,
( szszuzczcdt0(xk) = xK
& aElementOf0(xk,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3533) ).
fof(f96,axiom,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4908) ).
fof(f108,axiom,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5208) ).
fof(f109,axiom,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5217) ).
fof(f110,conjecture,
aElementOf0(xP,slbdtsldtrb0(xO,xk)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f111,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(negated_conjecture,[status(cth)],[f110]) ).
fof(f119,plain,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(flattening,[],[f111]) ).
fof(f194,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) ) ),
inference(ennf_transformation,[],[f57]) ).
fof(f195,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( X2 = slbdtsldtrb0(X0,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
<=> ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& aSet0(X2) ) ) ),
inference(flattening,[],[f194]) ).
fof(f290,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( ( slbdtsldtrb0(X0,X1) != X2
| ( ! [X3] :
( ( ~ aElementOf0(X3,X2)
| ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| aElementOf0(X3,X2) ) )
& aSet0(X2) ) )
& ( ? [X3] :
( ( aElementOf0(X3,X2)
| ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& ( ~ aElementOf0(X3,X2)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0) ) )
| ~ aSet0(X2)
| X2 = slbdtsldtrb0(X0,X1) ) ) ),
inference(nnf_transformation,[],[f195]) ).
fof(f291,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( ( slbdtsldtrb0(X0,X1) != X2
| ( ! [X3] :
( ( ~ aElementOf0(X3,X2)
| ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& ( sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0)
| aElementOf0(X3,X2) ) )
& aSet0(X2) ) )
& ( ? [X3] :
( ( aElementOf0(X3,X2)
| ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& ( ~ aElementOf0(X3,X2)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0) ) )
| ~ aSet0(X2)
| X2 = slbdtsldtrb0(X0,X1) ) ) ),
inference(flattening,[],[f290]) ).
fof(f292,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( ( slbdtsldtrb0(X0,X1) != X2
| ( ! [X4] :
( ( ~ aElementOf0(X4,X2)
| ( sbrdtbr0(X4) = X1
& aSubsetOf0(X4,X0) ) )
& ( sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X0)
| aElementOf0(X4,X2) ) )
& aSet0(X2) ) )
& ( ? [X3] :
( ( aElementOf0(X3,X2)
| ( sbrdtbr0(X3) = X1
& aSubsetOf0(X3,X0) ) )
& ( ~ aElementOf0(X3,X2)
| sbrdtbr0(X3) != X1
| ~ aSubsetOf0(X3,X0) ) )
| ~ aSet0(X2)
| X2 = slbdtsldtrb0(X0,X1) ) ) ),
inference(rectify,[],[f291]) ).
fof(f293,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| ! [X2] :
( ( slbdtsldtrb0(X0,X1) != X2
| ( ! [X4] :
( ( ~ aElementOf0(X4,X2)
| ( sbrdtbr0(X4) = X1
& aSubsetOf0(X4,X0) ) )
& ( sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X0)
| aElementOf0(X4,X2) ) )
& aSet0(X2) ) )
& ( ( ( aElementOf0(sK14(X0,X1,X2),X2)
| ( sbrdtbr0(sK14(X0,X1,X2)) = X1
& aSubsetOf0(sK14(X0,X1,X2),X0) ) )
& ( ~ aElementOf0(sK14(X0,X1,X2),X2)
| sbrdtbr0(sK14(X0,X1,X2)) != X1
| ~ aSubsetOf0(sK14(X0,X1,X2),X0) ) )
| ~ aSet0(X2)
| X2 = slbdtsldtrb0(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X3,sK14(X0,X1,X2))],[f292]) ).
fof(f414,plain,
! [X2,X0,X1,X4] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aSet0(X0)
| slbdtsldtrb0(X0,X1) != X2
| sbrdtbr0(X4) != X1
| ~ aSubsetOf0(X4,X0)
| aElementOf0(X4,X2) ),
inference(cnf_transformation,[],[f293]) ).
fof(f470,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f80]) ).
fof(f506,plain,
aSet0(xO),
inference(cnf_transformation,[],[f96]) ).
fof(f522,plain,
aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f108]) ).
fof(f523,plain,
xk = sbrdtbr0(xP),
inference(cnf_transformation,[],[f109]) ).
fof(f524,plain,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(cnf_transformation,[],[f119]) ).
fof(f543,plain,
! [X2,X0,X4] :
( ~ aElementOf0(sbrdtbr0(X4),szNzAzT0)
| ~ aSet0(X0)
| slbdtsldtrb0(X0,sbrdtbr0(X4)) != X2
| ~ aSubsetOf0(X4,X0)
| aElementOf0(X4,X2) ),
inference(equality_resolution,[],[f414]) ).
fof(f544,plain,
! [X0,X4] :
( ~ aElementOf0(sbrdtbr0(X4),szNzAzT0)
| ~ aSet0(X0)
| ~ aSubsetOf0(X4,X0)
| aElementOf0(X4,slbdtsldtrb0(X0,sbrdtbr0(X4))) ),
inference(equality_resolution,[],[f543]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] :
( aElementOf0(X0,slbdtsldtrb0(X1,sbrdtbr0(X0)))
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1)
| ~ aElementOf0(sbrdtbr0(X0),szNzAzT0) ),
inference(cnf_transformation,[],[f544]) ).
tcf(c_206,plain,
aElementOf0(xk,szNzAzT0),
inference(cnf_transformation,[],[f470]) ).
tcf(c_242,plain,
aSet0(xO),
inference(cnf_transformation,[],[f506]) ).
tcf(c_259,plain,
aSubsetOf0(xP,xO),
inference(cnf_transformation,[],[f522]) ).
tcf(c_260,plain,
sbrdtbr0(xP) = xk,
inference(cnf_transformation,[],[f523]) ).
tcf(c_261,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
inference(cnf_transformation,[],[f524]) ).
tcf(c_8331,plain,
! [X0: $i] :
( aElementOf0(xP,slbdtsldtrb0(X0,xk))
| ~ aSet0(X0)
| ~ aSubsetOf0(xP,X0)
| ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
inference(superposition,[status(thm)],[c_260,c_153]) ).
tcf(c_8339,plain,
! [X0: $i] :
( aElementOf0(xP,slbdtsldtrb0(X0,xk))
| ~ aSet0(X0)
| ~ aElementOf0(xk,szNzAzT0)
| ~ aSubsetOf0(xP,X0) ),
inference(light_normalisation,[status(thm)],[c_8331,c_260]) ).
tcf(c_8643,plain,
( ~ aSet0(xO)
| ~ aSubsetOf0(xP,xO)
| ~ aElementOf0(xk,szNzAzT0) ),
inference(superposition,[status(thm)],[c_8339,c_261]) ).
tcf(c_8644,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_8643,c_206,c_259,c_242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM614+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Thu Sep 24 04:55:20 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.04/0.32 Running first-order theorem proving
% 0.04/0.32 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.04/0.32
% 0.04/0.32 % ======== iProver multi-core TPTP/SMT =========
% 0.04/0.32
% 0.04/0.32 % Detected problem language: tptp
% 0.07/0.33 % Proving...
% 8.18/1.51 % SZS status Started for theBenchmark.p
% 8.18/1.51 % SZS status Theorem for theBenchmark.p
% 8.18/1.51
% 8.18/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 8.18/1.51
% 8.18/1.51 % ------ iProver source info
% 8.18/1.51
% 8.18/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 8.18/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 8.18/1.51 % git: non_committed_changes: false
% 8.18/1.51
% 8.18/1.51 % ------ Parsing...
% 8.18/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 8.18/1.51
% 8.18/1.51 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e %
% 8.18/1.51
% 8.18/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 8.18/1.51
% 8.18/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e
% 8.18/1.51 % ------ Proving...
% 8.18/1.51 % ------ Problem Properties
% 8.18/1.51
% 8.18/1.51 %
% 8.18/1.51 % clauses 208
% 8.18/1.51 % conjectures 1
% 8.18/1.51 % EPR 52
% 8.18/1.51 % Horn 169
% 8.18/1.51 % unary 50
% 8.18/1.51 % binary 32
% 8.18/1.51 % lits 663
% 8.18/1.51 % lits eq 107
% 8.18/1.51 % fd_pure 0
% 8.18/1.51 % fd_pseudo 0
% 8.18/1.51 % fd_cond 10
% 8.18/1.51 % fd_pseudo_cond 25
% 8.18/1.51 % AC symbols 0
% 8.18/1.51
% 8.18/1.51 % ------ Input Options Time Limit: Unbounded
% 8.18/1.51
% 8.18/1.51
% 8.18/1.51 % ------
% 8.18/1.51 % Current options:
% 8.18/1.51 % ------
% 8.18/1.51
% 8.18/1.51
% 8.18/1.51 %
% 8.18/1.51
% 8.18/1.51 % ------ Proving...
% 8.18/1.51 %
% 8.18/1.51
% 8.18/1.51 % SZS status Theorem for theBenchmark.p
% 8.18/1.51
% 8.18/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.18/1.52
% 8.18/1.52
%------------------------------------------------------------------------------