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

analyze11.0ms (0.9%)

Memory

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

sample724.0ms (59.5%)

Memory

-19.8MiB live, 833.9MiB allocated; 212ms collecting garbage

Samples

447.0ms

8 256×

valid

Precisions

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

ival-mult: 136.0ms (54.6% of total)

ival-div: 102.0ms (40.9% of total)

exact: 6.0ms (2.4% of total)

ival-assert: 3.0ms (1.2% of total)

adjust: 2.0ms (0.8% of total)

Bogosity

explain78.0ms (6.4%)

Memory

-5.0MiB live, 103.3MiB allocated; 10ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Example	Example	Subexpression
1	-	-	`(/.f64 x (*.f64 y #s(literal 2 binary64)))`
0	-	-	`y`
0	-	-	`#s(literal 2 binary64)`
0	-	-	`x`
0	-	-	`(*.f64 y #s(literal 2 binary64))`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`/.f64`	`(/.f64 x (*.f64 y #s(literal 2 binary64)))`	n/o	1	0
↳	`(*.f64 y #s(literal 2 binary64))`	overflow	1

Confusion

	Predicted +	Predicted -
+	1	0
-	0	255

Precision

1.0

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	255

Precision?

1.0

Recall?

1.0

Freqs

test

number	freq
0	255
1	1

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	1	0	0
-	0	0	0

Precision?

1.0

Recall?

1.0

Samples

52.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 35.0ms (87.6% of total)

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

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

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

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

preprocess212.0ms (17.4%)

Memory

5.8MiB live, 202.3MiB allocated; 43ms 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.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

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

Compiler

Compiled 5 to 5 computations (0% saved)

series6.0ms (0.5%)

Memory

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

rewrite37.0ms (3%)

Memory

-38.4MiB live, 54.7MiB allocated; 12ms 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))) (+.f64 (.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)

eval2.0ms (0.2%)

Memory: 6.7MiB live, 6.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 180 to 61 computations (66.1% saved)

prune5.0ms (0.4%)

Memory

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

Compiler

Compiled 5 to 5 computations (0% saved)

series4.0ms (0.3%)

Memory

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

Counts

5 → 4

Calls

Call 1

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

Outputs
#s(approx (/ (/ x y) 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 y #s(hole binary64 y))

Calls

6 calls:

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

rewrite41.0ms (3.4%)

Memory

-20.5MiB live, 27.0MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	35
0	14	35
1	28	35
0	75	35

Stop Event

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

Counts

9 → 18

Calls

Call 1

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

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

eval2.0ms (0.1%)

Memory: 4.6MiB live, 4.6MiB allocated; 0ms collecting garbage
Compiler: Compiled 120 to 42 computations (65% saved)

prune4.0ms (0.3%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	18	0	18
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	18	1	19

Accuracy

100.0%

Counts

19 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 15 to 12 computations (20% saved)

regimes5.0ms (0.4%)

Memory

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

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

1.0ms	x
1.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)

regimes10.0ms (0.8%)

Memory

-35.3MiB live, 14.4MiB allocated; 8ms collecting garbage

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

simplify42.0ms (3.5%)

Memory

3.8MiB live, 49.1MiB allocated; 8ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10
1	9	10
2	12	10
3	18	10
4	50	10
5	372	10
6	3463	10

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess31.0ms (2.5%)

Memory

12.0MiB live, 59.3MiB allocated; 3ms collecting garbage

Remove

(negabs y)

(negabs x)

Compiler

Compiled 70 to 64 computations (8.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze11.0ms (0.9%)

sample724.0ms (59.5%)

explain78.0ms (6.4%)

preprocess212.0ms (17.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series6.0ms (0.5%)

rewrite37.0ms (3%)

eval2.0ms (0.2%)

prune5.0ms (0.4%)

series4.0ms (0.3%)

rewrite41.0ms (3.4%)

eval2.0ms (0.1%)

prune4.0ms (0.3%)

regimes5.0ms (0.4%)

regimes10.0ms (0.8%)

simplify42.0ms (3.5%)

derivations1.0ms (0.1%)

preprocess31.0ms (2.5%)

end0.0ms (0%)

Profiling