details

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

run statistics

property	value
solver	AProVE21
configuration	standard
runtime (wallclock)	2.71003007889 seconds
cpu usage	7.40207732
max memory	5.21404416E8

stage attributes

key	value
output-size	7700
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) QTRSRRRProof [EQUIVALENT, 231 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 58 ms] (4) QTRS (5) QTRSRRRProof [EQUIVALENT, 0 ms] (6) QTRS (7) RisEmptyProof [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (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(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(plus(N, 0)) -> mark(U11(isNat(N), N)) active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N)) mark(U11(X1, X2)) -> active(U11(mark(X1), X2)) mark(tt) -> active(tt) mark(U21(X1, X2, X3)) -> active(U21(mark(X1), X2, X3)) mark(s(X)) -> active(s(mark(X))) mark(plus(X1, X2)) -> active(plus(mark(X1), mark(X2))) mark(and(X1, X2)) -> active(and(mark(X1), X2)) mark(isNat(X)) -> active(isNat(X)) mark(0) -> active(0) U11(mark(X1), X2) -> U11(X1, X2) U11(X1, mark(X2)) -> U11(X1, X2) U11(active(X1), X2) -> U11(X1, X2) U11(X1, active(X2)) -> U11(X1, X2) U21(mark(X1), X2, X3) -> U21(X1, X2, X3) U21(X1, mark(X2), X3) -> U21(X1, X2, X3) U21(X1, X2, mark(X3)) -> U21(X1, X2, X3) U21(active(X1), X2, X3) -> U21(X1, X2, X3) U21(X1, active(X2), X3) -> U21(X1, X2, X3) U21(X1, X2, active(X3)) -> U21(X1, X2, X3) s(mark(X)) -> s(X) s(active(X)) -> s(X) plus(mark(X1), X2) -> plus(X1, X2) plus(X1, mark(X2)) -> plus(X1, X2) plus(active(X1), X2) -> plus(X1, X2) plus(X1, active(X2)) -> plus(X1, X2) and(mark(X1), X2) -> and(X1, X2) and(X1, mark(X2)) -> and(X1, X2) and(active(X1), X2) -> and(X1, X2) and(X1, active(X2)) -> and(X1, X2) isNat(mark(X)) -> isNat(X) isNat(active(X)) -> isNat(X) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: active/1)YES( U11/2(YES,YES) tt/0) mark/1)YES( U21/3(YES,YES,YES) s/1(YES) plus/2(YES,YES) and/2(YES,YES) isNat/1(YES) 0/0) Quasi precedence: [tt, U21_3, plus_2, 0] > U11_2 [tt, U21_3, plus_2, 0] > [s_1, and_2, isNat_1] Status: U11_2: multiset status tt: multiset status U21_3: [3,2,1] s_1: multiset status plus_2: [1,2] and_2: multiset status isNat_1: multiset status popout

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

job log

popout

actions

all output return to TRS Standard