Rust f32::atanh

Time bar (total: 1.3s)

analyze16.0ms (1.3%)

Memory
4.7MiB live, 4.7MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.6%0.4%0%0%0%0
0%0%99.6%0.4%0%0%0%1
0%0%99.6%0.4%0%0%0%2
0%0%49.8%0.4%0%49.8%0%3
50%24.9%24.9%0.4%0%49.8%0%4
75%37.4%12.5%0.4%0%49.8%0%5
87.5%43.6%6.2%0.4%0%49.8%0%6
93.8%46.7%3.1%0.4%0%49.8%0%7
96.9%48.2%1.6%0.4%0%49.8%0%8
98.4%49%0.8%0.4%0%49.8%0%9
99.2%49.4%0.4%0.4%0%49.8%0%10
99.6%49.4%0.2%0.4%0%50%0%11
99.8%49.5%0.1%0.4%0%50%0%12
Compiler

Compiled 8 to 7 computations (12.5% saved)

sample1.2s (93%)

Memory
9.4MiB live, 321.6MiB allocated
Samples
244.0ms8 256×73valid-baseline
214.0ms8 256×73valid-sollya
186.0ms8 256×73valid-rival
Precisions
Click to see Rival histograms. Total time spent on operations: 76.0ms
ival-atanh: 67.0ms (87.7% of total)
ival-true: 6.0ms (7.9% of total)
ival-assert: 3.0ms (3.9% of total)
Precisions
Click to see Base histograms. Total time spent on operations: 71.0ms
ival-atanh: 65.0ms (91.1% of total)
const: 6.0ms (8.4% of total)
Bogosity

preprocess50.0ms (3.9%)

Memory
-11.1MiB live, 19.4MiB allocated
Algorithm
1×egg-herbie
Rules
252×fma-define
48×sub-neg
44×fmm-def
26×*-commutative
24×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
(*.f32 #s(literal 1/2 binary32) (log1p.f32 (/.f32 (*.f32 #s(literal 2 binary32) x) (-.f32 #s(literal 1 binary32) x))))
(atanh.f32 x)
(atanh.f32 (neg.f32 x))
(neg.f32 (atanh.f32 (neg.f32 x)))
Outputs
(*.f32 #s(literal 1/2 binary32) (log1p.f32 (/.f32 (*.f32 #s(literal 2 binary32) x) (-.f32 #s(literal 1 binary32) x))))
(*.f32 #s(literal 1/2 binary32) (log1p.f32 (*.f32 x (/.f32 #s(literal 2 binary32) (-.f32 #s(literal 1 binary32) x)))))
(atanh.f32 x)
(atanh.f32 (neg.f32 x))
(neg.f32 (atanh.f32 (neg.f32 x)))
Compiler

Compiled 11 to 9 computations (18.2% saved)

eval0.0ms (0%)

Memory
0.3MiB live, 0.3MiB 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
99.8%
(*.f32 #s(literal 1/2 binary32) (log1p.f32 (/.f32 (*.f32 #s(literal 2 binary32) x) (-.f32 #s(literal 1 binary32) x))))
Compiler

Compiled 22 to 18 computations (18.2% saved)

simplify2.0ms (0.2%)

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

Useful iterations: 0 (0.0ms)

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

soundness0.0ms (0%)

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

Compiled 11 to 9 computations (18.2% saved)

preprocess20.0ms (1.6%)

Memory
-0.6MiB live, 20.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...