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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample651.0ms (30.4%)

Memory

-10.6MiB live, 976.7MiB allocated; 202ms collecting garbage

Samples

425.0ms

8 256×

valid

Precisions

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

ival-mult: 108.0ms (63.6% of total)

ival-sub: 52.0ms (30.6% of total)

exact: 5.0ms (2.9% of total)

ival-assert: 3.0ms (1.8% of total)

adjust: 2.0ms (1.2% of total)

Bogosity

explain58.0ms (2.7%)

Memory

8.6MiB live, 97.7MiB allocated; 26ms 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

26.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

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

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

preprocess216.0ms (10.1%)

Memory

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

prune0.0ms (0%)

Memory

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

simplify173.0ms (8.1%)

Memory

-3.9MiB live, 102.0MiB allocated; 38ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 x x)
cost-diff	1	(-.f64 (*.f64 x x) #s(literal 1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	15	10
2	42	10
3	114	10
4	376	10
5	2312	10
6	7864	10
0	8002	9

Stop Event

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

Calls

Call 1

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

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

localize18.0ms (0.8%)

Memory

-10.3MiB live, 33.7MiB allocated; 8ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(-.f64 (*.f64 x x) #s(literal 1 binary64))
accuracy	0.0	(*.f64 x x)

Samples

14.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-sub: 6.0ms (68% of total)

ival-mult: 2.0ms (22.7% 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)

series1.0ms (0.1%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

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

simplify187.0ms (8.7%)

Memory

1.6MiB live, 147.3MiB allocated; 38ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	16	45
1	29	45
2	76	45
3	197	45
4	793	45
5	6780	45
0	8346	39

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

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

rewrite56.0ms (2.6%)

Memory

-5.7MiB live, 85.2MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	31	8
0	233	7

Stop Event

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

Counts

2 → 50

Calls

Call 1

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

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

eval5.0ms (0.2%)

Memory: 14.7MiB live, 14.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 451 to 118 computations (73.8% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	51	3	54
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	52	3	55

Accuracy

100.0%

Counts

55 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 20 to 15 computations (25% saved)

simplify156.0ms (7.3%)

Memory

-19.8MiB live, 121.5MiB allocated; 35ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(fma.f64 x x #s(literal -1 binary64))
cost-diff	0	(*.f64 x x)
cost-diff	0	#s(approx (- (* x x) 1) (*.f64 x x))
cost-diff	0	#s(approx (- (* x x) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	27
0	11	25
1	21	25
2	52	25
3	131	25
4	392	25
5	2302	25
6	7899	25
0	8029	25

Stop Event

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

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))
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 x x)
x
(fma.f64 x x #s(literal -1 binary64))
x
#s(literal -1 binary64)

localize16.0ms (0.8%)

Memory

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

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 x x #s(literal -1 binary64))
accuracy	0.0	(*.f64 x x)
accuracy	32.458001642407496	#s(approx (- (* x x) 1) (*.f64 x x))
accuracy	31.427978838732056	#s(approx (- (* x x) 1) #s(literal -1 binary64))

Samples

11.0ms

256×

valid

Compiler

Compiled 24 to 8 computations (66.7% saved)

Precisions

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

ival-mult: 2.0ms (40.2% of total)

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

ival-add: 1.0ms (20.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)

series1.0ms (0.1%)

Memory

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

Counts

4 → 9

Calls

Call 1

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

simplify185.0ms (8.6%)

Memory

-1.5MiB live, 238.1MiB allocated; 27ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	21	83
1	36	83
2	88	83
3	221	83
4	820	83
5	6566	83
0	8129	71

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

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

rewrite204.0ms (9.5%)

Memory

-60.7MiB live, 151.0MiB allocated; 121ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

4 → 72

Calls

Call 1

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

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

eval7.0ms (0.3%)

Memory: 25.0MiB live, 25.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 775 to 160 computations (79.4% saved)

prune4.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	74	0	74
Fresh	0	0	0
Picked	0	3	3
Done	0	0	0
Total	74	3	77

Accuracy

100.0%

Counts

77 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 45 to 26 computations (42.2% saved)

regimes39.0ms (1.8%)

Memory

-18.6MiB live, 24.7MiB allocated; 7ms 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:

36.0ms	x
1.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.2%)

Memory

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch24.0ms (1.1%)

Memory

-31.4MiB live, 18.6MiB allocated; 18ms collecting garbage

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
23.0ms	0.4916708481587397	94.36781108304396

Samples

4.0ms

112×

valid

Compiler

Compiled 120 to 106 computations (11.7% saved)

Precisions

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

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

ival-mult: 1.0ms (52.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)

simplify39.0ms (1.8%)

Memory

-1.0MiB live, 43.4MiB allocated; 8ms 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))

derivations68.0ms (3.2%)

Memory

41.1MiB live, 86.2MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 31 to 12 computations (61.3% saved)

preprocess22.0ms (1%)

Memory: 3.9MiB live, 48.7MiB allocated; 10ms 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%)

sample651.0ms (30.4%)

explain58.0ms (2.7%)

preprocess216.0ms (10.1%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify173.0ms (8.1%)

localize18.0ms (0.8%)

series1.0ms (0.1%)

simplify187.0ms (8.7%)

rewrite56.0ms (2.6%)

eval5.0ms (0.2%)

prune2.0ms (0.1%)

simplify156.0ms (7.3%)

localize16.0ms (0.8%)

series1.0ms (0.1%)

simplify185.0ms (8.6%)

rewrite204.0ms (9.5%)

eval7.0ms (0.3%)

prune4.0ms (0.2%)

regimes39.0ms (1.8%)

regimes4.0ms (0.2%)

regimes3.0ms (0.1%)

bsearch24.0ms (1.1%)

simplify39.0ms (1.8%)

derivations68.0ms (3.2%)

preprocess22.0ms (1%)

end0.0ms (0%)

Profiling