Average Error: 0.1 → 0.1
Time: 17.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 r31481008 = x;
        double r31481009 = 3.0;
        double r31481010 = r31481008 * r31481009;
        double r31481011 = y;
        double r31481012 = r31481010 * r31481011;
        double r31481013 = z;
        double r31481014 = r31481012 - r31481013;
        return r31481014;
}
↓
double f(double x, double y, double z) {
        double r31481015 = x;
        double r31481016 = 3.0;
        double r31481017 = r31481015 * r31481016;
        double r31481018 = y;
        double r31481019 = r31481017 * r31481018;
        double r31481020 = z;
        double r31481021 = r31481019 - r31481020;
        return r31481021;
}

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 +o rules:numerics
(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))