Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719840
details
property
value
status
complete
benchmark
z123.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n088.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.05757021904 seconds
cpu usage
12.22978527
max memory
1.1715584E9
stage attributes
key
value
output-size
6758
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, 38 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 21 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) QDP (9) MRRProof [EQUIVALENT, 29 ms] (10) QDP (11) QDPOrderProof [EQUIVALENT, 62 ms] (12) QDP (13) DependencyGraphProof [EQUIVALENT, 0 ms] (14) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> a(f(x1)) b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) c(d(d(x1))) -> f(x1) f(f(x1)) -> f(a(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(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> f(a(x1)) b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) d(d(c(x1))) -> f(x1) f(f(x1)) -> a(f(x1)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(a(x_1)) = 39 + x_1 POL(b(x_1)) = 26 + x_1 POL(c(x_1)) = 17 + x_1 POL(d(x_1)) = 11 + x_1 POL(f(x_1)) = 39 + x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: b(b(x1)) -> c(c(c(x1))) c(c(x1)) -> d(d(d(x1))) ---------------------------------------- (4) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: a(a(x1)) -> b(b(b(x1))) a(x1) -> d(c(d(x1))) b(b(b(x1))) -> f(a(x1)) d(d(c(x1))) -> f(x1) f(f(x1)) -> a(f(x1))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685