Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710725
details
property
value
status
complete
benchmark
Ex25_Luc06_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n112.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.914456129074 seconds
cpu usage
2.433487592
max memory
3.16882944E8
stage attributes
key
value
output-size
3570
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: f(f(X)) -> c(n__f(g(n__f(X)))) c(X) -> d(activate(X)) h(X) -> c(n__d(X)) f(X) -> n__f(X) d(X) -> n__d(X) activate(n__f(X)) -> f(X) activate(n__d(X)) -> d(X) activate(X) -> X Proof: String Reversal Processor: f(f(X)) -> n__f(g(n__f(c(X)))) c(X) -> activate(d(X)) h(X) -> n__d(c(X)) f(X) -> n__f(X) d(X) -> n__d(X) n__f(activate(X)) -> f(X) n__d(activate(X)) -> d(X) activate(X) -> X Matrix Interpretation Processor: dim=3 interpretation: [1 0 0] [n__d](x0) = [0 0 0]x0 [0 0 0] , [1 1 1] [1] [h](x0) = [0 0 1]x0 + [0] [0 0 0] [0], [1 0 0] [d](x0) = [0 0 0]x0 [0 0 0] , [1 0 1] [0] [activate](x0) = [0 1 0]x0 + [1] [0 0 1] [0], [1 0 0] [1] [c](x0) = [0 0 0]x0 + [1] [0 0 0] [0], [1 0 0] [g](x0) = [0 0 0]x0 [0 0 0] , [1 1 0] [0] [n__f](x0) = [0 1 0]x0 + [1] [0 0 0] [1], [1 1 1] [0] [f](x0) = [0 1 0]x0 + [1] [0 0 0] [1] orientation: [1 2 1] [2] [1 0 0] [2] f(f(X)) = [0 1 0]X + [2] >= [0 0 0]X + [1] = n__f(g(n__f(c(X)))) [0 0 0] [1] [0 0 0] [1] [1 0 0] [1] [1 0 0] [0] c(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = activate(d(X)) [0 0 0] [0] [0 0 0] [0] [1 1 1] [1] [1 0 0] [1] h(X) = [0 0 1]X + [0] >= [0 0 0]X + [0] = n__d(c(X)) [0 0 0] [0] [0 0 0] [0] [1 1 1] [0] [1 1 0] [0] f(X) = [0 1 0]X + [1] >= [0 1 0]X + [1] = n__f(X) [0 0 0] [1] [0 0 0] [1] [1 0 0] [1 0 0] d(X) = [0 0 0]X >= [0 0 0]X = n__d(X) [0 0 0] [0 0 0] [1 1 1] [1] [1 1 1] [0] n__f(activate(X)) = [0 1 0]X + [2] >= [0 1 0]X + [1] = f(X) [0 0 0] [1] [0 0 0] [1] [1 0 1] [1 0 0] n__d(activate(X)) = [0 0 0]X >= [0 0 0]X = d(X) [0 0 0] [0 0 0] [1 0 1] [0] activate(X) = [0 1 0]X + [1] >= X = X [0 0 1] [0] problem: f(f(X)) -> n__f(g(n__f(c(X)))) h(X) -> n__d(c(X)) f(X) -> n__f(X) d(X) -> n__d(X) n__d(activate(X)) -> d(X)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472