Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711762
details
property
value
status
complete
benchmark
001.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n020.star.cs.uiowa.edu
space
AotoYamada_05
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.97303295135 seconds
cpu usage
4.649743761
max memory
3.19942656E8
stage attributes
key
value
output-size
5153
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) QTRS (1) Overlay + Local Confluence [EQUIVALENT, 0 ms] (2) QTRS (3) DependencyPairsProof [EQUIVALENT, 0 ms] (4) QDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) QDP (7) QDPOrderProof [EQUIVALENT, 12 ms] (8) QDP (9) MNOCProof [EQUIVALENT, 0 ms] (10) QDP (11) NonTerminationLoopProof [COMPLETE, 0 ms] (12) NO ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x))) 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: app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x))) The set Q consists of the following terms: app(app(iterate, x0), x1) ---------------------------------------- (3) DependencyPairsProof (EQUIVALENT) Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem. ---------------------------------------- (4) Obligation: Q DP problem: The TRS P consists of the following rules: APP(app(iterate, f), x) -> APP(app(cons, x), app(app(iterate, f), app(f, x))) APP(app(iterate, f), x) -> APP(cons, x) APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x)) APP(app(iterate, f), x) -> APP(f, x) The TRS R consists of the following rules: app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x))) The set Q consists of the following terms: app(app(iterate, x0), x1) We have to consider all minimal (P,Q,R)-chains. ---------------------------------------- (5) DependencyGraphProof (EQUIVALENT) The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes. ---------------------------------------- (6) Obligation: Q DP problem: The TRS P consists of the following rules: APP(app(iterate, f), x) -> APP(f, x) APP(app(iterate, f), x) -> APP(app(iterate, f), app(f, x)) The TRS R consists of the following rules: app(app(iterate, f), x) -> app(app(cons, x), app(app(iterate, f), app(f, x)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472