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

analyze35.0ms (1.9%)

Memory

-22.8MiB live, 20.9MiB allocated; 9ms 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)

sample929.0ms (51.6%)

Memory

40.8MiB live, 1 277.5MiB allocated; 290ms collecting garbage

Samples

503.0ms

8 256×

valid

Precisions

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

ival-div: 79.0ms (46.2% of total)

ival-mult: 76.0ms (44.4% of total)

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

exact: 5.0ms (2.9% of total)

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

adjust: 2.0ms (1.2% of total)

Bogosity

explain90.0ms (5%)

Memory

-26.3MiB live, 73.1MiB allocated; 23ms 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

20.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 4.0ms (47.7% of total)

ival-mult: 4.0ms (47.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)

preprocess268.0ms (14.9%)

Memory

38.4MiB live, 231.3MiB allocated; 28ms 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune31.0ms (1.7%)

Memory

-45.1MiB live, 1.7MiB allocated; 2ms 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)

series6.0ms (0.4%)

Memory

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

Counts

5 → 4

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
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 2) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 y))

Calls

6 calls:

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

simplify169.0ms (9.4%)

Memory

22.2MiB live, 254.3MiB allocated; 23ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	24
1	21	24
2	32	24
3	54	24
4	107	24
5	366	24
6	2395	24
0	8118	24

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 4

Calls

Call 1

Inputs
#s(approx (/ x (* y 2)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (* y 2) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 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 x #s(hole binary64 x))
#s(approx x x)
#s(approx (* y 2) #s(hole binary64 (* 2 y)))
#s(approx (* y 2) (*.f64 #s(literal 2 binary64) y))
#s(approx y #s(hole binary64 y))
#s(approx y y)

rewrite48.0ms (2.7%)

Memory

-10.4MiB live, 93.1MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

5 → 18

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

eval2.0ms (0.1%)

Memory: 4.6MiB live, 4.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 146 to 48 computations (67.1% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	21	1	22
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	22	1	23

Accuracy

100.0%

Counts

23 → 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)

series25.0ms (1.4%)

Memory

-35.3MiB live, 11.7MiB allocated; 3ms collecting garbage

Counts

4 → 4

Calls

Call 1

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

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

Calls

6 calls:

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

simplify125.0ms (6.9%)

Memory

14.2MiB live, 198.3MiB allocated; 19ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	24
1	20	24
2	32	24
3	54	24
4	106	24
5	363	24
6	2384	24
0	8108	24

Stop Event

1×	iter limit
1×	node limit

Counts

4 → 4

Calls

Call 1

Inputs
#s(approx (/ x (+ y y)) #s(hole binary64 (* 1/2 (/ x y))))
#s(approx x #s(hole binary64 x))
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx y #s(hole binary64 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 x #s(hole binary64 x))
#s(approx x x)
#s(approx (+ y y) #s(hole binary64 (* 2 y)))
#s(approx (+ y y) (*.f64 #s(literal 2 binary64) y))
#s(approx y #s(hole binary64 y))
#s(approx y y)

rewrite29.0ms (1.6%)

Memory

14.7MiB live, 58.0MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

4 → 23

Calls

Call 1

Inputs
(/.f64 x (+.f64 y y))
x
(+.f64 y 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)))
x
(*.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)
y

eval2.0ms (0.1%)

Memory: 8.2MiB live, 8.2MiB allocated; 0ms collecting garbage
Compiler: Compiled 230 to 66 computations (71.3% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	29	0	29
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	29	1	30

Accuracy

100.0%

Counts

30 → 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)

regimes9.0ms (0.5%)

Memory

-38.1MiB live, 22.5MiB allocated; 4ms 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:

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

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)

simplify9.0ms (0.5%)

Memory

25.8MiB live, 25.9MiB allocated; 0ms 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

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess17.0ms (1%)

Memory

2.2MiB live, 48.5MiB allocated; 3ms 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%)

analyze35.0ms (1.9%)

sample929.0ms (51.6%)

explain90.0ms (5%)

preprocess268.0ms (14.9%)

eval0.0ms (0%)

prune31.0ms (1.7%)

series6.0ms (0.4%)

simplify169.0ms (9.4%)

rewrite48.0ms (2.7%)

eval2.0ms (0.1%)

prune1.0ms (0.1%)

series25.0ms (1.4%)

simplify125.0ms (6.9%)

rewrite29.0ms (1.6%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

regimes9.0ms (0.5%)

simplify9.0ms (0.5%)

derivations1.0ms (0%)

preprocess17.0ms (1%)

end0.0ms (0%)

Profiling