Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relative pair #487520736
details
property
value
status
complete
benchmark
rt1-2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n148.star.cs.uiowa.edu
space
Relative_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.87989282608 seconds
cpu usage
4.286762654
max memory
3.14294272E8
stage attributes
key
value
output-size
2260
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) RelTRSRRRProof [EQUIVALENT, 22 ms] (4) RelTRS (5) RIsEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(x) -> x g(x) -> x The relative TRS consists of the following S rules: f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is f(x) -> x g(x) -> x The set of rules S is f(x) -> g(x) g(x) -> f(x) We have obtained the following relative TRS: The set of rules R is f(x) -> x g(x) -> x The set of rules S is f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(x) -> x g(x) -> x The relative TRS consists of the following S rules: f(x) -> g(x) g(x) -> f(x) ---------------------------------------- (3) RelTRSRRRProof (EQUIVALENT) We used the following monotonic ordering for rule removal: Polynomial interpretation [POLO]: POL(f(x_1)) = 1 + x_1 POL(g(x_1)) = 1 + x_1 With this ordering the following rules can be removed [MATRO] because they are oriented strictly: Rules from R: f(x) -> x g(x) -> x Rules from S: none ---------------------------------------- (4) Obligation: Relative term rewrite system:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relative