Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716864
details
property
value
status
complete
benchmark
Ex2_Luc03b_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n079.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.723515987396 seconds
cpu usage
1.617047481
max memory
2.30981632E8
stage attributes
key
value
output-size
6437
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(X1,X2) activate(n__from(X)) -> from(X) activate(n__add(X1,X2)) -> add(X1,X2) activate(n__len(X)) -> len(X) activate(X) -> X Proof: Matrix Interpretation Processor: dim=1 interpretation: [n__len](x0) = x0, [len](x0) = 2x0, [n__add](x0, x1) = x0 + 4x1 + 3, [add](x0, x1) = 2x0 + 4x1 + 5, [n__from](x0) = x0 + 2, [from](x0) = 2x0 + 4, [n__fst](x0, x1) = 2x0 + 2x1, [activate](x0) = 2x0, [cons](x0, x1) = x0 + x1, [s](x0) = x0, [nil] = 0, [fst](x0, x1) = 4x0 + 4x1, [0] = 0 orientation: fst(0(),Z) = 4Z >= 0 = nil() fst(s(X),cons(Y,Z)) = 4X + 4Y + 4Z >= 4X + Y + 4Z = cons(Y,n__fst(activate(X),activate(Z))) from(X) = 2X + 4 >= 2X + 2 = cons(X,n__from(s(X))) add(0(),X) = 4X + 5 >= X = X add(s(X),Y) = 2X + 4Y + 5 >= 2X + 4Y + 3 = s(n__add(activate(X),Y)) len(nil()) = 0 >= 0 = 0() len(cons(X,Z)) = 2X + 2Z >= 2Z = s(n__len(activate(Z))) fst(X1,X2) = 4X1 + 4X2 >= 2X1 + 2X2 = n__fst(X1,X2) from(X) = 2X + 4 >= X + 2 = n__from(X) add(X1,X2) = 2X1 + 4X2 + 5 >= X1 + 4X2 + 3 = n__add(X1,X2) len(X) = 2X >= X = n__len(X) activate(n__fst(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = fst(X1,X2) activate(n__from(X)) = 2X + 4 >= 2X + 4 = from(X) activate(n__add(X1,X2)) = 2X1 + 8X2 + 6 >= 2X1 + 4X2 + 5 = add(X1,X2) activate(n__len(X)) = 2X >= 2X = len(X) activate(X) = 2X >= X = X problem: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(X1,X2) activate(n__from(X)) -> from(X) activate(n__len(X)) -> len(X) activate(X) -> X Matrix Interpretation Processor: dim=1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472