Average Error: 0.0 → 0.0
Time: 4.4s
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 r255003 = x;
        double r255004 = y;
        double r255005 = r255004 - r255003;
        double r255006 = z;
        double r255007 = r255005 * r255006;
        double r255008 = r255003 + r255007;
        return r255008;
}
↓
double f(double x, double y, double z) {
        double r255009 = x;
        double r255010 = y;
        double r255011 = r255010 - r255009;
        double r255012 = z;
        double r255013 = r255011 * r255012;
        double r255014 = r255009 + r255013;
        return r255014;
}

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