details

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

run statistics

property	value
solver	NTI_23
configuration	default
runtime (wallclock)	0.401613950729 seconds
cpu usage	0.958198321
max memory	7.636992E7

stage attributes

key	value
output-size	6688
starexec-result	"NO"

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO ** BEGIN proof argument ** * Certificate: f(c,n__g(c),n__g(b)) is non-terminating * Description: The following rule R was generated while unfolding the dependency pairs of the analyzed TRS: [iteration = 7] f^#(c,n__g(c),n__g(b)) -> f^#(c,n__g(c),n__g(b)) Let l be the left-hand side and r be the right-hand side of R. Let p = epsilon, theta1 = {} and theta2 = {}. We have r|p = f^#(c,n__g(c),n__g(b)) and theta2(theta1(l)) = theta1(r|p), i.e., l semi-unifies with r|p. So, the term theta1(l) = f(c,n__g(c),n__g(b)) starts an infinite rewrite sequence w.r.t. the analyzed TRS. ** 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,n__g(_0),_1) -> f^#(activate(_1),activate(_1),activate(_1))] TRS = {f(_0,n__g(_0),_1) -> f(activate(_1),activate(_1),activate(_1)), g(b) -> c, b -> c, g(_0) -> n__g(_0), activate(n__g(_0)) -> g(activate(_0)), activate(_0) -> _0} ## DP Processor: homeomorphic embeddings. Using no argument filtering, i.e., applying the processor to the full problem only. Failed! ## DP Processor: lexicographic path orders. Using no argument filtering, i.e., applying the processor to the full problem only. Failed! ## DP Processor: polynomial interpretations. Using no argument filtering, i.e., applying the processor to the full problem only. This DP problem is too complex (16 coefficients to instantiate)! Aborting! Failed! ## DP Processor: Knuth-Bendix orders. Using no argument filtering, i.e., applying the processor to the full problem only. Failed! All the DP processors have failed! Don't know whether this DP problem is finite. ## DP problem: Dependency pairs = [activate^#(n__g(_0)) -> activate^#(_0)] TRS = {f(_0,n__g(_0),_1) -> f(activate(_1),activate(_1),activate(_1)), g(b) -> c, b -> c, g(_0) -> n__g(_0), activate(n__g(_0)) -> g(activate(_0)), activate(_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. ## A DP problem could not be proved finite. ## Now, we try to prove that this problem is infinite. ## DP Processor: [Payet, LOPSTR'18] + [Payet, Non-termination in TRS and LP] (forward=true, backward=false, max=-1). # max_depth=2, unfold_variables=false: # Iteration 0: infiniteness not proved, 1 unfolded rule generated. # Iteration 1: infiniteness not proved, 1 unfolded rule generated. # Iteration 2: infiniteness not proved, 2 unfolded rules generated. # Iteration 3: infiniteness not proved, 2 unfolded rules generated. # Iteration 4: infiniteness not proved, 2 unfolded rules generated. # Iteration 5: infiniteness not proved, 0 unfolded rule generated. Could not prove infiniteness! # max_depth=2, unfold_variables=true: # Iteration 0: infiniteness not proved, 1 unfolded rule generated. # Iteration 1: infiniteness not proved, 1 unfolded rule generated. # Iteration 2: infiniteness not proved, 2 unfolded rules generated. # Iteration 3: infiniteness not proved, 2 unfolded rules generated. # Iteration 4: infiniteness not proved, 1 unfolded rule generated. # Iteration 5: infiniteness not proved, 2 unfolded rules generated. # Iteration 6: infiniteness not proved, 6 unfolded rules generated. # Iteration 7: infiniteness not proved, 0 unfolded rule generated. Could not prove infiniteness! # max_depth=3, unfold_variables=false: # Iteration 0: infiniteness not proved, 1 unfolded rule generated. # Iteration 1: infiniteness not proved, 1 unfolded rule generated. # Iteration 2: infiniteness not proved, 4 unfolded rules generated. # Iteration 3: infiniteness not proved, 8 unfolded rules generated. # Iteration 4: infiniteness not proved, 16 unfolded rules generated. # Iteration 5: infiniteness not proved, 19 unfolded rules generated. # Iteration 6: infiniteness not proved, 31 unfolded rules generated. # Iteration 7: success, loop found, 23 unfolded rules generated. Here is the successful unfolding. Let IR be the TRS under analysis. L0 = f^#(_0,n__g(_0),_1) -> f^#(activate(_1),activate(_1),activate(_1)) [trans] is in U_IR^0. We build a unit triple from L0. ==> L1 = f^#(_0,n__g(_0),_1) -> f^#(activate(_1),activate(_1),activate(_1)) [unit] is in U_IR^1. Let p1 = [0]. We unfold the rule of L1 forwards at position p1 with the rule activate(n__g(_0)) -> g(activate(_0)). ==> L2 = f^#(_0,n__g(_0),n__g(_1)) -> f^#(g(activate(_1)),activate(n__g(_1)),activate(n__g(_1))) [unit] is in U_IR^2. Let p2 = [0, 0]. We unfold the rule of L2 forwards at position p2 with the rule activate(_0) -> _0. ==> L3 = f^#(_0,n__g(_0),n__g(_1)) -> f^#(g(_1),activate(n__g(_1)),activate(n__g(_1))) [unit] is in U_IR^3. Let p3 = [0]. popout

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

job log

popout

actions

all output return to TRS Standard