Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Outer 67415 pair #381918252
details
property
value
status
complete
benchmark
Ex1_2_AEL03_L.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n037.star.cs.uiowa.edu
space
Strategy_outermost_added_08
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.18102192879 seconds
cpu usage
2.540522843
max memory
1.79662848E8
stage attributes
key
value
output-size
2213
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, 0 ms] (2) NO ---------------------------------------- (0) Obligation: Term rewrite system R: The TRS R consists of the following rules: 2ndspos(s(N), cons(X)) -> rcons(posrecip(Y), 2ndsneg(N, Z)) 2ndsneg(s(N), cons(X)) -> rcons(negrecip(Y), 2ndspos(N, Z)) from(X) -> cons(X) 2ndspos(0, Z) -> rnil 2ndsneg(0, Z) -> rnil pi(X) -> 2ndspos(X, from(0)) plus(0, Y) -> Y plus(s(X), Y) -> s(plus(X, Y)) times(0, Y) -> 0 times(s(X), Y) -> plus(Y, times(X, Y)) square(X) -> times(X, X) Outermost Strategy. ---------------------------------------- (1) OutermostNonTerminationProof (COMPLETE) Term rewrite system R: The TRS R consists of the following rules: 2ndspos(s(N), cons(X)) -> rcons(posrecip(Y), 2ndsneg(N, Z)) 2ndsneg(s(N), cons(X)) -> rcons(negrecip(Y), 2ndspos(N, Z)) from(X) -> cons(X) 2ndspos(0, Z) -> rnil 2ndsneg(0, Z) -> rnil pi(X) -> 2ndspos(X, from(0)) plus(0, Y) -> Y plus(s(X), Y) -> s(plus(X, Y)) times(0, Y) -> 0 times(s(X), Y) -> plus(Y, times(X, Y)) square(X) -> times(X, X) Outermost Strategy. ---------- Loop: ---------- 2ndspos(s(N), cons(X)) -> rcons(posrecip(2ndspos(s(N), cons(X))), 2ndsneg(N, 2ndspos(s(N), cons(X)))) with rule 2ndspos(s(N''), cons(X'')) -> rcons(posrecip(Y), 2ndsneg(N'', Z)) at position [] and matcher [N'' / N, X'' / X, Y / 2ndspos(s(N), cons(X)), Z / 2ndspos(s(N), cons(X))] Now an instance of the first term with Matcher [ ] occurs in the last term at position [0,0]. Context: rcons(posrecip([]), 2ndsneg(N, 2ndspos(s(N), cons(X)))) 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