Average Error: 0.3 → 0.3
Time: 1.9s
Precision: 64
\[\left(x \cdot 27\right) \cdot y\]
↓
\[27 \cdot \left(x \cdot y\right)\]
\left(x \cdot 27\right) \cdot y
↓
27 \cdot \left(x \cdot y\right)
double code(double x, double y) {
	return ((x * 27.0) * y);
}
↓
double code(double x, double y) {
	return (27.0 * (x * y));
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.3

    \[\left(x \cdot 27\right) \cdot y\]
  2. Using strategy rm

  3. Applied *-un-lft-identity0.3

    \[\leadsto \color{blue}{\left(1 \cdot \left(x \cdot 27\right)\right)} \cdot y\]

  4. Applied associate-*l*0.3

    \[\leadsto \color{blue}{1 \cdot \left(\left(x \cdot 27\right) \cdot y\right)}\]

  5. Simplified0.3

    \[\leadsto 1 \cdot \color{blue}{\left(27 \cdot \left(x \cdot y\right)\right)}\]

  6. Final simplification0.3

    \[\leadsto 27 \cdot \left(x \cdot y\right)\]

Reproduce

herbie shell --seed 2020066 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, F"
  :precision binary64
  (* (* x 27) y))