Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712356
details
property
value
status
complete
benchmark
#3.12.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n008.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.626040220261 seconds
cpu usage
1.27715505
max memory
1.89325312E8
stage attributes
key
value
output-size
4469
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: app(nil(),y) -> y app(add(n,x),y) -> add(n,app(x,y)) reverse(nil()) -> nil() reverse(add(n,x)) -> app(reverse(x),add(n,nil())) shuffle(nil()) -> nil() shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) Proof: Matrix Interpretation Processor: dim=1 interpretation: [shuffle](x0) = x0 + 1, [reverse](x0) = x0, [add](x0, x1) = 2x0 + x1, [app](x0, x1) = x0 + x1, [nil] = 0 orientation: app(nil(),y) = y >= y = y app(add(n,x),y) = 2n + x + y >= 2n + x + y = add(n,app(x,y)) reverse(nil()) = 0 >= 0 = nil() reverse(add(n,x)) = 2n + x >= 2n + x = app(reverse(x),add(n,nil())) shuffle(nil()) = 1 >= 0 = nil() shuffle(add(n,x)) = 2n + x + 1 >= 2n + x + 1 = add(n,shuffle(reverse(x))) problem: app(nil(),y) -> y app(add(n,x),y) -> add(n,app(x,y)) reverse(nil()) -> nil() reverse(add(n,x)) -> app(reverse(x),add(n,nil())) shuffle(add(n,x)) -> add(n,shuffle(reverse(x))) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [shuffle](x0) = [0 1 0]x0 [1 0 0] , [1 0 0] [reverse](x0) = [0 1 0]x0 [0 0 0] , [1 0 1] [1 0 0] [0] [add](x0, x1) = [0 0 0]x0 + [0 1 0]x1 + [1] [0 0 0] [0 0 0] [0], [1 0 0] [app](x0, x1) = [0 1 0]x0 + x1 [0 0 0] , [0] [nil] = [0] [0] orientation: app(nil(),y) = y >= y = y [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [1 0 0] [0] app(add(n,x),y) = [0 0 0]n + [0 1 0]x + y + [1] >= [0 0 0]n + [0 1 0]x + [0 1 0]y + [1] = add(n,app(x,y)) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0 0 0] [0] [0] [0] reverse(nil()) = [0] >= [0] = nil() [0] [0] [1 0 1] [1 0 0] [0] [1 0 1] [1 0 0] [0] reverse(add(n,x)) = [0 0 0]n + [0 1 0]x + [1] >= [0 0 0]n + [0 1 0]x + [1] = app(reverse(x),add(n,nil())) [0 0 0] [0 0 0] [0] [0 0 0] [0 0 0] [0] [1 0 1] [1 1 0] [1] [1 0 1] [1 1 0] [0] shuffle(add(n,x)) = [0 0 0]n + [0 1 0]x + [1] >= [0 0 0]n + [0 1 0]x + [1] = add(n,shuffle(reverse(x))) [1 0 1] [1 0 0] [0] [0 0 0] [0 0 0] [0] problem: app(nil(),y) -> y app(add(n,x),y) -> add(n,app(x,y)) reverse(nil()) -> nil() reverse(add(n,x)) -> app(reverse(x),add(n,nil())) Matrix Interpretation Processor: dim=1 interpretation: [reverse](x0) = 2x0 + 1, [add](x0, x1) = 4x0 + x1 + 6,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472