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

analyze0.0ms (0%)

Memory

0.8MiB live, 0.8MiB allocated

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)

sample887.0ms (65.8%)

Memory

29.5MiB live, 731.5MiB allocated

Samples

555.0ms

8 256×

valid

Precisions

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

ival-mult: 231.0ms (94.7% of total)

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

exact: 4.0ms (1.6% of total)

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

Bogosity

preprocess47.0ms (3.5%)

Memory

-17.9MiB live, 25.7MiB allocated

Algorithm

1×	egg-herbie

Rules

78×	`distribute-lft-neg-in`
74×	`associate-r`
54×	`distribute-rgt-neg-in`
48×	`distribute-lft-in`
46×	`cancel-sign-sub-inv`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	33
1	44	25
2	111	25
3	288	25
4	369	25
5	389	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 #s(literal 27 binary64) (.f64 x y))

Symmetry

(negabs y)

(negabs x)

(sort x y)

explain49.0ms (3.6%)

Memory

14.8MiB live, 91.1MiB allocated

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

25.0ms

512×

valid

Compiler

Compiled 40 to 24 computations (40% saved)

Precisions

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

ival-mult: 13.0ms (96.2% of total)

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

exact: 0.0ms (0% of total)

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

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

1.2MiB live, 1.2MiB allocated

Alt Table

Click to see full alt table

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

Compiler

Compiled 7 to 5 computations (28.6% saved)

simplify5.0ms (0.4%)

Memory

7.8MiB live, 7.8MiB allocated

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)

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

localize20.0ms (1.5%)

Memory

