Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918174
details
property
value
status
complete
benchmark
ttt1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.26628088951 seconds
cpu usage
2.878612937
max memory
2.12287488E8
stage attributes
key
value
output-size
1880
starexec-result
NO
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Outermost Termination of the given OTRS could be disproven: (0) OTRS (1) OutermostNonTerminationProof [COMPLETE, 56 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: f(s(a), s(b), x) -> f(x, x, x) g(f(s(x), s(y), z)) -> g(f(x, y, z)) cons(x, y) -> x cons(x, y) -> y Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: f(s(a), s(b), x) -> f(x, x, x) g(f(s(x), s(y), z)) -> g(f(x, y, z)) cons(x, y) -> x cons(x, y) -> y Outermost Strategy. ---------- Loop: ---------- f(cons(s(a), s(b)), cons(s(a), s(b)), cons(s(a), s(b))) -> f(cons(s(a), s(b)), s(b), cons(s(a), s(b))) with rule cons(x', y') -> y' at position [1] and matcher [x' / s(a), y' / s(b)] f(cons(s(a), s(b)), s(b), cons(s(a), s(b))) -> f(s(a), s(b), cons(s(a), s(b))) with rule cons(x', y) -> x' at position [0] and matcher [x' / s(a), y / s(b)] f(s(a), s(b), cons(s(a), s(b))) -> f(cons(s(a), s(b)), cons(s(a), s(b)), cons(s(a), s(b))) with rule f(s(a), s(b), x) -> f(x, x, x) at position [] and matcher [x / cons(s(a), s(b))] Now an instance of the first term with Matcher [ ] occurs in the last term at position []. Context: [] We used [THIEMANN_LOOPS_UNDER_STRATEGIES] to show that this Loop is an Outermost-Loop. ---------------------------------------- (2) NO
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Outer 67415