%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM605+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:26:12 PM UTC 2026
% Result : Theorem 4.57s 1.43s
% Output : CNFRefutation 4.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 87 ( 41 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 92 ( 38 ~; 25 |; 23 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn 21 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( X0 = slcrc0
<=> ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f78,axiom,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(f99,axiom,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X0] :
( aElementOf0(X0,xQ)
=> aElementOf0(X0,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(f100,conjecture,
~ ( xQ = slcrc0
& ~ ? [X0] : aElementOf0(X0,xQ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f101,negated_conjecture,
~ ~ ( xQ = slcrc0
& ~ ? [X0] : aElementOf0(X0,xQ) ),
inference(negated_conjecture,[status(cth)],[f100]) ).
fof(f121,plain,
( xQ = slcrc0
& ~ ? [X0] : aElementOf0(X0,xQ) ),
inference(flattening,[],[f101]) ).
fof(f123,plain,
! [X0] :
( X0 = slcrc0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f172,plain,
! [X0] :
( ~ aSet0(X0)
| ( sbrdtbr0(X0) = sz00
<=> X0 = slcrc0 ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f250,plain,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X0] :
( ~ aElementOf0(X0,xQ)
| aElementOf0(X0,xO) )
& aSet0(xQ) ),
inference(ennf_transformation,[],[f99]) ).
fof(f251,plain,
( xQ = slcrc0
& ! [X0] : ~ aElementOf0(X0,xQ) ),
inference(ennf_transformation,[],[f121]) ).
fof(f285,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(nnf_transformation,[],[f123]) ).
fof(f286,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(flattening,[],[f285]) ).
fof(f287,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) ) )
& ( ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(rectify,[],[f286]) ).
fof(f288,plain,
! [X0] :
( ( slcrc0 != X0
| ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) ) )
& ( aElementOf0(sK25(X0),X0)
| ~ aSet0(X0)
| X0 = slcrc0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25]),skolemize(X1,sK25(X0))],[f287]) ).
fof(f308,plain,
! [X0] :
( ~ aSet0(X0)
| ( ( sz00 != sbrdtbr0(X0)
| X0 = slcrc0 )
& ( slcrc0 != X0
| sbrdtbr0(X0) = sz00 ) ) ),
inference(nnf_transformation,[],[f172]) ).
fof(f434,plain,
! [X0] :
( slcrc0 != X0
| aSet0(X0) ),
inference(cnf_transformation,[],[f288]) ).
fof(f500,plain,
! [X0] :
( ~ aSet0(X0)
| slcrc0 != X0
| sz00 = sbrdtbr0(X0) ),
inference(cnf_transformation,[],[f308]) ).
fof(f628,plain,
sz00 != xK,
inference(cnf_transformation,[],[f78]) ).
fof(f825,plain,
xK = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f250]) ).
fof(f829,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f251]) ).
fof(f832,plain,
! [X0] :
( xQ != X0
| aSet0(X0) ),
inference(definition_unfolding,[],[f434,f829]) ).
fof(f836,plain,
! [X0] :
( ~ aSet0(X0)
| xQ != X0
| sz00 = sbrdtbr0(X0) ),
inference(definition_unfolding,[],[f500,f829]) ).
fof(f850,plain,
aSet0(xQ),
inference(equality_resolution,[],[f832]) ).
fof(f857,plain,
( ~ aSet0(xQ)
| sz00 = sbrdtbr0(xQ) ),
inference(equality_resolution,[],[f836]) ).
tcf(c_51,negated_conjecture,
aSet0(xQ),
inference(cnf_transformation,[],[f850]) ).
tcf(c_116,negated_conjecture,
( ( sbrdtbr0(xQ) = sz00 )
| ~ aSet0(xQ) ),
inference(cnf_transformation,[],[f857]) ).
tcf(c_245,plain,
sz00 != xK,
inference(cnf_transformation,[],[f628]) ).
tcf(c_444,plain,
sbrdtbr0(xQ) = xK,
inference(cnf_transformation,[],[f825]) ).
tcf(c_774,negated_conjecture,
sbrdtbr0(xQ) = sz00,
inference(global_subsumption_just,[status(thm)],[c_116,c_51,c_116]) ).
tcf(c_3249,plain,
sz00 = xK,
inference(demodulation,[status(thm)],[c_774,c_444]) ).
tcf(c_3254,plain,
xK != xK,
inference(demodulation,[status(thm)],[c_245,c_3249]) ).
tcf(c_3255,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_3254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM605+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.44 % Computer : n015.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Thu Sep 24 04:55:41 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.26/0.52
% 0.26/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.52
% 0.26/0.52 % Detected problem language: tptp
% 0.26/0.54 % Proving...
% 4.57/1.43 % SZS status Started for theBenchmark.p
% 4.57/1.43 % SZS status Theorem for theBenchmark.p
% 4.57/1.43
% 4.57/1.43 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.57/1.43
% 4.57/1.43 % ------ iProver source info
% 4.57/1.43
% 4.57/1.43 % git: date: 2026-07-19 20:42:38 +0200
% 4.57/1.43 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.57/1.43 % git: non_committed_changes: false
% 4.57/1.43
% 4.57/1.43 % ------ Parsing...
% 4.57/1.43 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.57/1.43
% 4.57/1.43 % ------ Preprocessing...%
% 4.57/1.43
% 4.57/1.43 % SZS status Theorem for theBenchmark.p
% 4.57/1.43
% 4.57/1.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.57/1.43
% 4.57/1.43
%------------------------------------------------------------------------------