sbv-13.0: SBVTestSuite/GoldFiles/lambda86.gold
** Calling: z3 -nw -in -smt2
[GOOD] ; Automatically generated by SBV. Do not edit.
[GOOD] (set-option :print-success true)
[GOOD] (set-option :global-declarations true)
[GOOD] (set-option :smtlib2_compliant true)
[GOOD] (set-option :diagnostic-output-channel "stdout")
[GOOD] (set-option :produce-models true)
[GOOD] (set-option :pp.max_depth 4294967295)
[GOOD] (set-option :pp.min_alias_size 4294967295)
[GOOD] (set-option :model.inline_def true )
[GOOD] (set-logic ALL) ; has unbounded values, using catch-all.
[GOOD] ; --- tuples ---
[GOOD] (declare-datatypes ((SBVTuple2 2)) ((par (T1 T2)
((mkSBVTuple2 (proj_1_SBVTuple2 T1)
(proj_2_SBVTuple2 T2))))))
[GOOD] ; --- sums ---
[GOOD] ; --- literal constants ---
[GOOD] (define-fun s2 () (Seq Int) (seq.++ (seq.unit 1) (seq.unit 2) (seq.unit 3) (seq.unit 4) (seq.unit 5) (seq.unit 6) (seq.unit 7) (seq.unit 8) (seq.unit 9) (seq.unit 10)))
[GOOD] ; --- top level inputs ---
[GOOD] (declare-fun s0 () (Seq Int))
[GOOD] (declare-fun s1 () (SBVTuple2 (Seq Int) (Seq Int)))
[GOOD] ; --- constant tables ---
[GOOD] ; --- non-constant tables ---
[GOOD] ; --- uninterpreted constants ---
[GOOD] ; --- user defined functions ---
[GOOD] ; |sbv.partition @(SBV Integer -> SBV Bool)_cb04f986c4 @(SBV [Integer] -> SBV ([Integer],[Integer]))| :: [SInteger] -> ([SInteger], [SInteger]) [Recursive]
[GOOD] (define-fun-rec |sbv.partition @(SBV Integer -> SBV Bool)_cb04f986c4 @(SBV [Integer] -> SBV ([Integer],[Integer]))| ((l1_s0 (Seq Int))) (SBVTuple2 (Seq Int) (Seq Int))
(let ((l1_s2 0))
(let ((l1_s4 (mkSBVTuple2 (as seq.empty (Seq Int)) (as seq.empty (Seq Int)))))
(let ((l1_s6 2))
(let ((l1_s10 1))
(let ((l1_s1 (seq.len l1_s0)))
(let ((l1_s3 (= l1_s1 l1_s2)))
(let ((l1_s5 (seq.nth l1_s0 l1_s2)))
(let ((l1_s7 (mod l1_s5 l1_s6)))
(let ((l1_s8 (distinct l1_s2 l1_s7)))
(let ((l1_s9 (seq.unit l1_s5)))
(let ((l1_s11 (- l1_s1 l1_s10)))
(let ((l1_s12 (seq.extract l1_s0 l1_s10 l1_s11)))
(let ((l1_s13 (|sbv.partition @(SBV Integer -> SBV Bool)_cb04f986c4 @(SBV [Integer] -> SBV ([Integer],[Integer]))| l1_s12)))
(let ((l1_s14 (proj_1_SBVTuple2 l1_s13)))
(let ((l1_s15 (seq.++ l1_s9 l1_s14)))
(let ((l1_s16 (proj_2_SBVTuple2 l1_s13)))
(let ((l1_s17 ((as mkSBVTuple2 (SBVTuple2 (Seq Int) (Seq Int))) l1_s15 l1_s16)))
(let ((l1_s18 (seq.++ l1_s9 l1_s16)))
(let ((l1_s19 ((as mkSBVTuple2 (SBVTuple2 (Seq Int) (Seq Int))) l1_s14 l1_s18)))
(let ((l1_s20 (ite l1_s8 l1_s17 l1_s19)))
(let ((l1_s21 (ite l1_s3 l1_s4 l1_s20)))
l1_s21))))))))))))))))))))))
[GOOD] ; --- assignments ---
[GOOD] (define-fun s3 () Bool (= s0 s2))
[GOOD] (define-fun s4 () (SBVTuple2 (Seq Int) (Seq Int)) (|sbv.partition @(SBV Integer -> SBV Bool)_cb04f986c4 @(SBV [Integer] -> SBV ([Integer],[Integer]))| s0))
[GOOD] (define-fun s5 () Bool (= s1 s4))
[GOOD] ; --- delayedEqualities ---
[GOOD] ; --- formula ---
[GOOD] (assert s3)
[GOOD] (assert s5)
[SEND] (check-sat)
[RECV] sat
[SEND] (get-value (s1))
[RECV] ((s1 (mkSBVTuple2 (seq.++ (seq.unit 1)
(seq.unit 3)
(seq.unit 5)
(seq.unit 7)
(seq.unit 9))
(seq.++ (seq.unit 2)
(seq.unit 4)
(seq.unit 6)
(seq.unit 8)
(seq.unit 10)))))
[SEND] (get-value (s0))
[RECV] ((s0 (seq.++ (seq.unit 1)
(seq.unit 2)
(seq.unit 3)
(seq.unit 4)
(seq.unit 5)
(seq.unit 6)
(seq.unit 7)
(seq.unit 8)
(seq.unit 9)
(seq.unit 10))))
[SEND] (get-value (s1))
[RECV] ((s1 (mkSBVTuple2 (seq.++ (seq.unit 1)
(seq.unit 3)
(seq.unit 5)
(seq.unit 7)
(seq.unit 9))
(seq.++ (seq.unit 2)
(seq.unit 4)
(seq.unit 6)
(seq.unit 8)
(seq.unit 10)))))
*** Solver : Z3
*** Exit code: ExitSuccess
RESULT:
s0 = [1,2,3,4,5,6,7,8,9,10] :: [Integer]
s1 = ([1,3,5,7,9],[2,4,6,8,10]) :: ([Integer], [Integer])