Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381721838
details
property
value
status
complete
benchmark
abaababa-aabababaab.srs.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Wenzel_16
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.71175289154 seconds
cpu usage
3.731270968
max memory
2.09727488E8
stage attributes
key
value
output-size
3068
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRS Reverse [EQUIVALENT, 0 ms] (2) QTRS (3) Strip Symbols Proof [SOUND, 0 ms] (4) QTRS (5) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(a(b(a(b(a(x1)))))))) -> a(a(b(a(b(a(b(a(a(b(x1)))))))))) Q is empty. ---------------------------------------- (1) QTRS Reverse (EQUIVALENT) We applied the QTRS Reverse Processor [REVERSE]. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(b(a(a(b(a(x1)))))))) -> b(a(a(b(a(b(a(b(a(a(x1)))))))))) Q is empty. ---------------------------------------- (3) Strip Symbols Proof (SOUND) We were given the following TRS: a(b(a(b(a(a(b(a(x1)))))))) -> b(a(a(b(a(b(a(b(a(a(x1)))))))))) By stripping symbols from the only rule of the system, we obtained the following TRS [ENDRULLIS]: a(b(a(b(a(a(b(x))))))) -> b(a(a(b(a(b(a(b(a(x))))))))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(a(b(a(a(b(x))))))) -> b(a(a(b(a(b(a(b(a(x))))))))) Q is empty. ---------------------------------------- (5) 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: a(b(a(b(a(a(b(x))))))) -> b(a(a(b(a(b(a(b(a(x))))))))) The certificate found is represented by the following graph. The certificate consists of the following enumerated nodes: 323, 324, 333, 334, 335, 336, 337, 338, 339, 340, 397, 398, 399, 400, 401, 402, 403, 404 Node 323 is start node and node 324 is final node. Those nodes are connected through the following edges: * 323 to 333 labelled b_1(0)* 324 to 324 labelled #_1(0)* 333 to 334 labelled a_1(0)* 334 to 335 labelled a_1(0)* 335 to 336 labelled b_1(0)* 336 to 337 labelled a_1(0)* 336 to 397 labelled b_1(1)* 337 to 338 labelled b_1(0)* 338 to 339 labelled a_1(0)* 338 to 397 labelled b_1(1)* 339 to 340 labelled b_1(0)* 340 to 324 labelled a_1(0)* 340 to 397 labelled b_1(1)* 397 to 398 labelled a_1(1)* 398 to 399 labelled a_1(1)* 399 to 400 labelled b_1(1)* 400 to 401 labelled a_1(1)* 400 to 397 labelled b_1(1)* 401 to 402 labelled b_1(1)* 402 to 403 labelled a_1(1)* 402 to 397 labelled b_1(1)* 403 to 404 labelled b_1(1)* 404 to 324 labelled a_1(1)* 404 to 397 labelled b_1(1) ---------------------------------------- (6) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685