Metrics for Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, G

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 9 to 9 computations (0% saved)

sample717.0ms (59.8%)

Memory

35.8MiB live, 853.0MiB allocated; 236ms collecting garbage

Samples

433.0ms

8 256×

valid

Precisions

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

ival-div: 139.0ms (57% of total)

ival-mult: 51.0ms (20.9% of total)

ival-add: 40.0ms (16.4% of total)

exact: 9.0ms (3.7% of total)

adjust: 2.0ms (0.8% of total)

ival-assert: 2.0ms (0.8% of total)

Bogosity

explain62.0ms (5.2%)

Memory

-13.6MiB live, 86.2MiB allocated; 18ms collecting garbage

FPErrors

Click to see full error table

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

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

24.0ms

512×

valid

Compiler

Compiled 45 to 25 computations (44.4% saved)

Precisions

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

ival-div: 3.0ms (28.2% of total)

ival-add: 3.0ms (28.2% of total)

ival-mult: 3.0ms (28.2% 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)

preprocess245.0ms (20.4%)

Memory

23.8MiB live, 157.2MiB allocated; 20ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	18	34
1	58	34
2	179	30
3	724	30
4	1690	30
5	5931	30
0	7	5
0	11	5
1	22	5
2	36	5
3	61	5
4	142	5
5	454	5
6	4055	5
0	8118	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

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

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

Symmetry

(sort x y)

Compiler

