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.5MiB live, 0.4MiB 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)

sample812.0ms (17.2%)

Memory

35.2MiB live, 1 122.4MiB allocated; 291ms collecting garbage

Samples

502.0ms

8 256×

valid

Precisions

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

ival-mult: 279.0ms (94.1% of total)

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

exact: 5.0ms (1.7% of total)

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

adjust: 2.0ms (0.7% of total)

Bogosity

explain86.0ms (1.8%)

Memory

-40.8MiB live, 102.6MiB allocated; 25ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
-	-	`#s(literal 27 binary64)`
-	-	`y`
-	-	`(*.f64 x #s(literal 27 binary64))`
-	-	`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

26.0ms

512×

valid

Compiler

Compiled 31 to 19 computations (38.7% saved)

Precisions

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

ival-mult: 13.0ms (89.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)

preprocess19.0ms (0.4%)

Memory

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

Algorithm

1×	egg-herbie

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

prune0.0ms (0%)

Memory

0.9MiB live, 0.9MiB 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.1%)

Memory

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

Algorithm

1×	egg-herbie

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

localize30.0ms (0.6%)

Memory

-12.2MiB live, 32.7MiB allocated; 9ms collecting garbage

Localize:

Found 2 expressions of interest:

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

Samples

11.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-mult: 3.0ms (75.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)

series4.0ms (0.1%)

Memory

9.0MiB live, 9.0MiB 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
(* 27 (* x y))
(* 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.1%)

Memory

7.5MiB live, 7.6MiB allocated; 0ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	8
1	10	8
2	16	8
3	17	8
0	17	8

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
(* 27 (* x y))
(* 27 x)

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

rewrite20.0ms (0.4%)

Memory

-10.4MiB live, 33.2MiB allocated; 9ms 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%)

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

prune2.0ms (0%)

Memory

4.5MiB live, 4.5MiB 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.7%	(.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)

simplify4.0ms (0.1%)

Memory

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

Algorithm

1×	egg-herbie

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)

localize26.0ms (0.5%)

Memory

-3.1MiB live, 49.1MiB allocated; 10ms collecting garbage

Localize:

Found 4 expressions of interest:

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

Samples

20.0ms

256×

valid

Compiler

Compiled 24 to 9 computations (62.5% saved)

Precisions

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

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

series7.0ms (0.2%)

Memory

-34.6MiB live, 10.6MiB allocated; 7ms collecting garbage

Counts

4 → 3

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
(* 27 (* x y))
(* x y)
(* 27 y)

Calls

6 calls:

Time	Variable		Point	Expression
4.0ms	x	@	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	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))
1.0ms	y	@	0	((* (* y 27) x) (* y 27) (* (* y x) 27) (* y x))

simplify4.0ms (0.1%)

Memory

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

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	11
1	11	11
2	16	11
0	16	11

Stop Event

1×	iter limit
1×	saturated

Counts

3 → 3

Calls

Call 1

Inputs
(* 27 (* x y))
(* x y)
(* 27 y)

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

rewrite7.0ms (0.2%)

Memory

16.5MiB live, 16.5MiB allocated; 0ms 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)

eval1.0ms (0%)

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

prune3.0ms (0.1%)

Memory

8.1MiB live, 8.1MiB 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.7%	(.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)

regimes10.0ms (0.2%)

Memory

-26.9MiB live, 18.2MiB allocated; 5ms collecting garbage

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 y #s(literal 27 binary64)) x)

Calls

4 calls:

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

regimes4.0ms (0.1%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

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)

simplify13.0ms (0.3%)

Memory

-23.0MiB live, 22.4MiB allocated; 6ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	10

Stop Event

1×

saturated

Calls

Call 1

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

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

derivations7.0ms (0.1%)

Memory

19.2MiB live, 19.2MiB allocated; 0ms 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×	done
1×	iter limit
1×	saturated
1×	iter limit

Compiler

Compiled 10 to 7 computations (30% saved)

preprocess3.7s (77.5%)

Memory: -365.6MiB live, 424.7MiB allocated; 4.6s collecting garbage
Remove: (negabs x)
Compiler: Compiled 130 to 124 computations (4.6% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample812.0ms (17.2%)

explain86.0ms (1.8%)

preprocess19.0ms (0.4%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify4.0ms (0.1%)

localize30.0ms (0.6%)

series4.0ms (0.1%)

simplify3.0ms (0.1%)

rewrite20.0ms (0.4%)

eval1.0ms (0%)

prune2.0ms (0%)

simplify4.0ms (0.1%)

localize26.0ms (0.5%)

series7.0ms (0.2%)

simplify4.0ms (0.1%)

rewrite7.0ms (0.2%)

eval1.0ms (0%)

prune3.0ms (0.1%)

regimes10.0ms (0.2%)

regimes4.0ms (0.1%)

simplify13.0ms (0.3%)

derivations7.0ms (0.1%)

preprocess3.7s (77.5%)

end0.0ms (0%)

Profiling