details

property	value
status	complete
benchmark	secr9.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n033.star.cs.uiowa.edu
space	Secret_06_SRS

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	14.8638961315 seconds
cpu usage	49.472645024
max memory	1.0753024E9

stage attributes

key	value
output-size	105651
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: a(c(x1)) -> c(b(c(c(a(x1))))) b(b(b(x1))) -> c(b(x1)) d(d(x1)) -> d(b(d(b(d(x1))))) a(a(x1)) -> a(d(a(x1))) a(b(x1)) -> c(c(a(x1))) c(c(x1)) -> c(b(c(b(c(x1))))) c(c(c(x1))) -> c(b(b(x1))) Proof: DP Processor: DPs: a#(c(x1)) -> a#(x1) a#(c(x1)) -> c#(a(x1)) a#(c(x1)) -> c#(c(a(x1))) a#(c(x1)) -> b#(c(c(a(x1)))) a#(c(x1)) -> c#(b(c(c(a(x1))))) b#(b(b(x1))) -> c#(b(x1)) d#(d(x1)) -> b#(d(x1)) d#(d(x1)) -> d#(b(d(x1))) d#(d(x1)) -> b#(d(b(d(x1)))) d#(d(x1)) -> d#(b(d(b(d(x1))))) a#(a(x1)) -> d#(a(x1)) a#(a(x1)) -> a#(d(a(x1))) a#(b(x1)) -> a#(x1) a#(b(x1)) -> c#(a(x1)) a#(b(x1)) -> c#(c(a(x1))) c#(c(x1)) -> b#(c(x1)) c#(c(x1)) -> c#(b(c(x1))) c#(c(x1)) -> b#(c(b(c(x1)))) c#(c(x1)) -> c#(b(c(b(c(x1))))) c#(c(c(x1))) -> b#(x1) c#(c(c(x1))) -> b#(b(x1)) c#(c(c(x1))) -> c#(b(b(x1))) TRS: a(c(x1)) -> c(b(c(c(a(x1))))) b(b(b(x1))) -> c(b(x1)) d(d(x1)) -> d(b(d(b(d(x1))))) a(a(x1)) -> a(d(a(x1))) a(b(x1)) -> c(c(a(x1))) c(c(x1)) -> c(b(c(b(c(x1))))) c(c(c(x1))) -> c(b(b(x1))) TDG Processor: DPs: a#(c(x1)) -> a#(x1) a#(c(x1)) -> c#(a(x1)) a#(c(x1)) -> c#(c(a(x1))) a#(c(x1)) -> b#(c(c(a(x1)))) a#(c(x1)) -> c#(b(c(c(a(x1))))) b#(b(b(x1))) -> c#(b(x1)) d#(d(x1)) -> b#(d(x1)) d#(d(x1)) -> d#(b(d(x1))) d#(d(x1)) -> b#(d(b(d(x1)))) d#(d(x1)) -> d#(b(d(b(d(x1))))) a#(a(x1)) -> d#(a(x1)) a#(a(x1)) -> a#(d(a(x1))) a#(b(x1)) -> a#(x1) a#(b(x1)) -> c#(a(x1)) a#(b(x1)) -> c#(c(a(x1))) c#(c(x1)) -> b#(c(x1)) c#(c(x1)) -> c#(b(c(x1))) c#(c(x1)) -> b#(c(b(c(x1)))) c#(c(x1)) -> c#(b(c(b(c(x1))))) c#(c(c(x1))) -> b#(x1) c#(c(c(x1))) -> b#(b(x1)) c#(c(c(x1))) -> c#(b(b(x1))) TRS: a(c(x1)) -> c(b(c(c(a(x1))))) b(b(b(x1))) -> c(b(x1)) d(d(x1)) -> d(b(d(b(d(x1))))) a(a(x1)) -> a(d(a(x1))) a(b(x1)) -> c(c(a(x1))) c(c(x1)) -> c(b(c(b(c(x1))))) c(c(c(x1))) -> c(b(b(x1))) graph: d#(d(x1)) -> d#(b(d(b(d(x1))))) -> d#(d(x1)) -> d#(b(d(b(d(x1))))) d#(d(x1)) -> d#(b(d(b(d(x1))))) -> d#(d(x1)) -> b#(d(b(d(x1)))) d#(d(x1)) -> d#(b(d(b(d(x1))))) -> d#(d(x1)) -> d#(b(d(x1))) d#(d(x1)) -> d#(b(d(b(d(x1))))) -> d#(d(x1)) -> b#(d(x1)) d#(d(x1)) -> d#(b(d(x1))) -> d#(d(x1)) -> d#(b(d(b(d(x1))))) d#(d(x1)) -> d#(b(d(x1))) -> d#(d(x1)) -> b#(d(b(d(x1)))) d#(d(x1)) -> d#(b(d(x1))) -> d#(d(x1)) -> d#(b(d(x1))) d#(d(x1)) -> d#(b(d(x1))) -> d#(d(x1)) -> b#(d(x1)) d#(d(x1)) -> b#(d(b(d(x1)))) -> b#(b(b(x1))) -> c#(b(x1)) d#(d(x1)) -> b#(d(x1)) -> b#(b(b(x1))) -> c#(b(x1)) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(c(x1))) -> c#(b(b(x1))) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(c(x1))) -> b#(b(x1)) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(c(x1))) -> b#(x1) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(x1)) -> c#(b(c(b(c(x1))))) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(x1)) -> b#(c(b(c(x1)))) b#(b(b(x1))) -> c#(b(x1)) -> c#(c(x1)) -> c#(b(c(x1))) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to SRS Standard