Average Error: 0.0 → 0.0
Time: 9.9s
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 r2839639 = x;
        double r2839640 = y;
        double r2839641 = r2839639 + r2839640;
        double r2839642 = 1.0;
        double r2839643 = z;
        double r2839644 = r2839642 - r2839643;
        double r2839645 = r2839641 * r2839644;
        return r2839645;
}
↓
double f(double x, double y, double z) {
        double r2839646 = y;
        double r2839647 = x;
        double r2839648 = r2839646 + r2839647;
        double r2839649 = 1.0;
        double r2839650 = z;
        double r2839651 = r2839649 - r2839650;
        double r2839652 = r2839648 * r2839651;
        return r2839652;
}

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