Average Error: 0.0 → 0.0
Time: 4.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 r194947 = x;
        double r194948 = y;
        double r194949 = 4.0;
        double r194950 = r194948 * r194949;
        double r194951 = z;
        double r194952 = r194950 * r194951;
        double r194953 = r194947 - r194952;
        return r194953;
}
↓
double f(double x, double y, double z) {
        double r194954 = x;
        double r194955 = y;
        double r194956 = 4.0;
        double r194957 = r194955 * r194956;
        double r194958 = z;
        double r194959 = r194957 * r194958;
        double r194960 = r194954 - r194959;
        return r194960;
}

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