Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734768
details
property
value
status
complete
benchmark
Applicative_AG01_innermost__#4.10.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n004.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
Wanda
configuration
HigherOrder
runtime (wallclock)
1.7183868885 seconds
cpu usage
3.307101548
max memory
1.25943808E8
stage attributes
key
value
output-size
2138
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO We consider the system theBenchmark. Alphabet: 0 : [] --> b 1 : [] --> b cons : [e * f] --> f f : [b * c] --> a false : [] --> d filter : [e -> d * f] --> f filter2 : [d * e -> d * e * f] --> f g : [b] --> c map : [e -> e * f] --> f nil : [] --> f true : [] --> d Rules: f(x, g(x)) => f(1, g(x)) g(1) => g(0) map(h, nil) => nil map(h, cons(x, y)) => cons(h x, map(h, y)) filter(h, nil) => nil filter(h, cons(x, y)) => filter2(h x, h, x, y) filter2(true, h, x, y) => cons(x, filter(h, y)) filter2(false, h, x, y) => filter(h, y) This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0). This system is non-terminating, as demonstrated by our external first-order non-termination checker: || The following well-typed term is terminating: f(1, g(1)) || || proof of resources/system.trs || # AProVE Commit ID: 500ec9b2e2a919720cb177ef26031cb0220e008e fuhs 20130603 || || || Termination w.r.t. Q of the given QTRS could be disproven: || || (0) QTRS || (1) NonTerminationProof [EQUIVALENT, 0 ms] || (2) NO || || || ---------------------------------------- || || (0) || Obligation: || Q restricted rewrite system: || The TRS R consists of the following rules: || || f(%X, g(%X)) -> f(1, g(%X)) || g(1) -> g(0) || || Q is empty. || || ---------------------------------------- || || (1) NonTerminationProof (EQUIVALENT) || The following loops were found: || || ---------- Loop: ---------- || || f(1, g(1)) -> f(1, g(1)) with rule f(%X, g(%X)) -> f(1, g(%X)) at position [] and matcher [%X / 1] || || Now an instance of the first term with Matcher [ ] occurs in the last term at position []. || || Context: [] || || || ---------------------------------------- || || (2) || NO ||
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS union beta 16688