Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719525
details
property
value
status
complete
benchmark
96289.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
5.21016907692 seconds
cpu usage
18.952648876
max memory
1.348825088E9
stage attributes
key
value
output-size
10148
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: 0(1(2(2(x1)))) -> 3(3(2(x1))) 4(1(1(0(2(x1))))) -> 0(3(2(0(x1)))) 4(5(3(4(5(x1))))) -> 2(3(1(5(x1)))) 0(0(5(2(2(0(x1)))))) -> 3(5(0(3(2(x1))))) 2(0(1(2(0(3(x1)))))) -> 2(5(3(2(3(x1))))) 0(5(1(5(4(0(4(1(0(x1))))))))) -> 2(4(2(1(1(2(5(5(x1)))))))) 1(4(3(0(0(5(1(4(3(x1))))))))) -> 5(4(2(5(2(2(4(3(x1)))))))) 2(5(2(3(4(0(0(4(4(3(x1)))))))))) -> 3(0(3(5(2(1(2(2(3(x1))))))))) 4(2(1(3(2(4(4(2(4(2(x1)))))))))) -> 3(0(3(3(4(1(3(4(2(2(x1)))))))))) 1(1(5(4(0(2(0(3(4(0(2(x1))))))))))) -> 1(5(0(4(2(2(0(0(3(0(1(x1))))))))))) 3(3(1(4(4(2(2(1(1(3(4(x1))))))))))) -> 3(3(3(5(5(5(4(1(2(3(x1)))))))))) 4(4(2(0(3(1(2(0(0(0(1(x1))))))))))) -> 4(0(0(3(3(1(1(5(0(1(x1)))))))))) 4(4(4(3(1(1(3(0(3(0(3(x1))))))))))) -> 1(4(3(4(4(3(5(3(0(3(x1)))))))))) 4(2(4(5(0(4(0(5(3(1(0(5(3(x1))))))))))))) -> 4(0(4(5(5(0(3(0(5(5(5(4(x1)))))))))))) 4(5(4(0(3(0(2(1(5(5(4(2(2(x1))))))))))))) -> 2(1(0(0(1(2(0(0(4(0(1(2(3(3(x1)))))))))))))) 1(1(1(5(1(0(5(3(1(5(4(4(0(0(x1)))))))))))))) -> 5(5(2(4(4(0(4(0(5(0(4(2(4(5(x1)))))))))))))) 4(0(0(5(2(4(3(4(3(4(4(0(0(3(x1)))))))))))))) -> 3(0(3(4(0(1(2(4(0(5(2(5(3(x1))))))))))))) 5(2(5(0(1(1(3(0(4(4(2(4(3(2(x1)))))))))))))) -> 5(3(2(0(1(2(5(1(2(2(5(1(3(x1))))))))))))) 4(0(1(5(3(3(4(0(4(4(4(5(4(0(2(x1))))))))))))))) -> 4(4(0(1(5(5(3(1(3(4(1(4(4(4(1(x1))))))))))))))) 4(1(5(0(3(4(0(3(2(5(5(0(4(0(0(3(x1)))))))))))))))) -> 2(1(3(3(4(2(1(4(3(0(0(0(1(2(3(x1))))))))))))))) 1(4(1(2(3(5(3(0(0(5(3(4(2(2(2(5(2(1(x1)))))))))))))))))) -> 1(5(4(4(3(4(1(0(3(4(5(0(0(5(5(1(2(5(x1)))))))))))))))))) 2(1(5(4(3(5(0(1(2(1(4(5(0(1(2(2(3(4(x1)))))))))))))))))) -> 0(0(0(0(4(5(2(0(2(0(1(2(5(1(5(2(1(4(x1)))))))))))))))))) 4(2(5(0(2(3(3(2(1(4(0(2(4(0(2(5(3(4(x1)))))))))))))))))) -> 4(0(2(4(5(2(2(1(0(2(3(0(5(1(4(5(2(4(x1)))))))))))))))))) 0(4(4(2(5(4(5(0(3(5(3(4(3(1(4(1(2(1(0(x1))))))))))))))))))) -> 3(0(4(0(2(0(5(3(2(5(3(4(4(3(4(4(3(4(x1)))))))))))))))))) 4(5(2(1(1(3(3(5(4(4(4(4(3(3(4(0(2(1(4(2(2(x1))))))))))))))))))))) -> 2(1(4(3(1(3(1(1(1(2(3(4(3(4(4(2(3(0(2(1(x1)))))))))))))))))))) Proof: String Reversal Processor: 2(2(1(0(x1)))) -> 2(3(3(x1))) 2(0(1(1(4(x1))))) -> 0(2(3(0(x1)))) 5(4(3(5(4(x1))))) -> 5(1(3(2(x1)))) 0(2(2(5(0(0(x1)))))) -> 2(3(0(5(3(x1))))) 3(0(2(1(0(2(x1)))))) -> 3(2(3(5(2(x1))))) 0(1(4(0(4(5(1(5(0(x1))))))))) -> 5(5(2(1(1(2(4(2(x1)))))))) 3(4(1(5(0(0(3(4(1(x1))))))))) -> 3(4(2(2(5(2(4(5(x1)))))))) 3(4(4(0(0(4(3(2(5(2(x1)))))))))) -> 3(2(2(1(2(5(3(0(3(x1))))))))) 2(4(2(4(4(2(3(1(2(4(x1)))))))))) -> 2(2(4(3(1(4(3(3(0(3(x1)))))))))) 2(0(4(3(0(2(0(4(5(1(1(x1))))))))))) -> 1(0(3(0(0(2(2(4(0(5(1(x1))))))))))) 4(3(1(1(2(2(4(4(1(3(3(x1))))))))))) -> 3(2(1(4(5(5(5(3(3(3(x1)))))))))) 1(0(0(0(2(1(3(0(2(4(4(x1))))))))))) -> 1(0(5(1(1(3(3(0(0(4(x1)))))))))) 3(0(3(0(3(1(1(3(4(4(4(x1))))))))))) -> 3(0(3(5(3(4(4(3(4(1(x1)))))))))) 3(5(0(1(3(5(0(4(0(5(4(2(4(x1))))))))))))) -> 4(5(5(5(0(3(0(5(5(4(0(4(x1)))))))))))) 2(2(4(5(5(1(2(0(3(0(4(5(4(x1))))))))))))) -> 3(3(2(1(0(4(0(0(2(1(0(0(1(2(x1)))))))))))))) 0(0(4(4(5(1(3(5(0(1(5(1(1(1(x1)))))))))))))) -> 5(4(2(4(0(5(0(4(0(4(4(2(5(5(x1)))))))))))))) 3(0(0(4(4(3(4(3(4(2(5(0(0(4(x1)))))))))))))) -> 3(5(2(5(0(4(2(1(0(4(3(0(3(x1))))))))))))) 2(3(4(2(4(4(0(3(1(1(0(5(2(5(x1)))))))))))))) -> 3(1(5(2(2(1(5(2(1(0(2(3(5(x1))))))))))))) 2(0(4(5(4(4(4(0(4(3(3(5(1(0(4(x1))))))))))))))) -> 1(4(4(4(1(4(3(1(3(5(5(1(0(4(4(x1))))))))))))))) 3(0(0(4(0(5(5(2(3(0(4(3(0(5(1(4(x1)))))))))))))))) -> 3(2(1(0(0(0(3(4(1(2(4(3(3(1(2(x1))))))))))))))) 1(2(5(2(2(2(4(3(5(0(0(3(5(3(2(1(4(1(x1)))))))))))))))))) -> 5(2(1(5(5(0(0(5(4(3(0(1(4(3(4(4(5(1(x1)))))))))))))))))) 4(3(2(2(1(0(5(4(1(2(1(0(5(3(4(5(1(2(x1)))))))))))))))))) -> 4(1(2(5(1(5(2(1(0(2(0(2(5(4(0(0(0(0(x1)))))))))))))))))) 4(3(5(2(0(4(2(0(4(1(2(3(3(2(0(5(2(4(x1)))))))))))))))))) -> 4(2(5(4(1(5(0(3(2(0(1(2(2(5(4(2(0(4(x1)))))))))))))))))) 0(1(2(1(4(1(3(4(3(5(3(0(5(4(5(2(4(4(0(x1))))))))))))))))))) -> 4(3(4(4(3(4(4(3(5(2(3(5(0(2(0(4(0(3(x1)))))))))))))))))) 2(2(4(1(2(0(4(3(3(4(4(4(4(5(3(3(1(1(2(5(4(x1))))))))))))))))))))) -> 1(2(0(3(2(4(4(3(4(3(2(1(1(1(3(1(3(4(1(2(x1)))))))))))))))))))) Bounds Processor: bound: 0 enrichment: match automaton: final states: {239,223,207,190,174,161,147,135,125,112,99,89,80,70, 62,51,44,36,28,21,17,13,9,5,1} transitions: f60() -> 2* 20(55) -> 56* 20(252) -> 253* 20(50) -> 44* 20(30) -> 31* 20(25) -> 26* 20(197) -> 198* 20(172) -> 173* 20(142) -> 143* 20(132) -> 133* 20(122) -> 123* 20(72) -> 208* 20(42) -> 43* 20(32) -> 33* 20(229) -> 230* 20(22) -> 23* 20(214) -> 215* 20(7) -> 8*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685