Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381721388
details
property
value
status
complete
benchmark
baababaab-ababaabaabab.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n085.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.6309940815 seconds
cpu usage
3.873318109
max memory
2.67993088E8
stage attributes
key
value
output-size
2740
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) Strip Symbols Proof [SOUND, 0 ms] (2) QTRS (3) RFCMatchBoundsTRSProof [EQUIVALENT, 5 ms] (4) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(a(b(a(b(a(a(b(x1))))))))) -> a(b(a(b(a(a(b(a(a(b(a(b(x1)))))))))))) Q is empty. ---------------------------------------- (1) Strip Symbols Proof (SOUND) We were given the following TRS: b(a(a(b(a(b(a(a(b(x1))))))))) -> a(b(a(b(a(a(b(a(a(b(a(b(x1)))))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: b(a(a(b(a(b(a(a(x)))))))) -> a(b(a(b(a(a(b(a(a(b(a(x))))))))))) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: b(a(a(b(a(b(a(a(x)))))))) -> a(b(a(b(a(a(b(a(a(b(a(x))))))))))) Q is empty. ---------------------------------------- (3) 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: b(a(a(b(a(b(a(a(x)))))))) -> a(b(a(b(a(a(b(a(a(b(a(x))))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90 Node 69 is start node and node 70 is final node. Those nodes are connected through the following edges: * 69 to 71 labelled a_1(0)* 70 to 70 labelled #_1(0)* 71 to 72 labelled b_1(0)* 72 to 73 labelled a_1(0)* 73 to 74 labelled b_1(0)* 74 to 75 labelled a_1(0)* 75 to 76 labelled a_1(0)* 76 to 77 labelled b_1(0)* 76 to 81 labelled a_1(1)* 77 to 78 labelled a_1(0)* 78 to 79 labelled a_1(0)* 79 to 80 labelled b_1(0)* 79 to 81 labelled a_1(1)* 80 to 70 labelled a_1(0)* 81 to 82 labelled b_1(1)* 82 to 83 labelled a_1(1)* 83 to 84 labelled b_1(1)* 84 to 85 labelled a_1(1)* 85 to 86 labelled a_1(1)* 86 to 87 labelled b_1(1)* 86 to 81 labelled a_1(1)* 87 to 88 labelled a_1(1)* 88 to 89 labelled a_1(1)* 89 to 90 labelled b_1(1)* 89 to 81 labelled a_1(1)* 90 to 70 labelled a_1(1) ---------------------------------------- (4) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685