FastMath test2

Time bar (total: 2.3s)

analyze14.0ms (0.6%)

Memory
4.1MiB live, 4.1MiB allocated
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%99.9%0.1%0%0%0%0
100%99.9%0%0.1%0%0%0%1
Compiler

Compiled 27 to 21 computations (22.2% saved)

sample2.1s (91%)

Memory
-9.9MiB live, 627.2MiB allocated
Samples
507.0ms8 141×0valid-sollya
394.0ms8 141×0valid-baseline
360.0ms8 141×0valid-rival
14.0ms64×2valid-baseline
8.0ms64×2valid-rival
8.0ms51×1valid-baseline
4.0ms51×1valid-rival
4.0ms64×2valid-sollya
3.0ms51×1valid-sollya
Bogosity

preprocess170.0ms (7.3%)

Memory
4.4MiB live, 20.3MiB allocated
Algorithm
1×egg-herbie
Rules
1 024×fmm-def
561×fma-define
131×unsub-neg
122×cancel-sign-sub-inv
114×distribute-rgt-in
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
032258
193183
2291141
3870133
42080133
53117133
63822133
73852133
83852133
94034133
104034133
Stop Event
1×saturated
Calls
Call 1
Inputs
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (+.f64 (*.f64 (neg.f64 d1) #s(literal 10 binary64)) (*.f64 (neg.f64 d1) d2)) (*.f64 (neg.f64 d1) #s(literal 20 binary64)))
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 (neg.f64 d2))) (*.f64 d1 #s(literal 20 binary64)))
(neg.f64 (+.f64 (+.f64 (*.f64 (neg.f64 d1) #s(literal 10 binary64)) (*.f64 (neg.f64 d1) d2)) (*.f64 (neg.f64 d1) #s(literal 20 binary64))))
(neg.f64 (+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 (neg.f64 d2))) (*.f64 d1 #s(literal 20 binary64))))
(+.f64 (+.f64 (*.f64 d2 #s(literal 10 binary64)) (*.f64 d2 d1)) (*.f64 d2 #s(literal 20 binary64)))
Outputs
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (*.f64 d1 (+.f64 #s(literal 10 binary64) d2)) (*.f64 d1 #s(literal 20 binary64)))
(*.f64 d1 (+.f64 #s(literal 20 binary64) (+.f64 #s(literal 10 binary64) d2)))
(*.f64 d1 (+.f64 d2 #s(literal 30 binary64)))
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (*.f64 d1 (+.f64 #s(literal 10 binary64) d2)) (*.f64 d1 #s(literal 20 binary64)))
(*.f64 d1 (+.f64 #s(literal 20 binary64) (+.f64 #s(literal 10 binary64) d2)))
(*.f64 d1 (+.f64 d2 #s(literal 30 binary64)))
(+.f64 (+.f64 (*.f64 (neg.f64 d1) #s(literal 10 binary64)) (*.f64 (neg.f64 d1) d2)) (*.f64 (neg.f64 d1) #s(literal 20 binary64)))
(+.f64 (*.f64 (neg.f64 d1) (+.f64 #s(literal 10 binary64) d2)) (*.f64 #s(literal 20 binary64) (neg.f64 d1)))
(*.f64 (neg.f64 d1) (+.f64 #s(literal 20 binary64) (+.f64 #s(literal 10 binary64) d2)))
(neg.f64 (*.f64 d1 (+.f64 d2 #s(literal 30 binary64))))
(*.f64 d1 (-.f64 #s(literal -30 binary64) d2))
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 (neg.f64 d2))) (*.f64 d1 #s(literal 20 binary64)))
(+.f64 (*.f64 d1 #s(literal 20 binary64)) (*.f64 d1 (+.f64 #s(literal 10 binary64) (neg.f64 d2))))
(*.f64 d1 (+.f64 #s(literal 20 binary64) (-.f64 #s(literal 10 binary64) d2)))
(*.f64 d1 (-.f64 #s(literal 30 binary64) d2))
(neg.f64 (+.f64 (+.f64 (*.f64 (neg.f64 d1) #s(literal 10 binary64)) (*.f64 (neg.f64 d1) d2)) (*.f64 (neg.f64 d1) #s(literal 20 binary64))))
(+.f64 (*.f64 d1 (+.f64 #s(literal 10 binary64) d2)) (*.f64 d1 #s(literal 20 binary64)))
(*.f64 d1 (+.f64 #s(literal 20 binary64) (+.f64 #s(literal 10 binary64) d2)))
(*.f64 d1 (+.f64 d2 #s(literal 30 binary64)))
(neg.f64 (+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 (neg.f64 d2))) (*.f64 d1 #s(literal 20 binary64))))
(neg.f64 (+.f64 (*.f64 d1 #s(literal 20 binary64)) (*.f64 d1 (+.f64 #s(literal 10 binary64) (neg.f64 d2)))))
(neg.f64 (*.f64 d1 (+.f64 #s(literal 20 binary64) (-.f64 #s(literal 10 binary64) d2))))
(*.f64 d1 (neg.f64 (-.f64 #s(literal 30 binary64) d2)))
(*.f64 d1 (+.f64 d2 #s(literal -30 binary64)))
(+.f64 (+.f64 (*.f64 d2 #s(literal 10 binary64)) (*.f64 d2 d1)) (*.f64 d2 #s(literal 20 binary64)))
(+.f64 (*.f64 d2 (+.f64 #s(literal 10 binary64) d1)) (*.f64 d2 #s(literal 20 binary64)))
(*.f64 d2 (+.f64 (+.f64 d1 #s(literal 10 binary64)) #s(literal 20 binary64)))
(*.f64 d2 (+.f64 d1 #s(literal 30 binary64)))
Symmetry

(negabs d1)

Compiler

Compiled 13 to 9 computations (30.8% saved)

eval0.0ms (0%)

Memory
0.2MiB live, 0.2MiB allocated
Compiler

Compiled 2 to 2 computations (0% saved)

prune1.0ms (0%)

Memory
0.9MiB live, 0.9MiB allocated
Alt Table
Click to see full alt table
StatusAccuracyProgram
99.3%
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
Compiler

Compiled 26 to 18 computations (30.8% saved)

simplify2.0ms (0.1%)

Memory
0.3MiB live, 0.3MiB allocated
Algorithm
1×egg-herbie
Rules
3×*-commutative
2×+-commutative
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01443
11943
Stop Event
1×saturated
Calls
Call 1
Inputs
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))
Outputs
(+.f64 (+.f64 (*.f64 d1 #s(literal 10 binary64)) (*.f64 d1 d2)) (*.f64 d1 #s(literal 20 binary64)))

soundness0.0ms (0%)

Memory
0.4MiB live, 0.4MiB allocated
Stop Event
1×fuel
Compiler

Compiled 13 to 9 computations (30.8% saved)

preprocess25.0ms (1.1%)

Memory
1.4MiB live, 32.7MiB allocated
Remove

(negabs d1)

Compiler

Compiled 118 to 82 computations (30.5% saved)

end0.0ms (0%)

Memory
0.0MiB live, 0.0MiB allocated

Profiling

Loading profile data...