%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM604+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:11 PM UTC 2026
% Result : Theorem 4.84s 1.54s
% Output : CNFRefutation 4.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 44 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 34 ( 12 ~; 8 |; 11 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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; 6 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f91,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,X0))
=> sdtlseqdt0(sdtlpdtrp0(xe,X0),X1) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(f99,axiom,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
fof(f100,axiom,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ! [X0] :
( aElementOf0(X0,sdtlpdtrp0(xN,xi))
=> aElementOf0(X0,xS) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5045) ).
fof(f101,conjecture,
aElementOf0(xx,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f102,negated_conjecture,
~ aElementOf0(xx,xS),
inference(negated_conjecture,[status(cth)],[f101]) ).
fof(f122,plain,
~ aElementOf0(xx,xS),
inference(flattening,[],[f102]) ).
fof(f245,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ( sdtlpdtrp0(xe,X0) = szmzizndt0(sdtlpdtrp0(xN,X0))
& ! [X1] :
( ~ aElementOf0(X1,sdtlpdtrp0(xN,X0))
| sdtlseqdt0(sdtlpdtrp0(xe,X0),X1) )
& aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
inference(ennf_transformation,[],[f91]) ).
fof(f250,plain,
( aSubsetOf0(sdtlpdtrp0(xN,xi),xS)
& ! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| aElementOf0(X0,xS) ) ),
inference(ennf_transformation,[],[f100]) ).
fof(f783,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0)) ),
inference(cnf_transformation,[],[f245]) ).
fof(f825,plain,
xx = sdtlpdtrp0(xe,xi),
inference(cnf_transformation,[],[f99]) ).
fof(f826,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f99]) ).
fof(f828,plain,
! [X0] :
( ~ aElementOf0(X0,sdtlpdtrp0(xN,xi))
| aElementOf0(X0,xS) ),
inference(cnf_transformation,[],[f250]) ).
fof(f829,plain,
~ aElementOf0(xx,xS),
inference(cnf_transformation,[],[f122]) ).
tcf(c_400,plain,
! [X0: $i] :
( aElementOf0(sdtlpdtrp0(xe,X0),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f783]) ).
tcf(c_442,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f826]) ).
tcf(c_443,plain,
sdtlpdtrp0(xe,xi) = xx,
inference(cnf_transformation,[],[f825]) ).
tcf(c_444,plain,
! [X0: $i] :
( aElementOf0(X0,xS)
| ~ aElementOf0(X0,sdtlpdtrp0(xN,xi)) ),
inference(cnf_transformation,[],[f828]) ).
tcf(c_446,negated_conjecture,
~ aElementOf0(xx,xS),
inference(cnf_transformation,[],[f829]) ).
tcf(c_650,plain,
( aElementOf0(sdtlpdtrp0(xe,xi),xS)
| ~ aElementOf0(xi,szNzAzT0) ),
inference(superposition,[status(thm)],[c_400,c_444]) ).
tcf(c_1189,plain,
aElementOf0(sdtlpdtrp0(xe,xi),xS),
inference(global_subsumption_just,[status(thm)],[c_650,c_442,c_650]) ).
tcf(c_1191,plain,
aElementOf0(xx,xS),
inference(light_normalisation,[status(thm)],[c_1189,c_443]) ).
tcf(c_1192,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1191,c_446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM604+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.20/0.45 % Computer : n015.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Thu Sep 24 04:55:26 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.52 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.23/0.53
% 0.23/0.53 % ======== iProver multi-core TPTP/SMT =========
% 0.23/0.53
% 0.23/0.53 % Detected problem language: tptp
% 0.23/0.55 % Proving...
% 4.84/1.54 % SZS status Started for theBenchmark.p
% 4.84/1.54 % SZS status Theorem for theBenchmark.p
% 4.84/1.54
% 4.84/1.54 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.84/1.54
% 4.84/1.54 % ------ iProver source info
% 4.84/1.54
% 4.84/1.54 % git: date: 2026-07-19 20:42:38 +0200
% 4.84/1.54 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.84/1.54 % git: non_committed_changes: false
% 4.84/1.54
% 4.84/1.54 % ------ Parsing...
% 4.84/1.54 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.84/1.54 % ------ Proving...
% 4.84/1.54 % ------ Problem Properties
% 4.84/1.54
% 4.84/1.54 %
% 4.84/1.54 % clauses 398
% 4.84/1.54 % conjectures 1
% 4.84/1.54 % EPR 65
% 4.84/1.54 % Horn 314
% 4.84/1.54 % unary 46
% 4.84/1.54 % binary 116
% 4.84/1.54 % lits 1274
% 4.84/1.54 % lits eq 167
% 4.84/1.54 % fd_pure 0
% 4.84/1.54 % fd_pseudo 0
% 4.84/1.54 % fd_cond 10
% 4.84/1.54 % fd_pseudo_cond 47
% 4.84/1.54 % AC symbols 0
% 4.84/1.54
% 4.84/1.54 % ------ Input Options Time Limit: Unbounded
% 4.84/1.54
% 4.84/1.54
% 4.84/1.54 % ------
% 4.84/1.54 % Current options:
% 4.84/1.54 % ------
% 4.84/1.54
% 4.84/1.54
% 4.84/1.54 %
% 4.84/1.54
% 4.84/1.54 % ------ Proving...
% 4.84/1.54 %
% 4.84/1.54
% 4.84/1.54 % ------ Proving...
% 4.84/1.54 %
% 4.84/1.54
% 4.84/1.54 % SZS status Theorem for theBenchmark.p
% 4.84/1.54
% 4.84/1.54 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.84/1.54
% 4.84/1.54
%------------------------------------------------------------------------------