details

property	value
status	complete
benchmark	mucrl1.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n056.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.587765932 seconds
cpu usage	891.144824086
max memory	7.988584448E9

stage attributes

key	value
output-size	58106
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: or(T, T) -> T or(F, T) -> T or(T, F) -> T or(F, F) -> F and(T, B) -> B and(B, T) -> B and(F, B) -> F and(B, F) -> F imp(T, B) -> B imp(F, B) -> T not(T) -> F not(F) -> T if(T, B1, B2) -> B1 if(F, B1, B2) -> B2 eq(T, T) -> T eq(F, F) -> T eq(T, F) -> F eq(F, T) -> F eqt(nil, undefined) -> F eqt(nil, pid(N2)) -> F eqt(nil, int(N2)) -> F eqt(nil, cons(H2, T2)) -> F eqt(nil, tuple(H2, T2)) -> F eqt(nil, tuplenil(H2)) -> F eqt(a, nil) -> F eqt(a, a) -> T eqt(a, excl) -> F eqt(a, false) -> F eqt(a, lock) -> F eqt(a, locker) -> F eqt(a, mcrlrecord) -> F eqt(a, ok) -> F eqt(a, pending) -> F eqt(a, release) -> F eqt(a, request) -> F eqt(a, resource) -> F eqt(a, tag) -> F eqt(a, true) -> F eqt(a, undefined) -> F eqt(a, pid(N2)) -> F eqt(a, int(N2)) -> F eqt(a, cons(H2, T2)) -> F eqt(a, tuple(H2, T2)) -> F eqt(a, tuplenil(H2)) -> F eqt(excl, nil) -> F eqt(excl, a) -> F eqt(excl, excl) -> T eqt(excl, false) -> F eqt(excl, lock) -> F eqt(excl, locker) -> F eqt(excl, mcrlrecord) -> F eqt(excl, ok) -> F eqt(excl, pending) -> F eqt(excl, release) -> F eqt(excl, request) -> F eqt(excl, resource) -> F eqt(excl, tag) -> F eqt(excl, true) -> F eqt(excl, undefined) -> F eqt(excl, pid(N2)) -> F eqt(excl, eqt(false, int(N2))) -> F eqt(false, cons(H2, T2)) -> F eqt(false, tuple(H2, T2)) -> F eqt(false, tuplenil(H2)) -> F eqt(lock, nil) -> F eqt(lock, a) -> F eqt(lock, excl) -> F popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127