Add benchmark result [gc-ta1-tt1 | ipc-2006 | trucks-propositional-strips | 7]
This commit is contained in:
parent
e446260925
commit
f2dc295fbd
53
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.env
Normal file
53
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.env
Normal file
@ -0,0 +1,53 @@
|
|||||||
|
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-2006/domains/trucks-propositional-strips/domains/domain-7.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-7.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-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: trucks-propositional-strips
|
||||||
|
instance: 7
|
||||||
|
ipc: ipc-2006
|
||||||
|
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
|
||||||
|
|
18
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.err
Normal file
18
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# 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-first-plan-not-serializable', 'rintanen-aij-2012']}
|
||||||
|
# instance: {'ipc': 'ipc-2006', 'domain': 'trucks-propositional-strips', 'instance': 7}
|
||||||
|
# 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-2006/domains/trucks-propositional-strips/domains/domain-7.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-7.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/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-2006/domains/trucks-propositional-strips/domains/domain-7.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/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 -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 28.91 MEM 33472 MAXMEM 138656 STALE 1 MAXMEM_RSS 65396
|
||||||
|
<time name="ALL">28840</time>
|
||||||
|
|
201
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.out
Normal file
201
gc-ta1-tt1/ipc-2006_trucks-propositional-strips_7.out
Normal file
@ -0,0 +1,201 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/domains/domain-7.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/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-2006/domains/trucks-propositional-strips/domains/domain-7.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/trucks-propositional-strips/instances/instance-7.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [1.030s CPU, 1.031s wall-clock]
|
||||||
|
Normalizing task... [0.160s CPU, 0.167s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.150s CPU, 0.144s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.300s CPU, 0.303s wall-clock]
|
||||||
|
Preparing model... [0.220s CPU, 0.222s wall-clock]
|
||||||
|
Generated 3241 rules.
|
||||||
|
Computing model... [0.110s CPU, 0.111s wall-clock]
|
||||||
|
1380 relevant atoms
|
||||||
|
0 auxiliary atoms
|
||||||
|
1380 final queue length
|
||||||
|
3253 total queue pushes
|
||||||
|
Completing instantiation... [0.220s CPU, 0.224s wall-clock]
|
||||||
|
Instantiating: [1.020s CPU, 1.019s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
274 initial candidates
|
||||||
|
Finding invariants: [20.640s CPU, 20.623s wall-clock]
|
||||||
|
Checking invariant weight... [0.040s CPU, 0.042s wall-clock]
|
||||||
|
Instantiating groups... [0.010s CPU, 0.013s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.005s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
213 uncovered facts
|
||||||
|
Choosing groups: [0.030s CPU, 0.031s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.007s wall-clock]
|
||||||
|
Computing fact groups: [20.790s CPU, 20.775s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.020s CPU, 0.015s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.020s CPU, 0.028s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.020s CPU, 0.015s wall-clock]
|
||||||
|
Translating task: [0.620s CPU, 0.610s wall-clock]
|
||||||
|
72 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
2 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.240s CPU, 0.246s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
17 of 221 variables necessary.
|
||||||
|
9 of 234 mutex groups necessary.
|
||||||
|
1104 of 1104 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.070s CPU, 0.069s wall-clock]
|
||||||
|
Translator variables: 17
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 85
|
||||||
|
Translator goal facts: 6
|
||||||
|
Translator mutex groups: 9
|
||||||
|
Translator total mutex groups size: 69
|
||||||
|
Translator operators: 1104
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 5113
|
||||||
|
Translator peak memory: 57760 KB
|
||||||
|
Writing output... [0.100s CPU, 0.106s wall-clock]
|
||||||
|
Done! [24.090s CPU, 24.086s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.15s
|
||||||
|
Memory: 55MB
|
||||||
|
|
||||||
|
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: 55MB (+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: 55MB
|
||||||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 57MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 57MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
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
|
||||||
|
Expected Memory: 59.0MB
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.02s
|
||||||
|
Memory: 58MB (+1MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.03s
|
||||||
|
Memory: 59MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.11s
|
||||||
|
Memory: 60MB (+1MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.05s
|
||||||
|
Memory: 60MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.22s
|
||||||
|
|
||||||
|
Iteration 4
|
||||||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 10
|
||||||
|
Expected Memory: 62.0MB
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 64MB (+4MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 1.16s
|
||||||
|
Memory: 70MB (+6MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 1.21s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Expected Memory: 80.0MB
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 70MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 1.49s
|
||||||
|
Memory: 76MB (+6MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 1.54s
|
||||||
|
|
||||||
|
Iteration 6
|
||||||
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 20
|
||||||
|
Expected Memory: 86.0MB
|
||||||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 76MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.05s
|
||||||
|
Memory: 77MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE?
|
||||||
|
Testing Time: 0.00s
|
||||||
|
Memory: 77MB (+0MB)
|
||||||
|
Answer: 2
|
||||||
|
occurs(action("drive_truck1_l3_l1_t0_t1"),1) occurs(action("load_package3_truck1_a3_l1"),2) occurs(action("drive_truck1_l1_l2_t1_t2"),3) occurs(action("unload_package3_truck1_a3_l2"),4) occurs(action("deliver_package3_l2_t2_t4"),5) occurs(action("drive_truck1_l2_l1_t2_t3"),6) occurs(action("load_package2_truck1_a3_l1"),7) occurs(action("load_package1_truck1_a2_l1"),8) occurs(action("drive_truck1_l1_l3_t3_t4"),9) occurs(action("unload_package1_truck1_a2_l3"),10) occurs(action("deliver_package1_l3_t4_t4"),11) occurs(action("unload_package2_truck1_a3_l3"),11) occurs(action("deliver_package2_l3_t4_t4"),12) occurs(action("drive_truck1_l3_l1_t4_t5"),13) occurs(action("load_package4_truck1_a2_l1"),14) occurs(action("drive_truck1_l1_l2_t5_t6"),15) occurs(action("unload_package4_truck1_a2_l2"),16) occurs(action("deliver_package4_l2_t6_t8"),17) occurs(action("drive_truck1_l2_l1_t6_t7"),18) occurs(action("load_package6_truck1_a2_l1"),19) occurs(action("load_package5_truck1_a1_l1"),20) occurs(action("drive_truck1_l1_l3_t7_t8"),21) occurs(action("unload_package5_truck1_a1_l3"),22) occurs(action("deliver_package5_l3_t8_t8"),23) occurs(action("unload_package6_truck1_a2_l3"),24) occurs(action("deliver_package6_l3_t8_t8"),25)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 7
|
||||||
|
Time : 3.200s (Solving: 2.77s 1st Model: 0.08s Unsat: 0.05s)
|
||||||
|
CPU Time : 3.184s
|
||||||
|
|
||||||
|
Choices : 48689 (Domain: 48682)
|
||||||
|
Conflicts : 19065 (Analyzed: 19063)
|
||||||
|
Restarts : 218 (Average: 87.44 Last: 145)
|
||||||
|
Model-Level : 114.5
|
||||||
|
Problems : 7 (Average Length: 14.14 Splits: 0)
|
||||||
|
Lemmas : 19063 (Deleted: 16107)
|
||||||
|
Binary : 117 (Ratio: 0.61%)
|
||||||
|
Ternary : 187 (Ratio: 0.98%)
|
||||||
|
Conflict : 19063 (Average Length: 525.0 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 19063 (Average: 1.94 Max: 74 Sum: 36891)
|
||||||
|
Executed : 19028 (Average: 1.92 Max: 74 Sum: 36520 Ratio: 98.99%)
|
||||||
|
Bounded : 35 (Average: 10.60 Max: 22 Sum: 371 Ratio: 1.01%)
|
||||||
|
|
||||||
|
Rules : 22049 (Original: 21991)
|
||||||
|
Atoms : 16122
|
||||||
|
Bodies : 4991 (Original: 4935)
|
||||||
|
Count : 81 (Original: 92)
|
||||||
|
Equivalences : 2240 (Atom=Atom: 19 Body=Body: 0 Other: 2221)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 11860 (Eliminated: 0 Frozen: 8463)
|
||||||
|
Constraints : 79625 (Binary: 94.7% Ternary: 2.1% Other: 3.2%)
|
||||||
|
|
||||||
|
Memory Peak : 78MB
|
||||||
|
Max. Length : 25 steps
|
||||||
|
Sol. Length : 25 steps
|
||||||
|
Models : 2
|
||||||
|
|
||||||
|
|
Loading…
x
Reference in New Issue
Block a user