Numeric.SpecFunctions:$slogFactorial from math-functions-0.1.5.2, A

Time bar (total: 1.4s)

start0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze1.0ms (0.1%)

Memory
1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
0%0%100%0%0%0%0%1
50%50%50%0%0%0%0%2
75%75%25%0%0%0%0%3
87.5%87.5%12.5%0%0%0%0%4
93.8%93.7%6.2%0%0%0%0%5
96.9%96.8%3.1%0%0%0%0%6
98.4%98.4%1.6%0%0%0%0%7
99.2%99.2%0.8%0%0%0%0%8
99.6%99.6%0.4%0%0%0%0%9
99.8%99.8%0.2%0%0%0%0%10
99.9%99.9%0.1%0%0%0%0%11
100%99.9%0%0%0%0%0%12
Compiler

Compiled 7 to 6 computations (14.3% saved)

sample564.0ms (40.2%)

Memory
-2.0MiB live, 666.6MiB allocated; 216ms collecting garbage
Samples
317.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 177.0ms
ival-mult: 106.0ms (59.8% of total)
ival-div: 56.0ms (31.6% of total)
ival-true: 5.0ms (2.8% of total)
exact: 5.0ms (2.8% of total)
ival-assert: 3.0ms (1.7% of total)
adjust: 2.0ms (1.1% of total)
Bogosity

explain47.0ms (3.3%)

