1
0
Fork 0
tplp-planning-benchmark/fd-pc-e1-sh/ipc-2000_freecell-strips-ty...

125 lines
5.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-3.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-3.pddl
Parsing...
Parsing: [0.020s CPU, 0.032s wall-clock]
Normalizing task... [0.010s CPU, 0.003s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.040s CPU, 0.045s wall-clock]
Preparing model... [0.020s CPU, 0.021s wall-clock]
Generated 125 rules.
Computing model... [0.430s CPU, 0.434s wall-clock]
3618 relevant atoms
1056 auxiliary atoms
4674 final queue length
15855 total queue pushes
Completing instantiation... [1.460s CPU, 1.462s wall-clock]
Instantiating: [1.970s CPU, 1.974s wall-clock]
Computing fact groups...
Finding invariants...
15 initial candidates
Finding invariants: [0.120s CPU, 0.119s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s 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.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.140s CPU, 0.148s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.360s CPU, 1.364s wall-clock]
1647 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.620s CPU, 0.619s wall-clock]
Reordering and filtering variables...
22 of 22 variables necessary.
22 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: 92
Translator goal facts: 4
Translator mutex groups: 22
Translator total mutex groups size: 75
Translator operators: 3400
Translator axioms: 0
Translator task size: 28493
Translator peak memory: 50264 KB
Writing output... [0.420s CPU, 0.450s wall-clock]
Done! [4.870s CPU, 4.914s wall-clock]
planner.py version 0.0.1
Time: 1.00s
Memory: 120MB
Iteration 1
Queue: [5]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.51s
Memory: 121MB (+1MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("sendtofree-b","h2","n4","n3","n3","n4")),1) occurs(action(("move","ha","ca","s2")),1) occurs(action(("sendtofree","c2","sa","n3","n2")),2) occurs(action(("sendtohome-b","ca","c","n1","c0","n0","n4","n5")),2) occurs(action(("sendtohome","ha","s2","h","n1","h0","n0")),3) occurs(action(("sendtohome","sa","d2","s","n1","s0","n0")),3) occurs(action(("sendtohome-b","da","d","n1","d0","n0","n5","n6")),3) occurs(action(("sendtohome-b","s2","s","n2","sa","n1","n6","n7")),4) occurs(action(("homefromfreecell","c2","c","n2","ca","n1","n2","n3")),4) occurs(action(("homefromfreecell","h2","h","n2","ha","n1","n3","n4")),5) occurs(action(("sendtohome-b","d2","d","n2","da","n1","n7","n8")),5)
Solving Time: 0.06s
Memory: 128MB (+7MB)
SAT
SATISFIABLE
Models : 1+
Calls : 1
Time : 1.810s (Solving: 0.02s 1st Model: 0.02s Unsat: 0.00s)
CPU Time : 1.740s
Choices : 262
Conflicts : 212 (Analyzed: 212)
Restarts : 3 (Average: 70.67 Last: 5)
Model-Level : 13.0
Problems : 1 (Average Length: 7.00 Splits: 0)
Lemmas : 212 (Deleted: 0)
Binary : 5 (Ratio: 2.36%)
Ternary : 1 (Ratio: 0.47%)
Conflict : 212 (Average Length: 150.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 212 (Average: 1.37 Max: 11 Sum: 290)
Executed : 206 (Average: 1.20 Max: 11 Sum: 254 Ratio: 87.59%)
Bounded : 6 (Average: 6.00 Max: 7 Sum: 36 Ratio: 12.41%)
Rules : 0
Atoms : 0
Bodies : 0
Tight : Yes
Variables : 14983 (Eliminated: 0 Frozen: 13224)
Constraints : 50899 (Binary: 98.4% Ternary: 0.7% Other: 0.9%)
Memory Peak : 128MB
Max. Length : 5 steps
Sol. Length : 5 steps