Add benchmark result [gc-ta1-tt0 | ipc-2002 | driverlog-strips-automatic | 7]
This commit is contained in:
parent
2908c1b664
commit
84b6b4978b
50
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_7.env
Normal file
50
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_7.env
Normal file
@ -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-2002/domains/driverlog-strips-automatic/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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=0
|
||||||
|
configuration:
|
||||||
|
id: gc-ta1-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=1
|
||||||
|
- --test-times=0
|
||||||
|
exitCode: 0
|
||||||
|
instance:
|
||||||
|
domain: driverlog-strips-automatic
|
||||||
|
instance: 7
|
||||||
|
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-tt0/ipc-2002_driverlog-strips-automatic_7.err
Normal file
18
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_7.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'gc-ta1-tt0', '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=0'], 'instanceSets': ['lpnmr-first-plan-not-serializable']}
|
||||||
|
# instance: {'ipc': 'ipc-2002', 'domain': 'driverlog-strips-automatic', 'instance': 7}
|
||||||
|
# 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/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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=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))
|
||||||
|
|
||||||
|
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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_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 2.15 MEM 33728 MAXMEM 117452 STALE 1 MAXMEM_RSS 43396
|
||||||
|
<time name="ALL">2090</time>
|
||||||
|
|
165
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_7.out
Normal file
165
gc-ta1-tt0/ipc-2002_driverlog-strips-automatic_7.out
Normal file
@ -0,0 +1,165 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-7.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.020s CPU, 0.019s 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.010s CPU, 0.020s wall-clock]
|
||||||
|
Preparing model... [0.010s CPU, 0.012s wall-clock]
|
||||||
|
Generated 35 rules.
|
||||||
|
Computing model... [0.060s CPU, 0.061s wall-clock]
|
||||||
|
412 relevant atoms
|
||||||
|
273 auxiliary atoms
|
||||||
|
685 final queue length
|
||||||
|
904 total queue pushes
|
||||||
|
Completing instantiation... [0.060s CPU, 0.055s wall-clock]
|
||||||
|
Instantiating: [0.150s CPU, 0.155s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
11 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.018s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating groups... [0.010s CPU, 0.009s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
3 uncovered facts
|
||||||
|
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.001s wall-clock]
|
||||||
|
Computing fact groups: [0.040s CPU, 0.034s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.000s 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.000s CPU, 0.003s wall-clock]
|
||||||
|
Translating task: [0.050s CPU, 0.056s wall-clock]
|
||||||
|
27 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
12 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.030s CPU, 0.030s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
15 of 15 variables necessary.
|
||||||
|
3 of 15 mutex groups necessary.
|
||||||
|
252 of 252 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Translator variables: 15
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 78
|
||||||
|
Translator goal facts: 10
|
||||||
|
Translator mutex groups: 3
|
||||||
|
Translator total mutex groups size: 12
|
||||||
|
Translator operators: 252
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 1168
|
||||||
|
Translator peak memory: 36812 KB
|
||||||
|
Writing output... [0.020s CPU, 0.026s wall-clock]
|
||||||
|
Done! [0.330s CPU, 0.337s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.06s
|
||||||
|
Memory: 51MB
|
||||||
|
|
||||||
|
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 (+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.02s
|
||||||
|
Memory: 52MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 52MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.04s
|
||||||
|
Memory: 54MB (+2MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 54MB (+0MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.04s
|
||||||
|
Memory: 54MB (+0MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 54MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.10s
|
||||||
|
|
||||||
|
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.02s
|
||||||
|
Memory: 54MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 55MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE
|
||||||
|
Testing Time: 0.03s
|
||||||
|
Memory: 56MB (+1MB)
|
||||||
|
Answer: 3
|
||||||
|
occurs(action(("load-truck","package4","truck3","s1")),1) occurs(action(("load-truck","package5","truck2","s1")),1) occurs(action(("walk","driver2","s2","p0-2")),1) occurs(action(("board-truck","driver1","truck2","s1")),1) occurs(action(("walk","driver3","s2","p2-1")),1) occurs(action(("walk","driver2","p0-2","s0")),2) occurs(action(("drive-truck","truck2","s1","s0","driver1")),2) occurs(action(("walk","driver3","p2-1","s1")),2) occurs(action(("unload-truck","package5","truck2","s0")),3) occurs(action(("disembark-truck","driver1","truck2","s0")),3) occurs(action(("board-truck","driver3","truck3","s1")),3) occurs(action(("drive-truck","truck3","s1","s2","driver3")),4) occurs(action(("unload-truck","package4","truck3","s2")),5) occurs(action(("load-truck","package2","truck3","s2")),5) occurs(action(("drive-truck","truck3","s2","s1","driver3")),6) occurs(action(("unload-truck","package2","truck3","s1")),7) occurs(action(("disembark-truck","driver3","truck3","s1")),7) occurs(action(("board-truck","driver3","truck1","s1")),8) occurs(action(("disembark-truck","driver3","truck1","s1")),9) occurs(action(("board-truck","driver3","truck1","s1")),10)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 5
|
||||||
|
Time : 0.119s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||||
|
CPU Time : 0.116s
|
||||||
|
|
||||||
|
Choices : 240 (Domain: 235)
|
||||||
|
Conflicts : 16 (Analyzed: 15)
|
||||||
|
Restarts : 0
|
||||||
|
Model-Level : 61.3
|
||||||
|
Problems : 5 (Average Length: 7.00 Splits: 0)
|
||||||
|
Lemmas : 15 (Deleted: 0)
|
||||||
|
Binary : 3 (Ratio: 20.00%)
|
||||||
|
Ternary : 2 (Ratio: 13.33%)
|
||||||
|
Conflict : 15 (Average Length: 5.1 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 15 (Average: 6.93 Max: 56 Sum: 104)
|
||||||
|
Executed : 11 (Average: 5.47 Max: 56 Sum: 82 Ratio: 78.85%)
|
||||||
|
Bounded : 4 (Average: 5.50 Max: 7 Sum: 22 Ratio: 21.15%)
|
||||||
|
|
||||||
|
Rules : 4848 (Original: 4748)
|
||||||
|
Atoms : 4074
|
||||||
|
Bodies : 800 (Original: 699)
|
||||||
|
Count : 21 (Original: 29)
|
||||||
|
Equivalences : 414 (Atom=Atom: 13 Body=Body: 0 Other: 401)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 3400 (Eliminated: 0 Frozen: 1626)
|
||||||
|
Constraints : 14308 (Binary: 90.4% Ternary: 5.0% Other: 4.5%)
|
||||||
|
|
||||||
|
Memory Peak : 56MB
|
||||||
|
Max. Length : 10 steps
|
||||||
|
Sol. Length : 10 steps
|
||||||
|
Models : 3
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user