Metrics for Data.Random.Dice:roll from dice-0.1

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.1MiB live, 0.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 7 to 6 computations (14.3% saved)

sample611.0ms (55.7%)

Memory

15.7MiB live, 724.2MiB allocated; 226ms collecting garbage

Samples

405.0ms

8 256×

valid

Precisions

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

ival-sub: 121.0ms (58.1% of total)

ival-mult: 78.0ms (37.4% of total)

exact: 5.0ms (2.4% of total)

adjust: 2.0ms (1% of total)

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

Bogosity

explain49.0ms (4.5%)

Memory

1.5MiB live, 95.0MiB allocated; 5ms collecting garbage

FPErrors

Click to see full error table

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

19.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-mult: 5.0ms (58% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess195.0ms (17.7%)

Memory

-14.4MiB live, 176.8MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	16
1	26	16
2	67	16
3	146	16
4	572	15
5	3201	15
6	6936	15
0	4	5
0	6	5
1	15	5
2	42	5
3	114	5
4	376	5
5	2312	5
6	7864	5
0	8002	4

Stop Event

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

Calls

Call 1

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

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

Symmetry

(abs x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.1MiB 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 x x) #s(literal 1 binary64))

Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.2%)

Memory

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

Counts

4 → 6

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x x) 1) (* x x) x 1)
1.0ms	x	@	inf	((- (* x x) 1) (* x x) x 1)
0.0ms	x	@	0	((- (* x x) 1) (* x x) x 1)

rewrite84.0ms (7.6%)

Memory

5.7MiB live, 110.0MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	64
0	21	62
1	72	62
0	505	56

Stop Event

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

Counts

10 → 63

Calls

Call 1

Inputs
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(*.f64 x x)
x
#s(literal 1 binary64)
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

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

eval6.0ms (0.6%)

Memory: 14.9MiB live, 14.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 538 to 142 computations (73.6% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	62	3	65
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	63	3	66

Accuracy

100.0%

Counts

66 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 15 computations (25% saved)

series2.0ms (0.1%)

Memory

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

Counts

6 → 10

Calls

Call 1

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

Outputs
#s(approx (- (* x x) 1) #s(hole binary64 -1))
#s(approx (- (* x x) 1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- (* x x) 1) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) 1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))
1.0ms	x	@	inf	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))
0.0ms	x	@	0	((- (* x x) 1) -1 (- (* x x) 1) (* x x) x (+ (* x x) -1))

rewrite46.0ms (4.2%)

Memory

-24.6MiB live, 69.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	119
0	26	107
1	87	107
0	634	107

Stop Event

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

Counts

16 → 84

Calls

Call 1

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

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

eval8.0ms (0.7%)

Memory: 20.3MiB live, 20.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 857 to 179 computations (79.1% saved)

prune8.0ms (0.8%)

Memory

-33.7MiB live, 15.5MiB allocated; 4ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	85	0	85
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	85	3	88

Accuracy

100.0%

Counts

88 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 x x #s(literal -1 binary64))
✓	50.9%	#s(approx (- (* x x) 1) (*.f64 x x))
✓	50.3%	#s(approx (- (* x x) 1) #s(literal -1 binary64))

Compiler

Compiled 45 to 26 computations (42.2% saved)

regimes5.0ms (0.5%)

Memory

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

Counts

4 → 1

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes4.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.3%)

Memory

8.6MiB live, 8.6MiB 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) 1) #s(literal -1 binary64))

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

Calls

3 calls:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch12.0ms (1.1%)

Memory

-24.4MiB live, 23.0MiB allocated; 1ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
10.0ms	0.00018304646780511715	3616.8788720455555

Samples

5.0ms

144×

valid

Compiler

Compiled 152 to 134 computations (11.8% saved)

Precisions

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

ival-sub: 1.0ms (45.1% of total)

ival-mult: 1.0ms (45.1% of total)

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

simplify35.0ms (3.2%)

Memory

-7.1MiB live, 40.0MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	31
1	20	31
2	47	31
3	126	31
4	497	31
5	2669	31

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

(if (<=.f64 x #s(literal 1 binary64)) #s(approx (- (* x x) 1) #s(literal -1 binary64)) #s(approx (- (* x x) 1) (*.f64 x x)))

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

Outputs

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

(if (<=.f64 x #s(literal 1 binary64)) #s(approx (- (* x x) 1) #s(literal -1 binary64)) #s(approx (- (* x x) 1) (*.f64 x x)))

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

derivations6.0ms (0.6%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 31 to 12 computations (61.3% saved)

preprocess17.0ms (1.6%)

Memory: -8.1MiB live, 38.7MiB allocated; 2ms collecting garbage
Remove: (abs x)
Compiler: Compiled 80 to 38 computations (52.5% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample611.0ms (55.7%)

explain49.0ms (4.5%)

preprocess195.0ms (17.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.2%)

rewrite84.0ms (7.6%)

eval6.0ms (0.6%)

prune2.0ms (0.2%)

series2.0ms (0.1%)

rewrite46.0ms (4.2%)

eval8.0ms (0.7%)

prune8.0ms (0.8%)

regimes5.0ms (0.5%)

regimes4.0ms (0.3%)

regimes3.0ms (0.3%)

bsearch12.0ms (1.1%)

simplify35.0ms (3.2%)

derivations6.0ms (0.6%)

preprocess17.0ms (1.6%)

end0.0ms (0%)

Profiling