TSTP Solution File: NUM517+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NUM517+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 11:31:05 EDT 2023
% Result : Theorem 17.47s 3.14s
% Output : CNFRefutation 17.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 97 ( 31 unt; 0 def)
% Number of atoms : 369 ( 115 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 463 ( 191 ~; 187 |; 65 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn; 75 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
fof(f4,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f8,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m_AddZero) ).
fof(f16,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( sz00 = sdtpldt0(X0,X1)
=> ( sz00 = X1
& sz00 = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroAdd) ).
fof(f29,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( sdtlseqdt0(X0,X1)
& X0 != X1 )
=> iLess0(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIH_03) ).
fof(f31,axiom,
! [X0,X1] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X0,X1)
& sz00 != X0 )
=> ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefQuot) ).
fof(f37,axiom,
! [X0] :
( aNaturalNumber0(X0)
=> ( isPrime0(X0)
<=> ( ! [X1] :
( ( doDivides0(X1,X0)
& aNaturalNumber0(X1) )
=> ( X0 = X1
| sz10 = X1 ) )
& sz10 != X0
& sz00 != X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPrime) ).
fof(f39,axiom,
( aNaturalNumber0(xp)
& aNaturalNumber0(xm)
& aNaturalNumber0(xn) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1837) ).
fof(f40,axiom,
! [X0,X1,X2] :
( ( aNaturalNumber0(X2)
& aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ( doDivides0(X2,sdtasdt0(X0,X1))
& isPrime0(X2) )
=> ( iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
=> ( doDivides0(X2,X1)
| doDivides0(X2,X0) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1799) ).
fof(f41,axiom,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(f48,axiom,
( isPrime0(xr)
& doDivides0(xr,xk)
& aNaturalNumber0(xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2342) ).
fof(f52,axiom,
doDivides0(xr,xn),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2487) ).
fof(f54,axiom,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2529) ).
fof(f55,axiom,
( sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
& sdtpldt0(sdtpldt0(xn,xm),xp) != sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2686) ).
fof(f56,conjecture,
( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f57,negated_conjecture,
~ ( doDivides0(xp,xm)
| doDivides0(xp,sdtsldt0(xn,xr)) ),
inference(negated_conjecture,[],[f56]) ).
fof(f60,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f61,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f60]) ).
fof(f68,plain,
! [X0] :
( ( sdtpldt0(sz00,X0) = X0
& sdtpldt0(X0,sz00) = X0 )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f81,plain,
! [X0,X1] :
( ( sz00 = X1
& sz00 = X0 )
| sz00 != sdtpldt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f82,plain,
! [X0,X1] :
( ( sz00 = X1
& sz00 = X0 )
| sz00 != sdtpldt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f81]) ).
fof(f104,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f29]) ).
fof(f105,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f104]) ).
fof(f108,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f109,plain,
! [X0,X1] :
( ! [X2] :
( sdtsldt0(X1,X0) = X2
<=> ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f108]) ).
fof(f120,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 ) )
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f121,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f120]) ).
fof(f124,plain,
! [X0,X1,X2] :
( doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f125,plain,
! [X0,X1,X2] :
( doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f124]) ).
fof(f127,plain,
( ~ doDivides0(xp,xm)
& ~ doDivides0(xp,sdtsldt0(xn,xr)) ),
inference(ennf_transformation,[],[f57]) ).
fof(f138,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f109]) ).
fof(f139,plain,
! [X0,X1] :
( ! [X2] :
( ( sdtsldt0(X1,X0) = X2
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) )
& ( ( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| sdtsldt0(X1,X0) != X2 ) )
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f121]) ).
fof(f141,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f140]) ).
fof(f142,plain,
! [X0] :
( ( ( isPrime0(X0)
| ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X2] :
( X0 = X2
| sz10 = X2
| ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f141]) ).
fof(f143,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& sz10 != X1
& doDivides0(X1,X0)
& aNaturalNumber0(X1) )
=> ( sK2(X0) != X0
& sz10 != sK2(X0)
& doDivides0(sK2(X0),X0)
& aNaturalNumber0(sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0] :
( ( ( isPrime0(X0)
| ( sK2(X0) != X0
& sz10 != sK2(X0)
& doDivides0(sK2(X0),X0)
& aNaturalNumber0(sK2(X0)) )
| sz10 = X0
| sz00 = X0 )
& ( ( ! [X2] :
( X0 = X2
| sz10 = X2
| ~ doDivides0(X2,X0)
| ~ aNaturalNumber0(X2) )
& sz10 != X0
& sz00 != X0 )
| ~ isPrime0(X0) ) )
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f142,f143]) ).
fof(f147,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f2]) ).
fof(f150,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f154,plain,
! [X0] :
( sdtpldt0(X0,sz00) = X0
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f68]) ).
fof(f168,plain,
! [X0,X1] :
( sz00 = X0
| sz00 != sdtpldt0(X0,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f82]) ).
fof(f193,plain,
! [X0,X1] :
( iLess0(X0,X1)
| ~ sdtlseqdt0(X0,X1)
| X0 = X1
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f197,plain,
! [X2,X0,X1] :
( aNaturalNumber0(X2)
| sdtsldt0(X1,X0) != X2
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f205,plain,
! [X0] :
( sz00 != X0
| ~ isPrime0(X0)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f215,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f39]) ).
fof(f216,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f39]) ).
fof(f217,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f39]) ).
fof(f218,plain,
! [X2,X0,X1] :
( doDivides0(X2,X1)
| doDivides0(X2,X0)
| ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ isPrime0(X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f219,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f41]) ).
fof(f232,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f48]) ).
fof(f234,plain,
isPrime0(xr),
inference(cnf_transformation,[],[f48]) ).
fof(f240,plain,
doDivides0(xr,xn),
inference(cnf_transformation,[],[f52]) ).
fof(f243,plain,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(cnf_transformation,[],[f54]) ).
fof(f244,plain,
sdtpldt0(sdtpldt0(xn,xm),xp) != sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),
inference(cnf_transformation,[],[f55]) ).
fof(f245,plain,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(cnf_transformation,[],[f55]) ).
fof(f246,plain,
~ doDivides0(xp,sdtsldt0(xn,xr)),
inference(cnf_transformation,[],[f127]) ).
fof(f247,plain,
~ doDivides0(xp,xm),
inference(cnf_transformation,[],[f127]) ).
fof(f257,plain,
! [X0,X1] :
( aNaturalNumber0(sdtsldt0(X1,X0))
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f197]) ).
fof(f259,plain,
( ~ isPrime0(sz00)
| ~ aNaturalNumber0(sz00) ),
inference(equality_resolution,[],[f205]) ).
cnf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f147]) ).
cnf(c_52,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X0,X1)) ),
inference(cnf_transformation,[],[f150]) ).
cnf(c_57,plain,
( ~ aNaturalNumber0(X0)
| sdtpldt0(X0,sz00) = X0 ),
inference(cnf_transformation,[],[f154]) ).
cnf(c_71,plain,
( sdtpldt0(X0,X1) != sz00
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = sz00 ),
inference(cnf_transformation,[],[f168]) ).
cnf(c_94,plain,
( ~ sdtlseqdt0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = X1
| iLess0(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
cnf(c_100,plain,
( ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = sz00
| aNaturalNumber0(sdtsldt0(X1,X0)) ),
inference(cnf_transformation,[],[f257]) ).
cnf(c_112,negated_conjecture,
( ~ aNaturalNumber0(sz00)
| ~ isPrime0(sz00) ),
inference(cnf_transformation,[],[f259]) ).
cnf(c_116,plain,
aNaturalNumber0(xp),
inference(cnf_transformation,[],[f217]) ).
cnf(c_117,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f216]) ).
cnf(c_118,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f215]) ).
cnf(c_119,plain,
( ~ iLess0(sdtpldt0(sdtpldt0(X0,X1),X2),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X2,sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ isPrime0(X2)
| doDivides0(X2,X0)
| doDivides0(X2,X1) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_121,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f219]) ).
cnf(c_133,plain,
isPrime0(xr),
inference(cnf_transformation,[],[f234]) ).
cnf(c_135,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f232]) ).
cnf(c_141,plain,
doDivides0(xr,xn),
inference(cnf_transformation,[],[f240]) ).
cnf(c_144,plain,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(cnf_transformation,[],[f243]) ).
cnf(c_145,plain,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(cnf_transformation,[],[f245]) ).
cnf(c_146,negated_conjecture,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
inference(cnf_transformation,[],[f244]) ).
cnf(c_147,negated_conjecture,
~ doDivides0(xp,xm),
inference(cnf_transformation,[],[f247]) ).
cnf(c_148,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
inference(cnf_transformation,[],[f246]) ).
cnf(c_153,plain,
( ~ aNaturalNumber0(sz00)
| sdtpldt0(sz00,sz00) = sz00 ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_171,plain,
( sdtpldt0(sz00,sz00) != sz00
| ~ aNaturalNumber0(sz00)
| sz00 = sz00 ),
inference(instantiation,[status(thm)],[c_71]) ).
cnf(c_252,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_263,plain,
( X0 != X1
| ~ isPrime0(X1)
| isPrime0(X0) ),
theory(equality) ).
cnf(c_278,plain,
( X0 != xr
| ~ isPrime0(xr)
| isPrime0(X0) ),
inference(instantiation,[status(thm)],[c_263]) ).
cnf(c_279,plain,
( sz00 != xr
| ~ isPrime0(xr)
| isPrime0(sz00) ),
inference(instantiation,[status(thm)],[c_278]) ).
cnf(c_567,plain,
( ~ aNaturalNumber0(sdtpldt0(xn,xm))
| ~ aNaturalNumber0(xp)
| aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_1396,plain,
( X0 != X1
| xr != X1
| X0 = xr ),
inference(instantiation,[status(thm)],[c_252]) ).
cnf(c_1397,plain,
( sz00 != sz00
| xr != sz00
| sz00 = xr ),
inference(instantiation,[status(thm)],[c_1396]) ).
cnf(c_2474,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn)
| aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_2600,plain,
( ~ sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| iLess0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(resolution,[status(thm)],[c_94,c_146]) ).
cnf(c_3919,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp))
| iLess0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
inference(global_subsumption_just,[status(thm)],[c_2600,c_118,c_117,c_116,c_145,c_567,c_2474,c_2600]) ).
cnf(c_6275,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(xp)
| aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_9263,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(xm)
| aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm)) ),
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_13637,plain,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp))
| ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(xp)
| ~ aNaturalNumber0(xm)
| ~ isPrime0(xp)
| doDivides0(xp,sdtsldt0(xn,xr))
| doDivides0(xp,xm) ),
inference(resolution,[status(thm)],[c_119,c_3919]) ).
cnf(c_15895,plain,
~ aNaturalNumber0(sdtsldt0(xn,xr)),
inference(global_subsumption_just,[status(thm)],[c_13637,c_121,c_117,c_116,c_147,c_148,c_144,c_6275,c_9263,c_13637]) ).
cnf(c_15901,plain,
( ~ doDivides0(xr,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xr)
| xr = sz00 ),
inference(resolution,[status(thm)],[c_15895,c_100]) ).
cnf(c_15902,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_15901,c_1397,c_279,c_171,c_153,c_112,c_141,c_49,c_118,c_133,c_135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM517+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Fri Aug 25 17:07:38 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 17.47/3.14 % SZS status Started for theBenchmark.p
% 17.47/3.14 % SZS status Theorem for theBenchmark.p
% 17.47/3.14
% 17.47/3.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 17.47/3.14
% 17.47/3.14 ------ iProver source info
% 17.47/3.14
% 17.47/3.14 git: date: 2023-05-31 18:12:56 +0000
% 17.47/3.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 17.47/3.14 git: non_committed_changes: false
% 17.47/3.14 git: last_make_outside_of_git: false
% 17.47/3.14
% 17.47/3.14 ------ Parsing...
% 17.47/3.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 17.47/3.14
% 17.47/3.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e sup_sim: 0 sf_s rm: 1 0s sf_e
% 17.47/3.14
% 17.47/3.14 ------ Preprocessing...
% 17.47/3.14
% 17.47/3.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 17.47/3.14 ------ Proving...
% 17.47/3.14 ------ Problem Properties
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14 clauses 92
% 17.47/3.14 conjectures 14
% 17.47/3.14 EPR 34
% 17.47/3.14 Horn 67
% 17.47/3.14 unary 34
% 17.47/3.14 binary 7
% 17.47/3.14 lits 287
% 17.47/3.14 lits eq 79
% 17.47/3.14 fd_pure 0
% 17.47/3.14 fd_pseudo 0
% 17.47/3.14 fd_cond 15
% 17.47/3.14 fd_pseudo_cond 11
% 17.47/3.14 AC symbols 0
% 17.47/3.14
% 17.47/3.14 ------ Input Options Time Limit: Unbounded
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14 ------
% 17.47/3.14 Current options:
% 17.47/3.14 ------
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14 ------ Proving...
% 17.47/3.14
% 17.47/3.14
% 17.47/3.14 % SZS status Theorem for theBenchmark.p
% 17.47/3.14
% 17.47/3.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 17.47/3.14
% 17.47/3.15
%------------------------------------------------------------------------------