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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample599.0ms (22.3%)

Memory

9.6MiB live, 814.7MiB allocated; 195ms collecting garbage

Samples

410.0ms

8 256×

valid

Precisions

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

ival-sub: 76.0ms (54.8% of total)

ival-add: 53.0ms (38.2% of total)

exact: 5.0ms (3.6% of total)

adjust: 2.0ms (1.4% of total)

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

Bogosity

explain96.0ms (3.6%)

Memory

-20.0MiB live, 83.2MiB allocated; 16ms 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

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-sub: 5.0ms (54.9% of total)

ival-add: 3.0ms (32.9% 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)

preprocess214.0ms (8%)

Memory

-5.3MiB live, 180.9MiB allocated; 22ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	18	16
2	32	16
3	63	16
4	186	16
5	879	15
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

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)

simplify205.0ms (7.6%)

Memory

-0.9MiB live, 149.0MiB allocated; 14ms 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.4%)

Memory

24.8MiB live, 24.8MiB 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

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

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

series4.0ms (0.1%)

Memory

-40.9MiB live, 4.3MiB allocated; 4ms collecting garbage

Counts

2 → 6

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 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 2)))))

Calls

3 calls:

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

simplify283.0ms (10.5%)

Memory

19.9MiB live, 175.8MiB allocated; 105ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	34	56
2	59	56
3	110	56
4	459	56
5	2646	56
6	7111	56
0	8522	48

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

rewrite81.0ms (3%)

Memory

-11.5MiB live, 83.5MiB allocated; 19ms 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: 12.4MiB live, 12.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 676 to 159 computations (76.5% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

100.0%

Counts

67 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 17 computations (19% saved)

simplify151.0ms (5.6%)

Memory

-15.4MiB live, 133.6MiB allocated; 10ms collecting garbage

Localize:

Found 3 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))
cost-diff	0	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	22
0	10	22
1	17	22
2	26	22
3	59	22
4	237	22
5	1138	22
6	7879	22
0	8163	20

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

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

localize41.0ms (1.5%)

Memory

-20.5MiB live, 26.4MiB allocated; 2ms collecting garbage

Localize:

Found 3 expressions of interest:

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

Samples

10.0ms

256×

valid

Compiler

Compiled 18 to 9 computations (50% saved)

Precisions

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

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

ival-add: 1.0ms (21.9% of total)

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

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

Counts

3 → 6

Calls

Call 1

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

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

Calls

3 calls:

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

simplify207.0ms (7.7%)

Memory

0.6MiB live, 186.0MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	33	56
2	58	56
3	109	56
4	458	56
5	2645	56
6	7110	56
0	8521	48

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

rewrite25.0ms (0.9%)

Memory

9.2MiB live, 49.3MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	19
0	10	19
0	39	19

Stop Event

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

Counts

3 → 7

Calls

Call 1

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

Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#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: 3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 107 to 30 computations (72% saved)

prune1.0ms (0%)

Memory

3.7MiB live, 3.7MiB allocated; 0ms 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	1	2
Done	0	1	1
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))
▶	49.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.5%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify184.0ms (6.8%)

Memory

60.3MiB live, 175.8MiB allocated; 60ms 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

localize23.0ms (0.9%)

Memory

-10.1MiB live, 34.0MiB allocated; 13ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Samples

19.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 (33.5% of total)

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

series1.0ms (0%)

Memory

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

Counts

2 → 6

Calls

Call 1

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

Outputs
#s(approx (- (+ x x) 1) #s(hole binary64 -1))
#s(approx (- (+ x x) 1) #s(hole binary64 (- (* 2 x) 1)))
#s(approx (+ x x) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* 2 x)))
#s(approx (- (+ x x) 1) #s(hole binary64 (* x (- 2 (/ 1 x)))))
#s(approx (- (+ x x) 1) #s(hole binary64 (* -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))

simplify251.0ms (9.3%)

Memory

-16.2MiB live, 183.9MiB allocated; 96ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	20	56
1	34	56
2	59	56
3	110	56
4	459	56
5	2646	56
6	7111	56
0	8522	48

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

rewrite112.0ms (4.2%)

Memory

-3.6MiB live, 99.5MiB allocated; 43ms 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: 12.7MiB live, 12.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 549 to 114 computations (79.2% saved)

prune5.0ms (0.2%)

Memory

-36.7MiB live, 9.4MiB allocated; 4ms 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))
✓	49.4%	#s(approx (- (+ x x) 1) (+.f64 x x))
✓	51.5%	#s(approx (- (+ x x) 1) #s(literal -1 binary64))

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes6.0ms (0.2%)

Memory

21.0MiB live, 21.0MiB 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))
#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:

2.0ms	x
2.0ms	(+.f64 x x)
2.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)

regimes5.0ms (0.2%)

Memory

17.7MiB live, 17.7MiB 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	x
2.0ms	(+.f64 x x)
1.0ms	(-.f64 (+.f64 x x) #s(literal 1 binary64))

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes5.0ms (0.2%)

Memory

-36.5MiB live, 9.8MiB allocated; 2ms 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:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch24.0ms (0.9%)

Memory

-1.2MiB live, 50.6MiB allocated; 7ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	0.014800921058135044	94.36781108304396
8.0ms	-358.4357992915485	-0.4916708481587397

Samples

7.0ms

256×

valid

Compiler

Compiled 264 to 232 computations (12.1% saved)

Precisions

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

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

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

simplify56.0ms (2.1%)

Memory

0.2MiB live, 46.7MiB allocated; 4ms 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))

derivations71.0ms (2.6%)

Memory

1.9MiB live, 94.3MiB allocated; 6ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess16.0ms (0.6%)

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

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample599.0ms (22.3%)

explain96.0ms (3.6%)

preprocess214.0ms (8%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify205.0ms (7.6%)

localize12.0ms (0.4%)

series4.0ms (0.1%)

simplify283.0ms (10.5%)

rewrite81.0ms (3%)

eval6.0ms (0.2%)

prune2.0ms (0.1%)

simplify151.0ms (5.6%)

localize41.0ms (1.5%)

series1.0ms (0.1%)

simplify207.0ms (7.7%)

rewrite25.0ms (0.9%)

eval1.0ms (0%)

prune1.0ms (0%)

simplify184.0ms (6.8%)

localize23.0ms (0.9%)

series1.0ms (0%)

simplify251.0ms (9.3%)

rewrite112.0ms (4.2%)

eval3.0ms (0.1%)

prune5.0ms (0.2%)

regimes6.0ms (0.2%)

regimes5.0ms (0.2%)

regimes5.0ms (0.2%)

bsearch24.0ms (0.9%)

simplify56.0ms (2.1%)

derivations71.0ms (2.6%)

preprocess16.0ms (0.6%)

end0.0ms (0%)

Profiling