Average Error: 0.0 → 0.0
Time: 12.8s
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 r30541 = x;
        double r30542 = y;
        double r30543 = r30541 + r30542;
        double r30544 = 1.0;
        double r30545 = z;
        double r30546 = r30544 - r30545;
        double r30547 = r30543 * r30546;
        return r30547;
}
↓
double f(double x, double y, double z) {
        double r30548 = 1.0;
        double r30549 = z;
        double r30550 = r30548 - r30549;
        double r30551 = x;
        double r30552 = y;
        double r30553 = r30551 + r30552;
        double r30554 = r30550 * r30553;
        return r30554;
}

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