%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM519+3 : 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 : n011.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:48 PM UTC 2026
% Result : Theorem 2.00s 16.33s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 1 def)
% Number of atoms : 61 ( 14 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 18 ~; 16 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 0 ( 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 2 !; 10 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f51,axiom,
( ( doDivides0(xr,xm)
& ? [X0] :
( xm = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) )
| ( doDivides0(xr,xn)
& ? [X0] :
( xn = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2449) ).
fof(f52,axiom,
~ ( doDivides0(xr,xn)
| ? [X0] :
( xn = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2487) ).
fof(f53,axiom,
~ ( doDivides0(xr,xm)
| ? [X0] :
( xm = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2698) ).
fof(f63,plain,
( ( doDivides0(xr,xm)
& ? [X1] :
( xm = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) ) )
| ( doDivides0(xr,xn)
& ? [X0] :
( xn = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ) ),
inference(rectify,[],[f51]) ).
fof(f138,plain,
( ~ doDivides0(xr,xn)
& ! [X0] :
( xn != sdtasdt0(xr,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f52]) ).
fof(f139,plain,
( ~ doDivides0(xr,xm)
& ! [X0] :
( xm != sdtasdt0(xr,X0)
| ~ aNaturalNumber0(X0) ) ),
inference(ennf_transformation,[],[f53]) ).
fof(f177,plain,
( sP2
| ( doDivides0(xr,xn)
& xn = sdtasdt0(xr,sK19)
& aNaturalNumber0(sK19) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK19]),skolemize(X0,sK19)],[f145]) ).
fof(f313,plain,
( sP2
| doDivides0(xr,xn) ),
inference(cnf_transformation,[],[f177]) ).
fof(f316,plain,
~ doDivides0(xr,xn),
inference(cnf_transformation,[],[f138]) ).
fof(f318,plain,
~ doDivides0(xr,xm),
inference(cnf_transformation,[],[f139]) ).
tcf(c_185,plain,
( sP2
| doDivides0(xr,xn) ),
inference(cnf_transformation,[],[f313]) ).
tcf(c_187,plain,
~ doDivides0(xr,xn),
inference(cnf_transformation,[],[f316]) ).
tcf(c_189,plain,
~ doDivides0(xr,xm),
inference(cnf_transformation,[],[f318]) ).
fof(f144,definition,
( ~ sP2
| ( doDivides0(xr,xm)
& ? [X1] :
( xm = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).
fof(f145,plain,
( sP2
| ( doDivides0(xr,xn)
& ? [X0] :
( xn = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ) ),
inference(definition_folding,[],[f63,f144]) ).
fof(f174,plain,
( ~ sP2
| ( doDivides0(xr,xm)
& ? [X1] :
( xm = sdtasdt0(xr,X1)
& aNaturalNumber0(X1) ) ) ),
inference(nnf_transformation,[],[f144]) ).
fof(f175,plain,
( ~ sP2
| ( doDivides0(xr,xm)
& ? [X0] :
( xm = sdtasdt0(xr,X0)
& aNaturalNumber0(X0) ) ) ),
inference(rectify,[],[f174]) ).
fof(f176,plain,
( ~ sP2
| ( doDivides0(xr,xm)
& xm = sdtasdt0(xr,sK18)
& aNaturalNumber0(sK18) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK18]),skolemize(X0,sK18)],[f175]) ).
fof(f310,plain,
( ~ sP2
| doDivides0(xr,xm) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_182,plain,
( doDivides0(xr,xm)
| ~ sP2 ),
inference(cnf_transformation,[],[f310]) ).
tcf(c_194,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_182,c_185,c_187,c_189]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM519+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n011.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/15.41 % CPULimit : 300
% 0.07/15.41 % WCLimit : 300
% 0.07/15.41 % DateTime : Thu Sep 24 04:27:41 UTC 2026
% 0.07/15.42 % CPUTime :
% 0.07/15.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.07/15.46 Running first-order theorem proving
% 0.07/15.46 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.07/15.47
% 0.07/15.47 % ======== iProver multi-core TPTP/SMT =========
% 0.07/15.47
% 0.07/15.47 % Detected problem language: tptp
% 0.07/15.48 % Proving...
% 2.00/16.33 % SZS status Started for theBenchmark.p
% 2.00/16.33 % SZS status Theorem for theBenchmark.p
% 2.00/16.33
% 2.00/16.33 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.00/16.33
% 2.00/16.33 % ------ iProver source info
% 2.00/16.33
% 2.00/16.33 % git: date: 2026-07-19 20:42:38 +0200
% 2.00/16.33 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.00/16.33 % git: non_committed_changes: false
% 2.00/16.33
% 2.00/16.33 % ------ Parsing...
% 2.00/16.33 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.00/16.33
% 2.00/16.33 % ------ Preprocessing...%
% 2.00/16.33
% 2.00/16.33 % SZS status Theorem for theBenchmark.p
% 2.00/16.33
% 2.00/16.33 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.00/16.33
% 2.00/16.33
%------------------------------------------------------------------------------