Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715609
details
property
value
status
complete
benchmark
LengthOfFiniteLists_nosorts_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n192.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.33050608635 seconds
cpu usage
2.921095759
max memory
1.801216E8
stage attributes
key
value
output-size
6733
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem: zeros() -> cons(0(),n__zeros()) and(tt(),X) -> activate(X) length(nil()) -> 0() length(cons(N,L)) -> s(length(activate(L))) zeros() -> n__zeros() activate(n__zeros()) -> zeros() activate(X) -> X Proof: Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [s](x0) = [0 0 0]x0 [0 1 0] , [1 0 0] [length](x0) = [0 1 0]x0 [1 0 0] , [0] [nil] = [0] [0], [1 0 1] [1] [activate](x0) = [0 1 0]x0 + [1] [0 0 1] [1], [1 0 0] [1 0 1] [1] [and](x0, x1) = [0 0 0]x0 + [0 1 1]x1 + [1] [0 0 0] [1 0 1] [1], [0] [tt] = [0] [0], [1 0 0] [1 1 1] [1] [cons](x0, x1) = [0 1 0]x0 + [0 0 0]x1 + [0] [0 0 0] [0 0 0] [0], [0] [n__zeros] = [0] [0], [0] [0] = [0] [0], [1] [zeros] = [1] [0] orientation: [1] [1] zeros() = [1] >= [0] = cons(0(),n__zeros()) [0] [0] [1 0 1] [1] [1 0 1] [1] and(tt(),X) = [0 1 1]X + [1] >= [0 1 0]X + [1] = activate(X) [1 0 1] [1] [0 0 1] [1] [0] [0] length(nil()) = [0] >= [0] = 0() [0] [0] [1 1 1] [1 0 0] [1] [1 0 1] [1] length(cons(N,L)) = [0 0 0]L + [0 1 0]N + [0] >= [0 0 0]L + [0] = s(length(activate(L))) [1 1 1] [1 0 0] [1] [0 1 0] [1] [1] [0] zeros() = [1] >= [0] = n__zeros() [0] [0] [1] [1] activate(n__zeros()) = [1] >= [1] = zeros() [1] [0] [1 0 1] [1] activate(X) = [0 1 0]X + [1] >= X = X [0 0 1] [1] problem: zeros() -> cons(0(),n__zeros()) and(tt(),X) -> activate(X) length(nil()) -> 0() length(cons(N,L)) -> s(length(activate(L))) activate(n__zeros()) -> zeros() Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [s](x0) = [0 0 0]x0 [0 0 0] ,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472