details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	1.64981102943 seconds
cpu usage	5.009463631
max memory	6.81730048E8

stage attributes

key	value
output-size	9169
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: min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) minus(x,0()) -> x minus(s(x),s(y)) -> s(minus(x,any(y))) gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,y)),s(min(x,y))) any(s(x)) -> s(s(any(x))) any(x) -> x Proof: DP Processor: DPs: min#(s(x),s(y)) -> min#(x,y) max#(s(x),s(y)) -> max#(x,y) minus#(s(x),s(y)) -> any#(y) minus#(s(x),s(y)) -> minus#(x,any(y)) gcd#(s(x),s(y)) -> min#(x,y) gcd#(s(x),s(y)) -> max#(x,y) gcd#(s(x),s(y)) -> minus#(max(x,y),min(x,y)) gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) any#(s(x)) -> any#(x) TRS: min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) minus(x,0()) -> x minus(s(x),s(y)) -> s(minus(x,any(y))) gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,y)),s(min(x,y))) any(s(x)) -> s(s(any(x))) any(x) -> x TDG Processor: DPs: min#(s(x),s(y)) -> min#(x,y) max#(s(x),s(y)) -> max#(x,y) minus#(s(x),s(y)) -> any#(y) minus#(s(x),s(y)) -> minus#(x,any(y)) gcd#(s(x),s(y)) -> min#(x,y) gcd#(s(x),s(y)) -> max#(x,y) gcd#(s(x),s(y)) -> minus#(max(x,y),min(x,y)) gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) any#(s(x)) -> any#(x) TRS: min(x,0()) -> 0() min(0(),y) -> 0() min(s(x),s(y)) -> s(min(x,y)) max(x,0()) -> x max(0(),y) -> y max(s(x),s(y)) -> s(max(x,y)) minus(x,0()) -> x minus(s(x),s(y)) -> s(minus(x,any(y))) gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,y)),s(min(x,y))) any(s(x)) -> s(s(any(x))) any(x) -> x graph: gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) -> gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) -> gcd#(s(x),s(y)) -> minus#(max(x,y),min(x,y)) gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) -> gcd#(s(x),s(y)) -> max#(x,y) gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) -> gcd#(s(x),s(y)) -> min#(x,y) gcd#(s(x),s(y)) -> minus#(max(x,y),min(x,y)) -> minus#(s(x),s(y)) -> minus#(x,any(y)) gcd#(s(x),s(y)) -> minus#(max(x,y),min(x,y)) -> minus#(s(x),s(y)) -> any#(y) gcd#(s(x),s(y)) -> max#(x,y) -> max#(s(x),s(y)) -> max#(x,y) gcd#(s(x),s(y)) -> min#(x,y) -> min#(s(x),s(y)) -> min#(x,y) any#(s(x)) -> any#(x) -> any#(s(x)) -> any#(x) minus#(s(x),s(y)) -> any#(y) -> any#(s(x)) -> any#(x) minus#(s(x),s(y)) -> minus#(x,any(y)) -> minus#(s(x),s(y)) -> minus#(x,any(y)) minus#(s(x),s(y)) -> minus#(x,any(y)) -> minus#(s(x),s(y)) -> any#(y) max#(s(x),s(y)) -> max#(x,y) -> max#(s(x),s(y)) -> max#(x,y) min#(s(x),s(y)) -> min#(x,y) -> min#(s(x),s(y)) -> min#(x,y) SCC Processor: #sccs: 5 #rules: 5 #arcs: 14/81 DPs: gcd#(s(x),s(y)) -> gcd#(minus(max(x,y),min(x,y)),s(min(x,y))) TRS: min(x,0()) -> 0() min(0(),y) -> 0() popout

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

job log

popout

actions

all output return to TRS Stand 20472