details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.468 seconds
cpu usage	306.933
user time	305.138
system time	1.79546
max virtual memory	1.8279328E7
max residence set size	5250408.0

stage attributes

key	value
starexec-result	KILLED

output

KILLED proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTRS (5) SlicingProof [LOWER BOUND(ID), 0 ms] (6) CpxTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 0 ms] (10) typed CpxTrs (11) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (12) CpxTRS (13) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxWeightedTrs (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxTypedWeightedTrs (17) CompletionProof [UPPER BOUND(ID), 0 ms] (18) CpxTypedWeightedCompleteTrs (19) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxTypedWeightedCompleteTrs (21) CompletionProof [UPPER BOUND(ID), 0 ms] (22) CpxTypedWeightedCompleteTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). The TRS R consists of the following rules: f(x, y, z) -> g(<=(x, y), x, y, z) g(true, x, y, z) -> z g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) p(0) -> 0 p(s(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(1, INF). The TRS R consists of the following rules: f(x, y, z) -> g(<=(x, y), x, y, z) g(true, x, y, z) -> z g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) p(0) -> 0 p(s(x)) -> x S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (4) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(1, INF). The TRS R consists of the following rules: f(x, y, z) -> g(<=(x, y), x, y, z) g(true, x, y, z) -> z g(false, x, y, z) -> f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y)) p(0') -> 0' p(s(x)) -> x S is empty. Rewrite Strategy: FULL ---------------------------------------- (5) SlicingProof (LOWER BOUND(ID)) Sliced the following arguments: <=/0 <=/1 popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS