Average Error: 0.1 → 0.1
Time: 5.3s
Precision: 64
\[x - \left(y \cdot 4.0\right) \cdot z\]
↓
\[x - \left(4.0 \cdot y\right) \cdot z\]
x - \left(y \cdot 4.0\right) \cdot z
↓
x - \left(4.0 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r10691179 = x;
        double r10691180 = y;
        double r10691181 = 4.0;
        double r10691182 = r10691180 * r10691181;
        double r10691183 = z;
        double r10691184 = r10691182 * r10691183;
        double r10691185 = r10691179 - r10691184;
        return r10691185;
}
↓
double f(double x, double y, double z) {
        double r10691186 = x;
        double r10691187 = 4.0;
        double r10691188 = y;
        double r10691189 = r10691187 * r10691188;
        double r10691190 = z;
        double r10691191 = r10691189 * r10691190;
        double r10691192 = r10691186 - r10691191;
        return r10691192;
}

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.0\right) \cdot z\]

  2. Final simplification0.1

    \[\leadsto x - \left(4.0 \cdot y\right) \cdot z\]

Reproduce

herbie shell --seed 2019164 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  (- x (* (* y 4.0) z)))