Average Error: 0.0 → 0.0
Time: 6.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 r35150 = x;
        double r35151 = y;
        double r35152 = r35150 + r35151;
        double r35153 = 1.0;
        double r35154 = z;
        double r35155 = r35153 - r35154;
        double r35156 = r35152 * r35155;
        return r35156;
}
↓
double f(double x, double y, double z) {
        double r35157 = 1.0;
        double r35158 = z;
        double r35159 = r35157 - r35158;
        double r35160 = y;
        double r35161 = r35159 * r35160;
        double r35162 = x;
        double r35163 = r35159 * r35162;
        double r35164 = r35161 + r35163;
        return r35164;
}

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