Rust f64::atanh

Time bar (total: 1.3s)

analyze15.0ms (1.1%)

Memory
4.6MiB live, 4.6MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
0%0%100%0%0%0%0%1
0%0%100%0%0%0%0%2
0%0%50%0%0%50%0%3
50%25%25%0%0%50%0%4
75%37.5%12.5%0%0%50%0%5
87.5%43.7%6.2%0%0%50%0%6
93.8%46.9%3.1%0%0%50%0%7
96.9%48.4%1.6%0%0%50%0%8
98.4%49.2%0.8%0%0%50%0%9
99.2%49.6%0.4%0%0%50%0%10
99.6%49.8%0.2%0%0%50%0%11
99.8%49.9%0.1%0%0%50%0%12
Compiler

Compiled 8 to 7 computations (12.5% saved)

sample1.3s (93.5%)

Memory
5.0MiB live, 352.6MiB allocated
Samples
278.0ms8 256×0valid-sollya
206.0ms8 256×0valid-baseline
180.0ms8 256×0valid-rival
Bogosity

preprocess51.0ms (3.8%)

Memory
-13.5MiB live, 19.5MiB allocated
Algorithm
1×egg-herbie
Rules
126×fma-define
24×sub-neg
22×fmm-def
13×*-commutative
12×distribute-rgt-in
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01871
13571
24571
35871
47371
59271
614971
725671
831471
934971
1037271
1138371
1243971
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (-.f64 #s(literal 1 binary64) x))))
(atanh.f64 x)
(atanh.f64 (neg.f64 x))
(neg.f64 (atanh.f64 (neg.f64 x)))
Outputs
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (-.f64 #s(literal 1 binary64) x))))
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (*.f64 x (/.f64 #s(literal 2 binary64) (-.f64 #s(literal 1 binary64) x)))))
(atanh.f64 x)
(atanh.f64 (neg.f64 x))
(neg.f64 (atanh.f64 (neg.f64 x)))
Compiler

Compiled 11 to 9 computations (18.2% saved)

eval0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated
Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Memory
0.9MiB live, 0.9MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (-.f64 #s(literal 1 binary64) x))))
Compiler

Compiled 22 to 18 computations (18.2% saved)

simplify2.0ms (0.2%)

Memory
0.5MiB live, 0.5MiB allocated
Algorithm
1×egg-herbie
Rules
3×1-exp
3×*-commutative
2×sub-neg
2×+-commutative
1×neg-sub0
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01435
12335
22735
32935
43035
Stop Event
1×saturated
Calls
Call 1
Inputs
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (-.f64 #s(literal 1 binary64) x))))
Outputs
(*.f64 #s(literal 1/2 binary64) (log1p.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (-.f64 #s(literal 1 binary64) x))))

soundness0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Stop Event
1×fuel
Compiler

Compiled 11 to 9 computations (18.2% saved)

preprocess18.0ms (1.3%)

Memory
7.1MiB live, 22.8MiB allocated
Compiler

Compiled 44 to 36 computations (18.2% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...