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

sample676.0ms (27.6%)

Memory

4.0MiB live, 987.4MiB allocated; 242ms collecting garbage

Samples

396.0ms

8 256×

valid

Precisions

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

ival-sub: 91.0ms (62.3% of total)

ival-add: 40.0ms (27.4% of total)

ival-true: 5.0ms (3.4% of total)

exact: 4.0ms (2.7% of total)

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

adjust: 2.0ms (1.4% of total)

Bogosity

explain73.0ms (3%)

Memory

-35.6MiB live, 84.6MiB allocated; 22ms 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

15.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-add: 3.0ms (50.4% of total)

ival-sub: 2.0ms (33.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)

preprocess309.0ms (12.6%)

Memory

34.3MiB live, 270.0MiB allocated; 32ms 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.4MiB live, 1.4MiB 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

6.1MiB live, 6.1MiB 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
-1
(- (* 2 x) 1)
(* 2 x)
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) x 1)
1.0ms	x	@	-inf	((- (+ x x) 1) (+ x x) x 1)
0.0ms	x	@	0	((- (+ x x) 1) (+ x x) x 1)

simplify171.0ms (7%)

Memory

-1.8MiB live, 277.5MiB allocated; 24ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 5

Calls

Call 1

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

rewrite80.0ms (3.3%)

Memory

1.5MiB live, 138.0MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	34	10
0	326	9

Stop Event

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

Counts

4 → 64

Calls

Call 1

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

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

eval31.0ms (1.3%)

Memory: -20.8MiB live, 19.8MiB allocated; 10ms collecting garbage
Compiler: Compiled 682 to 158 computations (76.8% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	67	1	68
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	67	2	69

Accuracy

100.0%

Counts

69 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 12 to 10 computations (16.7% saved)

series1.0ms (0%)

Memory

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

Counts

2 → 5

Calls

Call 1

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

simplify360.0ms (14.7%)

Memory

14.3MiB live, 248.5MiB allocated; 247ms 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))

rewrite59.0ms (2.4%)

Memory

-7.1MiB live, 44.5MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 2

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)

eval0.0ms (0%)

Memory: 1.1MiB live, 1.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 33 to 11 computations (66.7% saved)

prune1.0ms (0%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	3	1	4
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	3	3	6

Accuracy

100.0%

Counts

6 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 17 computations (19% saved)

series2.0ms (0.1%)

Memory

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

Counts

4 → 6

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

Calls

3 calls:

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

simplify166.0ms (6.8%)

Memory

18.3MiB live, 207.8MiB allocated; 35ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 5

Calls

Call 1

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

rewrite32.0ms (1.3%)

Memory

-10.2MiB live, 36.5MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	14
0	8	14
0	37	14

Stop Event

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

Counts

4 → 8

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

eval1.0ms (0%)

Memory: 3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 125 to 30 computations (76% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	10	1	11
Fresh	0	0	0
Picked	1	0	1
Done	0	2	2
Total	11	3	14

Accuracy

100.0%

Counts

14 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 16 computations (23.8% saved)

series1.0ms (0%)

Memory

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

Counts

3 → 6

Calls

Call 1

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

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

simplify161.0ms (6.6%)

Memory

-10.5MiB live, 211.5MiB allocated; 30ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	node limit

Counts

6 → 5

Calls

Call 1

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

rewrite131.0ms (5.3%)

Memory

-12.2MiB live, 116.2MiB allocated; 82ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

3 → 36

Calls

Call 1

Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x 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)
x

eval4.0ms (0.1%)

Memory: 10.7MiB live, 10.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 567 to 114 computations (79.9% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	40	0	40
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	40	3	43

Accuracy

100.0%

Counts

43 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes26.0ms (1.1%)

Memory

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

23.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

13.7MiB live, 13.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:

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory

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

Results

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

Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch20.0ms (0.8%)

Memory

0.6MiB live, 45.9MiB allocated; 3ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
8.0ms	0.000823511814158145	20.04293246132413
10.0ms	-0.7062043373524043	-0.00448168982101878

Samples

7.0ms

240×

valid

Compiler

Compiled 248 to 218 computations (12.1% saved)

Precisions

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

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

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

simplify43.0ms (1.7%)

Memory

-29.2MiB live, 63.2MiB allocated; 26ms 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))

derivations72.0ms (2.9%)

Memory

0.2MiB live, 92.2MiB allocated; 9ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess15.0ms (0.6%)

Memory: 44.5MiB live, 44.5MiB 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%)

sample676.0ms (27.6%)

explain73.0ms (3%)

preprocess309.0ms (12.6%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify171.0ms (7%)

rewrite80.0ms (3.3%)

eval31.0ms (1.3%)

prune3.0ms (0.1%)

series1.0ms (0%)

simplify360.0ms (14.7%)

rewrite59.0ms (2.4%)

eval0.0ms (0%)

prune1.0ms (0%)

series2.0ms (0.1%)

simplify166.0ms (6.8%)

rewrite32.0ms (1.3%)

eval1.0ms (0%)

prune1.0ms (0.1%)

series1.0ms (0%)

simplify161.0ms (6.6%)

rewrite131.0ms (5.3%)

eval4.0ms (0.1%)

prune3.0ms (0.1%)

regimes26.0ms (1.1%)

regimes5.0ms (0.2%)

regimes3.0ms (0.1%)

bsearch20.0ms (0.8%)

simplify43.0ms (1.7%)

derivations72.0ms (2.9%)

preprocess15.0ms (0.6%)

end0.0ms (0%)

Profiling