Average Error: 0.2 → 0.2
Time: 2.0s
Precision: binary64
\[[x, y] = \mathsf{sort}([x, y]) \\]
\[\left(x \cdot 3\right) \cdot y - z \]
↓
\[x \cdot \left(3 \cdot y\right) - z \]
\left(x \cdot 3\right) \cdot y - z
↓
x \cdot \left(3 \cdot y\right) - z

(FPCore (x y z) :precision binary64 (- (* (* x 3.0) y) z))
↓
(FPCore (x y z) :precision binary64 (- (* x (* 3.0 y)) z))
double code(double x, double y, double z) {
	return ((x * 3.0) * y) - z;
}
↓
double code(double x, double y, double z) {
	return (x * (3.0 * y)) - z;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.2
Target0.2
Herbie0.2
\[x \cdot \left(3 \cdot y\right) - z \]

Derivation

  1. Initial program 0.2

    \[\left(x \cdot 3\right) \cdot y - z \]

  2. Applied associate-*l*_binary640.2

    \[\leadsto \color{blue}{x \cdot \left(3 \cdot y\right)} - z \]

  3. Final simplification0.2

    \[\leadsto x \cdot \left(3 \cdot y\right) - z \]

Reproduce

herbie shell --seed 2022081 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, B"
  :precision binary64

  :herbie-target
  (- (* x (* 3.0 y)) z)

  (- (* (* x 3.0) y) z))