Average Error: 0.1 → 0.1
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 r206423 = x;
        double r206424 = y;
        double r206425 = 4.0;
        double r206426 = r206424 * r206425;
        double r206427 = z;
        double r206428 = r206426 * r206427;
        double r206429 = r206423 - r206428;
        return r206429;
}

double f(double x, double y, double z) {
        double r206430 = x;
        double r206431 = y;
        double r206432 = 4.0;
        double r206433 = r206431 * r206432;
        double r206434 = z;
        double r206435 = r206433 * r206434;
        double r206436 = r206430 - r206435;
        return r206436;
}

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