Numeric.Log:$clog1p from log-domain-0.10.2.1, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.6s

Precision: binary64

Cost: 704

• 43.8% of points produce a very large (infinite) output. You may want to add a precondition.

Math

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

↓

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

FPCore

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

↓

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

C

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

↓

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

Fortran

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

↓

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

Java

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

↓

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

Python

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

↓

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

Julia

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

↓

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

MATLAB

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

↓

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

Wolfram

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

↓

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

Target

Original	100.0%
Target	100.0%
Herbie	100.0%

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

Derivation

1. Initial program 100.0%

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

2. Final simplification 100.0%

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

Alternatives

Alternative 1
Accuracy	100.0%
Cost	704

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

Alternative 2
Accuracy	70.9%
Cost	720

\[\begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+117}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq -5.4 \cdot 10^{-18}:\\ \;\;\;\;y \cdot y\\ \mathbf{elif}\;x \leq -1.4 \cdot 10^{-50}:\\ \;\;\;\;x + x\\ \mathbf{elif}\;x \leq 16800000000000:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 3
Accuracy	97.9%
Cost	713

\[\begin{array}{l} \mathbf{if}\;x \leq -7.6 \cdot 10^{+28} \lor \neg \left(x \leq 1.75\right):\\ \;\;\;\;x \cdot x + y \cdot y\\ \mathbf{else}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \end{array} \]

Alternative 4
Accuracy	88.3%
Cost	712

\[\begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{+116}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 2.3 \cdot 10^{+24}:\\ \;\;\;\;y \cdot y + x \cdot 2\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 5
Accuracy	100.0%
Cost	576

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

Alternative 6
Accuracy	71.0%
Cost	456

\[\begin{array}{l} \mathbf{if}\;x \leq -1.1 \cdot 10^{+117}:\\ \;\;\;\;x \cdot x\\ \mathbf{elif}\;x \leq 3.9 \cdot 10^{+16}:\\ \;\;\;\;y \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot x\\ \end{array} \]

Alternative 7
Accuracy	42.4%
Cost	192

\[x \cdot x \]

Reproduce

herbie shell --seed 2023263 
(FPCore (x y)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, A"
  :precision binary64

  :herbie-target
  (+ (* y y) (+ (* 2.0 x) (* x x)))

  (+ (+ (* x 2.0) (* x x)) (* y y)))