Average Error: 0.1 → 0.1
Time: 1.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 r815204 = x;
        double r815205 = 3.0;
        double r815206 = r815204 * r815205;
        double r815207 = y;
        double r815208 = r815206 * r815207;
        double r815209 = z;
        double r815210 = r815208 - r815209;
        return r815210;
}
↓
double f(double x, double y, double z) {
        double r815211 = x;
        double r815212 = 3.0;
        double r815213 = r815211 * r815212;
        double r815214 = y;
        double r815215 = r815213 * r815214;
        double r815216 = z;
        double r815217 = r815215 - r815216;
        return r815217;
}

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 2020047 +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))