TRS Standard pair #516966089

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	1.39323496819 seconds
cpu usage	4.031626313
max memory	6.40229376E8

stage attributes

key	value
output-size	3160
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 f(y,f(y,x)) -> f(f(a(),y),f(a(),y))

Proof:
 DP Processor:
  DPs:
   f#(y,f(y,x)) -> f#(a(),y)
   f#(y,f(y,x)) -> f#(f(a(),y),f(a(),y))
  TRS:
   f(y,f(y,x)) -> f(f(a(),y),f(a(),y))
  Arctic Interpretation Processor:
   dimension: 1
   usable rules:
    f(y,f(y,x)) -> f(f(a(),y),f(a(),y))
   interpretation:
    [a] = 0,
    
    [f](x0, x1) = 1x0 + 1x1 + 4,
    
    [f#](x0, x1) = x0 + x1 + 0
   orientation:
    f#(y,f(y,x)) = 1x + 1y + 4 >= y + 0 = f#(a(),y)
    
    f#(y,f(y,x)) = 1x + 1y + 4 >= 1y + 4 = f#(f(a(),y),f(a(),y))
    
    f(y,f(y,x)) = 2x + 2y + 5 >= 2y + 5 = f(f(a(),y),f(a(),y))
   problem:
    DPs:
     f#(y,f(y,x)) -> f#(f(a(),y),f(a(),y))
    TRS:
     f(y,f(y,x)) -> f(f(a(),y),f(a(),y))
   Restore Modifier:
    DPs:
     f#(y,f(y,x)) -> f#(f(a(),y),f(a(),y))
    TRS:
     f(y,f(y,x)) -> f(f(a(),y),f(a(),y))
    Bounds Processor:
     bound: 2
     enrichment: match-dp
     automaton:
      final states: {3}
      transitions:
       f{#,1}(1,1) -> 3*
       f{#,1}(24,24) -> 3*
       f{#,1}(35,1) -> 3*
       f{#,1}(35,24) -> 3*
       f{#,1}(24,35) -> 3*
       f{#,1}(24,1) -> 3*
       f{#,1}(1,24) -> 3*
       f{#,1}(1,35) -> 3*
       f{#,1}(35,35) -> 3*
       f{#,0}(1,2) -> 3*
       f{#,0}(2,1) -> 3*
       f{#,0}(22,22) -> 3*
       f{#,0}(2,2) -> 3*
       f{#,0}(22,1) -> 3*
       f{#,0}(22,35) -> 3*
       f{#,0}(2,22) -> 3*
       f{#,0}(24,22) -> 3*
       f{#,0}(35,2) -> 3*
       f{#,0}(24,2) -> 3*
       f{#,0}(2,35) -> 3*
       f{#,0}(22,24) -> 3*
       f{#,0}(22,2) -> 3*
       f{#,0}(1,22) -> 3*
       f{#,0}(2,24) -> 3*
       f{#,0}(35,22) -> 3*
       f1(22,22) -> 1*
       f1(22,2) -> 1*
       f1(22,24) -> 1*
       f1(2,35) -> 1*
       f1(2,1) -> 1*
       f1(22,35) -> 1*
       f1(24,1) -> 1*
       f1(1,35) -> 1*
       f1(24,24) -> 1*
       f1(2,24) -> 1*
       f1(35,24) -> 1*
       f1(22,1) -> 1*
       f1(1,1) -> 1*
       f1(35,35) -> 1*
       f1(2,22) -> 1*
       f1(24,35) -> 1*
       f1(2,2) -> 1*
       f1(35,1) -> 1*
       f1(1,24) -> 1*
       f0(35,2) -> 1*
       f0(1,2) -> 1*
       f0(24,22) -> 1*
       f0(1,22) -> 1*
       f0(24,2) -> 1*
       f0(35,22) -> 1*

popout

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

job log

popout

actions all output return to TRS Standard