Metrics for Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample675.0ms (17.1%)

Memory

45.0MiB live, 1 031.2MiB allocated; 196ms collecting garbage

Samples

410.0ms

8 256×

valid

Precisions

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

ival-sub: 94.0ms (60.1% of total)

ival-add: 46.0ms (29.4% of total)

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

exact: 5.0ms (3.2% of total)

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

adjust: 2.0ms (1.3% of total)

Bogosity

explain59.0ms (1.5%)

Memory

19.4MiB live, 109.2MiB allocated; 31ms collecting garbage

FPErrors

Click to see full error table

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

25.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

ival-sub: 3.0ms (47.1% of total)

ival-add: 3.0ms (47.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)

preprocess297.0ms (7.5%)

Memory

-52.3MiB live, 300.5MiB allocated; 57ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
1	14	13
2	25	11
3	49	11
4	138	11
5	710	10
6	6335	10
0	4	5
0	6	5
1	12	5
2	18	5
3	34	5
4	107	5
5	595	5
6	5537	5
0	8040	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 #s(literal 2 binary64) x #s(literal -1 binary64))

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)

simplify190.0ms (4.8%)

Memory

-1.0MiB live, 235.9MiB allocated; 20ms 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	12	10
2	18	10
3	34	10
4	107	10
5	595	10
6	5537	10
0	8040	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 #s(literal 2 binary64) x #s(literal -1 binary64))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x
#s(literal 1 binary64)

localize12.0ms (0.3%)

Memory

39.2MiB live, 39.2MiB allocated; 0ms 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

8.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

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

ival-add: 1.0ms (32% 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)

series2.0ms (0%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 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))

simplify209.0ms (5.3%)

Memory

-4.1MiB live, 187.2MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2576	19
6	7040	19
0	8462	16

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

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

rewrite202.0ms (5.1%)

Memory

-5.4MiB live, 164.2MiB allocated; 153ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	34	8
0	326	7

Stop Event

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

Counts

2 → 62

Calls

Call 1

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

