Average Error: 0.1 → 0.1
Time: 2.3s
Precision: 64
\[\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
double f(double x, double y, double z) {
        double r883080 = x;
        double r883081 = 3.0;
        double r883082 = r883080 * r883081;
        double r883083 = y;
        double r883084 = r883082 * r883083;
        double r883085 = z;
        double r883086 = r883084 - r883085;
        return r883086;
}
↓
double f(double x, double y, double z) {
        double r883087 = x;
        double r883088 = 3.0;
        double r883089 = y;
        double r883090 = r883088 * r883089;
        double r883091 = r883087 * r883090;
        double r883092 = z;
        double r883093 = r883091 - r883092;
        return r883093;
}

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 associate-*l*0.1

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

  4. Final simplification0.1

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

Reproduce

herbie shell --seed 2020057 +o rules:numerics
(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))