Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710630
details
property
value
status
complete
benchmark
thiemann25.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n109.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.42274284363 seconds
cpu usage
6.072597757
max memory
3.0844928E8
stage attributes
key
value
output-size
17460
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) Overlay + Local Confluence [EQUIVALENT, 15 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) QDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) QDP (10) QReductionProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QReductionProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) QDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) QDP (24) QReductionProof [EQUIVALENT, 0 ms] (25) QDP (26) NonInfProof [EQUIVALENT, 51 ms] (27) AND (28) QDP (29) DependencyGraphProof [EQUIVALENT, 0 ms] (30) TRUE (31) QDP (32) DependencyGraphProof [EQUIVALENT, 0 ms] (33) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) lt(0, s(y)) -> true lt(x, 0) -> false lt(s(x), s(y)) -> lt(x, y) fib(x) -> fibiter(x, 0, 0, s(0)) fibiter(b, c, x, y) -> if(lt(c, b), b, c, x, y) if(false, b, c, x, y) -> x if(true, b, c, x, y) -> fibiter(b, s(c), y, plus(x, y)) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) lt(0, s(y)) -> true lt(x, 0) -> false lt(s(x), s(y)) -> lt(x, y) fib(x) -> fibiter(x, 0, 0, s(0)) fibiter(b, c, x, y) -> if(lt(c, b), b, c, x, y) if(false, b, c, x, y) -> x if(true, b, c, x, y) -> fibiter(b, s(c), y, plus(x, y)) The set Q consists of the following terms: plus(0, x0) plus(s(x0), x1) lt(0, s(x0)) lt(x0, 0) lt(s(x0), s(x1)) fib(x0) fibiter(x0, x1, x2, x3) if(false, x0, x1, x2, x3) if(true, x0, x1, x2, x3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472