Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997185
details
property
value
status
complete
benchmark
AC10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n164.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
NaTT
configuration
Default
runtime (wallclock)
0.065383 seconds
cpu usage
0.040609
user time
0.026299
system time
0.01431
max virtual memory
113176.0
max residence set size
6508.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.06 YES 0.00/0.06 Input TRS: 0.00/0.06 AC symbols: plus times 0.00/0.06 1: plus(x,0()) -> x 0.00/0.06 2: plus(s(x),y) -> s(plus(x,y)) 0.00/0.06 3: times(x,0()) -> 0() 0.00/0.06 4: times(s(x),y) -> plus(times(x,y),y) 0.00/0.06 5: times(x,plus(y,z)) -> plus(times(x,y),times(x,z)) 0.00/0.06 Number of strict rules: 5 0.00/0.06 Direct POLO(bPol) ... failed. 0.00/0.06 Uncurrying ... failed. 0.00/0.06 Dependency Pairs: 0.00/0.06 #1: #plus(s(x),y) -> #plus(x,y) 0.00/0.06 #2: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) 0.00/0.06 #3: #plus(x,plus(y,z)) ->= #plus(x,y) 0.00/0.06 #4: #times(x,times(y,z)) ->= #times(times(x,y),z) 0.00/0.06 #5: #times(x,times(y,z)) ->= #times(x,y) 0.00/0.06 #6: #times(x,plus(y,z)) -> #plus(times(x,y),times(x,z)) 0.00/0.06 #7: #times(x,plus(y,z)) -> #times(x,y) 0.00/0.06 #8: #times(x,plus(y,z)) -> #times(x,z) 0.00/0.06 #9: #times(s(x),y) -> #plus(times(x,y),y) 0.00/0.06 #10: #times(s(x),y) -> #times(x,y) 0.00/0.06 Number of SCCs: 2, DPs: 8 0.00/0.06 SCC { #1..3 } 0.00/0.06 POLO(Sum)... succeeded. 0.00/0.06 s w: x1 + 1 0.00/0.06 #plus w: x1 + x2 0.00/0.06 #times w: 0 0.00/0.06 0 w: 1 0.00/0.06 times w: 0 0.00/0.06 plus w: x1 + x2 + 1 0.00/0.06 USABLE RULES: { 1 2 6 } 0.00/0.06 Removed DPs: #1 #3 0.00/0.06 Number of SCCs: 2, DPs: 6 0.00/0.06 SCC { #2 } 0.00/0.06 only weak rules. 0.00/0.06 Number of SCCs: 1, DPs: 5 0.00/0.06 SCC { #4 #5 #7 #8 #10 } 0.00/0.06 POLO(Sum)... POLO(max)... QLPOS... succeeded. 0.00/0.06 s s: [1] p: 0 0.00/0.06 #plus s: {} p: 1 0.00/0.06 #times s: {1,2} p: 2 0.00/0.06 0 s: [] p: 0 0.00/0.06 times s: {1,2} p: 2 0.00/0.06 plus s: {1,2} p: 1 0.00/0.06 USABLE RULES: { 1..7 } 0.00/0.06 Removed DPs: #5 #7 #8 #10 0.00/0.06 Number of SCCs: 1, DPs: 1 0.00/0.06 SCC { #4 } 0.00/0.06 only weak rules. 0.00/0.06 Number of SCCs: 0, DPs: 0 0.00/0.06 Next Dependency Pairs: 0.00/0.06 #11: #plus(plus(s(x),y),_1) -> #plus(s(plus(x,y)),_1) 0.00/0.06 #12: #plus(x,plus(y,z)) ->= #plus(plus(x,y),z) 0.00/0.06 #13: #plus(x,plus(y,z)) ->= #plus(x,y) 0.00/0.06 #14: #times(x,times(y,z)) ->= #times(times(x,y),z) 0.00/0.06 #15: #times(x,times(y,z)) ->= #times(x,y) 0.00/0.06 #16: #times(times(x,plus(y,z)),_1) -> #times(plus(times(x,y),times(x,z)),_1) 0.00/0.06 #17: #times(times(x,0()),_1) -> #times(0(),_1) 0.00/0.06 #18: #plus(plus(x,0()),_1) -> #plus(x,_1) 0.00/0.06 #19: #times(times(s(x),y),_1) -> #times(plus(times(x,y),y),_1) 0.00/0.06 Number of SCCs: 2, DPs: 9 0.00/0.06 SCC { #11..13 #18 } 0.00/0.06 POLO(Sum)... succeeded. 0.00/0.06 s w: 1 0.00/0.06 #plus w: x1 + x2 0.00/0.06 #times w: 0 0.00/0.06 0 w: 1 0.00/0.06 times w: x1 + x2 + 1 0.00/0.06 plus w: x1 + x2 + 2 0.00/0.06 USABLE RULES: { 1 2 6 } 0.00/0.06 Removed DPs: #11 #13 #18 0.00/0.06 Number of SCCs: 2, DPs: 6 0.00/0.06 SCC { #12 } 0.00/0.06 only weak rules. 0.00/0.06 Number of SCCs: 1, DPs: 5 0.00/0.06 SCC { #14..17 #19 } 0.00/0.06 POLO(Sum)... POLO(max)... QLPOS... succeeded. 0.00/0.06 s s: [1] p: 0 0.00/0.06 #plus s: {} p: 1 0.00/0.06 #times s: {1,2} p: 2 0.00/0.06 0 s: [] p: 0 0.00/0.06 times s: {1,2} p: 2 0.00/0.06 plus s: {1,2} p: 1 0.00/0.06 USABLE RULES: { 1..7 } 0.00/0.06 Removed DPs: #15..17 #19 0.00/0.06 Number of SCCs: 1, DPs: 1 0.00/0.06 SCC { #14 } 0.00/0.06 only weak rules. 0.00/0.06 Number of SCCs: 0, DPs: 0 0.00/0.06 EOF
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