Average Error: 0.0 → 0.0
Time: 13.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1.0 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1.0 - z\right)\]
\left(x + y\right) \cdot \left(1.0 - z\right)
↓
\left(y + x\right) \cdot \left(1.0 - z\right)
double f(double x, double y, double z) {
        double r2477515 = x;
        double r2477516 = y;
        double r2477517 = r2477515 + r2477516;
        double r2477518 = 1.0;
        double r2477519 = z;
        double r2477520 = r2477518 - r2477519;
        double r2477521 = r2477517 * r2477520;
        return r2477521;
}
↓
double f(double x, double y, double z) {
        double r2477522 = y;
        double r2477523 = x;
        double r2477524 = r2477522 + r2477523;
        double r2477525 = 1.0;
        double r2477526 = z;
        double r2477527 = r2477525 - r2477526;
        double r2477528 = r2477524 * r2477527;
        return r2477528;
}

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.0 - z\right)\]

  2. Final simplification0.0

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

Reproduce

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