Add benchmark result [gc-ta1-tt1 | ipc-2000 | elevator-strips-simple-typed | 49]
This commit is contained in:
parent
7fbccca643
commit
478eced1c7
55
gc-ta1-tt1/ipc-2000_elevator-strips-simple-typed_49.env
Normal file
55
gc-ta1-tt1/ipc-2000_elevator-strips-simple-typed_49.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-2000/domains/elevator-strips-simple-typed/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-49.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: elevator-strips-simple-typed
|
||||
instance: 49
|
||||
ipc: ipc-2000
|
||||
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-2000_elevator-strips-simple-typed_49.err
Normal file
24
gc-ta1-tt1/ipc-2000_elevator-strips-simple-typed_49.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-2000', 'domain': 'elevator-strips-simple-typed', 'instance': 49}
|
||||
# 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-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-49.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-49.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.61 MEM 33472 MAXMEM 118252 STALE 1 MAXMEM_RSS 44496
|
||||
<time name="ALL">2550</time>
|
||||
|
163
gc-ta1-tt1/ipc-2000_elevator-strips-simple-typed_49.out
Normal file
163
gc-ta1-tt1/ipc-2000_elevator-strips-simple-typed_49.out
Normal file
@ -0,0 +1,163 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-49.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-2000/domains/elevator-strips-simple-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/elevator-strips-simple-typed/instances/instance-49.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.032s wall-clock]
|
||||
Normalizing task... [0.010s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.000s CPU, 0.009s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.028s wall-clock]
|
||||
Generated 18 rules.
|
||||
Computing model... [0.100s CPU, 0.095s wall-clock]
|
||||
741 relevant atoms
|
||||
490 auxiliary atoms
|
||||
1231 final queue length
|
||||
1592 total queue pushes
|
||||
Completing instantiation... [0.070s CPU, 0.074s wall-clock]
|
||||
Instantiating: [0.210s CPU, 0.219s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
6 initial candidates
|
||||
Finding invariants: [0.010s CPU, 0.005s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
20 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.000s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.010s CPU, 0.010s 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.000s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.010s CPU, 0.003s wall-clock]
|
||||
Translating task: [0.070s CPU, 0.070s wall-clock]
|
||||
10 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
1 propositions removed
|
||||
Detecting unreachable propositions: [0.040s CPU, 0.040s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
21 of 21 variables necessary.
|
||||
0 of 1 mutex groups necessary.
|
||||
400 of 400 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.010s wall-clock]
|
||||
Translator variables: 21
|
||||
Translator derived variables: 0
|
||||
Translator facts: 60
|
||||
Translator goal facts: 10
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 400
|
||||
Translator axioms: 0
|
||||
Translator task size: 1311
|
||||
Translator peak memory: 37068 KB
|
||||
Writing output... [0.030s CPU, 0.035s wall-clock]
|
||||
Done! [0.420s CPU, 0.423s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.06s
|
||||
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)
|
||||
UNSAT
|
||||
Iteration Time: 0.03s
|
||||
|
||||
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: 56.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 55MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.38s
|
||||
Memory: 56MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.41s
|
||||
|
||||
Iteration 4
|
||||
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 10
|
||||
Expected Memory: 58.0MB
|
||||
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 58MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.09s
|
||||
Memory: 59MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 60MB (+1MB)
|
||||
Answer: 1
|
||||
occurs(action(("up","f0","f2")),1) occurs(action(("board","f2","p7")),2) occurs(action(("up","f2","f7")),2) occurs(action(("depart","f7","p7")),3) occurs(action(("up","f7","f13")),3) occurs(action(("board","f13","p0")),4) occurs(action(("up","f13","f15")),4) occurs(action(("depart","f15","p0")),5) occurs(action(("down","f15","f11")),5) occurs(action(("board","f11","p4")),6) occurs(action(("board","f11","p5")),6) occurs(action(("up","f11","f14")),6) occurs(action(("depart","f14","p5")),7) occurs(action(("down","f14","f4")),7) occurs(action(("board","f4","p6")),8) occurs(action(("up","f4","f6")),8) occurs(action(("depart","f6","p6")),9) occurs(action(("board","f6","p1")),9) occurs(action(("up","f6","f19")),9) occurs(action(("depart","f19","p1")),10) occurs(action(("board","f19","p2")),10) occurs(action(("down","f19","f12")),10) occurs(action(("depart","f12","p4")),11) occurs(action(("down","f12","f10")),11) occurs(action(("board","f10","p9")),12) occurs(action(("down","f10","f5")),12) occurs(action(("board","f5","p3")),13) occurs(action(("up","f5","f8")),13) occurs(action(("depart","f8","p2")),14) occurs(action(("depart","f8","p3")),14) occurs(action(("depart","f8","p9")),14) occurs(action(("board","f8","p8")),14) occurs(action(("down","f8","f3")),14) occurs(action(("depart","f3","p8")),15) occurs(action(("up","f3","f4")),15)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 4
|
||||
Time : 0.626s (Solving: 0.47s 1st Model: 0.09s Unsat: 0.00s)
|
||||
CPU Time : 0.620s
|
||||
|
||||
Choices : 18409 (Domain: 18390)
|
||||
Conflicts : 9804 (Analyzed: 9803)
|
||||
Restarts : 122 (Average: 80.35 Last: 81)
|
||||
Model-Level : 83.0
|
||||
Problems : 4 (Average Length: 9.50 Splits: 0)
|
||||
Lemmas : 9803 (Deleted: 4404)
|
||||
Binary : 1 (Ratio: 0.01%)
|
||||
Ternary : 13 (Ratio: 0.13%)
|
||||
Conflict : 9803 (Average Length: 29.3 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 9803 (Average: 1.69 Max: 18 Sum: 16574)
|
||||
Executed : 9791 (Average: 1.69 Max: 18 Sum: 16562 Ratio: 99.93%)
|
||||
Bounded : 12 (Average: 1.00 Max: 1 Sum: 12 Ratio: 0.07%)
|
||||
|
||||
Rules : 4766
|
||||
Atoms : 4766
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 7127 (Eliminated: 0 Frozen: 300)
|
||||
Constraints : 29706 (Binary: 96.7% Ternary: 2.2% Other: 1.1%)
|
||||
|
||||
Memory Peak : 60MB
|
||||
Max. Length : 15 steps
|
||||
Sol. Length : 15 steps
|
||||
Models : 1
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user