Add benchmark result [gc-ta1-tt1 | ipc-2011 | peg-solitaire-sequential-satisficing | 7]
This commit is contained in:
parent
6715357742
commit
853474496f
GPG Key ID:
1F54208CE70DDF73
@ -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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/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: peg-solitaire-sequential-satisficing
|
||||||
|
instance: 7
|
||||||
|
ipc: ipc-2011
|
||||||
|
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
|
||||||
|
|
||||||
@ -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-first-plan-not-serializable', 'rintanen-aij-2012']}
|
||||||
|
# instance: {'ipc': 'ipc-2011', 'domain': 'peg-solitaire-sequential-satisficing', '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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/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/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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/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 6.72 MEM 33472 MAXMEM 117964 STALE 1 MAXMEM_RSS 60160
|
||||||
|
<time name="ALL">6680</time>
|
||||||
|
|
||||||
215
gc-ta1-tt1/ipc-2011_peg-solitaire-sequential-satisficing_7.out
Normal file
215
gc-ta1-tt1/ipc-2011_peg-solitaire-sequential-satisficing_7.out
Normal file
@ -0,0 +1,215 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/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-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-7.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.010s CPU, 0.020s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
|
||||||
|
Preparing model... [0.010s CPU, 0.014s wall-clock]
|
||||||
|
Generated 25 rules.
|
||||||
|
Computing model... [0.080s CPU, 0.082s wall-clock]
|
||||||
|
461 relevant atoms
|
||||||
|
611 auxiliary atoms
|
||||||
|
1072 final queue length
|
||||||
|
1647 total queue pushes
|
||||||
|
Completing instantiation... [0.100s CPU, 0.089s wall-clock]
|
||||||
|
Instantiating: [0.210s CPU, 0.203s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
7 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.023s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
0 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.002s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Computing fact groups: [0.030s CPU, 0.035s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.010s CPU, 0.004s wall-clock]
|
||||||
|
Translating task: [0.080s CPU, 0.073s wall-clock]
|
||||||
|
0 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
34 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.040s CPU, 0.041s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
34 of 34 variables necessary.
|
||||||
|
0 of 34 mutex groups necessary.
|
||||||
|
185 of 185 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.020s CPU, 0.023s wall-clock]
|
||||||
|
Translator variables: 34
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 100
|
||||||
|
Translator goal facts: 33
|
||||||
|
Translator mutex groups: 0
|
||||||
|
Translator total mutex groups size: 0
|
||||||
|
Translator operators: 185
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 1634
|
||||||
|
Translator peak memory: 37068 KB
|
||||||
|
Writing output... [0.020s CPU, 0.029s wall-clock]
|
||||||
|
Done! [0.410s CPU, 0.430s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.08s
|
||||||
|
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.02s
|
||||||
|
Memory: 56MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.05s
|
||||||
|
|
||||||
|
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.90s
|
||||||
|
Memory: 63MB (+5MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 0.94s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Expected Memory: 70.0MB
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.02s
|
||||||
|
Memory: 63MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.81s
|
||||||
|
Memory: 67MB (+4MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.08s
|
||||||
|
Memory: 68MB (+1MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 1.44s
|
||||||
|
Memory: 70MB (+2MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 2.37s
|
||||||
|
|
||||||
|
Iteration 6
|
||||||
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 20
|
||||||
|
Expected Memory: 77.0MB
|
||||||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 73MB (+3MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 1.18s
|
||||||
|
Memory: 75MB (+2MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 1.24s
|
||||||
|
|
||||||
|
Iteration 7
|
||||||
|
Queue: [(6,30,0,True)]
|
||||||
|
Grounded Until: 25
|
||||||
|
Expected Memory: 82.0MB
|
||||||
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||||
|
Grounding Time: 0.04s
|
||||||
|
Memory: 75MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.07s
|
||||||
|
Memory: 76MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE?
|
||||||
|
Testing Time: 0.00s
|
||||||
|
Memory: 76MB (+0MB)
|
||||||
|
Answer: 2
|
||||||
|
occurs(action(("jump-new-move","pos-4-6","pos-4-5","pos-4-4")),1) occurs(action(("jump-continue-move","pos-4-4","pos-5-4","pos-6-4")),2) occurs(action(("end-move","pos-6-4")),3) occurs(action(("jump-new-move","pos-4-1","pos-4-2","pos-4-3")),4) occurs(action(("jump-continue-move","pos-4-3","pos-5-3","pos-6-3")),5) occurs(action(("end-move","pos-6-3")),6) occurs(action(("jump-new-move","pos-6-4","pos-6-3","pos-6-2")),7) occurs(action(("end-move","pos-6-2")),8) occurs(action(("jump-new-move","pos-2-1","pos-2-2","pos-2-3")),9) occurs(action(("end-move","pos-2-3")),10) occurs(action(("jump-new-move","pos-0-2","pos-1-2","pos-2-2")),11) occurs(action(("end-move","pos-2-2")),12) occurs(action(("jump-new-move","pos-6-2","pos-5-2","pos-4-2")),13) occurs(action(("end-move","pos-4-2")),14) occurs(action(("jump-new-move","pos-2-4","pos-3-4","pos-4-4")),15) occurs(action(("end-move","pos-4-4")),16) occurs(action(("jump-new-move","pos-1-4","pos-1-3","pos-1-2")),17) occurs(action(("end-move","pos-1-2")),18) occurs(action(("jump-new-move","pos-1-2","pos-2-2","pos-3-2")),19) occurs(action(("end-move","pos-3-2")),20) occurs(action(("jump-new-move","pos-3-2","pos-4-2","pos-5-2")),21) occurs(action(("end-move","pos-5-2")),22) occurs(action(("jump-new-move","pos-2-3","pos-3-3","pos-4-3")),23) occurs(action(("end-move","pos-4-3")),24) occurs(action(("jump-new-move","pos-4-4","pos-4-3","pos-4-2")),25) occurs(action(("end-move","pos-4-2")),26) occurs(action(("jump-new-move","pos-5-2","pos-4-2","pos-3-2")),27) occurs(action(("end-move","pos-3-2")),28) occurs(action(("jump-new-move","pos-3-1","pos-3-2","pos-3-3")),29) occurs(action(("end-move","pos-3-3")),30)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 8
|
||||||
|
Time : 4.774s (Solving: 4.40s 1st Model: 0.87s Unsat: 0.02s)
|
||||||
|
CPU Time : 4.760s
|
||||||
|
|
||||||
|
Choices : 125815 (Domain: 125815)
|
||||||
|
Conflicts : 34257 (Analyzed: 34255)
|
||||||
|
Restarts : 397 (Average: 86.28 Last: 164)
|
||||||
|
Model-Level : 219.0
|
||||||
|
Problems : 8 (Average Length: 17.62 Splits: 0)
|
||||||
|
Lemmas : 34255 (Deleted: 28563)
|
||||||
|
Binary : 293 (Ratio: 0.86%)
|
||||||
|
Ternary : 182 (Ratio: 0.53%)
|
||||||
|
Conflict : 34255 (Average Length: 420.2 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 34255 (Average: 2.39 Max: 255 Sum: 81864)
|
||||||
|
Executed : 34147 (Average: 2.38 Max: 255 Sum: 81527 Ratio: 99.59%)
|
||||||
|
Bounded : 108 (Average: 3.12 Max: 17 Sum: 337 Ratio: 0.41%)
|
||||||
|
|
||||||
|
Rules : 18855 (Original: 18680)
|
||||||
|
Atoms : 6947
|
||||||
|
Bodies : 4895 (Original: 4728)
|
||||||
|
Count : 616 (Original: 639)
|
||||||
|
Equivalences : 4103 (Atom=Atom: 33 Body=Body: 0 Other: 4070)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 13567 (Eliminated: 0 Frozen: 7189)
|
||||||
|
Constraints : 89421 (Binary: 92.2% Ternary: 3.7% Other: 4.2%)
|
||||||
|
|
||||||
|
Memory Peak : 77MB
|
||||||
|
Max. Length : 30 steps
|
||||||
|
Sol. Length : 30 steps
|
||||||
|
Models : 2
|
||||||
|
|
||||||
|
|
||||||
Loading…
Reference in New Issue
Block a user