Average Error: 0.0 → 0.0
Time: 12.9s
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 r1974833 = x;
        double r1974834 = y;
        double r1974835 = r1974833 + r1974834;
        double r1974836 = 1.0;
        double r1974837 = z;
        double r1974838 = r1974836 - r1974837;
        double r1974839 = r1974835 * r1974838;
        return r1974839;
}
↓
double f(double x, double y, double z) {
        double r1974840 = y;
        double r1974841 = x;
        double r1974842 = r1974840 + r1974841;
        double r1974843 = 1.0;
        double r1974844 = z;
        double r1974845 = r1974843 - r1974844;
        double r1974846 = r1974842 * r1974845;
        return r1974846;
}

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