Average Error: 0.0 → 0.0
Time: 3.2s
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 r187050 = x;
        double r187051 = y;
        double r187052 = r187051 - r187050;
        double r187053 = z;
        double r187054 = r187052 * r187053;
        double r187055 = r187050 + r187054;
        return r187055;
}
↓
double f(double x, double y, double z) {
        double r187056 = x;
        double r187057 = y;
        double r187058 = r187057 - r187056;
        double r187059 = z;
        double r187060 = r187058 * r187059;
        double r187061 = r187056 + r187060;
        return r187061;
}

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