1
0
Fork 0
tplp-planning-benchmark/gc-ta5-tt0/ipc-2000_freecell-strips-ty...

199 lines
7.4 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-7.pddl']
INFO translator arguments: []
INFO translator time limit: None
INFO translator memory limit: None
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/freecell-strips-typed/instances/instance-7.pddl
Parsing...
Parsing: [0.030s CPU, 0.037s wall-clock]
Normalizing task... [0.000s CPU, 0.003s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.050s CPU, 0.052s wall-clock]
Preparing model... [0.030s CPU, 0.026s wall-clock]
Generated 125 rules.
Computing model... [0.720s CPU, 0.723s wall-clock]
5624 relevant atoms
1418 auxiliary atoms
7042 final queue length
24499 total queue pushes
Completing instantiation... [2.600s CPU, 2.591s wall-clock]
Instantiating: [3.410s CPU, 3.409s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.140s CPU, 0.137s wall-clock]
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
Instantiating groups... [0.030s CPU, 0.026s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.000s CPU, 0.005s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.180s CPU, 0.183s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.002s wall-clock]
Building mutex information...
not in strips_to_sas, left out: Atom bottomcol(c0)
not in strips_to_sas, left out: Atom bottomcol(d0)
not in strips_to_sas, left out: Atom bottomcol(h0)
not in strips_to_sas, left out: Atom bottomcol(s0)
Building mutex information: [0.000s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.110s CPU, 0.113s wall-clock]
Translating task: [2.400s CPU, 2.397s wall-clock]
2412 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [1.200s CPU, 1.190s wall-clock]
Reordering and filtering variables...
30 of 30 variables necessary.
32 of 50 mutex groups necessary.
5344 of 5344 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.450s CPU, 0.451s wall-clock]
Translator variables: 30
Translator derived variables: 0
Translator facts: 124
Translator goal facts: 4
Translator mutex groups: 32
Translator total mutex groups size: 124
Translator operators: 5344
Translator axioms: 0
Translator task size: 44456
Translator peak memory: 63180 KB
Writing output... [0.720s CPU, 0.761s wall-clock]
Done! [8.490s CPU, 8.533s wall-clock]
planner.py version 0.0.1
Time: 1.87s
Memory: 171MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.01s
Memory: 172MB (+1MB)
UNSAT
Iteration Time: 0.01s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.56s
Memory: 172MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.05s
Memory: 173MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.43s
Memory: 236MB (+63MB)
Solving...
Solving Time: 0.02s
Memory: 236MB (+0MB)
UNSAT
Iteration Time: 2.31s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.63s
Memory: 236MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 246MB (+10MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.44s
Memory: 245MB (+-1MB)
Solving...
Solving Time: 0.02s
Memory: 245MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.44s
Memory: 274MB (+29MB)
Solving...
Solving Time: 1.55s
Memory: 245MB (+-29MB)
UNKNOWN
Iteration Time: 5.39s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.59s
Memory: 245MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.21s
Memory: 245MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 1.49s
Memory: 246MB (+1MB)
Solving...
Solving Time: 0.05s
Memory: 246MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.45s
Memory: 327MB (+81MB)
Answer: 5
occurs(action(("sendtonewcol","d3","s2","n1","n0")),1) occurs(action(("sendtohome","sa","h3","s","n1","s0","n0")),2) occurs(action(("sendtohome","s2","c3","s","n2","sa","n1")),3) occurs(action(("sendtohome-b","s3","s","n3","s2","n2","n0","n1")),4) occurs(action(("sendtofree","h3","ha","n4","n3")),5) occurs(action(("sendtohome-b","ha","h","n1","h0","n0","n1","n2")),6) occurs(action(("sendtohome-b","h2","h","n2","ha","n1","n2","n3")),7) occurs(action(("homefromfreecell","h3","h","n3","h2","n2","n3","n4")),8) occurs(action(("sendtofree-b","c3","n4","n3","n3","n4")),9) occurs(action(("sendtohome","ca","d2","c","n1","c0","n0")),10) occurs(action(("sendtohome-b","c2","c","n2","ca","n1","n4","n5")),11) occurs(action(("homefromfreecell","c3","c","n3","c2","n2","n3","n4")),12) occurs(action(("sendtohome-b","da","d","n1","d0","n0","n5","n6")),13) occurs(action(("sendtohome-b","d2","d","n2","da","n1","n6","n7")),14) occurs(action(("sendtohome-b","d3","d","n3","d2","n2","n7","n8")),15)
SATISFIABLE
Models : 1+
Calls : 8
Time : 6.597s (Solving: 1.81s 1st Model: 0.23s Unsat: 0.02s)
CPU Time : 6.524s
Choices : 47863 (Domain: 45073)
Conflicts : 10761 (Analyzed: 10760)
Restarts : 111 (Average: 96.94 Last: 107)
Model-Level : 70.8
Problems : 8 (Average Length: 10.75 Splits: 0)
Lemmas : 10760 (Deleted: 6734)
Binary : 131 (Ratio: 1.22%)
Ternary : 75 (Ratio: 0.70%)
Conflict : 10760 (Average Length: 857.2 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 10760 (Average: 4.12 Max: 44 Sum: 44351)
Executed : 10757 (Average: 4.12 Max: 44 Sum: 44326 Ratio: 99.94%)
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 0.06%)
Rules : 131147
Atoms : 131135
Bodies : 53 (Original: 52)
Count : 12
Equivalences : 120 (Atom=Atom: 40 Body=Body: 0 Other: 80)
Tight : Yes
Variables : 74876 (Eliminated: 0 Frozen: 29885)
Constraints : 595299 (Binary: 99.5% Ternary: 0.2% Other: 0.3%)
Memory Peak : 327MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 5