Average Error: 0.0 → 0.0
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 r1129 = x;
        double r1130 = y;
        double r1131 = 4.0;
        double r1132 = r1130 * r1131;
        double r1133 = z;
        double r1134 = r1132 * r1133;
        double r1135 = r1129 - r1134;
        return r1135;
}
↓
double f(double x, double y, double z) {
        double r1136 = x;
        double r1137 = y;
        double r1138 = 4.0;
        double r1139 = r1137 * r1138;
        double r1140 = z;
        double r1141 = r1139 * r1140;
        double r1142 = r1136 - r1141;
        return r1142;
}

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