Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432287167
details
property
value
status
complete
benchmark
26291.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
ICFP_2010
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
9.06243 seconds
cpu usage
32.3861
user time
30.7584
system time
1.6277
max virtual memory
3.8570432E7
max residence set size
4306780.0
stage attributes
key
value
starexec-result
YES
output
31.90/8.93 YES 32.16/8.96 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 32.16/8.96 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 32.16/8.96 32.16/8.96 32.16/8.96 Termination w.r.t. Q of the given QTRS could be proven: 32.16/8.96 32.16/8.96 (0) QTRS 32.16/8.96 (1) QTRS Reverse [EQUIVALENT, 0 ms] 32.16/8.96 (2) QTRS 32.16/8.96 (3) QTRSRoofMatchBoundsTAProof [EQUIVALENT, 1416 ms] 32.16/8.96 (4) YES 32.16/8.96 32.16/8.96 32.16/8.96 ---------------------------------------- 32.16/8.96 32.16/8.96 (0) 32.16/8.96 Obligation: 32.16/8.96 Q restricted rewrite system: 32.16/8.96 The TRS R consists of the following rules: 32.16/8.96 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(x1)))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(x1))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1)))))))))))))))))))))))))))))))))) 32.16/8.96 0(1(2(1(x1)))) -> 1(2(1(1(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(0(1(2(x1))))))))))))))))))))))))))))))))))))) 32.16/8.96 32.16/8.96 Q is empty. 32.16/8.96 32.16/8.96 ---------------------------------------- 32.16/8.96 32.16/8.96 (1) QTRS Reverse (EQUIVALENT) 32.16/8.96 We applied the QTRS Reverse Processor [REVERSE]. 32.16/8.96 ---------------------------------------- 32.16/8.96 32.16/8.96 (2) 32.16/8.96 Obligation: 32.16/8.96 Q restricted rewrite system: 32.16/8.96 The TRS R consists of the following rules: 32.16/8.96 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(1(1(2(1(x1)))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(1(1(2(1(x1))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1)))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1)))))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1))))))))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1)))))))))))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1))))))))))))))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1)))))))))))))))))))))))))))))))))) 32.16/8.96 1(2(1(0(x1)))) -> 2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(2(1(0(1(1(2(1(x1))))))))))))))))))))))))))))))))))))) 32.16/8.96 32.16/8.96 Q is empty. 32.16/8.96 32.16/8.96 ---------------------------------------- 32.16/8.96 32.16/8.96 (3) QTRSRoofMatchBoundsTAProof (EQUIVALENT) 32.16/8.96 The TRS R could be shown to be Match-Bounded [TAB_LEFTLINEAR,TAB_NONLEFTLINEAR] by 3. Therefore it terminates. 32.16/8.96 32.16/8.96 The compatible tree automaton used to show the Match-Boundedness is represented by: 32.16/8.96 final states : [0, 1, 2] 32.16/8.96 transitions: 32.16/8.96 10(0) -> 0 32.16/8.96 10(1) -> 0 32.16/8.96 10(2) -> 0 32.16/8.96 20(0) -> 1 32.16/8.96 20(1) -> 1 32.16/8.96 20(2) -> 1 32.16/8.96 00(0) -> 2 32.16/8.96 00(1) -> 2 32.16/8.96 00(2) -> 2 32.16/8.96 11(0) -> 10 32.16/8.96 21(10) -> 9 32.16/8.96 11(9) -> 8 32.16/8.96 11(8) -> 7 32.16/8.96 01(7) -> 6 32.16/8.96 11(6) -> 3 32.16/8.96 21(3) -> 5 32.16/8.96 01(5) -> 4 32.16/8.96 11(4) -> 3 32.16/8.96 21(3) -> 0 32.16/8.96 11(1) -> 10 32.16/8.96 11(2) -> 10 32.16/8.96 11(7) -> 10 32.16/8.96 11(5) -> 10 32.16/8.96 12(7) -> 18 32.16/8.96 22(18) -> 17 32.16/8.96 12(17) -> 16 32.16/8.96 12(16) -> 15 32.16/8.96 02(15) -> 14 32.16/8.96 12(14) -> 11 32.16/8.96 22(11) -> 13 32.16/8.96 02(13) -> 12 32.16/8.96 12(12) -> 11 32.16/8.96 22(11) -> 10 32.16/8.96 12(5) -> 18
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