Average Error: 0.0 → 0.0
Time: 1.3s
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 r18084 = x;
        double r18085 = y;
        double r18086 = 4.0;
        double r18087 = r18085 * r18086;
        double r18088 = z;
        double r18089 = r18087 * r18088;
        double r18090 = r18084 - r18089;
        return r18090;
}
↓
double f(double x, double y, double z) {
        double r18091 = x;
        double r18092 = y;
        double r18093 = 4.0;
        double r18094 = r18092 * r18093;
        double r18095 = z;
        double r18096 = r18094 * r18095;
        double r18097 = r18091 - r18096;
        return r18097;
}

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