Average Error: 0.1 → 0.1
Time: 11.0s
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 r737140 = x;
        double r737141 = 3.0;
        double r737142 = r737140 * r737141;
        double r737143 = y;
        double r737144 = r737142 * r737143;
        double r737145 = z;
        double r737146 = r737144 - r737145;
        return r737146;
}
↓
double f(double x, double y, double z) {
        double r737147 = x;
        double r737148 = 3.0;
        double r737149 = r737147 * r737148;
        double r737150 = y;
        double r737151 = r737149 * r737150;
        double r737152 = z;
        double r737153 = r737151 - r737152;
        return r737153;
}

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