Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997241
details
property
value
status
complete
benchmark
AC07.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n123.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.708656 seconds
cpu usage
0.673676
user time
0.392478
system time
0.281198
max virtual memory
564024.0
max residence set size
5960.0
stage attributes
key
value
starexec-result
YES
output
0.60/0.70 YES 0.60/0.70 0.60/0.70 Problem 1: 0.60/0.70 0.60/0.70 (VAR x xs y) 0.60/0.70 (THEORY 0.60/0.70 (AC plus)) 0.60/0.70 (RULES 0.60/0.70 S(cons(x,xs)) -> plus(x,S(xs)) 0.60/0.70 S(nil) -> 0 0.60/0.70 int(0,0) -> cons(0,nil) 0.60/0.70 int(0,s(y)) -> cons(0,int(s(0),s(y))) 0.60/0.70 int(s(x),0) -> nil 0.60/0.70 int(s(x),s(y)) -> intlist(int(x,y)) 0.60/0.70 intlist(cons(x,y)) -> cons(s(x),intlist(y)) 0.60/0.70 intlist(nil) -> nil 0.60/0.70 plus(x,0) -> x 0.60/0.70 plus(x,s(y)) -> s(plus(x,y)) 0.60/0.70 sum(x,y) -> S(int(x,y)) 0.60/0.70 ) 0.60/0.70 0.60/0.70 Problem 1: 0.60/0.70 0.60/0.70 Reduction Order Processor: 0.60/0.70 -> Rules: 0.60/0.70 S(cons(x,xs)) -> plus(x,S(xs)) 0.60/0.70 S(nil) -> 0 0.60/0.70 int(0,0) -> cons(0,nil) 0.60/0.70 int(0,s(y)) -> cons(0,int(s(0),s(y))) 0.60/0.70 int(s(x),0) -> nil 0.60/0.70 int(s(x),s(y)) -> intlist(int(x,y)) 0.60/0.70 intlist(cons(x,y)) -> cons(s(x),intlist(y)) 0.60/0.70 intlist(nil) -> nil 0.60/0.70 plus(x,0) -> x 0.60/0.70 plus(x,s(y)) -> s(plus(x,y)) 0.60/0.70 sum(x,y) -> S(int(x,y)) 0.60/0.70 ->Interpretation type: 0.60/0.70 Linear 0.60/0.70 ->Coefficients: 0.60/0.70 Natural Numbers 0.60/0.70 ->Dimension: 0.60/0.70 1 0.60/0.70 ->Bound: 0.60/0.70 2 0.60/0.70 ->Interpretation: 0.60/0.70 0.60/0.70 [S](X) = X 0.60/0.70 [int](X1,X2) = 2.X1 + 2.X2 + 2 0.60/0.70 [intlist](X) = X 0.60/0.70 [plus](X1,X2) = X1 + X2 0.60/0.70 [sum](X1,X2) = 2.X1 + 2.X2 + 2 0.60/0.70 [0] = 0 0.60/0.70 [cons](X1,X2) = 2.X1 + X2 0.60/0.70 [nil] = 2 0.60/0.70 [s](X) = X 0.60/0.70 0.60/0.70 Problem 1: 0.60/0.70 0.60/0.70 Reduction Order Processor: 0.60/0.70 -> Rules: 0.60/0.70 S(cons(x,xs)) -> plus(x,S(xs)) 0.60/0.70 int(0,0) -> cons(0,nil) 0.60/0.70 int(0,s(y)) -> cons(0,int(s(0),s(y))) 0.60/0.70 int(s(x),0) -> nil 0.60/0.70 int(s(x),s(y)) -> intlist(int(x,y)) 0.60/0.70 intlist(cons(x,y)) -> cons(s(x),intlist(y)) 0.60/0.70 intlist(nil) -> nil 0.60/0.70 plus(x,0) -> x 0.60/0.70 plus(x,s(y)) -> s(plus(x,y)) 0.60/0.70 sum(x,y) -> S(int(x,y)) 0.60/0.70 ->Interpretation type: 0.60/0.70 Linear 0.60/0.70 ->Coefficients: 0.60/0.70 Natural Numbers 0.60/0.70 ->Dimension: 0.60/0.70 1 0.60/0.70 ->Bound: 0.60/0.70 2 0.60/0.70 ->Interpretation: 0.60/0.70 0.60/0.70 [S](X) = X + 1 0.60/0.70 [int](X1,X2) = 2.X1 + 2.X2 + 1 0.60/0.70 [intlist](X) = X 0.60/0.70 [plus](X1,X2) = X1 + X2 0.60/0.70 [sum](X1,X2) = 2.X1 + 2.X2 + 2 0.60/0.70 [0] = 0 0.60/0.70 [cons](X1,X2) = 2.X1 + X2 0.60/0.70 [nil] = 0 0.60/0.70 [s](X) = X 0.60/0.70 0.60/0.70 Problem 1: 0.60/0.70 0.60/0.70 Reduction Order Processor: 0.60/0.70 -> Rules: 0.60/0.70 S(cons(x,xs)) -> plus(x,S(xs)) 0.60/0.70 int(0,s(y)) -> cons(0,int(s(0),s(y))) 0.60/0.70 int(s(x),0) -> nil 0.60/0.70 int(s(x),s(y)) -> intlist(int(x,y)) 0.60/0.70 intlist(cons(x,y)) -> cons(s(x),intlist(y)) 0.60/0.70 intlist(nil) -> nil
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