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

219 lines
8.3 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-4.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-4.pddl
Parsing...
Parsing: [0.040s CPU, 0.045s 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.055s wall-clock]
Preparing model... [0.020s CPU, 0.025s wall-clock]
Generated 125 rules.
Computing model... [0.440s CPU, 0.444s wall-clock]
3618 relevant atoms
1056 auxiliary atoms
4674 final queue length
15856 total queue pushes
Completing instantiation... [1.460s CPU, 1.459s wall-clock]
Instantiating: [2.000s CPU, 1.998s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.120s CPU, 0.124s wall-clock]
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
Instantiating groups... [0.020s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
8 uncovered facts
Choosing groups: [0.010s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.150s CPU, 0.152s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.060s CPU, 0.064s wall-clock]
Translating task: [1.380s CPU, 1.372s wall-clock]
1582 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
14 propositions removed
Detecting unreachable propositions: [0.620s CPU, 0.621s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
24 of 34 mutex groups necessary.
3400 of 3400 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.260s CPU, 0.261s wall-clock]
Translator variables: 22
Translator derived variables: 0
Translator facts: 90
Translator goal facts: 4
Translator mutex groups: 24
Translator total mutex groups size: 80
Translator operators: 3400
Translator axioms: 0
Translator task size: 28584
Translator peak memory: 50520 KB
Writing output... [0.410s CPU, 0.447s wall-clock]
Done! [4.920s CPU, 4.961s wall-clock]
planner.py version 0.0.1
Time: 84.22s
Memory: 3879MB
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.32s
Memory: 3879MB (+0MB)
UNSAT
Iteration Time: 0.32s
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: 4.95s
Memory: 4321MB (+442MB)
Unblocking actions...
Solving...
Solving Time: 12.53s
Memory: 4374MB (+53MB)
UNKNOWN
Iteration Time: 19.01s
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: 5.29s
Memory: 4566MB (+192MB)
Unblocking actions...
Solving...
Solving Time: 21.14s
Memory: 4614MB (+48MB)
UNKNOWN
Iteration Time: 28.14s
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: 5.43s
Memory: 4802MB (+188MB)
Unblocking actions...
Solving...
Solving Time: 25.37s
Memory: 4865MB (+63MB)
UNKNOWN
Iteration Time: 32.56s
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: 5.62s
Memory: 5041MB (+176MB)
Unblocking actions...
Solving...
Solving Time: 31.10s
Memory: 5095MB (+54MB)
UNKNOWN
Iteration Time: 38.52s
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: 5.72s
Memory: 5275MB (+180MB)
Unblocking actions...
Solving...
Solving Time: 31.28s
Memory: 5333MB (+58MB)
UNKNOWN
Iteration Time: 38.82s
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: 5.93s
Memory: 5505MB (+172MB)
Unblocking actions...
Solving...
Solving Time: 28.85s
Memory: 5573MB (+68MB)
UNKNOWN
Iteration Time: 36.65s
Iteration 8
Queue: [(1,5,1,True), (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)]
Grounded Until: 30
Blocking actions...
Solving...
Solving Time: 19.07s
Memory: 5573MB (+0MB)
UNKNOWN
Iteration Time: 19.28s
Iteration 9
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)]
Grounded Until: 30
Unblocking actions...
Solving...
Answer: 1
occurs(action(("move","da","d2","c2")),1) occurs(action(("sendtofree","h2","s2","n4","n3")),1) occurs(action(("sendtohome-b","sa","s","n1","s0","n0","n2","n3")),2) occurs(action(("sendtofree","da","c2","n3","n2")),2) occurs(action(("newcolfromfreecell","h2","n3","n2","n2","n3")),3) occurs(action(("homefromfreecell","da","d","n1","d0","n0","n3","n4")),4) occurs(action(("sendtohome-b","ha","h","n1","h0","n0","n2","n3")),4) occurs(action(("sendtohome-b","s2","s","n2","sa","n1","n3","n4")),5) occurs(action(("sendtohome-b","h2","h","n2","ha","n1","n4","n5")),6) occurs(action(("sendtohome-b","ca","c","n1","c0","n0","n5","n6")),7) occurs(action(("sendtofree-b","c2","n4","n3","n6","n7")),8) occurs(action(("homefromfreecell","c2","c","n2","ca","n1","n3","n4")),9) occurs(action(("sendtohome-b","d2","d","n2","da","n1","n7","n8")),10)
Solving Time: 5.11s
Memory: 5573MB (+0MB)
SAT
SATISFIABLE
Models : 1+
Calls : 9
Time : 302.765s (Solving: 171.49s 1st Model: 4.97s Unsat: 0.00s)
CPU Time : 302.810s
Choices : 9714036
Conflicts : 77923 (Analyzed: 77923)
Restarts : 716 (Average: 108.83 Last: 177)
Model-Level : 1993.0
Problems : 9 (Average Length: 20.33 Splits: 0)
Lemmas : 94668 (Deleted: 70269)
Binary : 15608 (Ratio: 16.49%)
Ternary : 974 (Ratio: 1.03%)
Conflict : 77923 (Average Length: 829.1 Ratio: 82.31%)
Loop : 16745 (Average Length: 636.6 Ratio: 17.69%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 77923 (Average: 104.22 Max: 8486 Sum: 8121383)
Executed : 77764 (Average: 104.20 Max: 8486 Sum: 8119445 Ratio: 99.98%)
Bounded : 159 (Average: 12.19 Max: 32 Sum: 1938 Ratio: 0.02%)
Rules : 30405932
Atoms : 30405932
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 618809 (Eliminated: 0 Frozen: 614883)
Constraints : 2193525 (Binary: 91.2% Ternary: 4.3% Other: 4.4%)
Memory Peak : 5586MB
Max. Length : 30 steps
Sol. Length : 10 steps