details

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

run statistics

property	value
solver	NTI_23
configuration	default
runtime (wallclock)	0.219033002853 seconds
cpu usage	0.27216063
max memory	4.2016768E7

stage attributes

key	value
output-size	1390
starexec-result	"YES"

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/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 = [g^#(s(_0)) -> g^#(_0)] TRS = {g(0) -> 0, g(s(_0)) -> f(g(_0)), f(0) -> 0} ## DP Processor: homeomorphic embeddings. Using no argument filtering, i.e., applying the processor to the full problem only. Success, finiteness proved! 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.62.1.el7.x86_64 for amd64 using Java version 1.8.0_322 ** 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