Average Error: 0.0 → 0.0
Time: 1.7m
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 r887040 = x;
        double r887041 = y;
        double r887042 = 4.0;
        double r887043 = r887041 * r887042;
        double r887044 = z;
        double r887045 = r887043 * r887044;
        double r887046 = r887040 - r887045;
        return r887046;
}
↓
double f(double x, double y, double z) {
        double r887047 = x;
        double r887048 = y;
        double r887049 = 4.0;
        double r887050 = r887048 * r887049;
        double r887051 = z;
        double r887052 = r887050 * r887051;
        double r887053 = r887047 - r887052;
        return r887053;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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