details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	2.72944 seconds
cpu usage	9.46385
user time	8.33996
system time	1.12389
max virtual memory	6642432.0
max residence set size	84180.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() foldB(t,0()) -> t foldB(t,s(n)) -> f(foldB(t,n),B()) foldC(t,0()) -> t foldC(t,s(n)) -> f(foldC(t,n),C()) f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),C()) -> triple(a,b,s(c)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) fold(t,x,0()) -> t fold(t,x,s(n)) -> f(fold(t,x,n),x) Proof: DP Processor: DPs: foldB#(t,s(n)) -> foldB#(t,n) foldB#(t,s(n)) -> f#(foldB(t,n),B()) foldC#(t,s(n)) -> foldC#(t,n) foldC#(t,s(n)) -> f#(foldC(t,n),C()) f#(t,x) -> g#(x) f#(t,x) -> f'#(t,g(x)) f'#(triple(a,b,c),B()) -> f#(triple(a,b,c),A()) f'#(triple(a,b,c),A()) -> foldB#(triple(s(a),0(),c),b) f'#(triple(a,b,c),A()) -> f''#(foldB(triple(s(a),0(),c),b)) f''#(triple(a,b,c)) -> foldC#(triple(a,b,0()),c) fold#(t,x,s(n)) -> fold#(t,x,n) fold#(t,x,s(n)) -> f#(fold(t,x,n),x) TRS: g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() foldB(t,0()) -> t foldB(t,s(n)) -> f(foldB(t,n),B()) foldC(t,0()) -> t foldC(t,s(n)) -> f(foldC(t,n),C()) f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),C()) -> triple(a,b,s(c)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) fold(t,x,0()) -> t fold(t,x,s(n)) -> f(fold(t,x,n),x) TDG Processor: DPs: foldB#(t,s(n)) -> foldB#(t,n) foldB#(t,s(n)) -> f#(foldB(t,n),B()) foldC#(t,s(n)) -> foldC#(t,n) foldC#(t,s(n)) -> f#(foldC(t,n),C()) f#(t,x) -> g#(x) f#(t,x) -> f'#(t,g(x)) f'#(triple(a,b,c),B()) -> f#(triple(a,b,c),A()) f'#(triple(a,b,c),A()) -> foldB#(triple(s(a),0(),c),b) f'#(triple(a,b,c),A()) -> f''#(foldB(triple(s(a),0(),c),b)) f''#(triple(a,b,c)) -> foldC#(triple(a,b,0()),c) fold#(t,x,s(n)) -> fold#(t,x,n) fold#(t,x,s(n)) -> f#(fold(t,x,n),x) TRS: g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() foldB(t,0()) -> t foldB(t,s(n)) -> f(foldB(t,n),B()) foldC(t,0()) -> t foldC(t,s(n)) -> f(foldC(t,n),C()) f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),C()) -> triple(a,b,s(c)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),A()) -> f''(foldB(triple(s(a),0(),c),b)) f''(triple(a,b,c)) -> foldC(triple(a,b,0()),c) fold(t,x,0()) -> t fold(t,x,s(n)) -> f(fold(t,x,n),x) graph: fold#(t,x,s(n)) -> fold#(t,x,n) -> fold#(t,x,s(n)) -> f#(fold(t,x,n),x) fold#(t,x,s(n)) -> fold#(t,x,n) -> fold#(t,x,s(n)) -> fold#(t,x,n) fold#(t,x,s(n)) -> f#(fold(t,x,n),x) -> f#(t,x) -> f'#(t,g(x)) fold#(t,x,s(n)) -> f#(fold(t,x,n),x) -> f#(t,x) -> g#(x) f''#(triple(a,b,c)) -> foldC#(triple(a,b,0()),c) -> foldC#(t,s(n)) -> f#(foldC(t,n),C()) f''#(triple(a,b,c)) -> foldC#(triple(a,b,0()),c) -> foldC#(t,s(n)) -> foldC#(t,n) f'#(triple(a,b,c),B()) -> f#(triple(a,b,c),A()) -> popout

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

job log

popout

actions

all output return to TRS Standard