details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.94145607948 seconds
cpu usage	8.604327692
max memory	6.36772352E8

stage attributes

key	value
output-size	20779
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSToCSRProof [SOUND, 0 ms] (2) CSR (3) CSDependencyPairsProof [EQUIVALENT, 0 ms] (4) QCSDP (5) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QCSDP (8) QCSDPReductionPairProof [EQUIVALENT, 138 ms] (9) QCSDP (10) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (11) TRUE (12) QCSDP (13) QCSDPSubtermProof [EQUIVALENT, 0 ms] (14) QCSDP (15) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (16) TRUE (17) QCSDP (18) QCSDPSubtermProof [EQUIVALENT, 1 ms] (19) QCSDP (20) QCSDependencyGraphProof [EQUIVALENT, 0 ms] (21) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(U11(tt, N)) -> mark(N) active(U21(tt, M, N)) -> mark(s(plus(N, M))) active(U31(tt)) -> mark(0) active(U41(tt, M, N)) -> mark(plus(x(N, M), N)) active(and(tt, X)) -> mark(X) active(isNat(0)) -> mark(tt) active(isNat(plus(V1, V2))) -> mark(and(isNat(V1), isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(x(V1, V2))) -> mark(and(isNat(V1), isNat(V2))) active(plus(N, 0)) -> mark(U11(isNat(N), N)) active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N)) active(x(N, 0)) -> mark(U31(isNat(N))) active(x(N, s(M))) -> mark(U41(and(isNat(M), isNat(N)), M, N)) active(U11(X1, X2)) -> U11(active(X1), X2) active(U21(X1, X2, X3)) -> U21(active(X1), X2, X3) active(s(X)) -> s(active(X)) active(plus(X1, X2)) -> plus(active(X1), X2) active(plus(X1, X2)) -> plus(X1, active(X2)) active(U31(X)) -> U31(active(X)) active(U41(X1, X2, X3)) -> U41(active(X1), X2, X3) active(x(X1, X2)) -> x(active(X1), X2) active(x(X1, X2)) -> x(X1, active(X2)) active(and(X1, X2)) -> and(active(X1), X2) U11(mark(X1), X2) -> mark(U11(X1, X2)) U21(mark(X1), X2, X3) -> mark(U21(X1, X2, X3)) s(mark(X)) -> mark(s(X)) plus(mark(X1), X2) -> mark(plus(X1, X2)) plus(X1, mark(X2)) -> mark(plus(X1, X2)) U31(mark(X)) -> mark(U31(X)) U41(mark(X1), X2, X3) -> mark(U41(X1, X2, X3)) x(mark(X1), X2) -> mark(x(X1, X2)) x(X1, mark(X2)) -> mark(x(X1, X2)) and(mark(X1), X2) -> mark(and(X1, X2)) proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) proper(tt) -> ok(tt) proper(U21(X1, X2, X3)) -> U21(proper(X1), proper(X2), proper(X3)) proper(s(X)) -> s(proper(X)) proper(plus(X1, X2)) -> plus(proper(X1), proper(X2)) proper(U31(X)) -> U31(proper(X)) proper(0) -> ok(0) proper(U41(X1, X2, X3)) -> U41(proper(X1), proper(X2), proper(X3)) proper(x(X1, X2)) -> x(proper(X1), proper(X2)) proper(and(X1, X2)) -> and(proper(X1), proper(X2)) proper(isNat(X)) -> isNat(proper(X)) U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) U21(ok(X1), ok(X2), ok(X3)) -> ok(U21(X1, X2, X3)) s(ok(X)) -> ok(s(X)) plus(ok(X1), ok(X2)) -> ok(plus(X1, X2)) U31(ok(X)) -> ok(U31(X)) U41(ok(X1), ok(X2), ok(X3)) -> ok(U41(X1, X2, X3)) x(ok(X1), ok(X2)) -> ok(x(X1, X2)) and(ok(X1), ok(X2)) -> ok(and(X1, X2)) isNat(ok(X)) -> ok(isNat(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) popout

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

job log

popout

actions

all output return to TRS Innermost