%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM521+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 : n004.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:25:49 PM UTC 2026
% Result : Theorem 4.27s 1.30s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 52 ( 18 unt; 0 def)
% Number of atoms : 146 ( 49 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 167 ( 73 ~; 58 |; 34 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 26 !; 12 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
( sz10 != sz00
& aNaturalNumber0(sz10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC_01) ).
fof(f11,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_MulUnit) ).
fof(f23,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( sdtlseqdt0(X1,X0)
& X1 != X0 )
| sdtlseqdt0(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLETotal) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1837) ).
fof(f42,axiom,
~ ( sdtlseqdt0(xp,xn)
| ? [X0] :
( sdtpldt0(xp,X0) = xn
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__1870) ).
fof(f43,axiom,
~ ( sdtlseqdt0(xp,xm)
| ? [X0] :
( sdtpldt0(xp,X0) = xm
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2075) ).
fof(f44,axiom,
~ ( ( sdtlseqdt0(xm,xp)
| ? [X0] :
( sdtpldt0(xm,X0) = xp
& aNaturalNumber0(X0) ) )
& xm != xp
& ( sdtlseqdt0(xn,xp)
| ? [X0] :
( sdtpldt0(xn,X0) = xp
& aNaturalNumber0(X0) ) )
& xn != xp ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2287) ).
fof(f45,conjecture,
( doDivides0(xp,xm)
| ? [X0] :
( xm = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) )
| doDivides0(xp,xn)
| ? [X0] :
( xn = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f46,negated_conjecture,
~ ( doDivides0(xp,xm)
| ? [X0] :
( xm = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) )
| doDivides0(xp,xn)
| ? [X0] :
( xn = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) ) ),
inference(negated_conjecture,[status(cth)],[f45]) ).
fof(f51,plain,
~ ( ( sdtlseqdt0(xm,xp)
| ? [X1] :
( xp = sdtpldt0(xm,X1)
& aNaturalNumber0(X1) ) )
& xm != xp
& ( sdtlseqdt0(xn,xp)
| ? [X0] :
( sdtpldt0(xn,X0) = xp
& aNaturalNumber0(X0) ) )
& xn != xp ),
inference(rectify,[],[f44]) ).
fof(f52,plain,
~ ( doDivides0(xp,xm)
| ? [X1] :
( xm = sdtasdt0(xp,X1)
& aNaturalNumber0(X1) )
| doDivides0(xp,xn)
| ? [X0] :
( xn = sdtasdt0(xp,X0)
& aNaturalNumber0(X0) ) ),
inference(rectify,[],[f46]) ).
fof(f66,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| ( X0 = sdtasdt0(sz10,X0)
& sdtasdt0(X0,sz10) = X0 ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f87,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(X1,X0)
& X1 != X0 )
| sdtlseqdt0(X0,X1) ),
inference(ennf_transformation,[],[f23]) ).
fof(f88,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( sdtlseqdt0(X1,X0)
& X1 != X0 )
| sdtlseqdt0(X0,X1) ),
inference(flattening,[],[f87]) ).
fof(f121,plain,
( ~ sdtlseqdt0(xp,xn)
& ! [X0] :
( xn != sdtpldt0(xp,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f122,plain,
( ~ sdtlseqdt0(xp,xm)
& ! [X0] :
( xm != sdtpldt0(xp,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f43]) ).
fof(f123,plain,
( ( ~ sdtlseqdt0(xm,xp)
& ! [X1] :
( xp != sdtpldt0(xm,X1)
| ~ aNaturalNumber0(X1) ) )
| xm = xp
| ( ~ sdtlseqdt0(xn,xp)
& ! [X0] :
( xp != sdtpldt0(xn,X0)
| ~ aNaturalNumber0(X0) ) )
| xn = xp ),
inference(ennf_transformation,[],[f51]) ).
fof(f124,plain,
( ~ doDivides0(xp,xm)
& ! [X1] :
( xm != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) )
& ~ doDivides0(xp,xn)
& ! [X0] :
( xn != sdtasdt0(xp,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f52]) ).
fof(f154,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f164,plain,
! [X0] :
( ~ aNaturalNumber0(X0)
| sdtasdt0(X0,sz10) = X0 ),
inference(cnf_transformation,[],[f66]) ).
fof(f185,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
fof(f220,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f221,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f222,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f247,plain,
~ sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f121]) ).
fof(f249,plain,
~ sdtlseqdt0(xp,xm),
inference(cnf_transformation,[],[f122]) ).
fof(f251,plain,
( ~ sdtlseqdt0(xm,xp)
| xm = xp
| ~ sdtlseqdt0(xn,xp)
| xn = xp ),
inference(cnf_transformation,[],[f123]) ).
fof(f256,plain,
! [X1] :
( xm != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f258,plain,
! [X0] :
( xn != sdtasdt0(xp,X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_50,plain,
aNaturalNumber0(sz10),
inference(cnf_transformation,[],[f154]) ).
tcf(c_60,plain,
! [X0: $i] :
( ( sdtasdt0(X0,sz10) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_83,plain,
! [X0: $i,X1: $i] :
( sdtlseqdt0(X1,X0)
| sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_116,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f222]) ).
tcf(c_117,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f221]) ).
tcf(c_118,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f220]) ).
tcf(c_144,plain,
~ sdtlseqdt0(xp,xn),
inference(cnf_transformation,[],[f247]) ).
tcf(c_146,plain,
~ sdtlseqdt0(xp,xm),
inference(cnf_transformation,[],[f249]) ).
tcf(c_150,plain,
( ( xm = xp )
| ( xn = xp )
| ~ sdtlseqdt0(xm,xp)
| ~ sdtlseqdt0(xn,xp) ),
inference(cnf_transformation,[],[f251]) ).
tcf(c_151,negated_conjecture,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(xp,X0) != xn ) ),
inference(cnf_transformation,[],[f258]) ).
tcf(c_153,negated_conjecture,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(xp,X0) != xm ) ),
inference(cnf_transformation,[],[f256]) ).
tcf(c_8980,negated_conjecture,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(xp,X0) != xm ) ),
inference(demodulation,[status(thm)],[c_153]) ).
tcf(c_8982,negated_conjecture,
! [X0: $i] :
( ~ aNaturalNumber0(X0)
| ( sdtasdt0(xp,X0) != xn ) ),
inference(demodulation,[status(thm)],[c_151]) ).
tcf(c_10774,plain,
sdtasdt0(xp,sz10) = xp,
inference(superposition,[status(thm)],[c_118,c_60]) ).
tcf(c_10883,plain,
( ~ aNaturalNumber0(sz10)
| ( xn != xp ) ),
inference(superposition,[status(thm)],[c_10774,c_8982]) ).
tcf(c_10884,plain,
( ~ aNaturalNumber0(sz10)
| ( xm != xp ) ),
inference(superposition,[status(thm)],[c_10774,c_8980]) ).
tcf(c_10885,plain,
xm != xp,
inference(forward_subsumption_resolution,[status(thm)],[c_10884,c_50]) ).
tcf(c_10886,plain,
xn != xp,
inference(forward_subsumption_resolution,[status(thm)],[c_10883,c_50]) ).
tcf(c_10994,plain,
( sdtlseqdt0(xn,xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xn) ),
inference(superposition,[status(thm)],[c_83,c_144]) ).
tcf(c_10995,plain,
( sdtlseqdt0(xm,xp)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xm) ),
inference(superposition,[status(thm)],[c_83,c_146]) ).
tcf(c_10998,plain,
sdtlseqdt0(xm,xp),
inference(forward_subsumption_resolution,[status(thm)],[c_10995,c_118,c_117]) ).
tcf(c_10999,plain,
sdtlseqdt0(xn,xp),
inference(forward_subsumption_resolution,[status(thm)],[c_10994,c_118,c_116]) ).
tcf(c_11000,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10998,c_10999,c_10885,c_10886,c_150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM521+3 : 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 : n004.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 04:25:50 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.45 % Proving...
% 4.27/1.30 % SZS status Started for theBenchmark.p
% 4.27/1.30 % SZS status Theorem for theBenchmark.p
% 4.27/1.30
% 4.27/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.27/1.30
% 4.27/1.30 % ------ iProver source info
% 4.27/1.30
% 4.27/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 4.27/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.27/1.30 % git: non_committed_changes: false
% 4.27/1.30
% 4.27/1.30 % ------ Parsing...
% 4.27/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.27/1.30
% 4.27/1.30 % ------ Preprocessing... sup_sim: 1 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 %
% 4.27/1.30
% 4.27/1.30 % ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.27/1.30
% 4.27/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.27/1.30 % ------ Proving...
% 4.27/1.30 % ------ Problem Properties
% 4.27/1.30
% 4.27/1.30 %
% 4.27/1.30 % clauses 103
% 4.27/1.30 % conjectures 4
% 4.27/1.30 % EPR 32
% 4.27/1.30 % Horn 61
% 4.27/1.30 % unary 18
% 4.27/1.30 % binary 15
% 4.27/1.30 % lits 385
% 4.27/1.30 % lits eq 114
% 4.27/1.30 % fd_pure 0
% 4.27/1.30 % fd_pseudo 0
% 4.27/1.30 % fd_cond 22
% 4.27/1.30 % fd_pseudo_cond 11
% 4.27/1.30 % AC symbols 0
% 4.27/1.30
% 4.27/1.30 % ------ Schedule dynamic 5 is on
% 4.27/1.30
% 4.27/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.27/1.30
% 4.27/1.30
% 4.27/1.30 % ------
% 4.27/1.30 % Current options:
% 4.27/1.30 % ------
% 4.27/1.30
% 4.27/1.30
% 4.27/1.30 %
% 4.27/1.30
% 4.27/1.30 % ------ Proving...
% 4.27/1.30 %
% 4.27/1.30
% 4.27/1.30 % SZS status Theorem for theBenchmark.p
% 4.27/1.30
% 4.27/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.27/1.30
% 4.27/1.30
%------------------------------------------------------------------------------