Add benchmark result [gc-ta1-tt1-single-shot | ipc-2011 | parking-sequential-satisficing | 10]
This commit is contained in:
parent
a23a019d50
commit
5f90a26faa
GPG Key ID:
1F54208CE70DDF73
@ -0,0 +1,60 @@
|
||||
command:
|
||||
- timeout
|
||||
- -m=9216000
|
||||
- -t=900
|
||||
- python3
|
||||
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||
- --domain=/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-10.pddl
|
||||
- --stats
|
||||
- --stats-iter
|
||||
- --verbose
|
||||
- --print-call
|
||||
- -m 8192
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=1
|
||||
- --test-times=1
|
||||
- -i 0
|
||||
- -F 105
|
||||
- -T 105
|
||||
configuration:
|
||||
fixedHorizon: true
|
||||
id: gc-ta1-tt1-single-shot
|
||||
instanceSets:
|
||||
- rintanen-aij-2012-interesting
|
||||
options:
|
||||
- --stats
|
||||
- --stats-iter
|
||||
- --verbose
|
||||
- --print-call
|
||||
- -m 8192
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=1
|
||||
- --test-times=1
|
||||
- -i 0
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: parking-sequential-satisficing
|
||||
instance: 10
|
||||
ipc: ipc-2011
|
||||
planLength: 105
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: f090434475c02dbccc3811039498f2a63a357ddc (2018-02-01 18:15:39 +0100)
|
||||
plasp: 3.1.1
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
||||
@ -0,0 +1,8 @@
|
||||
# configuration: {'id': 'gc-ta1-tt1-single-shot', 'options': ['--stats', '--stats-iter', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1', '-i 0'], 'instanceSets': ['rintanen-aij-2012-interesting'], 'fixedHorizon': True}
|
||||
# instance: {'ipc': 'ipc-2011', 'domain': 'parking-sequential-satisficing', 'instance': 10, 'planLength': 105}
|
||||
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/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-10.pddl', '--stats', '--stats-iter', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1', '-i 0', '-F 105', '-T 105']
|
||||
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
# exit code: 0
|
||||
MEM CPU 185.16 MEM 9220888 MAXMEM 9220888 STALE 1 MAXMEM_RSS 8966932
|
||||
<time name="ALL">185110</time>
|
||||
|
||||
@ -0,0 +1,109 @@
|
||||
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-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/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-10.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.026s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.016s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
||||
Generated 32 rules.
|
||||
Computing model... [3.900s CPU, 3.900s wall-clock]
|
||||
42827 relevant atoms
|
||||
4396 auxiliary atoms
|
||||
47223 final queue length
|
||||
138834 total queue pushes
|
||||
Completing instantiation... [16.250s CPU, 16.235s wall-clock]
|
||||
Instantiating: [20.220s CPU, 20.219s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.050s CPU, 0.051s wall-clock]
|
||||
Checking invariant weight... [0.010s CPU, 0.004s wall-clock]
|
||||
Instantiating groups... [0.060s CPU, 0.063s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.008s wall-clock]
|
||||
Choosing groups...
|
||||
66 uncovered facts
|
||||
Choosing groups: [0.040s CPU, 0.040s wall-clock]
|
||||
Building translation key... [0.020s CPU, 0.014s wall-clock]
|
||||
Computing fact groups: [0.250s CPU, 0.242s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.006s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.020s CPU, 0.014s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.020s CPU, 0.025s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.780s CPU, 0.780s wall-clock]
|
||||
Translating task: [17.210s CPU, 17.201s wall-clock]
|
||||
49010 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
26 propositions removed
|
||||
Detecting unreachable propositions: [8.700s CPU, 8.694s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
92 of 92 variables necessary.
|
||||
40 of 66 mutex groups necessary.
|
||||
39546 of 39546 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [3.420s CPU, 3.417s wall-clock]
|
||||
Translator variables: 92
|
||||
Translator derived variables: 0
|
||||
Translator facts: 1172
|
||||
Translator goal facts: 26
|
||||
Translator mutex groups: 40
|
||||
Translator total mutex groups size: 1080
|
||||
Translator operators: 39546
|
||||
Translator axioms: 0
|
||||
Translator task size: 322456
|
||||
Translator peak memory: 226608 KB
|
||||
Writing output... [5.540s CPU, 5.936s wall-clock]
|
||||
Done! [56.050s CPU, 56.420s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 12.80s
|
||||
Memory: 810MB
|
||||
|
||||
Iteration 1
|
||||
Queue: [(0,105,0,True)]
|
||||
Grounded Until: 0
|
||||
Expected Memory: 810MB
|
||||
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]), ('step', [96]), ('step', [97]), ('step', [98]), ('step', [99]), ('step', [100]), ('step', [101]), ('step', [102]), ('step', [103]), ('step', [104]), ('step', [105]), ('check', [105])]
|
||||
*** 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 : 9777MB
|
||||
Max. Length : 0 steps
|
||||
Models : 0
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user