details

property	value
status	complete
benchmark	z22.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)	2.26627 seconds
cpu usage	7.61173
user time	5.68152
system time	1.93021
max virtual memory	6138448.0
max residence set size	74140.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: f(f(f(a(),b()),c()),x) -> f(b(),f(a(),f(c(),f(b(),x)))) f(x,f(y,z)) -> f(f(x,y),z) Proof: DP Processor: DPs: f#(f(f(a(),b()),c()),x) -> f#(b(),x) f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) f#(x,f(y,z)) -> f#(x,y) f#(x,f(y,z)) -> f#(f(x,y),z) TRS: f(f(f(a(),b()),c()),x) -> f(b(),f(a(),f(c(),f(b(),x)))) f(x,f(y,z)) -> f(f(x,y),z) EDG Processor: DPs: f#(f(f(a(),b()),c()),x) -> f#(b(),x) f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) f#(x,f(y,z)) -> f#(x,y) f#(x,f(y,z)) -> f#(f(x,y),z) TRS: f(f(f(a(),b()),c()),x) -> f(b(),f(a(),f(c(),f(b(),x)))) f(x,f(y,z)) -> f(f(x,y),z) graph: f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) -> f#(x,f(y,z)) -> f#(x,y) f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) -> f#(x,f(y,z)) -> f#(f(x,y),z) f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) -> f#(x,f(y,z)) -> f#(x,y) f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) -> f#(x,f(y,z)) -> f#(f(x,y),z) f#(f(f(a(),b()),c()),x) -> f#(b(),x) -> f#(x,f(y,z)) -> f#(x,y) f#(f(f(a(),b()),c()),x) -> f#(b(),x) -> f#(x,f(y,z)) -> f#(f(x,y),z) f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) -> f#(x,f(y,z)) -> f#(x,y) f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) -> f#(x,f(y,z)) -> f#(f(x,y),z) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(f(f(a(),b()),c()),x) -> f#(b(),x) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(x,f(y,z)) -> f#(x,y) f#(x,f(y,z)) -> f#(f(x,y),z) -> f#(x,f(y,z)) -> f#(f(x,y),z) f#(x,f(y,z)) -> f#(x,y) -> f#(f(f(a(),b()),c()),x) -> f#(b(),x) f#(x,f(y,z)) -> f#(x,y) -> f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) f#(x,f(y,z)) -> f#(x,y) -> f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) f#(x,f(y,z)) -> f#(x,y) -> f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) f#(x,f(y,z)) -> f#(x,y) -> f#(x,f(y,z)) -> f#(x,y) f#(x,f(y,z)) -> f#(x,y) -> f#(x,f(y,z)) -> f#(f(x,y),z) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: f50() -> 2* b0() -> 3* f{#,0}(3,2) -> 1* f0(3,2) -> 3* problem: DPs: f#(f(f(a(),b()),c()),x) -> f#(c(),f(b(),x)) f#(f(f(a(),b()),c()),x) -> f#(a(),f(c(),f(b(),x))) f#(f(f(a(),b()),c()),x) -> f#(b(),f(a(),f(c(),f(b(),x)))) f#(x,f(y,z)) -> f#(x,y) f#(x,f(y,z)) -> f#(f(x,y),z) TRS: f(f(f(a(),b()),c()),x) -> f(b(),f(a(),f(c(),f(b(),x)))) f(x,f(y,z)) -> f(f(x,y),z) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: b0() -> 3* f{#,0}(5,4) -> 1* f{#,0}(31,2) -> 1* f{#,0}(5,3) -> 1* f120() -> 2* c0() -> 5* f0(4,2) -> 4* f0(3,2) -> 4* f0(31,2) -> 31* f0(5,4) -> 31* popout

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

job log

popout

actions

all output return to TRS Standard