Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718791
details
property
value
status
complete
benchmark
z120.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
22.3437850475 seconds
cpu usage
87.50174891
max memory
8.00903168E8
stage attributes
key
value
output-size
5968
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: c(c(c(a(x1)))) -> d(d(x1)) d(b(x1)) -> c(c(x1)) b(c(x1)) -> b(a(c(x1))) c(x1) -> a(a(x1)) d(x1) -> b(c(x1)) Proof: Matrix Interpretation Processor: dim=1 interpretation: [b](x0) = x0 + 2, [d](x0) = x0 + 6, [c](x0) = x0 + 4, [a](x0) = x0 orientation: c(c(c(a(x1)))) = x1 + 12 >= x1 + 12 = d(d(x1)) d(b(x1)) = x1 + 8 >= x1 + 8 = c(c(x1)) b(c(x1)) = x1 + 6 >= x1 + 6 = b(a(c(x1))) c(x1) = x1 + 4 >= x1 = a(a(x1)) d(x1) = x1 + 6 >= x1 + 6 = b(c(x1)) problem: c(c(c(a(x1)))) -> d(d(x1)) d(b(x1)) -> c(c(x1)) b(c(x1)) -> b(a(c(x1))) d(x1) -> b(c(x1)) String Reversal Processor: a(c(c(c(x1)))) -> d(d(x1)) b(d(x1)) -> c(c(x1)) c(b(x1)) -> c(a(b(x1))) d(x1) -> c(b(x1)) DP Processor: DPs: a#(c(c(c(x1)))) -> d#(x1) a#(c(c(c(x1)))) -> d#(d(x1)) b#(d(x1)) -> c#(x1) b#(d(x1)) -> c#(c(x1)) c#(b(x1)) -> a#(b(x1)) c#(b(x1)) -> c#(a(b(x1))) d#(x1) -> b#(x1) d#(x1) -> c#(b(x1)) TRS: a(c(c(c(x1)))) -> d(d(x1)) b(d(x1)) -> c(c(x1)) c(b(x1)) -> c(a(b(x1))) d(x1) -> c(b(x1)) TDG Processor: DPs: a#(c(c(c(x1)))) -> d#(x1) a#(c(c(c(x1)))) -> d#(d(x1)) b#(d(x1)) -> c#(x1) b#(d(x1)) -> c#(c(x1)) c#(b(x1)) -> a#(b(x1)) c#(b(x1)) -> c#(a(b(x1))) d#(x1) -> b#(x1) d#(x1) -> c#(b(x1)) TRS: a(c(c(c(x1)))) -> d(d(x1)) b(d(x1)) -> c(c(x1)) c(b(x1)) -> c(a(b(x1))) d(x1) -> c(b(x1)) graph: c#(b(x1)) -> c#(a(b(x1))) -> c#(b(x1)) -> c#(a(b(x1))) c#(b(x1)) -> c#(a(b(x1))) -> c#(b(x1)) -> a#(b(x1)) c#(b(x1)) -> a#(b(x1)) -> a#(c(c(c(x1)))) -> d#(d(x1)) c#(b(x1)) -> a#(b(x1)) -> a#(c(c(c(x1)))) -> d#(x1) b#(d(x1)) -> c#(c(x1)) -> c#(b(x1)) -> c#(a(b(x1))) b#(d(x1)) -> c#(c(x1)) -> c#(b(x1)) -> a#(b(x1)) b#(d(x1)) -> c#(x1) -> c#(b(x1)) -> c#(a(b(x1))) b#(d(x1)) -> c#(x1) -> c#(b(x1)) -> a#(b(x1)) d#(x1) -> c#(b(x1)) -> c#(b(x1)) -> c#(a(b(x1))) d#(x1) -> c#(b(x1)) -> c#(b(x1)) -> a#(b(x1)) d#(x1) -> b#(x1) -> b#(d(x1)) -> c#(c(x1)) d#(x1) -> b#(x1) -> b#(d(x1)) -> c#(x1) a#(c(c(c(x1)))) -> d#(d(x1)) -> d#(x1) -> c#(b(x1)) a#(c(c(c(x1)))) -> d#(d(x1)) -> d#(x1) -> b#(x1) a#(c(c(c(x1)))) -> d#(x1) -> d#(x1) -> c#(b(x1)) a#(c(c(c(x1)))) -> d#(x1) -> d#(x1) -> b#(x1) EDG Processor: DPs: a#(c(c(c(x1)))) -> d#(x1) a#(c(c(c(x1)))) -> d#(d(x1)) b#(d(x1)) -> c#(x1) b#(d(x1)) -> c#(c(x1)) c#(b(x1)) -> a#(b(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685