Average Error: 0.1 → 0.1
Time: 477.0ms
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r249348 = x;
        double r249349 = y;
        double r249350 = 4.0;
        double r249351 = r249349 * r249350;
        double r249352 = z;
        double r249353 = r249351 * r249352;
        double r249354 = r249348 - r249353;
        return r249354;
}

double f(double x, double y, double z) {
        double r249355 = x;
        double r249356 = y;
        double r249357 = 4.0;
        double r249358 = r249356 * r249357;
        double r249359 = z;
        double r249360 = r249358 * r249359;
        double r249361 = r249355 - r249360;
        return r249361;
}

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

Derivation

  1. Initial program 0.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020036 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))