Average Error: 0.1 → 0.1
Time: 482.0ms
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 r190593 = x;
        double r190594 = y;
        double r190595 = 4.0;
        double r190596 = r190594 * r190595;
        double r190597 = z;
        double r190598 = r190596 * r190597;
        double r190599 = r190593 - r190598;
        return r190599;
}
↓
double f(double x, double y, double z) {
        double r190600 = x;
        double r190601 = y;
        double r190602 = 4.0;
        double r190603 = r190601 * r190602;
        double r190604 = z;
        double r190605 = r190603 * r190604;
        double r190606 = r190600 - r190605;
        return r190606;
}

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