Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

Time bar (total: 970.0ms)

analyze0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated
Algorithm
search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 7 to 6 computations (14.3% saved)

sample503.0ms (51.8%)

Memory
19.6MiB live, 485.3MiB allocated
Samples
303.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 123.0ms
ival-add: 69.0ms (55.9% of total)
ival-sub: 41.0ms (33.2% of total)
ival-true: 6.0ms (4.9% of total)
exact: 5.0ms (4.1% of total)
ival-assert: 3.0ms (2.4% of total)
Bogosity

preprocess36.0ms (3.7%)

Memory
-21.2MiB live, 53.5MiB allocated
Algorithm
egg-herbie
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f64
80×lower-*.f32
60×lower-+.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
12211
27210
317410
425210
526510
045
065
1155
2195
3245
4285
5375
6665
71485
82325
92465
102485
02484
Stop Event
iter limit
saturated
iter limit
saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))

explain54.0ms (5.6%)

Memory
18.4MiB live, 101.5MiB allocated
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 x x)
00-0-#s(literal 1 binary64)
00-0-(-.f64 (+.f64 x x) #s(literal 1 binary64))
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
25.0ms512×0valid
Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 7.0ms
ival-sub: 4.0ms (55.3% of total)
ival-add: 3.0ms (41.5% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

eval0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated
Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

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

Compiled 6 to 4 computations (33.3% saved)

simplify16.0ms (1.7%)

Memory
-17.6MiB live, 20.5MiB allocated
Algorithm
egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(+.f64 x x)
cost-diff0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Rules
176×lower-fma.f64
176×lower-fma.f32
80×lower-*.f64
80×lower-*.f32
60×lower-+.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
11510
21910
32410
42810
53710
66610
714810
823210
924610
1024810
02489
Stop Event
iter limit
saturated
iter limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)

localize17.0ms (1.7%)

Memory
-8.7MiB live, 29.9MiB allocated
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
accuracy100.0%
(+.f64 x x)
Samples
8.0ms256×0valid
Compiler

Compiled 12 to 6 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (33.9% of total)
ival-add: 1.0ms (33.9% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series1.0ms (0.1%)

Memory
3.2MiB live, 3.2MiB allocated
Counts
2 → 24
Calls
Call 1
Inputs
#<alt (-.f64 (+.f64 x x) #s(literal 1 binary64))>
#<alt (+.f64 x x)>
Outputs
#<alt -1>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (- (* 2 x) 1)>
#<alt (* 2 x)>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* x (- 2 (/ 1 x)))>
#<alt (* 2 x)>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* -1 (* x (- (/ 1 x) 2)))>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
Calls

6 calls:

TimeVariablePointExpression
0.0ms
x
@inf
(- (+ x x) 1)
0.0ms
x
@0
(+ x x)
0.0ms
x
@0
(- (+ x x) 1)
0.0ms
x
@inf
(+ x x)
0.0ms
x
@-inf
(- (+ x x) 1)

rewrite63.0ms (6.5%)

Memory
-26.8MiB live, 75.1MiB allocated
Algorithm
batch-egg-rewrite
Rules
218×lower-fma.f64
218×lower-fma.f32
96×lower-*.f64
96×lower-*.f32
90×lower-/.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
068
1368
03037
Stop Event
iter limit
iter limit
iter limit
unsound
iter limit
Counts
2 → 69
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
(+.f64 x (+.f64 x #s(literal -1 binary64)))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (+.f64 x x))
(+.f64 (+.f64 x #s(literal -1 binary64)) x)
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (/.f64 (+.f64 x x) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(-.f64 (/.f64 (+.f64 x x) (+.f64 (+.f64 x x) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(expm1.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 (+.f64 x x) (+.f64 x x) #s(literal -1 binary64))
(fma.f64 (+.f64 x x) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (+.f64 x x) #s(literal -1 binary64))
(fma.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))) #s(literal -1 binary64))
(fma.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)) #s(literal -1 binary64))
(fma.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) #s(literal -1 binary64))
(fma.f64 #s(literal 4 binary64) (*.f64 x x) #s(literal -1 binary64))
(fma.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x #s(literal -1 binary64))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))) (+.f64 (+.f64 x x) #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64)) (+.f64 (+.f64 x x) #s(literal -1 binary64))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (+.f64 (+.f64 x x) #s(literal 1 binary64)))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (+.f64 (+.f64 x x) (-.f64 #s(literal 1 binary64) (*.f64 (+.f64 x x) #s(literal -1 binary64)))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (-.f64 (+.f64 x x) #s(literal -1 binary64)))
(/.f64 (neg.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64))) (neg.f64 (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64))) (neg.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(/.f64 (fma.f64 x (*.f64 x x) (pow.f64 (+.f64 x #s(literal -1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 (+.f64 x #s(literal -1 binary64)) (+.f64 x #s(literal -1 binary64))) (*.f64 x (+.f64 x #s(literal -1 binary64))))))
(/.f64 (-.f64 (*.f64 x x) (*.f64 (+.f64 x #s(literal -1 binary64)) (+.f64 x #s(literal -1 binary64)))) (-.f64 x (+.f64 x #s(literal -1 binary64))))
(*.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64)))))
(*.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (+.f64 (+.f64 x x) #s(literal 1 binary64))))
(*.f64 (+.f64 (+.f64 x x) #s(literal 1 binary64)) (+.f64 (+.f64 x x) #s(literal -1 binary64)))
(+.f64 x x)
(+.f64 (*.f64 (+.f64 x x) x) (*.f64 (+.f64 x x) x))
(+.f64 (*.f64 x (+.f64 x x)) (*.f64 x (+.f64 x x)))
(exp.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(fma.f64 x (+.f64 x x) (*.f64 x (+.f64 x x)))
(fma.f64 (+.f64 x x) x (*.f64 (+.f64 x x) x))
(/.f64 #s(literal 1 binary64) (+.f64 x x))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x x #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))))
(/.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (pow.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (+.f64 x x) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (+.f64 x x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (+.f64 x x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(pow.f64 (+.f64 x x) #s(literal 3 binary64))
(pow.f64 (+.f64 x x) #s(literal 2 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 (+.f64 x x) (+.f64 x x))
(*.f64 (+.f64 x x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (+.f64 x x))
(*.f64 (*.f64 (fma.f64 x x #s(literal 0 binary64)) (+.f64 x x)) (/.f64 #s(literal 1 binary64) (fma.f64 x x #s(literal 0 binary64))))
(*.f64 #s(literal 0 binary64) (/.f64 #s(literal 1 binary64) #s(literal 0 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (+.f64 x x)))
(*.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)))
(*.f64 (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)) (pow.f64 (+.f64 x x) #s(literal 3/2 binary64)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (*.f64 (+.f64 x x) #s(literal 2 binary64)) x)

simplify15.0ms (1.5%)

Memory
23.5MiB live, 23.5MiB allocated
Algorithm
egg-herbie
Rules
120×lower-fma.f64
120×lower-fma.f32
84×lower-*.f64
84×lower-*.f32
56×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
iter limit
saturated
Counts
24 → 24
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(- (* 2 x) 1)
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* x (- 2 (/ 1 x)))
(* 2 x)
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* -1 (* x (- (/ 1 x) 2)))
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(- (* 2 x) 1)
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)

eval24.0ms (2.5%)

Memory
-6.8MiB live, 32.4MiB allocated
Compiler

Compiled 882 to 165 computations (81.3% saved)

prune9.0ms (0.9%)

Memory
19.7MiB live, 19.7MiB allocated
Pruning

3 alts after pruning (2 fresh and 1 done)

PrunedKeptTotal
New91293
Fresh000
Picked011
Done000
Total91394
Accuracy
100.0%
Counts
94 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
46.0%
(*.f64 #s(literal 2 binary64) x)
54.5%
#s(literal -1 binary64)
Compiler

Compiled 12 to 9 computations (25% saved)

simplify27.0ms (2.8%)

Memory
-33.6MiB live, 6.0MiB allocated
Algorithm
egg-herbie
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
cost-diff0
(*.f64 #s(literal 2 binary64) x)
Rules
lower-*.f32
*-commutative
lower-*.f64
lift-*.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
046
056
166
066
Stop Event
iter limit
saturated
iter limit
Calls
Call 1
Inputs
#s(literal -1 binary64)
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(literal -1 binary64)
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x

localize12.0ms (1.2%)

Memory
30.6MiB live, 30.6MiB allocated
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
accuracy100.0%
(*.f64 #s(literal 2 binary64) x)
Samples
7.0ms256×0valid
Compiler

Compiled 8 to 6 computations (25% saved)

Precisions
Click to see histograms. Total time spent on operations: 2.0ms
ival-mult: 2.0ms (90.3% of total)
ival-true: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

series1.0ms (0.1%)

Memory
2.1MiB live, 2.1MiB allocated
Counts
1 → 12
Calls
Call 1
Inputs
#<alt (*.f64 #s(literal 2 binary64) x)>
Outputs
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
#<alt (* 2 x)>
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@inf
(* 2 x)
0.0ms
x
@-inf
(* 2 x)
0.0ms
x
@0
(* 2 x)

rewrite13.0ms (1.4%)

Memory
-17.7MiB live, 23.4MiB allocated
Algorithm
batch-egg-rewrite
Rules
lower-*.f32
lower-*.f64
*-commutative
lift-*.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
033
043
153
053
Stop Event
iter limit
saturated
iter limit
Counts
1 → 2
Calls
Call 1
Inputs
(*.f64 #s(literal 2 binary64) x)
Outputs
(*.f64 #s(literal 2 binary64) x)
(*.f64 x #s(literal 2 binary64))

simplify3.0ms (0.4%)

Memory
4.3MiB live, 4.3MiB allocated
Algorithm
egg-herbie
Rules
lower-*.f64
lower-*.f32
*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0336
1436
0436
Stop Event
iter limit
saturated
Counts
12 → 12
Calls
Call 1
Inputs
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
Outputs
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* 2 x)
(*.f64 #s(literal 2 binary64) x)

eval1.0ms (0.1%)

Memory
3.3MiB live, 3.3MiB allocated
Compiler

Compiled 43 to 4 computations (90.7% saved)

prune2.0ms (0.2%)

Memory
4.5MiB live, 4.5MiB allocated
Pruning

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New14014
Fresh000
Picked022
Done011
Total14317
Accuracy
100.0%
Counts
17 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
46.0%
(*.f64 #s(literal 2 binary64) x)
54.5%
#s(literal -1 binary64)
Compiler

Compiled 22 to 16 computations (27.3% saved)

regimes8.0ms (0.9%)

Memory
-20.3MiB live, 18.5MiB allocated
Counts
3 → 1
Calls
Call 1
Inputs
#s(literal -1 binary64)
(*.f64 #s(literal 2 binary64) x)
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Calls

3 calls:

3.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
3.0ms
x
2.0ms
(+.f64 x x)
Results
AccuracySegmentsBranch
100.0%1x
100.0%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
100.0%1(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

regimes5.0ms (0.5%)

Memory
13.1MiB live, 13.1MiB allocated
Counts
2 → 3
Calls
Call 1
Inputs
#s(literal -1 binary64)
(*.f64 #s(literal 2 binary64) x)
Outputs
(*.f64 #s(literal 2 binary64) x)
#s(literal -1 binary64)
(*.f64 #s(literal 2 binary64) x)
Calls

3 calls:

2.0ms
x
2.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
96.8%3x
96.8%3(-.f64 (+.f64 x x) #s(literal 1 binary64))
96.8%3(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

regimes4.0ms (0.4%)

Memory
9.6MiB live, 9.6MiB allocated
Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts
1 → 1
Calls
Call 1
Inputs
#s(literal -1 binary64)
Outputs
#s(literal -1 binary64)
Calls

3 calls:

1.0ms
(+.f64 x x)
1.0ms
x
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
54.5%1x
54.5%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
54.5%1(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

bsearch0.0ms (0%)

Memory
0.7MiB live, 0.7MiB allocated
Algorithm
left-value
Steps
TimeLeftRight
0.0ms
0.37463919862726563
279.10184118556805
0.0ms
-63.556869696084334
-0.021917194566654665
Compiler

Compiled 9 to 8 computations (11.1% saved)

simplify15.0ms (1.5%)

Memory
-25.6MiB live, 13.4MiB allocated
Algorithm
egg-herbie
Rules
*-commutative_binary64
sub-neg_binary64
+-commutative_binary64
mul-1-neg_binary64
1-exp_binary64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01325
11925
22225
32625
Stop Event
saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 (+.f64 x x) #s(literal -50 binary64)) (*.f64 #s(literal 2 binary64) x) (if (<=.f64 (+.f64 x x) #s(literal 1/2 binary64)) #s(literal -1 binary64) (*.f64 #s(literal 2 binary64) x)))
#s(literal -1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
(if (<=.f64 (+.f64 x x) #s(literal -50 binary64)) (*.f64 #s(literal 2 binary64) x) (if (<=.f64 (+.f64 x x) #s(literal 1/2 binary64)) #s(literal -1 binary64) (*.f64 #s(literal 2 binary64) x)))
(if (<=.f64 (+.f64 x x) #s(literal -50 binary64)) (*.f64 x #s(literal 2 binary64)) (if (<=.f64 (+.f64 x x) #s(literal 1/2 binary64)) #s(literal -1 binary64) (*.f64 x #s(literal 2 binary64))))
#s(literal -1 binary64)

soundness15.0ms (1.6%)

Memory
33.1MiB live, 33.1MiB allocated
Rules
120×lower-fma.f64
120×lower-fma.f32
84×lower-*.f64
84×lower-*.f32
56×lower-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
done
iter limit
saturated
Compiler

Compiled 34 to 19 computations (44.1% saved)

preprocess124.0ms (12.8%)

Memory
1.8MiB live, 81.1MiB allocated
Compiler

Compiled 64 to 32 computations (50% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...