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.5MiB live, 0.5MiB 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)

sample4.7s (85.9%)

Memory

-340.6MiB live, 940.7MiB allocated; 4.8s collecting garbage

Samples

4.3s

8 256×

valid

Precisions

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

ival-mult!: 90.0ms (69.6% of total)

ival-sub!: 38.0ms (29.4% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

explain92.0ms (1.7%)

Memory

13.4MiB live, 108.0MiB allocated; 17ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))`
-	-	`#s(literal 2 binary64)`
-	-	`#s(literal 1 binary64)`
-	-	`(.f64 (.f64 x x) #s(literal 2 binary64))`
-	-	`(*.f64 x x)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

54.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

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

ival-mult!: 5.0ms (78.1% of total)

ival-sub!: 1.0ms (15.6% of total)

adjust: 0.0ms (0% of total)

preprocess211.0ms (3.8%)

Memory

-10.6MiB live, 184.0MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	22
1	29	22
2	83	22
3	237	22
4	757	21
5	3878	21
0	6	7
0	9	7
1	19	7
2	56	7
3	202	7
4	660	7
5	4036	7
0	8535	6

Stop Event

1×	iter-limit
1×	node-limit
1×	iter-limit
1×	node-limit

Calls

Call 1

Inputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))

Outputs
(-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x x) #s(literal -1 binary64))

Symmetry

(abs x)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

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

Compiler

Compiled 7 to 6 computations (14.3% saved)

series3.0ms (0.1%)

Memory

4.1MiB live, 4.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)

rewrite94.0ms (1.7%)

Memory

21.0MiB live, 67.5MiB allocated; 5ms 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 (-.f64 (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64))) (neg.f64 (+.f64 (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)))))
(/.f64 (-.f64 (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)) #s(literal 1 binary64)) (fma.f64 (*.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64)))
(/.f64 (fma.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64) #s(literal -1 binary64)) (+.f64 (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 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 (.f64 #s(literal 2 binary64) x) x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (.f64 (.f64 #s(literal 2 binary64) 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 (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)) (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64))))
(-.f64 (/.f64 (.f64 (pow.f64 (.f64 x x) #s(literal 3 binary64)) #s(literal 8 binary64)) (+.f64 (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 (fma.f64 (.f64 x x) #s(literal 2 binary64) #s(literal 1 binary64)) (pow.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64)))))
(-.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) #s(literal 1 binary64))
(+.f64 (.f64 x x) (-.f64 (.f64 x x) #s(literal 1 binary64)))
(+.f64 (.f64 (.f64 #s(literal 2 binary64) 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 (*.f64 #s(literal 2 binary64) x) x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 (*.f64 #s(literal 2 binary64) 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 (*.f64 #s(literal 2 binary64) 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 (*.f64 #s(literal 2 binary64) x) x #s(literal -1 binary64)))
#s(approx (* (* x x) 2) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (* x x) (*.f64 x x))
#s(approx x x)
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 #s(literal 2 binary64) x) x))
#s(approx (- (* (* x x) 2) 1) (.f64 (.f64 (-.f64 #s(literal 2 binary64) (pow.f64 x #s(literal -2 binary64))) x) x))

eval9.0ms (0.2%)

Memory: 14.4MiB live, 14.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 973 to 214 computations (78% saved)

prune83.0ms (1.5%)

Memory

-36.1MiB live, 16.0MiB allocated; 4ms collecting garbage

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	88	2	90
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	89	2	91

Accuracy

100.0%

Counts

91 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 12 computations (20% saved)

series2.0ms (0%)

Memory

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

Counts

5 → 10

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

rewrite102.0ms (1.9%)

Memory

9.1MiB live, 102.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	29	138
0	30	138
1	126	45
0	973	45

Stop Event

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

Counts

15 → 15

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 (+ x x)) -1) #s(hole binary64 -1))
#s(approx (+ (* x (+ x x)) -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))))))
#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) 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) 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))
#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%)

Memory: 4.0MiB live, 4.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 110 to 27 computations (75.5% saved)

prune2.0ms (0%)

Memory

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

Pruning

5 alts after pruning (3 fresh and 2 done)

	Pruned	Kept	Total
New	12	3	15
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	12	5	17

Accuracy

100.0%

Counts

17 → 5

Alt Table

Click to see full alt table

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

Compiler

Compiled 41 to 34 computations (17.1% saved)

series2.0ms (0%)

Memory

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

Counts

8 → 10

Calls

Call 1

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

Time

Variable

Point

Expression

1.0ms

-inf

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

1.0ms

inf

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

0.0ms

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

rewrite56.0ms (1%)

Memory

-5.9MiB live, 40.0MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	31	157
0	33	131
1	141	57
0	1110	57

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

18 → 31

Calls

Call 1

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

eval2.0ms (0%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 402 to 58 computations (85.6% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	25	0	25
Fresh	0	0	0
Picked	0	3	3
Done	0	2	2
Total	25	5	30

Accuracy

100.0%

Counts

30 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
✓	55.2%	(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
✓	2.9%	#s(approx (- (* (* x x) 2) 1) #s(literal 2 binary64))
✓	2.9%	#s(approx (- (* (* x x) 2) 1) #s(literal 1 binary64))
✓	52.7%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 89 to 54 computations (39.3% saved)

regimes30.0ms (0.6%)

Memory

-18.6MiB live, 30.4MiB allocated; 6ms collecting garbage

Counts

6 → 1

Calls

Call 1

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

24.0ms	(.f64 (.f64 x x) #s(literal 2 binary64))
2.0ms	x
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 16 to 13 computations (18.8% saved)

regimes7.0ms (0.1%)

Memory

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes22.0ms (0.4%)

Memory

-32.8MiB live, 15.0MiB allocated; 1ms 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 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 1 binary64))

Calls

4 calls:

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes4.0ms (0.1%)

Memory

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

bsearch4.0ms (0.1%)

Memory

5.7MiB live, 5.8MiB allocated; 0ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
3.0ms	0.6681968119052772	0.8776874751328755

Samples

1.0ms

48×

valid

Compiler

Compiled 64 to 64 computations (0% saved)

Precisions

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

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

adjust: 0.0ms (0% of total)

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

derivations21.0ms (0.4%)

Memory

-14.7MiB live, 31.6MiB allocated; 3ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 45 to 19 computations (57.8% saved)

preprocess24.0ms (0.4%)

Memory: 7.7MiB live, 53.1MiB allocated; 5ms collecting garbage
Remove: (abs x)
Compiler: Compiled 194 to 112 computations (42.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample4.7s (85.9%)

explain92.0ms (1.7%)

preprocess211.0ms (3.8%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.1%)

rewrite94.0ms (1.7%)

eval9.0ms (0.2%)

prune83.0ms (1.5%)

series2.0ms (0%)

rewrite102.0ms (1.9%)

eval1.0ms (0%)

prune2.0ms (0%)

series2.0ms (0%)

rewrite56.0ms (1%)

eval2.0ms (0%)

prune3.0ms (0.1%)

regimes30.0ms (0.6%)

regimes7.0ms (0.1%)

regimes22.0ms (0.4%)

regimes4.0ms (0.1%)

bsearch4.0ms (0.1%)

derivations21.0ms (0.4%)

preprocess24.0ms (0.4%)

end0.0ms (0%)

Profiling