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

Time bar (total: 1.3s)

analyze0.0ms (0%)

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 5 computations (28.6% saved)

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

sample553.0ms (43.4%)

Results
359.0ms8256×0valid
Precisions
Click to see histograms. Total time spent on operations: 150.0ms
ival-sub: 87.0ms (58% of total)
ival-add: 50.0ms (33.3% of total)
const: 10.0ms (6.7% of total)
backward-pass: 2.0ms (1.3% of total)
Bogosity

preprocess35.0ms (2.8%)

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 #s(literal -1 binary64) (*.f64 x #s(literal -2 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))

explain41.0ms (3.2%)

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

Compiled 30 to 16 computations (46.7% saved)

Precisions
Click to see histograms. Total time spent on operations: 7.0ms
ival-sub: 3.0ms (44% of total)
ival-add: 3.0ms (44% of total)
const: 1.0ms (14.7% of total)
backward-pass: 0.0ms (0% of total)

eval0.0ms (0%)

Compiler

Compiled 6 to 5 computations (16.7% saved)

prune1.0ms (0.1%)

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)

localize36.0ms (2.8%)

Algorithm
1×egg-herbie
Localize:

Found 4 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(+.f64 x x)
✓cost-diff0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓accuracy100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓accuracy100.0%
(+.f64 x x)
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 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(+ x x)
(*.f64 x #s(literal 2 binary64))
x
1
#s(literal 1 binary64)
Results
10.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 (29.4% of total)
ival-add: 1.0ms (29.4% of total)
const: 0.0ms (0% of total)
backward-pass: 0.0ms (0% of total)

series7.0ms (0.5%)

Counts
2 → 24
Calls
Call 1
Inputs
#<alt (+ x x)>
#<alt (- (+ x x) 1)>
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)>
#<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)))>
Calls

6 calls:

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

rewrite257.0ms (20.2%)

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)
(- (+ x x) 1)
Outputs
(+.f64 x x)
(+.f64 (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) x) (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) x))
(+.f64 (*.f64 x (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (*.f64 x (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))))
(exp.f64 (*.f64 (log.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #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 #s(literal 0 binary64) #s(literal 0 binary64)) (*.f64 x (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))))
(fma.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) x (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) x))
(/.f64 #s(literal 1 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))))
(/.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (+.f64 (*.f64 x x) #s(literal 0 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (pow.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal 3 binary64)) (pow.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 (*.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (+.f64 (*.f64 x x) #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal 0 binary64)) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (*.f64 #s(literal 0 binary64) (+.f64 (*.f64 x x) #s(literal 0 binary64))))
(/.f64 (neg.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (neg.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64))))
(/.f64 (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))) (+.f64 (*.f64 x x) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (+.f64 (*.f64 x x) #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal 1 binary64)) (+.f64 (*.f64 x x) #s(literal 0 binary64)))
(pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 3 binary64))
(pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 2 binary64))
(*.f64 x #s(literal 2 binary64))
(*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(*.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (*.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 #s(literal 0 binary64) #s(literal 0 binary64))))
(*.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)))
(*.f64 (pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 3/2 binary64)) (pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 3/2 binary64)))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 2 binary64)) x)
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(-.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))
(-.f64 (/.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)))))
(-.f64 (/.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))))
(fma.f64 x #s(literal 2 binary64) #s(literal -1 binary64))
(fma.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))
(fma.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))
(fma.f64 (*.f64 (+.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) (/.f64 #s(literal 1 binary64) (+.f64 (*.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 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal -1 binary64))
(fma.f64 #s(literal 8 binary64) (*.f64 x (*.f64 x x)) #s(literal -1 binary64))
(fma.f64 (pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 3/2 binary64)) (pow.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #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 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 2 binary64)) x #s(literal -1 binary64))
(expm1.f64 (*.f64 (log.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64))) #s(literal 3 binary64)))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))))
(/.f64 #s(literal 1 binary64) (/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))))
(/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))))
(/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)))
(/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (-.f64 #s(literal 1 binary64) (*.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)))))
(/.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (-.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)))
(/.f64 (neg.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))) (neg.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64))) (neg.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))))
(/.f64 (+.f64 (*.f64 x (*.f64 x x)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (+.f64 (*.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 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)))))
(*.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)) (/.f64 #s(literal 1 binary64) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64))))
(*.f64 (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal 1 binary64)) (+.f64 (/.f64 #s(literal 0 binary64) #s(literal 0 binary64)) #s(literal -1 binary64)))

simplify117.0ms (9.2%)

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
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
(* 2 x)
-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)))
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)
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(- (* 2 x) 1)
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(- (* 2 x) 1)
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* x (- 2 (/ 1 x)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* x (- 2 (/ 1 x)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* -1 (* x (- (/ 1 x) 2)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* -1 (* x (- (/ 1 x) 2)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))
(* -1 (* x (- (/ 1 x) 2)))
(-.f64 #s(literal -1 binary64) (*.f64 x #s(literal -2 binary64)))

eval13.0ms (1%)

Compiler

Compiled 925 to 760 computations (17.8% saved)

prune76.0ms (5.9%)

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))
▶49.2%
(*.f64 #s(literal 2 binary64) x)
▶53.3%
#s(literal -1 binary64)
Compiler

Compiled 12 to 9 computations (25% saved)

localize57.0ms (4.5%)

Algorithm
1×egg-herbie
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
✓cost-diff0
(*.f64 #s(literal 2 binary64) x)
✓accuracy100.0%
(*.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
Results
10.0ms256×0valid
Compiler

Compiled 8 to 6 computations (25% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-mult: 2.0ms (71.6% of total)
const: 1.0ms (35.8% of total)
backward-pass: 0.0ms (0% of total)

series2.0ms (0.1%)

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)

rewrite7.0ms (0.6%)

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))

simplify4.0ms (0.3%)

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)

eval4.0ms (0.3%)

Compiler

Compiled 43 to 29 computations (32.6% saved)

prune2.0ms (0.1%)

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))
✓49.2%
(*.f64 #s(literal 2 binary64) x)
✓53.3%
#s(literal -1 binary64)
Compiler

Compiled 22 to 16 computations (27.3% saved)

regimes5.0ms (0.4%)

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
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)

regimes9.0ms (0.7%)

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

1 calls:

8.0ms
x
Results
AccuracySegmentsBranch
98.8%3x
Compiler

Compiled 2 to 1 computations (50% saved)

regimes1.0ms (0.1%)

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

1 calls:

0.0ms
x
Results
AccuracySegmentsBranch
53.3%1x
Compiler

Compiled 2 to 1 computations (50% saved)

bsearch23.0ms (1.8%)

Algorithm
2×binary-search
Stop Event
1×narrow-enough
1×narrow-enough
Steps
TimeLeftRight
11.0ms
5.3120756705431217e-11
9.378220345140293e+22
9.0ms
-40.82526496323151
-5.645364922096082e-8
Results
10.0ms320×0valid
Compiler

Compiled 170 to 147 computations (13.5% saved)

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

soundness1.0ms (0%)

Stop Event
1×done
Compiler

Compiled 22 to 16 computations (27.3% saved)

preprocess25.0ms (2%)

Compiler

Compiled 56 to 40 computations (28.6% saved)

end0.0ms (0%)

Profiling

Loading profile data...