Average Error: 0.0 → 0.0
Time: 9.3s
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 r689422 = x;
        double r689423 = y;
        double r689424 = r689422 + r689423;
        double r689425 = 1.0;
        double r689426 = z;
        double r689427 = r689425 - r689426;
        double r689428 = r689424 * r689427;
        return r689428;
}
↓
double f(double x, double y, double z) {
        double r689429 = y;
        double r689430 = x;
        double r689431 = r689429 + r689430;
        double r689432 = 1.0;
        double r689433 = z;
        double r689434 = r689432 - r689433;
        double r689435 = r689431 * r689434;
        return r689435;
}

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