details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	12.0619 seconds
cpu usage	43.504
user time	42.1013
system time	1.4027
max virtual memory	9.6590276E7
max residence set size	3912288.0

stage attributes

key	value
starexec-result	YES

output

42.31/11.71 YES 43.13/11.93 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 43.13/11.93 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 43.13/11.93 43.13/11.93 43.13/11.93 Termination w.r.t. Q of the given QTRS could be proven: 43.13/11.93 43.13/11.93 (0) QTRS 43.13/11.93 (1) QTRS Reverse [EQUIVALENT, 0 ms] 43.13/11.93 (2) QTRS 43.13/11.93 (3) DependencyPairsProof [EQUIVALENT, 2 ms] 43.13/11.93 (4) QDP 43.13/11.93 (5) QDPOrderProof [EQUIVALENT, 89 ms] 43.13/11.93 (6) QDP 43.13/11.93 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 43.13/11.93 (8) QDP 43.13/11.93 (9) QDPOrderProof [EQUIVALENT, 19 ms] 43.13/11.93 (10) QDP 43.13/11.93 (11) QDPOrderProof [EQUIVALENT, 1096 ms] 43.13/11.93 (12) QDP 43.13/11.93 (13) DependencyGraphProof [EQUIVALENT, 0 ms] 43.13/11.93 (14) TRUE 43.13/11.93 43.13/11.93 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (0) 43.13/11.93 Obligation: 43.13/11.93 Q restricted rewrite system: 43.13/11.93 The TRS R consists of the following rules: 43.13/11.93 43.13/11.93 d(a(x1)) -> b(d(x1)) 43.13/11.93 b(x1) -> a(a(a(x1))) 43.13/11.93 c(d(c(x1))) -> a(d(x1)) 43.13/11.93 b(d(d(x1))) -> c(c(d(d(c(x1))))) 43.13/11.93 43.13/11.93 Q is empty. 43.13/11.93 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (1) QTRS Reverse (EQUIVALENT) 43.13/11.93 We applied the QTRS Reverse Processor [REVERSE]. 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (2) 43.13/11.93 Obligation: 43.13/11.93 Q restricted rewrite system: 43.13/11.93 The TRS R consists of the following rules: 43.13/11.93 43.13/11.93 a(d(x1)) -> d(b(x1)) 43.13/11.93 b(x1) -> a(a(a(x1))) 43.13/11.93 c(d(c(x1))) -> d(a(x1)) 43.13/11.93 d(d(b(x1))) -> c(d(d(c(c(x1))))) 43.13/11.93 43.13/11.93 Q is empty. 43.13/11.93 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (3) DependencyPairsProof (EQUIVALENT) 43.13/11.93 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (4) 43.13/11.93 Obligation: 43.13/11.93 Q DP problem: 43.13/11.93 The TRS P consists of the following rules: 43.13/11.93 43.13/11.93 A(d(x1)) -> D(b(x1)) 43.13/11.93 A(d(x1)) -> B(x1) 43.13/11.93 B(x1) -> A(a(a(x1))) 43.13/11.93 B(x1) -> A(a(x1)) 43.13/11.93 B(x1) -> A(x1) 43.13/11.93 C(d(c(x1))) -> D(a(x1)) 43.13/11.93 C(d(c(x1))) -> A(x1) 43.13/11.93 D(d(b(x1))) -> C(d(d(c(c(x1))))) 43.13/11.93 D(d(b(x1))) -> D(d(c(c(x1)))) 43.13/11.93 D(d(b(x1))) -> D(c(c(x1))) 43.13/11.93 D(d(b(x1))) -> C(c(x1)) 43.13/11.93 D(d(b(x1))) -> C(x1) 43.13/11.93 43.13/11.93 The TRS R consists of the following rules: 43.13/11.93 43.13/11.93 a(d(x1)) -> d(b(x1)) 43.13/11.93 b(x1) -> a(a(a(x1))) 43.13/11.93 c(d(c(x1))) -> d(a(x1)) 43.13/11.93 d(d(b(x1))) -> c(d(d(c(c(x1))))) 43.13/11.93 43.13/11.93 Q is empty. 43.13/11.93 We have to consider all minimal (P,Q,R)-chains. 43.13/11.93 ---------------------------------------- 43.13/11.93 43.13/11.93 (5) QDPOrderProof (EQUIVALENT) 43.13/11.93 We use the reduction pair processor [LPAR04,JAR06]. 43.13/11.93 43.13/11.93 43.13/11.93 The following pairs can be oriented strictly and are deleted. 43.13/11.93 43.13/11.93 A(d(x1)) -> D(b(x1)) 43.13/11.93 B(x1) -> A(a(a(x1))) 43.13/11.93 B(x1) -> A(a(x1)) popout

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

job log

popout

actions

all output return to SRS_Standard 2019-03-29 03.29