Average Error: 0.0 → 0.0
Time: 10.0s
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 r244815 = x;
        double r244816 = y;
        double r244817 = r244816 - r244815;
        double r244818 = z;
        double r244819 = r244817 * r244818;
        double r244820 = r244815 + r244819;
        return r244820;
}
↓
double f(double x, double y, double z) {
        double r244821 = x;
        double r244822 = y;
        double r244823 = r244822 - r244821;
        double r244824 = z;
        double r244825 = r244823 * r244824;
        double r244826 = r244821 + r244825;
        return r244826;
}

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)))