Average Error: 0.0 → 0.0
Time: 5.3s
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 r28959 = x;
        double r28960 = y;
        double r28961 = r28959 + r28960;
        double r28962 = 1.0;
        double r28963 = z;
        double r28964 = r28962 - r28963;
        double r28965 = r28961 * r28964;
        return r28965;
}
↓
double f(double x, double y, double z) {
        double r28966 = 1.0;
        double r28967 = z;
        double r28968 = r28966 - r28967;
        double r28969 = y;
        double r28970 = r28968 * r28969;
        double r28971 = x;
        double r28972 = r28968 * r28971;
        double r28973 = r28970 + r28972;
        return r28973;
}

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