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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

0.6MiB live, 0.6MiB 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 7 to 7 computations (0% saved)

sample1.2s (79.4%)

Memory

-18.8MiB live, 829.7MiB allocated; 359ms collecting garbage

Samples

739.0ms

8 256×

valid

Precisions

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

ival-mult: 277.0ms (95.2% of total)

ival-true: 5.0ms (1.7% of total)

exact: 4.0ms (1.4% of total)

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

adjust: 2.0ms (0.7% of total)

Bogosity

explain70.0ms (4.7%)

Memory

20.7MiB live, 73.1MiB allocated; 19ms collecting garbage

FPErrors

Click to see full error table

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

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`*.f64`	`(.f64 (.f64 x #s(literal 27 binary64)) y)`	*no**	1	0

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

46.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 6.0ms (82.7% 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)

preprocess38.0ms (2.6%)

Memory

-17.5MiB live, 27.2MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	33
1	34	25
2	74	25
3	121	25
0	5	5
0	7	5
1	11	5
2	18	5
3	20	5
0	20	5

Stop Event

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

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 y (.f64 #s(literal 27 binary64) x))

Symmetry

(negabs y)

(negabs x)

(sort x y)

Compiler

Compiled 5 to 5 computations (0% saved)

eval0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 2 computations (-∞% saved)

prune0.0ms (0%)

Memory

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

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 5 to 5 computations (0% saved)

simplify4.0ms (0.3%)

Memory

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

Localize:

Found 2 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	11
0	7	11
1	11	11
2	18	11
3	20	11
0	20	11

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize13.0ms (0.9%)

Memory

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

Localize:

Found 2 expressions of interest:

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

Samples

9.0ms

256×

valid

Compiler

Compiled 13 to 7 computations (46.2% saved)

Precisions

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

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

series4.0ms (0.3%)

Memory

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

Counts

2 → 2

Calls

Call 1

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

Outputs
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y))))
#s(approx (* x 27) #s(hole binary64 (* 27 x)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	x	@	0	((* (* x 27) y) (* x 27))
1.0ms	x	@	-inf	((* (* x 27) y) (* x 27))
1.0ms	x	@	inf	((* (* x 27) y) (* x 27))
1.0ms	y	@	inf	((* (* x 27) y) (* x 27))
0.0ms	y	@	0	((* (* x 27) y) (* x 27))

simplify3.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	18
1	18	18
2	22	18
0	22	18

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y))))
#s(approx (* x 27) #s(hole binary64 (* 27 x)))

Outputs
#s(approx (* (* x 27) y) #s(hole binary64 (* 27 (* x y))))
#s(approx (* (* x 27) y) (.f64 (.f64 y x) #s(literal 27 binary64)))
#s(approx (* x 27) #s(hole binary64 (* 27 x)))
#s(approx (* x 27) (*.f64 #s(literal 27 binary64) x))

rewrite56.0ms (3.8%)

Memory

-26.8MiB live, 16.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	7	8
1	11	8
2	18	8
3	20	8
0	20	8

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

2 → 8

Calls

Call 1

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

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

eval1.0ms (0.1%)

Memory: 1.4MiB live, 1.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 60 to 20 computations (66.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

3 alts after pruning (2 fresh and 1 done)

	Pruned	Kept	Total
New	8	2	10
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	8	3	11

Accuracy

100.0%

Counts

11 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
▶	99.3%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 15 to 15 computations (0% saved)

simplify5.0ms (0.3%)

Memory

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

Localize:

Found 4 expressions of interest:

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	22
0	11	22
1	19	22
2	21	22
0	21	22

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Calls

Call 1

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

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

localize18.0ms (1.2%)

Memory

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

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(*.f64 y x)
accuracy	0.20703125	(.f64 (.f64 y x) #s(literal 27 binary64))
accuracy	0.0	(*.f64 y #s(literal 27 binary64))
accuracy	0.4676105361446715	(.f64 (.f64 y #s(literal 27 binary64)) x)

Samples

13.0ms

256×

valid

Compiler

Compiled 24 to 9 computations (62.5% saved)

Precisions

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

ival-mult: 6.0ms (98% 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)

series4.0ms (0.3%)

Memory

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

Counts

4 → 4

Calls

Call 1

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

Outputs
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y))))
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y 27) #s(hole binary64 (* 27 y)))

