Average Error: 0.0 → 0.0
Time: 2.6s
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 r155034 = x;
        double r155035 = y;
        double r155036 = r155034 * r155035;
        double r155037 = 1.0;
        double r155038 = r155034 - r155037;
        double r155039 = z;
        double r155040 = r155038 * r155039;
        double r155041 = r155036 + r155040;
        return r155041;
}
↓
double f(double x, double y, double z) {
        double r155042 = x;
        double r155043 = y;
        double r155044 = r155042 * r155043;
        double r155045 = 1.0;
        double r155046 = r155042 - r155045;
        double r155047 = z;
        double r155048 = r155046 * r155047;
        double r155049 = r155044 + r155048;
        return r155049;
}

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