Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS_Innermost 2019-03-28 22.12 pair #432271248
details
property
value
status
complete
benchmark
Ex25_Luc06_C.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
Transformed_CSR_innermost_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.87362 seconds
cpu usage
4.08084
user time
3.88818
system time
0.192656
max virtual memory
1.8874836E7
max residence set size
285632.0
stage attributes
key
value
starexec-result
YES
output
3.87/1.80 YES 3.99/1.83 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 3.99/1.83 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.99/1.83 3.99/1.83 3.99/1.83 Termination w.r.t. Q of the given QTRS could be proven: 3.99/1.83 3.99/1.83 (0) QTRS 3.99/1.83 (1) QTRS Reverse [SOUND, 0 ms] 3.99/1.83 (2) QTRS 3.99/1.83 (3) RFCMatchBoundsTRSProof [EQUIVALENT, 0 ms] 3.99/1.83 (4) YES 3.99/1.83 3.99/1.83 3.99/1.83 ---------------------------------------- 3.99/1.83 3.99/1.83 (0) 3.99/1.83 Obligation: 3.99/1.83 Q restricted rewrite system: 3.99/1.83 The TRS R consists of the following rules: 3.99/1.83 3.99/1.83 active(f(f(X))) -> mark(c(f(g(f(X))))) 3.99/1.83 active(c(X)) -> mark(d(X)) 3.99/1.83 active(h(X)) -> mark(c(d(X))) 3.99/1.83 active(f(X)) -> f(active(X)) 3.99/1.83 active(h(X)) -> h(active(X)) 3.99/1.83 f(mark(X)) -> mark(f(X)) 3.99/1.83 h(mark(X)) -> mark(h(X)) 3.99/1.83 proper(f(X)) -> f(proper(X)) 3.99/1.83 proper(c(X)) -> c(proper(X)) 3.99/1.83 proper(g(X)) -> g(proper(X)) 3.99/1.83 proper(d(X)) -> d(proper(X)) 3.99/1.83 proper(h(X)) -> h(proper(X)) 3.99/1.83 f(ok(X)) -> ok(f(X)) 3.99/1.83 c(ok(X)) -> ok(c(X)) 3.99/1.83 g(ok(X)) -> ok(g(X)) 3.99/1.83 d(ok(X)) -> ok(d(X)) 3.99/1.83 h(ok(X)) -> ok(h(X)) 3.99/1.83 top(mark(X)) -> top(proper(X)) 3.99/1.83 top(ok(X)) -> top(active(X)) 3.99/1.83 3.99/1.83 The set Q consists of the following terms: 3.99/1.83 3.99/1.83 active(c(x0)) 3.99/1.83 active(h(x0)) 3.99/1.83 active(f(x0)) 3.99/1.83 f(mark(x0)) 3.99/1.83 h(mark(x0)) 3.99/1.83 proper(f(x0)) 3.99/1.83 proper(c(x0)) 3.99/1.83 proper(g(x0)) 3.99/1.83 proper(d(x0)) 3.99/1.83 proper(h(x0)) 3.99/1.83 f(ok(x0)) 3.99/1.83 c(ok(x0)) 3.99/1.83 g(ok(x0)) 3.99/1.83 d(ok(x0)) 3.99/1.83 h(ok(x0)) 3.99/1.83 top(mark(x0)) 3.99/1.83 top(ok(x0)) 3.99/1.83 3.99/1.83 3.99/1.83 ---------------------------------------- 3.99/1.83 3.99/1.83 (1) QTRS Reverse (SOUND) 3.99/1.83 We applied the QTRS Reverse Processor [REVERSE]. 3.99/1.83 ---------------------------------------- 3.99/1.83 3.99/1.83 (2) 3.99/1.83 Obligation: 3.99/1.83 Q restricted rewrite system: 3.99/1.83 The TRS R consists of the following rules: 3.99/1.83 3.99/1.83 f(f(active(X))) -> f(g(f(c(mark(X))))) 3.99/1.83 c(active(X)) -> d(mark(X)) 3.99/1.83 h(active(X)) -> d(c(mark(X))) 3.99/1.83 f(active(X)) -> active(f(X)) 3.99/1.83 h(active(X)) -> active(h(X)) 3.99/1.83 mark(f(X)) -> f(mark(X)) 3.99/1.83 mark(h(X)) -> h(mark(X)) 3.99/1.83 f(proper(X)) -> proper(f(X)) 3.99/1.83 c(proper(X)) -> proper(c(X)) 3.99/1.83 g(proper(X)) -> proper(g(X)) 3.99/1.83 d(proper(X)) -> proper(d(X)) 3.99/1.83 h(proper(X)) -> proper(h(X)) 3.99/1.83 ok(f(X)) -> f(ok(X)) 3.99/1.83 ok(c(X)) -> c(ok(X)) 3.99/1.83 ok(g(X)) -> g(ok(X)) 3.99/1.83 ok(d(X)) -> d(ok(X)) 3.99/1.83 ok(h(X)) -> h(ok(X)) 3.99/1.83 mark(top(X)) -> proper(top(X)) 3.99/1.83 ok(top(X)) -> active(top(X)) 3.99/1.83 3.99/1.83 Q is empty. 3.99/1.83 3.99/1.83 ---------------------------------------- 3.99/1.83 3.99/1.83 (3) RFCMatchBoundsTRSProof (EQUIVALENT) 3.99/1.83 Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 4. This implies Q-termination of R. 3.99/1.83 The following rules were used to construct the certificate:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS_Innermost 2019-03-28 22.12