details

property	value
status	complete
benchmark	rtL-pwl.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n057.star.cs.uiowa.edu
space	Relative_05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.28015303612 seconds
cpu usage	17.820028669
max memory	3.422056448E9

stage attributes

key	value
output-size	18453
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRSRRRProof [EQUIVALENT, 59 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 51 ms] (4) RelTRS (5) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 152 ms] (6) RelTRS (7) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 79 ms] (8) RelTRS (9) RelTRSSemanticLabellingPOLOProof [EQUIVALENT, 80 ms] (10) RelTRS (11) RIsEmptyProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: top(ok(queue(old(x), bot))) -> top(check(queue(x, bot))) top(ok(queue(new(x), bot))) -> top(check(queue(x, bot))) top(ok(queue(bot, old(x)))) -> top(check(queue(bot, x))) top(ok(queue(bot, new(x)))) -> top(check(queue(bot, x))) top(ok(queue(old(x), old(y)))) -> top(check(queue(x, y))) top(ok(queue(old(x), new(y)))) -> top(check(queue(x, y))) top(ok(queue(new(x), old(y)))) -> top(check(queue(x, y))) top(ok(queue(new(x), new(y)))) -> top(check(queue(x, y))) The relative TRS consists of the following S rules: top(ok(queue(old(x), y))) -> top(check(queue(x, y))) top(ok(queue(new(x), y))) -> top(check(queue(x, y))) bot -> new(bot) check(old(x)) -> ok(old(x)) check(new(x)) -> new(check(x)) check(queue(x, y)) -> queue(check(x), y) check(queue(x, y)) -> queue(x, check(y)) old(ok(x)) -> ok(old(x)) new(ok(x)) -> ok(new(x)) queue(ok(x), y) -> ok(queue(x, y)) queue(x, ok(y)) -> ok(queue(x, y)) ---------------------------------------- (1) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(bot) = 0 POL(check(x_1)) = x_1 POL(new(x_1)) = x_1 POL(ok(x_1)) = x_1 POL(old(x_1)) = 1 + x_1 POL(queue(x_1, x_2)) = x_1 + x_2 POL(top(x_1)) = x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: top(ok(queue(old(x), bot))) -> top(check(queue(x, bot))) top(ok(queue(bot, old(x)))) -> top(check(queue(bot, x))) top(ok(queue(old(x), old(y)))) -> top(check(queue(x, y))) top(ok(queue(old(x), new(y)))) -> top(check(queue(x, y))) top(ok(queue(new(x), old(y)))) -> top(check(queue(x, y))) Rules from S: top(ok(queue(old(x), y))) -> top(check(queue(x, y))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: top(ok(queue(new(x), bot))) -> top(check(queue(x, bot))) top(ok(queue(bot, new(x)))) -> top(check(queue(bot, x))) top(ok(queue(new(x), new(y)))) -> top(check(queue(x, y))) The relative TRS consists of the following S rules: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Relat 75837