details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	2.3724758625 seconds
cpu usage	6.007460799
max memory	4.4382208E8

stage attributes

key	value
output-size	7450
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, 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 (9) DecreasingLoopProof [FINISHED, 385 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: U11(tt, N) -> activate(N) U21(tt, M, N) -> s(plus(activate(N), activate(M))) U31(tt) -> 0 U41(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) isNat(n__x(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) plus(N, 0) -> U11(isNat(N), N) plus(N, s(M)) -> U21(and(isNat(M), n__isNat(N)), M, N) x(N, 0) -> U31(isNat(N)) x(N, s(M)) -> U41(and(isNat(M), n__isNat(N)), M, N) 0 -> n__0 plus(X1, X2) -> n__plus(X1, X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) x(X1, X2) -> n__x(X1, X2) activate(n__0) -> 0 activate(n__plus(X1, X2)) -> plus(activate(X1), activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(n__x(X1, X2)) -> x(activate(X1), activate(X2)) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: U11(tt, N) -> activate(N) U21(tt, M, N) -> s(plus(activate(N), activate(M))) U31(tt) -> 0 U41(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) isNat(n__s(V1)) -> isNat(activate(V1)) isNat(n__x(V1, V2)) -> and(isNat(activate(V1)), n__isNat(activate(V2))) plus(N, 0) -> U11(isNat(N), N) plus(N, s(M)) -> U21(and(isNat(M), n__isNat(N)), M, N) x(N, 0) -> U31(isNat(N)) x(N, s(M)) -> U41(and(isNat(M), n__isNat(N)), M, N) 0 -> n__0 plus(X1, X2) -> n__plus(X1, X2) isNat(X) -> n__isNat(X) s(X) -> n__s(X) x(X1, X2) -> n__x(X1, X2) activate(n__0) -> 0 activate(n__plus(X1, X2)) -> plus(activate(X1), activate(X2)) activate(n__isNat(X)) -> isNat(X) activate(n__s(X)) -> s(activate(X)) activate(n__x(X1, X2)) -> x(activate(X1), activate(X2)) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127