Average Error: 0.1 → 0.1
Time: 2.0s
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 r234704 = x;
        double r234705 = y;
        double r234706 = 4.0;
        double r234707 = r234705 * r234706;
        double r234708 = z;
        double r234709 = r234707 * r234708;
        double r234710 = r234704 - r234709;
        return r234710;
}
↓
double f(double x, double y, double z) {
        double r234711 = x;
        double r234712 = y;
        double r234713 = 4.0;
        double r234714 = r234712 * r234713;
        double r234715 = z;
        double r234716 = r234714 * r234715;
        double r234717 = r234711 - r234716;
        return r234717;
}

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