Outputs
(*.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(*.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)))
(/.f64 (-.f64 (.f64 x x) (.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) (-.f64 x (-.f64 x #s(literal 1 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (.f64 x (-.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64)) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(fma.f64 (.f64 (.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(fma.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (.f64 #s(literal 2 binary64) x)) (fabs.f64 (.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 #s(literal 4 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (.f64 x (.f64 #s(literal 2 binary64) x)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 (.f64 #s(literal 2 binary64) x) (.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(expm1.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(+.f64 (*.f64 #s(literal 2 binary64) x) #s(literal -1 binary64))
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(.f64 (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(.f64 (fabs.f64 (.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 4 binary64) (.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 2 binary64) (.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) x))
(.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (.f64 #s(literal 2 binary64) x) x (.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (.f64 #s(literal 2 binary64) x) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (.f64 x (.f64 #s(literal 2 binary64) x)) (.f64 x (.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval6.0ms (0.2%)

Memory: 20.2MiB live, 20.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 667 to 158 computations (76.3% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	64	1	65
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	64	2	66

Accuracy

100.0%

Counts

66 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	51.8%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 12 to 10 computations (16.7% saved)

simplify217.0ms (5.5%)

Memory

-42.1MiB live, 163.0MiB allocated; 74ms collecting garbage

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
cost-diff	0	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
0	6	8
1	12	8
2	18	8
3	34	8
4	106	8
5	594	8
6	5492	8
0	8408	7

Stop Event

1×	iter limit
1×	node limit
1×	saturated

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)

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

localize11.0ms (0.3%)

Memory

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

Localize:

Found 1 expressions of interest:

New	Metric	Score	Program
accuracy	30.859560497722445	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Samples

7.0ms

256×

valid

Compiler

Compiled 8 to 7 computations (12.5% saved)

Precisions

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

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

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

Memory

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

Counts

1 → 5

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

Calls

3 calls:

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

simplify263.0ms (6.7%)

Memory

-32.0MiB live, 255.1MiB allocated; 63ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2582	19
6	7031	19
0	8453	16

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

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

rewrite105.0ms (2.7%)

Memory

5.2MiB live, 95.1MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	7
0	6	7
1	34	7
0	325	6

Stop Event

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

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

eval0.0ms (0%)

Memory: 0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Compiler: Compiled 26 to 11 computations (57.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	2	1	3
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	2	3	5

Accuracy

100.0%

Counts

5 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 17 computations (19% saved)

simplify193.0ms (4.9%)

Memory

-2.4MiB live, 148.7MiB allocated; 75ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	8	14
1	15	14
2	24	14
3	58	14
4	236	14
5	1163	14
6	7888	14
0	8005	13

Stop Event

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

Calls

Call 1

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

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

localize15.0ms (0.4%)

Memory

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

Localize:

Found 2 expressions of interest:

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

Samples

10.0ms

256×

valid

Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions

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

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

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

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

series1.0ms (0%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

Calls

3 calls:

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

simplify245.0ms (6.2%)

Memory

-21.9MiB live, 164.0MiB allocated; 40ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2582	19
6	7031	19
0	8453	16

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

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

rewrite17.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	12
0	8	12
0	37	12

Stop Event

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

Counts

2 → 6

Calls

Call 1

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

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

eval1.0ms (0%)

Memory: 2.1MiB live, 2.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 107 to 30 computations (72% saved)

prune25.0ms (0.6%)

Memory

-38.9MiB live, 4.6MiB allocated; 15ms collecting garbage

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	8	1	9
Fresh	0	0	0
Picked	1	0	1
Done	0	2	2
Total	9	3	12

Accuracy

100.0%

Counts

12 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶	50.1%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.8%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify224.0ms (5.7%)

Memory

0.4MiB live, 148.1MiB allocated; 24ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 x x)
cost-diff	0	#s(approx (- (+ x x) 1) (+.f64 x x))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	13
0	7	13
1	13	13
2	19	13
3	35	13
4	108	13
5	596	13
6	5548	13
0	8051	12

Stop Event

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

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x

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

localize12.0ms (0.3%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(+.f64 x x)
accuracy	31.92333603976108	#s(approx (- (+ x x) 1) (+.f64 x x))

Samples

8.0ms

256×

valid

Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions

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

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

ival-add: 1.0ms (32.8% 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%)

Memory

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

Counts

2 → 5

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)

Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

Calls

3 calls:

Time	Variable		Point	Expression
0.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))

simplify243.0ms (6.2%)

Memory

-15.2MiB live, 226.6MiB allocated; 18ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2582	19
6	7031	19
0	8453	16

Stop Event

1×	iter limit
1×	node limit

Counts

5 → 5

Calls

Call 1

Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))

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

rewrite105.0ms (2.7%)

Memory

-13.6MiB live, 95.5MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	12
0	7	12
1	35	12
0	327	11

Stop Event

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

Counts

2 → 35

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)

Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(.f64 (.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(.f64 (pow.f64 (.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(.f64 (neg.f64 (.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(.f64 (fabs.f64 (.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 4 binary64) (.f64 x x))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(.f64 #s(literal 2 binary64) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(.f64 #s(literal 2 binary64) (.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(.f64 (.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(.f64 #s(literal 1 binary64) (.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 #s(literal 0 binary64) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (.f64 (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (.f64 #s(literal 2 binary64) x) x (.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (.f64 #s(literal 2 binary64) x) (.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (.f64 x x) #s(literal 0 binary64)) (/.f64 (.f64 x x) #s(literal 0 binary64)))
(exp.f64 (.f64 (log.f64 (.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (.f64 x (.f64 #s(literal 2 binary64) x)) (.f64 x (.f64 #s(literal 2 binary64) x)))
(+.f64 (.f64 (.f64 #s(literal 2 binary64) x) x) (.f64 (.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval3.0ms (0.1%)

Memory: 11.6MiB live, 11.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 549 to 114 computations (79.2% saved)

prune3.0ms (0.1%)

Memory

7.9MiB live, 7.8MiB allocated; 0ms collecting garbage

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	38	0	38
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	38	3	41

Accuracy

100.0%

Counts

41 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓	50.1%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.8%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes49.0ms (1.2%)

Memory

-20.9MiB live, 21.0MiB allocated; 12ms 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))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) #s(literal 1 binary64))

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

Calls

3 calls:

45.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))
2.0ms	(+.f64 x x)
2.0ms	x

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)

regimes5.0ms (0.1%)

Memory

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

Counts

3 → 3

Calls

Call 1

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

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

Calls

3 calls:

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

Results

Accuracy	Segments	Branch
98.2%	3	`(+.f64 x x)`
98.2%	3	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
98.2%	3	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory

13.3MiB live, 13.3MiB 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
51.8%	1	`(+.f64 x x)`
51.8%	1	`(-.f64 (+.f64 x x) #s(literal 1 binary64))`
51.8%	1	`x`

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch80.0ms (2%)

Memory

-38.9MiB live, 51.2MiB allocated; 44ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
12.0ms	5.963293947394416e-13	88108250.91140813
45.0ms	-28473.366371047636	-0.12886321219464955

Samples

10.0ms

320×

valid

Compiler

Compiled 328 to 288 computations (12.2% saved)

Precisions

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

ival-add: 2.0ms (49.3% of total)

ival-sub: 1.0ms (24.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)

simplify33.0ms (0.8%)

Memory

10.3MiB live, 52.2MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	37
1	26	37
2	35	37
3	63	37
4	154	37
5	1149	37

Stop Event

1×	node limit

Calls

Call 1

Inputs

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

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

derivations346.0ms (8.8%)

Memory

9.4MiB live, 297.2MiB allocated; 38ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	12
0	8	12
0	37	12
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2576	19
6	7040	19
0	8462	16
0	12	19
1	23	19
2	49	19
3	99	19
4	438	19
5	2582	19
6	7031	19
0	8453	16

Stop Event

1×	done
1×	iter limit
1×	node limit
1×	iter limit
1×	node limit
1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess91.0ms (2.3%)

Memory: 6.2MiB live, 104.8MiB allocated; 8ms collecting garbage
Compiler: Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample675.0ms (17.1%)

explain59.0ms (1.5%)

preprocess297.0ms (7.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify190.0ms (4.8%)

localize12.0ms (0.3%)

series2.0ms (0%)

simplify209.0ms (5.3%)

rewrite202.0ms (5.1%)

eval6.0ms (0.2%)

prune3.0ms (0.1%)

simplify217.0ms (5.5%)

localize11.0ms (0.3%)

series1.0ms (0%)

simplify263.0ms (6.7%)

rewrite105.0ms (2.7%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify193.0ms (4.9%)

localize15.0ms (0.4%)

series1.0ms (0%)

simplify245.0ms (6.2%)

rewrite17.0ms (0.4%)

eval1.0ms (0%)

prune25.0ms (0.6%)

simplify224.0ms (5.7%)

localize12.0ms (0.3%)

series1.0ms (0%)

simplify243.0ms (6.2%)

rewrite105.0ms (2.7%)

eval3.0ms (0.1%)

prune3.0ms (0.1%)

regimes49.0ms (1.2%)

regimes5.0ms (0.1%)

regimes3.0ms (0.1%)

bsearch80.0ms (2%)

simplify33.0ms (0.8%)

derivations346.0ms (8.8%)

preprocess91.0ms (2.3%)

end0.0ms (0%)

Profiling