Average Error: 0.1 → 0.1
Time: 3.3s
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 r189499 = x;
        double r189500 = y;
        double r189501 = 4.0;
        double r189502 = r189500 * r189501;
        double r189503 = z;
        double r189504 = r189502 * r189503;
        double r189505 = r189499 - r189504;
        return r189505;
}

double f(double x, double y, double z) {
        double r189506 = x;
        double r189507 = y;
        double r189508 = 4.0;
        double r189509 = r189507 * r189508;
        double r189510 = z;
        double r189511 = r189509 * r189510;
        double r189512 = r189506 - r189511;
        return r189512;
}

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 2020001 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))