Average Error: 0.1 → 0.1
Time: 629.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 r174841 = x;
        double r174842 = y;
        double r174843 = 4.0;
        double r174844 = r174842 * r174843;
        double r174845 = z;
        double r174846 = r174844 * r174845;
        double r174847 = r174841 - r174846;
        return r174847;
}

double f(double x, double y, double z) {
        double r174848 = x;
        double r174849 = y;
        double r174850 = 4.0;
        double r174851 = r174849 * r174850;
        double r174852 = z;
        double r174853 = r174851 * r174852;
        double r174854 = r174848 - r174853;
        return r174854;
}

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