Average Error: 0.0 → 0.0
Time: 5.8s
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
\[x - \left(4 \cdot y\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
x - \left(4 \cdot y\right) \cdot z
double f(double x, double y, double z) {
        double r12024330 = x;
        double r12024331 = y;
        double r12024332 = 4.0;
        double r12024333 = r12024331 * r12024332;
        double r12024334 = z;
        double r12024335 = r12024333 * r12024334;
        double r12024336 = r12024330 - r12024335;
        return r12024336;
}

double f(double x, double y, double z) {
        double r12024337 = x;
        double r12024338 = 4.0;
        double r12024339 = y;
        double r12024340 = r12024338 * r12024339;
        double r12024341 = z;
        double r12024342 = r12024340 * r12024341;
        double r12024343 = r12024337 - r12024342;
        return r12024343;
}

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.0

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.0

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

Reproduce

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