Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Relative pair #487520751
details
property
value
status
complete
benchmark
rt2-5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Relative_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.75981402397 seconds
cpu usage
4.113796777
max memory
3.01703168E8
stage attributes
key
value
output-size
3640
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given RelTRS could be proven: (0) RelTRS (1) RelTRS Reverse [EQUIVALENT, 0 ms] (2) RelTRS (3) FlatCCProof [EQUIVALENT, 0 ms] (4) RelTRS (5) RootLabelingProof [EQUIVALENT, 0 ms] (6) RelTRS (7) RelTRSRRRProof [EQUIVALENT, 11 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: f(f(x)) -> x The relative TRS consists of the following S rules: f(x) -> g(f(g(f(x)))) ---------------------------------------- (1) RelTRS Reverse (EQUIVALENT) We have reversed the following relative TRS [REVERSE]: The set of rules R is f(f(x)) -> x The set of rules S is f(x) -> g(f(g(f(x)))) We have obtained the following relative TRS: The set of rules R is f(f(x)) -> x The set of rules S is f(x) -> f(g(f(g(x)))) ---------------------------------------- (2) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(f(x)) -> x The relative TRS consists of the following S rules: f(x) -> f(g(f(g(x)))) ---------------------------------------- (3) FlatCCProof (EQUIVALENT) We used flat context closure [ROOTLAB] ---------------------------------------- (4) Obligation: Relative term rewrite system: The relative TRS consists of the following R rules: f(f(f(x))) -> f(x) g(f(f(x))) -> g(x) The relative TRS consists of the following S rules: f(x) -> f(g(f(g(x)))) ---------------------------------------- (5) RootLabelingProof (EQUIVALENT) We used plain root labeling [ROOTLAB] with the following heuristic: LabelAll: All function symbols get labeled ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Relative