Average Error: 0.0 → 0.0
Time: 7.1s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(x + y\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(x + y\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r25354 = x;
        double r25355 = y;
        double r25356 = r25354 + r25355;
        double r25357 = 1.0;
        double r25358 = z;
        double r25359 = r25357 - r25358;
        double r25360 = r25356 * r25359;
        return r25360;
}
↓
double f(double x, double y, double z) {
        double r25361 = x;
        double r25362 = y;
        double r25363 = r25361 + r25362;
        double r25364 = 1.0;
        double r25365 = z;
        double r25366 = r25364 - r25365;
        double r25367 = r25363 * r25366;
        return r25367;
}

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. Final simplification0.0

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

Reproduce

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