Metrics for Diagrams.Solve.Polynomial:quartForm from diagrams-solve-0.1, A

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%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 9 computations (0% saved)

sample3.2s (89.7%)

Memory

-170.3MiB live, 1 197.0MiB allocated; 2.8s collecting garbage

Samples

779.0ms	7 636×	0	valid
57.0ms	277×	1	valid
43.0ms	146×	3	valid
18.0ms	197×	2	valid

Precisions

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

ival-div: 388.0ms (69.7% of total)

ival-sub: 72.0ms (12.9% of total)

ival-mult: 62.0ms (11.1% of total)

adjust: 23.0ms (4.1% of total)

exact: 9.0ms (1.6% of total)

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

Bogosity

explain127.0ms (3.5%)

Memory

-15.7MiB live, 131.8MiB allocated; 73ms collecting garbage

FPErrors

Click to see full error table

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

22.0ms	484×	0	valid
1.0ms	16×	1	valid
1.0ms	10×	2	valid
0.0ms	2×	3	valid

Compiler

Compiled 49 to 25 computations (49% saved)

Precisions

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

ival-div: 3.0ms (27.7% of total)

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

ival-mult: 3.0ms (27.7% of total)

adjust: 1.0ms (9.2% of total)

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

preprocess16.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

Stop Event

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

Calls

Call 1

Inputs
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Outputs
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
(fma.f64 #s(literal -3/8 binary64) y x)

Compiler

Compiled 7 to 7 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.9%	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Compiler

Compiled 7 to 7 computations (0% saved)

series4.0ms (0.1%)

Memory

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

Counts

7 → 11

Calls

Call 1

Inputs
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
x
(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
(/.f64 #s(literal 3 binary64) #s(literal 8 binary64))
#s(literal 3 binary64)
#s(literal 8 binary64)
y

Outputs
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -3/8 y)))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (- x (* 3/8 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (* (/ 3 8) y) #s(hole binary64 (* 3/8 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))

Calls

6 calls:

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

rewrite60.0ms (1.7%)

Memory

-7.6MiB live, 85.7MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	42	126
0	46	123
1	162	122
0	1219	109

Stop Event

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

Counts

18 → 37

Calls

Call 1

Inputs
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
x
(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
(/.f64 #s(literal 3 binary64) #s(literal 8 binary64))
#s(literal 3 binary64)
#s(literal 8 binary64)
y
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -3/8 y)))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (- x (* 3/8 y))))
#s(approx x #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (* (/ 3 8) y) #s(hole binary64 (* 3/8 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))

