TRS Standard pair #487068727

details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.520156 seconds
cpu usage	0.936825
user time	0.649722
system time	0.287103
max virtual memory	96176.0
max residence set size	64408.0

stage attributes

key	value
starexec-result	YES

output

YES

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

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

popout

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

job log

popout

actions all output return to TRS Standard