Average Error: 0.0 → 0.0
Time: 1.0s
Precision: 64
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
↓
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
x \cdot x - \left(y \cdot 4\right) \cdot z
↓
x \cdot x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r186954 = x;
        double r186955 = r186954 * r186954;
        double r186956 = y;
        double r186957 = 4.0;
        double r186958 = r186956 * r186957;
        double r186959 = z;
        double r186960 = r186958 * r186959;
        double r186961 = r186955 - r186960;
        return r186961;
}
↓
double f(double x, double y, double z) {
        double r186962 = x;
        double r186963 = r186962 * r186962;
        double r186964 = y;
        double r186965 = 4.0;
        double r186966 = r186964 * r186965;
        double r186967 = z;
        double r186968 = r186966 * r186967;
        double r186969 = r186963 - r186968;
        return r186969;
}

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 \cdot x - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020100 
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))