Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487069963
details
property
value
status
complete
benchmark
Ex4_4_Luc96b_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n182.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.81238 seconds
cpu usage
3.92137
user time
3.74315
system time
0.178223
max virtual memory
1.8343148E7
max residence set size
246976.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 63 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 2 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(g(X), Y)) -> mark(f(X, f(g(X), Y))) active(f(X1, X2)) -> f(active(X1), X2) active(g(X)) -> g(active(X)) f(mark(X1), X2) -> mark(f(X1, X2)) g(mark(X)) -> mark(g(X)) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(g(X)) -> g(proper(X)) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(active(x_1)) = 1 + 2*x_1 POL(f(x_1, x_2)) = x_1 + x_2 POL(g(x_1)) = x_1 POL(mark(x_1)) = x_1 POL(ok(x_1)) = 1 + 2*x_1 POL(proper(x_1)) = x_1 POL(top(x_1)) = x_1 With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: active(f(g(X), Y)) -> mark(f(X, f(g(X), Y))) f(ok(X1), ok(X2)) -> ok(f(X1, X2)) ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(X1, X2)) -> f(active(X1), X2) active(g(X)) -> g(active(X)) f(mark(X1), X2) -> mark(f(X1, X2)) g(mark(X)) -> mark(g(X)) proper(f(X1, X2)) -> f(proper(X1), proper(X2)) proper(g(X)) -> g(proper(X)) g(ok(X)) -> ok(g(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Knuth-Bendix order [KBO] with precedence:proper_1 > top_1 > active_1 > g_1 > ok_1 > f_2 > mark_1 and weight map: active_1=2 g_1=4 mark_1=1 proper_1=0 ok_1=3 top_1=1 f_2=0 The variable weight is 1With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: active(f(X1, X2)) -> f(active(X1), X2) active(g(X)) -> g(active(X)) f(mark(X1), X2) -> mark(f(X1, X2)) g(mark(X)) -> mark(g(X)) proper(f(X1, X2)) -> f(proper(X1), proper(X2))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard