details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	30.8605048656 seconds
cpu usage	105.413696446
max memory	2.3207936E9

stage attributes

key	value
output-size	95426
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- failure 'Failure("No result of SMT solver - maybe due to some flag of the solver? or the solver was not found in PATH?")' in subprocess 39161 YES Problem: active(eq(0(),0())) -> mark(true()) active(eq(s(X),s(Y))) -> mark(eq(X,Y)) active(eq(X,Y)) -> mark(false()) active(inf(X)) -> mark(cons(X,inf(s(X)))) active(take(0(),X)) -> mark(nil()) active(take(s(X),cons(Y,L))) -> mark(cons(Y,take(X,L))) active(length(nil())) -> mark(0()) active(length(cons(X,L))) -> mark(s(length(L))) active(inf(X)) -> inf(active(X)) active(take(X1,X2)) -> take(active(X1),X2) active(take(X1,X2)) -> take(X1,active(X2)) active(length(X)) -> length(active(X)) inf(mark(X)) -> mark(inf(X)) take(mark(X1),X2) -> mark(take(X1,X2)) take(X1,mark(X2)) -> mark(take(X1,X2)) length(mark(X)) -> mark(length(X)) proper(eq(X1,X2)) -> eq(proper(X1),proper(X2)) proper(0()) -> ok(0()) proper(true()) -> ok(true()) proper(s(X)) -> s(proper(X)) proper(false()) -> ok(false()) proper(inf(X)) -> inf(proper(X)) proper(cons(any(X1),X2)) -> cons(any(any(proper(X1))),any(proper(X2))) proper(take(X1,X2)) -> take(proper(X1),proper(X2)) proper(nil()) -> ok(nil()) proper(length(X)) -> length(proper(X)) eq(ok(X1),ok(X2)) -> ok(eq(X1,X2)) s(ok(X)) -> ok(s(X)) inf(ok(X)) -> ok(inf(X)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) take(ok(X1),ok(X2)) -> ok(take(X1,X2)) length(ok(X)) -> ok(length(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) any(X) -> s(X) any(proper(X)) -> any(any(any(X))) Proof: DP Processor: DPs: active#(eq(s(X),s(Y))) -> eq#(X,Y) active#(inf(X)) -> s#(X) active#(inf(X)) -> inf#(s(X)) active#(inf(X)) -> cons#(X,inf(s(X))) active#(take(s(X),cons(Y,L))) -> take#(X,L) active#(take(s(X),cons(Y,L))) -> cons#(Y,take(X,L)) active#(length(cons(X,L))) -> length#(L) active#(length(cons(X,L))) -> s#(length(L)) active#(inf(X)) -> active#(X) active#(inf(X)) -> inf#(active(X)) active#(take(X1,X2)) -> active#(X1) active#(take(X1,X2)) -> take#(active(X1),X2) active#(take(X1,X2)) -> active#(X2) active#(take(X1,X2)) -> take#(X1,active(X2)) active#(length(X)) -> active#(X) active#(length(X)) -> length#(active(X)) inf#(mark(X)) -> inf#(X) take#(mark(X1),X2) -> take#(X1,X2) take#(X1,mark(X2)) -> take#(X1,X2) length#(mark(X)) -> length#(X) proper#(eq(X1,X2)) -> proper#(X2) proper#(eq(X1,X2)) -> proper#(X1) proper#(eq(X1,X2)) -> eq#(proper(X1),proper(X2)) proper#(s(X)) -> proper#(X) proper#(s(X)) -> s#(proper(X)) proper#(inf(X)) -> proper#(X) proper#(inf(X)) -> inf#(proper(X)) proper#(cons(any(X1),X2)) -> proper#(X2) proper#(cons(any(X1),X2)) -> any#(proper(X2)) proper#(cons(any(X1),X2)) -> proper#(X1) proper#(cons(any(X1),X2)) -> any#(proper(X1)) proper#(cons(any(X1),X2)) -> any#(any(proper(X1))) proper#(cons(any(X1),X2)) -> cons#(any(any(proper(X1))),any(proper(X2))) proper#(take(X1,X2)) -> proper#(X2) proper#(take(X1,X2)) -> proper#(X1) proper#(take(X1,X2)) -> take#(proper(X1),proper(X2)) proper#(length(X)) -> proper#(X) proper#(length(X)) -> length#(proper(X)) eq#(ok(X1),ok(X2)) -> eq#(X1,X2) s#(ok(X)) -> s#(X) inf#(ok(X)) -> inf#(X) cons#(ok(X1),ok(X2)) -> cons#(X1,X2) take#(ok(X1),ok(X2)) -> take#(X1,X2) length#(ok(X)) -> length#(X) top#(mark(X)) -> proper#(X) top#(mark(X)) -> top#(proper(X)) top#(ok(X)) -> active#(X) top#(ok(X)) -> top#(active(X)) any#(X) -> s#(X) any#(proper(X)) -> any#(X) popout

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

job log

popout

actions

all output return to TRS Standard