%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM582+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 : n026.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:06 PM UTC 2026
% Result : Theorem 4.85s 2.29s
% Output : CNFRefutation 4.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 15 unt; 0 def)
% Number of atoms : 76 ( 8 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 78 ( 32 ~; 27 |; 14 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f24,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(f30,axiom,
! [X0] :
( aElementOf0(X0,szNzAzT0)
=> sdtlseqdt0(sz00,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).
fof(f81,axiom,
( ! [X0] :
( aElementOf0(X0,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X0))
& aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(f83,axiom,
! [X0,X1] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X0,szNzAzT0) )
=> ( sdtlseqdt0(X1,X0)
=> aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3754) ).
fof(f85,axiom,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3989) ).
fof(f88,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f89,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(negated_conjecture,[status(cth)],[f88]) ).
fof(f90,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(flattening,[],[f89]) ).
fof(f100,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
| ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(ennf_transformation,[],[f81]) ).
fof(f101,plain,
( ! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X0))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X0),szNzAzT0)
| ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X0)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X0)),sdtmndt0(sdtlpdtrp0(xN,X0),szmzizndt0(sdtlpdtrp0(xN,X0)))) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(flattening,[],[f100]) ).
fof(f103,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ),
inference(ennf_transformation,[],[f83]) ).
fof(f104,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ),
inference(flattening,[],[f103]) ).
fof(f140,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| sdtlseqdt0(sz00,X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f269,plain,
xS = sdtlpdtrp0(xN,sz00),
inference(cnf_transformation,[],[f101]) ).
fof(f274,plain,
! [X0,X1] :
( ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X1,X0)
| aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)) ),
inference(cnf_transformation,[],[f104]) ).
fof(f276,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f85]) ).
fof(f279,plain,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnf_transformation,[],[f90]) ).
fof(f324,plain,
! [X0] :
( ~ aElementOf0(X0,szNzAzT0)
| sdtlseqdt0(sz00,X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f329,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnf_transformation,[],[f24]) ).
tcf(c_67,plain,
sdtlpdtrp0(xN,sz00) = xS,
inference(cnf_transformation,[],[f269]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X0))
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X0,szNzAzT0)
| ~ sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f274]) ).
tcf(c_74,plain,
aElementOf0(xi,szNzAzT0),
inference(cnf_transformation,[],[f276]) ).
tcf(c_77,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(cnf_transformation,[],[f279]) ).
tcf(c_122,plain,
! [X0: $i] :
( sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(cnf_transformation,[],[f324]) ).
tcf(c_127,plain,
aElementOf0(sz00,szNzAzT0),
inference(cnf_transformation,[],[f329]) ).
tcf(c_13243,plain,
! [X0: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
| ~ aElementOf0(sz00,szNzAzT0)
| ~ sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(superposition,[status(thm)],[c_67,c_72]) ).
tcf(c_13249,plain,
! [X0: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
| ~ sdtlseqdt0(sz00,X0)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_13243,c_127]) ).
tcf(c_25371,plain,
! [X0: $i] :
( aSubsetOf0(sdtlpdtrp0(xN,X0),xS)
| ~ aElementOf0(X0,szNzAzT0) ),
inference(global_subsumption_just,[status(thm)],[c_13249,c_122,c_13249]) ).
tcf(c_25379,plain,
~ aElementOf0(xi,szNzAzT0),
inference(superposition,[status(thm)],[c_25371,c_77]) ).
tcf(c_25385,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_25379,c_74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM582+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.09/0.37 % Computer : n026.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 04:47:56 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 4.85/2.29 % SZS status Started for theBenchmark.p
% 4.85/2.29 % SZS status Theorem for theBenchmark.p
% 4.85/2.29
% 4.85/2.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.85/2.29
% 4.85/2.29 % ------ iProver source info
% 4.85/2.29
% 4.85/2.29 % git: date: 2026-07-19 20:42:38 +0200
% 4.85/2.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.85/2.29 % git: non_committed_changes: false
% 4.85/2.29
% 4.85/2.29 % ------ Parsing...
% 4.85/2.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.85/2.29
% 4.85/2.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e %
% 4.85/2.29
% 4.85/2.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.85/2.29
% 4.85/2.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.85/2.29 % ------ Proving...
% 4.85/2.29 % ------ Problem Properties
% 4.85/2.29
% 4.85/2.29 %
% 4.85/2.29 % clauses 165
% 4.85/2.29 % conjectures 1
% 4.85/2.29 % EPR 37
% 4.85/2.29 % Horn 128
% 4.85/2.29 % unary 27
% 4.85/2.29 % binary 26
% 4.85/2.29 % lits 559
% 4.85/2.29 % lits eq 93
% 4.85/2.29 % fd_pure 0
% 4.85/2.29 % fd_pseudo 0
% 4.85/2.29 % fd_cond 8
% 4.85/2.29 % fd_pseudo_cond 23
% 4.85/2.29 % AC symbols 0
% 4.85/2.29
% 4.85/2.29 % ------ Schedule dynamic 5 is on
% 4.85/2.29
% 4.85/2.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.85/2.29
% 4.85/2.29
% 4.85/2.29 % ------
% 4.85/2.29 % Current options:
% 4.85/2.29 % ------
% 4.85/2.29
% 4.85/2.29
% 4.85/2.29 %
% 4.85/2.29
% 4.85/2.29 % ------ Proving...
% 4.85/2.29 %
% 4.85/2.29
% 4.85/2.29 % SZS status Theorem for theBenchmark.p
% 4.85/2.29
% 4.85/2.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.85/2.29
% 4.85/2.29
%------------------------------------------------------------------------------