Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711623
details
property
value
status
complete
benchmark
5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n016.star.cs.uiowa.edu
space
Secret_07_TRS
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
17.6073520184 seconds
cpu usage
47.146671401
max memory
3.984306176E9
stage attributes
key
value
output-size
21231
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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) DependencyPairsProof [EQUIVALENT, 23 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) TransformationProof [EQUIVALENT, 0 ms] (9) QDP (10) DependencyGraphProof [EQUIVALENT, 0 ms] (11) TRUE (12) QDP (13) UsableRulesProof [EQUIVALENT, 0 ms] (14) QDP (15) TransformationProof [EQUIVALENT, 0 ms] (16) QDP (17) DependencyGraphProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPOrderProof [EQUIVALENT, 179 ms] (20) QDP (21) PisEmptyProof [EQUIVALENT, 0 ms] (22) YES (23) QDP (24) UsableRulesProof [EQUIVALENT, 0 ms] (25) QDP (26) QDPOrderProof [EQUIVALENT, 23 ms] (27) QDP (28) PisEmptyProof [EQUIVALENT, 0 ms] (29) YES (30) QDP (31) UsableRulesProof [EQUIVALENT, 0 ms] (32) QDP (33) TransformationProof [EQUIVALENT, 0 ms] (34) QDP (35) TransformationProof [EQUIVALENT, 0 ms] (36) QDP (37) TransformationProof [EQUIVALENT, 0 ms] (38) QDP (39) DependencyGraphProof [EQUIVALENT, 0 ms] (40) QDP (41) TransformationProof [EQUIVALENT, 0 ms] (42) QDP (43) TransformationProof [EQUIVALENT, 0 ms] (44) QDP (45) TransformationProof [EQUIVALENT, 0 ms] (46) QDP (47) DependencyGraphProof [EQUIVALENT, 0 ms] (48) TRUE ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: g(x, x, x) -> g(c, d, e) g(x, y, x) -> g(c, d, e) s(f(x, y)) -> f(y, f(s(s(x)), a)) h(h(x, a), y) -> h(h(a, y), h(a, x)) f(x, f(y, f(x, y))) -> f(a, f(x, f(y, b))) f(h(a, y), g(x, b, a)) -> h(f(x, s(y)), s(b)) h(f(x, s(y)), b) -> f(a, g(y, a, f(s(x), a))) f(x, g(x, a, f(s(x), y))) -> f(h(x, b), g(a, b, y)) s(y) -> b Q is empty. ---------------------------------------- (1) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (2) Obligation: Q DP problem: The TRS P consists of the following rules: G(x, x, x) -> G(c, d, e) G(x, y, x) -> G(c, d, e) S(f(x, y)) -> F(y, f(s(s(x)), a)) S(f(x, y)) -> F(s(s(x)), a) S(f(x, y)) -> S(s(x)) S(f(x, y)) -> S(x)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472