Average Error: 0.0 → 0.0
Time: 14.6s
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 r11534174 = x;
        double r11534175 = y;
        double r11534176 = r11534175 - r11534174;
        double r11534177 = z;
        double r11534178 = r11534176 * r11534177;
        double r11534179 = r11534174 + r11534178;
        return r11534179;
}
↓
double f(double x, double y, double z) {
        double r11534180 = x;
        double r11534181 = y;
        double r11534182 = r11534181 - r11534180;
        double r11534183 = z;
        double r11534184 = r11534182 * r11534183;
        double r11534185 = r11534180 + r11534184;
        return r11534185;
}

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