Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2

Time bar (total: 1.0s)

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 9 to 8 computations (11.1% saved)

sample599.0ms (57.2%)

Memory
-24.4MiB live, 897.8MiB allocated; 239ms collecting garbage
Samples
414.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 243.0ms
ival-mult!: 220.0ms (90.6% of total)
ival-sub!: 21.0ms (8.6% of total)
adjust: 1.0ms (0.4% of total)
Bogosity

preprocess53.0ms (5%)

Memory
-23.0MiB live, 23.5MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 4 (0.0ms)

IterNodesCost
01122
12922
28322
323722
475721
5387821
Stop Event
node-limit
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Symmetry

(abs x)

Compiler

Compiled 12 to 12 computations (0% saved)

series3.0ms (0.3%)

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

3 calls:

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

rewrite81.0ms (7.7%)

Memory
6.5MiB live, 103.9MiB allocated; 11ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
02395
02693
19793
053887
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
13 → 88
Calls
Call 1
Inputs
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(*.f64 (*.f64 x x) #s(literal 2 binary64))
(*.f64 x x)
x
#s(literal 2 binary64)
#s(literal 1 binary64)
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* (* x x) 2) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
Outputs
(/.f64 (neg.f64 (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) #s(literal -1 binary64))) (neg.f64 (fma.f64 x (+.f64 x x) #s(literal 1 binary64))))
(/.f64 (neg.f64 (expm1.f64 (*.f64 (log.f64 (*.f64 x (+.f64 x x))) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) (fma.f64 x (+.f64 x x) #s(literal 1 binary64)))))
(/.f64 (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) #s(literal -1 binary64)) (fma.f64 x (+.f64 x x) #s(literal 1 binary64)))
(/.f64 (expm1.f64 (*.f64 (log.f64 (*.f64 x (+.f64 x x))) #s(literal 3 binary64))) (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) (fma.f64 x (+.f64 x x) #s(literal 1 binary64))))
(fma.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (+.f64 (neg.f64 x) (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 2 binary64)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (+.f64 (fabs.f64 x) (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 (*.f64 x (+.f64 x x)) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 x (+.f64 x x)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 (*.f64 x x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 x x (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(-.f64 (/.f64 (*.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64)) (fma.f64 x (+.f64 x x) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x (+.f64 x x) #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 (*.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64)) (*.f64 x (+.f64 x x))) (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) (fma.f64 x (+.f64 x x) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 (*.f64 (*.f64 x x) (*.f64 x x)) #s(literal 4 binary64) (fma.f64 x (+.f64 x x) #s(literal 1 binary64)))))
(-.f64 (*.f64 x (+.f64 x x)) #s(literal 1 binary64))
(+.f64 (*.f64 x x) (-.f64 (*.f64 x x) #s(literal 1 binary64)))
(+.f64 (*.f64 x (+.f64 x x)) #s(literal -1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x))
(*.f64 (*.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x))
(*.f64 (*.f64 #s(literal 2 binary64) x) x)
(*.f64 (neg.f64 x) (*.f64 (neg.f64 x) #s(literal 2 binary64)))
(*.f64 (neg.f64 x) (+.f64 (neg.f64 x) (neg.f64 x)))
(*.f64 (fabs.f64 x) (*.f64 (fabs.f64 x) #s(literal 2 binary64)))
(*.f64 (fabs.f64 x) (+.f64 (fabs.f64 x) (fabs.f64 x)))
(*.f64 (*.f64 x x) #s(literal 2 binary64))
(*.f64 (*.f64 x (+.f64 x x)) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (*.f64 x (+.f64 x x)))
(*.f64 #s(literal 2 binary64) (*.f64 (*.f64 x x) #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x x))
(*.f64 x (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))
(*.f64 x (+.f64 x x))
(*.f64 x (*.f64 #s(literal 2 binary64) x))
(/.f64 (*.f64 (*.f64 x (+.f64 x x)) #s(literal 2 binary64)) #s(literal 2 binary64))
(/.f64 (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x))) (-.f64 (*.f64 x x) (*.f64 x x)))
(/.f64 (+.f64 (pow.f64 (*.f64 x x) #s(literal 3 binary64)) (pow.f64 (*.f64 x x) #s(literal 3 binary64))) (fma.f64 (*.f64 x x) (*.f64 x x) (-.f64 (*.f64 (*.f64 x x) (*.f64 x x)) (*.f64 (*.f64 x x) (*.f64 x x)))))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.f64 x) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 (*.f64 x x) #s(literal 1 binary64) (*.f64 (*.f64 x x) #s(literal 1 binary64)))
(fma.f64 #s(literal 1 binary64) (*.f64 x x) (*.f64 #s(literal 1 binary64) (*.f64 x x)))
(fma.f64 x x (*.f64 x x))
(-.f64 (*.f64 x x) (*.f64 (neg.f64 x) x))
(+.f64 (*.f64 #s(literal 1 binary64) (*.f64 x x)) (*.f64 #s(literal 1 binary64) (*.f64 x x)))
(+.f64 (*.f64 (*.f64 x x) #s(literal 1 binary64)) (*.f64 (*.f64 x x) #s(literal 1 binary64)))
(+.f64 (*.f64 x x) (*.f64 x x))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 (fabs.f64 x) (fabs.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 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (*.f64 x x) #s(literal 1 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(fabs.f64 (*.f64 x x))
(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))))
x
#s(literal 2 binary64)
#s(literal 1 binary64)
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (fma.f64 x (+.f64 x x) #s(literal -1 binary64)))
#s(approx (* (* x x) 2) (*.f64 x (+.f64 x x)))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
#s(approx (- (* (* x x) 2) 1) (*.f64 (*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval8.0ms (0.7%)

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

Compiled 473 to 213 computations (55% saved)

prune3.0ms (0.3%)

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

3 alts after pruning (3 fresh and 0 done)

PrunedKeptTotal
New81384
Fresh000
Picked101
Done000
Total82385
Accuracy
100.0%
Counts
85 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
49.0%
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
52.0%
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 21 computations (0% saved)

series3.0ms (0.3%)

Memory
6.6MiB live, 6.6MiB allocated; 0ms collecting garbage
Counts
7 → 11
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
(*.f64 x (+.f64 x x))
x
(+.f64 x x)
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 -1))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@-inf
((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))
1.0ms
x
@0
((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))
1.0ms
x
@inf
((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))

rewrite93.0ms (8.9%)

Memory
-22.0MiB live, 119.2MiB allocated; 10ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
032167
036169
113352
098252
Stop Event
iter-limit
iter-limit
iter-limit
unsound
iter-limit
Counts
18 → 18
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
(*.f64 x (+.f64 x x))
x
(+.f64 x x)
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx x #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 -1))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (+ (* x (+ x x)) -1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
Outputs
#s(approx (+ (* x (+ x x)) -1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(approx (+ (* x (+ x x)) -1) #s(literal 2 binary64))
#s(literal 2 binary64)
x
#s(literal 2 binary64)
#s(literal 1 binary64)
#s(approx (+ (* x (+ x x)) -1) #s(literal -1 binary64))
#s(approx (+ (* x (+ x x)) -1) #s(literal 1 binary64))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx x x)
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx (+ (* x (+ x x)) -1) #s(literal -1 binary64))
#s(approx (+ (* x (+ x x)) -1) #s(literal 1 binary64))
#s(approx (+ (* x (+ x x)) -1) #s(literal 2 binary64))
#s(approx (+ (* x (+ x x)) -1) (*.f64 (*.f64 x x) #s(literal 1 binary64)))
#s(approx (+ (* x (+ x x)) -1) #s(literal 2 binary64))
#s(approx (+ (* x (+ x x)) -1) (*.f64 (*.f64 x x) #s(literal 1 binary64)))

eval1.0ms (0.1%)

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

Compiled 54 to 35 computations (35.2% saved)

prune1.0ms (0.1%)

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

4 alts after pruning (1 fresh and 3 done)

PrunedKeptTotal
New12113
Fresh000
Picked033
Done000
Total12416
Accuracy
100.0%
Counts
16 → 4
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
49.0%
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
2.9%
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
52.0%
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
Compiler

Compiled 32 to 32 computations (0% saved)

series2.0ms (0.1%)

Memory
3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Counts
3 → 5
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)
Outputs
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
Calls

3 calls:

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

rewrite77.0ms (7.4%)

Memory
-18.4MiB live, 75.0MiB allocated; 4ms collecting garbage
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
02290
02284
110028
081428
Stop Event
iter-limit
iter-limit
iter-limit
unsound
saturated
Counts
8 → 8
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 -1))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (- (* 2 (pow x 2)) 1)))
#s(approx (* x (+ x x)) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* 2 (pow x 2))))
#s(approx (- (* (* x x) 2) 1) #s(hole binary64 (* (pow x 2) (- 2 (/ 1 (pow x 2))))))
Outputs
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 1 binary64))
#s(approx (* x (+ x x)) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) (*.f64 (*.f64 x x) #s(literal 1 binary64)))

eval0.0ms (0%)

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

Compiled 19 to 13 computations (31.6% saved)

prune2.0ms (0.2%)

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

4 alts after pruning (0 fresh and 4 done)

PrunedKeptTotal
New303
Fresh000
Picked011
Done033
Total347
Accuracy
100.0%
Counts
7 → 4
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
49.0%
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
2.9%
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
52.0%
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
Compiler

Compiled 58 to 53 computations (8.6% saved)

regimes7.0ms (0.7%)

Memory
19.3MiB live, 19.3MiB allocated; 0ms collecting garbage
Counts
5 → 1
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Outputs
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
Calls

4 calls:

2.0ms
x
2.0ms
(*.f64 (*.f64 x x) #s(literal 2 binary64))
2.0ms
(*.f64 x x)
2.0ms
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
100.0%1(*.f64 x x)
100.0%1(*.f64 (*.f64 x x) #s(literal 2 binary64))
100.0%1(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
100.0%1x
Compiler

Compiled 13 to 13 computations (0% saved)

regimes8.0ms (0.7%)

Memory
-31.0MiB live, 15.4MiB allocated; 3ms collecting garbage
Counts
3 → 2
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
Calls

4 calls:

2.0ms
x
1.0ms
(*.f64 (*.f64 x x) #s(literal 2 binary64))
1.0ms
(*.f64 x x)
1.0ms
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
99.2%2(*.f64 x x)
99.2%2(*.f64 (*.f64 x x) #s(literal 2 binary64))
99.2%2(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
99.2%2x
Compiler

Compiled 13 to 13 computations (0% saved)

regimes5.0ms (0.5%)

Memory
13.1MiB live, 13.1MiB allocated; 0ms collecting garbage
Counts
2 → 2
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
Calls

4 calls:

1.0ms
x
1.0ms
(*.f64 (*.f64 x x) #s(literal 2 binary64))
1.0ms
(*.f64 x x)
1.0ms
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
53.7%2(*.f64 x x)
53.7%2(*.f64 (*.f64 x x) #s(literal 2 binary64))
53.7%2(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
53.7%2x
Compiler

Compiled 13 to 13 computations (0% saved)

regimes4.0ms (0.4%)

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

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
Calls

4 calls:

1.0ms
x
1.0ms
(*.f64 (*.f64 x x) #s(literal 2 binary64))
1.0ms
(*.f64 x x)
1.0ms
(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
52.0%1(*.f64 x x)
52.0%1(*.f64 (*.f64 x x) #s(literal 2 binary64))
52.0%1(-.f64 (*.f64 (*.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
52.0%1x
Compiler

Compiled 13 to 13 computations (0% saved)

bsearch10.0ms (0.9%)

Memory
18.1MiB live, 18.1MiB allocated; 0ms collecting garbage
Algorithm
binary-search
Stop Event
narrow-enough
Steps
TimeLeftRight
9.0ms
0.002467580383189955
9090422.893389769
Samples
4.0ms144×0valid
Compiler

Compiled 163 to 181 computations (-11% saved)

Precisions
Click to see histograms. Total time spent on operations: 2.0ms
ival-mult!: 1.0ms (61.8% of total)
ival-sub!: 0.0ms (0% of total)
adjust: 0.0ms (0% of total)

bsearch1.0ms (0.1%)

Memory
1.7MiB live, 1.7MiB allocated; 0ms collecting garbage
Algorithm
binary-search
Stop Event
narrow-enough
Steps
TimeLeftRight
1.0ms
0.002467580383189955
9090422.893389769
Compiler

Compiled 181 to 199 computations (-9.9% saved)

derivations48.0ms (4.6%)

Memory
-18.7MiB live, 32.3MiB allocated; 49ms collecting garbage
Stop Event
done
Compiler

Compiled 27 to 21 computations (22.2% saved)

preprocess39.0ms (3.7%)

Memory
-18.2MiB live, 74.3MiB allocated; 16ms collecting garbage
Remove

(abs x)

Compiler

Compiled 129 to 111 computations (14% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...