Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712312
details
property
value
status
complete
benchmark
Liveness6.1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.38258910179 seconds
cpu usage
18.222665318
max memory
2.168397824E9
stage attributes
key
value
output-size
11926
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, 11 ms] (4) QTRS (5) DependencyPairsProof [EQUIVALENT, 27 ms] (6) QDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) QDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) QDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) QDP (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] (18) YES (19) QDP (20) UsableRulesProof [EQUIVALENT, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) QDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) QDP (27) QDPOrderProof [EQUIVALENT, 23 ms] (28) QDP (29) PisEmptyProof [EQUIVALENT, 0 ms] (30) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: top(free(x)) -> top(check(new(x))) new(free(x)) -> free(new(x)) old(free(x)) -> free(old(x)) new(serve) -> free(serve) old(serve) -> free(serve) check(free(x)) -> free(check(x)) check(new(x)) -> new(check(x)) check(old(x)) -> old(check(x)) check(old(x)) -> old(x) 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: free(top(x)) -> new(check(top(x))) free(new(x)) -> new(free(x)) free(old(x)) -> old(free(x)) serve'(new(x)) -> serve'(free(x)) serve'(old(x)) -> serve'(free(x)) free(check(x)) -> check(free(x)) new(check(x)) -> check(new(x)) old(check(x)) -> check(old(x)) old(check(x)) -> old(x) Q is empty. ---------------------------------------- (3) QTRSRRRProof (EQUIVALENT) Used ordering: Polynomial interpretation [POLO]: POL(check(x_1)) = x_1 POL(free(x_1)) = x_1 POL(new(x_1)) = x_1 POL(old(x_1)) = 1 + x_1 POL(serve'(x_1)) = x_1 POL(top(x_1)) = x_1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472