Average Error: 0.0 → 0.0
Time: 16.3s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r2427707 = x;
        double r2427708 = y;
        double r2427709 = r2427707 + r2427708;
        double r2427710 = 1.0;
        double r2427711 = z;
        double r2427712 = r2427710 - r2427711;
        double r2427713 = r2427709 * r2427712;
        return r2427713;
}
↓
double f(double x, double y, double z) {
        double r2427714 = y;
        double r2427715 = x;
        double r2427716 = r2427714 + r2427715;
        double r2427717 = 1.0;
        double r2427718 = z;
        double r2427719 = r2427717 - r2427718;
        double r2427720 = r2427716 * r2427719;
        return r2427720;
}

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.0 - z\right)\]

  2. Final simplification0.0

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

Reproduce

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