Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997260
details
property
value
status
complete
benchmark
IJCAR_AC1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n157.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.0752649 seconds
cpu usage
0.039942
user time
0.024702
system time
0.01524
max virtual memory
113176.0
max residence set size
6104.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.07 YES 0.00/0.07 Input TRS: 0.00/0.07 AC symbols: plus times 0.00/0.07 1: plus(x,0()) -> x 0.00/0.07 2: plus(0(),y) -> y 0.00/0.07 3: plus(s(x),y) -> s(plus(x,y)) 0.00/0.07 4: times(0(),y) -> 0() 0.00/0.07 5: times(s(0()),y) -> y 0.00/0.07 6: times(s(x),y) -> plus(y,times(x,y)) 0.00/0.07 7: div(0(),y) -> 0() 0.00/0.07 8: div(x,y) -> quot(x,y,y) 0.00/0.07 9: quot(0(),s(y),z) -> 0() 0.00/0.07 10: quot(s(x),s(y),z) -> quot(x,y,z) 0.00/0.07 11: quot(x,0(),s(z)) -> s(div(x,s(z))) 0.00/0.07 12: div(div(x,y),z) -> div(x,times(y,z)) 0.00/0.07 Number of strict rules: 12 0.00/0.07 Direct POLO(bPol) ... failed. 0.00/0.07 Uncurrying ... failed. 0.00/0.07 Dependency Pairs: 0.00/0.07 #1: #times(s(x),y) -> #plus(y,times(x,y)) 0.00/0.07 #2: #times(s(x),y) -> #times(x,y) 0.00/0.07 #3: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) 0.00/0.07 #4: #plus(x,plus(y,z)) ->= #plus(x,y) 0.00/0.07 #5: #quot(x,0(),s(z)) -> #div(x,s(z)) 0.00/0.07 #6: #div(div(x,y),z) -> #div(x,times(y,z)) 0.00/0.07 #7: #div(div(x,y),z) -> #times(y,z) 0.00/0.07 #8: #times(x,times(y,z)) ->= #times(times(x,y),z) 0.00/0.07 #9: #times(x,times(y,z)) ->= #times(x,y) 0.00/0.07 #10: #quot(s(x),s(y),z) -> #quot(x,y,z) 0.00/0.07 #11: #plus(s(x),y) -> #plus(x,y) 0.00/0.07 #12: #div(x,y) -> #quot(x,y,y) 0.00/0.07 Number of SCCs: 3, DPs: 10 0.00/0.07 SCC { #2 #8 #9 } 0.00/0.07 POLO(Sum)... POLO(max)... QLPOS... succeeded. 0.00/0.07 #div s: [] p: 0 0.00/0.07 s s: [1] p: 0 0.00/0.07 #plus s: {} p: 1 0.00/0.07 div s: [] p: 0 0.00/0.07 #times s: {1,2} p: 2 0.00/0.07 0 s: [] p: 0 0.00/0.07 quot s: [] p: 0 0.00/0.07 times s: {1,2} p: 2 0.00/0.07 plus s: {1,2} p: 1 0.00/0.07 #quot s: [] p: 0 0.00/0.07 USABLE RULES: { 1..6 13 14 } 0.00/0.07 Removed DPs: #2 #9 0.00/0.07 Number of SCCs: 3, DPs: 8 0.00/0.07 SCC { #8 } 0.00/0.07 only weak rules. 0.00/0.07 Number of SCCs: 2, DPs: 7 0.00/0.07 SCC { #3 #4 #11 } 0.00/0.07 POLO(Sum)... succeeded. 0.00/0.07 #div w: 0 0.00/0.07 s w: x1 + 1 0.00/0.07 #plus w: x1 + x2 0.00/0.07 div w: 0 0.00/0.07 #times w: 0 0.00/0.07 0 w: 2 0.00/0.07 quot w: 0 0.00/0.07 times w: 1 0.00/0.07 plus w: x1 + x2 + 1 0.00/0.07 #quot w: 0 0.00/0.07 USABLE RULES: { 1..3 13 } 0.00/0.07 Removed DPs: #4 #11 0.00/0.07 Number of SCCs: 2, DPs: 5 0.00/0.07 SCC { #3 } 0.00/0.07 only weak rules. 0.00/0.07 Number of SCCs: 1, DPs: 4 0.00/0.07 SCC { #5 #6 #10 #12 } 0.00/0.07 POLO(Sum)... succeeded. 0.00/0.07 #div w: x1 0.00/0.07 s w: x1 + 1 0.00/0.07 #plus w: x1 + x2 0.00/0.07 div w: x1 + x2 + 1 0.00/0.07 #times w: 0 0.00/0.07 0 w: 2 0.00/0.07 quot w: 0 0.00/0.07 times w: 1 0.00/0.07 plus w: x1 + x2 + 1 0.00/0.07 #quot w: x1 0.00/0.07 USABLE RULES: { 1..3 13 } 0.00/0.07 Removed DPs: #6 #10 0.00/0.07 Number of SCCs: 1, DPs: 2 0.00/0.07 SCC { #5 #12 } 0.00/0.07 POLO(Sum)... POLO(max)... succeeded. 0.00/0.07 #div w: max(x2 + 2) 0.00/0.07 s w: 1 0.00/0.07 #plus w: 0 0.00/0.07 div w: 0 0.00/0.07 #times w: 0 0.00/0.07 0 w: 2 0.00/0.07 quot w: 0 0.00/0.07 times w: max(x1, x2) 0.00/0.07 plus w: max(x1, x2) 0.00/0.07 #quot w: max(x2 + 1) 0.00/0.07 USABLE RULES: { } 0.00/0.07 Removed DPs: #12 0.00/0.07 Number of SCCs: 0, DPs: 0 0.00/0.07 Next Dependency Pairs: 0.00/0.07 #13: #plus(plus(0(),y),_1) -> #plus(y,_1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Equational 2019-03-21 05.09