details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.09718 seconds
cpu usage	4.5801
user time	4.40951
system time	0.170591
max virtual memory	1.8408888E7
max residence set size	260100.0

stage attributes

key	value
starexec-result	YES

output

4.50/2.06 YES 4.50/2.07 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 4.50/2.07 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.50/2.07 4.50/2.07 4.50/2.07 Termination of the given ETRS could be proven: 4.50/2.07 4.50/2.07 (0) ETRS 4.50/2.07 (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] 4.50/2.07 (2) EDP 4.50/2.07 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 4.50/2.07 (4) EDP 4.50/2.07 (5) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 4.50/2.07 (6) EDP 4.50/2.07 (7) EDPProblemToQDPProblemProof [EQUIVALENT, 0 ms] 4.50/2.07 (8) QDP 4.50/2.07 (9) MNOCProof [EQUIVALENT, 0 ms] 4.50/2.07 (10) QDP 4.50/2.07 (11) MRRProof [EQUIVALENT, 0 ms] 4.50/2.07 (12) QDP 4.50/2.07 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 4.50/2.07 (14) TRUE 4.50/2.07 4.50/2.07 4.50/2.07 ---------------------------------------- 4.50/2.07 4.50/2.07 (0) 4.50/2.07 Obligation: 4.50/2.07 Equational rewrite system: 4.50/2.07 The TRS R consists of the following rules: 4.50/2.07 4.50/2.07 p(s(x)) -> x 4.50/2.07 fac(0) -> s(0) 4.50/2.07 fac(s(x)) -> times(s(x), fac(p(s(x)))) 4.50/2.07 4.50/2.07 The set E consists of the following equations: 4.50/2.07 4.50/2.07 times(x, y) == times(y, x) 4.50/2.07 times(times(x, y), z) == times(x, times(y, z)) 4.50/2.07 4.50/2.07 4.50/2.07 ---------------------------------------- 4.50/2.07 4.50/2.07 (1) EquationalDependencyPairsProof (EQUIVALENT) 4.50/2.07 Using Dependency Pairs [AG00,DA_STEIN] we result in the following initial EDP problem: 4.50/2.07 The TRS P consists of the following rules: 4.50/2.07 4.50/2.07 FAC(s(x)) -> FAC(p(s(x))) 4.50/2.07 FAC(s(x)) -> P(s(x)) 4.50/2.07 4.50/2.07 The TRS R consists of the following rules: 4.50/2.07 4.50/2.07 p(s(x)) -> x 4.50/2.07 fac(0) -> s(0) 4.50/2.07 fac(s(x)) -> times(s(x), fac(p(s(x)))) 4.50/2.07 4.50/2.07 The set E consists of the following equations: 4.50/2.07 4.50/2.07 times(x, y) == times(y, x) 4.50/2.07 times(times(x, y), z) == times(x, times(y, z)) 4.50/2.07 4.50/2.07 E# is empty. 4.50/2.07 We have to consider all minimal (P,E#,R,E)-chains 4.50/2.07 4.50/2.07 ---------------------------------------- 4.50/2.07 4.50/2.07 (2) 4.50/2.07 Obligation: 4.50/2.07 The TRS P consists of the following rules: 4.50/2.07 4.50/2.07 FAC(s(x)) -> FAC(p(s(x))) 4.50/2.07 FAC(s(x)) -> P(s(x)) 4.50/2.07 4.50/2.07 The TRS R consists of the following rules: 4.50/2.07 4.50/2.07 p(s(x)) -> x 4.50/2.07 fac(0) -> s(0) 4.50/2.07 fac(s(x)) -> times(s(x), fac(p(s(x)))) 4.50/2.07 4.50/2.07 The set E consists of the following equations: 4.50/2.07 4.50/2.07 times(x, y) == times(y, x) 4.50/2.07 times(times(x, y), z) == times(x, times(y, z)) 4.50/2.07 4.50/2.07 E# is empty. 4.50/2.07 We have to consider all minimal (P,E#,R,E)-chains 4.50/2.07 ---------------------------------------- 4.50/2.07 4.50/2.07 (3) EDependencyGraphProof (EQUIVALENT) 4.50/2.07 The approximation of the Equational Dependency Graph [DA_STEIN] contains 1 SCC with 1 less node. 4.50/2.07 ---------------------------------------- 4.50/2.07 4.50/2.07 (4) 4.50/2.07 Obligation: 4.50/2.07 The TRS P consists of the following rules: 4.50/2.07 4.50/2.07 FAC(s(x)) -> FAC(p(s(x))) 4.50/2.07 4.50/2.07 The TRS R consists of the following rules: 4.50/2.07 popout

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

job log

popout

actions

all output return to TRS_Equational 2019-03-21 05.09