details

property	value
status	complete
benchmark	bababbababa-abababbababba.srs.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n043.star.cs.uiowa.edu
space	Wenzel_16

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	32.8232 seconds
cpu usage	123.453
user time	118.951
system time	4.50191
max virtual memory	3.9898736E7
max residence set size	1.0472656E7

stage attributes

key	value
starexec-result	YES

output

123.14/32.73 YES 123.29/32.75 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 123.29/32.75 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 123.29/32.75 123.29/32.75 123.29/32.75 Termination w.r.t. Q of the given QTRS could be proven: 123.29/32.75 123.29/32.75 (0) QTRS 123.29/32.75 (1) QTRS Reverse [EQUIVALENT, 0 ms] 123.29/32.75 (2) QTRS 123.29/32.75 (3) DependencyPairsProof [EQUIVALENT, 1 ms] 123.29/32.75 (4) QDP 123.29/32.75 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 123.29/32.75 (6) QDP 123.29/32.75 (7) QDPOrderProof [EQUIVALENT, 7505 ms] 123.29/32.75 (8) QDP 123.29/32.75 (9) UsableRulesProof [EQUIVALENT, 0 ms] 123.29/32.75 (10) QDP 123.29/32.75 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 123.29/32.75 (12) YES 123.29/32.75 123.29/32.75 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (0) 123.29/32.75 Obligation: 123.29/32.75 Q restricted rewrite system: 123.29/32.75 The TRS R consists of the following rules: 123.29/32.75 123.29/32.75 b(a(b(a(b(b(a(b(a(b(a(x1))))))))))) -> a(b(a(b(a(b(b(a(b(a(b(b(a(x1))))))))))))) 123.29/32.75 123.29/32.75 Q is empty. 123.29/32.75 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (1) QTRS Reverse (EQUIVALENT) 123.29/32.75 We applied the QTRS Reverse Processor [REVERSE]. 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (2) 123.29/32.75 Obligation: 123.29/32.75 Q restricted rewrite system: 123.29/32.75 The TRS R consists of the following rules: 123.29/32.75 123.29/32.75 a(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> a(b(b(a(b(a(b(b(a(b(a(b(a(x1))))))))))))) 123.29/32.75 123.29/32.75 Q is empty. 123.29/32.75 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (3) DependencyPairsProof (EQUIVALENT) 123.29/32.75 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (4) 123.29/32.75 Obligation: 123.29/32.75 Q DP problem: 123.29/32.75 The TRS P consists of the following rules: 123.29/32.75 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(b(a(b(a(b(b(a(b(a(b(a(x1))))))))))))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(a(b(b(a(b(a(b(a(x1)))))))))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(b(a(b(a(b(a(x1)))))))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(a(b(a(x1))))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(a(x1))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(x1) 123.29/32.75 123.29/32.75 The TRS R consists of the following rules: 123.29/32.75 123.29/32.75 a(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> a(b(b(a(b(a(b(b(a(b(a(b(a(x1))))))))))))) 123.29/32.75 123.29/32.75 Q is empty. 123.29/32.75 We have to consider all minimal (P,Q,R)-chains. 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (5) DependencyGraphProof (EQUIVALENT) 123.29/32.75 The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 3 less nodes. 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (6) 123.29/32.75 Obligation: 123.29/32.75 Q DP problem: 123.29/32.75 The TRS P consists of the following rules: 123.29/32.75 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(a(x1))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(b(a(b(a(x1))))) 123.29/32.75 A(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> A(x1) 123.29/32.75 123.29/32.75 The TRS R consists of the following rules: 123.29/32.75 123.29/32.75 a(b(a(b(a(b(b(a(b(a(b(x1))))))))))) -> a(b(b(a(b(a(b(b(a(b(a(b(a(x1))))))))))))) 123.29/32.75 123.29/32.75 Q is empty. 123.29/32.75 We have to consider all minimal (P,Q,R)-chains. 123.29/32.75 ---------------------------------------- 123.29/32.75 123.29/32.75 (7) QDPOrderProof (EQUIVALENT) 123.29/32.75 We use the reduction pair processor [LPAR04,JAR06]. 123.29/32.75 123.29/32.75 123.29/32.75 The following pairs can be oriented strictly and are deleted. 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