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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample747.0ms (43.3%)

Memory

-1.1MiB live, 1 151.4MiB allocated; 281ms collecting garbage

Samples

464.0ms

8 256×

valid

Precisions

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

ival-mult: 100.0ms (61.6% of total)

ival-sub: 44.0ms (27.1% of total)

ival-true: 6.0ms (3.7% of total)

exact: 6.0ms (3.7% of total)

ival-assert: 4.0ms (2.5% of total)

adjust: 2.0ms (1.2% of total)

Bogosity

explain49.0ms (2.8%)

Memory

16.4MiB live, 108.5MiB allocated; 6ms 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: 7.0ms

ival-mult: 4.0ms (54.9% of total)

ival-sub: 2.0ms (27.4% 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)

preprocess197.0ms (11.4%)

Memory

-10.8MiB live, 180.3MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	11
1	20	11
2	59	11
3	131	11
4	462	10
5	2638	10
6	7089	10
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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.0MiB live, 1.0MiB 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.1%)

Memory

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

simplify165.0ms (9.5%)

Memory

10.7MiB live, 198.0MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	48
1	30	48
2	77	48
3	203	48
4	799	48
5	6778	48
0	8344	42

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 6

Calls

Call 1

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

rewrite55.0ms (3.2%)

Memory

-14.3MiB live, 88.7MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	31	10
0	233	9

Stop Event

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

Counts

4 → 52

Calls

Call 1

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

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

eval6.0ms (0.3%)

Memory: 13.3MiB live, 13.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 480 to 123 computations (74.4% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	56	3	59
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	57	3	60

Accuracy

100.0%

Counts

60 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 15 computations (25% saved)

series2.0ms (0.1%)

Memory

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

simplify167.0ms (9.7%)

Memory

5.8MiB live, 99.3MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	22	86
1	37	86
2	89	86
3	217	86
4	815	86
5	6550	86
0	8113	74

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

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

rewrite79.0ms (4.6%)

Memory

-1.8MiB live, 55.4MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	25
0	11	23
1	46	23
0	338	23

Stop Event

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

Counts

6 → 74

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

eval32.0ms (1.8%)

Memory: -25.2MiB live, 21.2MiB allocated; 4ms collecting garbage
Compiler: Compiled 862 to 171 computations (80.2% saved)

prune4.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	86	0	86
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	86	3	89

Accuracy

100.0%

Counts

89 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 45 to 26 computations (42.2% saved)

regimes5.0ms (0.3%)

Memory

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

regimes22.0ms (1.3%)

Memory

-37.7MiB live, 9.6MiB allocated; 1ms 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:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.2%)

Memory

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch10.0ms (0.6%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
9.0ms	3.288414224135621e-8	2.4757361783022342

Samples

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

ival-mult: 1.0ms (52.5% 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)

simplify54.0ms (3.1%)

Memory

-17.1MiB live, 30.2MiB allocated; 3ms 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))

derivations107.0ms (6.2%)

Memory

4.6MiB live, 101.1MiB allocated; 8ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 31 to 12 computations (61.3% saved)

preprocess16.0ms (0.9%)

Memory: 34.4MiB live, 34.4MiB allocated; 0ms 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%)

sample747.0ms (43.3%)

explain49.0ms (2.8%)

preprocess197.0ms (11.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify165.0ms (9.5%)

rewrite55.0ms (3.2%)

eval6.0ms (0.3%)

prune2.0ms (0.1%)

series2.0ms (0.1%)

simplify167.0ms (9.7%)

rewrite79.0ms (4.6%)

eval32.0ms (1.8%)

prune4.0ms (0.3%)

regimes5.0ms (0.3%)

regimes22.0ms (1.3%)

regimes3.0ms (0.2%)

bsearch10.0ms (0.6%)

simplify54.0ms (3.1%)

derivations107.0ms (6.2%)

preprocess16.0ms (0.9%)

end0.0ms (0%)

Profiling