details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.00587 seconds
cpu usage	4.56343
user time	4.37891
system time	0.184522
max virtual memory	1.8284152E7
max residence set size	259376.0

stage attributes

key	value
starexec-result	YES

output

4.33/1.96 YES 4.33/1.97 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 4.33/1.97 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.33/1.97 4.33/1.97 4.33/1.97 Termination of the given ETRS could be proven: 4.33/1.97 4.33/1.97 (0) ETRS 4.33/1.97 (1) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] 4.33/1.97 (2) EDP 4.33/1.97 (3) EDependencyGraphProof [EQUIVALENT, 0 ms] 4.33/1.97 (4) AND 4.33/1.97 (5) EDP 4.33/1.97 (6) EUsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 4.33/1.97 (7) EDP 4.33/1.97 (8) PisEmptyProof [EQUIVALENT, 0 ms] 4.33/1.97 (9) YES 4.33/1.97 (10) EDP 4.33/1.97 (11) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 4.33/1.97 (12) EDP 4.33/1.97 (13) EDPPoloProof [EQUIVALENT, 0 ms] 4.33/1.97 (14) EDP 4.33/1.97 (15) PisEmptyProof [EQUIVALENT, 0 ms] 4.33/1.97 (16) YES 4.33/1.97 (17) EDP 4.33/1.97 (18) ESharpUsableEquationsProof [EQUIVALENT, 0 ms] 4.33/1.97 (19) EDP 4.33/1.97 (20) EDPPoloProof [EQUIVALENT, 0 ms] 4.33/1.97 (21) EDP 4.33/1.97 (22) PisEmptyProof [EQUIVALENT, 0 ms] 4.33/1.97 (23) YES 4.33/1.97 4.33/1.97 4.33/1.97 ---------------------------------------- 4.33/1.97 4.33/1.97 (0) 4.33/1.97 Obligation: 4.33/1.97 Equational rewrite system: 4.33/1.97 The TRS R consists of the following rules: 4.33/1.97 4.33/1.97 eq(0, 0) -> true 4.33/1.97 eq(0, s(x)) -> false 4.33/1.97 eq(s(x), 0) -> false 4.33/1.97 eq(s(x), s(y)) -> eq(x, y) 4.33/1.97 rm(n, nil) -> nil 4.33/1.97 rm(n, add(m, x)) -> if_rm(eq(n, m), n, add(m, x)) 4.33/1.97 if_rm(true, n, add(m, x)) -> rm(n, x) 4.33/1.97 if_rm(false, n, add(m, x)) -> add(m, rm(n, x)) 4.33/1.97 purge(nil) -> nil 4.33/1.97 purge(add(n, x)) -> add(n, purge(rm(n, x))) 4.33/1.97 4.33/1.97 The set E consists of the following equations: 4.33/1.97 4.33/1.97 eq(x, y) == eq(y, x) 4.33/1.97 4.33/1.97 4.33/1.97 ---------------------------------------- 4.33/1.97 4.33/1.97 (1) EquationalDependencyPairsProof (EQUIVALENT) 4.33/1.97 Using Dependency Pairs [AG00,DA_STEIN] we result in the following initial EDP problem: 4.33/1.97 The TRS P consists of the following rules: 4.33/1.97 4.33/1.97 EQ(s(x), s(y)) -> EQ(x, y) 4.33/1.97 RM(n, add(m, x)) -> IF_RM(eq(n, m), n, add(m, x)) 4.33/1.97 RM(n, add(m, x)) -> EQ(n, m) 4.33/1.97 IF_RM(true, n, add(m, x)) -> RM(n, x) 4.33/1.97 IF_RM(false, n, add(m, x)) -> RM(n, x) 4.33/1.97 PURGE(add(n, x)) -> PURGE(rm(n, x)) 4.33/1.97 PURGE(add(n, x)) -> RM(n, x) 4.33/1.97 4.33/1.97 The TRS R consists of the following rules: 4.33/1.97 4.33/1.97 eq(0, 0) -> true 4.33/1.97 eq(0, s(x)) -> false 4.33/1.97 eq(s(x), 0) -> false 4.33/1.97 eq(s(x), s(y)) -> eq(x, y) 4.33/1.97 rm(n, nil) -> nil 4.33/1.97 rm(n, add(m, x)) -> if_rm(eq(n, m), n, add(m, x)) 4.33/1.97 if_rm(true, n, add(m, x)) -> rm(n, x) 4.33/1.97 if_rm(false, n, add(m, x)) -> add(m, rm(n, x)) 4.33/1.97 purge(nil) -> nil 4.33/1.97 purge(add(n, x)) -> add(n, purge(rm(n, x))) 4.33/1.97 4.33/1.97 The set E consists of the following equations: 4.33/1.97 4.33/1.97 eq(x, y) == eq(y, x) 4.33/1.97 4.33/1.97 The set E# consists of the following equations: 4.33/1.97 4.33/1.97 EQ(x, y) == EQ(y, x) 4.33/1.97 4.33/1.97 We have to consider all minimal (P,E#,R,E)-chains 4.33/1.97 4.33/1.97 ---------------------------------------- 4.33/1.97 4.33/1.97 (2) 4.33/1.97 Obligation: 4.33/1.97 The TRS P consists of the following rules: 4.33/1.97 4.33/1.97 EQ(s(x), s(y)) -> EQ(x, y) 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