1
0
Fork 0
tplp-planning-benchmark/fd-pb-es/ipc-2000_freecell-strips-ty...

239 lines
9.6 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.040s CPU, 0.042s wall-clock]
Normalizing task... [0.000s CPU, 0.004s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.060s CPU, 0.056s wall-clock]
Preparing model... [0.020s CPU, 0.026s wall-clock]
Generated 125 rules.
Computing model... [0.670s CPU, 0.663s wall-clock]
5624 relevant atoms
1418 auxiliary atoms
7042 final queue length
24499 total queue pushes
Completing instantiation... [2.320s CPU, 2.323s wall-clock]
Instantiating: [3.080s CPU, 3.085s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.130s CPU, 0.127s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.020s CPU, 0.022s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
12 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.170s CPU, 0.167s 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.100s CPU, 0.102s wall-clock]
Translating task: [2.130s CPU, 2.139s 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.090s CPU, 1.079s 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.400s CPU, 0.404s 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: 60248 KB
Writing output... [0.680s CPU, 0.728s wall-clock]
Done! [7.690s CPU, 7.741s wall-clock]
planner.py version 0.0.1
Time: 1.58s
Memory: 161MB
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: 161MB (+0MB)
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.62s
Memory: 161MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.06s
Memory: 165MB (+4MB)
UNSAT
Iteration Time: 0.93s
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.68s
Memory: 178MB (+13MB)
Unblocking actions...
Solving...
Solving Time: 1.47s
Memory: 188MB (+10MB)
UNKNOWN
Iteration Time: 2.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.65s
Memory: 210MB (+22MB)
Unblocking actions...
Solving...
Solving Time: 2.29s
Memory: 224MB (+14MB)
UNKNOWN
Iteration Time: 3.22s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 0.84s
Memory: 259MB (+35MB)
Unblocking actions...
Solving...
Solving Time: 2.65s
Memory: 277MB (+18MB)
UNKNOWN
Iteration Time: 3.78s
Iteration 6
Queue: [(5,25,0,True), (6,30,0,True)]
Grounded Until: 20
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
Grounding Time: 0.65s
Memory: 296MB (+19MB)
Unblocking actions...
Solving...
Solving Time: 3.16s
Memory: 313MB (+17MB)
UNKNOWN
Iteration Time: 4.11s
Iteration 7
Queue: [(6,30,0,True)]
Grounded Until: 25
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
Grounding Time: 0.67s
Memory: 333MB (+20MB)
Unblocking actions...
Solving...
Solving Time: 3.81s
Memory: 345MB (+12MB)
UNKNOWN
Iteration Time: 4.79s
Iteration 8
Queue: [(2,10,1,True), (3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 2.01s
Memory: 345MB (+0MB)
UNKNOWN
Iteration Time: 2.03s
Iteration 9
Queue: [(3,15,1,True), (4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.52s
Memory: 345MB (+0MB)
UNKNOWN
Iteration Time: 2.54s
Iteration 10
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Solving Time: 2.99s
Memory: 345MB (+0MB)
UNKNOWN
Iteration Time: 3.01s
Iteration 11
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True)]
Grounded Until: 30
Unblocking actions...
Solving...
Answer: 1
occurs(action(("sendtofree","d3","s2","n4","n3")),1) occurs(action(("move","ca","d2","h2")),2) occurs(action(("newcolfromfreecell","d3","n1","n0","n3","n4")),3) occurs(action(("sendtofree","s2","c3","n4","n3")),4) occurs(action(("sendtofree-b","c3","n3","n2","n0","n1")),5) occurs(action(("move-b","d2","s3","n1","n2")),6) occurs(action(("sendtonewcol","d2","s3","n2","n1")),7) occurs(action(("sendtofree-b","s3","n2","n1","n1","n2")),8) occurs(action(("sendtofree-b","c2","n1","n0","n2","n3")),9) occurs(action(("newcolfromfreecell","c2","n3","n2","n0","n1")),10) occurs(action(("sendtofree-b","c2","n1","n0","n2","n3")),11) occurs(action(("sendtohome","ca","h2","c","n1","c0","n0")),12) occurs(action(("homefromfreecell","c2","c","n2","ca","n1","n0","n1")),13) occurs(action(("sendtofree-b","d3","n1","n0","n3","n4")),14) occurs(action(("homefromfreecell","c3","c","n3","c2","n2","n0","n1")),15) occurs(action(("sendtohome-b","da","d","n1","d0","n0","n4","n5")),16) occurs(action(("sendtohome","sa","h3","s","n1","s0","n0")),17) occurs(action(("sendtohome-b","d2","d","n2","da","n1","n5","n6")),18) occurs(action(("sendtonewcol","h3","ha","n6","n5")),19) occurs(action(("homefromfreecell","s2","s","n2","sa","n1","n1","n2")),20) occurs(action(("homefromfreecell","s3","s","n3","s2","n2","n2","n3")),21) occurs(action(("sendtohome-b","ha","h","n1","h0","n0","n5","n6")),22) occurs(action(("sendtohome-b","h2","h","n2","ha","n1","n6","n7")),23) occurs(action(("homefromfreecell","d3","d","n3","d2","n2","n3","n4")),24) occurs(action(("sendtohome-b","h3","h","n3","h2","n2","n7","n8")),25)
Solving Time: 2.02s
Memory: 345MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 11
Time : 30.521s (Solving: 22.67s 1st Model: 1.99s Unsat: 0.01s)
CPU Time : 30.420s
Choices : 116036
Conflicts : 82589 (Analyzed: 82588)
Restarts : 863 (Average: 95.70 Last: 150)
Model-Level : 70.0
Problems : 11 (Average Length: 22.45 Splits: 0)
Lemmas : 82588 (Deleted: 63495)
Binary : 923 (Ratio: 1.12%)
Ternary : 677 (Ratio: 0.82%)
Conflict : 82588 (Average Length: 435.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 82588 (Average: 1.45 Max: 76 Sum: 119496)
Executed : 81966 (Average: 1.30 Max: 76 Sum: 106975 Ratio: 89.52%)
Bounded : 622 (Average: 20.13 Max: 32 Sum: 12521 Ratio: 10.48%)
Rules : 131036
Atoms : 131036
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 158984 (Eliminated: 0 Frozen: 152209)
Constraints : 1589962 (Binary: 99.6% Ternary: 0.2% Other: 0.2%)
Memory Peak : 361MB
Max. Length : 30 steps
Sol. Length : 25 steps