Average Error: 0.0 → 0.0
Time: 11.9s
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 r40200 = x;
        double r40201 = y;
        double r40202 = r40200 + r40201;
        double r40203 = 1.0;
        double r40204 = z;
        double r40205 = r40203 - r40204;
        double r40206 = r40202 * r40205;
        return r40206;
}
↓
double f(double x, double y, double z) {
        double r40207 = 1.0;
        double r40208 = z;
        double r40209 = r40207 - r40208;
        double r40210 = x;
        double r40211 = y;
        double r40212 = r40210 + r40211;
        double r40213 = r40209 * r40212;
        return r40213;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(1 - z\right) \cdot \left(x + y\right)}\]

  3. Final simplification0.0

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

Reproduce

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