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

analyze10.0ms (1.2%)

Memory

17.8MiB live, 17.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
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)

sample587.0ms (74.7%)

Memory

12.5MiB live, 811.4MiB allocated; 96ms collecting garbage

Samples

392.0ms

8 256×

valid

Precisions

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

ival-mult!: 119.0ms (70.8% of total)

ival-div!: 47.0ms (28% of total)

adjust: 1.0ms (0.6% of total)

Bogosity

preprocess97.0ms (12.4%)

Memory

-23.2MiB live, 37.7MiB allocated; 32ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	34	30
2	76	30
3	164	30
4	385	30
5	1554	30
6	5873	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.8%)

Memory

12.6MiB live, 12.6MiB 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	y	@	0	((/ x (* y 2)) x (* y 2) y 2)

rewrite40.0ms (5%)

Memory

11.1MiB live, 59.1MiB allocated; 7ms 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 y y))
(neg.f64 (/.f64 (neg.f64 x) (+.f64 y 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 y y))
#s(approx y y)

eval2.0ms (0.2%)

Memory: 3.7MiB live, 3.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 80 to 60 computations (25% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	19	1	20
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	20	1	21

Accuracy

100.0%

Counts

21 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 4 to 4 computations (0% saved)

series3.0ms (0.4%)

Memory

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

rewrite19.0ms (2.4%)

Memory

-24.4MiB live, 22.8MiB allocated; 2ms 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 y y)))
(/.f64 x (+.f64 y 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 y y))
#s(approx y y)

eval2.0ms (0.3%)

Memory: 3.1MiB live, 3.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 46 to 37 computations (19.6% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	10	0	10
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	10	1	11

Accuracy

100.0%

Counts

11 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 11 to 11 computations (0% saved)

regimes5.0ms (0.6%)

Memory

9.1MiB live, 9.1MiB 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	(*.f64 y #s(literal 2 binary64))
1.0ms	y
1.0ms	(/.f64 x (*.f64 y #s(literal 2 binary64)))
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)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 4 to 4 computations (0% saved)

preprocess13.0ms (1.7%)

Memory

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

Remove

(negabs y)

(negabs x)

Compiler

Compiled 25 to 25 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze10.0ms (1.2%)

sample587.0ms (74.7%)

preprocess97.0ms (12.4%)

series6.0ms (0.8%)

rewrite40.0ms (5%)

eval2.0ms (0.2%)

prune1.0ms (0.1%)

series3.0ms (0.4%)

rewrite19.0ms (2.4%)

eval2.0ms (0.3%)

prune1.0ms (0.1%)

regimes5.0ms (0.6%)

derivations1.0ms (0.1%)

preprocess13.0ms (1.7%)

end0.0ms (0%)

Profiling