Add benchmark result [gc-ta1-tt1 | ipc-1998 | mystery-round-1-strips | 15]
This commit is contained in:
parent
75134a0d52
commit
2f27c80666
GPG Key ID:
1F54208CE70DDF73
|
|
@ -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-1998/domains/mystery-round-1-strips/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.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
|
||||
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: mystery-round-1-strips
|
||||
instance: 15
|
||||
ipc: ipc-1998
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: 517f2c0422a36582df17ecebb08e879b170cdfe2 (2017-11-21 02:23:06 +0100)
|
||||
plasp: 3.1.1
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
||||
|
|
@ -0,0 +1,33 @@
|
|||
# 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']}
|
||||
# instance: {'ipc': 'ipc-1998', 'domain': 'mystery-round-1-strips', 'instance': 15}
|
||||
# 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-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.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))
|
||||
|
||||
/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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.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 36.53 MEM 33476 MAXMEM 536028 STALE 1 MAXMEM_RSS 479764
|
||||
<time name="ALL">36340</time>
|
||||
|
||||
|
|
@ -0,0 +1,157 @@
|
|||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-15.pddl
|
||||
Parsing...
|
||||
Parsing: [0.020s CPU, 0.021s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||||
Generated 42 rules.
|
||||
Computing model... [1.920s CPU, 1.922s wall-clock]
|
||||
17570 relevant atoms
|
||||
6412 auxiliary atoms
|
||||
23982 final queue length
|
||||
56683 total queue pushes
|
||||
Completing instantiation... [7.020s CPU, 7.013s wall-clock]
|
||||
Instantiating: [9.010s CPU, 9.010s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
12 initial candidates
|
||||
Finding invariants: [0.130s CPU, 0.125s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.003s wall-clock]
|
||||
Instantiating groups... [0.060s CPU, 0.058s wall-clock]
|
||||
Collecting mutex groups... [0.010s CPU, 0.004s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.013s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.009s wall-clock]
|
||||
Computing fact groups: [0.250s CPU, 0.246s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.004s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.010s CPU, 0.003s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.005s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.270s CPU, 0.270s wall-clock]
|
||||
Translating task: [5.300s CPU, 5.296s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
52 propositions removed
|
||||
Detecting unreachable propositions: [2.660s CPU, 2.653s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
52 of 52 variables necessary.
|
||||
0 of 52 mutex groups necessary.
|
||||
16665 of 16665 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.770s CPU, 0.778s wall-clock]
|
||||
Translator variables: 52
|
||||
Translator derived variables: 0
|
||||
Translator facts: 681
|
||||
Translator goal facts: 1
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 16665
|
||||
Translator axioms: 0
|
||||
Translator task size: 98645
|
||||
Translator peak memory: 100988 KB
|
||||
Writing output... [1.690s CPU, 1.846s wall-clock]
|
||||
Done! [19.930s CPU, 20.086s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 4.22s
|
||||
Memory: 332MB
|
||||
|
||||
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.02s
|
||||
Memory: 332MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.02s
|
||||
|
||||
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: 1.28s
|
||||
Memory: 332MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.24s
|
||||
Memory: 346MB (+14MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 3.99s
|
||||
Memory: 377MB (+31MB)
|
||||
Solving...
|
||||
Solving Time: 0.06s
|
||||
Memory: 377MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 6.40s
|
||||
|
||||
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: 2.38s
|
||||
Memory: 394MB (+17MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.17s
|
||||
Memory: 446MB (+52MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 446MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action(("overcome","loneliness","stimulation","lobster","mars","neptune")),1) occurs(action(("feast","aesthetics","cucumber","lobster","goias","surrey")),1) occurs(action(("feast","curiosity","turkey","pea","oregon","goias")),1) occurs(action(("feast","empathy","onion","haroset","oregon","goias")),1) occurs(action(("feast","entertainment","pepper","bacon","goias","surrey")),1) occurs(action(("feast","expectation","lamb","cod","alsace","arizona")),1) occurs(action(("feast","learning","broccoli","lemon","surrey","moravia")),1) occurs(action(("feast","satisfaction","pistachio","okra","surrey","moravia")),1) occurs(action(("feast","understanding","cod","pea","pennsylvania","quebec")),1) occurs(action(("feast","aesthetics","lobster","ham","bavaria","alsace")),2) occurs(action(("feast","curiosity","pea","cod","moravia","bavaria")),2) occurs(action(("feast","empathy","haroset","lemon","surrey","moravia")),2) occurs(action(("feast","expectation","cod","pea","bosnia","pennsylvania")),2) occurs(action(("feast","learning","lemon","cod","bavaria","alsace")),2) occurs(action(("feast","satisfaction","okra","cucumber","surrey","moravia")),2) occurs(action(("overcome","grief","entertainment","bacon","uranus","mars")),3) occurs(action(("overcome","boils","understanding","pea","uranus","mars")),3) occurs(action(("feast","aesthetics","ham","bacon","alsace","arizona")),3) occurs(action(("feast","curiosity","cod","lemon","manitoba","bosnia")),3) occurs(action(("feast","empathy","lemon","broccoli","moravia","bavaria")),3) occurs(action(("feast","expectation","pea","cod","surrey","moravia")),3) occurs(action(("feast","lubricity","okra","pistachio","goias","surrey")),3) occurs(action(("feast","satisfaction","cucumber","lobster","oregon","goias")),3) occurs(action(("feast","stimulation","lobster","ham","moravia","bavaria")),3) occurs(action(("feast","learning","cod","chicken","arizona","manitoba")),4) occurs(action(("feast","curiosity","lemon","broccoli","surrey","moravia")),4) occurs(action(("feast","empathy","broccoli","pistachio","goias","surrey")),4) occurs(action(("feast","satisfaction","lobster","ham","surrey","moravia")),4) occurs(action(("feast","stimulation","ham","bacon","bavaria","alsace")),4) occurs(action(("feast","entertainment","bacon","pepper","moravia","bavaria")),4) occurs(action(("overcome","jealousy","empathy","pistachio","uranus","mars")),5) occurs(action(("feast","entertainment","pepper","haroset","oregon","goias")),5) occurs(action(("feast","expectation","cod","lemon","alsace","arizona")),5) occurs(action(("feast","learning","chicken","cantelope","arizona","manitoba")),5) occurs(action(("feast","stimulation","bacon","pepper","surrey","moravia")),5) occurs(action(("overcome","depression","curiosity","broccoli","uranus","mars")),6) occurs(action(("feast","aesthetics","bacon","ham","goias","surrey")),6) occurs(action(("feast","empathy","pistachio","broccoli","goias","surrey")),6) occurs(action(("feast","entertainment","haroset","lemon","goias","surrey")),6) occurs(action(("feast","learning","cantelope","chicken","moravia","bavaria")),7) occurs(action(("feast","empathy","broccoli","lemon","oregon","goias")),7) occurs(action(("overcome","angina","learning","chicken","mars","neptune")),8) occurs(action(("feast","empathy","lemon","cod","goias","surrey")),8) occurs(action(("feast","empathy","cod","chicken","bavaria","alsace")),9) occurs(action(("succumb","angina","learning","chicken","mars","neptune")),9) occurs(action(("feast","satiety","haroset","lemon","oregon","goias")),9) occurs(action(("succumb","jealousy","empathy","chicken","uranus","mars")),10)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 4
|
||||
Time : 10.999s (Solving: 0.13s 1st Model: 0.11s Unsat: 0.01s)
|
||||
CPU Time : 10.844s
|
||||
|
||||
Choices : 1785 (Domain: 1311)
|
||||
Conflicts : 198 (Analyzed: 197)
|
||||
Restarts : 0
|
||||
Model-Level : 224.5
|
||||
Problems : 4 (Average Length: 7.00 Splits: 0)
|
||||
Lemmas : 197 (Deleted: 0)
|
||||
Binary : 27 (Ratio: 13.71%)
|
||||
Ternary : 2 (Ratio: 1.02%)
|
||||
Conflict : 197 (Average Length: 75.6 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 197 (Average: 7.07 Max: 128 Sum: 1392)
|
||||
Executed : 190 (Average: 6.88 Max: 128 Sum: 1355 Ratio: 97.34%)
|
||||
Bounded : 7 (Average: 5.29 Max: 7 Sum: 37 Ratio: 2.66%)
|
||||
|
||||
Rules : 382105 (Original: 382002)
|
||||
Atoms : 332640
|
||||
Bodies : 32626 (Original: 32534)
|
||||
Count : 188 (Original: 202)
|
||||
Equivalences : 17612 (Atom=Atom: 28 Body=Body: 0 Other: 17584)
|
||||
Tight : Yes
|
||||
Variables : 162462 (Eliminated: 0 Frozen: 104419)
|
||||
Constraints : 1163038 (Binary: 99.0% Ternary: 0.4% Other: 0.5%)
|
||||
|
||||
Memory Peak : 486MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Loading…
Reference in New Issue