Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712667
details
property
value
status
complete
benchmark
JFP_Ex31.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n010.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
53.3174159527 seconds
cpu usage
129.965208709
max memory
4.839063552E9
stage attributes
key
value
output-size
58745
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, 0 ms] (2) QDP (3) DependencyGraphProof [EQUIVALENT, 0 ms] (4) AND (5) QDP (6) UsableRulesProof [EQUIVALENT, 0 ms] (7) QDP (8) QDPSizeChangeProof [EQUIVALENT, 0 ms] (9) YES (10) QDP (11) UsableRulesProof [EQUIVALENT, 0 ms] (12) QDP (13) QDPSizeChangeProof [EQUIVALENT, 0 ms] (14) YES (15) QDP (16) UsableRulesProof [EQUIVALENT, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) QDP (21) UsableRulesReductionPairsProof [EQUIVALENT, 28 ms] (22) QDP (23) TransformationProof [EQUIVALENT, 0 ms] (24) QDP (25) DependencyGraphProof [EQUIVALENT, 0 ms] (26) QDP (27) TransformationProof [EQUIVALENT, 0 ms] (28) QDP (29) DependencyGraphProof [EQUIVALENT, 0 ms] (30) QDP (31) SemLabProof [SOUND, 13.0 s] (32) QDP (33) DependencyGraphProof [EQUIVALENT, 0 ms] (34) QDP (35) QDPOrderProof [EQUIVALENT, 0 ms] (36) QDP (37) QDPOrderProof [EQUIVALENT, 15 ms] (38) QDP (39) QDPOrderProof [EQUIVALENT, 0 ms] (40) QDP (41) QDPOrderProof [EQUIVALENT, 18 ms] (42) QDP (43) QDPOrderProof [EQUIVALENT, 0 ms] (44) QDP (45) QDPOrderProof [EQUIVALENT, 4 ms] (46) QDP (47) PisEmptyProof [EQUIVALENT, 0 ms] (48) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: active(f(b, c, x)) -> mark(f(x, x, x)) active(f(x, y, z)) -> f(x, y, active(z)) active(d) -> m(b) f(x, y, mark(z)) -> mark(f(x, y, z)) active(d) -> mark(c) proper(b) -> ok(b) proper(c) -> ok(c) proper(d) -> ok(d) proper(f(x, y, z)) -> f(proper(x), proper(y), proper(z)) f(ok(x), ok(y), ok(z)) -> ok(f(x, y, z)) top(mark(x)) -> top(proper(x)) top(ok(x)) -> top(active(x)) 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: ACTIVE(f(b, c, x)) -> F(x, x, x) ACTIVE(f(x, y, z)) -> F(x, y, active(z)) ACTIVE(f(x, y, z)) -> ACTIVE(z)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472