Average Error: 0.1 → 0.1
Time: 13.3s
Precision: 64
\[\left(x \cdot 3.0\right) \cdot y - z\]
↓
\[\left(x \cdot 3.0\right) \cdot y - z\]
\left(x \cdot 3.0\right) \cdot y - z
↓
\left(x \cdot 3.0\right) \cdot y - z
double f(double x, double y, double z) {
        double r37397735 = x;
        double r37397736 = 3.0;
        double r37397737 = r37397735 * r37397736;
        double r37397738 = y;
        double r37397739 = r37397737 * r37397738;
        double r37397740 = z;
        double r37397741 = r37397739 - r37397740;
        return r37397741;
}
↓
double f(double x, double y, double z) {
        double r37397742 = x;
        double r37397743 = 3.0;
        double r37397744 = r37397742 * r37397743;
        double r37397745 = y;
        double r37397746 = r37397744 * r37397745;
        double r37397747 = z;
        double r37397748 = r37397746 - r37397747;
        return r37397748;
}

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.0 \cdot y\right) - z\]

Derivation

  1. Initial program 0.1

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

  2. Final simplification0.1

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

Reproduce

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

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

  (- (* (* x 3.0) y) z))