Average Error: 0.0 → 0.0
Time: 4.5s
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 r280852 = x;
        double r280853 = y;
        double r280854 = r280853 - r280852;
        double r280855 = z;
        double r280856 = r280854 * r280855;
        double r280857 = r280852 + r280856;
        return r280857;
}
↓
double f(double x, double y, double z) {
        double r280858 = x;
        double r280859 = y;
        double r280860 = r280859 - r280858;
        double r280861 = z;
        double r280862 = r280860 * r280861;
        double r280863 = r280858 + r280862;
        return r280863;
}

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