TRS Standard pair #615300709

details

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

run statistics

property	value
solver	NTI_23
configuration	default
runtime (wallclock)	0.215800046921 seconds
cpu usage	0.318848517
max memory	4.7661056E7

stage attributes

key	value
output-size	2639
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 from [Emmes, Enger, Giesl, IJCAR'12]
* Description:
The following pattern rule was generated by the strategy
presented in Sect. 3 of [Emmes, Enger, Giesl, IJCAR'12]:
[iteration = 0] f{}^n{} -> f{}^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 f, obtained from
instantiating n with 0 in the left-hand side of
the rule, 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...
## 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 = [f^# -> f^#]
  TRS = {f -> f}
    ## 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.
      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.
## A DP problem could not be proved finite.
## Now, we try to prove that this problem is infinite.
    ## DP Processor: [Emmes, Enger, Giesl, IJCAR'12] (forward=true, backward=true, max=-1). 
      # Iteration 0: success, nontermination proved, 1 unfolded rule generated.
      Here is the successful unfolding. Let IR be the TRS under analysis.
      IR contains the dependency pair f^# -> f^#.
      We apply (I) of [Emmes, Enger, Giesl, IJCAR'12] to this dependency pair.
      ==> P0 = f^#{}^n{} -> f^#{}^n{} is in U_IR^0.
  This DP problem is infinite.
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 = 3

popout

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

job log

popout

actions all output return to TRS Standard