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

start0.0ms (0%)

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

analyze26.0ms (1.3%)

Memory

-14.9MiB live, 28.7MiB allocated; 17ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	99.9%	0.1%	0%	0%	0%	0
0%	0%	99.9%	0.1%	0%	0%	0%	1
0%	0%	99.9%	0.1%	0%	0%	0%	2
50%	50%	50%	0.1%	0%	0%	0%	3
50%	50%	50%	0.1%	0%	0%	0%	4
75%	74.9%	25%	0.1%	0%	0%	0%	5
75%	74.9%	25%	0.1%	0%	0%	0%	6
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	7
87.5%	87.4%	12.5%	0.1%	0%	0%	0%	8
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	9
93.8%	93.7%	6.2%	0.1%	0%	0%	0%	10
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	11
96.9%	96.8%	3.1%	0.1%	0%	0%	0%	12

Compiler

Compiled 7 to 7 computations (0% saved)

sample901.0ms (44.6%)

Memory

15.0MiB live, 961.6MiB allocated; 219ms collecting garbage

Samples

470.0ms

8 256×

valid

Precisions

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

ival-div: 113.0ms (58.5% of total)

ival-mult: 63.0ms (32.6% of total)

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

exact: 5.0ms (2.6% of total)

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

adjust: 2.0ms (1% of total)

Bogosity

explain117.0ms (5.8%)

Memory

-25.1MiB live, 133.4MiB allocated; 14ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`y`
-	-	`#s(literal 2 binary64)`
-	-	`(/.f64 x (*.f64 y #s(literal 2 binary64)))`
-	-	`x`
-	-	`(*.f64 y #s(literal 2 binary64))`

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