Outputs
(/.f64 (-.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (.f64 x x)) (-.f64 (*.f64 #s(literal -3/8 binary64) y) x))
(/.f64 (neg.f64 (*.f64 (fma.f64 #s(literal 3/8 binary64) y x) (fma.f64 #s(literal -3/8 binary64) y x))) (neg.f64 (fma.f64 #s(literal 3/8 binary64) y x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (*.f64 x x))))
(/.f64 (neg.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x))))
(/.f64 (*.f64 (fma.f64 #s(literal 3/8 binary64) y x) (fma.f64 #s(literal -3/8 binary64) y x)) (fma.f64 #s(literal 3/8 binary64) y x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (*.f64 x x)))
(/.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (-.f64 (.f64 x x) (.f64 (.f64 #s(literal -3/8 binary64) y) x))))
(/.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x)))
(fma.f64 #s(literal -3/8 binary64) y x)
(fma.f64 y #s(literal -3/8 binary64) x)
(-.f64 (/.f64 (.f64 x x) (fma.f64 #s(literal 3/8 binary64) y x)) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (fma.f64 #s(literal 3/8 binary64) y x)))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal 3/8 binary64) y) #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal 3/8 binary64) y) (fma.f64 #s(literal 3/8 binary64) y x) (*.f64 x x))))
(-.f64 x (*.f64 (neg.f64 y) #s(literal -3/8 binary64)))
(-.f64 x (*.f64 #s(literal 3/8 binary64) y))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x))))
(+.f64 (*.f64 #s(literal -3/8 binary64) y) x)
(+.f64 x (*.f64 (neg.f64 y) #s(literal 3/8 binary64)))
(+.f64 x (*.f64 #s(literal -3/8 binary64) y))
x
(*.f64 #s(literal 3/8 binary64) y)
(*.f64 y #s(literal 3/8 binary64))
(neg.f64 (*.f64 #s(literal -3/8 binary64) y))
#s(literal 3/8 binary64)
#s(literal 3 binary64)
#s(literal 8 binary64)
y
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx x x)
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -3/8 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 x) (fma.f64 (/.f64 y x) #s(literal 3/8 binary64) #s(literal -1 binary64))))
#s(approx (- x (* (/ 3 8) y)) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx (* (/ 3 8) y) (*.f64 #s(literal 3/8 binary64) y))
#s(approx y y)
#s(approx (- x (* (/ 3 8) y)) (*.f64 (-.f64 (/.f64 x y) #s(literal 3/8 binary64)) y))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 y) (-.f64 #s(literal 3/8 binary64) (/.f64 x y))))

eval4.0ms (0.1%)

Memory: 9.1MiB live, 9.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 452 to 101 computations (77.7% saved)

prune2.0ms (0%)

Memory

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

Pruning

3 alts after pruning (3 fresh and 0 done)

	Pruned	Kept	Total
New	33	3	36
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	34	3	37

Accuracy

100.0%

Counts

37 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 y #s(literal -3/8 binary64) x)
▶	51.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
▶	50.3%	#s(approx (- x (* (/ 3 8) y)) x)

Compiler

Compiled 24 to 22 computations (8.3% saved)

series8.0ms (0.2%)

Memory

-37.4MiB live, 11.3MiB allocated; 5ms collecting garbage

Counts

7 → 18

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
x
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(*.f64 #s(literal -3/8 binary64) y)
#s(literal -3/8 binary64)
y
(fma.f64 y #s(literal -3/8 binary64) x)

Outputs
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -3/8 y)))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (- x (* 3/8 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -3/8 y)))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 x))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (* -3/8 y) #s(hole binary64 (* -3/8 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))

Calls

6 calls:

Time	Variable		Point	Expression
3.0ms	x	@	inf	((- x (* (/ 3 8) y)) x (- x (* (/ 3 8) y)) (* -3/8 y) -3/8 y (+ (* y -3/8) x))
3.0ms	x	@	0	((- x (* (/ 3 8) y)) x (- x (* (/ 3 8) y)) (* -3/8 y) -3/8 y (+ (* y -3/8) x))
1.0ms	y	@	-inf	((- x (* (/ 3 8) y)) x (- x (* (/ 3 8) y)) (* -3/8 y) -3/8 y (+ (* y -3/8) x))
1.0ms	x	@	-inf	((- x (* (/ 3 8) y)) x (- x (* (/ 3 8) y)) (* -3/8 y) -3/8 y (+ (* y -3/8) x))
1.0ms	y	@	inf	((- x (* (/ 3 8) y)) x (- x (* (/ 3 8) y)) (* -3/8 y) -3/8 y (+ (* y -3/8) x))

rewrite51.0ms (1.4%)

Memory

31.4MiB live, 78.2MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	221
0	51	202
1	182	200
0	1303	196

Stop Event

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

Counts

25 → 48

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
x
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(*.f64 #s(literal -3/8 binary64) y)
#s(literal -3/8 binary64)
y
(fma.f64 y #s(literal -3/8 binary64) x)
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -3/8 y)))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (- x (* 3/8 y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -3/8 y)))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 x))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 x))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* x (+ 1 (* -3/8 (/ y x))))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -1 (* x (- (* 3/8 (/ y x)) 1)))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (+ x (* -3/8 y))))
#s(approx (* -3/8 y) #s(hole binary64 (* -3/8 y)))
#s(approx y #s(hole binary64 y))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* y (- (/ x y) 3/8))))
#s(approx (- x (* (/ 3 8) y)) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))
#s(approx (+ (* y -3/8) x) #s(hole binary64 (* -1 (* y (+ 3/8 (* -1 (/ x y)))))))

Outputs
#s(approx (- x (* (/ 3 8) y)) x)
x
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(*.f64 #s(literal -3/8 binary64) y)
(*.f64 y #s(literal -3/8 binary64))
(neg.f64 (*.f64 y #s(literal 3/8 binary64)))
#s(literal -3/8 binary64)
y
(/.f64 (neg.f64 (*.f64 (fma.f64 y #s(literal 3/8 binary64) x) (fma.f64 #s(literal -3/8 binary64) y x))) (neg.f64 (fma.f64 y #s(literal 3/8 binary64) x)))
(/.f64 (neg.f64 (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 (neg.f64 x) x))) (neg.f64 (-.f64 (*.f64 #s(literal -3/8 binary64) y) x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 y #s(literal 3/8 binary64)) #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 y #s(literal 3/8 binary64)) (fma.f64 y #s(literal 3/8 binary64) x) (*.f64 x x))))
(/.f64 (neg.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x))))
(/.f64 (neg.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (fma.f64 y #s(literal 3/8 binary64) x)))))
(/.f64 (*.f64 (fma.f64 y #s(literal 3/8 binary64) x) (fma.f64 #s(literal -3/8 binary64) y x)) (fma.f64 y #s(literal 3/8 binary64) x))
(/.f64 (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 (neg.f64 x) x)) (-.f64 (*.f64 #s(literal -3/8 binary64) y) x))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (.f64 y #s(literal 3/8 binary64)) #s(literal 3 binary64))) (fma.f64 (.f64 y #s(literal 3/8 binary64)) (fma.f64 y #s(literal 3/8 binary64) x) (*.f64 x x)))
(/.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x)))
(/.f64 (fma.f64 #s(literal -27/512 binary64) (pow.f64 y #s(literal 3 binary64)) (pow.f64 x #s(literal 3 binary64))) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (fma.f64 y #s(literal 3/8 binary64) x))))
(fma.f64 #s(literal -3/8 binary64) y x)
(fma.f64 y #s(literal -3/8 binary64) x)
(-.f64 (/.f64 (.f64 x x) (fma.f64 y #s(literal 3/8 binary64) x)) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (fma.f64 y #s(literal 3/8 binary64) x)))
(-.f64 (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 2 binary64)) (-.f64 (.f64 #s(literal -3/8 binary64) y) x)) (/.f64 (.f64 x x) (-.f64 (.f64 #s(literal -3/8 binary64) y) x)))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 y #s(literal 3/8 binary64)) (fma.f64 y #s(literal 3/8 binary64) x) (.f64 x x))) (/.f64 (pow.f64 (.f64 y #s(literal 3/8 binary64)) #s(literal 3 binary64)) (fma.f64 (.f64 y #s(literal 3/8 binary64)) (fma.f64 y #s(literal 3/8 binary64) x) (*.f64 x x))))
(-.f64 x (*.f64 (neg.f64 y) #s(literal -3/8 binary64)))
(-.f64 x (*.f64 y #s(literal 3/8 binary64)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (.f64 x x))) (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (fma.f64 (.f64 #s(literal -3/8 binary64) y) (-.f64 (.f64 #s(literal -3/8 binary64) y) x) (*.f64 x x))))
(+.f64 (/.f64 (pow.f64 (.f64 #s(literal -3/8 binary64) y) #s(literal 3 binary64)) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (.f64 x (fma.f64 y #s(literal 3/8 binary64) x)))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (.f64 y y) #s(literal 9/64 binary64) (*.f64 x (fma.f64 y #s(literal 3/8 binary64) x)))))
(+.f64 (*.f64 #s(literal -3/8 binary64) y) x)
(+.f64 x (*.f64 (neg.f64 y) #s(literal 3/8 binary64)))
(+.f64 x (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx x x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -3/8 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 (fma.f64 (/.f64 y x) #s(literal -3/8 binary64) #s(literal 1 binary64)) x))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 x) (fma.f64 (/.f64 y x) #s(literal 3/8 binary64) #s(literal -1 binary64))))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 x) (fma.f64 (/.f64 y x) #s(literal 3/8 binary64) #s(literal -1 binary64))))
#s(approx (- x (* (/ 3 8) y)) (fma.f64 #s(literal -3/8 binary64) y x))
#s(approx (* -3/8 y) (*.f64 #s(literal -3/8 binary64) y))
#s(approx y y)
#s(approx (- x (* (/ 3 8) y)) (*.f64 (-.f64 (/.f64 x y) #s(literal 3/8 binary64)) y))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (-.f64 (/.f64 x y) #s(literal 3/8 binary64)) y))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 y) (-.f64 #s(literal 3/8 binary64) (/.f64 x y))))
#s(approx (- x (* (/ 3 8) y)) (*.f64 (neg.f64 y) (-.f64 #s(literal 3/8 binary64) (/.f64 x y))))

eval6.0ms (0.2%)

Memory: -36.3MiB live, 10.5MiB allocated; 3ms collecting garbage
Compiler: Compiled 592 to 112 computations (81.1% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	43	0	43
Fresh	0	0	0
Picked	0	3	3
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%	(fma.f64 y #s(literal -3/8 binary64) x)
✓	51.3%	#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
✓	50.3%	#s(approx (- x (* (/ 3 8) y)) x)

Compiler

Compiled 55 to 39 computations (29.1% saved)

regimes8.0ms (0.2%)

Memory

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

Counts

4 → 1

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
(fma.f64 y #s(literal -3/8 binary64) x)
(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))

Outputs
(fma.f64 y #s(literal -3/8 binary64) x)

Calls

4 calls:

2.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
2.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
2.0ms	y
2.0ms	x

Results

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

Compiler

Compiled 14 to 17 computations (-21.4% saved)

regimes6.0ms (0.2%)

Memory

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

Counts

2 → 3

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))

Outputs
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))
#s(approx (- x (* (/ 3 8) y)) x)
#s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))

Calls

4 calls:

1.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
1.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
78.7%	3	`(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)`
62.3%	4	`(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))`
74.1%	3	`x`
78.7%	3	`y`

Compiler

Compiled 14 to 17 computations (-21.4% saved)

regimes6.0ms (0.2%)

Memory

-33.9MiB live, 13.3MiB allocated; 2ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (- x (* (/ 3 8) y)) x)

Outputs
#s(approx (- x (* (/ 3 8) y)) x)

Calls

4 calls:

3.0ms	(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)
1.0ms	(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))
1.0ms	x
1.0ms	y

Results

Accuracy	Segments	Branch
50.3%	1	`(-.f64 x (*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y))`
50.3%	1	`x`
50.3%	1	`(*.f64 (/.f64 #s(literal 3 binary64) #s(literal 8 binary64)) y)`
50.3%	1	`y`

Compiler

Compiled 14 to 17 computations (-21.4% saved)

bsearch31.0ms (0.8%)

Memory

-1.9MiB live, 46.7MiB allocated; 5ms collecting garbage

Algorithm

2×	binary-search

Stop Event

1×	narrow-enough
1×	narrow-enough

Steps

Time	Left	Right
16.0ms	999692598960.0719	6671228375371168000.0
11.0ms	-3.863219304480781e+41	-2.9986382025501465e+33

Samples

13.0ms	267×	0	valid
1.0ms	11×	2	valid
1.0ms	10×	1	valid

Compiler

Compiled 370 to 372 computations (-0.5% saved)

Precisions

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

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

ival-div: 2.0ms (23.1% of total)

adjust: 1.0ms (11.5% of total)

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

ival-assert: 0.0ms (0% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

simplify10.0ms (0.3%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	19	36
1	28	36
2	45	36
3	74	36
4	110	36
5	120	36

Stop Event

1×

saturated

Calls

Call 1

Inputs

(fma.f64 y #s(literal -3/8 binary64) x)

(if (<=.f64 y #s(literal -4200000000000000117292421527633920 binary64)) #s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y)) (if (<=.f64 y #s(literal 980000000000000 binary64)) #s(approx (- x (* (/ 3 8) y)) x) #s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))))

#s(approx (- x (* (/ 3 8) y)) x)

Outputs
(fma.f64 y #s(literal -3/8 binary64) x)
(if (<=.f64 y #s(literal -4200000000000000117292421527633920 binary64)) #s(approx (- x (* (/ 3 8) y)) (.f64 #s(literal -3/8 binary64) y)) (if (<=.f64 y #s(literal 980000000000000 binary64)) #s(approx (- x ( (/ 3 8) y)) x) #s(approx (- x (* (/ 3 8) y)) (*.f64 #s(literal -3/8 binary64) y))))
(if (or (<=.f64 y #s(literal -4200000000000000117292421527633920 binary64)) (not (<=.f64 y #s(literal 980000000000000 binary64)))) #s(approx (- x (* (/ 3 8) y)) (.f64 #s(literal -3/8 binary64) y)) #s(approx (- x ( (/ 3 8) y)) x))
#s(approx (- x (* (/ 3 8) y)) x)

derivations10.0ms (0.3%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 42 to 19 computations (54.8% saved)

preprocess18.0ms (0.5%)

Memory: -10.9MiB live, 35.7MiB allocated; 2ms collecting garbage
Compiler: Compiled 98 to 52 computations (46.9% saved)

end0.0ms (0%)

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

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4

start0.0ms (0%)

analyze0.0ms (0%)

sample3.2s (89.7%)

explain127.0ms (3.5%)

preprocess16.0ms (0.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series4.0ms (0.1%)

rewrite60.0ms (1.7%)

eval4.0ms (0.1%)

prune2.0ms (0%)

series8.0ms (0.2%)

rewrite51.0ms (1.4%)

eval6.0ms (0.2%)

prune3.0ms (0.1%)

regimes8.0ms (0.2%)

regimes6.0ms (0.2%)

regimes6.0ms (0.2%)

bsearch31.0ms (0.8%)

simplify10.0ms (0.3%)

derivations10.0ms (0.3%)

preprocess18.0ms (0.5%)

end0.0ms (0%)

Profiling

Iter	Nodes	Cost
0	17	34
1	36	32
2	78	32
3	141	32
4	193	32
5	201	32
0	7	5
0	11	5
1	16	5
2	23	5
3	31	5
4	39	5
0	39	4