Add benchmark result [gc-ta7-tt0 | ipc-1998 | mystery-round-1-strips | 29]
This commit is contained in:
parent
fa48181f9a
commit
9c416d1c61
GPG Key ID:
1F54208CE70DDF73
|
|
@ -0,0 +1,50 @@
|
|||
command:
|
||||
- timeout
|
||||
- -m=8000000
|
||||
- -t=900
|
||||
- python3
|
||||
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||
- --domain=/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-29.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=7
|
||||
- --test-times=0
|
||||
configuration:
|
||||
id: gc-ta7-tt0
|
||||
instanceSets:
|
||||
- lpnmr-first-plan-not-serializable
|
||||
options:
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=7
|
||||
- --test-times=0
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: mystery-round-1-strips
|
||||
instance: 29
|
||||
ipc: ipc-1998
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
|
||||
plasp: 3.1.1
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
||||
|
|
@ -0,0 +1,33 @@
|
|||
# configuration: {'id': 'gc-ta7-tt0', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=7', '--test-times=0'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
|
||||
# instance: {'ipc': 'ipc-1998', 'domain': 'mystery-round-1-strips', 'instance': 29}
|
||||
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/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-29.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=7', '--test-times=0']
|
||||
# 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))
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
|
||||
mutexGroup(G)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
|
||||
mutexGroup(G)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /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-29.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -B 0.9 --test-until-not-sat --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_actions_1.lp --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
|
||||
FINISHED CPU 4.05 MEM 0 MAXMEM 123488 STALE 1 MAXMEM_RSS 67412
|
||||
<time name="ALL">3970</time>
|
||||
|
||||
|
|
@ -0,0 +1,143 @@
|
|||
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-29.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-29.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.033s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.016s wall-clock]
|
||||
Generated 42 rules.
|
||||
Computing model... [0.220s CPU, 0.209s wall-clock]
|
||||
1534 relevant atoms
|
||||
892 auxiliary atoms
|
||||
2426 final queue length
|
||||
4719 total queue pushes
|
||||
Completing instantiation... [0.480s CPU, 0.483s wall-clock]
|
||||
Instantiating: [0.750s CPU, 0.750s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.030s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.020s CPU, 0.016s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
1 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [0.060s CPU, 0.061s 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.000s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.020s CPU, 0.020s wall-clock]
|
||||
Translating task: [0.360s CPU, 0.358s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
24 propositions removed
|
||||
Detecting unreachable propositions: [0.180s CPU, 0.175s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
22 of 22 variables necessary.
|
||||
0 of 22 mutex groups necessary.
|
||||
1224 of 1224 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.060s CPU, 0.060s wall-clock]
|
||||
Translator variables: 22
|
||||
Translator derived variables: 0
|
||||
Translator facts: 177
|
||||
Translator goal facts: 2
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 1224
|
||||
Translator axioms: 0
|
||||
Translator task size: 7377
|
||||
Translator peak memory: 41164 KB
|
||||
Writing output... [0.120s CPU, 0.137s wall-clock]
|
||||
Done! [1.570s CPU, 1.586s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.32s
|
||||
Memory: 69MB
|
||||
|
||||
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: 70MB (+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
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.08s
|
||||
Memory: 70MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 71MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.24s
|
||||
Memory: 83MB (+12MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 83MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.23s
|
||||
Memory: 83MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action(("feast","achievement","scallop","pork","bavaria","oregon")),1) occurs(action(("feast","excitement","pork","broccoli","manitoba","bavaria")),1) occurs(action(("overcome","jealousy","achievement","pork","neptune","uranus")),2) occurs(action(("feast","achievement","pork","broccoli","quebec","manitoba")),2) occurs(action(("feast","achievement","broccoli","shrimp","pennsylvania","alsace")),3) occurs(action(("succumb","jealousy","achievement","shrimp","neptune","uranus")),4) occurs(action(("feast","achievement","shrimp","melon","oregon","kentucky")),4) occurs(action(("feast","excitement","broccoli","pork","arizona","pennsylvania")),4) occurs(action(("feast","excitement","pork","pear","alsace","quebec")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 3
|
||||
Time : 0.477s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.452s
|
||||
|
||||
Choices : 104 (Domain: 73)
|
||||
Conflicts : 10 (Analyzed: 10)
|
||||
Restarts : 0
|
||||
Model-Level : 42.0
|
||||
Problems : 3 (Average Length: 5.33 Splits: 0)
|
||||
Lemmas : 10 (Deleted: 0)
|
||||
Binary : 3 (Ratio: 30.00%)
|
||||
Ternary : 1 (Ratio: 10.00%)
|
||||
Conflict : 10 (Average Length: 10.8 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 10 (Average: 3.40 Max: 9 Sum: 34)
|
||||
Executed : 10 (Average: 3.40 Max: 9 Sum: 34 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 22522
|
||||
Atoms : 22521
|
||||
Bodies : 7 (Original: 6)
|
||||
Equivalences : 15 (Atom=Atom: 5 Body=Body: 0 Other: 10)
|
||||
Tight : Yes
|
||||
Variables : 6583 (Eliminated: 0 Frozen: 607)
|
||||
Constraints : 20552 (Binary: 95.8% Ternary: 1.8% Other: 2.3%)
|
||||
|
||||
Memory Peak : 83MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Loading…
Reference in New Issue