Average Error: 0.0 → 0.0
Time: 13.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 - z\right) \cdot y + \left(1 - z\right) \cdot x\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot y + \left(1 - z\right) \cdot x
double f(double x, double y, double z) {
        double r49962 = x;
        double r49963 = y;
        double r49964 = r49962 + r49963;
        double r49965 = 1.0;
        double r49966 = z;
        double r49967 = r49965 - r49966;
        double r49968 = r49964 * r49967;
        return r49968;
}
↓
double f(double x, double y, double z) {
        double r49969 = 1.0;
        double r49970 = z;
        double r49971 = r49969 - r49970;
        double r49972 = y;
        double r49973 = r49971 * r49972;
        double r49974 = x;
        double r49975 = r49971 * r49974;
        double r49976 = r49973 + r49975;
        return r49976;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\left(1 - z\right) \cdot \left(x + y\right)}\]
  3. Using strategy rm

  4. Applied distribute-lft-in0.0

    \[\leadsto \color{blue}{\left(1 - z\right) \cdot x + \left(1 - z\right) \cdot y}\]

  5. Final simplification0.0

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

Reproduce

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