Average Error: 0.0 → 0.0
Time: 10.3s
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 r10805011 = x;
        double r10805012 = y;
        double r10805013 = r10805012 - r10805011;
        double r10805014 = z;
        double r10805015 = r10805013 * r10805014;
        double r10805016 = r10805011 + r10805015;
        return r10805016;
}
↓
double f(double x, double y, double z) {
        double r10805017 = x;
        double r10805018 = y;
        double r10805019 = r10805018 - r10805017;
        double r10805020 = z;
        double r10805021 = r10805019 * r10805020;
        double r10805022 = r10805017 + r10805021;
        return r10805022;
}

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