Average Error: 0.0 → 0.0
Time: 9.5s
Precision: 64
\[x \cdot y + \left(x - 1\right) \cdot z\]
\[x \cdot y + \left(x - 1\right) \cdot z\]
x \cdot y + \left(x - 1\right) \cdot z
x \cdot y + \left(x - 1\right) \cdot z
double f(double x, double y, double z) {
        double r153012 = x;
        double r153013 = y;
        double r153014 = r153012 * r153013;
        double r153015 = 1.0;
        double r153016 = r153012 - r153015;
        double r153017 = z;
        double r153018 = r153016 * r153017;
        double r153019 = r153014 + r153018;
        return r153019;
}

double f(double x, double y, double z) {
        double r153020 = x;
        double r153021 = y;
        double r153022 = r153020 * r153021;
        double r153023 = 1.0;
        double r153024 = r153020 - r153023;
        double r153025 = z;
        double r153026 = r153024 * r153025;
        double r153027 = r153022 + r153026;
        return r153027;
}

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 y + \left(x - 1\right) \cdot z\]
  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019235 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3"
  :precision binary64
  (+ (* x y) (* (- x 1) z)))