Prelude:atanh from fay-base-0.20.0.1

Time bar (total: 1.5s)

analyze2.0ms (0.1%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
0%0%100%0%0%0%0%1
50%50%50%0%0%0%0%2
75%75%25%0%0%0%0%3
87.5%87.5%12.5%0%0%0%0%4
93.8%93.7%6.2%0%0%0%0%5
96.9%96.8%3.1%0%0%0%0%6
98.4%98.4%1.6%0%0%0%0%7
99.2%99.2%0.8%0%0%0%0%8
99.6%99.6%0.4%0%0%0%0%9
99.8%99.8%0.2%0%0%0%0%10
99.9%99.9%0.1%0%0%0%0%11
100%99.9%0%0%0%0%0%12
Compiler

Compiled 9 to 7 computations (22.2% saved)

Precisions
Click to see histograms. Total time spent on operations: 0.0ms
ival-sub: 0.0ms (0% of total)
ival-div: 0.0ms (0% of total)
ival-add: 0.0ms (0% of total)
const: 0.0ms (0% of total)

sample1.2s (81.5%)

Results
768.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 260.0ms
ival-add: 131.0ms (50.3% of total)
ival-div: 63.0ms (24.2% of total)
ival-sub: 48.0ms (18.4% of total)
const: 15.0ms (5.8% of total)
backward-pass: 4.0ms (1.5% of total)
Bogosity

preprocess133.0ms (9.1%)

Algorithm
1×egg-herbie
Rules
491×fma-define
233×fma-neg
86×times-frac
60×div-sub
38×unsub-neg
Iterations

Useful iterations: 1 (0.0ms)

IterNodesCost
015112
134100
265100
3150100
4322100
5735100
61273100
71455100
81497100
Stop Event
1×saturated
Calls
Call 1
Inputs
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) (neg.f64 x)))
(neg.f64 (/.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) (neg.f64 x))))
Outputs
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) (neg.f64 x)))
(/.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) (neg.f64 x)))
(/.f64 (-.f64 #s(literal 1 binary64) x) (+.f64 x #s(literal 1 binary64)))
(neg.f64 (/.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) (neg.f64 x))))
(/.f64 (neg.f64 (-.f64 #s(literal 1 binary64) x)) (-.f64 #s(literal 1 binary64) (neg.f64 x)))
(/.f64 (+.f64 x #s(literal -1 binary64)) (+.f64 x #s(literal 1 binary64)))
(/.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal -1 binary64) x))

explain77.0ms (5.3%)

FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-x
00-0-#s(literal 1 binary64)
00-0-(-.f64 #s(literal 1 binary64) x)
00-0-(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
00-0-(+.f64 x #s(literal 1 binary64))
Results
54.0ms512×256valid
Compiler

Compiled 42 to 30 computations (28.6% saved)

Precisions
Click to see histograms. Total time spent on operations: 17.0ms
ival-add: 6.0ms (35% of total)
ival-sub: 5.0ms (29.2% of total)
ival-div: 4.0ms (23.3% of total)
const: 2.0ms (11.7% of total)

eval0.0ms (0%)

Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
Compiler

Compiled 8 to 6 computations (25% saved)

localize35.0ms (2.4%)

Results
24.0ms256×256valid
Compiler

Compiled 17 to 12 computations (29.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 10.0ms
ival-add: 5.0ms (49% of total)
ival-sub: 3.0ms (29.4% of total)
ival-div: 2.0ms (19.6% of total)
const: 1.0ms (9.8% of total)

eval0.0ms (0%)

Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Pruning

1 alts after pruning (0 fresh and 1 done)

PrunedKeptTotal
New000
Fresh000
Picked011
Done000
Total011
Accuracy
100.0%
Counts
1 → 1
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
Compiler

Compiled 16 to 12 computations (25% saved)

simplify2.0ms (0.2%)

Algorithm
1×egg-herbie
Rules
3×1-exp
3×+-commutative
2×sub-neg
1×*-commutative
1×neg-sub0
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0925
11825
22225
32425
42525
Stop Event
1×saturated
Calls
Call 1
Inputs
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))
Outputs
(/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 #s(literal 1 binary64) x))

soundness0.0ms (0%)

Stop Event
1×done
Compiler

Compiled 8 to 6 computations (25% saved)

preprocess21.0ms (1.4%)

Compiler

Compiled 32 to 24 computations (25% saved)

end0.0ms (0%)

Profiling

Loading profile data...