Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516964125
details
property
value
status
complete
benchmark
03.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n140.star.cs.uiowa.edu
space
Der95
run statistics
property
value
solver
AProVE21
configuration
standard
runtime (wallclock)
2.00708293915 seconds
cpu usage
5.160376496
max memory
4.8525312E8
stage attributes
key
value
output-size
1414
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) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (2) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: f(f(x)) -> g(f(x)) Q is empty. ---------------------------------------- (1) RFCMatchBoundsTRSProof (EQUIVALENT) Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R. The following rules were used to construct the certificate: f(f(x)) -> g(f(x)) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 1, 2, 3, 4 Node 1 is start node and node 2 is final node. Those nodes are connected through the following edges: * 1 to 3 labelled g_1(0)* 2 to 2 labelled #_1(0)* 3 to 2 labelled f_1(0)* 3 to 4 labelled g_1(1)* 4 to 2 labelled f_1(1)* 4 to 4 labelled g_1(1) ---------------------------------------- (2) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard