details

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

run statistics

property	value
solver	AProVE23
configuration	standard
runtime (wallclock)	2.16746902466 seconds
cpu usage	5.926490423
max memory	3.17841408E8

stage attributes

key	value
output-size	7919
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: 363435ff5b19173ec8a83b45cfdec073678dabcc jan-christoph 20230815 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 403 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 3 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: U11(tt, V1, V2) -> U12(isNat(activate(V1)), activate(V2)) U12(tt, V2) -> U13(isNat(activate(V2))) U13(tt) -> tt U21(tt, V1) -> U22(isNat(activate(V1))) U22(tt) -> tt U31(tt, V1, V2) -> U32(isNat(activate(V1)), activate(V2)) U32(tt, V2) -> U33(isNat(activate(V2))) U33(tt) -> tt U41(tt, N) -> activate(N) U51(tt, M, N) -> s(plus(activate(N), activate(M))) U61(tt) -> 0 U71(tt, M, N) -> plus(x(activate(N), activate(M)), activate(N)) and(tt, X) -> activate(X) isNat(n__0) -> tt isNat(n__plus(V1, V2)) -> U11(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), activate(V1), activate(V2)) isNat(n__s(V1)) -> U21(isNatKind(activate(V1)), activate(V1)) isNat(n__x(V1, V2)) -> U31(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), activate(V1), activate(V2)) isNatKind(n__0) -> tt isNatKind(n__plus(V1, V2)) -> and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) isNatKind(n__s(V1)) -> isNatKind(activate(V1)) isNatKind(n__x(V1, V2)) -> and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) plus(N, 0) -> U41(and(isNat(N), n__isNatKind(N)), N) plus(N, s(M)) -> U51(and(and(isNat(M), n__isNatKind(M)), n__and(n__isNat(N), n__isNatKind(N))), M, N) x(N, 0) -> U61(and(isNat(N), n__isNatKind(N))) x(N, s(M)) -> U71(and(and(isNat(M), n__isNatKind(M)), n__and(n__isNat(N), n__isNatKind(N))), M, N) 0 -> n__0 plus(X1, X2) -> n__plus(X1, X2) isNatKind(X) -> n__isNatKind(X) s(X) -> n__s(X) x(X1, X2) -> n__x(X1, X2) and(X1, X2) -> n__and(X1, X2) isNat(X) -> n__isNat(X) activate(n__0) -> 0 activate(n__plus(X1, X2)) -> plus(activate(X1), activate(X2)) activate(n__isNatKind(X)) -> isNatKind(X) activate(n__s(X)) -> s(activate(X)) activate(n__x(X1, X2)) -> x(activate(X1), activate(X2)) activate(n__and(X1, X2)) -> and(activate(X1), X2) activate(n__isNat(X)) -> isNat(X) activate(X) -> X Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: U11/3(YES,YES,YES) tt/0) U12/2(YES,YES) isNat/1)YES( activate/1)YES( U13/1(YES) U21/2(YES,YES) U22/1)YES( U31/3(YES,YES,YES) U32/2(YES,YES) U33/1(YES) U41/2(YES,YES) U51/3(YES,YES,YES) s/1(YES) plus/2(YES,YES) U61/1(YES) 0/0) U71/3(YES,YES,YES) x/2(YES,YES) and/2(YES,YES) n__0/0) n__plus/2(YES,YES) isNatKind/1)YES( n__isNatKind/1)YES( popout

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

job log

popout

actions

all output return to TRS Standard