Average Error: 0.0 → 0.0
Time: 8.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 r38354 = x;
        double r38355 = y;
        double r38356 = r38354 + r38355;
        double r38357 = 1.0;
        double r38358 = z;
        double r38359 = r38357 - r38358;
        double r38360 = r38356 * r38359;
        return r38360;
}
↓
double f(double x, double y, double z) {
        double r38361 = x;
        double r38362 = y;
        double r38363 = r38361 + r38362;
        double r38364 = 1.0;
        double r38365 = z;
        double r38366 = r38364 - r38365;
        double r38367 = r38363 * r38366;
        return r38367;
}

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