details

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

run statistics

property	value
solver	NTI_22
configuration	default
runtime (wallclock)	0.241986989975 seconds
cpu usage	0.262716303
max memory	3.9415808E7

stage attributes

key	value
output-size	3786
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... ## 3 initial DP problems to solve. ## First, we try to decompose these problems into smaller problems. ## Round 1 [3 DP problems]: ## DP problem: Dependency pairs = [*^#(s(_0),s(_1)) -> *^#(_0,_1)] TRS = {a(h,h,h,_0) -> s(_0), a(_0,_1,s(_2),h) -> a(_0,_1,_2,s(h)), a(_0,_1,s(_2),s(_3)) -> a(_0,_1,_2,a(_0,_1,s(_2),_3)), a(_0,s(_1),h,_2) -> a(_0,_1,_2,_2), a(s(_0),h,h,_1) -> a(_0,_1,h,_1), +(_0,h) -> _0, +(h,_0) -> _0, +(s(_0),s(_1)) -> s(s(+(_0,_1))), +(+(_0,_1),_2) -> +(_0,+(_1,_2)), s(h) -> 1, *(h,_0) -> h, *(_0,h) -> h, *(s(_0),s(_1)) -> s(+(+(*(_0,_1),_0),_1))} ## Trying with homeomorphic embeddings... Success! This DP problem is finite. ## DP problem: Dependency pairs = [+^#(s(_0),s(_1)) -> +^#(_0,_1), +^#(+(_0,_1),_2) -> +^#(_0,+(_1,_2)), +^#(+(_0,_1),_2) -> +^#(_1,_2)] TRS = {a(h,h,h,_0) -> s(_0), a(_0,_1,s(_2),h) -> a(_0,_1,_2,s(h)), a(_0,_1,s(_2),s(_3)) -> a(_0,_1,_2,a(_0,_1,s(_2),_3)), a(_0,s(_1),h,_2) -> a(_0,_1,_2,_2), a(s(_0),h,h,_1) -> a(_0,_1,h,_1), +(_0,h) -> _0, +(h,_0) -> _0, +(s(_0),s(_1)) -> s(s(+(_0,_1))), +(+(_0,_1),_2) -> +(_0,+(_1,_2)), s(h) -> 1, *(h,_0) -> h, *(_0,h) -> h, *(s(_0),s(_1)) -> s(+(+(*(_0,_1),_0),_1))} ## 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: {*:[0, 1], s:[0], +:[0, 1], a:[0, 1, 2, 3], +^#:[0, 1]} and the precedence: * > [1, s, +, h], s > [1, h], + > [1, s, h], +^# > [1, +, s, h], h > [1], a > [1, s, h] This DP problem is finite. ## DP problem: Dependency pairs = [a^#(_0,_1,s(_2),h) -> a^#(_0,_1,_2,s(h)), a^#(_0,_1,s(_2),s(_3)) -> a^#(_0,_1,_2,a(_0,_1,s(_2),_3)), a^#(_0,_1,s(_2),s(_3)) -> a^#(_0,_1,s(_2),_3), a^#(_0,s(_1),h,_2) -> a^#(_0,_1,_2,_2), a^#(s(_0),h,h,_1) -> a^#(_0,_1,h,_1)] TRS = {a(h,h,h,_0) -> s(_0), a(_0,_1,s(_2),h) -> a(_0,_1,_2,s(h)), a(_0,_1,s(_2),s(_3)) -> a(_0,_1,_2,a(_0,_1,s(_2),_3)), a(_0,s(_1),h,_2) -> a(_0,_1,_2,_2), a(s(_0),h,h,_1) -> a(_0,_1,h,_1), +(_0,h) -> _0, +(h,_0) -> _0, +(s(_0),s(_1)) -> s(s(+(_0,_1))), +(+(_0,_1),_2) -> +(_0,+(_1,_2)), s(h) -> 1, *(h,_0) -> h, *(_0,h) -> h, *(s(_0),s(_1)) -> s(+(+(*(_0,_1),_0),_1))} ## 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: {*:[0, 1], s:[0], +:[0, 1], a:[0, 1, 2, 3], a^#:[0, 1, 2, 3]} and the precedence: * > [1, s, +, h], s > [1, h], + > [1, s, h], h > [1], a^# > [1, s, h, a], a > [1, s, h] 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