Average Error: 0.0 → 0.0
Time: 10.7s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r534373 = x;
        double r534374 = y;
        double r534375 = r534373 + r534374;
        double r534376 = 1.0;
        double r534377 = z;
        double r534378 = r534376 - r534377;
        double r534379 = r534375 * r534378;
        return r534379;
}
↓
double f(double x, double y, double z) {
        double r534380 = y;
        double r534381 = x;
        double r534382 = r534380 + r534381;
        double r534383 = 1.0;
        double r534384 = z;
        double r534385 = r534383 - r534384;
        double r534386 = r534382 * r534385;
        return r534386;
}

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

Reproduce

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