Average Error: 0.0 → 0.0
Time: 18.3s
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 r157978 = x;
        double r157979 = y;
        double r157980 = r157979 - r157978;
        double r157981 = z;
        double r157982 = r157980 * r157981;
        double r157983 = r157978 + r157982;
        return r157983;
}
↓
double f(double x, double y, double z) {
        double r157984 = x;
        double r157985 = y;
        double r157986 = r157985 - r157984;
        double r157987 = z;
        double r157988 = r157986 * r157987;
        double r157989 = r157984 + r157988;
        return r157989;
}

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 2019306 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))