details

property	value
status	complete
benchmark	jw16.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	Zantema_05

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.508619 seconds
cpu usage	0.980336
user time	0.659307
system time	0.321029
max virtual memory	96176.0
max residence set size	66260.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to TRS Standard