details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.65759301186 seconds
cpu usage	3.700963137
max memory	2.33680896E8

stage attributes

key	value
output-size	9208
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSRRRRProof [EQUIVALENT, 63 ms] (4) CSR (5) CSRRRRProof [EQUIVALENT, 0 ms] (6) CSR (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(and(true, X)) -> mark(X) active(and(false, Y)) -> mark(false) active(if(true, X, Y)) -> mark(X) active(if(false, X, Y)) -> mark(Y) active(add(0, X)) -> mark(X) active(add(s(X), Y)) -> mark(s(add(X, Y))) active(first(0, X)) -> mark(nil) active(first(s(X), cons(Y, Z))) -> mark(cons(Y, first(X, Z))) active(from(X)) -> mark(cons(X, from(s(X)))) active(and(X1, X2)) -> and(active(X1), X2) active(if(X1, X2, X3)) -> if(active(X1), X2, X3) active(add(X1, X2)) -> add(active(X1), X2) active(first(X1, X2)) -> first(active(X1), X2) active(first(X1, X2)) -> first(X1, active(X2)) and(mark(X1), X2) -> mark(and(X1, X2)) if(mark(X1), X2, X3) -> mark(if(X1, X2, X3)) add(mark(X1), X2) -> mark(add(X1, X2)) first(mark(X1), X2) -> mark(first(X1, X2)) first(X1, mark(X2)) -> mark(first(X1, X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(true) -> ok(true) proper(false) -> ok(false) proper(if(X1, X2, X3)) -> if(proper(X1), proper(X2), proper(X3)) proper(add(X1, X2)) -> add(proper(X1), proper(X2)) proper(0) -> ok(0) proper(s(X)) -> s(proper(X)) proper(first(X1, X2)) -> first(proper(X1), proper(X2)) proper(nil) -> ok(nil) proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) proper(from(X)) -> from(proper(X)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) if(ok(X1), ok(X2), ok(X3)) -> ok(if(X1, X2, X3)) add(ok(X1), ok(X2)) -> ok(add(X1, X2)) s(ok(X)) -> ok(s(X)) first(ok(X1), ok(X2)) -> ok(first(X1, X2)) cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) from(ok(X)) -> ok(from(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) The set Q consists of the following terms: active(from(x0)) active(and(x0, x1)) active(if(x0, x1, x2)) active(add(x0, x1)) active(first(x0, x1)) and(mark(x0), x1) if(mark(x0), x1, x2) add(mark(x0), x1) first(mark(x0), x1) first(x0, mark(x1)) proper(and(x0, x1)) proper(true) proper(false) proper(if(x0, x1, x2)) proper(add(x0, x1)) proper(0) proper(s(x0)) proper(first(x0, x1)) proper(nil) proper(cons(x0, x1)) proper(from(x0)) and(ok(x0), ok(x1)) if(ok(x0), ok(x1), ok(x2)) add(ok(x0), ok(x1)) s(ok(x0)) first(ok(x0), ok(x1)) cons(ok(x0), ok(x1)) popout

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

job log

popout

actions

all output return to TRS Innermost