Average Error: 0.0 → 0.0
Time: 3.0s
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 r159010 = x;
        double r159011 = y;
        double r159012 = r159010 * r159011;
        double r159013 = 1.0;
        double r159014 = r159010 - r159013;
        double r159015 = z;
        double r159016 = r159014 * r159015;
        double r159017 = r159012 + r159016;
        return r159017;
}
↓
double f(double x, double y, double z) {
        double r159018 = x;
        double r159019 = y;
        double r159020 = r159018 * r159019;
        double r159021 = 1.0;
        double r159022 = r159018 - r159021;
        double r159023 = z;
        double r159024 = r159022 * r159023;
        double r159025 = r159020 + r159024;
        return r159025;
}

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 2020046 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3"
  :precision binary64
  (+ (* x y) (* (- x 1) z)))