Average Error: 0.1 → 0.1
Time: 1.9s
Precision: 64
\[\left(x \cdot 3\right) \cdot y - z\]
↓
\[\left(x \cdot 3\right) \cdot y - z\]
\left(x \cdot 3\right) \cdot y - z
↓
\left(x \cdot 3\right) \cdot y - z
double f(double x, double y, double z) {
        double r661294 = x;
        double r661295 = 3.0;
        double r661296 = r661294 * r661295;
        double r661297 = y;
        double r661298 = r661296 * r661297;
        double r661299 = z;
        double r661300 = r661298 - r661299;
        return r661300;
}
↓
double f(double x, double y, double z) {
        double r661301 = x;
        double r661302 = 3.0;
        double r661303 = r661301 * r661302;
        double r661304 = y;
        double r661305 = r661303 * r661304;
        double r661306 = z;
        double r661307 = r661305 - r661306;
        return r661307;
}

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.2
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. Final simplification0.1

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

Reproduce

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

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

  (- (* (* x 3) y) z))