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

(FPCore (x y z) :precision binary64 (- (* (* x 3.0) y) z))
↓
(FPCore (x y z) :precision binary64 (- (* (* 3.0 y) x) z))
double code(double x, double y, double z) {
	return ((x * 3.0) * y) - z;
}
↓
double code(double x, double y, double z) {
	return ((3.0 * y) * x) - 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.1
Target0.1
Herbie0.1
\[x \cdot \left(3 \cdot y\right) - z \]

Derivation

  1. Initial program 0.1

    \[\left(x \cdot 3\right) \cdot y - z \]
  2. Using strategy rm

  3. Applied pow1_binary640.1

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

  4. Applied pow1_binary640.1

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

  5. Applied pow1_binary640.1

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

  6. Applied pow-prod-down_binary640.1

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

  7. Applied pow-prod-down_binary640.1

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

  8. Simplified0.1

    \[\leadsto {\color{blue}{\left(3 \cdot \left(y \cdot x\right)\right)}}^{1} - z \]
  9. Using strategy rm

  10. Applied associate-*r*_binary640.1

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

  11. Final simplification0.1

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

Reproduce

herbie shell --seed 2021204 
(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))