TSTP Solution File: NUM514+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUM514+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n031.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 : Fri May 3 02:49:40 EDT 2024
% Result : Theorem 3.65s 1.18s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 93 ( 42 unt; 0 def)
% Number of atoms : 317 ( 103 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 376 ( 152 ~; 142 |; 65 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 66 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
aNaturalNumber0(sz00),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsC) ).
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] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefDiv) ).
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(f41,axiom,
( doDivides0(xp,sdtasdt0(xn,xm))
& isPrime0(xp) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1860) ).
fof(f45,axiom,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2306) ).
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,
( sdtasdt0(xn,xm) = sdtasdt0(sdtsldt0(sdtasdt0(xp,xk),xr),xr)
& sdtasdt0(xn,xm) = sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2576) ).
fof(f55,axiom,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2613) ).
fof(f56,conjecture,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f57,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(negated_conjecture,[],[f56]) ).
fof(f60,plain,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(flattening,[],[f57]) ).
fof(f63,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f64,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f63]) ).
fof(f107,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f108,plain,
! [X0,X1] :
( ( doDivides0(X0,X1)
<=> ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f107]) ).
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(ennf_transformation,[],[f31]) ).
fof(f110,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,[],[f109]) ).
fof(f121,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(f122,plain,
! [X0] :
( ( isPrime0(X0)
<=> ( ! [X1] :
( X0 = X1
| sz10 = X1
| ~ doDivides0(X1,X0)
| ~ aNaturalNumber0(X1) )
& sz10 != X0
& sz00 != X0 ) )
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f121]) ).
fof(f134,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X2] :
( sdtasdt0(X0,X2) = X1
& aNaturalNumber0(X2) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f108]) ).
fof(f135,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f134]) ).
fof(f136,plain,
! [X0,X1] :
( ? [X3] :
( sdtasdt0(X0,X3) = X1
& aNaturalNumber0(X3) )
=> ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X0,X1] :
( ( ( doDivides0(X0,X1)
| ! [X2] :
( sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2) ) )
& ( ( sdtasdt0(X0,sK1(X0,X1)) = X1
& aNaturalNumber0(sK1(X0,X1)) )
| ~ doDivides0(X0,X1) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f135,f136]) ).
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,[],[f110]) ).
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,[],[f122]) ).
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(f151,plain,
! [X0,X1] :
( aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f196,plain,
! [X2,X0,X1] :
( doDivides0(X0,X1)
| sdtasdt0(X0,X2) != X1
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f137]) ).
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(f219,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f41]) ).
fof(f220,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f41]) ).
fof(f227,plain,
xk = sdtsldt0(sdtasdt0(xn,xm),xp),
inference(cnf_transformation,[],[f45]) ).
fof(f232,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f48]) ).
fof(f233,plain,
doDivides0(xr,xk),
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,
sdtasdt0(xn,xm) = sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr),
inference(cnf_transformation,[],[f54]) ).
fof(f245,plain,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f55]) ).
fof(f246,plain,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(cnf_transformation,[],[f60]) ).
fof(f253,plain,
! [X2,X0] :
( doDivides0(X0,sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(sdtasdt0(X0,X2))
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f196]) ).
fof(f256,plain,
! [X0,X1] :
( aNaturalNumber0(sdtsldt0(X1,X0))
| ~ doDivides0(X0,X1)
| sz00 = X0
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(equality_resolution,[],[f197]) ).
fof(f258,plain,
( ~ isPrime0(sz00)
| ~ aNaturalNumber0(sz00) ),
inference(equality_resolution,[],[f205]) ).
cnf(c_49,plain,
aNaturalNumber0(sz00),
inference(cnf_transformation,[],[f147]) ).
cnf(c_53,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f151]) ).
cnf(c_95,plain,
( ~ aNaturalNumber0(sdtasdt0(X0,X1))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(cnf_transformation,[],[f253]) ).
cnf(c_100,plain,
( ~ doDivides0(X0,X1)
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| X0 = sz00
| aNaturalNumber0(sdtsldt0(X1,X0)) ),
inference(cnf_transformation,[],[f256]) ).
cnf(c_112,plain,
( ~ aNaturalNumber0(sz00)
| ~ isPrime0(sz00) ),
inference(cnf_transformation,[],[f258]) ).
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_120,plain,
doDivides0(xp,sdtasdt0(xn,xm)),
inference(cnf_transformation,[],[f220]) ).
cnf(c_121,plain,
isPrime0(xp),
inference(cnf_transformation,[],[f219]) ).
cnf(c_128,plain,
sdtsldt0(sdtasdt0(xn,xm),xp) = xk,
inference(cnf_transformation,[],[f227]) ).
cnf(c_133,plain,
isPrime0(xr),
inference(cnf_transformation,[],[f234]) ).
cnf(c_134,plain,
doDivides0(xr,xk),
inference(cnf_transformation,[],[f233]) ).
cnf(c_135,plain,
aNaturalNumber0(xr),
inference(cnf_transformation,[],[f232]) ).
cnf(c_141,plain,
doDivides0(xr,xn),
inference(cnf_transformation,[],[f240]) ).
cnf(c_145,plain,
sdtasdt0(sdtasdt0(sdtsldt0(xn,xr),xm),xr) = sdtasdt0(xn,xm),
inference(cnf_transformation,[],[f243]) ).
cnf(c_146,plain,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
inference(cnf_transformation,[],[f245]) ).
cnf(c_147,negated_conjecture,
~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(cnf_transformation,[],[f246]) ).
cnf(c_193,plain,
~ isPrime0(sz00),
inference(global_subsumption_just,[status(thm)],[c_112,c_49,c_112]) ).
cnf(c_197,plain,
( ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1)
| doDivides0(X0,sdtasdt0(X0,X1)) ),
inference(global_subsumption_just,[status(thm)],[c_95,c_53,c_95]) ).
cnf(c_839,plain,
~ doDivides0(xp,sdtasdt0(xp,sdtsldt0(xk,xr))),
inference(demodulation,[status(thm)],[c_147,c_146]) ).
cnf(c_840,plain,
sdtasdt0(sdtasdt0(xp,sdtsldt0(xk,xr)),xr) = sdtasdt0(xn,xm),
inference(light_normalisation,[status(thm)],[c_145,c_146]) ).
cnf(c_1698,plain,
sz00 != xp,
inference(resolution_lifted,[status(thm)],[c_193,c_121]) ).
cnf(c_1702,plain,
sz00 != xr,
inference(resolution_lifted,[status(thm)],[c_193,c_133]) ).
cnf(c_4984,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(xm)
| aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr))) ),
inference(superposition,[status(thm)],[c_146,c_53]) ).
cnf(c_5007,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_4984,c_117]) ).
cnf(c_5049,plain,
( ~ aNaturalNumber0(sdtsldt0(xk,xr))
| ~ aNaturalNumber0(xp) ),
inference(superposition,[status(thm)],[c_197,c_839]) ).
cnf(c_5051,plain,
~ aNaturalNumber0(sdtsldt0(xk,xr)),
inference(forward_subsumption_resolution,[status(thm)],[c_5049,c_116]) ).
cnf(c_5096,plain,
( ~ aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr)))
| ~ aNaturalNumber0(xr)
| aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_840,c_53]) ).
cnf(c_5097,plain,
( ~ aNaturalNumber0(sdtasdt0(xp,sdtsldt0(xk,xr)))
| aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5096,c_135]) ).
cnf(c_5844,plain,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_5007,c_5097]) ).
cnf(c_7190,plain,
( ~ doDivides0(xp,sdtasdt0(xn,xm))
| ~ aNaturalNumber0(sdtasdt0(xn,xm))
| ~ aNaturalNumber0(xp)
| sz00 = xp
| aNaturalNumber0(xk) ),
inference(superposition,[status(thm)],[c_128,c_100]) ).
cnf(c_7204,plain,
( ~ doDivides0(xr,xn)
| ~ aNaturalNumber0(xn)
| ~ aNaturalNumber0(xr)
| sz00 = xr
| aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(superposition,[status(thm)],[c_100,c_5844]) ).
cnf(c_7205,plain,
( ~ doDivides0(xr,xk)
| ~ aNaturalNumber0(xk)
| ~ aNaturalNumber0(xr)
| sz00 = xr ),
inference(superposition,[status(thm)],[c_100,c_5051]) ).
cnf(c_7206,plain,
( ~ aNaturalNumber0(xk)
| sz00 = xr ),
inference(forward_subsumption_resolution,[status(thm)],[c_7205,c_135,c_134]) ).
cnf(c_7209,plain,
( sz00 = xr
| aNaturalNumber0(sdtasdt0(xn,xm)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7204,c_135,c_118,c_141]) ).
cnf(c_7212,plain,
( ~ aNaturalNumber0(sdtasdt0(xn,xm))
| sz00 = xp
| aNaturalNumber0(xk) ),
inference(forward_subsumption_resolution,[status(thm)],[c_7190,c_116,c_120]) ).
cnf(c_7281,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_7212,c_7209,c_7206,c_1702,c_1698]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM514+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu May 2 20:10:16 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.65/1.18 % SZS status Started for theBenchmark.p
% 3.65/1.18 % SZS status Theorem for theBenchmark.p
% 3.65/1.18
% 3.65/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.65/1.18
% 3.65/1.18 ------ iProver source info
% 3.65/1.18
% 3.65/1.18 git: date: 2024-05-02 19:28:25 +0000
% 3.65/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.65/1.18 git: non_committed_changes: false
% 3.65/1.18
% 3.65/1.18 ------ Parsing...
% 3.65/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.65/1.18
% 3.65/1.18 ------ Preprocessing... sup_sim: 2 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.65/1.18
% 3.65/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.65/1.18
% 3.65/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.65/1.18 ------ Proving...
% 3.65/1.18 ------ Problem Properties
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18 clauses 91
% 3.65/1.18 conjectures 0
% 3.65/1.18 EPR 33
% 3.65/1.18 Horn 66
% 3.65/1.18 unary 33
% 3.65/1.18 binary 7
% 3.65/1.18 lits 286
% 3.65/1.18 lits eq 81
% 3.65/1.18 fd_pure 0
% 3.65/1.18 fd_pseudo 0
% 3.65/1.18 fd_cond 15
% 3.65/1.18 fd_pseudo_cond 11
% 3.65/1.18 AC symbols 0
% 3.65/1.18
% 3.65/1.18 ------ Schedule dynamic 5 is on
% 3.65/1.18
% 3.65/1.18 ------ no conjectures: strip conj schedule
% 3.65/1.18
% 3.65/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18 ------
% 3.65/1.18 Current options:
% 3.65/1.18 ------
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18 ------ Proving...
% 3.65/1.18
% 3.65/1.18
% 3.65/1.18 % SZS status Theorem for theBenchmark.p
% 3.65/1.18
% 3.65/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.18
% 3.65/1.18
%------------------------------------------------------------------------------