Add benchmark result [gc-ta1-tt1 | ipc-2002 | depots-strips-automatic | 6]
This commit is contained in:
parent
5db3ace6cf
commit
a8c4f06cfc
GPG Key ID:
1F54208CE70DDF73
|
|
@ -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-6.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: 6
|
||||
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
|
||||
|
||||
|
|
@ -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': 6}
|
||||
# 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-6.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-6.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 7.46 MEM 33472 MAXMEM 212892 STALE 1 MAXMEM_RSS 155436
|
||||
<time name="ALL">7370</time>
|
||||
|
||||
|
|
@ -0,0 +1,186 @@
|
|||
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-6.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-6.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.022s 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.024s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.017s wall-clock]
|
||||
Generated 43 rules.
|
||||
Computing model... [0.320s CPU, 0.327s wall-clock]
|
||||
2274 relevant atoms
|
||||
1737 auxiliary atoms
|
||||
4011 final queue length
|
||||
8420 total queue pushes
|
||||
Completing instantiation... [0.730s CPU, 0.729s wall-clock]
|
||||
Instantiating: [1.110s CPU, 1.110s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
16 initial candidates
|
||||
Finding invariants: [0.040s CPU, 0.048s wall-clock]
|
||||
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||||
Instantiating groups... [0.060s CPU, 0.061s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||||
Choosing groups...
|
||||
27 uncovered facts
|
||||
Choosing groups: [0.020s CPU, 0.017s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.006s wall-clock]
|
||||
Computing fact groups: [0.160s CPU, 0.168s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.006s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.010s CPU, 0.010s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.040s CPU, 0.040s wall-clock]
|
||||
Translating task: [0.830s CPU, 0.826s wall-clock]
|
||||
2295 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
44 propositions removed
|
||||
Detecting unreachable propositions: [0.400s CPU, 0.401s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
53 of 53 variables necessary.
|
||||
36 of 53 mutex groups necessary.
|
||||
1632 of 1632 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.220s CPU, 0.221s wall-clock]
|
||||
Translator variables: 53
|
||||
Translator derived variables: 0
|
||||
Translator facts: 438
|
||||
Translator goal facts: 11
|
||||
Translator mutex groups: 36
|
||||
Translator total mutex groups size: 516
|
||||
Translator operators: 1632
|
||||
Translator axioms: 0
|
||||
Translator task size: 15724
|
||||
Translator peak memory: 46028 KB
|
||||
Writing output... [0.270s CPU, 0.283s wall-clock]
|
||||
Done! [3.060s CPU, 3.085s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.59s
|
||||
Memory: 89MB
|
||||
|
||||
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: 89MB (+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.21s
|
||||
Memory: 89MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 91MB (+2MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.29s
|
||||
|
||||
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.21s
|
||||
Memory: 98MB (+7MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 103MB (+5MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.32s
|
||||
|
||||
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.25s
|
||||
Memory: 113MB (+10MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 119MB (+6MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.36s
|
||||
|
||||
Iteration 5
|
||||
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 15
|
||||
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||
Grounding Time: 0.22s
|
||||
Memory: 127MB (+8MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.04s
|
||||
Memory: 133MB (+6MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.36s
|
||||
|
||||
Iteration 6
|
||||
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 20
|
||||
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||
Grounding Time: 0.23s
|
||||
Memory: 140MB (+7MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.04s
|
||||
Memory: 148MB (+8MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.49s
|
||||
Memory: 155MB (+7MB)
|
||||
Answer: 1
|
||||
occurs(action(("lift","hoist0","crate11","crate6","depot0")),1) occurs(action(("lift","hoist2","crate10","crate5","distributor1")),1) occurs(action(("drive","truck0","distributor1","distributor0")),1) occurs(action(("lift","hoist1","crate14","crate13","distributor0")),1) occurs(action(("load","hoist0","crate11","truck1","depot0")),2) occurs(action(("load","hoist1","crate14","truck0","distributor0")),2) occurs(action(("lift","hoist1","crate13","crate12","distributor0")),3) occurs(action(("lift","hoist0","crate6","crate1","depot0")),3) occurs(action(("load","hoist0","crate6","truck1","depot0")),4) occurs(action(("load","hoist1","crate13","truck0","distributor0")),4) occurs(action(("lift","hoist0","crate1","pallet0","depot0")),5) occurs(action(("lift","hoist1","crate12","crate9","distributor0")),5) occurs(action(("load","hoist1","crate12","truck0","distributor0")),6) occurs(action(("load","hoist0","crate1","truck1","depot0")),6) occurs(action(("drive","truck1","depot0","distributor1")),6) occurs(action(("lift","hoist1","crate9","crate8","distributor0")),7) occurs(action(("load","hoist2","crate10","truck1","distributor1")),7) occurs(action(("lift","hoist2","crate5","crate2","distributor1")),8) occurs(action(("load","hoist1","crate9","truck0","distributor0")),8) occurs(action(("load","hoist2","crate5","truck1","distributor1")),9) occurs(action(("lift","hoist1","crate8","crate7","distributor0")),9) occurs(action(("lift","hoist2","crate2","crate0","distributor1")),10) occurs(action(("load","hoist1","crate8","truck0","distributor0")),10) occurs(action(("drive","truck0","distributor0","depot0")),10) occurs(action(("unload","hoist0","crate8","truck0","depot0")),11) occurs(action(("lift","hoist1","crate7","crate4","distributor0")),11) occurs(action(("load","hoist2","crate2","truck1","distributor1")),11) occurs(action(("drive","truck0","depot0","distributor1")),11) occurs(action(("drive","truck1","distributor1","depot0")),11) occurs(action(("drop","hoist0","crate8","pallet0","depot0")),12) occurs(action(("lift","hoist2","crate0","pallet2","distributor1")),12) occurs(action(("drive","truck0","distributor1","depot0")),13) occurs(action(("load","hoist2","crate0","truck0","distributor1")),13) occurs(action(("unload","hoist0","crate0","truck0","depot0")),14) occurs(action(("drive","truck0","depot0","distributor0")),14) occurs(action(("drop","hoist0","crate0","crate8","depot0")),15) occurs(action(("load","hoist1","crate7","truck0","distributor0")),15) occurs(action(("unload","hoist0","crate5","truck1","depot0")),16) occurs(action(("lift","hoist1","crate4","crate3","distributor0")),16) occurs(action(("drop","hoist0","crate5","crate0","depot0")),17) occurs(action(("load","hoist1","crate4","truck0","distributor0")),17) occurs(action(("lift","hoist1","crate3","pallet1","distributor0")),18) occurs(action(("unload","hoist0","crate11","truck1","depot0")),18) occurs(action(("drive","truck1","depot0","distributor0")),18) occurs(action(("drop","hoist0","crate11","crate5","depot0")),19) occurs(action(("load","hoist1","crate3","truck0","distributor0")),19) occurs(action(("unload","hoist1","crate9","truck0","distributor0")),20) occurs(action(("drive","truck0","distributor0","depot0")),20) occurs(action(("drop","hoist1","crate9","pallet1","distributor0")),21) occurs(action(("unload","hoist0","crate4","truck0","depot0")),21) occurs(action(("drive","truck0","depot0","distributor1")),21) occurs(action(("drop","hoist0","crate4","crate11","depot0")),22) occurs(action(("unload","hoist2","crate12","truck0","distributor1")),22) occurs(action(("unload","hoist1","crate1","truck1","distributor0")),22) occurs(action(("drive","truck1","distributor0","depot0")),22) occurs(action(("drop","hoist2","crate12","pallet2","distributor1")),23) occurs(action(("drop","hoist1","crate1","crate9","distributor0")),23) occurs(action(("unload","hoist0","crate10","truck1","depot0")),23) occurs(action(("drive","truck1","depot0","distributor0")),23) occurs(action(("drop","hoist0","crate10","crate4","depot0")),24) occurs(action(("unload","hoist2","crate3","truck0","distributor1")),24) occurs(action(("unload","hoist1","crate2","truck1","distributor0")),24) occurs(action(("drive","truck0","distributor1","depot0")),24) occurs(action(("drive","truck1","distributor0","depot0")),24) occurs(action(("drop","hoist2","crate3","crate12","distributor1")),25) occurs(action(("drop","hoist1","crate2","crate1","distributor0")),25) occurs(action(("drive","truck0","depot0","distributor1")),25)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 6
|
||||
Time : 2.336s (Solving: 0.05s 1st Model: 0.02s Unsat: 0.03s)
|
||||
CPU Time : 2.308s
|
||||
|
||||
Choices : 838 (Domain: 833)
|
||||
Conflicts : 80 (Analyzed: 77)
|
||||
Restarts : 0
|
||||
Model-Level : 188.0
|
||||
Problems : 6 (Average Length: 14.50 Splits: 0)
|
||||
Lemmas : 77 (Deleted: 0)
|
||||
Binary : 4 (Ratio: 5.19%)
|
||||
Ternary : 2 (Ratio: 2.60%)
|
||||
Conflict : 77 (Average Length: 39.6 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 77 (Average: 12.77 Max: 107 Sum: 983)
|
||||
Executed : 60 (Average: 8.79 Max: 107 Sum: 677 Ratio: 68.87%)
|
||||
Bounded : 17 (Average: 18.00 Max: 22 Sum: 306 Ratio: 31.13%)
|
||||
|
||||
Rules : 46444
|
||||
Atoms : 46444
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 59624 (Eliminated: 0 Frozen: 9617)
|
||||
Constraints : 405153 (Binary: 96.0% Ternary: 2.0% Other: 2.0%)
|
||||
|
||||
Memory Peak : 170MB
|
||||
Max. Length : 25 steps
|
||||
Sol. Length : 25 steps
|
||||
Models : 1
|
||||
|
||||
|
||||
Loading…
Reference in New Issue