Average Error: 0.0 → 0.0
Time: 1.6s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 \cdot \left(x + y\right) - x \cdot z\right) + y \cdot \left(-z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 \cdot \left(x + y\right) - x \cdot z\right) + y \cdot \left(-z\right)
double f(double x, double y, double z) {
        double r26289 = x;
        double r26290 = y;
        double r26291 = r26289 + r26290;
        double r26292 = 1.0;
        double r26293 = z;
        double r26294 = r26292 - r26293;
        double r26295 = r26291 * r26294;
        return r26295;
}
↓
double f(double x, double y, double z) {
        double r26296 = 1.0;
        double r26297 = x;
        double r26298 = y;
        double r26299 = r26297 + r26298;
        double r26300 = r26296 * r26299;
        double r26301 = z;
        double r26302 = r26297 * r26301;
        double r26303 = r26300 - r26302;
        double r26304 = -r26301;
        double r26305 = r26298 * r26304;
        double r26306 = r26303 + r26305;
        return r26306;
}

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

    \[\left(x + y\right) \cdot \left(1 - z\right)\]
  2. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Simplified0.0

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

  6. Simplified0.0

    \[\leadsto 1 \cdot \left(x + y\right) + \color{blue}{\left(-z\right) \cdot \left(x + y\right)}\]
  7. Using strategy rm

  8. Applied distribute-rgt-in0.0

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

  9. Applied associate-+r+0.0

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

  10. Simplified0.0

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

  11. Final simplification0.0

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

Reproduce

herbie shell --seed 2020034 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1 z)))