; Automatically generated by map2smt

(set-logic HORN)

(declare-datatypes ((listOfInt 0) )
(((cons-listOfInt (head-listOfInt Int) (tail-listOfInt listOfInt)) (nil-listOfInt))))
(declare-datatypes ((queueOfInt 0) )
(((queue-queueOfInt (front-queueOfInt listOfInt) (back-queueOfInt listOfInt)) )))



(declare-fun adt_new1 (listOfInt Bool) Bool)
(declare-fun qreva (listOfInt listOfInt listOfInt) Bool)
(declare-fun queuetolst (queueOfInt listOfInt) Bool)
(declare-fun qrev (listOfInt listOfInt) Bool)
(declare-fun append (listOfInt listOfInt listOfInt) Bool)
(declare-fun qlen (queueOfInt Int) Bool)
(declare-fun len (listOfInt Int) Bool)
(declare-fun plus (Int Int Int) Bool)
(declare-fun isamortized (queueOfInt Bool) Bool)
(declare-fun leq (Int Int Bool) Bool)
(declare-fun less (Int Int Bool) Bool)
(declare-fun amortizequeue (listOfInt listOfInt queueOfInt) Bool)
(declare-fun enqueue (queueOfInt Int queueOfInt) Bool)
(declare-fun butlast (listOfInt listOfInt) Bool)
(declare-fun qpop (queueOfInt queueOfInt) Bool)
(declare-fun ff () Bool)

(assert
  (forall ( (A Int) (B listOfInt) (C Bool) )
    (=>
      (= C false)
      (adt_new1 (cons-listOfInt A B) C)
    )
  )
)
(assert
  (forall ( (A Bool) )
    (=>
      (= A true)
      (adt_new1 nil-listOfInt A)
    )
  )
)
(assert
  (forall ( (A listOfInt) )
    (qreva nil-listOfInt A A)
  )
)
(assert
  (forall ( (A Int) (B listOfInt) (C listOfInt) (D listOfInt) )
    (=>
      (qreva B (cons-listOfInt A C) D)
      (qreva (cons-listOfInt A B) C D)
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C listOfInt) (D listOfInt) )
    (=>
      (and
        (qrev B D)
        (append A D C)
      )
      (queuetolst (queue-queueOfInt A B)  C)
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C Int) (D Int) (E Int) )
    (=>
      (and
        (len A D)
        (len B E)
        (plus D E C)
      )
      (qlen (queue-queueOfInt A B)  C)
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C Bool) (D Int) (E Int) )
    (=>
      (and
        (len B D)
        (len A E)
        (leq D E C)
      )
      (isamortized (queue-queueOfInt A B)  C)
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) )
    (=>
      (qreva A nil-listOfInt B)
      (qrev A B)
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C Bool) (D Int) (E Int) )
    (=>
      (and
        (= C true)
        (leq D E C)
        (len A E)
        (len B D)
      )
      (amortizequeue A B (queue-queueOfInt A B) )
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C listOfInt) (D Bool) (E Int) (F Int) (G listOfInt) )
    (=>
      (and
        (= D false)
        (leq E F D)
        (len A F)
        (len B E)
        (append A G C)
        (qrev B G)
      )
      (amortizequeue A B (queue-queueOfInt C nil-listOfInt) )
    )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) (C Int) (D queueOfInt) )
    (=>
      (amortizequeue A (cons-listOfInt C B) D)
      (enqueue (queue-queueOfInt A B)  C D)
    )
  )
)
(assert
    (butlast nil-listOfInt nil-listOfInt)
)
(assert
  (forall ( (A Int) )
    (butlast (cons-listOfInt A nil-listOfInt) nil-listOfInt)
  )
)
(assert
  (forall ( (A Int) (B Int) (C listOfInt) (D listOfInt) )
    (=>
      (butlast (cons-listOfInt B C) D)
      (butlast (cons-listOfInt A (cons-listOfInt B C)) (cons-listOfInt A D))
    )
  )
)
(assert
  (forall ( (A listOfInt) (B Int) (C listOfInt) )
    (qpop (queue-queueOfInt A (cons-listOfInt B C))  (queue-queueOfInt A C) )
  )
)
(assert
  (forall ( (A listOfInt) (B listOfInt) )
    (=>
      (butlast A B)
      (qpop (queue-queueOfInt A nil-listOfInt)  (queue-queueOfInt B nil-listOfInt) )
    )
  )
)
(assert
  (forall ( (A Int) )
    (=>
      (= A 0)
      (len nil-listOfInt A)
    )
  )
)
(assert
  (forall ( (A Int) (B listOfInt) (C Int) (D Int) )
    (=>
      (and
        (= C (+ 1 D))
        (len B D)
      )
      (len (cons-listOfInt A B) C)
    )
  )
)
(assert
  (forall ( (A listOfInt) )
    (append nil-listOfInt A A)
  )
)
(assert
  (forall ( (A Int) (B listOfInt) (C listOfInt) (D listOfInt) )
    (=>
      (append B C D)
      (append (cons-listOfInt A B) C (cons-listOfInt A D))
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C Int) )
    (=>
      (and
        (= C (+ A B))
        (>= A 0)
        (>= B 0)
      )
      (plus A B C)
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C Bool) )
    (=>
      (and
        (<= A B)
        (= C true)
      )
      (leq A B C)
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C Bool) )
    (=>
      (and
        (>= A (+ B 1))
        (= C false)
      )
      (leq A B C)
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C Bool) )
    (=>
      (and
        (<= A (- B 1))
        (= C true)
      )
      (less A B C)
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C Bool) )
    (=>
      (and
        (>= A B)
        (= C false)
      )
      (less A B C)
    )
  )
)
(assert
  (forall ( (A Int) (B Int) (C listOfInt) (D listOfInt) )
    (=>
      (and
        (= (- A B) 0)
        (qrev C D)
        (len D B)
        (len C A)
      )
      ff
    )
  )
)

(assert (not ff))
(check-sat)