Calls

6 calls:

Time	Variable		Point	Expression
1.0ms	y	@	inf	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))
1.0ms	y	@	-inf	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))
1.0ms	x	@	-inf	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))
0.0ms	y	@	0	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))
0.0ms	x	@	0	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))

simplify3.0ms (0.2%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	36
1	24	36
2	25	36
0	25	36

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 4

Calls

Call 1

Inputs
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y))))
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y))))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y 27) #s(hole binary64 (* 27 y)))

Outputs
#s(approx (* (* y 27) x) #s(hole binary64 (* 27 (* x y))))
#s(approx (* (* y 27) x) (.f64 (.f64 #s(literal 27 binary64) y) x))
#s(approx (* (* y x) 27) #s(hole binary64 (* 27 (* x y))))
#s(approx (* (* y 27) x) (.f64 (.f64 #s(literal 27 binary64) y) x))
#s(approx (* y x) #s(hole binary64 (* x y)))
#s(approx (* y x) (*.f64 x y))
#s(approx (* y 27) #s(hole binary64 (* 27 y)))
#s(approx (* y 27) (*.f64 #s(literal 27 binary64) y))

rewrite19.0ms (1.3%)

Memory

-49.3MiB live, 5.0MiB allocated; 15ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	16
0	11	16
1	19	16
2	21	16
0	21	16

Stop Event

1×	iter limit
1×	saturated
1×	iter limit

Counts

4 → 16

Calls

Call 1

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

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

eval2.0ms (0.2%)

Memory: 2.7MiB live, 2.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 79 to 25 computations (68.4% saved)

prune3.0ms (0.2%)

Memory

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

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	13	0	13
Fresh	0	0	0
Picked	0	2	2
Done	0	1	1
Total	13	3	16

Accuracy

100.0%

Counts

16 → 3

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	99.7%	(.f64 (.f64 y x) #s(literal 27 binary64))
✓	99.3%	(.f64 (.f64 y #s(literal 27 binary64)) x)
✓	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Compiler

Compiled 30 to 24 computations (20% saved)

regimes6.0ms (0.4%)

Memory

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

Accuracy

Total -0.5b remaining (-240.6%)

Threshold costs -0.5b (-240.6%)

Counts

3 → 1

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)
(.f64 (.f64 y #s(literal 27 binary64)) x)
(.f64 (.f64 y x) #s(literal 27 binary64))

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Calls

4 calls:

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

Results

Accuracy	Segments	Branch
99.7%	1	`(*.f64 x #s(literal 27 binary64))`
99.7%	1	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
99.7%	1	`x`
99.7%	1	`y`

Compiler

Compiled 10 to 13 computations (-30% saved)

simplify9.0ms (0.6%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5

Stop Event

1×

saturated

Calls

Call 1

Inputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

Outputs
(.f64 (.f64 x #s(literal 27 binary64)) y)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 5 to 5 computations (0% saved)

preprocess45.0ms (3%)

Memory

7.1MiB live, 52.8MiB allocated; 7ms collecting garbage

Remove

(negabs x)

(negabs y)

Compiler

Compiled 100 to 100 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.2s (79.4%)

explain70.0ms (4.7%)

preprocess38.0ms (2.6%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.3%)

localize13.0ms (0.9%)

series4.0ms (0.3%)

simplify3.0ms (0.2%)

rewrite56.0ms (3.8%)

eval1.0ms (0.1%)

prune2.0ms (0.1%)

simplify5.0ms (0.3%)

localize18.0ms (1.2%)

series4.0ms (0.3%)

simplify3.0ms (0.2%)

rewrite19.0ms (1.3%)

eval2.0ms (0.2%)

prune3.0ms (0.2%)

regimes6.0ms (0.4%)

simplify9.0ms (0.6%)

derivations0.0ms (0%)

preprocess45.0ms (3%)

end0.0ms (0%)

Profiling