Average Error: 0.1 → 0.1
Time: 3.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 r205310 = x;
        double r205311 = y;
        double r205312 = 4.0;
        double r205313 = r205311 * r205312;
        double r205314 = z;
        double r205315 = r205313 * r205314;
        double r205316 = r205310 - r205315;
        return r205316;
}

double f(double x, double y, double z) {
        double r205317 = x;
        double r205318 = y;
        double r205319 = 4.0;
        double r205320 = r205318 * r205319;
        double r205321 = z;
        double r205322 = r205320 * r205321;
        double r205323 = r205317 - r205322;
        return r205323;
}

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