Average Error: 0.0 → 0.0
Time: 26.2s
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 r39479 = x;
        double r39480 = y;
        double r39481 = r39479 + r39480;
        double r39482 = 1.0;
        double r39483 = z;
        double r39484 = r39482 - r39483;
        double r39485 = r39481 * r39484;
        return r39485;
}
↓
double f(double x, double y, double z) {
        double r39486 = x;
        double r39487 = y;
        double r39488 = r39486 + r39487;
        double r39489 = 1.0;
        double r39490 = z;
        double r39491 = r39489 - r39490;
        double r39492 = r39488 * r39491;
        return r39492;
}

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 2019200 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  (* (+ x y) (- 1 z)))