%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM617+1 : 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 : n016.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:15 PM UTC 2026
% Result : Theorem 6.83s 2.28s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 19 unt; 0 def)
% Number of atoms : 94 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 103 ( 44 ~; 40 |; 15 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 30 !; 3 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(f23,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mNATSet) ).
fof(f101,axiom,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5106) ).
fof(f107,axiom,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(f113,axiom,
aElementOf0(xx,xP),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5348) ).
fof(f114,conjecture,
aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f115,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(negated_conjecture,[status(cth)],[f114]) ).
fof(f123,plain,
~ aElementOf0(xx,szNzAzT0),
inference(flattening,[],[f115]) ).
fof(f130,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f257,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(nnf_transformation,[],[f130]) ).
fof(f258,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(flattening,[],[f257]) ).
fof(f259,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ? [X2] :
( aElementOf0(X2,X1)
& ~ aElementOf0(X2,X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(rectify,[],[f258]) ).
fof(f260,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ( aElementOf0(sK5(X0,X1),X1)
& ~ aElementOf0(sK5(X0,X1),X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X2,sK5(X0,X1))],[f259]) ).
fof(f323,plain,
! [X3,X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) ),
inference(cnf_transformation,[],[f260]) ).
fof(f324,plain,
! [X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| aSet0(X1) ),
inference(cnf_transformation,[],[f260]) ).
fof(f362,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f23]) ).
fof(f518,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f101]) ).
fof(f525,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f107]) ).
fof(f533,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f113]) ).
fof(f534,plain,
~ aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f123]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] :
( aSet0(X0)
| ~ aSet0(X1)
| ~ aSubsetOf0(X0,X1) ),
inference(cnf_transformation,[],[f324]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f323]) ).
tcf(c_94,plain,
aSet0(szNzAzT0),
inference(cnf_transformation,[],[f362]) ).
tcf(c_251,plain,
aSubsetOf0(xQ,szNzAzT0),
inference(cnf_transformation,[],[f518]) ).
tcf(c_258,plain,
aSubsetOf0(xP,xQ),
inference(cnf_transformation,[],[f525]) ).
tcf(c_266,plain,
aElementOf0(xx,xP),
inference(cnf_transformation,[],[f533]) ).
tcf(c_267,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(cnf_transformation,[],[f534]) ).
tcf(c_18554,plain,
( aSet0(xQ)
| ~ aSet0(szNzAzT0) ),
inference(superposition,[status(thm)],[c_251,c_58]) ).
tcf(c_18558,plain,
aSet0(xQ),
inference(forward_subsumption_resolution,[status(thm)],[c_18554,c_94]) ).
tcf(c_20377,plain,
! [X0: $i] :
( aElementOf0(xx,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(xP,X0) ),
inference(superposition,[status(thm)],[c_266,c_59]) ).
tcf(c_23678,plain,
( aElementOf0(xx,xQ)
| ~ aSet0(xQ) ),
inference(superposition,[status(thm)],[c_258,c_20377]) ).
tcf(c_23681,plain,
aElementOf0(xx,xQ),
inference(forward_subsumption_resolution,[status(thm)],[c_23678,c_18558]) ).
tcf(c_23707,plain,
! [X0: $i] :
( aElementOf0(xx,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(xQ,X0) ),
inference(superposition,[status(thm)],[c_23681,c_59]) ).
tcf(c_23714,plain,
( aElementOf0(xx,szNzAzT0)
| ~ aSet0(szNzAzT0)
| ~ aSubsetOf0(xQ,szNzAzT0) ),
inference(instantiation,[status(thm)],[c_23707]) ).
tcf(c_23715,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_23714,c_267,c_251,c_94]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM617+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n016.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 05:00:59 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 6.83/2.28 % SZS status Started for theBenchmark.p
% 6.83/2.28 % SZS status Theorem for theBenchmark.p
% 6.83/2.28
% 6.83/2.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 6.83/2.28
% 6.83/2.28 % ------ iProver source info
% 6.83/2.28
% 6.83/2.28 % git: date: 2026-07-19 20:42:38 +0200
% 6.83/2.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 6.83/2.28 % git: non_committed_changes: false
% 6.83/2.28
% 6.83/2.28 % ------ Parsing...
% 6.83/2.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 6.83/2.28
% 6.83/2.28 % ------ Preprocessing... sup_sim: 3 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 6.83/2.28
% 6.83/2.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 6.83/2.28
% 6.83/2.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 6.83/2.28 % ------ Proving...
% 6.83/2.28 % ------ Problem Properties
% 6.83/2.28
% 6.83/2.28 %
% 6.83/2.28 % clauses 214
% 6.83/2.28 % conjectures 1
% 6.83/2.28 % EPR 55
% 6.83/2.28 % Horn 175
% 6.83/2.28 % unary 56
% 6.83/2.28 % binary 32
% 6.83/2.28 % lits 669
% 6.83/2.28 % lits eq 109
% 6.83/2.28 % fd_pure 0
% 6.83/2.28 % fd_pseudo 0
% 6.83/2.28 % fd_cond 10
% 6.83/2.28 % fd_pseudo_cond 25
% 6.83/2.28 % AC symbols 0
% 6.83/2.28
% 6.83/2.28 % ------ Schedule dynamic 5 is on
% 6.83/2.28
% 6.83/2.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 6.83/2.28
% 6.83/2.28
% 6.83/2.28 % ------
% 6.83/2.28 % Current options:
% 6.83/2.28 % ------
% 6.83/2.28
% 6.83/2.28
% 6.83/2.28 %
% 6.83/2.28
% 6.83/2.28 % ------ Proving...
% 6.83/2.28 %
% 6.83/2.28
% 6.83/2.28 % SZS status Theorem for theBenchmark.p
% 6.83/2.28
% 6.83/2.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 6.83/2.28
% 6.83/2.28
%------------------------------------------------------------------------------