Add benchmark result [gc-ta1-tt1 | ipc-2011 | tidybot-sequential-satisficing | 18]
This commit is contained in:
parent
096a9940fb
commit
18cd874b0b
53
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.env
Normal file
53
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.env
Normal file
@ -0,0 +1,53 @@
|
|||||||
|
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/tidybot-sequential-satisficing/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/tidybot-sequential-satisficing/instances/instance-18.pddl
|
||||||
|
- --stats
|
||||||
|
- --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
|
||||||
|
configuration:
|
||||||
|
id: gc-ta1-tt1
|
||||||
|
instanceSets:
|
||||||
|
- lpnmr-first-plan-not-serializable
|
||||||
|
- rintanen-aij-2012
|
||||||
|
options:
|
||||||
|
- --stats
|
||||||
|
- --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
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: tidybot-sequential-satisficing
|
||||||
|
instance: 18
|
||||||
|
ipc: ipc-2011
|
||||||
|
versions:
|
||||||
|
clingo: 5.2.2
|
||||||
|
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||||
|
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
|
||||||
|
plasp: 3.1.1
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
17
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.err
Normal file
17
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.err
Normal file
@ -0,0 +1,17 @@
|
|||||||
|
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--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'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
|
||||||
|
# instance: {'ipc': 'ipc-2011', 'domain': 'tidybot-sequential-satisficing', 'instance': 18}
|
||||||
|
# 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/tidybot-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/tidybot-sequential-satisficing/instances/instance-18.pddl', '--stats', '--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']
|
||||||
|
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
# exit code: 0
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(actionCosts))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(axiomRules))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(conditionalEffects))
|
||||||
|
|
||||||
|
TIMEOUT CPU 900.05 MEM 4284564 MAXMEM 4284564 STALE 1 MAXMEM_RSS 4213532
|
||||||
|
<time name="ALL">899930</time>
|
||||||
|
|
69
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.out
Normal file
69
gc-ta1-tt1/ipc-2011_tidybot-sequential-satisficing_18.out
Normal file
@ -0,0 +1,69 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/tidybot-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/tidybot-sequential-satisficing/instances/instance-18.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/tidybot-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/tidybot-sequential-satisficing/instances/instance-18.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.090s CPU, 0.095s wall-clock]
|
||||||
|
Normalizing task... [0.010s CPU, 0.007s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.020s CPU, 0.017s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.210s CPU, 0.216s wall-clock]
|
||||||
|
Preparing model... [0.070s CPU, 0.069s wall-clock]
|
||||||
|
Generated 400 rules.
|
||||||
|
Computing model... [12.620s CPU, 12.616s wall-clock]
|
||||||
|
63291 relevant atoms
|
||||||
|
47672 auxiliary atoms
|
||||||
|
110963 final queue length
|
||||||
|
328224 total queue pushes
|
||||||
|
Completing instantiation... [38.560s CPU, 38.539s wall-clock]
|
||||||
|
Instantiating: [51.620s CPU, 51.587s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
41 initial candidates
|
||||||
|
Finding invariants: [1.100s CPU, 1.101s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
547 uncovered facts
|
||||||
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building translation key... [0.020s CPU, 0.020s wall-clock]
|
||||||
|
Computing fact groups: [1.160s CPU, 1.168s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.005s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [2.360s CPU, 2.357s wall-clock]
|
||||||
|
Translating task: [45.530s CPU, 45.503s wall-clock]
|
||||||
|
182223 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
2 propositions removed
|
||||||
|
Detecting unreachable propositions: [20.590s CPU, 20.590s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
549 of 549 variables necessary.
|
||||||
|
1 of 3 mutex groups necessary.
|
||||||
|
62529 of 62529 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [15.870s CPU, 15.855s wall-clock]
|
||||||
|
Translator variables: 549
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 1101
|
||||||
|
Translator goal facts: 4
|
||||||
|
Translator mutex groups: 1
|
||||||
|
Translator total mutex groups size: 2
|
||||||
|
Translator operators: 62529
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 777730
|
||||||
|
Translator peak memory: 450360 KB
|
||||||
|
Writing output... [12.680s CPU, 13.147s wall-clock]
|
||||||
|
Done! [148.960s CPU, 149.369s wall-clock]
|
||||||
|
|
Loading…
Reference in New Issue
Block a user