-9.4MiB live, 27.1MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 x #s(literal 27 binary64))
✓	accuracy	99.7%	(.f64 (.f64 x #s(literal 27 binary64)) y)

Samples

15.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 (86.8% of total)

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

exact: 0.0ms (0% of total)

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

series4.0ms (0.3%)

Memory

9.4MiB live, 9.4MiB allocated

Counts

2 → 36

Calls

Call 1

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

Outputs
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>
#<alt (* 27 x)>

Calls

9 calls:

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

rewrite23.0ms (1.7%)

Memory

-10.9MiB live, 34.7MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

simplify4.0ms (0.3%)

Memory

6.4MiB live, 6.4MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`lower-*.f64`
24×	`lower-*.f32`
8×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

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

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

simplify4.0ms (0.3%)

Memory

6.0MiB live, 6.0MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	36
0	13	36

Stop Event

1×	saturated
1×	saturated

Counts

8 → 0

Calls

Call 1

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

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

eval11.0ms (0.8%)

Memory: -22.9MiB live, 13.9MiB allocated
Compiler: Compiled 362 to 7 computations (98.1% saved)

prune1.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB allocated

Pruning

2 alts after pruning (1 fresh and 1 done)

	Pruned	Kept	Total
New	71	1	72
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	71	2	73

Accuracy

99.9%

Counts

73 → 2

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 10 computations (28.6% saved)

simplify5.0ms (0.4%)

Memory

7.1MiB live, 7.1MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

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

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

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

localize19.0ms (1.4%)

Memory

-11.7MiB live, 25.4MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 #s(literal 27 binary64) y)
✓	accuracy	99.7%	(.f64 x (.f64 #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 (91.6% of total)

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

exact: 0.0ms (0% of total)

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

series1.0ms (0.1%)

Memory

1.9MiB live, 1.9MiB allocated

Counts

2 → 36

Calls

Call 1

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

Outputs
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>
#<alt (* 27 y)>

Calls

9 calls:

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

rewrite9.0ms (0.7%)

Memory

13.4MiB live, 13.4MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

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

simplify4.0ms (0.3%)

Memory

6.2MiB live, 6.2MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`lower-*.f64`
24×	`lower-*.f32`
10×	`*-commutative`
4×	`associate-r`
4×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Counts

36 → 36

Calls

Call 1

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

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

simplify4.0ms (0.3%)

Memory

6.3MiB live, 6.3MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	36
0	13	36

Stop Event

1×	saturated
1×	saturated

Counts

8 → 0

Calls

Call 1

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

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

eval12.0ms (0.9%)

Memory: -22.4MiB live, 14.3MiB allocated
Compiler: Compiled 362 to 7 computations (98.1% saved)

prune1.0ms (0.1%)

Memory

3.2MiB live, 3.2MiB allocated

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	71	1	72
Fresh	0	0	0
Picked	0	1	1
Done	0	1	1
Total	71	3	74

Accuracy

100.0%

Counts

74 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 15 computations (28.6% saved)

simplify5.0ms (0.4%)

Memory

7.0MiB live, 7.0MiB allocated

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

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

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

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

localize21.0ms (1.6%)

Memory

-14.8MiB live, 29.5MiB allocated

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
✓	accuracy	100.0%	(*.f64 x y)
✓	accuracy	99.6%	(.f64 #s(literal 27 binary64) (.f64 x y))

Samples

15.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 (87.5% of total)

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

exact: 0.0ms (0% of total)

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

series2.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB allocated

Counts

2 → 48

Calls

Call 1

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

Outputs
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* 27 (* x y))>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>
#<alt (* x y)>

Calls

12 calls:

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

rewrite9.0ms (0.7%)

Memory

12.4MiB live, 12.4MiB allocated

Algorithm

1×	batch-egg-rewrite

Rules

24×	`lower-*.f32`
20×	`lower-*.f64`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

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

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

simplify4.0ms (0.3%)

Memory

6.1MiB live, 6.1MiB allocated

Algorithm

1×	egg-herbie

Rules

24×	`lower-*.f64`
24×	`lower-*.f32`
10×	`*-commutative`
6×	`associate-r`
6×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	192
1	9	192
2	16	192
3	18	192
0	18	192

Stop Event

1×	iter limit
1×	saturated

Counts

48 → 48

Calls

Call 1

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

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

simplify4.0ms (0.3%)

Memory

5.8MiB live, 5.8MiB allocated

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	36
0	13	36

Stop Event

1×	saturated
1×	saturated

Counts

8 → 0

Calls

Call 1

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

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

eval13.0ms (1%)

Memory: -20.0MiB live, 17.5MiB allocated
Compiler: Compiled 482 to 7 computations (98.5% saved)

prune2.0ms (0.1%)

Memory

3.6MiB live, 3.6MiB allocated

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	96	0	96
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	96	3	99

Accuracy

100.0%

Counts

99 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 38 to 24 computations (36.8% saved)

regimes8.0ms (0.6%)

Memory

15.2MiB live, 15.2MiB allocated

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 18 to 13 computations (27.8% saved)

regimes10.0ms (0.7%)

Memory

-22.6MiB live, 15.9MiB allocated

Counts

2 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 18 to 13 computations (27.8% saved)

regimes5.0ms (0.4%)

Memory

14.6MiB live, 14.6MiB allocated

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

1 → 1

Calls

Call 1

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

Outputs
(.f64 #s(literal 27 binary64) (.f64 x 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.6%	1	`x`
99.6%	1	`y`
99.6%	1	`(.f64 (.f64 x #s(literal 27 binary64)) y)`
99.6%	1	`(*.f64 x #s(literal 27 binary64))`

Compiler

Compiled 18 to 13 computations (27.8% saved)

simplify6.0ms (0.4%)

Memory

11.2MiB live, 11.2MiB allocated

Algorithm

1×	egg-herbie

Rules

12×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	15
1	15	15

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness12.0ms (0.9%)

Memory

-25.9MiB live, 12.2MiB allocated

Rules

24×	`lower-*.f64`
24×	`lower-*.f32`
24×	`lower-*.f64`
24×	`lower-*.f32`
10×	`*-commutative`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	156
1	11	156
2	16	156
0	16	156
0	6	156
1	10	156
2	16	156
3	17	156
0	17	156

Stop Event

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

Compiler

Compiled 38 to 24 computations (36.8% saved)

preprocess138.0ms (10.2%)

Memory: 18.1MiB live, 305.9MiB allocated
Remove: (negabs y)
Compiler: Compiled 188 to 128 computations (31.9% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated

analyze0.0ms (0%)

sample887.0ms (65.8%)

preprocess47.0ms (3.5%)

explain49.0ms (3.6%)

eval0.0ms (0%)

prune1.0ms (0%)

simplify5.0ms (0.4%)

localize20.0ms (1.5%)

series4.0ms (0.3%)

rewrite23.0ms (1.7%)

simplify4.0ms (0.3%)

simplify4.0ms (0.3%)

eval11.0ms (0.8%)

prune1.0ms (0.1%)

simplify5.0ms (0.4%)

localize19.0ms (1.4%)

series1.0ms (0.1%)

rewrite9.0ms (0.7%)

simplify4.0ms (0.3%)

simplify4.0ms (0.3%)

eval12.0ms (0.9%)

prune1.0ms (0.1%)

simplify5.0ms (0.4%)

localize21.0ms (1.6%)

series2.0ms (0.1%)

rewrite9.0ms (0.7%)

simplify4.0ms (0.3%)

simplify4.0ms (0.3%)

eval13.0ms (1%)

prune2.0ms (0.1%)

regimes8.0ms (0.6%)

regimes10.0ms (0.7%)

regimes5.0ms (0.4%)

simplify6.0ms (0.4%)

soundness12.0ms (0.9%)

preprocess138.0ms (10.2%)

end0.0ms (0%)

Profiling