Metrics for Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.7MiB live, 0.7MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
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)

sample481.0ms (50.8%)

Memory

16.1MiB live, 778.9MiB allocated; 168ms collecting garbage

Samples

315.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 163.0ms

ival-mult!: 140.0ms (85.7% of total)

ival-sub!: 22.0ms (13.5% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess74.0ms (7.9%)

Memory

-46.1MiB live, 51.5MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	11	22
1	32	22
2	94	22
3	293	21
4	1643	21

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	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

7.1MiB live, 7.1MiB 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:

Time	Variable		Point	Expression
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)

rewrite72.0ms (7.6%)

Memory

20.5MiB live, 109.2MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	95
0	26	93
1	97	93
0	539	87

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	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))

eval7.0ms (0.8%)

Memory: 25.3MiB live, 25.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 470 to 210 computations (55.3% saved)

prune5.0ms (0.5%)

Memory

-38.2MiB live, 6.7MiB allocated; 5ms collecting garbage

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	80	3	83
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	81	3	84

Accuracy

100.0%

Counts

84 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
▶	48.9%	#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
▶	52.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 21 computations (0% saved)

series3.0ms (0.3%)

Memory

9.1MiB live, 9.1MiB 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:

Time	Variable		Point	Expression
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))

Time

Variable

Point

Expression

1.0ms

-inf

((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))

1.0ms

((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))

1.0ms

inf

((- (* (* x x) 2) 1) -1 (- (* (* x x) 2) 1) (* x (+ x x)) x (+ x x) (+ (* x (+ x x)) -1))

rewrite93.0ms (9.9%)

Memory

2.3MiB live, 115.9MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	32	167
0	36	169
1	133	52
0	983	52

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	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.6MiB live, 2.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 44 to 27 computations (38.6% saved)

prune1.0ms (0.1%)

Memory

4.0MiB live, 4.0MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	8	1	9
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	8	4	12

Accuracy

100.0%

Counts

12 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
✓	48.9%	#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.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 32 to 32 computations (0% saved)

series1.0ms (0.2%)

Memory

4.4MiB live, 4.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:

Time	Variable		Point	Expression
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)

rewrite81.0ms (8.6%)

Memory

-25.9MiB live, 117.7MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	90
0	22	84
1	100	28
0	815	28

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	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: 0.7MiB live, 0.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 19 to 13 computations (31.6% saved)

prune2.0ms (0.2%)

Memory

3.3MiB live, 3.3MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	3	0	3
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	3	4	7

Accuracy

100.0%

Counts

7 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
✓	48.9%	#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.1%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 58 to 53 computations (8.6% saved)

regimes7.0ms (0.8%)

Memory

15.1MiB live, 15.1MiB 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

Accuracy	Segments	Branch
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%	1	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

regimes40.0ms (4.2%)

Memory

-33.1MiB live, 14.1MiB allocated; 2ms 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:

35.0ms	(*.f64 x x)
1.0ms	x
1.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
1.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Results

Accuracy	Segments	Branch
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%	2	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

regimes5.0ms (0.5%)

Memory

11.1MiB live, 11.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

Accuracy	Segments	Branch
53.8%	2	`(*.f64 x x)`
53.8%	2	`(.f64 (.f64 x x) #s(literal 2 binary64))`
53.8%	2	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
53.8%	2	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

regimes4.0ms (0.4%)

Memory

9.3MiB live, 9.3MiB 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

Accuracy	Segments	Branch
52.1%	1	`(*.f64 x x)`
52.1%	1	`(.f64 (.f64 x x) #s(literal 2 binary64))`
52.1%	1	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
52.1%	1	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

bsearch9.0ms (0.9%)

Memory

13.1MiB live, 13.1MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
8.0ms	0.014210951820443934	278.74315824015366

Samples

3.0ms

128×

valid

Compiler

Compiled 146 to 162 computations (-11% saved)

Precisions

Click to see histograms. Total time spent on operations: 1.0ms

ival-mult!: 1.0ms (72.2% of total)

ival-sub!: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

bsearch1.0ms (0.1%)

Memory

1.2MiB live, 1.2MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
1.0ms	0.014210951820443934	278.74315824015366

Compiler

Compiled 162 to 178 computations (-9.9% saved)

derivations26.0ms (2.7%)

Memory

-28.6MiB live, 18.7MiB allocated; 1ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 27 to 21 computations (22.2% saved)

preprocess29.0ms (3.1%)

Memory: 26.7MiB live, 71.3MiB allocated; 5ms 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

start0.0ms (0%)

analyze0.0ms (0%)

sample481.0ms (50.8%)

preprocess74.0ms (7.9%)

series3.0ms (0.3%)

rewrite72.0ms (7.6%)

eval7.0ms (0.8%)

prune5.0ms (0.5%)

series3.0ms (0.3%)

rewrite93.0ms (9.9%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.2%)

rewrite81.0ms (8.6%)

eval0.0ms (0%)

prune2.0ms (0.2%)

regimes7.0ms (0.8%)

regimes40.0ms (4.2%)

regimes5.0ms (0.5%)

regimes4.0ms (0.4%)

bsearch9.0ms (0.9%)

bsearch1.0ms (0.1%)

derivations26.0ms (2.7%)

preprocess29.0ms (3.1%)

end0.0ms (0%)

Profiling