Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487067597
details
property
value
status
complete
benchmark
#3.5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n181.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
0.819626 seconds
cpu usage
2.05503
user time
1.58341
system time
0.471626
max virtual memory
3296648.0
max residence set size
69436.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> minus#(x,y) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> minus#(x,y) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) graph: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) -> mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) -> mod#(s(x),s(y)) -> le#(y,x) if_mod#(true(),s(x),s(y)) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) -> le#(s(x),s(y)) -> le#(x,y) minus#(s(x),s(y)) -> minus#(x,y) -> minus#(s(x),s(y)) -> minus#(x,y) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) SCC Processor: #sccs: 3 #rules: 4 #arcs: 8/36 DPs: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) Subterm Criterion Processor: simple projection: pi(minus) = 0 pi(mod#) = 0 pi(if_mod#) = 1 problem: DPs: mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,0()) -> x minus(s(x),s(y)) -> minus(x,y) mod(0(),y) -> 0()
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard