Average Error: 0.1 → 0.1
Time: 1.6s
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 r222988 = x;
        double r222989 = y;
        double r222990 = 4.0;
        double r222991 = r222989 * r222990;
        double r222992 = z;
        double r222993 = r222991 * r222992;
        double r222994 = r222988 - r222993;
        return r222994;
}

double f(double x, double y, double z) {
        double r222995 = x;
        double r222996 = y;
        double r222997 = 4.0;
        double r222998 = r222996 * r222997;
        double r222999 = z;
        double r223000 = r222998 * r222999;
        double r223001 = r222995 - r223000;
        return r223001;
}

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