Average Error: 0.0 → 0.0
Time: 16.8s
Precision: 64
\[\left(x + y\right) \cdot \left(1 - z\right)\]
↓
\[\left(y + x\right) \cdot \left(1 - z\right)\]
\left(x + y\right) \cdot \left(1 - z\right)
↓
\left(y + x\right) \cdot \left(1 - z\right)
double f(double x, double y, double z) {
        double r2043378 = x;
        double r2043379 = y;
        double r2043380 = r2043378 + r2043379;
        double r2043381 = 1.0;
        double r2043382 = z;
        double r2043383 = r2043381 - r2043382;
        double r2043384 = r2043380 * r2043383;
        return r2043384;
}
↓
double f(double x, double y, double z) {
        double r2043385 = y;
        double r2043386 = x;
        double r2043387 = r2043385 + r2043386;
        double r2043388 = 1.0;
        double r2043389 = z;
        double r2043390 = r2043388 - r2043389;
        double r2043391 = r2043387 * r2043390;
        return r2043391;
}

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. Final simplification0.0

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

Reproduce

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