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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample780.0ms (76.6%)

Memory

-39.3MiB live, 927.7MiB allocated; 415ms collecting garbage

Samples

529.0ms

8 256×

valid

Precisions

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

ival-mult!: 96.0ms (82.1% of total)

ival-sub!: 20.0ms (17.1% of total)

adjust: 2.0ms (1.7% of total)

Bogosity

preprocess20.0ms (1.9%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	27	76
1	95	70
2	248	70
3	493	70
4	584	70
5	587	70

Stop Event

1×

saturated

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))

Symmetry

(sort y z)

Compiler

Compiled 14 to 14 computations (0% saved)

series19.0ms (1.9%)

Memory

-10.6MiB live, 33.9MiB allocated; 11ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	55	186

Stop Event

1×	iter-limit

Counts

7 → 14

Calls

Call 1

Inputs
(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))
x
(.f64 (.f64 y #s(literal 4 binary64)) z)
(*.f64 y #s(literal 4 binary64))
y
#s(literal 4 binary64)
z

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

Calls

9 calls:

Time	Variable	Point
1.0ms	y	0
1.0ms	z	0
1.0ms	y	inf
1.0ms	y	-inf
1.0ms	z	inf

rewrite11.0ms (1.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	19
0	10	19
1	21	19
2	55	19
3	123	19
4	207	19
5	233	19
0	233	18

Stop Event

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

Counts

7 → 39

Calls

Call 1

Inputs
(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))
x
(.f64 (.f64 y #s(literal 4 binary64)) z)
(*.f64 y #s(literal 4 binary64))
y
#s(literal 4 binary64)
z

Outputs
(neg.f64 (-.f64 (.f64 (.f64 z #s(literal 4 binary64)) y) x))
(fma.f64 (*.f64 z y) #s(literal -4 binary64) x)
(fma.f64 (*.f64 (neg.f64 z) y) #s(literal 4 binary64) x)
(fma.f64 #s(literal -4 binary64) (*.f64 z y) x)
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
(fma.f64 (neg.f64 z) (*.f64 #s(literal 4 binary64) y) x)
(fma.f64 (neg.f64 y) (*.f64 z #s(literal 4 binary64)) x)
(fma.f64 (*.f64 z #s(literal 4 binary64)) (neg.f64 y) x)
(fma.f64 (*.f64 #s(literal -4 binary64) y) z x)
(fma.f64 z (*.f64 #s(literal -4 binary64) y) x)
(fma.f64 (*.f64 #s(literal 4 binary64) y) (neg.f64 z) x)
(fma.f64 #s(literal 4 binary64) (*.f64 (neg.f64 z) y) x)
(fma.f64 y (*.f64 #s(literal -4 binary64) z) x)
(-.f64 (.f64 (.f64 #s(literal -4 binary64) y) z) (neg.f64 x))
(-.f64 x (.f64 (.f64 z #s(literal 4 binary64)) y))
(+.f64 (.f64 (.f64 #s(literal -4 binary64) y) z) x)
(+.f64 x (.f64 (.f64 #s(literal -4 binary64) y) z))
x
(.f64 (.f64 z y) #s(literal 4 binary64))
(.f64 (.f64 (neg.f64 z) y) #s(literal -4 binary64))
(.f64 #s(literal -4 binary64) (.f64 (neg.f64 z) y))
(.f64 (.f64 #s(literal -4 binary64) z) (neg.f64 y))
(.f64 (neg.f64 z) (.f64 #s(literal -4 binary64) y))
(.f64 (neg.f64 y) (.f64 #s(literal -4 binary64) z))
(.f64 (.f64 z #s(literal 4 binary64)) y)
(.f64 (.f64 #s(literal -4 binary64) y) (neg.f64 z))
(.f64 z (.f64 #s(literal 4 binary64) y))
(.f64 (.f64 #s(literal 4 binary64) y) z)
(.f64 #s(literal 4 binary64) (.f64 z y))
(.f64 y (.f64 z #s(literal 4 binary64)))
(neg.f64 (.f64 (.f64 #s(literal -4 binary64) y) z))
(*.f64 #s(literal -4 binary64) (neg.f64 y))
(*.f64 (neg.f64 y) #s(literal -4 binary64))
(*.f64 #s(literal 4 binary64) y)
(*.f64 y #s(literal 4 binary64))
(neg.f64 (*.f64 #s(literal -4 binary64) y))
y
#s(literal 4 binary64)
z

eval15.0ms (1.5%)

Memory: -31.2MiB live, 12.9MiB allocated; 21ms collecting garbage
Compiler: Compiled 454 to 126 computations (72.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

	Pruned	Kept	Total
New	46	2	48
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	47	2	49

Accuracy

100.0%

Counts

49 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
▶	52.8%	#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))

Compiler

Compiled 19 to 17 computations (10.5% saved)

series9.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	71	249

Stop Event

1×	iter-limit

Counts

9 → 18

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
(.f64 #s(literal -4 binary64) (.f64 y z))
#s(literal -4 binary64)
(*.f64 y z)
y
z
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
(*.f64 #s(literal -4 binary64) z)
x

Outputs
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
#s(approx (- x (* (* y 4) z)) (-.f64 x (.f64 #s(literal 4 binary64) (.f64 y z))))
#s(approx (+ (* (* -4 z) y) x) (+.f64 x (.f64 #s(literal -4 binary64) (.f64 y z))))
#s(approx x x)
#s(approx (- x (* (* y 4) z)) (.f64 x (+.f64 #s(literal 1 binary64) (.f64 #s(literal -4 binary64) (/.f64 (*.f64 y z) x)))))
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -1 binary64) (.f64 x (-.f64 (.f64 #s(literal 4 binary64) (/.f64 (.f64 y z) x)) #s(literal 1 binary64)))))
#s(approx (* y z) (*.f64 y z))
#s(approx y y)
#s(approx (- x (* (* y 4) z)) (.f64 y (-.f64 (/.f64 x y) (.f64 #s(literal 4 binary64) z))))
#s(approx (+ (* (* -4 z) y) x) (*.f64 y (fma.f64 #s(literal -4 binary64) z (/.f64 x y))))
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -1 binary64) (.f64 y (-.f64 (.f64 #s(literal -1 binary64) (/.f64 x y)) (.f64 #s(literal -4 binary64) z)))))
#s(approx (+ (* (* -4 z) y) x) (.f64 #s(literal -1 binary64) (.f64 y (fma.f64 #s(literal -1 binary64) (/.f64 x y) (*.f64 #s(literal 4 binary64) z)))))
#s(approx z z)
#s(approx (* -4 z) (*.f64 #s(literal -4 binary64) z))
#s(approx (- x (* (* y 4) z)) (.f64 z (-.f64 (/.f64 x z) (.f64 #s(literal 4 binary64) y))))
#s(approx (+ (* (* -4 z) y) x) (*.f64 z (fma.f64 #s(literal -4 binary64) y (/.f64 x z))))
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -1 binary64) (.f64 z (-.f64 (.f64 #s(literal -1 binary64) (/.f64 x z)) (.f64 #s(literal -4 binary64) y)))))
#s(approx (+ (* (* -4 z) y) x) (.f64 #s(literal -1 binary64) (.f64 z (fma.f64 #s(literal -1 binary64) (/.f64 x z) (*.f64 #s(literal 4 binary64) y)))))

Calls

9 calls:

Time	Variable	Point
1.0ms	z	-inf
1.0ms	y	-inf
1.0ms	z	inf
1.0ms	z	0
1.0ms	y	inf

rewrite9.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	34
0	18	34
1	40	33
2	87	33
3	170	33
4	224	33
0	224	33

Stop Event

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

Counts

9 → 45

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
(.f64 #s(literal -4 binary64) (.f64 y z))
#s(literal -4 binary64)
(*.f64 y z)
y
z
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
(*.f64 #s(literal -4 binary64) z)
x

Outputs
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
(.f64 (.f64 (neg.f64 z) y) #s(literal 4 binary64))
(.f64 (neg.f64 z) (.f64 #s(literal 4 binary64) y))
(.f64 (neg.f64 y) (.f64 z #s(literal 4 binary64)))
(.f64 (.f64 z #s(literal 4 binary64)) (neg.f64 y))
(.f64 (.f64 #s(literal -4 binary64) y) z)
(.f64 (.f64 #s(literal -4 binary64) z) y)
(.f64 (.f64 z y) #s(literal -4 binary64))
(.f64 #s(literal -4 binary64) (.f64 z y))
(.f64 z (.f64 #s(literal -4 binary64) y))
(.f64 (.f64 #s(literal 4 binary64) y) (neg.f64 z))
(.f64 #s(literal 4 binary64) (.f64 (neg.f64 z) y))
(.f64 y (.f64 #s(literal -4 binary64) z))
(neg.f64 (.f64 (.f64 z #s(literal 4 binary64)) y))
#s(literal -4 binary64)
(*.f64 (neg.f64 z) (neg.f64 y))
(*.f64 (neg.f64 y) (neg.f64 z))
(*.f64 z y)
(*.f64 y z)
(neg.f64 (*.f64 (neg.f64 z) y))
y
z
(neg.f64 (-.f64 (.f64 (.f64 z #s(literal 4 binary64)) y) x))
(fma.f64 (*.f64 (neg.f64 z) y) #s(literal 4 binary64) x)
(fma.f64 (neg.f64 z) (*.f64 #s(literal 4 binary64) y) x)
(fma.f64 (neg.f64 y) (*.f64 z #s(literal 4 binary64)) x)
(fma.f64 (*.f64 z #s(literal 4 binary64)) (neg.f64 y) x)
(fma.f64 (*.f64 #s(literal -4 binary64) y) z x)
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
(fma.f64 (*.f64 z y) #s(literal -4 binary64) x)
(fma.f64 #s(literal -4 binary64) (*.f64 z y) x)
(fma.f64 z (*.f64 #s(literal -4 binary64) y) x)
(fma.f64 (*.f64 #s(literal 4 binary64) y) (neg.f64 z) x)
(fma.f64 #s(literal 4 binary64) (*.f64 (neg.f64 z) y) x)
(fma.f64 y (*.f64 #s(literal -4 binary64) z) x)
(-.f64 (.f64 (.f64 #s(literal -4 binary64) z) y) (neg.f64 x))
(-.f64 x (.f64 (.f64 z #s(literal 4 binary64)) y))
(+.f64 (.f64 (.f64 #s(literal -4 binary64) z) y) x)
(+.f64 x (.f64 (.f64 #s(literal -4 binary64) z) y))
(*.f64 (neg.f64 z) #s(literal 4 binary64))
(*.f64 #s(literal -4 binary64) z)
(*.f64 z #s(literal -4 binary64))
(*.f64 #s(literal 4 binary64) (neg.f64 z))
(neg.f64 (*.f64 z #s(literal 4 binary64)))
x

eval18.0ms (1.7%)

Memory: -42.4MiB live, 13.7MiB allocated; 29ms collecting garbage
Compiler: Compiled 682 to 154 computations (77.4% saved)

prune3.0ms (0.3%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	56	1	57
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	56	3	59

Accuracy

100.0%

Counts

59 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
▶	52.8%	#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
✓	52.8%	#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))

Compiler

Compiled 32 to 28 computations (12.5% saved)

series7.0ms (0.7%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	54	181

Stop Event

1×	iter-limit

Counts

6 → 13

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
(.f64 (.f64 #s(literal -4 binary64) z) y)
(*.f64 #s(literal -4 binary64) z)
#s(literal -4 binary64)
z
y

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

Calls

9 calls:

Time	Variable	Point
1.0ms	z	-inf
1.0ms	z	inf
1.0ms	y	-inf
1.0ms	y	inf
0.0ms	z	0

rewrite18.0ms (1.8%)

Memory

-29.1MiB live, 16.8MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	24
0	13	24
1	28	24
2	64	24
3	130	24
4	216	24
5	242	24
0	242	23

Stop Event

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

Counts

6 → 22

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
(.f64 (.f64 #s(literal -4 binary64) z) y)
(*.f64 #s(literal -4 binary64) z)
#s(literal -4 binary64)
z
y

Outputs
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) y) z))
(.f64 (.f64 z y) #s(literal -4 binary64))
(.f64 (.f64 (neg.f64 z) y) #s(literal 4 binary64))
(.f64 (neg.f64 z) (.f64 #s(literal 4 binary64) y))
(.f64 (neg.f64 y) (.f64 z #s(literal 4 binary64)))
(.f64 (.f64 z #s(literal 4 binary64)) (neg.f64 y))
(.f64 (.f64 #s(literal -4 binary64) y) z)
(.f64 (.f64 #s(literal -4 binary64) z) y)
(.f64 #s(literal -4 binary64) (.f64 z y))
(.f64 z (.f64 #s(literal -4 binary64) y))
(.f64 (.f64 #s(literal 4 binary64) y) (neg.f64 z))
(.f64 #s(literal 4 binary64) (.f64 (neg.f64 z) y))
(.f64 y (.f64 #s(literal -4 binary64) z))
(neg.f64 (.f64 (.f64 z #s(literal 4 binary64)) y))
(*.f64 (neg.f64 z) #s(literal 4 binary64))
(*.f64 #s(literal -4 binary64) z)
(*.f64 z #s(literal -4 binary64))
(*.f64 #s(literal 4 binary64) (neg.f64 z))
(neg.f64 (*.f64 z #s(literal 4 binary64)))
#s(literal -4 binary64)
z
y

eval3.0ms (0.3%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 433 to 105 computations (75.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	28	1	29
Fresh	0	0	0
Picked	0	1	1
Done	1	1	2
Total	29	3	32

Accuracy

100.0%

Counts

32 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
✓	52.8%	#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
▶	49.0%	#s(approx (- x (* (* y 4) z)) x)

Compiler

Compiled 28 to 25 computations (10.7% saved)

series4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	51	162

Stop Event

1×	iter-limit

Counts

2 → 10

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) x)
x

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

Calls

9 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	x	0
0.0ms	y	-inf
0.0ms	z	inf

rewrite9.0ms (0.9%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	10
0	8	10
1	19	10
2	53	10
3	120	10
4	204	10
5	230	10
0	230	9

Stop Event

1×	iter-limit
1×	saturated
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) x)
x

Outputs
#s(approx (- x (* (* y 4) z)) x)
x

eval20.0ms (1.9%)

Memory: -42.6MiB live, 2.8MiB allocated; 7ms collecting garbage
Compiler: Compiled 170 to 53 computations (68.8% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

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

Accuracy

100.0%

Counts

13 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
✓	52.8%	#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
✓	49.0%	#s(approx (- x (* (* y 4) z)) x)

Compiler

Compiled 28 to 25 computations (10.7% saved)

regimes32.0ms (3.1%)

Memory

39.1MiB live, 84.7MiB allocated; 5ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

3 → 3

5 → 1

Calls

Call 1

Inputs
#s(approx (- x (* (* y 4) z)) x)

Outputs
#s(approx (- x (* (* y 4) z)) x)

Call 2

Inputs
#s(approx (- x (* (* y 4) z)) x)
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))

Outputs
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
#s(approx (- x (* (* y 4) z)) x)
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))

Call 3

Inputs
#s(approx (- x (* (* y 4) z)) x)
#s(approx (- x (* (* y 4) z)) (.f64 #s(literal -4 binary64) (.f64 y z)))
#s(approx (- x (* (* y 4) z)) (.f64 (.f64 #s(literal -4 binary64) z) y))
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)
(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))

Outputs
(fma.f64 (*.f64 #s(literal -4 binary64) z) y x)

Calls

18 calls:

2.0ms	z
2.0ms	x
2.0ms	(*.f64 y #s(literal 4 binary64))
2.0ms	y
2.0ms	(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))

Results

Accuracy	Segments	Branch
49.0%	1	`(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))`
49.0%	1	`(*.f64 y #s(literal 4 binary64))`
49.0%	1	`y`
49.0%	1	`x`
49.0%	1	`z`
49.0%	1	`(.f64 (.f64 y #s(literal 4 binary64)) z)`
71.8%	3	`(*.f64 y #s(literal 4 binary64))`
77.9%	3	`(.f64 (.f64 y #s(literal 4 binary64)) z)`
66.3%	5	`(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))`
73.8%	3	`x`
71.8%	3	`y`
75.1%	3	`z`
100.0%	1	`(*.f64 y #s(literal 4 binary64))`
100.0%	1	`(.f64 (.f64 y #s(literal 4 binary64)) z)`
100.0%	1	`(-.f64 x (.f64 (.f64 y #s(literal 4 binary64)) z))`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 102 to 101 computations (1% saved)

bsearch0.0ms (0%)

Memory

1.3MiB live, 1.2MiB allocated; 0ms collecting garbage

Algorithm

2×	left-value

Steps

Time	Left	Right
0.0ms	8.866365890848128e-39	1.4779085397970506e-37
0.0ms	-8.208691962346357e+25	-3.320583434794406e+25

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations13.0ms (1.3%)

Memory

-39.5MiB live, 11.2MiB allocated; 13ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 66 to 23 computations (65.2% saved)

preprocess24.0ms (2.3%)

Memory: 25.0MiB live, 70.9MiB allocated; 5ms collecting garbage
Remove: (sort y z)
Compiler: Compiled 205 to 100 computations (51.2% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample780.0ms (76.6%)

preprocess20.0ms (1.9%)

series19.0ms (1.9%)

rewrite11.0ms (1.1%)

eval15.0ms (1.5%)

prune1.0ms (0.1%)

series9.0ms (0.9%)

rewrite9.0ms (0.9%)

eval18.0ms (1.7%)

prune3.0ms (0.3%)

series7.0ms (0.7%)

rewrite18.0ms (1.8%)

eval3.0ms (0.3%)

prune2.0ms (0.2%)

series4.0ms (0.4%)

rewrite9.0ms (0.9%)

eval20.0ms (1.9%)

prune1.0ms (0.1%)

regimes32.0ms (3.1%)

bsearch0.0ms (0%)

derivations13.0ms (1.3%)

preprocess24.0ms (2.3%)

end0.0ms (0%)

Profiling