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

Time bar (total: 1.0s)

analyze0.0ms (0%)

Memory
0.4MiB live, 0.4MiB 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)

sample419.0ms (40.9%)

Memory
31.9MiB live, 667.8MiB allocated
Samples
271.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 99.0ms
ival-sub: 47.0ms (47.3% of total)
ival-add: 40.0ms (40.2% of total)
ival-true: 5.0ms (5% of total)
exact: 5.0ms (5% of total)
ival-assert: 3.0ms (3% of total)
Bogosity

preprocess29.0ms (2.8%)

Memory
-1.0MiB live, 40.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)
(fma.f64 x #s(literal 2 binary64) #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 (4.9%)

Memory
-21.3MiB live, 91.6MiB 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
16.0ms512×0valid
Compiler

Compiled 36 to 20 computations (44.4% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-add: 3.0ms (50.3% of total)
ival-sub: 2.0ms (33.6% 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)

simplify12.0ms (1.1%)

Memory
22.5MiB live, 22.5MiB 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)
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(+ x x)
(+.f64 x x)
x
1
#s(literal 1 binary64)

localize17.0ms (1.6%)

Memory
-14.9MiB live, 28.3MiB 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.6% of total)
ival-add: 1.0ms (33.6% 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.9MiB live, 2.9MiB 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)

rewrite59.0ms (5.7%)

Memory
17.5MiB live, 92.5MiB 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) (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)))))
(-.f64 (/.f64 (+.f64 x x) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) #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 (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64))) (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)) (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))))
(/.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64))))
(/.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)))
(/.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (fma.f64 x #s(literal 2 binary64) (-.f64 #s(literal 1 binary64) (*.f64 (+.f64 x x) #s(literal -1 binary64)))))
(/.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (-.f64 (+.f64 x x) #s(literal -1 binary64)))
(/.f64 (neg.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))) (neg.f64 (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))) (neg.f64 (fma.f64 x #s(literal 2 binary64) #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 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)))))
(*.f64 (fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64))))
(*.f64 (fma.f64 x #s(literal 2 binary64) #s(literal 1 binary64)) (fma.f64 x #s(literal 2 binary64) #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)

simplify17.0ms (1.6%)

Memory
-18.2MiB live, 20.1MiB 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)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 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))
(* x (- 2 (/ 1 x)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 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))
(* -1 (* x (- (/ 1 x) 2)))
(fma.f64 #s(literal 2 binary64) x #s(literal -1 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))
(* 2 x)
(fma.f64 #s(literal 2 binary64) x #s(literal 0 binary64))

eval9.0ms (0.9%)

Memory
17.1MiB live, 17.1MiB allocated
Compiler

Compiled 871 to 167 computations (80.8% saved)

prune201.0ms (19.7%)

Memory
-19.5MiB live, 23.9MiB allocated
Pruning

2 alts after pruning (1 fresh and 1 done)

PrunedKeptTotal
New92193
Fresh000
Picked011
Done000
Total92294
Accuracy
100.0%
Counts
94 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶53.1%
#s(literal -1 binary64)
Compiler

Compiled 8 to 6 computations (25% saved)

simplify3.0ms (0.3%)

Memory
5.6MiB live, 5.6MiB allocated
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
011
011
Stop Event
1×saturated
1×saturated
Calls
Call 1
Inputs
-1
Outputs
-1
#s(literal -1 binary64)

localize6.0ms (0.6%)

Memory
11.6MiB live, 11.6MiB allocated
Samples
4.0ms256×0valid
Compiler

Compiled 3 to 4 computations (-33.3% saved)

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

series0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

rewrite105.0ms (10.3%)

Memory
-29.3MiB live, 10.0MiB allocated
Algorithm
1×batch-egg-rewrite
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
000
000
Stop Event
1×saturated
1×saturated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

simplify3.0ms (0.3%)

Memory
3.4MiB live, 3.4MiB allocated
Algorithm
1×egg-herbie
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
000
000
Stop Event
1×saturated
1×saturated
Counts
0 → 0
Calls
Call 1
Inputs
Outputs

eval0.0ms (0%)

Memory
0.3MiB live, 0.3MiB allocated
Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0.1%)

Memory
2.8MiB live, 2.8MiB allocated
Pruning

2 alts after pruning (0 fresh and 2 done)

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

Compiled 15 to 11 computations (26.7% saved)

regimes5.0ms (0.5%)

Memory
9.0MiB live, 9.0MiB allocated
Counts
2 → 1
Calls
Call 1
Inputs
#s(literal -1 binary64)
(-.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)
1.0ms
x
1.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)

regimes4.0ms (0.4%)

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

Compiled 12 to 7 computations (41.7% saved)

simplify7.0ms (0.6%)

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

Useful iterations: 0 (0.0ms)

IterNodesCost
056
1106
2136
3166
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
#s(literal -1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 (+.f64 x x) #s(literal -1 binary64))
#s(literal -1 binary64)

soundness54.0ms (5.3%)

Memory
-30.3MiB live, 9.1MiB 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 9 to 6 computations (33.3% saved)

preprocess22.0ms (2.2%)

Memory
17.3MiB live, 53.2MiB allocated
Compiler

Compiled 26 to 16 computations (38.5% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...