TRS Standard pair #487073882

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.615895 seconds
cpu usage	1.2618
user time	0.921161
system time	0.340642
max virtual memory	3788140.0
max residence set size	71048.0

stage attributes

key	value
starexec-result	YES

output

YES

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

Proof:
 DP Processor:
  DPs:
   f#(f(y,z),f(x,f(a(),x))) -> f#(a(),y)
   f#(f(y,z),f(x,f(a(),x))) -> f#(x,a())
   f#(f(y,z),f(x,f(a(),x))) -> f#(a(),z)
   f#(f(y,z),f(x,f(a(),x))) -> f#(f(a(),z),f(x,a()))
   f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y))
  TRS:
   f(f(y,z),f(x,f(a(),x))) -> f(f(f(a(),z),f(x,a())),f(a(),y))
  EDG Processor:
   DPs:
    f#(f(y,z),f(x,f(a(),x))) -> f#(a(),y)
    f#(f(y,z),f(x,f(a(),x))) -> f#(x,a())
    f#(f(y,z),f(x,f(a(),x))) -> f#(a(),z)
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(a(),z),f(x,a()))
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y))
   TRS:
    f(f(y,z),f(x,f(a(),x))) -> f(f(f(a(),z),f(x,a())),f(a(),y))
   graph:
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y)) ->
    f#(f(y,z),f(x,f(a(),x))) -> f#(a(),y)
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y)) ->
    f#(f(y,z),f(x,f(a(),x))) -> f#(x,a())
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y)) ->
    f#(f(y,z),f(x,f(a(),x))) -> f#(a(),z)
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y)) ->
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(a(),z),f(x,a()))
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y)) ->
    f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y))
   SCC Processor:
    #sccs: 1
    #rules: 1
    #arcs: 5/25
    DPs:
     f#(f(y,z),f(x,f(a(),x))) -> f#(f(f(a(),z),f(x,a())),f(a(),y))
    TRS:
     f(f(y,z),f(x,f(a(),x))) -> f(f(f(a(),z),f(x,a())),f(a(),y))
    Bounds Processor:
     bound: 0
     enrichment: match
     automaton:
      final states: {8,1}
      transitions:
       f0(6,5) -> 7*
       f0(3,5) -> 6*
       f0(3,17) -> 4*
       f0(17,5) -> 7*
       f0(7,4) -> 8*
       f0(3,6) -> 4*
       f0(7,17) -> 8*
       f0(5,3) -> 5*
       f0(3,2) -> 17*,6,4
       f0(3,3) -> 5*
       f0(2,3) -> 5*
       a0() -> 3*
       f{#,0}(7,17) -> 1*
       f{#,0}(7,4) -> 1*
       f30() -> 2*
     problem:
      DPs:
       
      TRS:
       f(f(y,z),f(x,f(a(),x))) -> f(f(f(a(),z),f(x,a())),f(a(),y))
     Qed

popout

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

job log

popout

actions all output return to TRS Standard