details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.31250500679 seconds
cpu usage	0.407462494
max memory	4.0595456E7

stage attributes

key	value
output-size	2140
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... ## 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 = [f^#(_0,c(_1)) -> f^#(_1,_1)] TRS = {f(_0,c(_1)) -> f(_0,s(f(_1,_1))), f(s(_0),_1) -> f(_0,s(c(_1)))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the argument filtering: {c:[0], s:[0], f:[0], f^#:[0, 1]} and the precedence: c > [f^#], s > [f] This DP problem is finite. ## DP problem: Dependency pairs = [f^#(s(_0),_1) -> f^#(_0,s(c(_1)))] TRS = {f(_0,c(_1)) -> f(_0,s(f(_1,_1))), f(s(_0),_1) -> f(_0,s(c(_1)))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... The constraints are satisfied by the lexicographic path order using the argument filtering: {c:[0], s:[0], f:[0], f^#:[0, 1]} and the precedence: f^# > [c, f, s], 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