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.3MiB live, 0.3MiB 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)

sample658.0ms (61.6%)

Memory

-29.9MiB live, 744.3MiB allocated; 284ms collecting garbage

Samples

450.0ms

8 256×

valid

Precisions

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

ival-mult!: 121.0ms (73.4% of total)

ival-sub!: 42.0ms (25.5% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess50.0ms (4.7%)

Memory

-9.5MiB live, 37.5MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 4 (0.0ms)

Iter	Nodes	Cost
0	11	22
1	29	22
2	83	22
3	237	22
4	757	21
5	3878	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

6.5MiB live, 6.5MiB 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)

rewrite75.0ms (7%)

Memory

11.5MiB live, 105.1MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	23	95
0	26	93
1	97	93
0	538	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.7%)

Memory: 20.2MiB live, 20.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 473 to 213 computations (55% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	81	3	84
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	82	3	85

Accuracy

100.0%

Counts

85 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 21 computations (0% saved)

series11.0ms (1%)

Memory

-34.7MiB live, 15.6MiB allocated; 3ms 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
9.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

9.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))

rewrite99.0ms (9.2%)

Memory

34.1MiB live, 114.3MiB allocated; 21ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	32	167
0	36	169
1	133	52
0	982	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.9MiB live, 2.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 54 to 35 computations (35.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	12	1	13
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	12	4	16

Accuracy

100.0%

Counts

16 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
✓	49.6%	#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
▶	2.7%	#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
✓	51.3%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 32 to 32 computations (0% saved)

series1.0ms (0.1%)

Memory

2.3MiB live, 2.3MiB 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
0.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)

rewrite98.0ms (9.2%)

Memory

-28.3MiB live, 74.2MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	22	90
0	22	84
1	100	28
0	814	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.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 19 to 13 computations (31.6% saved)

prune2.0ms (0.2%)

Memory

3.9MiB live, 3.9MiB 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))
✓	49.6%	#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
✓	2.7%	#s(approx (- (* (* x x) 2) 1) #s(approx (* x (+ x x)) #s(literal 2 binary64)))
✓	51.3%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 58 to 53 computations (8.6% saved)

regimes7.0ms (0.7%)

Memory

18.4MiB live, 18.4MiB 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)

regimes8.0ms (0.7%)

Memory

-31.9MiB live, 16.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:

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

Results

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

Compiler

Compiled 13 to 13 computations (0% saved)

regimes5.0ms (0.4%)

Memory

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

Accuracy

Total -32.1b remaining (-103%)

Threshold costs -32.1b (-103%)

Counts

2 → 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)))

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
51.3%	1	`(*.f64 x x)`
51.3%	1	`(.f64 (.f64 x x) #s(literal 2 binary64))`
51.3%	1	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
51.3%	1	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

bsearch9.0ms (0.8%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
8.0ms	0.0012558313354053528	7.2840277671398885

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 (68.5% of total)

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

adjust: 0.0ms (0% of total)

derivations8.0ms (0.7%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 19 to 15 computations (21.1% saved)

preprocess22.0ms (2.1%)

Memory: -6.3MiB live, 40.3MiB allocated; 3ms collecting garbage
Remove: (abs x)
Compiler: Compiled 83 to 73 computations (12% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample658.0ms (61.6%)

preprocess50.0ms (4.7%)

series3.0ms (0.3%)

rewrite75.0ms (7%)

eval7.0ms (0.7%)

prune3.0ms (0.3%)

series11.0ms (1%)

rewrite99.0ms (9.2%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite98.0ms (9.2%)

eval0.0ms (0%)

prune2.0ms (0.2%)

regimes7.0ms (0.7%)

regimes8.0ms (0.7%)

regimes5.0ms (0.4%)

bsearch9.0ms (0.8%)

derivations8.0ms (0.7%)

preprocess22.0ms (2.1%)

end0.0ms (0%)

Profiling