Average Error: 0.0 → 0.0
Time: 3.7s
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 r46307 = x;
        double r46308 = y;
        double r46309 = r46307 + r46308;
        double r46310 = 1.0;
        double r46311 = z;
        double r46312 = r46310 - r46311;
        double r46313 = r46309 * r46312;
        return r46313;
}
↓
double f(double x, double y, double z) {
        double r46314 = 1.0;
        double r46315 = z;
        double r46316 = r46314 - r46315;
        double r46317 = y;
        double r46318 = r46316 * r46317;
        double r46319 = x;
        double r46320 = r46316 * r46319;
        double r46321 = r46318 + r46320;
        return r46321;
}

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

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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