Average Error: 0.1 → 0.1
Time: 770.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 r203137 = x;
        double r203138 = y;
        double r203139 = 4.0;
        double r203140 = r203138 * r203139;
        double r203141 = z;
        double r203142 = r203140 * r203141;
        double r203143 = r203137 - r203142;
        return r203143;
}
↓
double f(double x, double y, double z) {
        double r203144 = x;
        double r203145 = y;
        double r203146 = 4.0;
        double r203147 = r203145 * r203146;
        double r203148 = z;
        double r203149 = r203147 * r203148;
        double r203150 = r203144 - r203149;
        return r203150;
}

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