Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equat 89423 pair #381732756
details
property
value
status
complete
benchmark
AC49.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
AProVE_AC_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.95714211464 seconds
cpu usage
7.66444765
max memory
4.23333888E8
stage attributes
key
value
output-size
6951
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 ETRS could be proven: (0) ETRS (1) RRRPoloETRSProof [EQUIVALENT, 354 ms] (2) ETRS (3) RRRPoloETRSProof [EQUIVALENT, 306 ms] (4) ETRS (5) RRRPoloETRSProof [EQUIVALENT, 292 ms] (6) ETRS (7) EquationalDependencyPairsProof [EQUIVALENT, 0 ms] (8) EDP (9) EDependencyGraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Equational rewrite system: The TRS R consists of the following rules: app(nil, k) -> k app(l, nil) -> l app(cons(x, l), k) -> cons(x, app(l, k)) sum(cons(x, nil)) -> cons(x, nil) sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))) plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) The set E consists of the following equations: plus(x, y) == plus(y, x) plus(plus(x, y), z) == plus(x, plus(y, z)) ---------------------------------------- (1) RRRPoloETRSProof (EQUIVALENT) The following E TRS is given: Equational rewrite system: The TRS R consists of the following rules: app(nil, k) -> k app(l, nil) -> l app(cons(x, l), k) -> cons(x, app(l, k)) sum(cons(x, nil)) -> cons(x, nil) sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k))))) plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) The set E consists of the following equations: plus(x, y) == plus(y, x) plus(plus(x, y), z) == plus(x, plus(y, z)) The following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly by a polynomial ordering: app(cons(x, l), k) -> cons(x, app(l, k)) plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) Used ordering: Polynomial interpretation [POLO]: POL(0) = 0 POL(app(x_1, x_2)) = 2*x_1 + 2*x_1*x_2 + x_2 POL(cons(x_1, x_2)) = 1 + x_1 + x_1*x_2 + 2*x_2 POL(nil) = 0 POL(plus(x_1, x_2)) = 2 + 2*x_1 + x_1*x_2 + 2*x_2 POL(s(x_1)) = 3 + 2*x_1 POL(sum(x_1)) = x_1 ---------------------------------------- (2) Obligation: Equational rewrite system: The TRS R consists of the following rules: app(nil, k) -> k app(l, nil) -> l sum(cons(x, nil)) -> cons(x, nil) sum(cons(x, cons(y, l))) -> sum(cons(plus(x, y), l)) sum(app(l, cons(x, cons(y, k)))) -> sum(app(l, sum(cons(x, cons(y, k)))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equat 89423