Average Error: 0.0 → 0.0
Time: 4.8s
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 r141948 = x;
        double r141949 = y;
        double r141950 = r141949 - r141948;
        double r141951 = z;
        double r141952 = r141950 * r141951;
        double r141953 = r141948 + r141952;
        return r141953;
}
↓
double f(double x, double y, double z) {
        double r141954 = x;
        double r141955 = y;
        double r141956 = r141955 - r141954;
        double r141957 = z;
        double r141958 = r141956 * r141957;
        double r141959 = r141954 + r141958;
        return r141959;
}

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