Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487072988
details
property
value
status
complete
benchmark
thiemann32.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n189.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
11.3472 seconds
cpu usage
16.5598
user time
16.0404
system time
0.519394
max virtual memory
3.6980928E7
max residence set size
799052.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox2/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) Overlay + Local Confluence [EQUIVALENT, 0 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, 1 ms] (25) QDP (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] (27) YES (28) QDP (29) UsableRulesProof [EQUIVALENT, 0 ms] (30) QDP (31) QReductionProof [EQUIVALENT, 2 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) UsableRulesProof [EQUIVALENT, 0 ms] (38) QDP (39) QReductionProof [EQUIVALENT, 0 ms] (40) QDP (41) RemovalProof [SOUND, 0 ms] (42) QDP (43) NonInfProof [EQUIVALENT, 50 ms] (44) AND (45) QDP (46) DependencyGraphProof [EQUIVALENT, 0 ms] (47) QDP (48) NonInfProof [EQUIVALENT, 0 ms] (49) QDP (50) DependencyGraphProof [EQUIVALENT, 0 ms] (51) TRUE (52) QDP (53) DependencyGraphProof [EQUIVALENT, 0 ms] (54) QDP (55) NonInfProof [EQUIVALENT, 0 ms] (56) QDP (57) DependencyGraphProof [EQUIVALENT, 0 ms] (58) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: table -> gen(s(0)) gen(x) -> if1(le(x, 10), x) if1(false, x) -> nil if1(true, x) -> if2(x, x) if2(x, y) -> if3(le(y, 10), x, y) if3(true, x, y) -> cons(entry(x, y, times(x, y)), if2(x, s(y))) if3(false, x, y) -> gen(s(x)) le(0, y) -> true le(s(x), 0) -> false le(s(x), s(y)) -> le(x, y) plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) times(0, y) -> 0 times(s(x), y) -> plus(y, times(x, y)) 10 -> s(s(s(s(s(s(s(s(s(s(0)))))))))) Q is empty. ---------------------------------------- (1) Overlay + Local Confluence (EQUIVALENT) The TRS is overlay and locally confluent. By [NOC] we can switch to innermost. ---------------------------------------- (2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard