Average Error: 0.0 → 0.0
Time: 49.7s
Precision: 64
\[x + \left(y - x\right) \cdot z\]
↓
\[x - z \cdot \left(x - y\right)\]
x + \left(y - x\right) \cdot z
↓
x - z \cdot \left(x - y\right)
double f(double x, double y, double z) {
        double r211097 = x;
        double r211098 = y;
        double r211099 = r211098 - r211097;
        double r211100 = z;
        double r211101 = r211099 * r211100;
        double r211102 = r211097 + r211101;
        return r211102;
}
↓
double f(double x, double y, double z) {
        double r211103 = x;
        double r211104 = z;
        double r211105 = y;
        double r211106 = r211103 - r211105;
        double r211107 = r211104 * r211106;
        double r211108 = r211103 - r211107;
        return r211108;
}

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. Simplified0.0

    \[\leadsto \color{blue}{x - z \cdot \left(x - y\right)}\]

  3. Final simplification0.0

    \[\leadsto x - z \cdot \left(x - y\right)\]

Reproduce

herbie shell --seed 2020045 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Shapes:frustum from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ x (* (- y x) z)))