Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487068732
details
property
value
status
complete
benchmark
z02.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n174.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
0.981424 seconds
cpu usage
2.74015
user time
1.66107
system time
1.07907
max virtual memory
3982704.0
max residence set size
68260.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Proof: DP Processor: DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) EDG Processor: DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) graph: a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(f(),x) a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(g(),a(f(),x)) a#(f(),a(f(),x)) -> a#(x,g()) -> a#(x,g()) -> a#(f(),a(g(),a(f(),x))) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) -> a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) -> a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(f(),x) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(g(),a(f(),x)) a#(x,g()) -> a#(f(),x) -> a#(x,g()) -> a#(f(),a(g(),a(f(),x))) SCC Processor: #sccs: 1 #rules: 3 #arcs: 8/16 DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),a(g(),a(f(),x))) a#(x,g()) -> a#(f(),x) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {4} transitions: a{#,0}(6,9) -> 4* f0() -> 6* g0() -> 8* f40() -> 5* a0(8,7) -> 9* a0(6,6) -> 7* a0(6,9) -> 7* a0(6,5) -> 7* a0(5,8) -> 7* problem: DPs: a#(f(),a(f(),x)) -> a#(x,g()) a#(x,g()) -> a#(f(),x) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: a{#,0}(7,7) -> 1* a{#,0}(3,2) -> 1* a{#,0}(7,3) -> 1* f0() -> 7* g0() -> 2* f120() -> 3* problem: DPs: a#(x,g()) -> a#(f(),x) TRS: a(f(),a(f(),x)) -> a(x,g()) a(x,g()) -> a(f(),a(g(),a(f(),x))) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: a{#,0}(3,2) -> 1* a{#,0}(3,3) -> 1* f0() -> 3* f140() -> 2* problem: DPs: TRS:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard