Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487073542
details
property
value
status
complete
benchmark
jwtpa1.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
Waldmann_06
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.04505 seconds
cpu usage
3.07751
user time
2.31952
system time
0.757991
max virtual memory
5436216.0
max residence set size
72400.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: f(f(a(),x),y) -> f(y,f(x,f(a(),f(h(a()),a())))) Proof: DP Processor: DPs: f#(f(a(),x),y) -> f#(h(a()),a()) f#(f(a(),x),y) -> f#(a(),f(h(a()),a())) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) TRS: f(f(a(),x),y) -> f(y,f(x,f(a(),f(h(a()),a())))) EDG Processor: DPs: f#(f(a(),x),y) -> f#(h(a()),a()) f#(f(a(),x),y) -> f#(a(),f(h(a()),a())) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) TRS: f(f(a(),x),y) -> f(y,f(x,f(a(),f(h(a()),a())))) graph: f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) -> f#(f(a(),x),y) -> f#(h(a()),a()) f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) -> f#(f(a(),x),y) -> f#(a(),f(h(a()),a())) f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) -> f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) -> f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) -> f#(f(a(),x),y) -> f#(h(a()),a()) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) -> f#(f(a(),x),y) -> f#(a(),f(h(a()),a())) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) -> f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) -> f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) SCC Processor: #sccs: 1 #rules: 2 #arcs: 8/16 DPs: f#(f(a(),x),y) -> f#(y,f(x,f(a(),f(h(a()),a())))) f#(f(a(),x),y) -> f#(x,f(a(),f(h(a()),a()))) TRS: f(f(a(),x),y) -> f(y,f(x,f(a(),f(h(a()),a())))) Bounds Processor: bound: 1 enrichment: match automaton: final states: {9,8,1} transitions: f{#,0}(6,5) -> 8* f{#,0}(7,10) -> 8* f{#,0}(7,7) -> 1* f{#,0}(4,5) -> 8* f{#,0}(5,5) -> 1* f{#,0}(10,10) -> 8* f{#,0}(10,7) -> 1* f{#,0}(6,7) -> 1* f{#,0}(5,7) -> 8* f{#,0}(5,10) -> 1* a0() -> 2* f0(4,5) -> 10* f0(7,7) -> 9* f0(5,7) -> 7* f0(10,7) -> 7* f0(6,5) -> 7* f0(5,10) -> 7* f0(6,7) -> 9* f0(7,10) -> 7* f0(2,4) -> 5* f0(5,5) -> 7* f0(10,10) -> 7* f0(3,2) -> 4* f{#,1}(4,16) -> 8* f{#,1}(17,17) -> 8* f{#,1}(7,17) -> 8* f{#,1}(10,17) -> 8* f{#,1}(5,17) -> 8* h1(13) -> 14* f40() -> 6* h0(2) -> 3* a1() -> 13* f1(10,17) -> 7* f1(14,13) -> 15* f1(17,17) -> 7* f1(13,15) -> 16* f1(7,17) -> 7* f1(5,17) -> 7* f1(4,16) -> 17* 8 -> 1* 1 -> 8* problem: DPs: TRS: f(f(a(),x),y) -> f(y,f(x,f(a(),f(h(a()),a()))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard