details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.378401041031 seconds
cpu usage	0.698060269
max memory	7.2261632E7

stage attributes

key	value
output-size	2358
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE ** BEGIN proof description ** ## Searching for a generalized rewrite rule (a rule whose right-hand side contains a variable that does not occur in the left-hand side)... No generalized rewrite rule found! ## Applying the DP framework... ## 2 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [2 DP problems]: ## DP problem: Dependency pairs = [activate^#(n__f(_0)) -> activate^#(_0), activate^#(n__s(_0)) -> activate^#(_0)] TRS = {f(0) -> cons(0,n__f(n__s(n__0))), f(s(0)) -> f(p(s(0))), p(s(0)) -> 0, f(_0) -> n__f(_0), s(_0) -> n__s(_0), 0 -> n__0, activate(n__f(_0)) -> f(activate(_0)), activate(n__s(_0)) -> s(activate(_0)), activate(n__0) -> 0, activate(_0) -> _0} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [f^#(s(0)) -> f^#(p(s(0)))] TRS = {f(0) -> cons(0,n__f(n__s(n__0))), f(s(0)) -> f(p(s(0))), p(s(0)) -> 0, f(_0) -> n__f(_0), s(_0) -> n__s(_0), 0 -> n__0, activate(n__f(_0)) -> f(activate(_0)), activate(n__s(_0)) -> s(activate(_0)), activate(n__0) -> 0, activate(_0) -> _0} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... This DP problem is too complex! Aborting! ## Trying with lexicographic path orders... Failed! ## Trying with Knuth-Bendix orders... Failed! Don't know whether this DP problem is finite. ## A DP problem could not be proved finite. ## Now, we try to prove that this problem is infinite. ## Could not solve the following DP problems: 1: Dependency pairs = [f^#(s(0)) -> f^#(p(s(0)))] TRS = {f(0) -> cons(0,n__f(n__s(n__0))), f(s(0)) -> f(p(s(0))), p(s(0)) -> 0, f(_0) -> n__f(_0), s(_0) -> n__s(_0), 0 -> n__0, activate(n__f(_0)) -> f(activate(_0)), activate(n__s(_0)) -> s(activate(_0)), activate(n__0) -> 0, activate(_0) -> _0} Hence, could not prove (non)termination of the TRS under analysis. Proof run on Linux version 3.10.0-1160.25.1.el7.x86_64 for amd64 using Java version 1.8.0_292 ** END proof description ** Total number of generated unfolded rules = 86 popout

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

job log

popout

actions

all output return to TRS Standard