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