Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Equational 2019-03-21 05.09 pair #429997178
details
property
value
status
complete
benchmark
AC50.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n171.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.533826 seconds
cpu usage
0.497048
user time
0.292711
system time
0.204337
max virtual memory
113176.0
max residence set size
5792.0
stage attributes
key
value
starexec-result
YES
output
0.00/0.53 YES 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 (VAR k l x y) 0.00/0.53 (THEORY 0.00/0.53 (AC plus)) 0.00/0.53 (RULES 0.00/0.53 app(cons(x,l),k) -> cons(x,app(l,k)) 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ) 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(cons(x,l),k) -> cons(x,app(l,k)) 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 1 0.00/0.53 [cons](X1,X2) = X1 + X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = X1 + 2.X2 + 2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 2 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients:
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