%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM491+1 : 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 : n010.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:17 PM UTC 2026
% Result : Theorem 3.30s 11.31s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 12 unt; 1 def)
% Number of atoms : 91 ( 11 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 105 ( 46 ~; 41 |; 13 &)
% ( 3 <=>; 2 =>; 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 : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 34 !; 5 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB_02) ).
fof(f30,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f48,conjecture,
doDivides0(xp,sdtasdt0(xp,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f49,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f52,plain,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(flattening,[],[f49]) ).
fof(f55,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(ennf_transformation,[],[f5]) ).
fof(f56,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(flattening,[],[f55]) ).
fof(f99,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(ennf_transformation,[],[f30]) ).
fof(f100,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( doDivides0(X0,X1)
<=> ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) ) ),
inference(flattening,[],[f99]) ).
fof(f124,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ? [X2] :
( X1 = sdtasdt0(X0,X2)
& aNaturalNumber0(X2) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(nnf_transformation,[],[f100]) ).
fof(f125,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(rectify,[],[f124]) ).
fof(f126,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ( ( ~ doDivides0(X0,X1)
| ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) ) )
& ( ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
| doDivides0(X0,X1) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f125]) ).
fof(f138,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f183,plain,
! [X2,X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| doDivides0(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f202,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f203,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f215,plain,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f52]) ).
fof(f222,plain,
! [X2,X0] :
( ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X2)
| doDivides0(X0,sdtasdt0(X0,X2)) ),
inference(equality_resolution,[],[f183]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f138]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] :
( doDivides0(X0,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f222]) ).
tcf(c_117,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f203]) ).
tcf(c_118,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f202]) ).
tcf(c_129,negated_conjecture,
~ doDivides0(xp,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f215]) ).
tcf(c_177,plain,
! [X0: $i,X1: $i] :
( doDivides0(X0,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_95]) ).
tcf(c_3370,definition,
iPr_def_10 = sdtasdt0(xp,xm),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_3371,negated_conjecture,
~ doDivides0(xp,iPr_def_10),
inference(demodulation,[status(thm)],[c_129,c_3370]) ).
tcf(c_4772,plain,
( doDivides0(xp,iPr_def_10)
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xm) ),
inference(superposition,[status(thm)],[c_3370,c_177]) ).
tcf(c_4789,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4772,c_3371,c_118,c_117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM491+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/10.38 % Computer : n010.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Thu Sep 24 04:15:57 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/10.42 Running first-order theorem proving
% 0.15/10.42 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.15/10.43
% 0.15/10.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.43
% 0.15/10.44 % Detected problem language: tptp
% 0.15/10.45 % Proving...
% 3.30/11.31 % SZS status Started for theBenchmark.p
% 3.30/11.31 % SZS status Theorem for theBenchmark.p
% 3.30/11.31
% 3.30/11.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.30/11.31
% 3.30/11.31 % ------ iProver source info
% 3.30/11.31
% 3.30/11.31 % git: date: 2026-07-19 20:42:38 +0200
% 3.30/11.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.30/11.31 % git: non_committed_changes: false
% 3.30/11.31
% 3.30/11.31 % ------ Parsing...
% 3.30/11.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.30/11.31
% 3.30/11.31 % ------ 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 %
% 3.30/11.31
% 3.30/11.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.30/11.31
% 3.30/11.31 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.30/11.31 % ------ Proving...
% 3.30/11.31 % ------ Problem Properties
% 3.30/11.31
% 3.30/11.31 %
% 3.30/11.31 % clauses 77
% 3.30/11.31 % conjectures 1
% 3.30/11.31 % EPR 22
% 3.30/11.31 % Horn 52
% 3.30/11.31 % unary 19
% 3.30/11.31 % binary 7
% 3.30/11.31 % lits 272
% 3.30/11.31 % lits eq 77
% 3.30/11.31 % fd_pure 0
% 3.30/11.31 % fd_pseudo 0
% 3.30/11.31 % fd_cond 15
% 3.30/11.31 % fd_pseudo_cond 11
% 3.30/11.31 % AC symbols 0
% 3.30/11.31
% 3.30/11.31 % ------ Schedule dynamic 5 is on
% 3.30/11.31
% 3.30/11.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.30/11.31
% 3.30/11.31
% 3.30/11.31 % ------
% 3.30/11.31 % Current options:
% 3.30/11.31 % ------
% 3.30/11.31
% 3.30/11.31
% 3.30/11.31 %
% 3.30/11.31
% 3.30/11.31 % ------ Proving...
% 3.30/11.31 %
% 3.30/11.31
% 3.30/11.31 % SZS status Theorem for theBenchmark.p
% 3.30/11.31
% 3.30/11.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.30/11.31
% 3.30/11.31
%------------------------------------------------------------------------------