Memory
-12.0MiB live, 80.6MiB allocated; 11ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
50-0-(/.f64 #s(literal 1 binary64) (*.f64 x x))
00-0-#s(literal 1 binary64)
00-0-(*.f64 x x)
00-0-x
Explanations
Click to see full explanations table
OperatorSubexpressionExplanationCount
/.f64(/.f64 #s(literal 1 binary64) (*.f64 x x))n/o50
↳(*.f64 x x)overflow64
Confusion
Predicted +Predicted -
+50
-0251
Precision
1.0
Recall
1.0
Confusion?
Predicted +Predicted MaybePredicted -
+500
-00251
Precision?
1.0
Recall?
1.0
Freqs
test
numberfreq
0251
15
Total Confusion?
Predicted +Predicted MaybePredicted -
+100
-000
Precision?
1.0
Recall?
1.0
Samples
20.0ms512×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 10.0ms
ival-mult: 6.0ms (59.5% of total)
ival-div: 3.0ms (29.8% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess183.0ms (13.1%)

Memory
27.1MiB live, 170.5MiB allocated; 18ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0610
12410
26710
310810
423010
5130110
6710010
045
065
1145
2345
3765
41825
510375
084225
Stop Event
1×iter limit
1×node limit
1×iter limit
1×node limit
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Outputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler

Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶99.1%
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Compiler

Compiled 5 to 4 computations (20% saved)

simplify138.0ms (9.8%)

Memory
-26.9MiB live, 159.4MiB allocated; 30ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(*.f64 x x)
cost-diff0
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
11410
23410
37610
418210
5103710
0842210
Stop Event
1×iter limit
1×node limit
1×iter limit
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
#s(literal 1 binary64)
(*.f64 x x)
x
Outputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
#s(literal 1 binary64)
(*.f64 x x)
x

localize13.0ms (0.9%)

Memory
18.8MiB live, 18.8MiB allocated; 0ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(*.f64 x x)
accuracy0.5751658163329618
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Samples
9.0ms256×0valid
Compiler

Compiled 12 to 6 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 4.0ms
ival-div: 2.0ms (51% of total)
ival-mult: 2.0ms (51% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series1.0ms (0.1%)

Memory
2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Counts
2 → 2
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
(*.f64 x x)
Outputs
(/ 1 (pow x 2))
(pow x 2)
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@0
((/ 1 (* x x)) (* x x))
0.0ms
x
@-inf
((/ 1 (* x x)) (* x x))
0.0ms
x
@inf
((/ 1 (* x x)) (* x x))

simplify135.0ms (9.6%)

Memory
-13.5MiB live, 131.2MiB allocated; 24ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
058
198
2218
3538
41998
522328
088238
Stop Event
1×iter limit
1×node limit
Counts
2 → 2
Calls
Call 1
Inputs
(/ 1 (pow x 2))
(pow x 2)
Outputs
(/ 1 (pow x 2))
(/.f64 #s(literal 1 binary64) (*.f64 x x))
(pow x 2)
(*.f64 x x)

rewrite42.0ms (3%)

Memory
-5.6MiB live, 41.1MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
048
068
1226
2826
03426
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 43
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
(*.f64 x x)
Outputs
(*.f64 (fabs.f64 (pow.f64 x #s(literal -1 binary64))) (fabs.f64 (pow.f64 x #s(literal -1 binary64))))
(*.f64 (pow.f64 x #s(literal -1 binary64)) (pow.f64 x #s(literal -1 binary64)))
(pow.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal -1/2 binary64))
(pow.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal -2 binary64))
(pow.f64 (*.f64 x x) #s(literal -1 binary64))
(pow.f64 x #s(literal -2 binary64))
(/.f64 (*.f64 #s(literal -1 binary64) (pow.f64 x #s(literal -1 binary64))) (neg.f64 x))
(/.f64 (*.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -1 binary64))) x)
(/.f64 (*.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal -1 binary64)) (neg.f64 x))
(/.f64 (*.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 1 binary64)) x)
(/.f64 (pow.f64 x #s(literal -1 binary64)) (neg.f64 x))
(/.f64 (pow.f64 x #s(literal -1 binary64)) x)
(/.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) (*.f64 x x)))
(/.f64 #s(literal -1 binary64) (*.f64 x x))
(/.f64 #s(literal 1 binary64) (*.f64 x x))
(neg.f64 (pow.f64 x #s(literal -2 binary64)))
(fma.f64 (fabs.f64 (pow.f64 x #s(literal -1 binary64))) (fabs.f64 (pow.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 0 binary64) (*.f64 x x)))
(fma.f64 (pow.f64 x #s(literal -1 binary64)) (pow.f64 x #s(literal -1 binary64)) (/.f64 #s(literal 0 binary64) (*.f64 x x)))
(exp.f64 (-.f64 #s(literal 0 binary64) (*.f64 (log.f64 x) #s(literal 2 binary64))))
(exp.f64 (neg.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))))
(exp.f64 (*.f64 (log.f64 x) #s(literal -2 binary64)))
(exp.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64)))
(+.f64 (cosh.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))) (sinh.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))))
(+.f64 (pow.f64 x #s(literal -2 binary64)) (/.f64 #s(literal 0 binary64) (*.f64 x x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (neg.f64 x) x)
(*.f64 (*.f64 x x) #s(literal 1 binary64))
(*.f64 x (neg.f64 x))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(/.f64 #s(literal 1 binary64) (pow.f64 x #s(literal -2 binary64)))
(neg.f64 (*.f64 x x))
(sqrt.f64 (*.f64 (*.f64 x x) (*.f64 x x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)) #s(literal 1 binary64)))
(exp.f64 (*.f64 (log.f64 (neg.f64 x)) #s(literal 2 binary64)))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal 2 binary64))))

eval4.0ms (0.3%)

Memory
7.0MiB live, 7.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 330 to 97 computations (70.6% saved)

prune2.0ms (0.1%)

Memory
3.9MiB live, 3.9MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (1 fresh and 1 done)

PrunedKeptTotal
New44145
Fresh000
Picked011
Done000
Total44246
Accuracy
100.0%
Counts
46 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(pow.f64 x #s(literal -2 binary64))
✓99.1%
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Compiler

Compiled 8 to 7 computations (12.5% saved)

simplify4.0ms (0.3%)

Memory
4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
cost-diff0
(pow.f64 x #s(literal -2 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
035
045
045
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
(pow.f64 x #s(literal -2 binary64))
x
#s(literal -2 binary64)
Outputs
(pow.f64 x #s(literal -2 binary64))
x
#s(literal -2 binary64)

localize12.0ms (0.8%)

Memory
15.6MiB live, 15.6MiB allocated; 0ms collecting garbage
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(pow.f64 x #s(literal -2 binary64))
Samples
8.0ms256×0valid
Compiler

Compiled 7 to 5 computations (28.6% saved)

Precisions
Click to see histograms. Total time spent on operations: 4.0ms
ival-pow: 3.0ms (85.5% of total)
ival-true: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series1.0ms (0%)

Memory
1.1MiB live, 1.1MiB allocated; 0ms collecting garbage
Counts
1 → 1
Calls
Call 1
Inputs
(pow.f64 x #s(literal -2 binary64))
Outputs
(/ 1 (pow x 2))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@0
((pow x -2))
0.0ms
x
@-inf
((pow x -2))
0.0ms
x
@inf
((pow x -2))

simplify138.0ms (9.9%)

Memory
-23.6MiB live, 121.6MiB allocated; 37ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
055
195
2215
3535
41995
522325
088235
Stop Event
1×iter limit
1×node limit
Counts
1 → 1
Calls
Call 1
Inputs
(/ 1 (pow x 2))
Outputs
(/ 1 (pow x 2))
(/.f64 #s(literal 1 binary64) (*.f64 x x))

rewrite19.0ms (1.3%)

Memory
21.2MiB live, 21.2MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
033
043
1123
0393
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
1 → 9
Calls
Call 1
Inputs
(pow.f64 x #s(literal -2 binary64))
Outputs
(*.f64 (neg.f64 (pow.f64 x #s(literal -1 binary64))) (neg.f64 (pow.f64 x #s(literal -1 binary64))))
(*.f64 (fabs.f64 (pow.f64 x #s(literal -1 binary64))) (fabs.f64 (pow.f64 x #s(literal -1 binary64))))
(*.f64 (pow.f64 x #s(literal -1 binary64)) (pow.f64 x #s(literal -1 binary64)))
(pow.f64 (exp.f64 (log.f64 x)) #s(literal -2 binary64))
(pow.f64 (*.f64 x x) #s(literal -1 binary64))
(pow.f64 (pow.f64 x #s(literal -1 binary64)) #s(literal 2 binary64))
(pow.f64 x #s(literal -2 binary64))
(exp.f64 (*.f64 (log.f64 x) #s(literal -2 binary64)))
(+.f64 (cosh.f64 (*.f64 (log.f64 x) #s(literal -2 binary64))) (sinh.f64 (*.f64 (log.f64 x) #s(literal -2 binary64))))

eval1.0ms (0.1%)

Memory
1.9MiB live, 1.9MiB allocated; 0ms collecting garbage
Compiler

Compiled 68 to 27 computations (60.3% saved)

prune1.0ms (0.1%)

Memory
2.5MiB live, 2.5MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (0 fresh and 2 done)

PrunedKeptTotal
New10010
Fresh000
Picked011
Done011
Total10212
Accuracy
100.0%
Counts
12 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(pow.f64 x #s(literal -2 binary64))
✓99.1%
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes8.0ms (0.6%)

Memory
-36.2MiB live, 10.7MiB allocated; 4ms collecting garbage
Counts
2 → 1
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
(pow.f64 x #s(literal -2 binary64))
Outputs
(pow.f64 x #s(literal -2 binary64))
Calls

3 calls:

1.0ms
x
1.0ms
(/.f64 #s(literal 1 binary64) (*.f64 x x))
1.0ms
(*.f64 x x)
Results
AccuracySegmentsBranch
100.0%1(*.f64 x x)
100.0%1(/.f64 #s(literal 1 binary64) (*.f64 x x))
100.0%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.2%)

Memory
6.8MiB live, 6.8MiB allocated; 0ms collecting garbage
Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts
1 → 1
Calls
Call 1
Inputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Outputs
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Calls

3 calls:

1.0ms
x
1.0ms
(/.f64 #s(literal 1 binary64) (*.f64 x x))
1.0ms
(*.f64 x x)
Results
AccuracySegmentsBranch
99.1%1(*.f64 x x)
99.1%1(/.f64 #s(literal 1 binary64) (*.f64 x x))
99.1%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

simplify50.0ms (3.6%)

Memory
10.2MiB live, 56.9MiB allocated; 5ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
068
188
2118
3198
4428
52158
621618
753258
Stop Event
1×node limit
Calls
Call 1
Inputs
(pow.f64 x #s(literal -2 binary64))
(/.f64 #s(literal 1 binary64) (*.f64 x x))
Outputs
(pow.f64 x #s(literal -2 binary64))
(/.f64 #s(literal 1 binary64) (*.f64 x x))

derivations2.0ms (0.1%)

Memory
3.5MiB live, 3.5MiB allocated; 0ms collecting garbage
Stop Event
1×done
Compiler

Compiled 8 to 6 computations (25% saved)

preprocess33.0ms (2.4%)

Memory
5.2MiB live, 51.2MiB allocated; 10ms collecting garbage
Remove

(abs x)

Compiler

Compiled 48 to 40 computations (16.7% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

Profiling

Loading profile data...