details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.42592 seconds
cpu usage	29.323
user time	28.0519
system time	1.27113
max virtual memory	1.002645E8
max residence set size	4039516.0

stage attributes

key	value
starexec-result	YES

output

28.52/8.23 YES 29.05/8.33 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 29.05/8.33 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 29.05/8.33 29.05/8.33 29.05/8.33 Termination w.r.t. Q of the given QTRS could be proven: 29.05/8.33 29.05/8.33 (0) QTRS 29.05/8.33 (1) QTRS Reverse [EQUIVALENT, 0 ms] 29.05/8.33 (2) QTRS 29.05/8.33 (3) DependencyPairsProof [EQUIVALENT, 26 ms] 29.05/8.33 (4) QDP 29.05/8.33 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 29.05/8.33 (6) AND 29.05/8.33 (7) QDP 29.05/8.33 (8) UsableRulesProof [EQUIVALENT, 0 ms] 29.05/8.33 (9) QDP 29.05/8.33 (10) QDPOrderProof [EQUIVALENT, 109 ms] 29.05/8.33 (11) QDP 29.05/8.33 (12) DependencyGraphProof [EQUIVALENT, 0 ms] 29.05/8.33 (13) AND 29.05/8.33 (14) QDP 29.05/8.33 (15) QDPOrderProof [EQUIVALENT, 0 ms] 29.05/8.33 (16) QDP 29.05/8.33 (17) PisEmptyProof [EQUIVALENT, 0 ms] 29.05/8.33 (18) YES 29.05/8.33 (19) QDP 29.05/8.33 (20) QDPOrderProof [EQUIVALENT, 25 ms] 29.05/8.33 (21) QDP 29.05/8.33 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 29.05/8.33 (23) TRUE 29.05/8.33 (24) QDP 29.05/8.33 (25) UsableRulesProof [EQUIVALENT, 4 ms] 29.05/8.33 (26) QDP 29.05/8.33 (27) QDPOrderProof [EQUIVALENT, 12 ms] 29.05/8.33 (28) QDP 29.05/8.33 (29) MRRProof [EQUIVALENT, 3 ms] 29.05/8.33 (30) QDP 29.05/8.33 (31) PisEmptyProof [EQUIVALENT, 0 ms] 29.05/8.33 (32) YES 29.05/8.33 29.05/8.33 29.05/8.33 ---------------------------------------- 29.05/8.33 29.05/8.33 (0) 29.05/8.33 Obligation: 29.05/8.33 Q restricted rewrite system: 29.05/8.33 The TRS R consists of the following rules: 29.05/8.33 29.05/8.33 a(s(x1)) -> s(a(x1)) 29.05/8.33 b(a(b(s(x1)))) -> a(b(s(a(x1)))) 29.05/8.33 b(a(b(b(x1)))) -> c(s(x1)) 29.05/8.33 c(s(x1)) -> a(b(a(b(x1)))) 29.05/8.33 a(b(a(a(x1)))) -> b(a(b(a(x1)))) 29.05/8.33 29.05/8.33 Q is empty. 29.05/8.33 29.05/8.33 ---------------------------------------- 29.05/8.33 29.05/8.33 (1) QTRS Reverse (EQUIVALENT) 29.05/8.33 We applied the QTRS Reverse Processor [REVERSE]. 29.05/8.33 ---------------------------------------- 29.05/8.33 29.05/8.33 (2) 29.05/8.33 Obligation: 29.05/8.33 Q restricted rewrite system: 29.05/8.33 The TRS R consists of the following rules: 29.05/8.33 29.05/8.33 s(a(x1)) -> a(s(x1)) 29.05/8.33 s(b(a(b(x1)))) -> a(s(b(a(x1)))) 29.05/8.33 b(b(a(b(x1)))) -> s(c(x1)) 29.05/8.33 s(c(x1)) -> b(a(b(a(x1)))) 29.05/8.33 a(a(b(a(x1)))) -> a(b(a(b(x1)))) 29.05/8.33 29.05/8.33 Q is empty. 29.05/8.33 29.05/8.33 ---------------------------------------- 29.05/8.33 29.05/8.33 (3) DependencyPairsProof (EQUIVALENT) 29.05/8.33 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 29.05/8.33 ---------------------------------------- 29.05/8.33 29.05/8.33 (4) 29.05/8.33 Obligation: 29.05/8.33 Q DP problem: 29.05/8.33 The TRS P consists of the following rules: 29.05/8.33 29.05/8.33 S(a(x1)) -> A(s(x1)) 29.05/8.33 S(a(x1)) -> S(x1) 29.05/8.33 S(b(a(b(x1)))) -> A(s(b(a(x1)))) 29.05/8.33 S(b(a(b(x1)))) -> S(b(a(x1))) 29.05/8.33 S(b(a(b(x1)))) -> B(a(x1)) 29.05/8.33 S(b(a(b(x1)))) -> A(x1) 29.05/8.33 B(b(a(b(x1)))) -> S(c(x1)) 29.05/8.33 S(c(x1)) -> B(a(b(a(x1)))) 29.05/8.33 S(c(x1)) -> A(b(a(x1))) 29.05/8.33 S(c(x1)) -> B(a(x1)) 29.05/8.33 S(c(x1)) -> A(x1) 29.05/8.33 A(a(b(a(x1)))) -> A(b(a(b(x1)))) 29.05/8.33 A(a(b(a(x1)))) -> B(a(b(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