from util import *


@apply
def apply(inter0, inter1):
    p0, q0 = inter0.of(Infer)
    p1, q1 = inter1.of(Infer)
    assert p0 | p1
    return p0 & q0 | p1 & q1


@prove
def prove(Eq):
    from axiom import algebra

    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)

    Eq << Or(a > b, a <= b, plausible=True)

    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


if __name__ == '__main__':
    run()
# created on 2022-04-01

09a6a132651156b16ace0d537895cd4a8a856510
<mask token>


@prove
def prove(Eq):
    from axiom import algebra
    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)
    Eq << Or(a > b, a <= b, plausible=True)
    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


<mask token>

<mask token>


@apply
def apply(inter0, inter1):
    p0, q0 = inter0.of(Infer)
    p1, q1 = inter1.of(Infer)
    assert p0 | p1
    return p0 & q0 | p1 & q1


@prove
def prove(Eq):
    from axiom import algebra
    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)
    Eq << Or(a > b, a <= b, plausible=True)
    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


<mask token>

<mask token>


@apply
def apply(inter0, inter1):
    p0, q0 = inter0.of(Infer)
    p1, q1 = inter1.of(Infer)
    assert p0 | p1
    return p0 & q0 | p1 & q1


@prove
def prove(Eq):
    from axiom import algebra
    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)
    Eq << Or(a > b, a <= b, plausible=True)
    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


if __name__ == '__main__':
    run()

from util import *


@apply
def apply(inter0, inter1):
    p0, q0 = inter0.of(Infer)
    p1, q1 = inter1.of(Infer)
    assert p0 | p1
    return p0 & q0 | p1 & q1


@prove
def prove(Eq):
    from axiom import algebra
    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)
    Eq << Or(a > b, a <= b, plausible=True)
    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


if __name__ == '__main__':
    run()

from util import *


@apply
def apply(inter0, inter1):
    p0, q0 = inter0.of(Infer)
    p1, q1 = inter1.of(Infer)
    assert p0 | p1
    return p0 & q0 | p1 & q1


@prove
def prove(Eq):
    from axiom import algebra

    p0, q0, p1, q1 = Symbol(bool=True)
    a, b = Symbol(integer=True)
    Eq << apply((a > b) >> q0, (a <= b) >> q1)

    Eq << Or(a > b, a <= b, plausible=True)

    Eq << algebra.ou.infer.infer.imply.ou.apply(Eq[-1], Eq[0], Eq[1])


if __name__ == '__main__':
    run()
# created on 2022-04-01
