Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713674
details
property
value
status
complete
benchmark
4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n113.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.7229449749 seconds
cpu usage
5.596359717
max memory
6.67070464E8
stage attributes
key
value
output-size
4270
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: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) Proof: DP Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) TDG Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) graph: a#(0(),x) -> c#(c(x)) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(c(x)) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) -> c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(x) c#(c(x)) -> c#(b(c(x))) -> c#(c(x)) -> c#(b(c(x))) c#(c(x)) -> c#(b(c(x))) -> c#(c(b(c(x)))) -> a#(0(),c(x)) EDG Processor: DPs: c#(c(b(c(x)))) -> a#(0(),c(x)) c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) a#(0(),x) -> c#(c(x)) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) graph: a#(0(),x) -> c#(c(x)) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(c(x)) -> c#(c(x)) -> c#(b(c(x))) a#(0(),x) -> c#(x) -> c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) -> c#(c(x)) -> c#(b(c(x))) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(x) c#(c(b(c(x)))) -> a#(0(),c(x)) -> a#(0(),x) -> c#(c(x)) SCC Processor: #sccs: 1 #rules: 3 #arcs: 6/16 DPs: a#(0(),x) -> c#(c(x)) c#(c(b(c(x)))) -> a#(0(),c(x)) a#(0(),x) -> c#(x) TRS: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) Arctic Interpretation Processor: dimension: 1 usable rules: c(c(b(c(x)))) -> b(a(0(),c(x))) c(c(x)) -> b(c(b(c(x)))) a(0(),x) -> c(c(x)) interpretation: [a#](x0, x1) = x0 + 1x1 + -16, [c#](x0) = x0 + -16, [a](x0, x1) = x0 + 2x1 + -16, [0] = 0, [b](x0) = x0 + -16, [c](x0) = 1x0 + -1 orientation: a#(0(),x) = 1x + 0 >= 1x + -1 = c#(c(x)) c#(c(b(c(x)))) = 2x + 0 >= 2x + 0 = a#(0(),c(x)) a#(0(),x) = 1x + 0 >= x + -16 = c#(x) c(c(b(c(x)))) = 3x + 1 >= 3x + 1 = b(a(0(),c(x))) c(c(x)) = 2x + 0 >= 2x + 0 = b(c(b(c(x))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472