Add benchmark result [gc-ta3-tt0 | ipc-1998 | mystery-round-1-strips | 27]
This commit is contained in:
parent
2bcd6e348d
commit
03c7a6659d
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-27.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=3
|
||||
- --test-times=0
|
||||
configuration:
|
||||
id: gc-ta3-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=3
|
||||
- --test-times=0
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: mystery-round-1-strips
|
||||
instance: 27
|
||||
ipc: ipc-1998
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: 517f2c0422a36582df17ecebb08e879b170cdfe2 (2017-11-21 02:23:06 +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-ta3-tt0', 'options': ['--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=3', '--test-times=0'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
|
||||
# instance: {'ipc': 'ipc-1998', 'domain': 'mystery-round-1-strips', 'instance': 27}
|
||||
# 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-27.pddl', '--stats', '--verbose', '--print-call', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=3', '--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-27.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_exists_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 6.63 MEM 33476 MAXMEM 243696 STALE 0 MAXMEM_RSS 176244
|
||||
<time name="ALL">6520</time>
|
||||
|
||||
|
|
@ -0,0 +1,159 @@
|
|||
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.022s 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.020s CPU, 0.016s wall-clock]
|
||||
Generated 42 rules.
|
||||
Computing model... [0.200s CPU, 0.196s wall-clock]
|
||||
1446 relevant atoms
|
||||
813 auxiliary atoms
|
||||
2259 final queue length
|
||||
4448 total queue pushes
|
||||
Completing instantiation... [0.450s CPU, 0.456s wall-clock]
|
||||
Instantiating: [0.710s CPU, 0.711s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.025s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.012s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
0 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.050s CPU, 0.051s 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.002s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.020s CPU, 0.019s wall-clock]
|
||||
Translating task: [0.340s CPU, 0.334s 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.160s CPU, 0.165s 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.056s 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.110s CPU, 0.128s wall-clock]
|
||||
Done! [1.470s CPU, 1.487s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.30s
|
||||
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.07s
|
||||
Memory: 68MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 69MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 2.07s
|
||||
Memory: 181MB (+112MB)
|
||||
Solving...
|
||||
Solving Time: 0.03s
|
||||
Memory: 182MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.34s
|
||||
Memory: 193MB (+11MB)
|
||||
Solving...
|
||||
Solving Time: 0.02s
|
||||
Memory: 193MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.29s
|
||||
Memory: 200MB (+7MB)
|
||||
Solving...
|
||||
Solving Time: 0.02s
|
||||
Memory: 200MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.22s
|
||||
Memory: 203MB (+3MB)
|
||||
Answer: 4
|
||||
occurs(action(("overcome","grief","satisfaction","scallion","mars","uranus")),1) occurs(action(("feast","satisfaction","scallion","guava","arizona","pennsylvania")),1) occurs(action(("feast","love","popover","scallion","kentucky","oregon")),1) occurs(action(("feast","triumph","onion","muffin","goias","bosnia")),1) occurs(action(("succumb","grief","satisfaction","guava","mars","uranus")),2) occurs(action(("overcome","boils","love","scallion","mars","uranus")),2) occurs(action(("feast","love","scallion","guava","manitoba","arizona")),2) occurs(action(("feast","satisfaction","guava","wurst","kentucky","oregon")),2) occurs(action(("feast","triumph","muffin","scallion","surrey","guanabara")),2) occurs(action(("succumb","boils","love","guava","mars","uranus")),3) occurs(action(("overcome","loneliness","triumph","scallion","uranus","earth")),3) occurs(action(("feast","triumph","scallion","guava","guanabara","manitoba")),3) occurs(action(("feast","love","guava","wurst","quebec","kentucky")),3) occurs(action(("feast","triumph","guava","scallion","alsace","quebec")),4) occurs(action(("overcome","dread","love","wurst","mars","uranus")),5) occurs(action(("feast","love","wurst","guava","oregon","bavaria")),5) occurs(action(("overcome","anxiety","satisfaction","wurst","mars","uranus")),5) occurs(action(("feast","triumph","scallion","guava","surrey","guanabara")),5) occurs(action(("succumb","loneliness","triumph","scallion","uranus","earth")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 5
|
||||
Time : 2.544s (Solving: 0.01s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 2.528s
|
||||
|
||||
Choices : 336 (Domain: 242)
|
||||
Conflicts : 14 (Analyzed: 14)
|
||||
Restarts : 0
|
||||
Model-Level : 64.0
|
||||
Problems : 5 (Average Length: 6.00 Splits: 0)
|
||||
Lemmas : 14 (Deleted: 0)
|
||||
Binary : 5 (Ratio: 35.71%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 14 (Average Length: 29.2 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 14 (Average: 7.71 Max: 21 Sum: 108)
|
||||
Executed : 14 (Average: 7.71 Max: 21 Sum: 108 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 1123859
|
||||
Atoms : 1120965
|
||||
Bodies : 8870 (Original: 8869)
|
||||
Equivalences : 27367 (Atom=Atom: 7998 Body=Body: 4778 Other: 14591)
|
||||
Tight : No (SCCs: 269 Non-Hcfs: 0 Nodes: 6404 Gammas: 0)
|
||||
Variables : 8849 (Eliminated: 0 Frozen: 4556)
|
||||
Constraints : 21545 (Binary: 96.2% Ternary: 1.7% Other: 2.1%)
|
||||
|
||||
Memory Peak : 203MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 4
|
||||
|
||||
|
||||
Loading…
Reference in New Issue