Metrics for System.Random.MWC.Distributions:standard from mwc-random-0.13.3.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%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 8 computations (11.1% saved)

sample965.0ms (46.6%)

Memory

28.7MiB live, 720.6MiB allocated; 973ms collecting garbage

Samples

719.0ms	8 254×	0	valid
0.0ms	2×	2	valid

Precisions

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

ival-mult: 109.0ms (65.5% of total)

ival-sub: 40.0ms (24% of total)

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

exact: 6.0ms (3.6% of total)

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain76.0ms (3.7%)

Memory

20.7MiB live, 66.8MiB allocated; 5ms collecting garbage

FPErrors

Click to see full error table

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

23.0ms

512×

valid

Compiler

Compiled 47 to 22 computations (53.2% saved)

Precisions

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

ival-mult: 7.0ms (68.5% of total)

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

preprocess20.0ms (1%)

Memory

-26.9MiB live, 18.5MiB allocated; 6ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	44
1	43	44
2	76	44
3	103	44
4	127	44
0	6	7
0	9	7
1	14	7
2	27	7
3	46	7
4	58	7
0	58	7

Stop Event

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

Calls

Call 1

Inputs
(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))

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

Symmetry

(abs x)

Compiler

Compiled 7 to 6 computations (14.3% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series5.0ms (0.2%)

Memory

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

Counts

6 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

simplify349.0ms (16.9%)

Memory

-6.7MiB live, 191.7MiB allocated; 33ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	54	200
1	134	197
2	512	197
3	2837	197
0	8486	192

Stop Event

1×	iter limit
1×	node limit

Counts

16 → 16

Calls

Call 1

Inputs
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1/2 y)))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (+ (* -1/2 y) (* 1/2 (pow x 2)))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 y)))
#s(approx (- (* x x) y) #s(hole binary64 (- (pow x 2) y)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/2 (/ y (pow x 2)))))))
#s(approx (- (* x x) y) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) y) #s(hole binary64 (* (pow x 2) (+ 1 (* -1 (/ y (pow x 2)))))))
#s(approx (- (* x x) y) #s(hole binary64 (+ (* -1 y) (pow x 2))))
#s(approx y #s(hole binary64 y))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* y (- (* 1/2 (/ (pow x 2) y)) 1/2))))
#s(approx (- (* x x) y) #s(hole binary64 (* y (- (/ (pow x 2) y) 1))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1 (* y (+ 1/2 (* -1/2 (/ (pow x 2) y)))))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 (* y (+ 1 (* -1 (/ (pow x 2) y)))))))

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

rewrite32.0ms (1.5%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	18
0	9	18
1	29	18
0	197	18

Stop Event

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

Counts

6 → 30

Calls

Call 1

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

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

eval4.0ms (0.2%)

Memory: 7.9MiB live, 7.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 544 to 150 computations (72.4% saved)

prune21.0ms (1%)

Memory

-39.7MiB live, 6.2MiB allocated; 3ms collecting garbage

Pruning

3 alts after pruning (2 fresh and 1 done)

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

Accuracy

100.0%

Counts

46 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))
▶	49.3%	(.f64 #s(literal 1/2 binary64) #s(approx (- ( x x) y) (*.f64 x x)))
▶	52.8%	#s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y))

Compiler

Compiled 29 to 23 computations (20.7% saved)

series4.0ms (0.2%)

Memory

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

Counts

9 → 17

Calls

Call 1

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

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

Calls

6 calls:

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

simplify302.0ms (14.6%)

Memory

14.2MiB live, 263.4MiB allocated; 37ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	207
1	135	204
2	512	204
3	2838	204
0	8489	199

Stop Event

1×	iter limit
1×	node limit

Counts

17 → 17

Calls

Call 1

Inputs
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1/2 y)))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (+ (* -1/2 y) (* 1/2 (pow x 2)))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 y)))
#s(approx (- (* x x) y) #s(hole binary64 (- (pow x 2) y)))
#s(approx (* x x) #s(hole binary64 (pow x 2)))
#s(approx x #s(hole binary64 x))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* 1/2 (pow x 2))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* (pow x 2) (+ 1/2 (* -1/2 (/ y (pow x 2)))))))
#s(approx (- (* x x) y) #s(hole binary64 (pow x 2)))
#s(approx (- (* x x) y) #s(hole binary64 (* (pow x 2) (+ 1 (* -1 (/ y (pow x 2)))))))
#s(approx (* -1/2 y) #s(hole binary64 (* -1/2 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- (* x x) y) #s(hole binary64 (+ (* -1 y) (pow x 2))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* y (- (* 1/2 (/ (pow x 2) y)) 1/2))))
#s(approx (- (* x x) y) #s(hole binary64 (* y (- (/ (pow x 2) y) 1))))
#s(approx (* 1/2 (- (* x x) y)) #s(hole binary64 (* -1 (* y (+ 1/2 (* -1/2 (/ (pow x 2) y)))))))
#s(approx (- (* x x) y) #s(hole binary64 (* -1 (* y (+ 1 (* -1 (/ (pow x 2) y)))))))

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

