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.6MiB live, 0.6MiB 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)

sample546.0ms (45.3%)

Memory

32.5MiB live, 825.5MiB allocated; 261ms collecting garbage

Samples

364.0ms

8 256×

valid

Precisions

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

ival-mult!: 156.0ms (85.2% of total)

ival-sub!: 26.0ms (14.2% of total)

adjust: 2.0ms (1.1% of total)

Bogosity

preprocess58.0ms (4.8%)

Memory

-18.7MiB live, 26.0MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	11	22
1	32	22
2	94	22
3	297	21
4	1672	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.2%)

Memory

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

Counts

6 → 6

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 (* (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)

rewrite78.0ms (6.5%)

Memory

16.7MiB live, 105.7MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	82
0	25	80
1	96	80
0	539	75

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

12 → 87

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 (* (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) (fabs.f64 x)) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 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 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (-.f64 (*.f64 x 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 (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 (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 (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 (*.f64 x (+.f64 x x)) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (*.f64 x x) #s(literal 2 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 (+.f64 x x)) #s(literal -1 binary64))
(+.f64 (.f64 x x) (-.f64 (.f64 x x) #s(literal 1 binary64)))
(.f64 (.f64 #s(literal 2 binary64) (fabs.f64 x)) (fabs.f64 x))
(.f64 (.f64 #s(literal 2 binary64) (neg.f64 x)) (neg.f64 x))
(.f64 (.f64 #s(literal 2 binary64) x) 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 (neg.f64 x) (.f64 (neg.f64 x) #s(literal 2 binary64)))
(*.f64 (neg.f64 x) (+.f64 (neg.f64 x) (neg.f64 x)))
(.f64 (.f64 x (+.f64 x x)) #s(literal 1 binary64))
(.f64 (.f64 x x) #s(literal 2 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 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) (*.f64 x x))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) (*.f64 x x))
(fma.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)) (*.f64 x x))
(fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.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 (.f64 x x) #s(literal 1 binary64)) (.f64 (.f64 x x) #s(literal 1 binary64)))
(+.f64 (.f64 #s(literal 1 binary64) (.f64 x x)) (.f64 #s(literal 1 binary64) (.f64 x x)))
(+.f64 (.f64 x x) (.f64 x x))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (exp.f64 (log.f64 x)) (exp.f64 (log.f64 x)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 x x)
(pow.f64 (exp.f64 (log.f64 x)) #s(literal 2 binary64))
(pow.f64 (fabs.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))
(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 (.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) (*.f64 x x))) x) x))

eval8.0ms (0.6%)

Memory: 20.6MiB live, 20.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 464 to 209 computations (55% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	80	2	82
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	81	2	83

Accuracy

100.0%

Counts

83 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 12 computations (0% saved)

series23.0ms (1.9%)

Memory

-33.0MiB live, 15.8MiB allocated; 24ms collecting garbage

Counts

5 → 6

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
x
(+.f64 x x)

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 #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 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
16.0ms	x	@	inf	((- (* (* x x) 2) 1) -1 (+ (* x (+ x x)) -1) x (+ x x))
6.0ms	x	@	-inf	((- (* (* x x) 2) 1) -1 (+ (* x (+ x x)) -1) x (+ x x))
1.0ms	x	@	0	((- (* (* x x) 2) 1) -1 (+ (* x (+ x x)) -1) x (+ x x))

rewrite85.0ms (7.1%)

Memory

3.1MiB live, 46.9MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	23	86
0	26	84
1	121	29
0	966	29

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

11 → 11

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
x
(+.f64 x x)
#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 #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 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
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
#s(literal 1 binary64)
x
#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)
#s(approx (+ x x) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) x) x))

eval1.0ms (0.1%)

Memory: 1.1MiB live, 1.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 29 to 21 computations (27.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (3 fresh and 2 done)

	Pruned	Kept	Total
New	4	3	7
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	4	5	9

Accuracy

100.0%

Counts

9 → 5

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%	(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
▶	34.4%	#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) x) x))
▶	3.1%	#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
✓	46.5%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 36 to 36 computations (0% saved)

series2.0ms (0.2%)

Memory

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

Counts

10 → 7

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) x) x))
(.f64 (.f64 #s(literal 1 binary64) x) x)
(*.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
#s(approx (+ 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 (* (* 1 x) x) #s(hole binary64 (pow x 2)))
#s(approx (* 1 x) #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 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) 2 (- (* (* x x) 2) 1) (* (* 1 x) x) (* 1 x) 1 x (+ (* x (+ x x)) -1) (+ x x) -1)
1.0ms	x	@	inf	((- (* (* x x) 2) 1) 2 (- (* (* x x) 2) 1) (* (* 1 x) x) (* 1 x) 1 x (+ (* x (+ x x)) -1) (+ x x) -1)
0.0ms	x	@	0	((- (* (* x x) 2) 1) 2 (- (* (* x x) 2) 1) (* (* 1 x) x) (* 1 x) 1 x (+ (* x (+ x x)) -1) (+ x x) -1)

Time

Variable

Point

Expression

1.0ms

-inf

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

1.0ms

inf

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

0.0ms

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

rewrite68.0ms (5.6%)

Memory

-6.5MiB live, 39.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	30	124
0	34	106
1	130	42
0	1050	42

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	iter-limit

Counts

17 → 36

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) x) x))
(.f64 (.f64 #s(literal 1 binary64) x) x)
(*.f64 #s(literal 1 binary64) x)
#s(literal 1 binary64)
x
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
#s(approx (+ 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 (* (* 1 x) x) #s(hole binary64 (pow x 2)))
#s(approx (* 1 x) #s(hole binary64 x))
#s(approx (+ x x) #s(hole binary64 (* 2 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
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(literal 2 binary64)
#s(approx (- (* (* x x) 2) 1) x)
x
#s(literal 1 binary64)
x
#s(literal 1 binary64)
x
#s(literal 1 binary64)
x
#s(literal 1 binary64)
(/.f64 (-.f64 x (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)))) (-.f64 #s(literal -1 binary64) (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) x)))
(/.f64 (neg.f64 (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))) (neg.f64 (-.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))))
(/.f64 (neg.f64 (fma.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))) (neg.f64 (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) (-.f64 x (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))))))
(/.f64 (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64)) (-.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64)))
(/.f64 (fma.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64)) (+.f64 x (-.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (.f64 #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64)))))
(/.f64 (fma.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64)) (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) (-.f64 x (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64)))))
(fma.f64 (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) x #s(literal -1 binary64))
(fma.f64 #s(approx (+ x x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(fma.f64 x (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
(-.f64 (/.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (-.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))) (/.f64 x (-.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 #s(approx (+ x x) #s(literal 2 binary64))) x))
(-.f64 #s(literal -1 binary64) (*.f64 #s(literal -1 binary64) #s(approx (+ x x) #s(literal 2 binary64))))
(+.f64 (/.f64 (.f64 (.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64))) (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x)) (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) (-.f64 x (.f64 #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))))) (/.f64 #s(literal -1 binary64) (fma.f64 (.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(approx (+ x x) #s(literal 2 binary64)) (-.f64 x (.f64 #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))))))
(+.f64 (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (*.f64 #s(approx (+ x x) #s(literal 2 binary64)) x))
#s(approx (+ x 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) x)
#s(approx (- (* (* x x) 2) 1) x)
#s(approx (- (* (* x x) 2) 1) x)
#s(approx (+ x x) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) x)

eval2.0ms (0.1%)

Memory: 2.6MiB live, 2.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 195 to 52 computations (73.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	17	1	18
Fresh	0	0	0
Picked	0	3	3
Done	0	2	2
Total	17	6	23

Accuracy

100.0%

Counts

23 → 6

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%	(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
✓	34.4%	#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) x) x))
▶	4.8%	#s(approx (- (* (* x x) 2) 1) x)
✓	3.1%	#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
✓	46.5%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 43 to 43 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Counts

2 → 5

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) x)
x

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 #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
0.0ms	x	@	inf	((- (* (* x x) 2) 1) x)
0.0ms	x	@	-inf	((- (* (* x x) 2) 1) x)
0.0ms	x	@	0	((- (* (* x x) 2) 1) x)

rewrite72.0ms (5.9%)

Memory

7.1MiB live, 54.0MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	69
0	19	67
1	86	67
0	529	61

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	saturated

Counts

7 → 7

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) x)
x
#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 #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
#s(approx (- (* (* x x) 2) 1) x)
x
#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)
#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))

eval1.0ms (0%)

Memory: 1.2MiB live, 1.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 32 to 22 computations (31.3% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

6 alts after pruning (1 fresh and 5 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	1	4	5
Total	4	6	10

Accuracy

100.0%

Counts

10 → 6

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%	(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
	53.7%	#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
✓	4.8%	#s(approx (- (* (* x x) 2) 1) x)
✓	3.1%	#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
✓	46.5%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 79 to 67 computations (15.2% saved)

regimes10.0ms (0.9%)

Memory

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

Counts

8 → 1

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) x)
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) 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:

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

regimes71.0ms (5.9%)

Memory

-35.3MiB live, 19.9MiB allocated; 6ms collecting garbage

Counts

6 → 2

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) x)
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) (*.f64 x (+.f64 x x)))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 1 binary64) 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:

64.0ms	x
2.0ms	(*.f64 x x)
2.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
2.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Results

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

Compiler

Compiled 13 to 13 computations (0% saved)

regimes7.0ms (0.6%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) x)
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))

Outputs
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #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)
1.0ms	(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Results

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

Compiler

Compiled 13 to 13 computations (0% saved)

regimes6.0ms (0.5%)

Memory

12.0MiB live, 12.0MiB allocated; 0ms 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(literal 2 binary64))
#s(approx (- (* (* x x) 2) 1) x)

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) x)

Calls

4 calls:

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

Results

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

Compiler

Compiled 13 to 13 computations (0% saved)

regimes42.0ms (3.5%)

Memory

-35.2MiB live, 12.3MiB allocated; 1ms 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(literal 2 binary64))

Outputs
#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))
#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))

Calls

4 calls:

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

Compiler

Compiled 13 to 13 computations (0% saved)

regimes4.0ms (0.3%)

Memory

9.9MiB live, 9.9MiB 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
46.5%	1	`(*.f64 x x)`
46.5%	1	`(.f64 (.f64 x x) #s(literal 2 binary64))`
46.5%	1	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
46.5%	1	`x`

Compiler

Compiled 13 to 13 computations (0% saved)

bsearch9.0ms (0.7%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
8.0ms	0.03213698164652218	24.34817131336686

Samples

4.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.4% of total)

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

adjust: 0.0ms (0% of total)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	-0.9979344288213022	1184.6668926101215

Compiler

Compiled 9 to 10 computations (-11.1% saved)

bsearch1.0ms (0.1%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
1.0ms	0.03213698164652218	24.34817131336686

Compiler

Compiled 138 to 154 computations (-11.6% saved)

derivations39.0ms (3.3%)

Memory

0.9MiB live, 45.4MiB allocated; 5ms collecting garbage

Stop Event

1×

fuel

Compiler

Compiled 42 to 29 computations (31% saved)

preprocess62.0ms (5.1%)

Memory: -38.9MiB live, 130.8MiB allocated; 23ms collecting garbage
Remove: (abs x)
Compiler: Compiled 190 to 159 computations (16.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample546.0ms (45.3%)

preprocess58.0ms (4.8%)

series3.0ms (0.2%)

rewrite78.0ms (6.5%)

eval8.0ms (0.6%)

prune3.0ms (0.2%)

series23.0ms (1.9%)

rewrite85.0ms (7.1%)

eval1.0ms (0.1%)

prune1.0ms (0.1%)

series2.0ms (0.2%)

rewrite68.0ms (5.6%)

eval2.0ms (0.1%)

prune2.0ms (0.2%)

series1.0ms (0.1%)

rewrite72.0ms (5.9%)

eval1.0ms (0%)

prune2.0ms (0.2%)

regimes10.0ms (0.9%)

regimes71.0ms (5.9%)

regimes7.0ms (0.6%)

regimes6.0ms (0.5%)

regimes42.0ms (3.5%)

regimes4.0ms (0.3%)

bsearch9.0ms (0.7%)

bsearch0.0ms (0%)

bsearch1.0ms (0.1%)

derivations39.0ms (3.3%)

preprocess62.0ms (5.1%)

end0.0ms (0%)

Profiling