details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	8.80338 seconds
cpu usage	30.5433
user time	28.8943
system time	1.64907
max virtual memory	6.1577092E7
max residence set size	4166588.0

stage attributes

key	value
starexec-result	YES

output

30.15/8.73 YES 30.15/8.73 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 30.15/8.73 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 30.15/8.73 30.15/8.73 30.15/8.73 Termination w.r.t. Q of the given QTRS could be proven: 30.15/8.73 30.15/8.73 (0) QTRS 30.15/8.73 (1) QTRS Reverse [EQUIVALENT, 0 ms] 30.15/8.73 (2) QTRS 30.15/8.73 (3) DependencyPairsProof [EQUIVALENT, 0 ms] 30.15/8.73 (4) QDP 30.15/8.73 (5) QDPOrderProof [EQUIVALENT, 24 ms] 30.15/8.73 (6) QDP 30.15/8.73 (7) QDPOrderProof [EQUIVALENT, 50 ms] 30.15/8.73 (8) QDP 30.15/8.73 (9) PisEmptyProof [EQUIVALENT, 0 ms] 30.15/8.73 (10) YES 30.15/8.73 30.15/8.73 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (0) 30.15/8.73 Obligation: 30.15/8.73 Q restricted rewrite system: 30.15/8.73 The TRS R consists of the following rules: 30.15/8.73 30.15/8.73 0(0(0(0(x1)))) -> 0(1(0(1(x1)))) 30.15/8.73 1(0(1(0(x1)))) -> 0(1(0(0(x1)))) 30.15/8.73 30.15/8.73 Q is empty. 30.15/8.73 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (1) QTRS Reverse (EQUIVALENT) 30.15/8.73 We applied the QTRS Reverse Processor [REVERSE]. 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (2) 30.15/8.73 Obligation: 30.15/8.73 Q restricted rewrite system: 30.15/8.73 The TRS R consists of the following rules: 30.15/8.73 30.15/8.73 0(0(0(0(x1)))) -> 1(0(1(0(x1)))) 30.15/8.73 0(1(0(1(x1)))) -> 0(0(1(0(x1)))) 30.15/8.73 30.15/8.73 Q is empty. 30.15/8.73 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (3) DependencyPairsProof (EQUIVALENT) 30.15/8.73 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (4) 30.15/8.73 Obligation: 30.15/8.73 Q DP problem: 30.15/8.73 The TRS P consists of the following rules: 30.15/8.73 30.15/8.73 0^1(0(0(0(x1)))) -> 0^1(1(0(x1))) 30.15/8.73 0^1(1(0(1(x1)))) -> 0^1(0(1(0(x1)))) 30.15/8.73 0^1(1(0(1(x1)))) -> 0^1(1(0(x1))) 30.15/8.73 0^1(1(0(1(x1)))) -> 0^1(x1) 30.15/8.73 30.15/8.73 The TRS R consists of the following rules: 30.15/8.73 30.15/8.73 0(0(0(0(x1)))) -> 1(0(1(0(x1)))) 30.15/8.73 0(1(0(1(x1)))) -> 0(0(1(0(x1)))) 30.15/8.73 30.15/8.73 Q is empty. 30.15/8.73 We have to consider all minimal (P,Q,R)-chains. 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (5) QDPOrderProof (EQUIVALENT) 30.15/8.73 We use the reduction pair processor [LPAR04,JAR06]. 30.15/8.73 30.15/8.73 30.15/8.73 The following pairs can be oriented strictly and are deleted. 30.15/8.73 30.15/8.73 0^1(0(0(0(x1)))) -> 0^1(1(0(x1))) 30.15/8.73 0^1(1(0(1(x1)))) -> 0^1(1(0(x1))) 30.15/8.73 0^1(1(0(1(x1)))) -> 0^1(x1) 30.15/8.73 The remaining pairs can at least be oriented weakly. 30.15/8.73 Used ordering: Polynomial interpretation [POLO]: 30.15/8.73 30.15/8.73 POL(0(x_1)) = 1 + x_1 30.15/8.73 POL(0^1(x_1)) = x_1 30.15/8.73 POL(1(x_1)) = 1 + x_1 30.15/8.73 30.15/8.73 The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented: 30.15/8.73 30.15/8.73 0(0(0(0(x1)))) -> 1(0(1(0(x1)))) 30.15/8.73 0(1(0(1(x1)))) -> 0(0(1(0(x1)))) 30.15/8.73 30.15/8.73 30.15/8.73 ---------------------------------------- 30.15/8.73 30.15/8.73 (6) 30.15/8.73 Obligation: 30.15/8.73 Q DP problem: 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