Compiled 7 to 7 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
▶	100.0%	(*.f64 (/.f64 #s(literal 1 binary64) #s(literal 2 binary64)) (+.f64 x y))

Compiler

Compiled 7 to 7 computations (0% saved)

series49.0ms (4.1%)

Memory

-29.1MiB live, 21.5MiB allocated; 12ms collecting garbage

Counts

7 → 16

Calls

Call 1

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

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

Calls

6 calls:

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

rewrite68.0ms (5.6%)

Memory

26.4MiB live, 72.3MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	60	183
0	63	175
1	257	175
0	1927	171

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

23 → 56

Calls

Call 1

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

Outputs
(*.f64 (+.f64 y x) #s(literal 1/2 binary64))
(*.f64 #s(literal 1/2 binary64) (+.f64 y x))
(/.f64 (.f64 (.f64 (+.f64 y x) (-.f64 x y)) #s(literal 1/2 binary64)) (-.f64 x y))
(/.f64 (.f64 (fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 y #s(literal 3 binary64))) #s(literal 1/2 binary64)) (fma.f64 (fabs.f64 x) (fabs.f64 x) (.f64 y (-.f64 y x))))
(/.f64 (.f64 #s(literal 1/2 binary64) (.f64 (+.f64 y x) (-.f64 x y))) (-.f64 x y))
(/.f64 (.f64 #s(literal 1/2 binary64) (fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 y #s(literal 3 binary64)))) (fma.f64 (fabs.f64 x) (fabs.f64 x) (.f64 y (-.f64 y x))))
(/.f64 (-.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 (.f64 x x) #s(literal 1/4 binary64))) (-.f64 (.f64 #s(literal 1/2 binary64) y) (.f64 #s(literal 1/2 binary64) x)))
(/.f64 (-.f64 (.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/8 binary64)) (pow.f64 (.f64 #s(literal -1/2 binary64) y) #s(literal 3 binary64))) (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 1/2 binary64)) x (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) y) #s(literal 1/2 binary64)) y (.f64 (.f64 #s(literal 1/2 binary64) x) (*.f64 #s(literal -1/2 binary64) y)))))
(/.f64 (neg.f64 (.f64 (.f64 (+.f64 y x) #s(literal 1/2 binary64)) (.f64 #s(literal 1/2 binary64) (-.f64 x y)))) (neg.f64 (.f64 #s(literal 1/2 binary64) (-.f64 x y))))
(/.f64 (neg.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1/8 binary64) (.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/8 binary64)))) (neg.f64 (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 1/2 binary64)) x (-.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) y) #s(literal 1/2 binary64))))))
(/.f64 (.f64 (.f64 (+.f64 y x) #s(literal 1/2 binary64)) (.f64 #s(literal 1/2 binary64) (-.f64 x y))) (.f64 #s(literal 1/2 binary64) (-.f64 x y)))
(/.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1/8 binary64) (.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/8 binary64))) (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) y) #s(literal 1/2 binary64)) y (-.f64 (.f64 (.f64 x x) #s(literal 1/4 binary64)) (.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) y) #s(literal 1/2 binary64)))))
(/.f64 (fma.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1/8 binary64) (.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/8 binary64))) (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 1/2 binary64)) x (-.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) y) #s(literal 1/2 binary64)))))
(fma.f64 #s(literal 1/2 binary64) y (*.f64 #s(literal 1/2 binary64) x))
(fma.f64 #s(literal 1/2 binary64) x (*.f64 #s(literal 1/2 binary64) y))
(fma.f64 y #s(literal 1/2 binary64) (*.f64 #s(literal 1/2 binary64) x))
(fma.f64 x #s(literal 1/2 binary64) (*.f64 #s(literal 1/2 binary64) y))
(-.f64 (/.f64 (.f64 (.f64 x x) #s(literal 1/4 binary64)) (.f64 #s(literal 1/2 binary64) (-.f64 x y))) (/.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 #s(literal 1/2 binary64) (-.f64 x y))))
(-.f64 (.f64 #s(literal 1/2 binary64) x) (.f64 (*.f64 #s(literal -1 binary64) y) #s(literal 1/2 binary64)))
(-.f64 (.f64 #s(literal 1/2 binary64) x) (.f64 #s(literal -1/2 binary64) y))
(-.f64 (.f64 #s(literal 1/2 binary64) y) (.f64 (*.f64 #s(literal -1 binary64) x) #s(literal 1/2 binary64)))
(-.f64 (.f64 #s(literal 1/2 binary64) y) (.f64 #s(literal -1/2 binary64) x))
(+.f64 (/.f64 (.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1/8 binary64)) (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 1/2 binary64)) x (-.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) y) #s(literal 1/2 binary64))))) (/.f64 (.f64 (pow.f64 y #s(literal 3 binary64)) #s(literal 1/8 binary64)) (fma.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) #s(literal 1/2 binary64)) x (-.f64 (.f64 (.f64 y y) #s(literal 1/4 binary64)) (.f64 (.f64 (.f64 #s(literal 1/2 binary64) x) y) #s(literal 1/2 binary64))))))
(+.f64 (.f64 #s(literal 1/2 binary64) x) (.f64 #s(literal 1/2 binary64) y))
(+.f64 (.f64 #s(literal 1/2 binary64) y) (.f64 #s(literal 1/2 binary64) x))
#s(literal 1/2 binary64)
#s(literal 1 binary64)
#s(literal 2 binary64)
(/.f64 (-.f64 (.f64 y y) (.f64 x x)) (-.f64 y x))
(/.f64 (neg.f64 (*.f64 (+.f64 y x) (-.f64 x y))) (neg.f64 (-.f64 x y)))
(/.f64 (neg.f64 (fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 y #s(literal 3 binary64)))) (neg.f64 (fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 y (-.f64 y x)))))
(/.f64 (*.f64 (+.f64 y x) (-.f64 x y)) (-.f64 x y))
(/.f64 (fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 (fabs.f64 y) (fabs.f64 y) (-.f64 (.f64 x x) (.f64 y x))))
(/.f64 (fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 y #s(literal 3 binary64))) (fma.f64 (fabs.f64 x) (fabs.f64 x) (*.f64 y (-.f64 y x))))
(-.f64 (/.f64 (.f64 x x) (-.f64 x y)) (/.f64 (.f64 y y) (-.f64 x y)))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 (fabs.f64 x) (fabs.f64 x) (.f64 y (-.f64 y x)))) (/.f64 (pow.f64 y #s(literal 3 binary64)) (fma.f64 (fabs.f64 x) (fabs.f64 x) (.f64 y (-.f64 y x)))))
(+.f64 y x)
(+.f64 x y)
x
y
#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) y))
#s(approx (* (/ 1 2) (+ x y)) (*.f64 (+.f64 y x) #s(literal 1/2 binary64)))
#s(approx (+ x y) y)
#s(approx (+ x y) (+.f64 y x))
#s(approx x x)
#s(approx (* (/ 1 2) (+ x y)) (*.f64 #s(literal 1/2 binary64) x))
#s(approx (* (/ 1 2) (+ x y)) (*.f64 (fma.f64 (/.f64 y x) #s(literal 1/2 binary64) #s(literal 1/2 binary64)) x))
#s(approx (+ x y) x)
#s(approx (+ x y) (*.f64 (fma.f64 (/.f64 y x) #s(literal 1 binary64) #s(literal 1 binary64)) x))
#s(approx (* (/ 1 2) (+ x y)) (.f64 (.f64 (-.f64 (*.f64 #s(literal -1/2 binary64) (/.f64 y x)) #s(literal 1/2 binary64)) x) #s(literal -1 binary64)))
#s(approx (+ x y) (.f64 (.f64 (fma.f64 (*.f64 #s(literal -1 binary64) (/.f64 y x)) #s(literal 1 binary64) #s(literal -1 binary64)) x) #s(literal -1 binary64)))
#s(approx y y)
#s(approx (* (/ 1 2) (+ x y)) (*.f64 (fma.f64 (/.f64 x y) #s(literal 1/2 binary64) #s(literal 1/2 binary64)) y))
#s(approx (+ x y) (*.f64 (fma.f64 (/.f64 x y) #s(literal 1 binary64) #s(literal 1 binary64)) y))
#s(approx (* (/ 1 2) (+ x y)) (.f64 (.f64 (-.f64 (*.f64 (/.f64 x y) #s(literal -1/2 binary64)) #s(literal 1/2 binary64)) y) #s(literal -1 binary64)))
#s(approx (+ x y) (.f64 (.f64 (fma.f64 (*.f64 (/.f64 x y) #s(literal -1 binary64)) #s(literal 1 binary64) #s(literal -1 binary64)) y) #s(literal -1 binary64)))

eval9.0ms (0.8%)

Memory: -32.4MiB live, 12.4MiB allocated; 5ms collecting garbage
Compiler: Compiled 860 to 183 computations (78.7% saved)

prune11.0ms (0.9%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Pruned	Kept	Total
New	56	0	56
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	56	1	57

Accuracy

100.0%

Counts

57 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 14 computations (0% saved)

simplify27.0ms (2.2%)

Memory

-23.8MiB live, 22.0MiB allocated; 4ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	7
1	10	7
2	14	7
3	34	7
4	182	7
5	2110	7

Stop Event

1×	node limit

Calls

Call 1

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

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

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 7 computations (0% saved)

preprocess11.0ms (0.9%)

Memory: 25.3MiB live, 25.3MiB allocated; 0ms collecting garbage
Remove: (sort x y)
Compiler: Compiled 56 to 56 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample717.0ms (59.8%)

explain62.0ms (5.2%)

preprocess245.0ms (20.4%)

eval0.0ms (0%)

prune0.0ms (0%)

series49.0ms (4.1%)

rewrite68.0ms (5.6%)

eval9.0ms (0.8%)

prune11.0ms (0.9%)

simplify27.0ms (2.2%)

derivations0.0ms (0%)

preprocess11.0ms (0.9%)

end0.0ms (0%)

Profiling