59.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 38.0ms (89.6% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess210.0ms (10.4%)

Memory

2.6MiB live, 275.9MiB allocated; 49ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	34	30
2	76	30
3	163	30
4	383	30
5	1577	30
6	6399	30
0	5	5
0	7	5
1	12	5
2	22	5
3	42	5
4	87	5
5	312	5
6	2012	5
0	8169	5

Stop Event

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

Calls

Call 1

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

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

1.8MiB live, 1.7MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

simplify100.0ms (5%)

Memory

18.2MiB live, 169.5MiB allocated; 12ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 y #s(literal 2 binary64))
cost-diff	0	(/.f64 x (*.f64 y #s(literal 2 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	22	11
3	42	11
4	87	11
5	312	11
6	2012	11
0	8169	11

Stop Event

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

Calls

Call 1

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

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

localize19.0ms (1%)

Memory

-12.9MiB live, 34.0MiB allocated; 3ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 x (*.f64 y #s(literal 2 binary64)))
accuracy	0.0	(*.f64 y #s(literal 2 binary64))

Samples

15.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

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

ival-div: 2.0ms (22.2% 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)

series5.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

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

Calls

6 calls:

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

simplify121.0ms (6%)

Memory

-6.5MiB live, 181.4MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	18
1	19	18
2	30	18
3	52	18
4	105	18
5	412	18
6	2443	18
0	8177	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

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

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

rewrite27.0ms (1.3%)

Memory

16.6MiB live, 63.6MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	15	8
0	50	8

Stop Event

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

Counts

2 → 15

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 5.7MiB live, 5.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 117 to 43 computations (63.2% saved)

prune106.0ms (5.3%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	16	1	17
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	17	1	18

Accuracy

100.0%

Counts

18 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(/.f64 x (+.f64 y y))

Compiler

Compiled 5 to 4 computations (20% saved)

simplify123.0ms (6.1%)

Memory

-21.7MiB live, 174.8MiB allocated; 39ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 y y)
cost-diff	0	(/.f64 x (+.f64 y y))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	8	10
2	13	10
3	22	10
4	42	10
5	87	10
6	354	10
7	2046	10
0	8223	10

Stop Event

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

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
x
(+.f64 y y)
y

Outputs
(/.f64 x (+.f64 y y))
(/.f64 x (*.f64 #s(literal 2 binary64) y))
x
(+.f64 y y)
(*.f64 #s(literal 2 binary64) y)
y

localize48.0ms (2.4%)

Memory

0.2MiB live, 53.5MiB allocated; 28ms collecting garbage

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 x (+.f64 y y))
accuracy	0.0	(+.f64 y y)

Samples

33.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-div: 26.0ms (95.2% of total)

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

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

adjust: 0.0ms (0% of total)

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

series3.0ms (0.1%)

Memory

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

Counts

2 → 2

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
(+.f64 y y)

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

Calls

6 calls:

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

simplify132.0ms (6.5%)

Memory

8.4MiB live, 98.8MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	18
1	18	18
2	30	18
3	52	18
4	105	18
5	366	18
6	2393	18
0	8124	18

Stop Event

1×	iter limit
1×	node limit

Counts

2 → 2

Calls

Call 1

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

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

rewrite26.0ms (1.3%)

Memory

-19.6MiB live, 23.5MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	20	8
0	120	8

Stop Event

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

Counts

2 → 21

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
(+.f64 y y)

Outputs
(*.f64 (/.f64 x #s(literal 0 binary64)) #s(literal 0 binary64))
(.f64 (/.f64 x (.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 (/.f64 x #s(literal 2 binary64)) y)
(/.f64 (neg.f64 (neg.f64 x)) (*.f64 #s(literal -2 binary64) y))
(/.f64 (neg.f64 x) (*.f64 #s(literal -2 binary64) y))
(/.f64 x (*.f64 #s(literal -2 binary64) y))
(neg.f64 (/.f64 x (*.f64 #s(literal -2 binary64) y)))
(*.f64 #s(literal -2 binary64) y)
(*.f64 #s(literal 2 binary64) (neg.f64 y))
(*.f64 #s(literal 2 binary64) y)
(*.f64 y #s(literal 2 binary64))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 y y #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (neg.f64 (fma.f64 y y #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 y #s(literal 3 binary64))) (fma.f64 y y #s(literal 0 binary64)))
(neg.f64 (*.f64 #s(literal -2 binary64) y))
(-.f64 (/.f64 (.f64 y y) #s(literal 0 binary64)) (/.f64 (.f64 y y) #s(literal 0 binary64)))
(+.f64 (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 y y #s(literal 0 binary64))))
(+.f64 (neg.f64 y) (neg.f64 y))
(+.f64 y y)

eval2.0ms (0.1%)

Memory: 4.2MiB live, 4.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 194 to 59 computations (69.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	23	0	23
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	23	1	24

Accuracy

100.0%

Counts

24 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	(/.f64 x (+.f64 y y))

Compiler

Compiled 15 to 11 computations (26.7% saved)

regimes5.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

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

Outputs
(/.f64 x (+.f64 y y))

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

simplify24.0ms (1.2%)

Memory

-22.6MiB live, 28.5MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	5

Stop Event

1×

saturated

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))

Outputs
(/.f64 x (+.f64 y y))

derivations1.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess22.0ms (1.1%)

Memory

-4.9MiB live, 36.3MiB allocated; 11ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 40 to 34 computations (15% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze26.0ms (1.3%)

sample901.0ms (44.6%)

explain117.0ms (5.8%)

preprocess210.0ms (10.4%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify100.0ms (5%)

localize19.0ms (1%)

series5.0ms (0.3%)

simplify121.0ms (6%)

rewrite27.0ms (1.3%)

eval2.0ms (0.1%)

prune106.0ms (5.3%)

simplify123.0ms (6.1%)

localize48.0ms (2.4%)

series3.0ms (0.1%)

simplify132.0ms (6.5%)

rewrite26.0ms (1.3%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

regimes5.0ms (0.2%)

simplify24.0ms (1.2%)

derivations1.0ms (0%)

preprocess22.0ms (1.1%)

end0.0ms (0%)

Profiling