details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.9421 seconds
cpu usage	42.5515
user time	41.3931
system time	1.15844
max virtual memory	1.8654756E7
max residence set size	2910048.0

stage attributes

key	value
starexec-result	YES

output

42.11/12.83 YES 42.39/12.85 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 42.39/12.85 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 42.39/12.85 42.39/12.85 42.39/12.85 Termination w.r.t. Q of the given QTRS could be proven: 42.39/12.85 42.39/12.85 (0) QTRS 42.39/12.85 (1) DependencyPairsProof [EQUIVALENT, 239 ms] 42.39/12.85 (2) QDP 42.39/12.85 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 42.39/12.85 (4) AND 42.39/12.85 (5) QDP 42.39/12.85 (6) UsableRulesProof [EQUIVALENT, 0 ms] 42.39/12.85 (7) QDP 42.39/12.85 (8) QReductionProof [EQUIVALENT, 0 ms] 42.39/12.85 (9) QDP 42.39/12.85 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 42.39/12.85 (11) YES 42.39/12.85 (12) QDP 42.39/12.85 (13) UsableRulesProof [EQUIVALENT, 0 ms] 42.39/12.85 (14) QDP 42.39/12.85 (15) QReductionProof [EQUIVALENT, 0 ms] 42.39/12.85 (16) QDP 42.39/12.85 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 42.39/12.85 (18) YES 42.39/12.85 (19) QDP 42.39/12.85 (20) QDPOrderProof [EQUIVALENT, 6374 ms] 42.39/12.85 (21) QDP 42.39/12.85 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 42.39/12.85 (23) QDP 42.39/12.85 (24) UsableRulesProof [EQUIVALENT, 0 ms] 42.39/12.85 (25) QDP 42.39/12.85 (26) QReductionProof [EQUIVALENT, 0 ms] 42.39/12.85 (27) QDP 42.39/12.85 (28) QDPSizeChangeProof [EQUIVALENT, 0 ms] 42.39/12.85 (29) YES 42.39/12.85 42.39/12.85 42.39/12.85 ---------------------------------------- 42.39/12.85 42.39/12.85 (0) 42.39/12.85 Obligation: 42.39/12.85 Q restricted rewrite system: 42.39/12.85 The TRS R consists of the following rules: 42.39/12.85 42.39/12.85 a__U101(tt, M, N) -> a__U102(a__isNatKind(M), M, N) 42.39/12.85 a__U102(tt, M, N) -> a__U103(a__isNat(N), M, N) 42.39/12.85 a__U103(tt, M, N) -> a__U104(a__isNatKind(N), M, N) 42.39/12.85 a__U104(tt, M, N) -> a__plus(a__x(mark(N), mark(M)), mark(N)) 42.39/12.85 a__U11(tt, V1, V2) -> a__U12(a__isNatKind(V1), V1, V2) 42.39/12.85 a__U12(tt, V1, V2) -> a__U13(a__isNatKind(V2), V1, V2) 42.39/12.85 a__U13(tt, V1, V2) -> a__U14(a__isNatKind(V2), V1, V2) 42.39/12.85 a__U14(tt, V1, V2) -> a__U15(a__isNat(V1), V2) 42.39/12.85 a__U15(tt, V2) -> a__U16(a__isNat(V2)) 42.39/12.85 a__U16(tt) -> tt 42.39/12.85 a__U21(tt, V1) -> a__U22(a__isNatKind(V1), V1) 42.39/12.85 a__U22(tt, V1) -> a__U23(a__isNat(V1)) 42.39/12.85 a__U23(tt) -> tt 42.39/12.85 a__U31(tt, V1, V2) -> a__U32(a__isNatKind(V1), V1, V2) 42.39/12.85 a__U32(tt, V1, V2) -> a__U33(a__isNatKind(V2), V1, V2) 42.39/12.85 a__U33(tt, V1, V2) -> a__U34(a__isNatKind(V2), V1, V2) 42.39/12.85 a__U34(tt, V1, V2) -> a__U35(a__isNat(V1), V2) 42.39/12.85 a__U35(tt, V2) -> a__U36(a__isNat(V2)) 42.39/12.85 a__U36(tt) -> tt 42.39/12.85 a__U41(tt, V2) -> a__U42(a__isNatKind(V2)) 42.39/12.85 a__U42(tt) -> tt 42.39/12.85 a__U51(tt) -> tt 42.39/12.85 a__U61(tt, V2) -> a__U62(a__isNatKind(V2)) 42.39/12.85 a__U62(tt) -> tt 42.39/12.85 a__U71(tt, N) -> a__U72(a__isNatKind(N), N) 42.39/12.85 a__U72(tt, N) -> mark(N) 42.39/12.85 a__U81(tt, M, N) -> a__U82(a__isNatKind(M), M, N) 42.39/12.85 a__U82(tt, M, N) -> a__U83(a__isNat(N), M, N) 42.39/12.85 a__U83(tt, M, N) -> a__U84(a__isNatKind(N), M, N) 42.39/12.85 a__U84(tt, M, N) -> s(a__plus(mark(N), mark(M))) 42.39/12.85 a__U91(tt, N) -> a__U92(a__isNatKind(N)) 42.39/12.85 a__U92(tt) -> 0 42.39/12.85 a__isNat(0) -> tt 42.39/12.85 a__isNat(plus(V1, V2)) -> a__U11(a__isNatKind(V1), V1, V2) 42.39/12.85 a__isNat(s(V1)) -> a__U21(a__isNatKind(V1), V1) 42.39/12.85 a__isNat(x(V1, V2)) -> a__U31(a__isNatKind(V1), V1, V2) 42.39/12.85 a__isNatKind(0) -> tt 42.39/12.85 a__isNatKind(plus(V1, V2)) -> a__U41(a__isNatKind(V1), V2) 42.39/12.85 a__isNatKind(s(V1)) -> a__U51(a__isNatKind(V1)) 42.39/12.85 a__isNatKind(x(V1, V2)) -> a__U61(a__isNatKind(V1), V2) 42.39/12.85 a__plus(N, 0) -> a__U71(a__isNat(N), N) 42.39/12.85 a__plus(N, s(M)) -> a__U81(a__isNat(M), M, N) 42.39/12.85 a__x(N, 0) -> a__U91(a__isNat(N), N) 42.39/12.85 a__x(N, s(M)) -> a__U101(a__isNat(M), M, N) 42.39/12.85 mark(U101(X1, X2, X3)) -> a__U101(mark(X1), X2, X3) 42.39/12.85 mark(U102(X1, X2, X3)) -> a__U102(mark(X1), X2, X3) 42.39/12.85 mark(isNatKind(X)) -> a__isNatKind(X) 42.39/12.85 mark(U103(X1, X2, X3)) -> a__U103(mark(X1), X2, X3) 42.39/12.85 mark(isNat(X)) -> a__isNat(X) 42.39/12.85 mark(U104(X1, X2, X3)) -> a__U104(mark(X1), X2, X3) 42.39/12.85 mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) 42.39/12.85 mark(x(X1, X2)) -> a__x(mark(X1), mark(X2)) 42.39/12.85 mark(U11(X1, X2, X3)) -> a__U11(mark(X1), X2, X3) 42.39/12.85 mark(U12(X1, X2, X3)) -> a__U12(mark(X1), X2, X3) popout

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

job log

popout

actions

all output return to TRS_Innermost 2019-03-28 22.12