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

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze10.0ms (0.9%)

Memory

16.0MiB live, 16.0MiB allocated

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)

sample667.0ms (63%)

Memory

42.4MiB live, 787.7MiB allocated

Samples

432.0ms

8 256×

valid

Precisions

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

ival-mult: 113.0ms (60.5% of total)

ival-div: 60.0ms (32.1% of total)

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

exact: 5.0ms (2.7% of total)

ival-assert: 4.0ms (2.1% of total)

Bogosity

explain68.0ms (6.4%)

Memory

-14.5MiB live, 74.7MiB allocated

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

45.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-div: 23.0ms (85.3% of total)

ival-mult: 3.0ms (11.1% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess37.0ms (3.5%)

Memory

-19.4MiB live, 27.4MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	31
1	32	25
2	62	25
3	92	25
4	113	25
5	125	25
0	5	5
0	7	5
1	12	5
2	17	5
0	17	5

Stop Event

1×	iter limit
1×	saturated
1×	iter limit
1×	saturated

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

(negabs x)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.8MiB live, 0.8MiB allocated

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)

simplify3.0ms (0.3%)

Memory

4.2MiB live, 4.2MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(*.f64 y #s(literal 2 binary64))
cost-diff	0	(/.f64 x (*.f64 y #s(literal 2 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	12	11
2	17	11
0	17	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

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

localize13.0ms (1.2%)

Memory

18.9MiB live, 18.9MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 x (*.f64 y #s(literal 2 binary64)))
accuracy	0.0	(*.f64 y #s(literal 2 binary64))

Samples

9.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

ival-div: 2.0ms (53.5% of total)

ival-mult: 2.0ms (53.5% of total)

ival-true: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series5.0ms (0.5%)

Memory

7.0MiB live, 7.0MiB allocated

Counts

2 → 2

Calls

Call 1

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

Outputs
(* 1/2 (/ x y))
(* 2 y)

Calls

6 calls:

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

simplify3.0ms (0.3%)

Memory

3.9MiB live, 3.9MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	8
1	14	8
2	18	8
3	20	8
4	21	8
0	21	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (/ x y))
(* 2 y)

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

rewrite60.0ms (5.7%)

Memory

-15.2MiB live, 36.2MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	15	8
2	38	8
3	85	8
0	197	8

Stop Event

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

Counts

2 → 35

Calls

Call 1

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

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

eval3.0ms (0.3%)

Memory: 6.0MiB live, 6.0MiB allocated
Compiler: Compiled 293 to 89 computations (69.6% saved)

prune1.0ms (0.1%)

Memory

2.9MiB live, 2.9MiB allocated

Pruning

1 alts after pruning (1 fresh and 0 done)

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

Accuracy

100.0%

Counts

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

simplify3.0ms (0.3%)

Memory

4.3MiB live, 4.3MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(+.f64 y y)
cost-diff	0	(/.f64 x (+.f64 y y))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	8	10
2	13	10
3	17	10
0	17	10

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize43.0ms (4%)

Memory

-26.1MiB live, 21.0MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(/.f64 x (+.f64 y y))
accuracy	0.0	(+.f64 y y)

Samples

39.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

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

ival-add: 1.0ms (17.1% of total)

ival-true: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

series3.0ms (0.3%)

Memory

4.6MiB live, 4.6MiB allocated

Counts

2 → 2

Calls

Call 1

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

Outputs
(* 1/2 (/ x y))
(* 2 y)

Calls

6 calls:

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

simplify3.0ms (0.3%)

Memory

4.5MiB live, 4.5MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	8
1	14	8
2	18	8
3	20	8
4	21	8
0	21	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 1/2 (/ x y))
(* 2 y)

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

rewrite20.0ms (1.9%)

Memory

22.2MiB live, 22.2MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 21

Calls

Call 1

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

eval31.0ms (3%)

Memory: -39.9MiB live, 6.8MiB allocated
Compiler: Compiled 194 to 62 computations (68% saved)

prune1.0ms (0.1%)

Memory

2.6MiB live, 2.6MiB allocated

Pruning

1 alts after pruning (0 fresh and 1 done)

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

Accuracy

100.0%

Counts

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

regimes5.0ms (0.5%)

Memory

11.1MiB live, 11.1MiB allocated

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

Memory

14.5MiB live, 14.5MiB allocated

Algorithm

1×	egg-herbie

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

soundness49.0ms (4.6%)

Memory

-27.3MiB live, 19.5MiB allocated

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	15	8
2	38	8
3	85	8
0	197	8

Stop Event

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

Compiler

Compiled 15 to 11 computations (26.7% saved)

preprocess20.0ms (1.9%)

Memory

30.5MiB live, 30.5MiB allocated

Remove

(negabs x)

(negabs y)

Compiler

Compiled 40 to 34 computations (15% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

start0.0ms (0%)

analyze10.0ms (0.9%)

sample667.0ms (63%)

explain68.0ms (6.4%)

preprocess37.0ms (3.5%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify3.0ms (0.3%)

localize13.0ms (1.2%)

series5.0ms (0.5%)

simplify3.0ms (0.3%)

rewrite60.0ms (5.7%)

eval3.0ms (0.3%)

prune1.0ms (0.1%)

simplify3.0ms (0.3%)

localize43.0ms (4%)

series3.0ms (0.3%)

simplify3.0ms (0.3%)

rewrite20.0ms (1.9%)

eval31.0ms (3%)

prune1.0ms (0.1%)

regimes5.0ms (0.5%)

simplify9.0ms (0.9%)

soundness49.0ms (4.6%)

preprocess20.0ms (1.9%)

end0.0ms (0%)

Profiling