%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM603+3 : 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 : n011.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:11 PM UTC 2026
% Result : Theorem 31.89s 5.40s
% Output : CNFRefutation 31.89s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f253ERROR: Could not build tree for root c_51830ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0] :
( aSet0(X0)
=> ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( aElementOf0(X2,X1)
=> aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(f24,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(f30,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> sdtlseqdt0(sz00,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
fof(f82,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3671) ).
fof(f83,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( sdtlseqdt0(X1,X0)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X0))
=> aElementOf0(X2,sdtlpdtrp0(xN,X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3754) ).
fof(f99,axiom,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5034) ).
fof(f100,conjecture,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f101,negated_conjecture,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
| ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,xS) ) ),
inference(negated_conjecture,[status(cth)],[f100]) ).
fof(f128,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
& ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,X0))
| aElementOf0(X1,szNzAzT0) )
& aSet0(sdtlpdtrp0(xN,X0)) ) ),
inference(ennf_transformation,[],[f82]) ).
fof(f129,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X0))
| aElementOf0(X2,sdtlpdtrp0(xN,X1)) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f130,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| ( aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1))
& ! [X2] :
( ~ aElementOf0(X2,sdtlpdtrp0(xN,X0))
| aElementOf0(X2,sdtlpdtrp0(xN,X1)) ) ) ),
inference(flattening,[],[f129]) ).
fof(f149,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ? [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
& ~ aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f101]) ).
fof(f172,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( aSubsetOf0(X1,X0)
<=> ( ! [X2] :
( ~ aElementOf0(X2,X1)
| aElementOf0(X2,X0) )
& aSet0(X1) ) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f189,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| sdtlseqdt0(sz00,X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f300,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ( ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
& ( ( aElementOf0(sK35(X0),sdtlpdtrp0(xN,X0))
& ~ aElementOf0(sK35(X0),szNzAzT0) )
| ~ aSet0(sdtlpdtrp0(xN,X0)) ) )
| sP5(X0) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK35]),skolemize(X1,sK35(X0))],[f253]) ).
fof(f368,plain,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& aElementOf0(sK53,sdtlpdtrp0(xN,xi))
& ~ aElementOf0(sK53,xS) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53]),skolemize(X0,sK53)],[f149]) ).
fof(f372,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,[],[f172]) ).
fof(f373,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,[],[f372]) ).
fof(f374,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,[],[f373]) ).
fof(f375,plain,
! [X0] :
( ~ aSet0(X0)
| ! [X1] :
( ( ~ aSubsetOf0(X1,X0)
| ( ! [X3] :
( ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) )
& aSet0(X1) ) )
& ( ( aElementOf0(sK56(X0,X1),X1)
& ~ aElementOf0(sK56(X0,X1),X0) )
| ~ aSet0(X1)
| aSubsetOf0(X1,X0) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK56]),skolemize(X2,sK56(X0,X1))],[f374]) ).
fof(f492,plain,
xS = sdtlpdtrp0(xN,sz00),
inference(cnf_transformation,[],[f300]) ).
fof(f498,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aSet0(sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f128]) ).
fof(f499,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ),
inference(cnf_transformation,[],[f130]) ).
fof(f671,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f99]) ).
fof(f673,plain,
aElementOf0(sK53,sdtlpdtrp0(xN,xi)),
inference(cnf_transformation,[],[f368]) ).
fof(f674,plain,
~ aElementOf0(sK53,xS),
inference(cnf_transformation,[],[f368]) ).
fof(f693,plain,
! [X3,X0,X1] :
( ~ aSet0(X0)
| ~ aSubsetOf0(X1,X0)
| ~ aElementOf0(X3,X1)
| aElementOf0(X3,X0) ),
inference(cnf_transformation,[],[f375]) ).
fof(f725,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| sdtlseqdt0(sz00,X0) ),
inference(cnf_transformation,[],[f189]) ).
fof(f730,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnf_transformation,[],[f24]) ).
tcf(c_120,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(cnf_transformation,[],[f492]) ).
tcf(c_124,plain,
! [X0: $i] :
( aSet0(sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f498]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f499]) ).
tcf(c_299,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f671]) ).
tcf(c_301,negated_conjecture,
~ aElementOf0(sK53,xS),
inference(cnf_transformation,[],[f674]) ).
tcf(c_302,negated_conjecture,
aElementOf0(sK53,sdtlpdtrp0(xN,xi)),
inference(cnf_transformation,[],[f673]) ).
tcf(c_325,plain,
! [X0: $i,X1: $i,X2: $i] :
( aElementOf0(X0,X2)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| ~ aElementOf0(X0,X1) ),
inference(cnf_transformation,[],[f693]) ).
tcf(c_354,plain,
! [X0: $i] :
( sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f725]) ).
tcf(c_359,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnf_transformation,[],[f730]) ).
tcf(c_37786,plain,
sdtlseqdt0(sz00,xi),
inference(superposition,[status(thm)],[c_299,c_354]) ).
tcf(c_41696,plain,
! [X0: $i] :
( aElementOf0(sK53,X0)
| ~ aSet0(X0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),X0) ),
inference(superposition,[status(thm)],[c_302,c_325]) ).
tcf(c_51319,plain,
! [X0: $i] :
( aElementOf0(sK53,sdtlpdtrp0(xN,X0))
| ~ aElementOf0(xi,szNzAzT0)
| ~ sdtlseqdt0(X0,xi)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X0)) ),
inference(superposition,[status(thm)],[c_129,c_41696]) ).
tcf(c_51334,plain,
! [X0: $i] :
( aElementOf0(sK53,sdtlpdtrp0(xN,X0))
| ~ sdtlseqdt0(X0,xi)
| ~ aElementOf0(X0,szNzAzT0)
| ~ aSet0(sdtlpdtrp0(xN,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_51319,c_299]) ).
tcf(c_51809,plain,
! [X0: $i] :
( aElementOf0(sK53,sdtlpdtrp0(xN,X0))
| ~ sdtlseqdt0(X0,xi)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(global_subsumption_just,[status(thm)],[c_51334,c_124,c_51334]) ).
tcf(c_51818,plain,
( aElementOf0(sK53,xS)
| ~ sdtlseqdt0(sz00,xi)
| ~ aElementOf0(sz00,szNzAzT0) ),
inference(superposition,[status(thm)],[c_120,c_51809]) ).
tcf(c_51830,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_51818,c_301,c_37786,c_359]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM603+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Thu Sep 24 04:51:57 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.13/0.42
% 0.13/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.42
% 0.13/0.43 % Detected problem language: tptp
% 0.13/0.44 % Proving...
% 31.89/5.40 % SZS status Started for theBenchmark.p
% 31.89/5.40 % SZS status Theorem for theBenchmark.p
% 31.89/5.40
% 31.89/5.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 31.89/5.40
% 31.89/5.40 % ------ iProver source info
% 31.89/5.40
% 31.89/5.40 % git: date: 2026-07-19 20:42:38 +0200
% 31.89/5.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 31.89/5.40 % git: non_committed_changes: false
% 31.89/5.40
% 31.89/5.40 % ------ Parsing...
% 31.89/5.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 31.89/5.40
% 31.89/5.40 % ------ Preprocessing... sup_sim: 9 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 31.89/5.40
% 31.89/5.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 31.89/5.40
% 31.89/5.40 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 31.89/5.40 % ------ Proving...
% 31.89/5.40 % ------ Problem Properties
% 31.89/5.40
% 31.89/5.40 %
% 31.89/5.40 % clauses 350
% 31.89/5.40 % conjectures 3
% 31.89/5.40 % EPR 56
% 31.89/5.40 % Horn 281
% 31.89/5.40 % unary 46
% 31.89/5.40 % binary 95
% 31.89/5.40 % lits 1108
% 31.89/5.40 % lits eq 155
% 31.89/5.40 % fd_pure 0
% 31.89/5.40 % fd_pseudo 0
% 31.89/5.40 % fd_cond 8
% 31.89/5.40 % fd_pseudo_cond 37
% 31.89/5.40 % AC symbols 0
% 31.89/5.40
% 31.89/5.40 % ------ Schedule dynamic 5 is on
% 31.89/5.40
% 31.89/5.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 31.89/5.40
% 31.89/5.40
% 31.89/5.40 % ------
% 31.89/5.40 % Current options:
% 31.89/5.40 % ------
% 31.89/5.40
% 31.89/5.40
% 31.89/5.40 %
% 31.89/5.40
% 31.89/5.40 % ------ Proving...
% 31.89/5.40 %
% 31.89/5.40
% 31.89/5.40 % SZS status Theorem for theBenchmark.p
% 31.89/5.40
% 31.89/5.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 31.89/5.40
% 31.89/5.40
%------------------------------------------------------------------------------