Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432286603
details
property
value
status
complete
benchmark
212534.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n130.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
14.0044 seconds
cpu usage
51.5654
user time
50.1457
system time
1.41966
max virtual memory
6.2012308E7
max residence set size
4134412.0
stage attributes
key
value
starexec-result
YES
output
51.09/13.89 YES 51.32/13.95 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 51.32/13.95 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 51.32/13.95 51.32/13.95 51.32/13.95 Termination w.r.t. Q of the given QTRS could be proven: 51.32/13.95 51.32/13.95 (0) QTRS 51.32/13.95 (1) DependencyPairsProof [EQUIVALENT, 374 ms] 51.32/13.95 (2) QDP 51.32/13.95 (3) DependencyGraphProof [EQUIVALENT, 0 ms] 51.32/13.95 (4) QDP 51.32/13.95 (5) QDPOrderProof [EQUIVALENT, 260 ms] 51.32/13.95 (6) QDP 51.32/13.95 (7) DependencyGraphProof [EQUIVALENT, 0 ms] 51.32/13.95 (8) AND 51.32/13.95 (9) QDP 51.32/13.95 (10) QDPOrderProof [EQUIVALENT, 76 ms] 51.32/13.95 (11) QDP 51.32/13.95 (12) PisEmptyProof [EQUIVALENT, 0 ms] 51.32/13.95 (13) YES 51.32/13.95 (14) QDP 51.32/13.95 (15) QDPOrderProof [EQUIVALENT, 72 ms] 51.32/13.95 (16) QDP 51.32/13.95 (17) PisEmptyProof [EQUIVALENT, 0 ms] 51.32/13.95 (18) YES 51.32/13.95 (19) QDP 51.32/13.95 (20) QDPOrderProof [EQUIVALENT, 140 ms] 51.32/13.95 (21) QDP 51.32/13.95 (22) DependencyGraphProof [EQUIVALENT, 0 ms] 51.32/13.95 (23) TRUE 51.32/13.95 51.32/13.95 51.32/13.95 ---------------------------------------- 51.32/13.95 51.32/13.95 (0) 51.32/13.95 Obligation: 51.32/13.95 Q restricted rewrite system: 51.32/13.95 The TRS R consists of the following rules: 51.32/13.95 51.32/13.95 0(1(2(x1))) -> 2(1(0(3(x1)))) 51.32/13.95 0(1(2(x1))) -> 2(1(3(0(x1)))) 51.32/13.95 0(1(2(x1))) -> 2(1(3(0(4(x1))))) 51.32/13.95 0(1(2(x1))) -> 2(1(3(4(0(x1))))) 51.32/13.95 0(1(2(x1))) -> 2(1(3(4(0(4(x1)))))) 51.32/13.95 0(0(1(2(x1)))) -> 0(2(1(0(3(x1))))) 51.32/13.95 0(1(1(2(x1)))) -> 1(0(4(1(2(x1))))) 51.32/13.95 0(1(1(2(x1)))) -> 1(2(1(0(3(x1))))) 51.32/13.95 0(1(2(0(x1)))) -> 2(1(0(3(0(3(x1)))))) 51.32/13.95 0(1(2(5(x1)))) -> 2(1(0(3(5(x1))))) 51.32/13.95 0(1(2(5(x1)))) -> 5(1(0(3(2(x1))))) 51.32/13.95 0(1(4(2(x1)))) -> 2(1(3(4(0(x1))))) 51.32/13.95 0(1(4(2(x1)))) -> 2(4(1(0(3(x1))))) 51.32/13.95 0(1(4(2(x1)))) -> 0(2(1(0(3(4(x1)))))) 51.32/13.95 2(1(1(5(x1)))) -> 2(5(1(4(1(x1))))) 51.32/13.95 2(1(1(5(x1)))) -> 5(1(3(2(1(x1))))) 51.32/13.95 2(1(2(0(x1)))) -> 2(2(1(0(3(x1))))) 51.32/13.95 2(3(5(5(x1)))) -> 5(1(0(3(2(5(x1)))))) 51.32/13.95 2(5(3(2(x1)))) -> 5(1(3(2(2(x1))))) 51.32/13.95 5(1(2(0(x1)))) -> 2(5(1(0(3(x1))))) 51.32/13.95 0(1(0(1(2(x1))))) -> 0(2(1(1(3(0(x1)))))) 51.32/13.95 0(1(1(2(5(x1))))) -> 0(1(3(5(1(2(x1)))))) 51.32/13.95 0(1(1(4(2(x1))))) -> 4(1(0(3(2(1(x1)))))) 51.32/13.95 0(1(1(5(0(x1))))) -> 0(1(0(5(4(1(x1)))))) 51.32/13.95 0(1(1(5(4(x1))))) -> 1(4(1(0(3(5(x1)))))) 51.32/13.95 0(1(2(3(5(x1))))) -> 0(1(3(4(5(2(x1)))))) 51.32/13.95 0(1(2(3(5(x1))))) -> 0(2(5(1(0(3(x1)))))) 51.32/13.95 0(1(2(3(5(x1))))) -> 1(0(3(0(2(5(x1)))))) 51.32/13.95 0(1(2(3(5(x1))))) -> 5(1(3(0(2(0(x1)))))) 51.32/13.95 0(1(4(0(2(x1))))) -> 4(0(1(3(0(2(x1)))))) 51.32/13.95 0(1(4(0(2(x1))))) -> 4(0(2(1(3(0(x1)))))) 51.32/13.95 0(4(5(3(5(x1))))) -> 5(1(0(3(4(5(x1)))))) 51.32/13.95 2(1(0(1(5(x1))))) -> 1(0(3(2(5(1(x1)))))) 51.32/13.95 2(1(4(3(5(x1))))) -> 1(3(5(4(4(2(x1)))))) 51.32/13.95 2(1(4(3(5(x1))))) -> 5(4(4(1(3(2(x1)))))) 51.32/13.95 2(1(4(5(0(x1))))) -> 2(4(1(0(3(5(x1)))))) 51.32/13.95 2(2(3(5(0(x1))))) -> 5(2(4(2(0(3(x1)))))) 51.32/13.95 2(2(4(3(5(x1))))) -> 5(1(3(4(2(2(x1)))))) 51.32/13.95 2(3(1(1(2(x1))))) -> 1(3(2(1(2(0(x1)))))) 51.32/13.95 2(3(1(1(2(x1))))) -> 4(1(2(2(1(3(x1)))))) 51.32/13.95 2(3(2(0(5(x1))))) -> 2(2(1(0(3(5(x1)))))) 51.32/13.95 2(3(3(1(5(x1))))) -> 1(3(5(1(3(2(x1)))))) 51.32/13.95 2(5(0(3(5(x1))))) -> 5(2(1(3(0(5(x1)))))) 51.32/13.95 4(2(0(1(2(x1))))) -> 4(2(2(1(3(0(x1)))))) 51.32/13.95 5(0(1(2(2(x1))))) -> 4(1(5(2(0(2(x1)))))) 51.32/13.95 5(1(4(2(2(x1))))) -> 5(1(3(2(4(2(x1)))))) 51.32/13.95 5(1(4(3(2(x1))))) -> 4(5(1(3(4(2(x1)))))) 51.32/13.95 5(5(4(3(2(x1))))) -> 5(1(3(4(5(2(x1)))))) 51.32/13.95 51.32/13.95 Q is empty. 51.32/13.95 51.32/13.95 ---------------------------------------- 51.32/13.95 51.32/13.95 (1) DependencyPairsProof (EQUIVALENT) 51.32/13.95 Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. 51.32/13.95 ---------------------------------------- 51.32/13.95 51.32/13.95 (2) 51.32/13.95 Obligation: 51.32/13.95 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