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

analyze0.0ms (0%)

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 8 to 6 computations (25% saved)

Precisions

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

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

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

sample518.0ms (58.3%)

Results

359.0ms

8256×

valid

Precisions

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

ival-mult: 146.0ms (91.3% of total)

const: 11.0ms (6.9% of total)

backward-pass: 3.0ms (1.9% of total)

Bogosity

preprocess28.0ms (3.2%)

Algorithm

2×	egg-herbie

Rules

226×	`fnmadd-define`
208×	`fma-define`
192×	`fnmsub-define`
192×	`fmsub-define`
80×	`distribute-lft-neg-in`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	14	32
1	45	30
2	113	30
3	284	30
4	433	30
5	708	30
6	852	30
0	5	5
1	9	5
2	16	5
3	18	5
0	18	5

Stop Event

1×	iter limit
1×	saturated
1×	saturated

Calls

Call 1

Inputs
(* (* x 27) y)

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

Call 2

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

Outputs
(* (* x 27) y)
(* x (* 27 y))
(* (* (neg x) 27) y)
(* x (* y -27))
(* (* x 27) (neg y))
(* x (* y -27))
(neg (* (* (neg x) 27) y))
(* x (* 27 y))
(neg (* (* x 27) (neg y)))
(* x (* 27 y))
(* (* y 27) x)
(* x (* 27 y))

Symmetry

(negabs x)

(negabs y)

(sort x y)

explain45.0ms (5.1%)

FPErrors

Click to see full error table

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

Results

28.0ms

512×

valid

Compiler

Compiled 35 to 17 computations (51.4% saved)

Precisions

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

ival-mult: 10.0ms (93.8% of total)

const: 1.0ms (9.4% of total)

backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler: Compiled 7 to 5 computations (28.6% saved)

prune1.0ms (0.1%)

Alt Table

Click to see full alt table

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

Compiler

Compiled 14 to 10 computations (28.6% saved)

simplify4.0ms (0.5%)

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

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

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	22
1	11	22
2	17	22
3	17	22
0	17	22

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

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

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

localize33.0ms (3.8%)

Localize:

Found 4 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)
✓	accuracy	100.0%	(*.f64 #s(literal 27 binary64) y)
✓	accuracy	99.8%	(.f64 x (.f64 #s(literal 27 binary64) y))

Results

25.0ms

256×

valid

Compiler

Compiled 25 to 8 computations (68% saved)

Precisions

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

ival-mult: 10.0ms (99.7% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series5.0ms (0.6%)

Counts

4 → 72

Calls

Call 1

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

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)>
#<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

18 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))
1.0ms	y	@	inf	(* x (* 27 y))
0.0ms	y	@	-inf	(* 27 y)

rewrite25.0ms (2.8%)

Algorithm

1×	batch-egg-rewrite

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	16
1	11	16
2	17	16
3	17	16
0	17	16

Stop Event

1×	iter limit
1×	saturated

Counts

4 → 16

Calls

Call 1

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

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

simplify8.0ms (0.9%)

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
8×	`*-commutative`
4×	`associate-r`
4×	`associate-l`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	7	312
1	12	312
2	15	312
0	15	312

Stop Event

1×	iter limit
1×	saturated

Counts

72 → 72

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)
(* 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 #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)
(* 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 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)

eval13.0ms (1.5%)

Compiler: Compiled 442 to 16 computations (96.4% saved)

prune2.0ms (0.2%)

Pruning

3 alts after pruning (1 fresh and 2 done)

	Pruned	Kept	Total
New	87	1	88
Fresh	0	0	0
Picked	0	2	2
Done	0	0	0
Total	87	3	90

Accuracy

100.0%

Counts

90 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 21 to 15 computations (28.6% saved)

simplify4.0ms (0.5%)

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

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

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Calls

Call 1

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

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

localize21.0ms (2.4%)

Localize:

Found 2 expressions of interest:

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

Results

14.0ms

256×

valid

Compiler

Compiled 14 to 6 computations (57.1% saved)

Precisions

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

ival-mult: 4.0ms (88% of total)

const: 0.0ms (0% of total)

backward-pass: 0.0ms (0% of total)

series2.0ms (0.2%)

Counts

2 → 48

Calls

Call 1

Inputs
#<alt (* (* x y) 27)>
#<alt (* 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	(* (* x y) 27)
0.0ms	x	@	inf	(* (* x y) 27)
0.0ms	x	@	-inf	(* (* x y) 27)

rewrite14.0ms (1.5%)

Algorithm

1×	batch-egg-rewrite

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	iter limit
1×	saturated

Counts

2 → 8

Calls

Call 1

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

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

simplify6.0ms (0.7%)

Algorithm

1×	egg-herbie

Rules

24×	`-lowering-.f32`
24×	`-lowering-.f64`
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)

eval4.0ms (0.5%)

Compiler: Compiled 282 to 16 computations (94.3% saved)

prune2.0ms (0.3%)

Pruning

3 alts after pruning (0 fresh and 3 done)

	Pruned	Kept	Total
New	56	0	56
Fresh	0	0	0
Picked	0	1	1
Done	0	2	2
Total	56	3	59

Accuracy

100.0%

Counts

59 → 3

Alt Table

Click to see full alt table

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

Compiler

Compiled 38 to 24 computations (36.8% saved)

regimes11.0ms (1.2%)

Accuracy

Total -0.2b remaining (-171.7%)

Threshold costs -0.2b (-171.7%)

Counts

3 → 1

Calls

Call 1

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

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

Calls

4 calls:

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

Results

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

Compiler

Compiled 18 to 13 computations (27.8% saved)

simplify7.0ms (0.8%)

Algorithm

1×	egg-herbie

Rules

4×	`*-commutative_binary64`

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	5
1	7	5

Stop Event

1×

saturated

Calls

Call 1

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

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

soundness4.0ms (0.4%)

Rules

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

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

1×	done
1×	iter limit
1×	saturated

Compiler

Compiled 14 to 10 computations (28.6% saved)

preprocess130.0ms (14.6%)

Remove: (negabs x)
Compiler: Compiled 168 to 120 computations (28.6% saved)

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

analyze0.0ms (0%)

sample518.0ms (58.3%)

preprocess28.0ms (3.2%)

explain45.0ms (5.1%)

eval0.0ms (0%)

prune1.0ms (0.1%)

simplify4.0ms (0.5%)

localize33.0ms (3.8%)

series5.0ms (0.6%)

rewrite25.0ms (2.8%)

simplify8.0ms (0.9%)

eval13.0ms (1.5%)

prune2.0ms (0.2%)

simplify4.0ms (0.5%)

localize21.0ms (2.4%)

series2.0ms (0.2%)

rewrite14.0ms (1.5%)

simplify6.0ms (0.7%)

eval4.0ms (0.5%)

prune2.0ms (0.3%)

regimes11.0ms (1.2%)

simplify7.0ms (0.8%)

soundness4.0ms (0.4%)

preprocess130.0ms (14.6%)

end0.0ms (0%)

Profiling