Add benchmark result [gc-ta1-tt1 | ipc-2002 | depots-strips-automatic | 8]
This commit is contained in:
parent
401f14d093
commit
99bdb78cd8
51
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.env
Normal file
51
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.env
Normal file
@ -0,0 +1,51 @@
|
|||||||
|
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-2002/domains/depots-strips-automatic/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --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
|
||||||
|
- --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: depots-strips-automatic
|
||||||
|
instance: 8
|
||||||
|
ipc: ipc-2002
|
||||||
|
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
|
||||||
|
|
18
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.err
Normal file
18
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '--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-2002', 'domain': 'depots-strips-automatic', 'instance': 8}
|
||||||
|
# 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-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.pddl', '--stats', '--verbose', '--print-call', '--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))
|
||||||
|
|
||||||
|
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.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_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 4.57 MEM 33472 MAXMEM 140728 STALE 1 MAXMEM_RSS 85168
|
||||||
|
<time name="ALL">4500</time>
|
||||||
|
|
160
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.out
Normal file
160
gc-ta1-tt1/ipc-2002_depots-strips-automatic_8.out
Normal file
@ -0,0 +1,160 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.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-2002/domains/depots-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/depots-strips-automatic/instances/instance-8.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.020s CPU, 0.021s 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.020s CPU, 0.023s wall-clock]
|
||||||
|
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||||||
|
Generated 43 rules.
|
||||||
|
Computing model... [0.210s CPU, 0.209s wall-clock]
|
||||||
|
1365 relevant atoms
|
||||||
|
1130 auxiliary atoms
|
||||||
|
2495 final queue length
|
||||||
|
4859 total queue pushes
|
||||||
|
Completing instantiation... [0.390s CPU, 0.392s wall-clock]
|
||||||
|
Instantiating: [0.650s CPU, 0.651s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
16 initial candidates
|
||||||
|
Finding invariants: [0.060s CPU, 0.054s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Instantiating groups... [0.050s CPU, 0.047s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
28 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.011s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Computing fact groups: [0.140s CPU, 0.138s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s 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.006s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.020s CPU, 0.022s wall-clock]
|
||||||
|
Translating task: [0.460s CPU, 0.459s wall-clock]
|
||||||
|
1290 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
40 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.220s CPU, 0.220s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
41 of 41 variables necessary.
|
||||||
|
29 of 41 mutex groups necessary.
|
||||||
|
912 of 912 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.120s CPU, 0.122s wall-clock]
|
||||||
|
Translator variables: 41
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 284
|
||||||
|
Translator goal facts: 7
|
||||||
|
Translator mutex groups: 29
|
||||||
|
Translator total mutex groups size: 329
|
||||||
|
Translator operators: 912
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 8767
|
||||||
|
Translator peak memory: 41676 KB
|
||||||
|
Writing output... [0.150s CPU, 0.157s wall-clock]
|
||||||
|
Done! [1.790s CPU, 1.801s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.36s
|
||||||
|
Memory: 71MB
|
||||||
|
|
||||||
|
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: 71MB (+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.11s
|
||||||
|
Memory: 71MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 72MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.15s
|
||||||
|
|
||||||
|
Iteration 3
|
||||||
|
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 5
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.13s
|
||||||
|
Memory: 79MB (+7MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 82MB (+3MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.18s
|
||||||
|
|
||||||
|
Iteration 4
|
||||||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 10
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.12s
|
||||||
|
Memory: 86MB (+4MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 89MB (+3MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE
|
||||||
|
Testing Time: 0.27s
|
||||||
|
Memory: 89MB (+0MB)
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("lift","hoist0","crate2","pallet0","depot0")),1) occurs(action(("lift","hoist1","crate0","pallet4","distributor0")),1) occurs(action(("drive","truck1","distributor0","distributor1")),1) occurs(action(("lift","hoist2","crate7","crate4","distributor1")),1) occurs(action(("load","hoist2","crate7","truck1","distributor1")),2) occurs(action(("load","hoist1","crate0","truck0","distributor0")),2) occurs(action(("drive","truck0","distributor0","distributor1")),2) occurs(action(("drive","truck1","distributor1","distributor0")),2) occurs(action(("lift","hoist1","crate8","crate3","distributor0")),3) occurs(action(("lift","hoist2","crate4","pallet3","distributor1")),3) occurs(action(("drop","hoist1","crate8","pallet4","distributor0")),4) occurs(action(("load","hoist2","crate4","truck0","distributor1")),4) occurs(action(("lift","hoist1","crate3","pallet5","distributor0")),5) occurs(action(("unload","hoist2","crate0","truck0","distributor1")),5) occurs(action(("drop","hoist1","crate3","crate8","distributor0")),6) occurs(action(("drop","hoist2","crate0","pallet3","distributor1")),6) occurs(action(("lift","hoist2","crate9","pallet2","distributor1")),7) occurs(action(("lift","hoist1","crate6","crate5","distributor0")),7) occurs(action(("load","hoist2","crate9","truck0","distributor1")),8) occurs(action(("load","hoist1","crate6","truck1","distributor0")),8) occurs(action(("drive","truck0","distributor1","depot0")),8) occurs(action(("drive","truck1","distributor0","distributor1")),8) occurs(action(("unload","hoist2","crate6","truck1","distributor1")),9) occurs(action(("lift","hoist1","crate5","crate1","distributor0")),9) occurs(action(("load","hoist0","crate2","truck0","depot0")),9) occurs(action(("drive","truck1","distributor1","distributor0")),9) occurs(action(("drop","hoist2","crate6","pallet2","distributor1")),10) occurs(action(("unload","hoist0","crate9","truck0","depot0")),10) occurs(action(("drop","hoist1","crate5","pallet5","distributor0")),10) occurs(action(("drop","hoist0","crate9","pallet0","depot0")),11) occurs(action(("lift","hoist1","crate1","pallet1","distributor0")),11) occurs(action(("load","hoist1","crate1","truck1","distributor0")),12) occurs(action(("drive","truck0","depot0","distributor1")),12) occurs(action(("drive","truck1","distributor0","distributor1")),12) occurs(action(("unload","hoist0","crate4","truck0","depot0")),12) occurs(action(("unload","hoist2","crate1","truck1","distributor1")),13) occurs(action(("drive","truck1","distributor1","distributor0")),13) occurs(action(("drop","hoist2","crate1","crate0","distributor1")),14) occurs(action(("unload","hoist1","crate7","truck1","distributor0")),14) occurs(action(("drive","truck1","distributor0","distributor1")),14) occurs(action(("drive","truck0","distributor1","distributor0")),14) occurs(action(("drop","hoist1","crate7","pallet1","distributor0")),15) occurs(action(("drop","hoist0","crate4","crate9","depot0")),15) occurs(action(("drive","truck1","distributor1","distributor0")),15)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 4
|
||||||
|
Time : 0.878s (Solving: 0.01s 1st Model: 0.01s Unsat: 0.00s)
|
||||||
|
CPU Time : 0.852s
|
||||||
|
|
||||||
|
Choices : 228 (Domain: 219)
|
||||||
|
Conflicts : 41 (Analyzed: 39)
|
||||||
|
Restarts : 0
|
||||||
|
Model-Level : 132.0
|
||||||
|
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||||||
|
Lemmas : 39 (Deleted: 0)
|
||||||
|
Binary : 3 (Ratio: 7.69%)
|
||||||
|
Ternary : 2 (Ratio: 5.13%)
|
||||||
|
Conflict : 39 (Average Length: 47.9 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 39 (Average: 3.85 Max: 19 Sum: 150)
|
||||||
|
Executed : 35 (Average: 2.90 Max: 19 Sum: 113 Ratio: 75.33%)
|
||||||
|
Bounded : 4 (Average: 9.25 Max: 12 Sum: 37 Ratio: 24.67%)
|
||||||
|
|
||||||
|
Rules : 25938
|
||||||
|
Atoms : 25938
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 20751 (Eliminated: 0 Frozen: 3676)
|
||||||
|
Constraints : 152463 (Binary: 95.5% Ternary: 2.3% Other: 2.1%)
|
||||||
|
|
||||||
|
Memory Peak : 102MB
|
||||||
|
Max. Length : 15 steps
|
||||||
|
Sol. Length : 15 steps
|
||||||
|
Models : 1
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user