details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.22278690338 seconds
cpu usage	4.728287874
max memory	3.31866112E8

stage attributes

key	value
output-size	2070
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be disproven: (0) RelTRS (1) RelTRSLoopFinderProof [COMPLETE, 116 ms] (2) NO ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: top(U(x, y)) -> top(check(D(x, y))) D(x, B) -> U(x, B) F(x, U(O(y), z)) -> U(x, F(y, z)) F(x, U(N(y), z)) -> U(x, F(y, z)) D(O(x), F(y, z)) -> F(x, D(y, z)) D(N(x), F(y, z)) -> F(x, D(y, z)) F(x, U(E, y)) -> U(x, F(E, y)) D(E, F(x, y)) -> F(E, D(x, y)) The relative TRS consists of the following S rules: E -> N(E) check(O(x)) -> O(x) check(U(x, y)) -> U(check(x), y) check(U(x, y)) -> U(x, check(y)) check(D(x, y)) -> D(check(x), y) check(D(x, y)) -> D(x, check(y)) check(F(x, y)) -> F(check(x), y) check(F(x, y)) -> F(x, check(y)) check(O(x)) -> O(check(x)) check(N(x)) -> N(check(x)) ---------------------------------------- (1) RelTRSLoopFinderProof (COMPLETE) The following loop was found: ---------- Loop: ---------- top(check(D(x, B))) -> top(D(check(x), B)) with rule check(D(x', y)) -> D(check(x'), y) at position [0] and matcher [x' / x, y / B] top(D(check(x), B)) -> top(U(check(x), B)) with rule D(x', B) -> U(x', B) at position [0] and matcher [x' / check(x)] top(U(check(x), B)) -> top(check(D(check(x), B))) with rule top(U(x', y)) -> top(check(D(x', y))) at position [] and matcher [x' / check(x), y / B] Now an instance of the first term with Matcher [x / check(x)] occurs in the last term at position []. Context: [] Therefore, the relative TRS problem does not terminate. ---------------------------------------- (2) NO popout

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

job log

popout

actions

all output return to TRS Relat 75837