details

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

run statistics

property	value
solver	NTI-TC20-firstrun
configuration	Default 200
runtime (wallclock)	162.399 seconds
cpu usage	642.358
user time	634.498
system time	7.85994
max virtual memory	3.5399688E7
max residence set size	1.6002436E7

stage attributes

key	value
starexec-result	YES

output

YES Prover = TRS(tech=GUIDED_UNF_TRIPLES, nb_unfoldings=unlimited, unfold_variables=false, max_nb_coefficients=12, max_nb_unfolded_rules=-1, strategy=LEFTMOST_NE) ** 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... ## Round 1: ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2)), plus^#(s(_0),plus(_1,_2)) -> plus^#(s(s(_1)),_2), plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_2,plus(_1,_3)), plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_1,_3)] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Successfully decomposed the DP problem into smaller problems to solve! ## Round 2: ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: {plus:[0], s:[0], plus^#:[0]} This DP problem is finite. ## DP problem: Dependency pairs = [plus^#(s(_0),plus(_1,plus(_2,_3))) -> plus^#(_0,plus(_2,plus(_1,_3))), plus^#(s(_0),plus(_1,_2)) -> plus^#(_0,plus(s(s(_1)),_2))] TRS = {plus(s(_0),plus(_1,_2)) -> plus(_0,plus(s(s(_1)),_2)), plus(s(_0),plus(_1,plus(_2,_3))) -> plus(_0,plus(_2,plus(_1,_3)))} ## 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 precedence: s > [plus] and the argument filtering: popout

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

job log

popout

actions

all output return to TRS Standard