Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718015
details
property
value
status
complete
benchmark
torpa4.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n002.star.cs.uiowa.edu
space
Secret_05_SRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.33812499046 seconds
cpu usage
9.819575232
max memory
9.27338496E8
stage attributes
key
value
output-size
7226
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) QTRSRRRProof [EQUIVALENT, 28 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 5 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) QDPOrderProof [EQUIVALENT, 33 ms] (10) QDP (11) DependencyGraphProof [EQUIVALENT, 0 ms] (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(b(c(a(x1)))) -> b(a(c(b(a(b(x1)))))) a(d(x1)) -> c(x1) a(f(f(x1))) -> g(x1) b(g(x1)) -> g(b(x1)) c(x1) -> f(f(x1)) c(a(c(x1))) -> b(c(a(b(c(x1))))) c(d(x1)) -> a(a(x1)) g(x1) -> c(a(x1)) g(x1) -> d(d(d(d(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(c(b(a(x1)))) -> b(a(b(c(a(b(x1)))))) d(a(x1)) -> c(x1) f(f(a(x1))) -> g(x1) g(b(x1)) -> b(g(x1)) c(x1) -> f(f(x1)) c(a(c(x1))) -> c(b(a(c(b(x1))))) d(c(x1)) -> a(a(x1)) g(x1) -> a(c(x1)) g(x1) -> d(d(d(d(x1)))) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 12 + x_1 POL(b(x_1)) = x_1 POL(c(x_1)) = 18 + x_1 POL(d(x_1)) = 7 + x_1 POL(f(x_1)) = 9 + x_1 POL(g(x_1)) = 30 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: d(a(x1)) -> c(x1) d(c(x1)) -> a(a(x1)) g(x1) -> d(d(d(d(x1)))) ---------------------------------------- (4) Obligation: Q restricted rewrite system:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685