Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B

Average Error: 0.0 → 0.0

Time: 2.5s

Precision: binary64

Cost: 448

\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((x * y) + x) + y
end function

↓

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x + ((x * y) + y)
end function

Java

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

↓

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

Python

def code(x, y):
	return ((x * y) + x) + y

↓

def code(x, y):
	return x + ((x * y) + y)

Julia

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

↓

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

MATLAB

function tmp = code(x, y)
	tmp = ((x * y) + x) + y;
end

↓

function tmp = code(x, y)
	tmp = x + ((x * y) + y);
end

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

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

2. Simplified 0.0

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

   [Start] 0.0	\[ \left(x \cdot y + x\right) + y \]
   rational.json-simplify-1 [=>] 0.0	\[ \color{blue}{y + \left(x \cdot y + x\right)} \]
   rational.json-simplify-1 [=>] 0.0	\[ y + \color{blue}{\left(x + x \cdot y\right)} \]
   rational.json-simplify-41 [=>] 0.0	\[ \color{blue}{x + \left(x \cdot y + y\right)} \]

3. Final simplification 0.0

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

Alternatives

Alternative 1
Error	27.5
Cost	456

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

Alternative 2
Error	1.4
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -8500000:\\ \;\;\;\;\left(1 + y\right) \cdot x\\ \mathbf{elif}\;x \leq 1.75 \cdot 10^{+26}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 3
Error	8.5
Cost	324

\[\begin{array}{l} \mathbf{if}\;x \leq 2 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 4
Error	35.8
Cost	64

\[x \]

Reproduce

herbie shell --seed 2023068 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))