details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.389017105103 seconds
cpu usage	0.481125375
max memory	4.6092288E7

stage attributes

key	value
output-size	1449
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... ## 1 initial DP problem to solve. ## First, we try to decompose this problem into smaller problems. ## Round 1 [1 DP problem]: ## DP problem: Dependency pairs = [f^#(0,1,_0) -> f^#(_0,_0,_0)] TRS = {f(0,1,_0) -> f(_0,_0,_0)} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## 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^#(0,1,_0) -> f^#(_0,_0,_0)] TRS = {f(0,1,_0) -> f(_0,_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 = 13 popout

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

job log

popout

actions

all output return to TRS Standard