details

property	value
status	complete
benchmark	PEANO-NAT_nosorts-noand.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	Mixed_C

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.58788 seconds
cpu usage	10.9642
user time	10.3611
system time	0.603171
max virtual memory	1.8279544E7
max residence set size	2036216.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given ETRS could not be shown: (0) ETRS (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (2) EDP (3) EDependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) EDP (6) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] (7) EDP (8) EUsableRulesReductionPairsProof [EQUIVALENT, 42 ms] (9) EDP (10) PisEmptyProof [EQUIVALENT, 0 ms] (11) YES (12) EDP (13) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] (14) EDP (15) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] (16) EDP (17) EDependencyGraphProof [EQUIVALENT, 0 ms] (18) TRUE (19) EDP (20) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] (21) EDP (22) EUsableRulesProof [EQUIVALENT, 0 ms] (23) EDP (24) EDP (25) EDP (26) EDP ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: 1 -> s_(0) 2 -> s_(s_(0)) 3 -> s_(s_(s_(0))) 4 -> s_(s_(s_(s_(0)))) 5 -> s_(s_(s_(s_(s_(0))))) 6 -> s_(s_(s_(s_(s_(s_(0)))))) 7 -> s_(s_(s_(s_(s_(s_(s_(0))))))) U11(tt, M, N) -> U12(tt, M, N) U12(tt, M, N) -> s_(_+_(N, _+_(M, _*_(N, M)))) U21(tt, M, N) -> U22(tt, M, N) U22(tt, M, N) -> s_(s_(_+_(N, M))) U31(tt, M, N) -> U32(tt, M, N) U32(tt, M, N) -> _>_(M, N) U41(tt, M, N) -> U42(tt, M, N) U42(tt, M, N) -> _>_(N, M) U51(tt, M, N) -> U52(tt, M, N) U52(tt, M, N) -> d(N, M) U61(tt, M', N') -> U62(tt, M', N') U62(tt, M', N') -> U63(equal(_>_(N', M'), true), M', N') U63(tt, M', N') -> gcd(d(N', M'), M') U71(tt, M', N) -> U72(tt, M', N) U72(tt, M', N) -> U73(equal(_>_(M', N), true)) U73(tt) -> 0 U81(tt, M', N) -> U82(tt, M', N) U82(tt, M', N) -> U83(equal(_>_(N, M'), true), M', N) U83(tt, M', N) -> s_(quot(d(N, M'), M')) _*_(N, 0) -> 0 _*_(s_(N), s_(M)) -> U11(tt, M, N) _+_(N, 0) -> N _+_(s_(N), s_(M)) -> U21(tt, M, N) _<_(N, M) -> U31(tt, M, N) _>_(0, M) -> false _>_(N', 0) -> true _>_(s_(N), s_(M)) -> U41(tt, M, N) d(0, N) -> N d(s_(N), s_(M)) -> U51(tt, M, N) equal(X, X) -> tt gcd(0, N) -> 0 gcd(N', M') -> U61(tt, M', N') gcd(N', N') -> N' p_(s_(N)) -> N quot(M', M') -> s_(0) quot(N, M') -> U71(tt, M', N) quot(N, M') -> U81(tt, M', N) The set E consists of the following equations: _*_(x, y) == _*_(y, x) _+_(x, y) == _+_(y, x) d(x, y) == d(y, x) gcd(x, y) == gcd(y, x) ---------------------------------------- (1) EquationalDependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,DA_STEIN] we result in the following initial EDP problem: popout

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

job log

popout

actions

all output return to TRS Equational