Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487071437
details
property
value
status
complete
benchmark
Ex4_7_15_Bor03_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n183.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
0.644308 seconds
cpu usage
1.4736
user time
1.10307
system time
0.370533
max virtual memory
1842872.0
max residence set size
67780.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a__f(0()) -> cons(0(),f(s(0()))) a__f(s(0())) -> a__f(a__p(s(0()))) a__p(s(0())) -> 0() mark(f(X)) -> a__f(mark(X)) mark(p(X)) -> a__p(mark(X)) mark(0()) -> 0() mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__f(X) -> f(X) a__p(X) -> p(X) Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [1 0 0] [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 [0 0 0] [0 0 0] , [1 1 0] [a__f](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [f](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [0] [a__p](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [0] [0] = [1] [0], [1 0 0] [0] [p](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 0 0] [1] [mark](x0) = [0 1 0]x0 + [0] [0 0 0] [1], [1 0 0] [s](x0) = [0 1 0]x0 [0 0 0] orientation: [1] [1] a__f(0()) = [0] >= [0] = cons(0(),f(s(0()))) [0] [0] [1] [1] a__f(s(0())) = [0] >= [0] = a__f(a__p(s(0()))) [0] [0] [0] [0] a__p(s(0())) = [1] >= [1] = 0() [0] [0] [1 1 0] [1] [1 1 0] [1] mark(f(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = a__f(mark(X)) [0 0 0] [1] [0 0 0] [0] [1 0 0] [1] [1 0 0] [1] mark(p(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__p(mark(X)) [0 0 0] [1] [0 0 0] [0] [1] [0] mark(0()) = [1] >= [1] = 0() [1] [0] [1 0 0] [1 0 0] [1] [1 0 0] [1 0 0] [1] mark(cons(X1,X2)) = [0 0 0]X1 + [0 0 0]X2 + [0] >= [0 0 0]X1 + [0 0 0]X2 + [0] = cons(mark(X1),X2) [0 0 0] [0 0 0] [1] [0 0 0] [0 0 0] [0] [1 0 0] [1] [1 0 0] [1] mark(s(X)) = [0 1 0]X + [0] >= [0 1 0]X + [0] = s(mark(X)) [0 0 0] [1] [0 0 0] [0] [1 1 0] [1 1 0] a__f(X) = [0 0 0]X >= [0 0 0]X = f(X) [0 0 0] [0 0 0] [1 0 0] [0] [1 0 0] [0] a__p(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = p(X) [0 0 0] [0] [0 0 0] [0] problem: a__f(0()) -> cons(0(),f(s(0()))) a__f(s(0())) -> a__f(a__p(s(0()))) a__p(s(0())) -> 0() mark(f(X)) -> a__f(mark(X)) mark(p(X)) -> a__p(mark(X)) mark(cons(X1,X2)) -> cons(mark(X1),X2) mark(s(X)) -> s(mark(X)) a__f(X) -> f(X) a__p(X) -> p(X) Matrix Interpretation Processor: dim=3
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard