details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.572001 seconds
cpu usage	1.20599
user time	0.809629
system time	0.396357
max virtual memory	1843608.0
max residence set size	67148.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Standard