Average Error: 0.0 → 0.0
Time: 6.2s
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 r2042623 = x;
        double r2042624 = y;
        double r2042625 = r2042623 + r2042624;
        double r2042626 = 1.0;
        double r2042627 = z;
        double r2042628 = r2042626 - r2042627;
        double r2042629 = r2042625 * r2042628;
        return r2042629;
}
↓
double f(double x, double y, double z) {
        double r2042630 = y;
        double r2042631 = x;
        double r2042632 = r2042630 + r2042631;
        double r2042633 = 1.0;
        double r2042634 = z;
        double r2042635 = r2042633 - r2042634;
        double r2042636 = r2042632 * r2042635;
        return r2042636;
}

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