Add benchmark result [gc-ta1-tt1 | ipc-1998 | mystery-round-1-strips | 27]
This commit is contained in:
144
gc-ta1-tt1/ipc-1998_mystery-round-1-strips_27.out
Normal file
144
gc-ta1-tt1/ipc-1998_mystery-round-1-strips_27.out
Normal file
@@ -0,0 +1,144 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-27.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.021s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.031s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||||
Generated 42 rules.
|
||||
Computing model... [0.180s CPU, 0.189s wall-clock]
|
||||
1446 relevant atoms
|
||||
813 auxiliary atoms
|
||||
2259 final queue length
|
||||
4448 total queue pushes
|
||||
Completing instantiation... [0.450s CPU, 0.452s wall-clock]
|
||||
Instantiating: [0.700s CPU, 0.695s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.020s CPU, 0.029s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.020s CPU, 0.013s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.003s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.050s CPU, 0.056s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.002s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.010s CPU, 0.018s wall-clock]
|
||||
Translating task: [0.320s CPU, 0.331s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
19 propositions removed
|
||||
Detecting unreachable propositions: [0.170s CPU, 0.166s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
19 of 19 variables necessary.
|
||||
0 of 19 mutex groups necessary.
|
||||
1161 of 1161 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.060s CPU, 0.055s wall-clock]
|
||||
Translator variables: 19
|
||||
Translator derived variables: 0
|
||||
Translator facts: 152
|
||||
Translator goal facts: 2
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 1161
|
||||
Translator axioms: 0
|
||||
Translator task size: 6734
|
||||
Translator peak memory: 40908 KB
|
||||
Writing output... [0.120s CPU, 0.128s wall-clock]
|
||||
Done! [1.460s CPU, 1.473s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.32s
|
||||
Memory: 68MB
|
||||
|
||||
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: 68MB (+0MB)
|
||||
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
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.08s
|
||||
Memory: 68MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 69MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.25s
|
||||
Memory: 80MB (+11MB)
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 80MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 80MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action(("overcome","grief","satisfaction","scallion","mars","uranus")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("overcome","boils","love","scallion","mars","uranus")),2) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),2) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("succumb","grief","satisfaction","guava","mars","uranus")),3) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),3) occurs(action(("overcome","loneliness","triumph","scallion","uranus","earth")),3) occurs(action(("succumb","boils","love","guava","mars","uranus")),4) occurs(action(("feast","triumph","scallion","popover","guanabara","manitoba")),4) occurs(action(("feast","triumph","popover","onion","quebec","kentucky")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.505s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.480s
|
||||
|
||||
Choices : 251 (Domain: 211)
|
||||
Conflicts : 26 (Analyzed: 26)
|
||||
Restarts : 0
|
||||
Model-Level : 56.0
|
||||
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||||
Lemmas : 26 (Deleted: 0)
|
||||
Binary : 2 (Ratio: 7.69%)
|
||||
Ternary : 1 (Ratio: 3.85%)
|
||||
Conflict : 26 (Average Length: 51.4 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 26 (Average: 6.42 Max: 27 Sum: 167)
|
||||
Executed : 24 (Average: 5.88 Max: 27 Sum: 153 Ratio: 91.62%)
|
||||
Bounded : 2 (Average: 7.00 Max: 7 Sum: 14 Ratio: 8.38%)
|
||||
|
||||
Rules : 29748 (Original: 29714)
|
||||
Atoms : 23307
|
||||
Bodies : 4286 (Original: 4260)
|
||||
Count : 67 (Original: 75)
|
||||
Equivalences : 2441 (Atom=Atom: 12 Body=Body: 0 Other: 2429)
|
||||
Tight : Yes
|
||||
Variables : 6289 (Eliminated: 0 Frozen: 2905)
|
||||
Constraints : 28349 (Binary: 96.4% Ternary: 1.4% Other: 2.2%)
|
||||
|
||||
Memory Peak : 80MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Reference in New Issue
Block a user