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%)

Memory

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

sample701.0ms (72.2%)

Memory

-22.8MiB live, 1 028.3MiB allocated; 142ms collecting garbage

Samples

449.0ms

8 256×

valid

Precisions

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

ival-div!: 60.0ms (50.3% of total)

ival-mult!: 58.0ms (48.6% of total)

adjust: 1.0ms (0.8% of total)

Bogosity

preprocess86.0ms (8.9%)

Memory

8.3MiB live, 53.4MiB allocated; 5ms 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	1572	30
6	6442	30

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(negabs x)

(negabs y)

Compiler

Compiled 10 to 10 computations (0% saved)

series6.0ms (0.6%)

Memory

13.8MiB live, 13.8MiB 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 (4.1%)

Memory

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

eval5.0ms (0.5%)

Memory: -36.4MiB live, 8.4MiB allocated; 4ms collecting garbage
Compiler: Compiled 80 to 60 computations (25% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (2 fresh and 0 done)

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

Accuracy

100.0%

Counts

21 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 13 to 13 computations (0% saved)

series6.0ms (0.6%)

Memory

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

Counts

8 → 7

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite31.0ms (3.2%)

Memory

-1.4MiB live, 37.9MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	83
0	28	83
0	53	83

Stop Event

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

Counts

15 → 25

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 4.7MiB live, 4.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 80 to 65 computations (18.8% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	18	2	20

Accuracy

100.0%

Counts

20 → 2

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.6%	(/.f64 x (+.f64 y y))
✓	100.0%	#s(approx (/ x (* y 2)) (*.f64 (/.f64 x y) #s(literal 1/2 binary64)))

Compiler

Compiled 27 to 27 computations (0% saved)

regimes6.0ms (0.6%)

Memory

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

Counts

3 → 1

Calls

Call 1

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

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

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)

regimes17.0ms (1.8%)

Memory

-24.3MiB live, 17.5MiB allocated; 15ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations2.0ms (0.2%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 11 to 11 computations (0% saved)

preprocess56.0ms (5.7%)

Memory

-29.6MiB live, 76.8MiB allocated; 39ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 68 to 68 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze10.0ms (1%)

sample701.0ms (72.2%)

preprocess86.0ms (8.9%)

series6.0ms (0.6%)

rewrite40.0ms (4.1%)

eval5.0ms (0.5%)

prune1.0ms (0.1%)

series6.0ms (0.6%)

rewrite31.0ms (3.2%)

eval2.0ms (0.2%)

prune2.0ms (0.2%)

regimes6.0ms (0.6%)

regimes17.0ms (1.8%)

derivations2.0ms (0.2%)

preprocess56.0ms (5.7%)

end0.0ms (0%)

Profiling