Tra4CP

Trace Format for Finite Domain Solvers

Illustrative example: Sorted

Problem Description :
To sort n variables on domain of size n, i.e. to find values of n variables on finite domain [1..n] such that the n variables are sorted in increasing order.Interest :

Pédagogical. It illustrates the propagation: the number of propagation steps is i for the ith variable and posted inequality constraint.

Sources and Traces:

Code GNU-Prolog
Trace of the Gentra4cp documentation (App. C) Trace GNU-Prolog sorted(2) (.xml.gz 5,4K)
Short trace with user named variables sorted(100) (.xml.gz:191K, .xml:2,2M) (the vardomains are not given, 20402 events)
Same trace but with vardomains at search-tree nodes sorted(100) (.xml.gz 258K, .xml:3,1M) 20402 events

Code PaLM Code JPaLM
Trace of the Gentra4cp documentation (App. C) Trace JPaLM sorted(2) (.xml.gz 5,4K)
Trace multi-sorted(100) (.xml.gz:177K, .xml:7,5M) (bp de solutions!)

Code Jchoco
Trace of the Gentra4cp documentation (App. C) Trace JChoco sorted(2) (.xml.gz 5,4K)
Trace multi-sorted(100) (.xml.gz:177K) (bp de solutions!)

Code Chip++V5 Code ChipCV5
Trace of the Gentra4cp documentation (App. C) Trace ChipV5 sorted(2) (.xml.gz 5,4K)
Trace with depth attribute sorted(100) (.xml.gz:149K, .xml:1,6M, 15548 events)