details

property	value
status	complete
benchmark	random-498.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n104.star.cs.uiowa.edu
space	Waldmann_19

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	9.28033 seconds
cpu usage	32.5679
user time	31.204
system time	1.36392
max virtual memory	8.235344E7
max residence set size	4132452.0

stage attributes

key	value
starexec-result	YES

output

32.23/9.15 YES 32.23/9.15 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 32.23/9.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 32.23/9.15 32.23/9.15 32.23/9.15 Termination w.r.t. Q of the given QTRS could be proven: 32.23/9.15 32.23/9.15 (0) QTRS 32.23/9.15 (1) QTRS Reverse [EQUIVALENT, 0 ms] 32.23/9.15 (2) QTRS 32.23/9.15 (3) DependencyPairsProof [EQUIVALENT, 20 ms] 32.23/9.15 (4) QDP 32.23/9.15 (5) QDPOrderProof [EQUIVALENT, 24 ms] 32.23/9.15 (6) QDP 32.23/9.15 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 32.23/9.15 (8) AND 32.23/9.15 (9) QDP 32.23/9.15 (10) QDPOrderProof [EQUIVALENT, 1206 ms] 32.23/9.15 (11) QDP 32.23/9.15 (12) PisEmptyProof [EQUIVALENT, 0 ms] 32.23/9.15 (13) YES 32.23/9.15 (14) QDP 32.23/9.15 (15) QDPOrderProof [EQUIVALENT, 0 ms] 32.23/9.15 (16) QDP 32.23/9.15 (17) PisEmptyProof [EQUIVALENT, 0 ms] 32.23/9.15 (18) YES 32.23/9.15 32.23/9.15 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (0) 32.23/9.15 Obligation: 32.23/9.15 Q restricted rewrite system: 32.23/9.15 The TRS R consists of the following rules: 32.23/9.15 32.23/9.15 b(b(b(b(x1)))) -> a(a(b(b(x1)))) 32.23/9.15 a(a(a(a(x1)))) -> b(a(a(a(x1)))) 32.23/9.15 a(b(a(b(x1)))) -> b(b(a(a(x1)))) 32.23/9.15 32.23/9.15 Q is empty. 32.23/9.15 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (1) QTRS Reverse (EQUIVALENT) 32.23/9.15 We applied the QTRS Reverse Processor [REVERSE]. 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (2) 32.23/9.15 Obligation: 32.23/9.15 Q restricted rewrite system: 32.23/9.15 The TRS R consists of the following rules: 32.23/9.15 32.23/9.15 b(b(b(b(x1)))) -> b(b(a(a(x1)))) 32.23/9.15 a(a(a(a(x1)))) -> a(a(a(b(x1)))) 32.23/9.15 b(a(b(a(x1)))) -> a(a(b(b(x1)))) 32.23/9.15 32.23/9.15 Q is empty. 32.23/9.15 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (3) DependencyPairsProof (EQUIVALENT) 32.23/9.15 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (4) 32.23/9.15 Obligation: 32.23/9.15 Q DP problem: 32.23/9.15 The TRS P consists of the following rules: 32.23/9.15 32.23/9.15 B(b(b(b(x1)))) -> B(b(a(a(x1)))) 32.23/9.15 B(b(b(b(x1)))) -> B(a(a(x1))) 32.23/9.15 B(b(b(b(x1)))) -> A(a(x1)) 32.23/9.15 B(b(b(b(x1)))) -> A(x1) 32.23/9.15 A(a(a(a(x1)))) -> A(a(a(b(x1)))) 32.23/9.15 A(a(a(a(x1)))) -> A(a(b(x1))) 32.23/9.15 A(a(a(a(x1)))) -> A(b(x1)) 32.23/9.15 A(a(a(a(x1)))) -> B(x1) 32.23/9.15 B(a(b(a(x1)))) -> A(a(b(b(x1)))) 32.23/9.15 B(a(b(a(x1)))) -> A(b(b(x1))) 32.23/9.15 B(a(b(a(x1)))) -> B(b(x1)) 32.23/9.15 B(a(b(a(x1)))) -> B(x1) 32.23/9.15 32.23/9.15 The TRS R consists of the following rules: 32.23/9.15 32.23/9.15 b(b(b(b(x1)))) -> b(b(a(a(x1)))) 32.23/9.15 a(a(a(a(x1)))) -> a(a(a(b(x1)))) 32.23/9.15 b(a(b(a(x1)))) -> a(a(b(b(x1)))) 32.23/9.15 32.23/9.15 Q is empty. 32.23/9.15 We have to consider all minimal (P,Q,R)-chains. 32.23/9.15 ---------------------------------------- 32.23/9.15 32.23/9.15 (5) QDPOrderProof (EQUIVALENT) 32.23/9.15 We use the reduction pair processor [LPAR04,JAR06]. 32.23/9.15 32.23/9.15 32.23/9.15 The following pairs can be oriented strictly and are deleted. 32.23/9.15 32.23/9.15 B(b(b(b(x1)))) -> B(a(a(x1))) 32.23/9.15 B(b(b(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