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

?

Percentage Accurate: 100.0% → 100.0%
Time: 1.8s
Precision: binary64
Cost: 448

?

\[\left(x \cdot y + x\right) + y \]
↓
\[y + \left(y + 1\right) \cdot x \]
(FPCore (x y) :precision binary64 (+ (+ (* x y) x) y))
↓
(FPCore (x y) :precision binary64 (+ y (* (+ y 1.0) x)))
double code(double x, double y) {
	return ((x * y) + x) + y;
}
↓
double code(double x, double y) {
	return y + ((y + 1.0) * x);
}

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 = y + ((y + 1.0d0) * x)
end function

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

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

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

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

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

\left(x \cdot y + x\right) + y
↓
y + \left(y + 1\right) \cdot x

Local Percentage Accuracy?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Herbie found 5 alternatives:

AlternativeAccuracySpeedup

Accuracy vs Speed

The accuracy (vertical axis) and speed (horizontal axis) of each of Herbie's proposed alternatives. Up and to the right is better. Each dot represents an alternative program; the red square represents the initial program.

Bogosity?

Bogosity

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 100.0%

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

  2. Applied egg-rr100.0%

    \[\leadsto \color{blue}{\left(y + 1\right) \cdot x} + y \]
    Step-by-step derivation

    [Start]100.0

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

    *-commutative [=>]100.0

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

    distribute-lft1-in [=>]100.0

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

  3. Final simplification100.0%

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

Alternatives

Alternative 1
Accuracy85.7%
Cost584
\[\begin{array}{l} \mathbf{if}\;y \leq -17:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{-43}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y + y \cdot x\\ \end{array} \]
Alternative 2
Accuracy61.7%
Cost456
\[\begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{+26}:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;x \leq 1:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
Alternative 3
Accuracy75.0%
Cost456
\[\begin{array}{l} \mathbf{if}\;y \leq -17:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 3.7 \cdot 10^{+254}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
Alternative 4
Accuracy38.7%
Cost64
\[y \]

Reproduce?

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