rewrite26.0ms (1.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	12	41
0	15	41
1	37	41
0	205	41

Stop Event

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

Counts

9 → 24

Calls

Call 1

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

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

eval4.0ms (0.2%)

Memory: 3.6MiB live, 3.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 497 to 115 computations (76.9% saved)

prune36.0ms (1.7%)

Memory

-42.3MiB live, 4.5MiB allocated; 2ms 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	2	2
Done	0	1	1
Total	38	3	41

Accuracy

100.0%

Counts

41 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))
✓	49.3%	(.f64 #s(literal 1/2 binary64) #s(approx (- ( x x) y) (*.f64 x x)))
✓	52.8%	#s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y))

Compiler

Compiled 58 to 38 computations (34.5% saved)

regimes8.0ms (0.4%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

Calls

5 calls:

2.0ms	y
2.0ms	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))
2.0ms	x
2.0ms	(-.f64 (*.f64 x x) y)
1.0ms	(*.f64 x x)

Results

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

Compiler

Compiled 17 to 17 computations (0% saved)

regimes7.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

5 calls:

1.0ms	y
1.0ms	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))
1.0ms	x
1.0ms	(-.f64 (*.f64 x x) y)
1.0ms	(*.f64 x x)

Results

Accuracy	Segments	Branch
89.2%	2	`(*.f64 x x)`
83.9%	2	`(-.f64 (*.f64 x x) y)`
83.9%	2	`(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))`
89.2%	2	`x`
65.9%	3	`y`

Compiler

Compiled 17 to 17 computations (0% saved)

regimes5.0ms (0.3%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

5 calls:

1.0ms	(.f64 #s(literal 1/2 binary64) (-.f64 (.f64 x x) y))
1.0ms	x
1.0ms	y
1.0ms	(-.f64 (*.f64 x x) y)
1.0ms	(*.f64 x x)

Results

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

Compiler

Compiled 17 to 17 computations (0% saved)

bsearch14.0ms (0.7%)

Memory

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

Algorithm

1×	binary-search

Stop Event

1×	narrow-enough

Steps

Time	Left	Right
12.0ms	1091977208954.0046	1.485230947033468e+22

Samples

6.0ms

160×

valid

Compiler

Compiled 230 to 201 computations (12.6% saved)

Precisions

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

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

ival-sub: 1.0ms (33% 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)

simplify19.0ms (0.9%)

Memory

-31.2MiB live, 15.9MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	44
1	24	44
2	42	44
3	62	44
4	74	44

Stop Event

1×

saturated

Calls

Call 1

Inputs

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

(if (<=.f64 x #s(literal 900000000000000000000 binary64)) #s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y)) (*.f64 #s(literal 1/2 binary64) #s(approx (- (* x x) y) (*.f64 x x))))

#s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y))

Outputs

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

(if (<=.f64 x #s(literal 900000000000000000000 binary64)) #s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y)) (*.f64 #s(literal 1/2 binary64) #s(approx (- (* x x) y) (*.f64 x x))))

#s(approx (* 1/2 (- (* x x) y)) (*.f64 #s(literal -1/2 binary64) y))

derivations144.0ms (7%)

Memory

-2.1MiB live, 92.3MiB allocated; 18ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 44 to 18 computations (59.1% saved)

preprocess29.0ms (1.4%)

Memory: 17.0MiB live, 56.9MiB allocated; 13ms collecting garbage
Remove: (abs x)
Compiler: Compiled 130 to 72 computations (44.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample965.0ms (46.6%)

explain76.0ms (3.7%)

preprocess20.0ms (1%)

eval0.0ms (0%)

prune0.0ms (0%)

series5.0ms (0.2%)

simplify349.0ms (16.9%)

rewrite32.0ms (1.5%)

eval4.0ms (0.2%)

prune21.0ms (1%)

series4.0ms (0.2%)

simplify302.0ms (14.6%)

rewrite26.0ms (1.3%)

eval4.0ms (0.2%)

prune36.0ms (1.7%)

regimes8.0ms (0.4%)

regimes7.0ms (0.3%)

regimes5.0ms (0.3%)

bsearch14.0ms (0.7%)

simplify19.0ms (0.9%)

derivations144.0ms (7%)

preprocess29.0ms (1.4%)

end0.0ms (0%)

Profiling