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

start0.0ms (0%)

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

analyze9.0ms (1.3%)

Memory

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

sample401.0ms (57.1%)

Memory

3.3MiB live, 140.4MiB allocated; 9ms collecting garbage

Samples

232.0ms

8 256×

valid

Precisions

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

ival-div!: 45.0ms (49% of total)

ival-mult!: 40.0ms (43.5% of total)

adjust: 7.0ms (7.6% of total)

Bogosity

explain35.0ms (5%)

Memory

2.8MiB live, 21.0MiB allocated; 1ms 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

16.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div!: 3.0ms (53.9% of total)

ival-mult!: 2.0ms (35.9% of total)

adjust: 0.0ms (0% of total)

preprocess169.0ms (24.1%)

Memory

0.2MiB live, 23.4MiB allocated; 2ms 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.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

series6.0ms (0.9%)

Memory

-5.1MiB live, 2.4MiB allocated; 1ms 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
1.0ms	y	@	-inf	((/ x (* y 2)) x (* y 2) y 2)
1.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	@	0	((/ x (* y 2)) x (* y 2) y 2)

rewrite26.0ms (3.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	35
1	29	35
0	84	35

Stop Event

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

Counts

9 → 24

Calls

Call 1

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

eval3.0ms (0.4%)

Memory: -5.9MiB live, 1.7MiB allocated; 1ms collecting garbage
Compiler: Compiled 179 to 61 computations (65.9% saved)

prune2.0ms (0.3%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accuracy

100.0%

Counts

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

series3.0ms (0.4%)

Memory

2.2MiB live, 2.2MiB allocated; 0ms 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
1.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)

rewrite15.0ms (2.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	34
0	16	34
0	37	34

Stop Event

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

Counts

8 → 13

Calls

Call 1

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

eval1.0ms (0.2%)

Memory: 1.0MiB live, 1.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 116 to 38 computations (67.2% saved)

prune1.0ms (0.2%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	15	0	15
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	15	1	16

Accuracy

100.0%

Counts

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

regimes6.0ms (0.9%)

Memory

-2.0MiB live, 5.8MiB 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:

3.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)

simplify9.0ms (1.2%)

Memory

-4.2MiB live, 4.9MiB allocated; 1ms 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.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 4 computations (20% saved)

preprocess15.0ms (2.1%)

Memory

1.6MiB live, 9.1MiB allocated; 1ms 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%)

analyze9.0ms (1.3%)

sample401.0ms (57.1%)

explain35.0ms (5%)

preprocess169.0ms (24.1%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.9%)

rewrite26.0ms (3.6%)

eval3.0ms (0.4%)

prune2.0ms (0.3%)

series3.0ms (0.4%)

rewrite15.0ms (2.2%)

eval1.0ms (0.2%)

prune1.0ms (0.2%)

regimes6.0ms (0.9%)

simplify9.0ms (1.2%)

derivations1.0ms (0.1%)

preprocess15.0ms (2.1%)

end0.0ms (0%)

Profiling