Average Error: 0.0 → 0.0
Time: 46.7s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 - z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r2788022 = x;
        double r2788023 = y;
        double r2788024 = r2788022 + r2788023;
        double r2788025 = 1.0;
        double r2788026 = z;
        double r2788027 = r2788025 - r2788026;
        double r2788028 = r2788024 * r2788027;
        return r2788028;
}
↓
double f(double x, double y, double z) {
        double r2788029 = 1.0;
        double r2788030 = z;
        double r2788031 = r2788029 - r2788030;
        double r2788032 = x;
        double r2788033 = y;
        double r2788034 = r2788032 + r2788033;
        double r2788035 = r2788031 * r2788034;
        return r2788035;
}

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(1 - z\right) \cdot \left(x + y\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.0 z)))