; Automatically generated by map2smt (set-logic HORN) (declare-datatypes ((listOfInt 0) ) (((cons-listOfInt (head-listOfInt Int) (tail-listOfInt listOfInt)) (nil-listOfInt)))) (declare-fun adt_new1 (listOfInt listOfInt Bool) Bool) (declare-fun leq (Int Int Bool) Bool) (declare-fun minus (Int Int Int) Bool) (declare-fun drop (Int listOfInt listOfInt) Bool) (declare-fun take (Int listOfInt listOfInt) Bool) (declare-fun ff () Bool) (assert (forall ( (A Int) (B listOfInt) (C Bool) ) (=> (= C false) (adt_new1 nil-listOfInt (cons-listOfInt A B) C) ) ) ) (assert (forall ( (A Int) (B listOfInt) (C Bool) ) (=> (= C false) (adt_new1 (cons-listOfInt A B) nil-listOfInt C) ) ) ) (assert (forall ( (A Bool) ) (=> (= A true) (adt_new1 nil-listOfInt nil-listOfInt A) ) ) ) (assert (forall ( (A Int) (B listOfInt) (C Int) (D listOfInt) (E Bool) ) (=> (and (= E false) (>= (- C A) 1) ) (adt_new1 (cons-listOfInt A B) (cons-listOfInt C D) E) ) ) ) (assert (forall ( (A Int) (B listOfInt) (C Int) (D listOfInt) (E Bool) ) (=> (and (= E false) (<= (- C A) (- 1)) ) (adt_new1 (cons-listOfInt A B) (cons-listOfInt C D) E) ) ) ) (assert (forall ( (A Int) (B listOfInt) (C listOfInt) (D Bool) ) (=> (adt_new1 B C D) (adt_new1 (cons-listOfInt A B) (cons-listOfInt A C) D) ) ) ) (assert (forall ( (A Int) (B Int) (C Int) ) (=> (and (= C 0) (>= A 0) (>= (- B A) 1) ) (minus A B C) ) ) ) (assert (forall ( (A Int) (B Int) (C Int) ) (=> (and (= C (- A B)) (<= B A) (>= A 0) ) (minus A B C) ) ) ) (assert (forall ( (A Int) ) (drop A nil-listOfInt nil-listOfInt) ) ) (assert (forall ( (A Int) (B listOfInt) ) (=> (= A 0) (drop A B B) ) ) ) (assert (forall ( (A Int) (B Int) (C listOfInt) (D listOfInt) (E Int) ) (=> (and (= A (+ 1 E)) (>= E 0) (drop E C D) ) (drop A (cons-listOfInt B C) D) ) ) ) (assert (forall ( (A Int) ) (take A nil-listOfInt nil-listOfInt) ) ) (assert (forall ( (A Int) (B listOfInt) ) (=> (= A 0) (take A B nil-listOfInt) ) ) ) (assert (forall ( (A Int) (B Int) (C listOfInt) (D listOfInt) (E Int) ) (=> (and (= A (+ 1 E)) (>= E 0) (take E C D) ) (take A (cons-listOfInt B C) (cons-listOfInt B D)) ) ) ) (assert (forall ( (A Bool) (B Int) (C Int) (D Int) (E listOfInt) (F listOfInt) (G listOfInt) (H listOfInt) (I listOfInt) ) (=> (and (= A false) (>= B 0) (>= C 0) (= D (- C B)) (>= D 0) (take C E F) (drop B F G) (drop B E H) (take D H I) (adt_new1 G I A) ) ff ) ) ) (assert (forall ( (A Bool) (B Int) (C Int) (D Int) (E listOfInt) (F listOfInt) (G listOfInt) (H listOfInt) (I listOfInt) ) (=> (and (= A false) (>= B 0) (>= C 0) (= D 0) (<= C (- B 1)) (take C E F) (drop B F G) (drop B E H) (take D H I) (adt_new1 G I A) ) ff ) ) ) (assert (not ff)) (check-sat)