%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM464+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 : n009.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:24:33 PM UTC 2026
% Result : Theorem 2.62s 6.29s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 18 unt; 0 def)
% Number of atoms : 137 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 153 ( 65 ~; 60 |; 19 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 43 !; 5 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).
fof(f3,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_AddZero) ).
fof(f18,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).
fof(f26,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| X0 = sz10
| X0 = sz00 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLENTr) ).
fof(f27,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__987) ).
fof(f28,conjecture,
( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f29,negated_conjecture,
~ ( xm != sz00
=> sdtlseqdt0(sz10,xm) ),
inference(negated_conjecture,[status(cth)],[f28]) ).
fof(f31,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(ennf_transformation,[],[f4]) ).
fof(f32,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(flattening,[],[f31]) ).
fof(f39,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( X0 = sdtpldt0(sz00,X0)
& sdtpldt0(X0,sz00) = X0 ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f56,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
inference(ennf_transformation,[],[f18]) ).
fof(f57,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(X0,X1)
<=> ? [X2] :
( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
inference(flattening,[],[f56]) ).
fof(f71,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| X0 = sz10
| X0 = sz00 ),
inference(ennf_transformation,[],[f26]) ).
fof(f72,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(sz10,X0)
& sz10 != X0 )
| X0 = sz10
| X0 = sz00 ),
inference(flattening,[],[f71]) ).
fof(f73,plain,
( xm != sz00
& ~ sdtlseqdt0(sz10,xm) ),
inference(ennf_transformation,[],[f29]) ).
fof(f74,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ sdtlseqdt0(X0,X1)
| ? [X2] :
( sdtpldt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
& ( ! [X2] :
( sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| sdtlseqdt0(X0,X1) ) ) ),
inference(nnf_transformation,[],[f57]) ).
fof(f75,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ sdtlseqdt0(X0,X1)
| ? [X3] :
( sdtpldt0(X0,X3) = X1
& aNaturalNumber0(X3) ) )
& ( ! [X2] :
( sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| sdtlseqdt0(X0,X1) ) ) ),
inference(rectify,[],[f74]) ).
fof(f76,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ sdtlseqdt0(X0,X1)
| ( sdtpldt0(X0,sK0(X0,X1)) = X1
& aNaturalNumber0(sK0(X0,X1)) ) )
& ( ! [X2] :
( sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| sdtlseqdt0(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f75]) ).
fof(f79,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f81,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f82,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f32]) ).
fof(f87,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtpldt0(X0,sz00) = X0 ),
inference(cnf_transformation,[],[f39]) ).
fof(f105,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtpldt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
fof(f122,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtlseqdt0(sz10,X0)
| sz10 = X0
| sz00 = X0 ),
inference(cnf_transformation,[],[f72]) ).
fof(f125,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f27]) ).
fof(f126,plain,
sz00 != xm,
inference(cnf_transformation,[],[f73]) ).
fof(f127,plain,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[],[f73]) ).
fof(f128,plain,
! [X2,X0] :
( ~ aNaturalNumber0(sdtpldt0(X0,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X2)
| sdtlseqdt0(X0,sdtpldt0(X0,X2)) ),
inference(equality_resolution,[],[f105]) ).
tcf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f79]) ).
tcf(c_50,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f81]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f82]) ).
tcf(c_56,plain,
! [X0: $i] :
( ( sdtpldt0(X0,sz00) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( sdtlseqdt0(X0,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_92,plain,
! [X0: $i] :
( sdtlseqdt0(sz10,X0)
| ( X0 = sz10 )
| ( X0 = sz00 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f122]) ).
tcf(c_93,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f125]) ).
tcf(c_95,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(cnf_transformation,[],[f127]) ).
tcf(c_96,negated_conjecture,
sz00 != xm,
inference(cnf_transformation,[],[f126]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( sdtlseqdt0(X0,sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_73,c_52,c_73]) ).
tcf(c_1328,negated_conjecture,
sz00 != xm,
inference(demodulation,[status(thm)],[c_96]) ).
tcf(c_1329,negated_conjecture,
~ sdtlseqdt0(sz10,xm),
inference(demodulation,[status(thm)],[c_95]) ).
tcf(c_2032,plain,
sdtpldt0(sz10,sz00) = sz10,
inference(superposition,[status(thm)],[c_50,c_56]) ).
tcf(c_2167,plain,
( sdtlseqdt0(sz10,sz10)
| ~ aNaturalNumber0(sz10)
| ~ aNaturalNumber0(sz00) ),
inference(superposition,[status(thm)],[c_2032,c_122]) ).
tcf(c_2179,plain,
sdtlseqdt0(sz10,sz10),
inference(forward_subsumption_resolution,[status(thm)],[c_2167,c_50,c_49]) ).
tcf(c_2575,plain,
( ( sz10 = xm )
| ( sz00 = xm )
| ~ aNaturalNumber0(xm) ),
inference(superposition,[status(thm)],[c_92,c_1329]) ).
tcf(c_2576,plain,
sz10 = xm,
inference(forward_subsumption_resolution,[status(thm)],[c_2575,c_1328,c_93]) ).
tcf(c_2594,plain,
~ sdtlseqdt0(sz10,sz10),
inference(demodulation,[status(thm)],[c_1329,c_2576]) ).
tcf(c_2595,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2594,c_2179]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM464+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.10/5.37 % Computer : n009.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 04:06:50 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.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.15/5.42
% 0.15/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.42
% 0.15/5.42 % Detected problem language: tptp
% 0.15/5.43 % Proving...
% 2.62/6.29 % SZS status Started for theBenchmark.p
% 2.62/6.29 % SZS status Theorem for theBenchmark.p
% 2.62/6.29
% 2.62/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.62/6.29
% 2.62/6.29 % ------ iProver source info
% 2.62/6.29
% 2.62/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.62/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.62/6.29 % git: non_committed_changes: false
% 2.62/6.29
% 2.62/6.29 % ------ Parsing...
% 2.62/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.62/6.29
% 2.62/6.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.62/6.29
% 2.62/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.62/6.29
% 2.62/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.62/6.29 % ------ Proving...
% 2.62/6.29 % ------ Problem Properties
% 2.62/6.29
% 2.62/6.29 %
% 2.62/6.29 % clauses 43
% 2.62/6.29 % conjectures 2
% 2.62/6.29 % EPR 12
% 2.62/6.29 % Horn 34
% 2.62/6.29 % unary 7
% 2.62/6.29 % binary 7
% 2.62/6.29 % lits 151
% 2.62/6.29 % lits eq 43
% 2.62/6.29 % fd_pure 0
% 2.62/6.29 % fd_pseudo 0
% 2.62/6.29 % fd_cond 4
% 2.62/6.29 % fd_pseudo_cond 9
% 2.62/6.29 % AC symbols 0
% 2.62/6.29
% 2.62/6.29 % ------ Schedule dynamic 5 is on
% 2.62/6.29
% 2.62/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.62/6.29
% 2.62/6.29
% 2.62/6.29 % ------
% 2.62/6.29 % Current options:
% 2.62/6.29 % ------
% 2.62/6.29
% 2.62/6.29
% 2.62/6.29 %
% 2.62/6.29
% 2.62/6.29 % ------ Proving...
% 2.62/6.29 %
% 2.62/6.29
% 2.62/6.29 % SZS status Theorem for theBenchmark.p
% 2.62/6.29
% 2.62/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.62/6.29
% 2.62/6.29
%------------------------------------------------------------------------------