Average Error: 0.0 → 0.0
Time: 11.6s
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 r24337 = x;
        double r24338 = y;
        double r24339 = r24337 + r24338;
        double r24340 = 1.0;
        double r24341 = z;
        double r24342 = r24340 - r24341;
        double r24343 = r24339 * r24342;
        return r24343;
}
↓
double f(double x, double y, double z) {
        double r24344 = 1.0;
        double r24345 = z;
        double r24346 = r24344 - r24345;
        double r24347 = x;
        double r24348 = y;
        double r24349 = r24347 + r24348;
        double r24350 = r24346 * r24349;
        return r24350;
}

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