Add benchmark result [gc-ta1-tt1 | ipc-1998 | logistics-round-1-strips | 33]
This commit is contained in:
parent
2a6cd28c8a
commit
d32e6ac568
55
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.env
Normal file
55
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.env
Normal file
@ -0,0 +1,55 @@
|
||||
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-1998/domains/logistics-round-1-strips/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.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-easy-instances
|
||||
- lpnmr-hard-instances
|
||||
- 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: logistics-round-1-strips
|
||||
instance: 33
|
||||
ipc: ipc-1998
|
||||
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
|
||||
|
24
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.err
Normal file
24
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.err
Normal file
@ -0,0 +1,24 @@
|
||||
# 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-easy-instances', 'lpnmr-hard-instances', 'lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
|
||||
# instance: {'ipc': 'ipc-1998', 'domain': 'logistics-round-1-strips', 'instance': 33}
|
||||
# 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-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.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/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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.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 -m 8192 -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_forall_t.lp --test-once --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
|
||||
FINISHED CPU 2.08 MEM 33472 MAXMEM 118156 STALE 1 MAXMEM_RSS 44028
|
||||
<time name="ALL">2020</time>
|
||||
|
135
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.out
Normal file
135
gc-ta1-tt1/ipc-1998_logistics-round-1-strips_33.out
Normal file
@ -0,0 +1,135 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.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/logistics-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/logistics-round-1-strips/instances/instance-33.pddl
|
||||
Parsing...
|
||||
Parsing: [0.010s CPU, 0.016s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
|
||||
Preparing model... [0.010s CPU, 0.012s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [0.090s CPU, 0.091s wall-clock]
|
||||
560 relevant atoms
|
||||
534 auxiliary atoms
|
||||
1094 final queue length
|
||||
1317 total queue pushes
|
||||
Completing instantiation... [0.080s CPU, 0.085s wall-clock]
|
||||
Instantiating: [0.220s CPU, 0.217s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.010s CPU, 0.010s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.010s CPU, 0.011s 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.030s CPU, 0.034s 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.010s CPU, 0.004s wall-clock]
|
||||
Translating task: [0.070s CPU, 0.068s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
17 propositions removed
|
||||
Detecting unreachable propositions: [0.040s CPU, 0.039s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
17 of 17 variables necessary.
|
||||
0 of 17 mutex groups necessary.
|
||||
318 of 318 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||||
Translator variables: 17
|
||||
Translator derived variables: 0
|
||||
Translator facts: 133
|
||||
Translator goal facts: 7
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 318
|
||||
Translator axioms: 0
|
||||
Translator task size: 1405
|
||||
Translator peak memory: 37068 KB
|
||||
Writing output... [0.030s CPU, 0.032s wall-clock]
|
||||
Done! [0.410s CPU, 0.423s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.07s
|
||||
Memory: 52MB
|
||||
|
||||
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: 52MB (+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
|
||||
Expected Memory: 52MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 53MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 56MB (+2MB)
|
||||
Answer: 1
|
||||
occurs(action(("load-truck","package2","truck2","city1-2")),1) occurs(action(("drive-truck","truck2","city1-2","city1-1","city1")),1) occurs(action(("drive-truck","truck4","city3-1","city3-2","city3")),1) occurs(action(("fly-airplane","plane1","city1-2","city2-2")),1) occurs(action(("load-truck","package7","truck8","city2-1")),1) occurs(action(("drive-truck","truck8","city2-1","city2-2","city2")),1) occurs(action(("load-airplane","package1","plane1","city1-2")),1) occurs(action(("load-truck","package3","truck8","city2-1")),1) occurs(action(("load-truck","package4","truck4","city3-1")),1) occurs(action(("unload-truck","package2","truck2","city1-1")),2) occurs(action(("unload-truck","package7","truck8","city2-2")),2) occurs(action(("load-airplane","package5","plane1","city2-2")),2) occurs(action(("load-airplane","package6","plane1","city2-2")),2) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),2) occurs(action(("unload-airplane","package1","plane1","city2-2")),2) occurs(action(("unload-truck","package3","truck8","city2-2")),2) occurs(action(("unload-truck","package4","truck4","city3-2")),2) occurs(action(("drive-truck","truck2","city1-1","city1-2","city1")),2) occurs(action(("unload-airplane","package5","plane1","city3-2")),3) occurs(action(("unload-airplane","package6","plane1","city3-2")),3) occurs(action(("load-truck","package1","truck8","city2-2")),3) occurs(action(("load-airplane","package4","plane1","city3-2")),3) occurs(action(("fly-airplane","plane1","city3-2","city2-2")),3) occurs(action(("drive-truck","truck8","city2-2","city2-1","city2")),3) occurs(action(("drive-truck","truck4","city3-2","city3-1","city3")),3) occurs(action(("unload-truck","package1","truck8","city2-1")),4) occurs(action(("unload-airplane","package4","plane1","city2-2")),4) occurs(action(("load-airplane","package3","plane1","city2-2")),4) occurs(action(("fly-airplane","plane1","city2-2","city3-2")),4) occurs(action(("unload-airplane","package3","plane1","city3-2")),5) occurs(action(("fly-airplane","plane1","city3-2","city1-2")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 2
|
||||
Time : 0.104s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.100s
|
||||
|
||||
Choices : 83 (Domain: 72)
|
||||
Conflicts : 1 (Analyzed: 1)
|
||||
Restarts : 0
|
||||
Model-Level : 89.0
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 1 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 1 (Average Length: 4.0 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 1 (Average: 1.00 Max: 1 Sum: 1)
|
||||
Executed : 1 (Average: 1.00 Max: 1 Sum: 1 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 4711
|
||||
Atoms : 4711
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 2519 (Eliminated: 0 Frozen: 462)
|
||||
Constraints : 4619 (Binary: 88.7% Ternary: 8.4% Other: 2.9%)
|
||||
|
||||
Memory Peak : 56MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 1
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user