Average Error: 0.1 → 0.1
Time: 35.7s
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 r555065 = x;
        double r555066 = 3.0;
        double r555067 = r555065 * r555066;
        double r555068 = y;
        double r555069 = r555067 * r555068;
        double r555070 = z;
        double r555071 = r555069 - r555070;
        return r555071;
}
↓
double f(double x, double y, double z) {
        double r555072 = x;
        double r555073 = 3.0;
        double r555074 = r555072 * r555073;
        double r555075 = y;
        double r555076 = r555074 * r555075;
        double r555077 = z;
        double r555078 = r555076 - r555077;
        return r555078;
}

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

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

Reproduce

herbie shell --seed 2019303 +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))