details

property	value
status	complete
benchmark	#3.53b.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n064.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.20144200325 seconds
cpu usage	0.201456336
max memory	3.4566144E7

stage attributes

key	value
output-size	1702
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ** BEGIN proof argument ** All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. ** END proof argument ** ** 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^#(s(_0),_0,_0), f^#(_0,_1,s(_2)) -> f^#(0,1,_2)] TRS = {g(_0,_1) -> _0, g(_0,_1) -> _1, f(0,1,_0) -> f(s(_0),_0,_0), f(_0,_1,s(_2)) -> s(f(0,1,_2))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... This DP problem is too complex! Aborting! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the argument filtering: {f:[2], s:[0], g:[0, 1], f^#:[2]} and the precedence: s > [f^#], f > [s, f^#] This DP problem is finite. ## All the DP problems were proved finite. As all the involved DP processors are sound, the TRS under analysis terminates. 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 = 0 popout

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

job log

popout

actions

all output return to TRS Standard