1
0
tplp-planning-benchmark/gc-ta1-tt1-single-shot/ipc-2011_parking-sequential-satisficing_13.out

110 lines
5.7 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-13.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/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-13.pddl
Parsing...
Parsing: [0.020s CPU, 0.024s wall-clock]
Normalizing task... [0.010s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
Preparing model... [0.020s CPU, 0.018s wall-clock]
Generated 32 rules.
Computing model... [4.860s CPU, 4.853s wall-clock]
53177 relevant atoms
5070 auxiliary atoms
58247 final queue length
172334 total queue pushes
Completing instantiation... [19.640s CPU, 19.621s wall-clock]
Instantiating: [24.570s CPU, 24.567s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.060s CPU, 0.066s wall-clock]
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
Instantiating groups... [0.060s CPU, 0.065s wall-clock]
Collecting mutex groups... [0.010s CPU, 0.010s wall-clock]
Choosing groups...
71 uncovered facts
Choosing groups: [0.050s CPU, 0.044s wall-clock]
Building translation key... [0.010s CPU, 0.016s wall-clock]
Computing fact groups: [0.260s CPU, 0.266s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.011s wall-clock]
Building dictionary for full mutex groups... [0.020s CPU, 0.017s wall-clock]
Building mutex information...
Building mutex information: [0.030s CPU, 0.027s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.970s CPU, 0.974s wall-clock]
Translating task: [21.440s CPU, 21.430s wall-clock]
61152 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
28 propositions removed
Detecting unreachable propositions: [10.840s CPU, 10.831s wall-clock]
Reordering and filtering variables...
99 of 99 variables necessary.
43 of 71 mutex groups necessary.
49392 of 49392 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [4.250s CPU, 4.249s wall-clock]
Translator variables: 99
Translator derived variables: 0
Translator facts: 1346
Translator goal facts: 28
Translator mutex groups: 43
Translator total mutex groups size: 1247
Translator operators: 49392
Translator axioms: 0
Translator task size: 402560
Translator peak memory: 273428 KB
Writing output... [6.940s CPU, 7.420s wall-clock]
Done! [69.180s CPU, 69.639s wall-clock]
planner.py version 0.0.1
Time: 16.34s
Memory: 997MB
Iteration 1
Queue: [(0,95,0,True)]
Grounded Until: 0
Expected Memory: 997MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('step', [81]), ('step', [82]), ('step', [83]), ('step', [84]), ('step', [85]), ('step', [86]), ('step', [87]), ('step', [88]), ('step', [89]), ('step', [90]), ('step', [91]), ('step', [92]), ('step', [93]), ('step', [94]), ('step', [95]), ('check', [95])]
*** Info : (planner): INTERRUPTED by signal!
UNKNOWN
INTERRUPTED : 1
Calls : 1
Time : 0.000s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.000s
Choices : 0
Conflicts : 0 (Analyzed: 0)
Restarts : 0
Problems : 0 (Average Length: 0.00 Splits: 0)
Lemmas : 0 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
Variables : 0 (Eliminated: 0 Frozen: 0)
Constraints : 0 (Binary: 0.0% Ternary: 0.0% Other: 0.0%)i
Memory Peak : 11758MB
Max. Length : 0 steps
Models : 0