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

Time bar (total: 971.0ms)

analyze0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated
Algorithm
1×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)

sample524.0ms (53.9%)

Memory
13.9MiB live, 519.2MiB allocated
Samples
296.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 114.0ms
ival-add: 63.0ms (55.4% of total)
ival-sub: 39.0ms (34.3% of total)
ival-true: 5.0ms (4.4% of total)
exact: 5.0ms (4.4% of total)
ival-assert: 3.0ms (2.6% of total)
Bogosity

preprocess31.0ms (3.2%)

Memory
0.6MiB live, 38.1MiB allocated
Algorithm
2×egg-herbie
Rules
176×accelerator-lowering-fma.f32
176×accelerator-lowering-fma.f64
84×sub-neg
80×*-lowering-*.f32
80×*-lowering-*.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0818
12716
28015
317515
428015
533215
635515
735815
045
1135
2175
3225
4265
5355
6645
71465
82275
92415
102435
02434
Stop Event
1×iter limit
1×saturated
1×saturated
Calls
Call 1
Inputs
(- (+ x x) 1)
Outputs
(- (+ x x) 1)
(+.f64 x (+.f64 x #s(literal -1 binary64)))
Call 2
Inputs
(- (+ x x) 1)
(- (+ (neg x) (neg x)) 1)
(neg (- (+ (neg x) (neg x)) 1))
Outputs
(- (+ x x) 1)
(+ x (+ x -1))
(- (+ (neg x) (neg x)) 1)
(+ (* x -2) -1)
(neg (- (+ (neg x) (neg x)) 1))
(+ x (+ x 1))

explain50.0ms (5.1%)

Memory
5.9MiB live, 92.1MiB 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
17.0ms512×0valid
Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 8.0ms
ival-add: 4.0ms (52.6% of total)
ival-sub: 2.0ms (26.3% 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.4MiB live, 0.4MiB 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)

simplify15.0ms (1.5%)

Memory
-11.8MiB live, 25.4MiB allocated
Algorithm
1×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×accelerator-lowering-fma.f32
176×accelerator-lowering-fma.f64
80×*-lowering-*.f32
80×*-lowering-*.f64
60×+-lowering-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
11310
21710
32210
42610
53510
66410
714610
822710
924110
1024310
02439
Stop Event
1×iter limit
1×saturated
Calls
Call 1
Inputs
(- (+ x x) 1)
(+ x x)
x
1
Outputs
(- (+ x x) 1)
(+.f64 x (+.f64 x #s(literal -1 binary64)))
(+ x x)
(+.f64 x x)
x
1
#s(literal 1 binary64)

localize14.0ms (1.5%)

Memory
-3.7MiB live, 35.1MiB allocated
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓accuracy100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓accuracy100.0%
(+.f64 x x)
Samples
7.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 (36.1% of total)
ival-add: 1.0ms (36.1% 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.6MiB live, 3.6MiB allocated
Counts
2 → 24
Calls
Call 1
Inputs
#<alt (- (+ x x) 1)>
#<alt (+ 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)

rewrite134.0ms (13.8%)

Memory
9.4MiB live, 93.6MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
218×accelerator-lowering-fma.f32
218×accelerator-lowering-fma.f64
96×*-lowering-*.f32
96×*-lowering-*.f64
90×/-lowering-/.f32
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
1348
03017
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
Counts
2 → 69
Calls
Call 1
Inputs
(- (+ x x) 1)
(+ 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) (+.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64))))) (/.f64 #s(literal 1 binary64) (+.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64))))))
(-.f64 (/.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 x (+.f64 x #s(literal 1 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))
(expm1.f64 (*.f64 (log.f64 (+.f64 x x)) #s(literal 3 binary64)))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64)))) (+.f64 (+.f64 x x) #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 x (+.f64 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 x (+.f64 x #s(literal 1 binary64)))))
(/.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (+.f64 x (+.f64 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 (+.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64))) (neg.f64 (+.f64 x (+.f64 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) (+.f64 (+.f64 x x) (+.f64 x (+.f64 x #s(literal 1 binary64))))))
(*.f64 (+.f64 (+.f64 x x) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (+.f64 x (+.f64 x #s(literal 1 binary64)))))
(*.f64 (+.f64 x (+.f64 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
-6.3MiB live, 32.2MiB allocated
Algorithm
1×egg-herbie
Rules
120×accelerator-lowering-fma.f32
120×accelerator-lowering-fma.f64
84×*-lowering-*.f32
84×*-lowering-*.f64
56×+-lowering-+.f64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01288
12888
26388
311888
413288
518688
622788
725288
826788
927388
1027488
027479
Stop Event
1×iter limit
1×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)

eval9.0ms (1%)

Memory
23.4MiB live, 23.4MiB allocated
Compiler

Compiled 888 to 166 computations (81.3% saved)

prune26.0ms (2.7%)

Memory
-11.7MiB live, 26.5MiB 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))
▶52.2%
(*.f64 #s(literal 2 binary64) x)
▶48.9%
#s(literal -1 binary64)
Compiler

Compiled 12 to 9 computations (25% saved)

simplify3.0ms (0.4%)

Memory
8.1MiB live, 8.1MiB allocated
Algorithm
1×egg-herbie
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(*.f64 #s(literal 2 binary64) x)
Rules
4×*-lowering-*.f32
4×*-lowering-*.f64
2×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

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

localize37.0ms (3.8%)

Memory
-17.9MiB live, 25.6MiB allocated
Localize:

Found 1 expressions of interest:

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

Compiled 8 to 6 computations (25% saved)

Precisions
Click to see histograms. Total time spent on operations: 26.0ms
ival-mult: 25.0ms (97.1% 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
1.3MiB live, 1.3MiB allocated
Counts
1 → 12
Calls
Call 1
Inputs
#<alt (* 2 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)

rewrite8.0ms (0.8%)

Memory
12.5MiB live, 12.5MiB allocated
Algorithm
1×batch-egg-rewrite
Rules
4×*-lowering-*.f32
4×*-lowering-*.f64
2×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

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

simplify3.0ms (0.4%)

Memory
6.1MiB live, 6.1MiB allocated
Algorithm
1×egg-herbie
Rules
4×*-lowering-*.f32
4×*-lowering-*.f64
2×*-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0336
1436
0436
Stop Event
1×iter limit
1×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.2%)

Memory
3.0MiB live, 3.0MiB allocated
Compiler

Compiled 43 to 4 computations (90.7% saved)

prune17.0ms (1.8%)

Memory
-34.0MiB live, 5.6MiB 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))
✓52.2%
(*.f64 #s(literal 2 binary64) x)
✓48.9%
#s(literal -1 binary64)
Compiler

Compiled 22 to 16 computations (27.3% saved)

regimes6.0ms (0.6%)

Memory
11.1MiB live, 11.1MiB 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:

2.0ms
(+.f64 x x)
2.0ms
x
2.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
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
9.8MiB live, 9.8MiB 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:

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

Compiled 12 to 7 computations (41.7% saved)

regimes4.0ms (0.4%)

Memory
8.8MiB live, 8.8MiB 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
48.9%1x
48.9%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
48.9%1(+.f64 x x)
Compiler

Compiled 12 to 7 computations (41.7% saved)

bsearch0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated
Algorithm
2×left-value
Steps
TimeLeftRight
0.0ms
0.4313690936538674
1.3745219813495098
0.0ms
-2.8078656676047062
-5.492699374952345e-9
Compiler

Compiled 9 to 8 computations (11.1% saved)

simplify25.0ms (2.6%)

Memory
-21.5MiB live, 17.8MiB allocated
Algorithm
1×egg-herbie
Rules
4×*-commutative_binary64
4×sub-neg_binary64
2×+-commutative_binary64
2×mul-1-neg_binary64
2×1-exp_binary64
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01323
12223
22523
33023
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 (+.f64 x x) #s(literal -2 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 -2 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 -2 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
19.4MiB live, 19.4MiB allocated
Rules
120×accelerator-lowering-fma.f32
120×accelerator-lowering-fma.f64
84×*-lowering-*.f32
84×*-lowering-*.f64
56×+-lowering-+.f64
Iterations

Useful iterations: 0 (0.0ms)

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

Compiled 34 to 19 computations (44.1% saved)

preprocess26.0ms (2.6%)

Memory
9.4MiB live, 48.1MiB allocated
Compiler

Compiled 64 to 32 computations (50% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...