Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relat 75837 pair #381724996
details
property
value
status
complete
benchmark
rtL-me3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n089.star.cs.uiowa.edu
space
Relative_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.35603094101 seconds
cpu usage
5.701486518
max memory
4.00392192E8
stage attributes
key
value
output-size
7029
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS S Cleaner [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 73 ms] (4) RelTRS (5) RelTRSRRRProof [EQUIVALENT, 18 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 9 ms] (8) RelTRS (9) RIsEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: topB(i, N1(x), y) -> topA(1, T1(x), y) topA(i, x, N2(y)) -> topB(0, x, T2(y)) topB(i, S1(x), y) -> topA(i, N1(x), y) topA(i, x, S2(y)) -> topB(i, x, N2(y)) topA(i, N1(x), T2(y)) -> topB(i, N1(x), S2(y)) topA(1, T1(x), T2(y)) -> topB(1, T1(x), S2(y)) The relative TRS consists of the following S rules: topA(i, N1(x), y) -> topA(1, T1(x), y) topB(i, x, N2(y)) -> topB(0, x, T2(y)) topA(i, S1(x), y) -> topA(i, N1(x), y) topB(i, x, S2(y)) -> topB(i, x, N2(y)) topB(i, N1(x), T2(y)) -> topB(i, N1(x), S2(y)) topB(1, T1(x), T2(y)) -> topB(1, T1(x), S2(y)) topA(i, N1(x), y) -> topA(i, N1(C(x)), y) topB(i, x, N2(y)) -> topB(i, x, N2(C(y))) topA(i, T1(x), y) -> topA(i, T1(x), y) topB(i, x, T2(y)) -> topB(i, x, T2(y)) topB(i, x, S2(y)) -> topB(i, x, S2(D(y))) ---------------------------------------- (1) RelTRS S Cleaner (EQUIVALENT) We have deleted all rules from S that have the shape t -> t: topA(i, T1(x), y) -> topA(i, T1(x), y) topB(i, x, T2(y)) -> topB(i, x, T2(y)) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: topB(i, N1(x), y) -> topA(1, T1(x), y) topA(i, x, N2(y)) -> topB(0, x, T2(y)) topB(i, S1(x), y) -> topA(i, N1(x), y) topA(i, x, S2(y)) -> topB(i, x, N2(y)) topA(i, N1(x), T2(y)) -> topB(i, N1(x), S2(y)) topA(1, T1(x), T2(y)) -> topB(1, T1(x), S2(y)) The relative TRS consists of the following S rules: topA(i, N1(x), y) -> topA(1, T1(x), y) topB(i, x, N2(y)) -> topB(0, x, T2(y)) topA(i, S1(x), y) -> topA(i, N1(x), y) topB(i, x, S2(y)) -> topB(i, x, N2(y)) topB(i, N1(x), T2(y)) -> topB(i, N1(x), S2(y)) topB(1, T1(x), T2(y)) -> topB(1, T1(x), S2(y)) topA(i, N1(x), y) -> topA(i, N1(C(x)), y) topB(i, x, N2(y)) -> topB(i, x, N2(C(y))) topB(i, x, S2(y)) -> topB(i, x, S2(D(y))) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(0) = 0 POL(1) = 0 POL(C(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relat 75837