Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381717553
details
property
value
status
complete
benchmark
torpa2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n006.star.cs.uiowa.edu
space
Secret_05_SRS
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
29.5540230274 seconds
cpu usage
116.806427922
max memory
1.777180672E9
stage attributes
key
value
output-size
4513
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: b(a(b(x1))) -> a(b(a(x1))) b(b(a(x1))) -> b(b(b(x1))) Proof: String Reversal Processor: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) DP Processor: DPs: b#(a(b(x1))) -> a#(x1) b#(a(b(x1))) -> b#(a(x1)) b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) TRS: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) TDG Processor: DPs: b#(a(b(x1))) -> a#(x1) b#(a(b(x1))) -> b#(a(x1)) b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) TRS: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) graph: a#(b(b(x1))) -> b#(b(b(x1))) -> b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) -> b#(a(b(x1))) -> b#(a(x1)) a#(b(b(x1))) -> b#(b(b(x1))) -> b#(a(b(x1))) -> a#(x1) b#(a(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> b#(b(b(x1))) b#(a(b(x1))) -> a#(x1) -> a#(b(b(x1))) -> b#(b(b(x1))) b#(a(b(x1))) -> b#(a(x1)) -> b#(a(b(x1))) -> a#(b(a(x1))) b#(a(b(x1))) -> b#(a(x1)) -> b#(a(b(x1))) -> b#(a(x1)) b#(a(b(x1))) -> b#(a(x1)) -> b#(a(b(x1))) -> a#(x1) Arctic Interpretation Processor: dimension: 1 usable rules: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) interpretation: [a#](x0) = 1x0 + 0, [b#](x0) = 1x0 + 0, [a](x0) = 5x0, [b](x0) = 5x0 + 0 orientation: b#(a(b(x1))) = 11x1 + 6 >= 1x1 + 0 = a#(x1) b#(a(b(x1))) = 11x1 + 6 >= 6x1 + 0 = b#(a(x1)) b#(a(b(x1))) = 11x1 + 6 >= 11x1 + 1 = a#(b(a(x1))) a#(b(b(x1))) = 11x1 + 6 >= 11x1 + 6 = b#(b(b(x1))) b(a(b(x1))) = 15x1 + 10 >= 15x1 + 5 = a(b(a(x1))) a(b(b(x1))) = 15x1 + 10 >= 15x1 + 10 = b(b(b(x1))) problem: DPs: b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) TRS: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) Restore Modifier: DPs: b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) TRS: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) EDG Processor: DPs: b#(a(b(x1))) -> a#(b(a(x1))) a#(b(b(x1))) -> b#(b(b(x1))) TRS: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) graph: a#(b(b(x1))) -> b#(b(b(x1))) -> b#(a(b(x1))) -> a#(b(a(x1))) b#(a(b(x1))) -> a#(b(a(x1))) -> a#(b(b(x1))) -> b#(b(b(x1))) Arctic Interpretation Processor: dimension: 3 usable rules: b(a(b(x1))) -> a(b(a(x1))) a(b(b(x1))) -> b(b(b(x1))) interpretation: [a#](x0) = [-& 0 -&]x0 + [0],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685