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

24.7MiB live, 24.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)

sample499.0ms (63.6%)

Memory

14.5MiB live, 763.7MiB allocated; 152ms collecting garbage

Samples

324.0ms

8 256×

valid

Precisions

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

ival-div!: 80.0ms (61.3% of total)

ival-mult!: 49.0ms (37.6% of total)

adjust: 2.0ms (1.5% of total)

Bogosity

preprocess139.0ms (17.7%)

Memory

-37.8MiB live, 60.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	47	30
2	172	30
3	481	30
4	1225	30
5	4540	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

10.8MiB live, 10.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)

rewrite50.0ms (6.4%)

Memory

5.5MiB live, 52.3MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 2 (0.0ms)

Iter	Nodes	Cost
0	15	35
0	16	33
1	37	33
2	149	23
0	798	23
1	1727	23

Stop Event

1×	saturated
1×	iter-limit
1×	node-limit
1×	iter-limit

Counts

9 → 40

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

eval3.0ms (0.4%)

Memory: 6.3MiB live, 6.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 104 to 70 computations (32.7% saved)

prune2.0ms (0.2%)

Memory

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

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	36	1	37
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	36	2	38

Accuracy

100.0%

Counts

38 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 8 to 9 computations (-12.5% saved)

series1.0ms (0.2%)

Memory

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

Counts

3 → 2

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite7.0ms (0.8%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	15
0	7	15
1	8	15
0	8	15
1	11	15

Stop Event

1×	saturated
1×	saturated
1×	iter-limit

Counts

5 → 6

Calls

Call 1

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

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

eval0.0ms (0%)

Memory: 0.6MiB live, 0.5MiB allocated; 0ms collecting garbage
Compiler: Compiled 9 to 9 computations (0% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

2 alts after pruning (0 fresh and 2 done)

	Pruned	Kept	Total
New	3	0	3
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	3	2	5

Accuracy

100.0%

Counts

5 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 16 computations (-6.7% saved)

regimes8.0ms (1%)

Memory

-32.6MiB live, 14.4MiB allocated; 2ms collecting garbage

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

3.0ms	x
2.0ms	y
1.0ms	(*.f64 y #s(literal 2 binary64))
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)

regimes4.0ms (0.5%)

Memory

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

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 10 to 13 computations (-30% saved)

derivations5.0ms (0.7%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 7 computations (0% saved)

preprocess49.0ms (6.3%)

Memory: 15.1MiB live, 64.9MiB allocated; 5ms collecting garbage
Remove: (negabs x)
Compiler: Compiled 50 to 56 computations (-12% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze10.0ms (1.2%)

sample499.0ms (63.6%)

preprocess139.0ms (17.7%)

series6.0ms (0.8%)

rewrite50.0ms (6.4%)

eval3.0ms (0.4%)

prune2.0ms (0.2%)

series1.0ms (0.2%)

rewrite7.0ms (0.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes8.0ms (1%)

regimes4.0ms (0.5%)

derivations5.0ms (0.7%)

preprocess49.0ms (6.3%)

end0.0ms (0%)

Profiling