Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967190
details
property
value
status
complete
benchmark
#3.54.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n063.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.48692107201 seconds
cpu usage
6.531834135
max memory
5.08186624E8
stage attributes
key
value
output-size
3687
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: c69e44bd14796315568835c1ffa2502984884775 mhark 20210624 unpublished Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 38 ms] (2) QTRS (3) Overlay + Local Confluence [EQUIVALENT, 0 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 11 ms] (8) QDP (9) PisEmptyProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(g(x)) -> g(f(f(x))) f(h(x)) -> h(g(x)) f'(s(x), y, y) -> f'(y, x, s(x)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(f(x_1)) = x_1 POL(f'(x_1, x_2, x_3)) = 2*x_1 + 2*x_2 + x_3 POL(g(x_1)) = x_1 POL(h(x_1)) = 2*x_1 POL(s(x_1)) = 1 + 2*x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: f'(s(x), y, y) -> f'(y, x, s(x)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(g(x)) -> g(f(f(x))) f(h(x)) -> h(g(x)) Q is empty. ---------------------------------------- (3) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(g(x)) -> g(f(f(x))) f(h(x)) -> h(g(x)) The set Q consists of the following terms: f(g(x0)) f(h(x0)) ---------------------------------------- (5) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard