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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample705.0ms (47.5%)

Memory

33.4MiB live, 739.1MiB allocated; 135ms collecting garbage

Samples

442.0ms

8 256×

valid

Precisions

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

ival-mult: 113.0ms (51.6% of total)

ival-sub: 93.0ms (42.5% of total)

exact: 9.0ms (4.1% of total)

adjust: 2.0ms (0.9% of total)

ival-assert: 2.0ms (0.9% of total)

Bogosity

explain75.0ms (5%)

Memory

19.9MiB live, 161.3MiB allocated; 20ms 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

22.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

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

ival-mult: 7.0ms (66% of total)

ival-sub: 2.0ms (18.9% of total)

exact: 1.0ms (9.4% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess185.0ms (12.4%)

Memory

-1.9MiB live, 227.1MiB allocated; 49ms 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.9MiB live, 0.9MiB 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.2%)

Memory

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

rewrite101.0ms (6.8%)

Memory

-39.7MiB live, 120.9MiB allocated; 30ms 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.6%)

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

prune21.0ms (1.4%)

Memory

-37.0MiB live, 7.6MiB allocated; 6ms 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))
▶	55.8%	#s(approx (- (* (* x x) 2) 1) #s(literal -1 binary64))

Compiler

Compiled 15 to 12 computations (20% saved)

series2.0ms (0.2%)

Memory

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

rewrite104.0ms (7%)

Memory

36.0MiB live, 79.4MiB allocated; 23ms 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.1%)

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

prune13.0ms (0.9%)

Memory

-38.7MiB live, 5.9MiB allocated; 9ms collecting garbage

Pruning

4 alts after pruning (2 fresh and 2 done)

	Pruned	Kept	Total
New	13	2	15
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	13	4	17

Accuracy

100.0%

Counts

17 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 32 to 26 computations (18.8% saved)

series2.0ms (0.1%)

Memory

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

Counts

6 → 10

Calls

Call 1

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

rewrite56.0ms (3.8%)

Memory

12.8MiB live, 57.5MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	30	147
0	32	133
1	140	53
0	1109	53

Stop Event

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

Counts

16 → 29

Calls

Call 1

Inputs
#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 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.2%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 393 to 58 computations (85.2% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	24	0	24
Fresh	0	0	0
Picked	0	2	2
Done	0	2	2
Total	24	4	28

Accuracy

100.0%

Counts

28 → 4

Alt Table

Click to see full alt table

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

Compiler

Compiled 71 to 45 computations (36.6% saved)

regimes10.0ms (0.6%)

Memory

-28.2MiB live, 18.1MiB allocated; 2ms 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(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:

4.0ms	(*.f64 x x)
2.0ms	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
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)

regimes6.0ms (0.4%)

Memory

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

Counts

3 → 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))
(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:

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes5.0ms (0.3%)

Memory

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

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

regimes4.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 16 to 13 computations (18.8% saved)

bsearch85.0ms (5.7%)

Memory

-31.5MiB live, 20.7MiB allocated; 15ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
84.0ms	-0.9999999999999996	204.86357269098173

Samples

9.0ms

256×

valid

Compiler

Compiled 298 to 298 computations (0% saved)

Precisions

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

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

simplify56.0ms (3.8%)

Memory

-7.3MiB live, 39.8MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	51
1	33	51
2	73	51
3	233	51
4	1104	51
5	4518	51

Stop Event

1×	node limit

Calls

Call 1

Inputs
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
(if (<=.f64 (-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64)) #s(literal 2226424786380417/202402253307310618352495346718917307049556649764142118356901358027430339567995346891960383701437124495187077864316811911389808737385793476867013399940738509921517424276566361364466907742093216341239767678472745068562007483424692698618103355649159556340810056512358769552333414615230502532186327508646006263307707741093494784 binary64)) #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) #s(literal -1 binary64))

Outputs
(fma.f64 x (+.f64 x x) #s(literal -1 binary64))
(fma.f64 x #s(approx (+ x x) #s(literal 2 binary64)) #s(literal -1 binary64))
(if (<=.f64 (-.f64 (.f64 (.f64 x x) #s(literal 2 binary64)) #s(literal 1 binary64)) #s(literal 2226424786380417/202402253307310618352495346718917307049556649764142118356901358027430339567995346891960383701437124495187077864316811911389808737385793476867013399940738509921517424276566361364466907742093216341239767678472745068562007483424692698618103355649159556340810056512358769552333414615230502532186327508646006263307707741093494784 binary64)) #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) #s(literal -1 binary64))

derivations13.0ms (0.9%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 51 to 22 computations (56.9% saved)

preprocess23.0ms (1.5%)

Memory: -6.1MiB live, 38.0MiB allocated; 6ms collecting garbage
Remove: (abs x)
Compiler: Compiled 128 to 64 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample705.0ms (47.5%)

explain75.0ms (5%)

preprocess185.0ms (12.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series3.0ms (0.2%)

rewrite101.0ms (6.8%)

eval9.0ms (0.6%)

prune21.0ms (1.4%)

series2.0ms (0.2%)

rewrite104.0ms (7%)

eval1.0ms (0.1%)

prune13.0ms (0.9%)

series2.0ms (0.1%)

rewrite56.0ms (3.8%)

eval2.0ms (0.2%)

prune3.0ms (0.2%)

regimes10.0ms (0.6%)

regimes6.0ms (0.4%)

regimes5.0ms (0.3%)

regimes4.0ms (0.3%)

bsearch85.0ms (5.7%)

simplify56.0ms (3.8%)

derivations13.0ms (0.9%)

preprocess23.0ms (1.5%)

end0.0ms (0%)

Profiling