patrick/tplp-planning-benchmark
1
0
Fork 0
Code Issues Releases Activity

Add benchmark result [gc-ta1-tt1 | ipc-2011 | woodworking-sequential-satisficing | 10]

Browse Source
This commit is contained in:
Potassco Bot
2017-12-05 21:46:29 +01:00
parent 717e6a0ff9
commit 2c4161c247
3 changed files with 222 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

145
gc-ta1-tt1/ipc-2011_woodworking-sequential-satisficing_10.out Normal file
View File

@@ -0,0 +1,145 @@
INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/woodworking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/woodworking-sequential-satisficing/instances/instance-10.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-2011/domains/woodworking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/woodworking-sequential-satisficing/instances/instance-10.pddl
Parsing...
Parsing: [0.060s CPU, 0.062s wall-clock]
Normalizing task... [0.000s CPU, 0.004s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.010s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.080s CPU, 0.079s wall-clock]
Preparing model... [0.030s CPU, 0.030s wall-clock]
Generated 198 rules.
Computing model... [0.060s CPU, 0.059s wall-clock]
294 relevant atoms
484 auxiliary atoms
778 final queue length
1222 total queue pushes
Completing instantiation... [0.080s CPU, 0.081s wall-clock]
Instantiating: [0.260s CPU, 0.261s wall-clock]
Computing fact groups...
Finding invariants...
24 initial candidates
Finding invariants: [0.120s CPU, 0.115s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
16 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.120s CPU, 0.124s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.003s wall-clock]
Translating task: [0.060s CPU, 0.059s wall-clock]
108 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
23 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.031s wall-clock]
Reordering and filtering variables...
15 of 15 variables necessary.
0 of 6 mutex groups necessary.
153 of 153 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.012s wall-clock]
Translator variables: 15
Translator derived variables: 0
Translator facts: 36
Translator goal facts: 5
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 153
Translator axioms: 0
Translator task size: 1064
Translator peak memory: 37068 KB
Writing output... [0.020s CPU, 0.022s wall-clock]
Done! [0.570s CPU, 0.580s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 51MB
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.00s
Memory: 52MB (+1MB)
UNSAT
Iteration Time: 0.00s
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
Expected Memory: 52MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.02s
Memory: 52MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 52MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.05s
Memory: 54MB (+2MB)
Solving...
Solving Time: 0.00s
Memory: 54MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 54MB (+0MB)
Answer: 2
occurs(action(("do-plane","p0","planer0","verysmooth","blue","colourfragments")),1) occurs(action(("do-grind","p2","grinder0","verysmooth","mauve","colourfragments","untreated")),1) occurs(action(("do-plane","p1","planer0","smooth","natural","colourfragments")),1) occurs(action(("do-glaze","p1","glazer0","natural")),2) occurs(action(("do-glaze","p2","glazer0","natural")),2) occurs(action(("do-glaze","p0","glazer0","natural")),3) occurs(action(("do-plane","p0","planer0","smooth","natural","glazed")),4) occurs(action(("do-glaze","p0","glazer0","natural")),5)
SATISFIABLE
Models : 1+
Calls : 3
Time : 0.101s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.092s
Choices : 44 (Domain: 32)
Conflicts : 2 (Analyzed: 2)
Restarts : 0
Model-Level : 28.0
Problems : 3 (Average Length: 5.33 Splits: 0)
Lemmas : 2 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 2 (Average Length: 151.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 2 (Average: 1.00 Max: 1 Sum: 2)
Executed : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 5137 (Original: 5132)
Atoms : 3671
Bodies : 1147 (Original: 1141)
Count : 43 (Original: 44)
Equivalences : 589 (Atom=Atom: 10 Body=Body: 0 Other: 579)
Tight : Yes
Variables : 1108 (Eliminated: 0 Frozen: 549)
Constraints : 7281 (Binary: 95.0% Ternary: 2.4% Other: 2.6%)
Memory Peak : 54MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 2