Average Error: 0.0 → 0.0
Time: 1.8s
Precision: 64
\[x + \left(y - x\right) \cdot z\]
↓
\[x + \left(y - x\right) \cdot z\]
x + \left(y - x\right) \cdot z
↓
x + \left(y - x\right) \cdot z
double f(double x, double y, double z) {
        double r164066 = x;
        double r164067 = y;
        double r164068 = r164067 - r164066;
        double r164069 = z;
        double r164070 = r164068 * r164069;
        double r164071 = r164066 + r164070;
        return r164071;
}
↓
double f(double x, double y, double z) {
        double r164072 = x;
        double r164073 = y;
        double r164074 = r164073 - r164072;
        double r164075 = z;
        double r164076 = r164074 * r164075;
        double r164077 = r164072 + r164076;
        return r164077;
}

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 - x\right) \cdot z\]

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020034 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))