Average Error: 0.1 → 0.1
Time: 1.2s
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 r243072 = x;
        double r243073 = y;
        double r243074 = 4.0;
        double r243075 = r243073 * r243074;
        double r243076 = z;
        double r243077 = r243075 * r243076;
        double r243078 = r243072 - r243077;
        return r243078;
}

double f(double x, double y, double z) {
        double r243079 = x;
        double r243080 = y;
        double r243081 = 4.0;
        double r243082 = r243080 * r243081;
        double r243083 = z;
        double r243084 = r243082 * r243083;
        double r243085 = r243079 - r243084;
        return r243085;
}

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