Main:bigenough2 from A

Average Error: 0.0 → 0.0

Time: 3.3s

Precision: binary64

Cost: 6720

Math

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

↓

\[\mathsf{fma}\left(y, x + z, x\right) \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (* y (+ z x))))

↓

(FPCore (x y z) :precision binary64 (fma y (+ x z) x))

C

double code(double x, double y, double z) {
	return x + (y * (z + x));
}

↓

double code(double x, double y, double z) {
	return fma(y, (x + z), x);
}

Julia

function code(x, y, z)
	return Float64(x + Float64(y * Float64(z + x)))
end

↓

function code(x, y, z)
	return fma(y, Float64(x + z), x)
end

Wolfram

code[x_, y_, z_] := N[(x + N[(y * N[(z + x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

↓

code[x_, y_, z_] := N[(y * N[(x + z), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 0.0

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

2. Simplified 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x + z, x\right)} \]
   Proof
   (fma.f64 y (+.f64 x z) x): 0 points increase in error, 0 points decrease in error
   (fma.f64 y (Rewrite<= +-commutative_binary64 (+.f64 z x)) x): 0 points increase in error, 0 points decrease in error
   (Rewrite<= fma-def_binary64 (+.f64 (*.f64 y (+.f64 z x)) x)): 0 points increase in error, 0 points decrease in error
   (Rewrite<= +-commutative_binary64 (+.f64 x (*.f64 y (+.f64 z x)))): 0 points increase in error, 0 points decrease in error

3. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(y, x + z, x\right) \]

Alternatives

Alternative 1
Error	23.5
Cost	984

\[\begin{array}{l} \mathbf{if}\;y \leq -6.1 \cdot 10^{+66}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq -980000000000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq -1.48 \cdot 10^{-33}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 3.6 \cdot 10^{-90}:\\ \;\;\;\;x\\ \mathbf{elif}\;y \leq 2.3 \cdot 10^{-60}:\\ \;\;\;\;y \cdot z\\ \mathbf{elif}\;y \leq 5.4 \cdot 10^{-16}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 2
Error	12.4
Cost	850

\[\begin{array}{l} \mathbf{if}\;y \leq -7.6 \cdot 10^{-34} \lor \neg \left(y \leq 6 \cdot 10^{-92} \lor \neg \left(y \leq 2.6 \cdot 10^{-60}\right) \land y \leq 9 \cdot 10^{-21}\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3
Error	0.9
Cost	585

\[\begin{array}{l} \mathbf{if}\;y \leq -1 \lor \neg \left(y \leq 0.00046\right):\\ \;\;\;\;y \cdot \left(x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot z\\ \end{array} \]

Alternative 4
Error	24.3
Cost	456

\[\begin{array}{l} \mathbf{if}\;y \leq -1:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 5
Error	0.0
Cost	448

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

Alternative 6
Error	35.0
Cost	64

\[x \]

Reproduce

herbie shell --seed 2022343 
(FPCore (x y z)
  :name "Main:bigenough2 from A"
  :precision binary64
  (+ x (* y (+ z x))))