Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964452
details
property
value
status
complete
benchmark
muladd.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n059.star.cs.uiowa.edu
space
Strategy_removed_mixed_05
run statistics
property
value
solver
NTI_22
configuration
default
runtime (wallclock)
0.595094919205 seconds
cpu usage
0.7455469
max memory
5.0548736E7
stage attributes
key
value
output-size
2625
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO ** BEGIN proof argument ** The following pattern rule was generated by the strategy presented in Sect. 3 of [Emmes, Enger, Giesl, IJCAR'12]: [iteration = 1] *(_0,+(_1,1)){}^n{} -> *(_0,+(_1,1)){}^n{} We apply Theorem 8 of [Emmes, Enger, Giesl, IJCAR'12] on this rule with m = 1, b = 0, pi = epsilon, sigma' = {} and mu' = {}. Hence the term *(_0,+(_1,1)), obtained from instantiating n with 0 in the left-hand side of the rule, starts an infinite derivation 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... ## 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 = [*^#(_0,+(_1,1)) -> *^#(_0,+(_1,*(1,0)))] TRS = {*(_0,+(_1,1)) -> +(*(_0,+(_1,*(1,0))),_0), *(_0,1) -> _0, *(_0,0) -> _0, *(_0,0) -> 0} ## Trying with homeomorphic embeddings... Failed! ## Trying with polynomial interpretations... Failed! ## Trying with lexicographic path orders... Failed! ## Trying with Knuth-Bendix orders... Failed! Don't know whether this DP problem is finite. ## A DP problem could not be proved finite. ## Now, we try to prove that this problem is infinite. ## Trying to prove non-looping nontermination # Iteration 0: non-looping nontermination not proved, 1 unfolded rule generated. # Iteration 1: success, non-looping nontermination proved, 1 unfolded rule generated. Here is the successful unfolding. Let IR be the TRS under analysis. IR contains the dependency pair *^#(_0,+(_1,1)) -> *^#(_0,+(_1,*(1,0))). We apply (I) of [Emmes, Enger, Giesl, IJCAR'12] to this dependency pair. ==> P0 = *^#(_0,+(_1,1)){}^n{} -> *^#(_0,+(_1,*(1,0))){}^n{} is in U_IR^0. We apply (IX) of [Emmes, Enger, Giesl, IJCAR'12] to this pattern rule at position [1, 1] using the rule *(_0,0) -> _0 of IR. ==> P1 = *^#(_0,+(_1,1)){}^n{} -> *^#(_0,+(_1,1)){}^n{} is in U_IR^1. This DP problem is infinite. 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 = 8
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard