Average Error: 0.0 → 0.0
Time: 5.1s
Precision: 64
\[x + y \cdot \left(z - x\right)\]
\[\left(z - x\right) \cdot y + x\]
x + y \cdot \left(z - x\right)
\left(z - x\right) \cdot y + x
double f(double x, double y, double z) {
        double r20422 = x;
        double r20423 = y;
        double r20424 = z;
        double r20425 = r20424 - r20422;
        double r20426 = r20423 * r20425;
        double r20427 = r20422 + r20426;
        return r20427;
}

double f(double x, double y, double z) {
        double r20428 = z;
        double r20429 = x;
        double r20430 = r20428 - r20429;
        double r20431 = y;
        double r20432 = r20430 * r20431;
        double r20433 = r20432 + r20429;
        return r20433;
}

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

    \[x + y \cdot \left(z - x\right)\]
  2. Using strategy rm
  3. Applied sub-neg0.0

    \[\leadsto x + y \cdot \color{blue}{\left(z + \left(-x\right)\right)}\]
  4. Applied distribute-lft-in0.0

    \[\leadsto x + \color{blue}{\left(y \cdot z + y \cdot \left(-x\right)\right)}\]
  5. Final simplification0.0

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

Reproduce

herbie shell --seed 2019304 
(FPCore (x y z)
  :name "SynthBasics:oscSampleBasedAux from YampaSynth-0.2"
  :precision binary64
  (+ x (* y (- z x))))