Average Error: 0.0 → 0.0
Time: 2.5s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(1 - z\right) \cdot \left(x + y\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(1 - z\right) \cdot \left(x + y\right)
double f(double x, double y, double z) {
        double r30140 = x;
        double r30141 = y;
        double r30142 = r30140 + r30141;
        double r30143 = 1.0;
        double r30144 = z;
        double r30145 = r30143 - r30144;
        double r30146 = r30142 * r30145;
        return r30146;
}
↓
double f(double x, double y, double z) {
        double r30147 = 1.0;
        double r30148 = z;
        double r30149 = r30147 - r30148;
        double r30150 = x;
        double r30151 = y;
        double r30152 = r30150 + r30151;
        double r30153 = r30149 * r30152;
        return r30153;
}

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. Using strategy rm

  3. Applied sub-neg0.0

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

  4. Applied distribute-lft-in0.0

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

  5. Simplified0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

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