details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	10.4383 seconds
cpu usage	36.9295
user time	35.391
system time	1.53848
max virtual memory	6.2570752E7
max residence set size	4104344.0

stage attributes

key	value
starexec-result	YES

output

35.91/10.10 YES 36.57/10.27 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 36.57/10.27 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 36.57/10.27 36.57/10.27 36.57/10.27 Termination w.r.t. Q of the given QTRS could be proven: 36.57/10.27 36.57/10.27 (0) QTRS 36.57/10.27 (1) DependencyPairsProof [EQUIVALENT, 1 ms] 36.57/10.27 (2) QDP 36.57/10.27 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 36.57/10.27 (4) AND 36.57/10.27 (5) QDP 36.57/10.27 (6) QDPOrderProof [EQUIVALENT, 23 ms] 36.57/10.27 (7) QDP 36.57/10.27 (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] 36.57/10.27 (9) YES 36.57/10.27 (10) QDP 36.57/10.27 (11) QDPOrderProof [EQUIVALENT, 70 ms] 36.57/10.27 (12) QDP 36.57/10.27 (13) QDPOrderProof [EQUIVALENT, 209 ms] 36.57/10.27 (14) QDP 36.57/10.27 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 36.57/10.27 (16) YES 36.57/10.27 36.57/10.27 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (0) 36.57/10.27 Obligation: 36.57/10.27 Q restricted rewrite system: 36.57/10.27 The TRS R consists of the following rules: 36.57/10.27 36.57/10.27 a(b(b(x1))) -> P(a(b(x1))) 36.57/10.27 a(P(x1)) -> P(a(x(x1))) 36.57/10.27 a(x(x1)) -> x(a(x1)) 36.57/10.27 b(P(x1)) -> b(Q(x1)) 36.57/10.27 Q(x(x1)) -> a(Q(x1)) 36.57/10.27 Q(a(x1)) -> b(b(a(x1))) 36.57/10.27 36.57/10.27 Q is empty. 36.57/10.27 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (1) DependencyPairsProof (EQUIVALENT) 36.57/10.27 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (2) 36.57/10.27 Obligation: 36.57/10.27 Q DP problem: 36.57/10.27 The TRS P consists of the following rules: 36.57/10.27 36.57/10.27 A(b(b(x1))) -> A(b(x1)) 36.57/10.27 A(P(x1)) -> A(x(x1)) 36.57/10.27 A(x(x1)) -> A(x1) 36.57/10.27 B(P(x1)) -> B(Q(x1)) 36.57/10.27 B(P(x1)) -> Q^1(x1) 36.57/10.27 Q^1(x(x1)) -> A(Q(x1)) 36.57/10.27 Q^1(x(x1)) -> Q^1(x1) 36.57/10.27 Q^1(a(x1)) -> B(b(a(x1))) 36.57/10.27 Q^1(a(x1)) -> B(a(x1)) 36.57/10.27 36.57/10.27 The TRS R consists of the following rules: 36.57/10.27 36.57/10.27 a(b(b(x1))) -> P(a(b(x1))) 36.57/10.27 a(P(x1)) -> P(a(x(x1))) 36.57/10.27 a(x(x1)) -> x(a(x1)) 36.57/10.27 b(P(x1)) -> b(Q(x1)) 36.57/10.27 Q(x(x1)) -> a(Q(x1)) 36.57/10.27 Q(a(x1)) -> b(b(a(x1))) 36.57/10.27 36.57/10.27 Q is empty. 36.57/10.27 We have to consider all minimal (P,Q,R)-chains. 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (3) DependencyGraphProof (EQUIVALENT) 36.57/10.27 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 1 less node. 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (4) 36.57/10.27 Complex Obligation (AND) 36.57/10.27 36.57/10.27 ---------------------------------------- 36.57/10.27 36.57/10.27 (5) 36.57/10.27 Obligation: 36.57/10.27 Q DP problem: 36.57/10.27 The TRS P consists of the following rules: 36.57/10.27 36.57/10.27 A(P(x1)) -> A(x(x1)) 36.57/10.27 A(x(x1)) -> A(x1) 36.57/10.27 A(b(b(x1))) -> A(b(x1)) 36.57/10.27 36.57/10.27 The TRS R consists of the following rules: 36.57/10.27 36.57/10.27 a(b(b(x1))) -> P(a(b(x1))) 36.57/10.27 a(P(x1)) -> P(a(x(x1))) 36.57/10.27 a(x(x1)) -> x(a(x1)) 36.57/10.27 b(P(x1)) -> b(Q(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